s2geometry-d ~master (2023-01-06T14:05:31Z)

Node.splitChild

s2 util container btree BTree Node

Given that this node is non-full, but a child node that is, split the child node into two separate nodes that are half full, and insert a value into this node between them.

class Node
void
splitChild
(
size_t i
)
out { assert (_children[i]._numValues == MIN_DEGREE - 1); assert (_children[i + 1]._numValues == MIN_DEGREE - 1); }

Meta

Source

See Implementation

s2 util container btree BTree Node functionsvariables

Page generated by adrdox