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()
368     NumBytes -= CoverBytes;  in erase()
373   if (NumBytes == 0) return;  in erase()
377   assert(getPiece(StartPiece).size() > NumBytes);  in erase()
378   Pieces[StartPiece].StartOffs += NumBytes;  in erase()
381   Size -= NumBytes;  in erase()
456     void erase(unsigned Offset, unsigned NumBytes);
565 void RopePieceBTreeInterior::erase(unsigned Offset, unsigned NumBytes) {  in erase()  argument
567   Size -= NumBytes;  in erase()
576   while (NumBytes) {  in erase()
581     if (Offset+NumBytes < CurChild->size()) {  in erase()
582       CurChild->erase(Offset, NumBytes);  in erase()
591       NumBytes -= BytesFromChild;  in erase()
600     NumBytes -= CurChild->size();  in erase()
649 void RopePieceBTreeNode::erase(unsigned Offset, unsigned NumBytes) {  in erase()  argument
650   assert(Offset+NumBytes <= size() && "Invalid offset to erase!");  in erase()
652     return Leaf->erase(Offset, NumBytes);  in erase()
653   return cast<RopePieceBTreeInterior>(this)->erase(Offset, NumBytes);  in erase()
749 void RopePieceBTree::erase(unsigned Offset, unsigned NumBytes) {  in erase()  argument
755   getRoot(Root)->erase(Offset, NumBytes);  in erase()