30 /// Once split, another string can be inserted in between the two halves by
102   /// split - Split the range containing the specified offset so that we are
108   RopePieceBTreeNode *split(unsigned Offset);
119   /// guaranteed that there is a split at Offset.
202   /// split - Split the range containing the specified offset so that we are
208   RopePieceBTreeNode *split(unsigned Offset);
219   /// guaranteed that there is a split at Offset.
227 /// split - Split the range containing the specified offset so that we are
233 RopePieceBTreeNode *RopePieceBTreeLeaf::split(unsigned Offset) {  in split()  function in RopePieceBTreeLeaf
234   // Find the insertion point.  We are guaranteed that there is a split at the  in split()
249   // If there is already a split point at the specified offset, just return  in split()
254   // Otherwise, we need to split piece 'i' at Offset-PieceOffs.  Convert Offset  in split()
277     // Find the insertion point.  We are guaranteed that there is a split at the  in insert()
287       assert(SlotOffs == Offset && "Split didn't occur before insertion!");  in insert()
300   // Otherwise, if this is leaf is full, split it in two halves.  Since this  in insert()
333 /// guaranteed that there is a split at Offset.
335   // Since we are guaranteed that there is a split at Offset, we start by  in erase()
341   assert(PieceOffs == Offset && "Split didn't occur before erase!");  in erase()
438   /// split - Split the range containing the specified offset so that we are
444   RopePieceBTreeNode *split(unsigned Offset);
459   /// guaranteed that there is a split at Offset.
467 /// split - Split the range containing the specified offset so that we are
473 RopePieceBTreeNode *RopePieceBTreeInterior::split(unsigned Offset) {  in split()  function in RopePieceBTreeInterior
474   // Figure out which child to split.  in split()
476     return nullptr; // If we have an exact offset, we're already split.  in split()
483   // If already split there, we're done.  in split()
487   // Otherwise, recursively split the child.  in split()
488   if (RopePieceBTreeNode *RHS = getChild(i)->split(Offset - ChildOffset))  in split()
501   // Find the insertion point.  We are guaranteed that there is a split at the  in insert()
540   // Okay, this node is full.  Split it in half, moving WidthFactor children to  in HandleChildPiece()
567 /// guaranteed that there is a split at Offset.
623 /// split - Split the range containing the specified offset so that we are
629 RopePieceBTreeNode *RopePieceBTreeNode::split(unsigned Offset) {  in split()  function in RopePieceBTreeNode
630   assert(Offset <= size() && "Invalid offset to split!");  in split()
632     return Leaf->split(Offset);  in split()
633   return cast<RopePieceBTreeInterior>(this)->split(Offset);  in split()
651 /// guaranteed that there is a split at Offset.
739   // #1. Split at Offset.  in insert()
740   if (RopePieceBTreeNode *RHS = getRoot(Root)->split(Offset))  in insert()
749   // #1. Split at Offset.  in erase()
750   if (RopePieceBTreeNode *RHS = getRoot(Root)->split(Offset))  in erase()