datascript.btset — datascript 0.16.8

-btset-from-seq clj

(-btset-from-seq seq cmp)

-btset-from-sorted-arr clj

(-btset-from-sorted-arr arr cmp)

-distance clj

(-distance node left right level)

-next-path clj

(-next-path node path level)

-prev-path clj

(-prev-path node path level)

-rpath clj

(-rpath node level)

Returns rightmost path possible starting from node and going deeper

-rseek clj

(-rseek set key)

Returns path to the first element that is > key. If all elements in a set are <= key, returns (-rpath set) + 1. It’s a virtual path that is bigger than any path in a tree

-seek clj

(-seek set key)

Returns path to first element >= key, or -1 if all elements in a set < key

-slice clj

(-slice set key-from key-to)

alast clj

(alast arr)

alter-btset clj

(alter-btset set root shift cnt)

arr-map-inplace clj

(arr-map-inplace f arr)

avg-len clj

binary-search-l clj

(binary-search-l cmp arr r k)

binary-search-r clj

(binary-search-r cmp arr r k)

btset clj

(btset)

(btset & keys)

btset-by clj

(btset-by cmp)

(btset-by cmp & keys)

btset-conj clj

(btset-conj set key cmp)

btset-disj clj

(btset-disj set key cmp)

btset-iter clj

(btset-iter set)

Iterator that represents whole set

check-n-splice clj

(check-n-splice cmp arr from to new-arr)

cut clj

(cut arr cut-from)

(cut arr cut-from cut-to)

cut-n-splice clj

(cut-n-splice arr cut-from cut-to splice-from splice-to xs)

distance clj

(distance set path-l path-r)

empty-path clj

eq-arr clj

(eq-arr cmp a1 a1-from a1-to a2 a2-from a2-to)

est-count clj

(est-count iter)

half clj macro

(half x)

INode clj protocol

node-conj clj

(node-conj _ cmp key)

node-disj clj

(node-disj _ cmp key root? left right)

node-len clj

(node-len _)

node-lim-key clj

(node-lim-key _)

node-lookup clj

(node-lookup _ cmp key)

node-merge clj

(node-merge _ next)

node-merge-n-split clj

(node-merge-n-split _ next)

insert clj

(insert arr idx xs)

iter clj

(iter set left right)

iter-chunk clj

(iter-chunk iter)

iter-chunked-next clj

(iter-chunked-next iter)

iter-first clj

(iter-first iter)

iter-next clj

(iter-next iter)

iter-reduce clj

(iter-reduce iter f)

(iter-reduce iter f start)

iter-rseq clj

(iter-rseq iter)

keys-for clj

(keys-for set path)

level-shift clj

lookup-exact clj

(lookup-exact cmp arr key)

lookup-range clj

(lookup-range cmp arr key)

max-len clj

merge-n-split clj

(merge-n-split a1 a2)

min-len clj

next-path clj

(next-path set path)

Returns path representing next item after path in natural traversal order, or -1 if end of tree has been reached

not== clj macro

(not== x y)

path-get clj

(path-get path level)

path-mask clj

path-set clj

(path-set path level idx)

prev-path clj

(prev-path set path)

Returns path representing previous item before path in natural traversal order, or -1 if path was already beginning of a tree

return-array clj

(return-array a1)

(return-array a1 a2)

(return-array a1 a2 a3)

Drop non-nil references and return array of arguments

riter clj

(riter set left right)

riter-first clj

(riter-first riter)

riter-next clj

(riter-next ri)

riter-rseq clj

(riter-rseq riter)

rotate clj

(rotate node root? left right)

slice clj

(slice set key)

(slice set key-from key-to)

When called with single key, returns iterator over set that contains all elements equal to the key. When called with two keys (range), returns iterator for all X where key-from <= X <= key-to

splice clj

(splice arr splice-from splice-to xs)

uninitialized-hash clj