Lines Matching full:full
26 /// can also efficiently tell us the full accumulated delta for a specific
31 /// former and adds children pointers. Each node knows the full delta of all
33 /// full delta implied by a whole subtree in constant time.
81 /// FullDelta - This is the full delta of all the values in this node and
184 // Maintain full delta for this node.
207 // For an insertion into a non-full leaf node, just insert the value in
216 // Otherwise, if this is leaf is full, split the node at its median, insert
234 // insert here. If this node is non-full, we can just insert it directly.
252 // Finally, if this interior node was full and a node is percolated up, split
293 /// DoSplit - Split the currently full node (which has 2*WidthFactor-1 values)
297 assert(isFull() && "Why split a non-full node?");
299 // Since this node is full, it contains 2*WidthFactor-1 values. We move
325 // Recompute the two nodes' full delta.
