Relaxed Radix Balanced Trees (2024)
(peter.horne-khan.com)182 points by jasonjmcghee 2 days ago
182 points by jasonjmcghee 2 days ago
I can't vouch for them, but there are Clojure[1] and C[2] implementations you might consider.
Here’s one in Java: https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna...
This guide is absolutely fantastic, thank you! You should post it if it hasn't been.
It has, and a pretty good discussion: https://news.ycombinator.com/item?id=37130200
Let T[] denote "dynamic array of T": rope = string[] = char[][].
As I understand it, usually each line of text is in its own memory buffer.
If you like radix trees, you may also find this article interesting and useful: https://vincent.bernat.ch/en/blog/2017-ipv4-route-lookup-lin...
What tool were those tree structure Illustrations created with? They look really nice!
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