122     void erase(unsigned Offset, unsigned NumBytes);
222     void erase(unsigned Offset, unsigned NumBytes);
338 void RopePieceBTreeLeaf::erase(unsigned Offset, unsigned NumBytes) {  in erase()  argument
351   for (; Offset+NumBytes > PieceOffs+getPiece(i).size(); ++i)  in erase()
355   if (Offset+NumBytes == PieceOffs+getPiece(i).size()) {  in erase()
372     NumBytes -= CoverBytes;  in erase()
377   if (NumBytes == 0) return;  in erase()
381   assert(getPiece(StartPiece).size() > NumBytes);  in erase()
382   Pieces[StartPiece].StartOffs += NumBytes;  in erase()
385   Size -= NumBytes;  in erase()
463     void erase(unsigned Offset, unsigned NumBytes);
573 void RopePieceBTreeInterior::erase(unsigned Offset, unsigned NumBytes) {  in erase()  argument
575   Size -= NumBytes;  in erase()
584   while (NumBytes) {  in erase()
589     if (Offset+NumBytes < CurChild->size()) {  in erase()
590       CurChild->erase(Offset, NumBytes);  in erase()
599       NumBytes -= BytesFromChild;  in erase()
608     NumBytes -= CurChild->size();  in erase()
657 void RopePieceBTreeNode::erase(unsigned Offset, unsigned NumBytes) {  in erase()  argument
658   assert(Offset+NumBytes <= size() && "Invalid offset to erase!");  in erase()
660     return Leaf->erase(Offset, NumBytes);  in erase()
661   return cast<RopePieceBTreeInterior>(this)->erase(Offset, NumBytes);  in erase()
758 void RopePieceBTree::erase(unsigned Offset, unsigned NumBytes) {  in erase()  argument
764   getRoot(Root)->erase(Offset, NumBytes);  in erase()