inner class BatchNode<K, V : Serializable, A : Serializable, D> where K : Comparable<K>, K : Serializable (source)
Auxiliary node type, dedicated to the insertBatch algorithm.
<init> |
Auxiliary node type, dedicated to the insertBatch algorithm. BatchNode(level: Int, k_min: K, k_max: K, context: LinkedList<Pair<K, V>>, descendants: LinkedList<BatchNode<K, V, A, D>>) |
context |
val context: LinkedList<Pair<K, V>> |
descendants |
val descendants: LinkedList<BatchNode<K, V, A, D>> |
k_max |
var k_max: K |
k_min |
var k_min: K |
level |
val level: Int |
findNearest |
Returns the batchNode keys (eventually k_min/k_max) nearest to the given key. fun findNearest(k: K): Pair<K, K> |
insert |
Inserts a new pair into the batch node context, respecting key-ordering. fun insert(p: Pair<K, V>): Unit |
split |
Splits the current node according to a certain key. fun split(k: K): Pair<BatchNode<K, V, A, D>?, BatchNode<K, V, A, D>?> |