Searched refs:isFull (Results 1 – 9 of 9) sorted by relevance
42 bool CharacterConverter::isFull() { in isFull() function in LIBC_NAMESPACE_DECL::internal::CharacterConverter89 if (num_ones == 1 && !isFull()) { in push()127 if (!isFull()) in pop_utf32()152 if (isFull()) { in pop_utf8()
35 for (num_pushed = 0; !cr.isFull() && src_idx + num_pushed < src_len; in pushFullCharacter()43 if (src_idx + num_pushed == src_len && !cr.isFull()) { in pushFullCharacter()
30 bool isFull();
32 for (; i < n && !char_conv.isFull(); ++i) { in mbrtowc()
90 bool isFull() const { return NumValuesUsed == 2 * WidthFactor - 1; } in isFull() function in __anon400feef60111::DeltaTreeNode207 if (!isFull()) { in DoInsertion()236 if (!isFull()) { in DoInsertion()299 assert(isFull() && "Why split a non-full node?"); in DoSplit()
156 bool isFull() const { return NumPieces == 2 * WidthFactor; } in isFull() function in __anon4d9c27d40111::RopePieceBTreeLeaf276 if (!isFull()) { in insert()416 bool isFull() const { return NumChildren == 2 * WidthFactor; } in isFull() function in __anon4d9c27d40311::RopePieceBTreeInterior530 if (!isFull()) { in HandleChildPiece()
179 bool isFull() const { return MaxSize && Collection.size() >= *MaxSize; } in isFull() function in __anon5d856e630111::SchedGroup579 if (Match->isFull()) { in populateReadyList()638 if (Match->isFull()) in solveExact()722 if (Match->isFull()) { in greedyFind()2516 if (isFull()) in initSchedGroup()2529 if (isFull()) in initSchedGroup()2546 if (isFull()) in initSchedGroup()
66 if (isFull()) in toScaled()
104 bool isFull() const { return Mass == std::numeric_limits<uint64_t>::max(); } in isFull() function