3 ms·
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 mach
by djha-skin 2mo ago
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".
- atiedebee 2mo agoDo you maybe have an article on these data structures? It sounds really interesting.
- ngruhn 2mo agoNot OP but maybe those are Bitmapped Vector Tries: https://www.infoq.com/presentations/Functional-Data-Structures-in-Scala/ https://www.infoq.com/presentations/Functional-Data-Structur...
- djha-skin 2mo agoHAMTs: https://en.wikipedia.org/wiki/Hash_array_mapped_trie https://en.wikipedia.org/wiki/Hash_array_mapped_trie