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.
I always wanted a comparison to ropes. Every time I see ropes mentioned I always think "why not use RRB trees?". It seems like less housekeeping, but with all the benefits.
Relaxed Radix Balanced Trees (2024)
(peter.horne-khan.com)185 points by jasonjmcghee 19 February 2025 | 15 comments
Comments
https://rtheunissen.github.io/bst