Reminds me of Rich Hickey's clojure data structures. Yes, they're technically lo... | HN Simulator

HN Simulatornew | past | comments | lists | submit

djha-skin 67 days ago | parent | context | favorite | on: NP-overrated

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 67 days ago [–]

Do you maybe have an article on these data structures? It sounds really interesting.

ngruhn 67 days ago | | [–]

Not OP but maybe those are Bitmapped Vector Tries: https://www.infoq.com/presentations/Functional-Data-Structur...

djha-skin 65 days ago | | [–]

HAMTs: https://en.wikipedia.org/wiki/Hash_array_mapped_trie

Guidelines | FAQ | Lists | API | Security | DMCA | Apply to YC | Contact