eva.v2.datastructures.bbtree.logic.v0.operations — com.workiva/eva 2.0.3

bucket clj

(bucket c n)

Like partition, but =n= specifies the number of buckets.

deliver-and-add-batch clj

(deliver-and-add-batch nodes chldrn msgs)

Given a sequence of nodes with certain children, a sequence of corresponding sequences of said children, and finally a sequence of sequences of messages corresponding to those children, this delivers the messages to the children (recursively moving down the tree if necessary) and then adds these resulting sequences of children into the parent nodes.

deliver-messages-batch clj

(deliver-messages-batch nodes shaped-nodes msgs)

This is the process that drives it all. The recursion point back into this function (at a lower level in the tree) occurs in the function apply-messages-batched, so by the time this gets to rebalancing, the lower levels of the tree have already been balanced.

flush-buffer-batched clj

(flush-buffer-batched nodes)

Given a sequence of nodes, this flushes their buffers.

flush-buffer-counter clj

insert clj

(insert node msgs)

(insert store node msgs)

Entry point to the process of manipulating the btree. After some high-level bookkeeping, delegates to deliver-messages-batch.

insert-counter clj

keys-to-flush clj

(keys-to-flush node)

Which keys need to be flushed?

needs-balancing? clj

(needs-balancing? node)

Are any of the node's children too small?

num-buckets clj

(num-buckets item-count order)

overflowed-counter clj

pathcache19540 clj

pathcache19550 clj

persist-tree clj

(persist-tree store old-root root)

Converts the entire tree back into pointer form, then persists the tree to the store. Returns the root node.

split clj

(split node)

This method does not check whether the node is overflowing. It just splits it.

split* clj

(split* node)

Splits a node. Uses `split-weight' to determine whether it favors maximally full or minimally full nodes in the result.

split-nodes-counter clj

too-small-counter clj