Lines Matching refs:Values
22 /// than binary trees, because they store multiple keys/values in each node.
69 /// Values - This tracks the SourceDelta's currently in this node.
71 SourceDelta Values[2*WidthFactor-1];
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
95 return Values[i];
99 return Values[i];
138 Values[0] = IR.Split;
171 NewFullDelta += Values[i].Delta;
199 Values[i].Delta += Delta;
208 // its sorted position. This requires moving later values over.
210 memmove(&Values[i+1], &Values[i], sizeof(Values[0])*(e-i));
211 Values[i] = SourceDelta::get(FileIndex, Delta);
237 // into ourself by moving all the later values/children down, then inserting
246 memmove(&Values[i+1], &Values[i], (e-i)*sizeof(Values[0]));
247 Values[i] = InsertRes->Split;
285 memmove(&InsertSide->Values[i+1], &InsertSide->Values[i],
286 (e-i)*sizeof(Values[0]));
287 InsertSide->Values[i] = SubSplit;
293 /// DoSplit - Split the currently full node (which has 2*WidthFactor-1 values)
294 /// into two subtrees each with "WidthFactor-1" values and a pivot value.
299 // Since this node is full, it contains 2*WidthFactor-1 values. We move
300 // the first 'WidthFactor-1' values to the LHS child (which we leave in this
301 // node), propagate one value up, and move the last 'WidthFactor-1' values
318 // Move over the last 'WidthFactor-1' values from here to NewNode.
319 memcpy(&NewNode->Values[0], &Values[WidthFactor],
320 (WidthFactor-1)*sizeof(Values[0]));
322 // Decrease the number of values in the two nodes.
331 InsertRes.Split = Values[WidthFactor-1];
432 // Include any children to the left of the values we skipped, all of
