rtheunissen 2 days ago

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

bjoli 2 days ago

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.

  • bruce343434 2 days ago

    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.

lbindreiter 2 days ago

What tool were those tree structure Illustrations created with? They look really nice!

  • p-hk 2 days ago

    Thanks! I used draw.io and tweaked a number of the display properties to make it look more like Excalidraw.

    • anentropic a day ago

      I love the styling of this blog post generally too - simple, attractive and pleasant to read - kudos

    • dlisboa 21 hours ago

      Did you do them by hand or use some algorithmic way to construct them?

  • jasonjmcghee 2 days ago

    Not the author, but looks similar to excalidraw.

  • b0in 2 days ago

    this looks like draw.io with a custom font. edit: nope, i'm wrong, its excalidraw but the effect is almost identical in draw.io.