Viewing profile — rtheunissen

I would love to add a good RRB implementation to the persistent benchmarks at [1] to get a state-of-the-art comparison between RRB and BST in a persistent context. Duration, of cou…

Practice, the more you use them the easier they become. I never studied them but knew when to use them, then just tinkered and iterated until the pattern did what I needed it to. A…

Learning a lot here, thank you.

That does not mean that b-trees are unequivocally better than binary search trees. There are some applications, like concurrency or persistence, where comparison count is not as im…

I love the various top-down binary search tree partition/split/join algorithms. https://github.com/rtheunissen/bst/blob/main/trees%2Fbalance...

Zip trees are novel but their performance (and therefore also skip lists, since they are isomorphic) lacks behind other linked structures like Treaps and especially LBSTs. [1] I pe…

Maybe it is because the simple way requires knowledge of packages, which are covered later perhaps, since many tutorials go straight to "go run helloworld.go"

Might be a CMS of some kind because I doubt anyone would purposefully type out "alt text".

That was how I received your feedback. :) My inclination towards lower abstraction in this project is entirely for the sake of reading and reference, to minimize the need for the r…

Thank you for sharing this resource, I was not aware of it. I am happy to see the inclusion of LBSTs there too. Re: binary symmetry, if I'm understanding correctly, another author …

I was inspired by Stick & Rudder , which is a very easy book to recommend to most people in this community. I'm sure I'll keep coming back to make adjustments, but the end result i…

Haha true, that's a good point. There's also WAVL and RAVL for weak AVL and relaxed AVL, but no equivalent acronyms for the red-black variants. RRB is the same as Relaxed Radix-Bal…

Part 2 defines that "a node is logarithmically weight-balanced if the binary log of the weights of its subtrees differ by no more than 1" and references Roura directly there. Roura…

What if some future technology or material breakthrough provides a sort of self-adjusting liquid memory that provides true constant time access to any address? I'm not being entire…

This has now been fixed, thank you for reminding me.

You are correct, they have not been covered yet . I've added a note in the "work in progress" section. There are also LLRB trees that would be interesting to see compared within th…

This is tragic! Supporting noscript was a primary design goal but I forgot to only enable the knuth/plass justification in print media. The math expressions I'm moving to build tim…

I believe yes, as illustrated in [1]. This idea only works in a static sense, because to insert a value suffers from the same linear movement of memory as dynamic arrays. B-trees a…

That is true, but in a persistent setting they likely also copy more data, and iterator invalidation might be a concern in some cases when moving values around within a B-tree node…

I started this project many years ago when I was coming up with ideas for immutable data structures for the PHP data structures extension [1]. I wanted to support access by positio…