Liking cljdoc? Tell your friends :D

org.replikativ.persistent-sorted-set.btset


$contains?cljs

($contains? set key {:keys [sync?] :or {sync? true} :as opts})
source

$countcljs

($count set {:keys [sync?] :or {sync? true} :as opts})
source

$intocljs

($into to from)
($into to arg0 arg1)
($into to xform from {:keys [sync?] :or {sync? true}})
source

$reducecljs

($reduce rf init from)
($reduce rf init from {:keys [sync?] :or {sync? true}})
source

$replacecljs

($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})
source

$rseqcljs

($rseq set)
($rseq set {:keys [sync?] :or {sync? true} :as opts})
source

$seqcljs

($seq set)
($seq set opts)
source

$transducecljs

($transduce xform arf init from)
($transduce xform arf init from {:keys [sync?] :or {sync? true}})
source

-itercljs

(-iter set {:keys [sync?] :or {sync? true} :as opts})
(-iter set left right {:keys [sync?] :or {sync? true} :as opts})
source

async-reducecljs

(async-reduce arf set from)
source

async-transducecljs

(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
sourceraw docstring

conjoincljs

(conjoin set key)
(conjoin set key arg)
(conjoin set key cmp {:keys [sync?] :or {sync? true} :as opts})
source

count-slicecljs

(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.
sourceraw docstring

disjoincljs

(disjoin set key)
(disjoin set key arg)
(disjoin set key cmp {:keys [sync?] :or {sync? true} :as opts})
source

EMPTY_PATHcljs

source

equivalent-sequential?cljs

(equivalent-sequential? xs ys {:keys [sync?] :or {sync? true} :as opts})
source

equivalent?cljs

(equivalent? set other {:keys [sync?] :or {sync? true} :as opts})
source

from-optscljs

(from-opts opts)

Create a set with options map containing:

  • :storage Storage implementation
  • :comparator Custom comparator (defaults to compare)
  • :measure Measure implementation (IMeasure protocol)
  • :meta Metadata
Create a set with options map containing:
- :storage  Storage implementation
- :comparator  Custom comparator (defaults to compare)
- :measure  Measure implementation (IMeasure protocol)
- :meta     Metadata
sourceraw docstring

from-sequentialcljs

(from-sequential cmp seq opts)
source

from-sorted-arraycljs

(from-sorted-array cmp arr _len opts)
source

get-nthcljs

(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.
sourceraw docstring

IItercljsprotocol

-copycljs

(-copy this left right)
source

ISeekcljsprotocol

-seekcljs

(-seek this key)
(-seek this key comparator)
source

lookupcljs

(lookup set key cmp {:keys [sync?] :or {sync? true} :as opts})
source

measurecljs

(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.
sourceraw docstring

measure-slicecljs

(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.
sourceraw docstring

restorecljs

(restore root-address-or-info storage opts)
source

rslicecljs

(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})
source

seekcljs

(seek seq key)
(seek seq key arg)
(seek seq key cmp {:keys [sync?] :or {sync? true} :as opts})
source

slicecljs

(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})
source

sorted-set-bycljs

(sorted-set-by cmp)
(sorted-set-by cmp & keys)
source

storecljs

(store set arg)
(store set storage {:keys [sync?] :or {sync? true} :as opts})
source

UNINITIALIZED_HASHcljs

source

walk-addressescljs

(walk-addresses set on-address {:keys [sync?] :or {sync? true} :as opts})
source

cljdoc builds & hosts documentation for Clojure/Script libraries

Keyboard shortcuts
Ctrl+kJump to recent docs
Move to previous article
Move to next article
Ctrl+/Jump to the search field
× close