59       SourceDelta Split;  member
107     /// split the node, populate InsertRes with info about the split, and return
140       Values[0] = IR.Split;  in DeltaTreeInteriorNode()
141       FullDelta = IR.LHS->getFullDelta()+IR.RHS->getFullDelta()+IR.Split.Delta;  in DeltaTreeInteriorNode()
182 /// split the node, populate InsertRes with info about the split, and return
218     // Otherwise, if this is leaf is full, split the node at its median, insert  in DoInsertion()
223     if (InsertRes->Split.FileLoc > FileIndex)  in DoInsertion()
235   // Okay, this split the subtree, producing a new value and two children to  in DoInsertion()
249     Values[i] = InsertRes->Split;  in DoInsertion()
254   // Finally, if this interior node was full and a node is percolated up, split  in DoInsertion()
256   // avoid having the split clobber it.  in DoInsertion()
259   SourceDelta SubSplit = InsertRes->Split;  in DoInsertion()
261   // Do the split.  in DoInsertion()
266   if (SubSplit.FileLoc < InsertRes->Split.FileLoc)  in DoInsertion()
279   // Now we know that i is the place to insert the split value into.  Insert it  in DoInsertion()
295 /// DoSplit - Split the currently full node (which has 2*WidthFactor-1 values)
299   assert(isFull() && "Why split a non-full node?");  in DoSplit()
333   InsertRes.Split = Values[WidthFactor-1];  in DoSplit()