121     void erase(unsigned Offset, unsigned NumBytes);
221     void erase(unsigned Offset, unsigned NumBytes);
337 void RopePieceBTreeLeaf::erase(unsigned Offset, unsigned NumBytes) {  in erase()  argument
350   for (; Offset+NumBytes > PieceOffs+getPiece(i).size(); ++i)  in erase()
354   if (Offset+NumBytes == PieceOffs+getPiece(i).size()) {  in erase()
371     NumBytes -= CoverBytes;  in erase()
376   if (NumBytes == 0) return;  in erase()
380   assert(getPiece(StartPiece).size() > NumBytes);  in erase()
381   Pieces[StartPiece].StartOffs += NumBytes;  in erase()
384   Size -= NumBytes;  in erase()
462     void erase(unsigned Offset, unsigned NumBytes);
572 void RopePieceBTreeInterior::erase(unsigned Offset, unsigned NumBytes) {  in erase()  argument
574   Size -= NumBytes;  in erase()
583   while (NumBytes) {  in erase()
588     if (Offset+NumBytes < CurChild->size()) {  in erase()
589       CurChild->erase(Offset, NumBytes);  in erase()
598       NumBytes -= BytesFromChild;  in erase()
607     NumBytes -= CurChild->size();  in erase()
656 void RopePieceBTreeNode::erase(unsigned Offset, unsigned NumBytes) {  in erase()  argument
657   assert(Offset+NumBytes <= size() && "Invalid offset to erase!");  in erase()
659     return Leaf->erase(Offset, NumBytes);  in erase()
660   return cast<RopePieceBTreeInterior>(this)->erase(Offset, NumBytes);  in erase()
757 void RopePieceBTree::erase(unsigned Offset, unsigned NumBytes) {  in erase()  argument
763   getRoot(Root)->erase(Offset, NumBytes);  in erase()