@Paradox afaiks btree mostly organize themselves for knowing the right and left id to them, that's a way of indexing ids/keys
Here's I'm more in an abstract way, as I already make my tree sit on a key-value store on top of a btree
Just wondered if this specific kind of tree was something already implemented so I could read on it
@Paradox well, uh, sorry to not by clear
I will use the terminologies I used in my code uh :
- I have "nodes", nodes have an unique id, the id of their parent, a content, and optionally a target
- this allow me to move them freely, without having to worry their parents lose track of them. (eg if I had a list of children in the parent, I would have to change multiples parents to move a children)
- this also allow me to build a tree, by starting from the root, I ask all the node that have the root for parent, and then repeat the operation
- this also allow me to do shortcuts, with this "target" stuff I could point it to any node
@Paradox well, child itself doesn't really exist, it's done with an index lol ("who have X for parent ?"), so yeah the parent vertice isn't aware of it's children
I wanna keep most of the stuff in "one operation", aka I just need to change one vertice to change all the data needed
I was just wondering if it had a name, since everything I do, I discover few month later some wizard in the last decade invented it too lol
@na sinon ouais utiliser un langage de dev pk pas mais bon erhhhh flemme
J'veuw le truc de ddg en local quoi mdr
Nerd |🔻| 🏳️🌈 | 🕹️ | 🇫🇷 | il/he
My posts are gone after 30 days
It's pronounced ʁaʁyʁe.
And written RaRuRe, or R3 for short.
You can find more infos on this place by clicking there.