News for hackers. Stuff that matters.
Re:Show HN: Array with Constant Time Access and Fast Inserti... by carl8 on Wednesday September 04, 2019 @03:59AM (#20874963)
I wonder how this would compare to Judy arrays. Would anyone like to benchmark this?

https://en.wikipedia.org/wiki/Judy_array http://judy.sourceforge.net

To install the Judy C lib:

  brew install judy
  apt-get install libjudy-dev
Then compile with -lJudy and #include <Judy.h>

Example: http://judy.sourceforge.net/doc/JudyL_3x.htm

Re:Show HN: Array with Constant Time Access and Fast Inserti... by proverbialbunny on Wednesday September 04, 2019 @10:12AM (#20877368)
Interesting. I wonder how similar a Judy array is to an rrb-tree (relaxed radix binary tree), or if they're the same thing.

An rrb-tree is an effective O(1) time for every category. Scala's Vector type implements one.

If interested about the data structure: https://youtu.be/sPhpelUfu8Q

Scala bigO doc: https://docs.scala-lang.org/overviews/collections-2.13/perfo... Scala's doc on it: https://github.com/nicolasstucki/scala-rrb-vector/blob/maste...