Lines Matching refs:Split
57 SourceDelta Split;
104 /// split the node, populate InsertRes with info about the split, and return
138 Values[0] = IR.Split;
139 FullDelta = IR.LHS->getFullDelta()+IR.RHS->getFullDelta()+IR.Split.Delta;
180 /// split the node, populate InsertRes with info about the split, and return
216 // Otherwise, if this is leaf is full, split the node at its median, insert
221 if (InsertRes->Split.FileLoc > FileIndex)
233 // Okay, this split the subtree, producing a new value and two children to
247 Values[i] = InsertRes->Split;
252 // Finally, if this interior node was full and a node is percolated up, split
254 // avoid having the split clobber it.
257 SourceDelta SubSplit = InsertRes->Split;
259 // Do the split.
264 if (SubSplit.FileLoc < InsertRes->Split.FileLoc)
277 // Now we know that i is the place to insert the split value into. Insert it
293 /// DoSplit - Split the currently full node (which has 2*WidthFactor-1 values)
297 assert(isFull() && "Why split a non-full node?");
331 InsertRes.Split = Values[WidthFactor-1];
