Re: [ANN] avl.clj: sorted maps and sets with fast rank queries via nth

2013-09-21 Thread Michał Marczyk
As of 0.0.3, avl.clj offers sorted maps with lookups unambiguously faster than those of the built-ins. Construction times for large instances are also faster thanks to transients. The lookup performance comes at a cost in the form of slower non-transient assoc/dissoc. I've posted some benchmark re

Re: [ANN] avl.clj: sorted maps and sets with fast rank queries via nth

2013-09-20 Thread Michał Marczyk
On 21 September 2013 02:42, Michał Marczyk wrote: > [avl.clj "0.0.1"] > > > avl.clj > avl.clj > 0.0.1 > Make that [avl.clj "0.0.2"] and avl.clj avl.clj 0.0.2 Cheers, Michał -- -- You received this message because you are

[ANN] avl.clj: sorted maps and sets with fast rank queries via nth

2013-09-20 Thread Michał Marczyk
Hi, I have just released avl.clj, a library implementing drop-in replacements for Clojure(Script)'s sorted maps and sets which additionally support the transients API and logarithmic time rank queries via clojure.core/nth: (require '[avl.clj :as avl]) (nth (apply avl/sorted-set (range 10