Relaxed Radix Balanced Trees (2024)

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 course, but also number of bytes copied etc.

https://rtheunissen.github.io/bst

I can't vouch for them, but there are Clojure[1] and C[2] implementations you might consider.

[1] https://github.com/clojure/core.rrb-vector

[2] https://github.com/hyPiRion/c-rrb

This guide is absolutely fantastic, thank you! You should post it if it hasn't been.

Thanks for this resource!

It has, and a pretty good discussion: https://news.ycombinator.com/item?id=37130200

Here’s one in Java: https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna...