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
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.
142 RopePiece Pieces[2*WidthFactor];
158 /// clear - Remove all rope pieces from this leaf.
161 Pieces[--NumPieces] = RopePiece();
169 return Pieces[i];
245 while (Offset >= PieceOffs+Pieces[i].size()) {
246 PieceOffs += Pieces[i].size();
260 RopePiece Tail(Pieces[i].StrData, Pieces[i].StartOffs+IntraPieceOffset,
261 Pieces[i].EndOffs);
262 Size -= Pieces[i].size();
263 Pieces[i].EndOffs = Pieces[i].StartOffs+IntraPieceOffset;
264 Size += Pieces[i].size();
295 Pieces[e] = Pieces[e-1];
296 Pieces[i] = R;
311 std::copy(&Pieces[WidthFactor], &Pieces[2*WidthFactor],
312 &NewNode->Pieces[0]);
313 // Replace old pieces with null RopePieces to drop refcounts.
314 std::fill(&Pieces[WidthFactor], &Pieces[2*WidthFactor], RopePiece());
347 // Figure out how many pieces completely cover 'NumBytes'. We want to remove
360 Pieces[i-NumDeleted] = Pieces[i];
362 // Drop references to dead rope pieces.
363 std::fill(&Pieces[getNumPieces()-NumDeleted], &Pieces[getNumPieces()],
378 Pieces[StartPiece].StartOffs += NumBytes;
