Lines Matching refs:Children
31 /// former and adds children pointers. Each node knows the full delta of all
82 /// all children nodes.
123 DeltaTreeNode *Children[2*WidthFactor];
126 Children[i]->Destroy();
134 Children[0] = IR.LHS;
135 Children[1] = IR.RHS;
143 return Children[i];
147 return Children[i];
214 // the value into one of the children, and return the result.
227 if (!IN->Children[i]->DoInsertion(FileIndex, Delta, InsertRes))
230 // Okay, this split the subtree, producing a new value and two children to
234 // into ourself by moving all the later values/children down, then inserting
237 memmove(&IN->Children[i+2], &IN->Children[i+1],
238 (e-i)*sizeof(IN->Children[0]));
239 IN->Children[i] = InsertRes->LHS;
240 IN->Children[i+1] = InsertRes->RHS;
252 IN->Children[i] = InsertRes->LHS;
277 memmove(&InsertSide->Children[i+2], &InsertSide->Children[i+1],
278 (e-i)*sizeof(IN->Children[0]));
279 InsertSide->Children[i+1] = SubRHS;
304 // If this is an interior node, also move over 'WidthFactor' children
307 memcpy(&New->Children[0], &IN->Children[WidthFactor],
308 WidthFactor*sizeof(IN->Children[0]));
358 // elements are in proper order and the children are in proper order.
424 // If we have an interior node, include information about children and
429 // Include any children to the left of the values we skipped, all of
