Lines Matching full:children
36 /// contains a reasonable number of pointers to children/values) allows us to
50 /// 'WidthFactor' children/values. For our use cases, this doesn't seem to
72 /// children that it has. This allows efficient skipping over entire subtrees
78 /// 'WidthFactor' elements in it (either ropepieces or children), (except
84 /// potential children) covers.
395 /// NumChildren - This holds the number of children currently active in the
396 /// Children array.
398 RopePieceBTreeNode *Children[2*WidthFactor];
404 Children[0] = LHS;
405 Children[1] = RHS;
412 Children[i]->Destroy();
420 return Children[i];
424 return Children[i];
534 memmove(&Children[i+2], &Children[i+1],
535 (getNumChildren()-i-1)*sizeof(Children[0]));
536 Children[i+1] = RHS;
541 // Okay, this node is full. Split it in half, moving WidthFactor children to
548 memcpy(&NewNode->Children[0], &Children[WidthFactor],
549 WidthFactor*sizeof(Children[0]));
554 // Finally, insert the two new children in the side the can (now) hold them.
578 // Propagate the delete request into overlapping children, or completely
579 // delete the children as appropriate.
608 memmove(&Children[i], &Children[i+1],
609 (getNumChildren()-i)*sizeof(Children[0]));
