4 ms·
Or you could go the Clojure route and do the tree-style immutable vectors where the cost is log32(N) for most operations, small enough in all the relevant oper
by gleenn 4y ago
Or you could go the Clojure route and do the tree-style immutable vectors where the cost is log32(N) for most operations, small enough in all the relevant operations, and you get the amazing usability of immutable data structures that are performant enough in most cases.
- kazinator 4y agoHow does that scale down to small sequences of under ten items?
- Jim_Heckler 4y agoan array is used for the last 1-32 elements of the vector (the "tail") so there would be no trie at all, just the tail