eva.v2.datastructures.bbtree.logic.v0.buffer — com.workiva/eva 2.0.1

A map-like structure with the following quirks:

• each key is associated with a vector of all values inserted at that key.
• `count' returns the sum of lengths of all vector values.
• it works as a priority-map, sorting each key by the length of its associated vector.
• Corollary: `first' returns the entry with the longest value vector.

btree-buffer clj

(btree-buffer order)

get-all clj

(get-all buffer)

Return a sequence of all messages in the mailboxes.

get-range-filtered clj

(get-range-filtered buffer cmp k ranges)

get-seq clj

(get-seq buffer & ks)

Given a buffer and a sequence of keys, returns a concatenated list of all messages bound for those keys.

insert clj

(insert buffer k v)

keys-to-flush clj

(keys-to-flush buffer)

max-recip clj

(max-recip max buffer)

min-recip clj

(min-recip min buffer)

overflowing? clj

(overflowing? buffer)