30 /// references the whole string into two rope pieces that reference each half.
49 /// which results in two rope pieces, which is just like an insert) or it can
136     /// NumPieces - This holds the number of rope pieces currently active in the
137     /// Pieces array.
140     /// Pieces - This tracks the file chunks currently in this leaf.
141     RopePiece Pieces[2*WidthFactor];  member in __anon358058e30111::RopePieceBTreeLeaf
159     /// clear - Remove all rope pieces from this leaf.
162         Pieces[--NumPieces] = RopePiece();  in clear()
170       return Pieces[i];  in getPiece()
247   while (Offset >= PieceOffs+Pieces[i].size()) {  in split()
248     PieceOffs += Pieces[i].size();  in split()
262   RopePiece Tail(Pieces[i].StrData, Pieces[i].StartOffs+IntraPieceOffset,  in split()
263                  Pieces[i].EndOffs);  in split()
264   Size -= Pieces[i].size();  in split()
265   Pieces[i].EndOffs = Pieces[i].StartOffs+IntraPieceOffset;  in split()
266   Size += Pieces[i].size();  in split()
296       Pieces[e] = Pieces[e-1];  in insert()
297     Pieces[i] = R;  in insert()
312   std::copy(&Pieces[WidthFactor], &Pieces[2*WidthFactor],  in insert()
313             &NewNode->Pieces[0]);  in insert()
314   // Replace old pieces with null RopePieces to drop refcounts.  in insert()
315   std::fill(&Pieces[WidthFactor], &Pieces[2*WidthFactor], RopePiece());  in insert()
348   // Figure out how many pieces completely cover 'NumBytes'.  We want to remove  in erase()
363       Pieces[i-NumDeleted] = Pieces[i];  in erase()
365     // Drop references to dead rope pieces.  in erase()
366     std::fill(&Pieces[getNumPieces()-NumDeleted], &Pieces[getNumPieces()],  in erase()
381   Pieces[StartPiece].StartOffs += NumBytes;  in erase()