Searched refs:NumNonEmpty (Results 1 – 2 of 2) sorted by relevance
31 NumNonEmpty = NumTombstones = 0; in shrink_and_clear()44 } else if (LLVM_UNLIKELY(CurArraySize - NumNonEmpty < CurArraySize / 8)) { in insert_imp_big()59 ++NumNonEmpty; // Track density. in insert_imp_big()117 NumNonEmpty -= NumTombstones; in Grow()177 NumNonEmpty = RHS.NumNonEmpty; in CopyHelper()195 std::copy(RHS.CurArray, RHS.CurArray + RHS.NumNonEmpty, CurArray); in MoveHelper()203 NumNonEmpty = RHS.NumNonEmpty; in MoveHelper()209 RHS.NumNonEmpty = 0; in MoveHelper()220 std::swap(this->NumNonEmpty, RHS.NumNonEmpty); in swap()231 std::copy(RHS.CurArray, RHS.CurArray + RHS.NumNonEmpty, this->SmallArray); in swap()[all …]
64 unsigned NumNonEmpty; variable76 CurArraySize(SmallSize), NumNonEmpty(0), NumTombstones(0) { in SmallPtrSetImplBase()92 size_type size() const { return NumNonEmpty - NumTombstones; } in size()105 NumNonEmpty = 0; in clear()119 return isSmall() ? CurArray + NumNonEmpty : CurArray + CurArraySize; in EndPointer()129 for (const void **APtr = SmallArray, **E = SmallArray + NumNonEmpty; in insert_imp()147 if (NumNonEmpty < CurArraySize) { in insert_imp()148 SmallArray[NumNonEmpty++] = Ptr; in insert_imp()150 return std::make_pair(SmallArray + (NumNonEmpty - 1), true); in insert_imp()180 *const *E = SmallArray + NumNonEmpty; APtr != E; ++APtr) in find_imp()