Searched refs:isFull (Results 1 – 5 of 5) sorted by relevance
91 bool isFull() const { return NumValuesUsed == 2*WidthFactor-1; } in isFull() function in __anon3dde455f0111::DeltaTreeNode208 if (!isFull()) { in DoInsertion()237 if (!isFull()) { in DoInsertion()299 assert(isFull() && "Why split a non-full node?"); in DoSplit()
157 bool isFull() const { return NumPieces == 2*WidthFactor; } in isFull() function in __anonf859bc7d0111::RopePieceBTreeLeaf279 if (!isFull()) { in insert()418 bool isFull() const { return NumChildren == 2*WidthFactor; } in isFull() function in __anonf859bc7d0311::RopePieceBTreeInterior534 if (!isFull()) { in HandleChildPiece()
180 bool isFull() const { return MaxSize && Collection.size() >= *MaxSize; } in isFull() function in __anon1bedcbfd0111::SchedGroup598 if (Match->isFull()) { in populateReadyList()661 if (Match->isFull()) in solveExact()745 if (Match->isFull()) { in greedyFind()2518 if (isFull()) in initSchedGroup()2531 if (isFull()) in initSchedGroup()2548 if (isFull()) in initSchedGroup()
66 if (isFull()) in toScaled()
107 bool isFull() const { return Mass == std::numeric_limits<uint64_t>::max(); } in isFull() function