Liking cljdoc? Tell your friends :D
me.tonsky.persistent-sorted-set
A B-tree based persistent sorted set. Supports transients, custom comparators, fast iteration, efficient slices (iterator over a part of the set) and reverse slices. Almost a drop-in replacement for [[clojure.core/sorted-set]], the only difference being this one can’t store nil.
A B-tree based persistent sorted set. Supports transients, custom comparators, fast iteration, efficient slices (iterator over a part of the set) and reverse slices. Almost a drop-in replacement for [[clojure.core/sorted-set]], the only difference being this one can’t store nil.
- -slice
- alter-btset
- arr-map-inplace
- arr-partition-approx
- bit-mask
- bits-per-level
- child
- conj
- disj
- empty-path
- est-count
- factors
- from-sequential
- from-sorted-array
- IIter
- indexed
- INode
- IRoot
- ISeek
- IStore
- iter
- max-len
- max-safe-level
- max-safe-path
- min-len
- new-leaf
- new-node
- restore
- restore-by
- riter
- rslice
- seek
- settings
- slice
- sorted-arr-distinct
- sorted-set
- sorted-set*
- sorted-set-by
- store
- uninitialized-address
- uninitialized-hash
- walk-addresses
cljdoc builds & hosts documentation for Clojure/Script libraries
Keyboard shortcuts
× close| Ctrl+k | Jump to recent docs |
| ← | Move to previous article |
| → | Move to next article |
| Ctrl+/ | Jump to the search field |