Lines Matching defs:Size
83 /// Size - This is the number of bytes of file this node (including any
85 unsigned Size;
91 RopePieceBTreeNode(bool isLeaf) : Size(0), IsLeaf(isLeaf) {}
96 unsigned size() const { return Size; }
162 Size = 0;
193 /// FullRecomputeSizeLocally - This method recomputes the 'Size' field by
194 /// summing the size of all RopePieces.
196 Size = 0;
198 Size += getPiece(i).size();
237 if (Offset == 0 || Offset == size()) {
245 while (Offset >= PieceOffs+Pieces[i].size()) {
246 PieceOffs += Pieces[i].size();
262 Size -= Pieces[i].size();
264 Size += Pieces[i].size();
282 if (Offset == size()) {
288 SlotOffs += getPiece(i).size();
298 Size += R.size();
319 // Recompute the two nodes' size.
327 if (this->size() >= Offset)
330 NewNode->insert(Offset - this->size(), R);
342 PieceOffs += getPiece(i).size();
349 for (; Offset+NumBytes > PieceOffs+getPiece(i).size(); ++i)
350 PieceOffs += getPiece(i).size();
353 if (Offset+NumBytes == PieceOffs+getPiece(i).size())
354 PieceOffs += getPiece(i).size(), ++i;
369 Size -= CoverBytes;
377 assert(getPiece(StartPiece).size() > NumBytes);
380 // The size of this node just shrunk by NumBytes.
381 Size -= NumBytes;
404 Size = LHS->size() + RHS->size();
424 /// FullRecomputeSizeLocally - Recompute the Size field of this node by
427 Size = 0;
429 Size += getChild(i)->size();
472 if (Offset == 0 || Offset == size())
477 for (; Offset >= ChildOffset+getChild(i)->size(); ++i)
478 ChildOffset += getChild(i)->size();
503 if (Offset == size()) {
506 ChildOffs = size()-getChild(i)->size();
508 for (; Offset > ChildOffs+getChild(i)->size(); ++i)
509 ChildOffs += getChild(i)->size();
512 Size += R.size();
557 // Recompute the two nodes' size.
567 Size -= NumBytes;
571 for (; Offset >= getChild(i)->size(); ++i)
572 Offset -= getChild(i)->size();
581 if (Offset+NumBytes < CurChild->size()) {
589 unsigned BytesFromChild = CurChild->size()-Offset;
600 NumBytes -= CurChild->size();
627 assert(Offset <= size() && "Invalid offset to split!");
641 assert(Offset <= size() && "Invalid offset to insert!");
650 assert(Offset+NumBytes <= size() && "Invalid offset to erase!");
726 unsigned RopePieceBTree::size() const {
727 return getRoot(Root)->size();
780 unsigned Size = End-Start+sizeof(RopeRefCountString)-1;
782 reinterpret_cast<RopeRefCountString *>(new char[Size]);
