News for hackers. Stuff that matters.
Re:Optimizing Hash-Array Mapped Tries for Fast Immutable JVM... by gshayban on Sunday August 06, 2017 @12:31AM (#14939672)
std::map and red-black trees are associative & sorted (by key); HAMTs are just plain associative. HAMTs have generally excellent performance: the typical implementations use 32-way branching, which allows for the top levels to be likely in cache.

The best thing about HAMTs is passing immutable ones around, which have free update costs and multi-thread safe. Clojure uses these to represent information that flows through a program. (By free update costs I mean: they are free enough to never rise to the programmer's attention. Obviously ops have costs.)

There are no comments on this comment yet.