Lines Matching full:split

31 /// Once split, another string can be inserted in between the two halves by
103 /// split - Split the range containing the specified offset so that we are
109 RopePieceBTreeNode *split(unsigned Offset);
120 /// guaranteed that there is a split at Offset.
203 /// split - Split the range containing the specified offset so that we are
209 RopePieceBTreeNode *split(unsigned Offset);
220 /// guaranteed that there is a split at Offset.
230 /// split - Split the range containing the specified offset so that we are
236 RopePieceBTreeNode *RopePieceBTreeLeaf::split(unsigned Offset) { in split() function in RopePieceBTreeLeaf
237 // Find the insertion point. We are guaranteed that there is a split at the in split()
252 // If there is already a split point at the specified offset, just return in split()
257 // Otherwise, we need to split piece 'i' at Offset-PieceOffs. Convert Offset in split()
280 // Find the insertion point. We are guaranteed that there is a split at the in insert()
290 assert(SlotOffs == Offset && "Split didn't occur before insertion!"); in insert()
303 // Otherwise, if this is leaf is full, split it in two halves. Since this in insert()
336 /// guaranteed that there is a split at Offset.
338 // Since we are guaranteed that there is a split at Offset, we start by in erase()
344 assert(PieceOffs == Offset && "Split didn't occur before erase!"); in erase()
440 /// split - Split the range containing the specified offset so that we are
446 RopePieceBTreeNode *split(unsigned Offset);
461 /// guaranteed that there is a split at Offset.
471 /// split - Split the range containing the specified offset so that we are
477 RopePieceBTreeNode *RopePieceBTreeInterior::split(unsigned Offset) { in split() function in RopePieceBTreeInterior
478 // Figure out which child to split. in split()
480 return nullptr; // If we have an exact offset, we're already split. in split()
487 // If already split there, we're done. in split()
491 // Otherwise, recursively split the child. in split()
492 if (RopePieceBTreeNode *RHS = getChild(i)->split(Offset-ChildOffset)) in split()
505 // Find the insertion point. We are guaranteed that there is a split at the in insert()
544 // Okay, this node is full. Split it in half, moving WidthFactor children to in HandleChildPiece()
571 /// guaranteed that there is a split at Offset.
627 /// split - Split the range containing the specified offset so that we are
633 RopePieceBTreeNode *RopePieceBTreeNode::split(unsigned Offset) { in split() function in RopePieceBTreeNode
634 assert(Offset <= size() && "Invalid offset to split!"); in split()
636 return Leaf->split(Offset); in split()
637 return cast<RopePieceBTreeInterior>(this)->split(Offset); in split()
655 /// guaranteed that there is a split at Offset.
748 // #1. Split at Offset. in insert()
749 if (RopePieceBTreeNode *RHS = getRoot(Root)->split(Offset)) in insert()
758 // #1. Split at Offset. in erase()
759 if (RopePieceBTreeNode *RHS = getRoot(Root)->split(Offset)) in erase()