Hi,
I am pleased to announce the 0.0.12 release of data.avl, a Clojure
Contrib library providing drop-in replacements for Clojure(Script)'s
built-in sorted maps and sets with additional functionality:
1. real (non-view) logarithmic-time slicing and splits;
2. logarithmic-time nearest neighbour
Great work as always!
Are there any places where data.avl performs worse than the built-in sorted
maps and sets?
On Wednesday, April 23, 2014 7:59:59 AM UTC-5, Michał Marczyk wrote:
>
> Hi,
>
> I am pleased to announce the 0.0.12 release of data.avl, a Clojure
> Contrib library providing drop
Cheers Alex!
See below for the results of yesterday's run of my benchmark suite for
the basic operations. (I'll post some benchmark results for the new
functions in a separate message sometime soon.)
In general, it's fair to expect (persistent) assoc/dissoc to be slower
with data.avl maps, since
Here's a round of benchmarks for the new functions
(avl/{nearest,subrange,split-at,split-key}), with a lookup benchmark
included as a point of reference.
Cheers,
Michał
(let [m (apply avl/sorted-map
(interleave (range 10) (range 10)))]
(c/bench (get m 9))
(c/bench
