22 /// than binary trees, because they store multiple keys/values in each node.
70   /// Values - This tracks the SourceDelta's currently in this node.
71   SourceDelta Values[2 * WidthFactor - 1];  member in __anon400feef60111::DeltaTreeNode
73   /// NumValuesUsed - This tracks the number of values this node currently
81   /// FullDelta - This is the full delta of all the values in this node and
96     return Values[i];  in getValue()
101     return Values[i];  in getValue()
138     Values[0] = IR.Split;  in DeltaTreeInteriorNode()
172     NewFullDelta += Values[i].Delta;  in RecomputeFullDeltaLocally()
200     Values[i].Delta += Delta;  in DoInsertion()
209       // its sorted position.  This requires moving later values over.  in DoInsertion()
211         memmove(&Values[i + 1], &Values[i], sizeof(Values[0]) * (e - i));  in DoInsertion()
212       Values[i] = SourceDelta::get(FileIndex, Delta);  in DoInsertion()
238     // into ourself by moving all the later values/children down, then inserting  in DoInsertion()
247       memmove(&Values[i + 1], &Values[i], (e - i) * sizeof(Values[0]));  in DoInsertion()
248     Values[i] = InsertRes->Split;  in DoInsertion()
287     memmove(&InsertSide->Values[i + 1], &InsertSide->Values[i],  in DoInsertion()
288             (e - i) * sizeof(Values[0]));  in DoInsertion()
289   InsertSide->Values[i] = SubSplit;  in DoInsertion()
295 /// DoSplit - Split the currently full node (which has 2*WidthFactor-1 values)
296 /// into two subtrees each with "WidthFactor-1" values and a pivot value.
301   // Since this node is full, it contains 2*WidthFactor-1 values.  We move  in DoSplit()
302   // the first 'WidthFactor-1' values to the LHS child (which we leave in this  in DoSplit()
303   // node), propagate one value up, and move the last 'WidthFactor-1' values  in DoSplit()
320   // Move over the last 'WidthFactor-1' values from here to NewNode.  in DoSplit()
321   memcpy(&NewNode->Values[0], &Values[WidthFactor],  in DoSplit()
322          (WidthFactor - 1) * sizeof(Values[0]));  in DoSplit()
324   // Decrease the number of values in the two nodes.  in DoSplit()
333   InsertRes.Split = Values[WidthFactor - 1];  in DoSplit()
428     // Include any children to the left of the values we skipped, all of  in getDeltaAt()