Re: [ANN] data.avl 0.0.10 -- fast sorted maps and sets with log-time rank queries

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

Re: [ANN] data.avl 0.0.10 -- fast sorted maps and sets with log-time rank queries

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:

Re: [ANN] data.avl 0.0.10 -- fast sorted maps and sets with log-time rank queries

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