Searched refs:NumNonEmpty (Results 1 – 2 of 2) sorted by relevance
32 NumNonEmpty = NumTombstones = 0; in shrink_and_clear()60 ++NumNonEmpty; // Track density. in insert_imp_big()118 NumNonEmpty -= NumTombstones; in Grow()178 NumNonEmpty = RHS.NumNonEmpty; in CopyHelper()204 NumNonEmpty = RHS.NumNonEmpty; in MoveHelper()210 RHS.NumNonEmpty = 0; in MoveHelper()221 std::swap(this->NumNonEmpty, RHS.NumNonEmpty); in swap()234 std::swap(this->NumNonEmpty, RHS.NumNonEmpty); in swap()248 std::swap(RHS.NumNonEmpty, this->NumNonEmpty); in swap()257 unsigned MinNonEmpty = std::min(this->NumNonEmpty, RHS.NumNonEmpty); in swap()[all …]
65 unsigned NumNonEmpty; variable77 CurArraySize(SmallSize), NumNonEmpty(0), NumTombstones(0) { in SmallPtrSetImplBase()93 size_type size() const { return NumNonEmpty - NumTombstones; } in size()106 NumNonEmpty = 0; in clear()120 return isSmall() ? CurArray + NumNonEmpty : CurArray + CurArraySize; in EndPointer()130 for (const void **APtr = SmallArray, **E = SmallArray + NumNonEmpty; in insert_imp()148 if (NumNonEmpty < CurArraySize) { in insert_imp()149 SmallArray[NumNonEmpty++] = Ptr; in insert_imp()151 return std::make_pair(SmallArray + (NumNonEmpty - 1), true); in insert_imp()181 *const *E = SmallArray + NumNonEmpty; APtr != E; ++APtr) in find_imp()