Reminds me of Rich Hickey's clojure data structures. Yes, they're technically log_32(n) complexity, but it turns out log 32 is basically flat on any normal machine, thus "practically constant".
Reminds me of Rich Hickey's clojure data structures. Yes, they're technically log_32(n) complexity, but it turns out log 32 is basically flat on any normal machine, thus "practically constant".
Do you maybe have an article on these data structures? It sounds really interesting.
Not OP but maybe those are Bitmapped Vector Tries: https://www.infoq.com/presentations/Functional-Data-Structur...
HAMTs: https://en.wikipedia.org/wiki/Hash_array_mapped_trie