47 /// properly balanced when erases happen.  Erases of string data can both insert
49 /// which results in two rope pieces, which is just like an insert) or it can
111     /// insert - Insert the specified ropepiece into this tree node at the
117     RopePieceBTreeNode *insert(unsigned Offset, const RopePiece &R);
211     /// insert - Insert the specified ropepiece into this tree node at the
217     RopePieceBTreeNode *insert(unsigned Offset, const RopePiece &R);
261   // We do this by shrinking the RopePiece and then doing an insert of the tail.  in split()
268   return insert(Offset, Tail);  in split()
271 /// insert - Insert the specified RopePiece into this tree node at the
276 RopePieceBTreeNode *RopePieceBTreeLeaf::insert(unsigned Offset,  in insert()  function in RopePieceBTreeLeaf
278   // If this node is not full, insert the piece.  in insert()
293     // For an insertion into a non-full leaf node, just insert the value in  in insert()
329     this->insert(Offset, R);  in insert()
331     NewNode->insert(Offset - this->size(), R);  in insert()
448     /// insert - Insert the specified ropepiece into this tree node at the
454     RopePieceBTreeNode *insert(unsigned Offset, const RopePiece &R);
457     /// Insert the new child, and/or propagate the result further up the tree.
497 /// insert - Insert the specified ropepiece into this tree node at the
503 RopePieceBTreeNode *RopePieceBTreeInterior::insert(unsigned Offset,  in insert()  function in RopePieceBTreeInterior
511     // Fastpath for a common case.  Insert at end of last child.  in insert()
521   // Insert at the end of this child.  in insert()
522   if (RopePieceBTreeNode *RHS = getChild(i)->insert(Offset-ChildOffs, R))  in insert()
529 /// Insert the new child, and/or propagate the result further up the tree.
535     // Insert RHS after child 'i'.  in HandleChildPiece()
557   // Finally, insert the two new children in the side the can (now) hold them.  in HandleChildPiece()
640 /// insert - Insert the specified ropepiece into this tree node at the
646 RopePieceBTreeNode *RopePieceBTreeNode::insert(unsigned Offset,  in insert()  function in RopePieceBTreeNode
648   assert(Offset <= size() && "Invalid offset to insert!");  in insert()
650     return Leaf->insert(Offset, R);  in insert()
651   return cast<RopePieceBTreeInterior>(this)->insert(Offset, R);  in insert()
747 void RopePieceBTree::insert(unsigned Offset, const RopePiece &R) {  in insert()  function in RopePieceBTree
753   if (RopePieceBTreeNode *RHS = getRoot(Root)->insert(Offset, R))  in insert()