eva.v2.datastructures.bbtree.api — com.workiva/eva 2.0.3

The function of this namespace is to collect the public-facing 'permanent' methods of the btree code. As new versions are written, the constructors here should be updated to point to the latest constructor code.

backed-sorted-map clj

(backed-sorted-map store)

(backed-sorted-map store n)

(backed-sorted-map store order buffer-size)

Returns a buffered-btree implementation of a sorted map, backed by a persistent key value store. This is optimized for a solution with high latency (> 10 ms) for retrieving nodes, and the transient version simply stores up a sequence of actions to take, performing them in batch at the time of the persist! call.

backed-sorted-map-by clj

(backed-sorted-map-by cmp store)

(backed-sorted-map-by cmp store n)

(backed-sorted-map-by cmp store order buffer-size)

Returns a buffered-btree implementation of a sorted map with a custom comparator, backed by a persistent key-value store. This is optimized for high fetch latency (> 10 ms) for retrieving nodes, and the transient version simply stores up a sequence of actions to take, performing them in batch at the time of the persist! call.

backed-sorted-set clj

(backed-sorted-set store)

(backed-sorted-set store n)

(backed-sorted-set store order buffer-size)

Returns a buffered-btree implementation of a sorted set backed by a persistent key-value store, serving as a drop-in replacement for the built-in sorted set. This is optimized for high IO latency (> 10 ms) and the transient version simply stores up a sequence of conjoins and disjoins which are performed in a batch at the time of the persist! call.

backed-sorted-set-by clj

(backed-sorted-set-by cmp store)

(backed-sorted-set-by cmp store n)

(backed-sorted-set-by cmp store order buffer-size)

Returns a buffered-btree implementation of a sorted set with a custom comparator, backed by a persistent key-value store. Serves as a drop-in replacement for Clojure's sorted set. This is optimized for high IO latency (> 10 ms) for retrieving nodes, and the transient version simply stores up a sequence of conjoins and disjoins which are finally performed in batch at the time of the persist! call.

between clj

(between set-or-map low high)

We are trying to construct a more inclusive search. We are going to make a query in which no one is left out.

open clj

(open store uuid)

Constructs a new map/set from the specified root. The resulting map/set cannot be persisted.

open-map clj

(open-map store uuid)

Constructs a new map from the specified root. The resulting map cannot be persisted. Throw an exception if the tree was originally a set.

open-set clj

(open-set store uuid)

Constructs a new set from the specified root. The resulting set cannot be persisted. Throw an exception if the tree was originally a map.

open-writable clj

(open-writable store uuid)

Constructs a new map/set from the specified root. The resulting map/set can be persisted.

open-writable-map clj

(open-writable-map store uuid)

Constructs a new map from the specified root. The resulting map can be persisted. Throw an exception if the tree was originally a set.

open-writable-set clj

(open-writable-set store uuid)

Constructs a new set from the specified root. The resulting set can be persisted. Throw an exception if the tree was originally a map.

sorted-map clj

(sorted-map)

(sorted-map n)

(sorted-map order buffer-size)

Returns a buffered-btree implementation of a sorted map, as a drop-in replacement for the built-in sorted map. Has a transient version. Is optimized for a latency-heavy backing (see backed-sorted-map), so the built-in sorted-map is probably a better choice.

sorted-map-by clj

(sorted-map-by cmp)

(sorted-map-by cmp n)

(sorted-map-by cmp order buffer-size)

Returns a buffered-btree implementation of a sorted map with a custom comparator, as a drop-in replacement for the built-in sorted map. Has a transient version. Is optimized for a latency-heavy storage backend (see backed-sorted-map-by), so clojure.core/sorted-map-by is probably a better choice.

sorted-set clj

(sorted-set)

(sorted-set n)

(sorted-set order buffer-size)

Returns a buffered-btree implementation of a sorted set, as a drop-in replacement for the built-in sorted set. Has a transient version. Is optimized for a latency-heavy backing (see backed-sorted-set), so clojure.core's sorted-set is probably a better choice for you.

sorted-set-by clj

(sorted-set-by cmp)

(sorted-set-by cmp n)

(sorted-set-by cmp order buffer-size)

Returns a buffered-btree implementation of a sorted set with a custom comparator, as a drop-in replacement for core's sorted set. Has a transient version. This is optimized for a latency-heavy storage solution (see backed-sorted-set-by), so clojure.core/sorted-set-by is probably a better choice.

subrange clj

(subrange set-or-map range)

Returns a sequence containing all elements from the map/set within the specified range.

subranges clj

(subranges set-or-map ranges)

Returns a map: range->sequence, where each sequence contains (in order) all the elements from the map/set contained by the corresponding range.