com.rpl.vector-backed-sorted-map — com.rpl/vector-backed-sorted-map 0.1.0

apv-fast-nth clj

(apv-fast-nth v idx)

check-integrity! clj

(check-integrity! vbsm)

Make sure the vbsm is actually in sorted order. Throws an exception if it's not.

ensure-vbsm clj

(ensure-vbsm maybe-vbsm)

(ensure-vbsm maybe-vbsm comparator)

merge-sorted-large clj

(merge-sorted-large vbsm1 vbsm2)

(merge-sorted-large vbsm1 vbsm2 f)

merge-sorted-optimal clj

(merge-sorted-optimal vbsm1 vbsm2)

(merge-sorted-optimal vbsm1 vbsm2 f)

merge-sorted-small clj

(merge-sorted-small vbsm1 vbsm2)

(merge-sorted-small vbsm1 vbsm2 f)

read-only-vector-backed-sorted-map clj

(read-only-vector-backed-sorted-map kv-pairs-vec)

(read-only-vector-backed-sorted-map comparator kv-pairs-vec)

Create a SortedMap implementation backed by a vector of K-V pairs. Creation of this map from an already-sorted vector of pairs is O(1). Lookups are O(log n). assoc / dissoc are not allowed.

vector-backed-sorted-map clj

(vector-backed-sorted-map kv-pairs-vec)

(vector-backed-sorted-map comparator kv-pairs-vec)

Create a SortedMap implementation backed by a vector of K-V pairs. Creation of this map from an already-sorted vector of pairs is O(1). Lookups are O(log n) if the map is never modified; assoc / dissoc calls modify a standard (sorted-map) overlay which is queried first.

VectorizableMap clj protocol

get-comparator clj

(get-comparator this)

vectorize clj

(vectorize this)

vectorize-from clj

(vectorize-from this k)