This is an implementation of the Lean Hash array Mapped Trie paper http://michael.steindorfer.name/publications/oopsla15.pdf
Repo at: https://github.com/bendyworks/lean-map available at clojars: https://clojars.org/lean-map The paper claims speedups of around 100% for iteration and equality checks for HAMT as well as 20 - 30% savings in memory. For me the more exciting part is the significant reduction in code size and complexity. The code is around 60% of the current CLJS HashMap implementation you only need to do a linear travesal of an array's node instead of a depth first traversal I haven't checked the memory savings yet, and so far only v8 has shown speedup on sequences (~25%). This is still an early draft of the paper in ClojureScript so perf improvements should be forthcoming, of course any help with this would be greatly appreciated. Peter Schuck -- Note that posts from new members are moderated - please be patient with your first post. --- You received this message because you are subscribed to the Google Groups "ClojureScript" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected]. Visit this group at http://groups.google.com/group/clojurescript.
