($into to from)($into to arg0 arg1)($into to xform from {:keys [sync?] :or {sync? true}})($replace set old-key new-key)($replace set old-key new-key arg)($replace set old-key new-key cmp {:keys [sync?] :or {sync? true} :as opts})($transduce xform arf init from)($transduce xform arf init from {:keys [sync?] :or {sync? true}})(-iter set {:keys [sync?] :or {sync? true} :as opts})(-iter set left right {:keys [sync?] :or {sync? true} :as opts})(async-transduce xform arf init from)xform: synchronous transducer (core map/filter/comp/etc) arf: MUST BE ASYNC reducing fn with arities ([acc] ...) and ([acc x] ...) init: initial accumulator from: BTSet | aseq/PAsyncSeq | sequential
xform: synchronous transducer (core map/filter/comp/etc) arf: MUST BE ASYNC reducing fn with arities ([acc] ...) and ([acc x] ...) init: initial accumulator from: BTSet | aseq/PAsyncSeq | sequential
(conjoin set key)(conjoin set key arg)(conjoin set key cmp {:keys [sync?] :or {sync? true} :as opts})(count-slice set from to)(count-slice set from to arg)(count-slice set from to cmp {:keys [sync?] :or {sync? true} :as opts})Count elements in the range [from, to] inclusive. Uses O(log n) algorithm when subtree counts are available. If from is nil, counts from the beginning. If to is nil, counts to the end.
Count elements in the range [from, to] inclusive. Uses O(log n) algorithm when subtree counts are available. If from is nil, counts from the beginning. If to is nil, counts to the end.
(disjoin set key)(disjoin set key arg)(disjoin set key cmp {:keys [sync?] :or {sync? true} :as opts})(equivalent-sequential? xs ys {:keys [sync?] :or {sync? true} :as opts})(from-opts opts)Create a set with options map containing:
Create a set with options map containing: - :storage Storage implementation - :comparator Custom comparator (defaults to compare) - :measure Measure implementation (IMeasure protocol) - :meta Metadata
(get-nth set n)(get-nth set n {:keys [sync?] :or {sync? true} :as opts})Find the entry at weighted rank n.
Navigation uses cached subtree measure and IMeasure weight for
O(log entries) performance.
Returns [entry local-offset] where local-offset is the rank within the found entry, or nil if out of bounds.
Requires measure with weight to be configured on the set.
Find the entry at weighted rank `n`. Navigation uses cached subtree measure and IMeasure weight for O(log entries) performance. Returns [entry local-offset] where local-offset is the rank within the found entry, or nil if out of bounds. Requires measure with weight to be configured on the set.
(measure set {:keys [sync?] :or {sync? true} :as opts})Get the aggregated statistics for the entire set.
Get the aggregated statistics for the entire set.
(measure-slice set from to)(measure-slice set from to arg)(measure-slice set from to cmp {:keys [sync?] :or {sync? true} :as opts})Compute measure for elements in the range [from, to] inclusive. Uses O(log n) algorithm when subtree measure is available. If from is nil, computes from the beginning. If to is nil, computes to the end. Returns nil if no measure-ops configured.
Compute measure for elements in the range [from, to] inclusive. Uses O(log n) algorithm when subtree measure is available. If from is nil, computes from the beginning. If to is nil, computes to the end. Returns nil if no measure-ops configured.
(rslice set key-from key-to)(rslice set key-from key-to arg)(rslice set key-from key-to cmp {:keys [sync?] :or {sync? true} :as opts})(seek seq key)(seek seq key arg)(seek seq key cmp {:keys [sync?] :or {sync? true} :as opts})(slice set key-from key-to)(slice set key-from key-to arg)(slice set key-from key-to cmp {:keys [sync?] :or {sync? true} :as opts})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 |