Lines Matching refs:Pieces
27 /// references the whole string into two rope pieces that reference each half.
46 /// which results in two rope pieces, which is just like an insert) or it can
138 /// NumPieces - This holds the number of rope pieces currently active in the
139 /// Pieces array.
142 /// Pieces - This tracks the file chunks currently in this leaf.
144 RopePiece Pieces[2*WidthFactor];
160 /// clear - Remove all rope pieces from this leaf.
163 Pieces[--NumPieces] = RopePiece();
171 return Pieces[i];
248 while (Offset >= PieceOffs+Pieces[i].size()) {
249 PieceOffs += Pieces[i].size();
263 RopePiece Tail(Pieces[i].StrData, Pieces[i].StartOffs+IntraPieceOffset,
264 Pieces[i].EndOffs);
265 Size -= Pieces[i].size();
266 Pieces[i].EndOffs = Pieces[i].StartOffs+IntraPieceOffset;
267 Size += Pieces[i].size();
298 Pieces[e] = Pieces[e-1];
299 Pieces[i] = R;
314 std::copy(&Pieces[WidthFactor], &Pieces[2*WidthFactor],
315 &NewNode->Pieces[0]);
316 // Replace old pieces with null RopePieces to drop refcounts.
317 std::fill(&Pieces[WidthFactor], &Pieces[2*WidthFactor], RopePiece());
350 // 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;
