118     void erase(unsigned Offset, unsigned NumBytes);
220     void erase(unsigned Offset, unsigned NumBytes);
336 void RopePieceBTreeLeaf::erase(unsigned Offset, unsigned NumBytes) {  in erase()  argument
349   for (; Offset+NumBytes > PieceOffs+getPiece(i).size(); ++i)  in erase()
353   if (Offset+NumBytes == PieceOffs+getPiece(i).size()) {  in erase()
370     NumBytes -= CoverBytes;  in erase()
375   if (NumBytes == 0) return;  in erase()
379   assert(getPiece(StartPiece).size() > NumBytes);  in erase()
380   Pieces[StartPiece].StartOffs += NumBytes;  in erase()
383   Size -= NumBytes;  in erase()
458     void erase(unsigned Offset, unsigned NumBytes);
567 void RopePieceBTreeInterior::erase(unsigned Offset, unsigned NumBytes) {  in erase()  argument
569   Size -= NumBytes;  in erase()
578   while (NumBytes) {  in erase()
583     if (Offset+NumBytes < CurChild->size()) {  in erase()
584       CurChild->erase(Offset, NumBytes);  in erase()
593       NumBytes -= BytesFromChild;  in erase()
602     NumBytes -= CurChild->size();  in erase()
651 void RopePieceBTreeNode::erase(unsigned Offset, unsigned NumBytes) {  in erase()  argument
652   assert(Offset+NumBytes <= size() && "Invalid offset to erase!");  in erase()
654     return Leaf->erase(Offset, NumBytes);  in erase()
655   return cast<RopePieceBTreeInterior>(this)->erase(Offset, NumBytes);  in erase()
751 void RopePieceBTree::erase(unsigned Offset, unsigned NumBytes) {  in erase()  argument
757   getRoot(Root)->erase(Offset, NumBytes);  in erase()