org.replikativ.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.
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.
org.replikativ.persistent-sorted-set.btset
- $contains?
- $count
- $into
- $reduce
- $replace
- $rseq
- $seq
- $transduce
- -iter
- async-reduce
- async-transduce
- conjoin
- count-slice
- disjoin
- EMPTY_PATH
- equivalent-sequential?
- equivalent?
- from-opts
- from-sequential
- from-sorted-array
- get-nth
- IIter
- ISeek
- lookup
- measure
- measure-slice
- restore
- rslice
- seek
- slice
- sorted-set-by
- store
- UNINITIALIZED_HASH
- walk-addresses
org.replikativ.persistent-sorted-set.diagnostics
Diagnostic API for B-tree structural integrity checking.
Similar to PostgreSQL's amcheck or SQLite's PRAGMA integrity_check, this namespace provides functions to validate the internal structure of persistent sorted sets.
Use validate for quick structural checks, validate-full to also
verify subtree counts and measures, and validate-content to run
user-defined content checks on leaf data (e.g., for Datahike index
consistency verification).
Diagnostic API for B-tree structural integrity checking. Similar to PostgreSQL's amcheck or SQLite's PRAGMA integrity_check, this namespace provides functions to validate the internal structure of persistent sorted sets. Use `validate` for quick structural checks, `validate-full` to also verify subtree counts and measures, and `validate-content` to run user-defined content checks on leaf data (e.g., for Datahike index consistency verification).
org.replikativ.persistent-sorted-set.impl.measure
Protocol for computing and maintaining measures over tree nodes. Measures form a monoid with identity and associative merge operation.
Protocol for computing and maintaining measures over tree nodes. Measures form a monoid with identity and associative merge operation.
org.replikativ.persistent-sorted-set.impl.numeric-stats
Numeric statistics implementation for testing and demonstration. Computes count, sum, min, max over numeric keys.
Numeric statistics implementation for testing and demonstration. Computes count, sum, min, max over numeric keys.
org.replikativ.persistent-sorted-set.leaf
No vars found in this namespace.
cljdoc builds & hosts documentation for Clojure/Script libraries
| Ctrl+k | Jump to recent docs |
| ← | Move to previous article |
| → | Move to next article |
| Ctrl+/ | Jump to the search field |