120   void erase(unsigned Offset, unsigned NumBytes);
220   void erase(unsigned Offset, unsigned NumBytes);
334 void RopePieceBTreeLeaf::erase(unsigned Offset, unsigned NumBytes) {  in erase()  argument
347   for (; Offset + NumBytes > PieceOffs + getPiece(i).size(); ++i)  in erase()
351   if (Offset + NumBytes == PieceOffs + getPiece(i).size()) {  in erase()
368     NumBytes -= CoverBytes;  in erase()
373   if (NumBytes == 0)  in erase()
378   assert(getPiece(StartPiece).size() > NumBytes);  in erase()
379   Pieces[StartPiece].StartOffs += NumBytes;  in erase()
382   Size -= NumBytes;  in erase()
460   void erase(unsigned Offset, unsigned NumBytes);
568 void RopePieceBTreeInterior::erase(unsigned Offset, unsigned NumBytes) {  in erase()  argument
570   Size -= NumBytes;  in erase()
579   while (NumBytes) {  in erase()
584     if (Offset + NumBytes < CurChild->size()) {  in erase()
585       CurChild->erase(Offset, NumBytes);  in erase()
594       NumBytes -= BytesFromChild;  in erase()
603     NumBytes -= CurChild->size();  in erase()
652 void RopePieceBTreeNode::erase(unsigned Offset, unsigned NumBytes) {  in erase()  argument
653   assert(Offset + NumBytes <= size() && "Invalid offset to erase!");  in erase()
655     return Leaf->erase(Offset, NumBytes);  in erase()
656   return cast<RopePieceBTreeInterior>(this)->erase(Offset, NumBytes);  in erase()
748 void RopePieceBTree::erase(unsigned Offset, unsigned NumBytes) {  in erase()  argument
754   getRoot(Root)->erase(Offset, NumBytes);  in erase()