Hi,
I am pleased to announce the initial Clojure Contrib release of
data.avl (previously known as avl.clj), a library implementing drop-in
replacements for Clojure(Script)'s sorted maps and sets with faster
lookups, support for the transient API (leading to unambiguously
improved performance for m
Michał: This is awesome. Thanks for the continued awesome work on data
structures!
> ;; if the key is not present in the collection, -1 is returned:
> (avl/rank-of (avl/sorted-set 3 4 5) 0)
> ;= -1
>
Curious: Why not return nil instead of -1?
--
--
You received this message because
On Sunday, 5 January 2014 23:33:41 UTC, Brandon Bloom wrote:
>
> Michał: This is awesome. Thanks for the continued awesome work on data
> structures!
>
>
>> ;; if the key is not present in the collection, -1 is returned:
>> (avl/rank-of (avl/sorted-set 3 4 5) 0)
>> ;= -1
>>
>
> Curious:
On 6 January 2014 00:33, Brandon Bloom wrote:
> Michał: This is awesome. Thanks for the continued awesome work on data
> structures!
>
>>
>> ;; if the key is not present in the collection, -1 is returned:
>> (avl/rank-of (avl/sorted-set 3 4 5) 0)
>> ;= -1
>
>
> Curious: Why not return nil in
