Home | History | Annotate | Download | only in Rewrite

Lines Matching defs:Pieces

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];
159     /// clear - Remove all rope pieces from this leaf.
162         Pieces[--NumPieces] = RopePiece();
170       return Pieces[i];
247   while (Offset >= PieceOffs+Pieces[i].size()) {
248     PieceOffs += Pieces[i].size();
262   RopePiece Tail(Pieces[i].StrData, Pieces[i].StartOffs+IntraPieceOffset,
263                  Pieces[i].EndOffs);
264   Size -= Pieces[i].size();
265   Pieces[i].EndOffs = Pieces[i].StartOffs+IntraPieceOffset;
266   Size += Pieces[i].size();
296       Pieces[e] = Pieces[e-1];
297     Pieces[i] = R;
312   std::copy(&Pieces[WidthFactor], &Pieces[2*WidthFactor],
313             &NewNode->Pieces[0]);
314   // Replace old pieces with null RopePieces to drop refcounts.
315   std::fill(&Pieces[WidthFactor], &Pieces[2*WidthFactor], RopePiece());
348   // Figure out how many pieces completely cover 'NumBytes'.  We want to remove
363       Pieces[i-NumDeleted] = Pieces[i];
365     // Drop references to dead rope pieces.
366     std::fill(&Pieces[getNumPieces()-NumDeleted], &Pieces[getNumPieces()],
381   Pieces[StartPiece].StartOffs += NumBytes;