30   NumNonEmpty = NumTombstones = 0;  in shrink_and_clear()
43   } else if (LLVM_UNLIKELY(CurArraySize - NumNonEmpty < CurArraySize / 8)) {  in insert_imp_big()
58     ++NumNonEmpty; // Track density.  in insert_imp_big()
66     for (const void **APtr = CurArray, **E = CurArray + NumNonEmpty; APtr != E;  in erase_imp()
138   NumNonEmpty -= NumTombstones;  in Grow()
202   NumNonEmpty = RHS.NumNonEmpty;  in CopyHelper()
220     std::copy(RHS.CurArray, RHS.CurArray + RHS.NumNonEmpty, CurArray);  in MoveHelper()
228   NumNonEmpty = RHS.NumNonEmpty;  in MoveHelper()
234   RHS.NumNonEmpty = 0;  in MoveHelper()
245     std::swap(this->NumNonEmpty, RHS.NumNonEmpty);  in swap()
256     std::copy(RHS.CurArray, RHS.CurArray + RHS.NumNonEmpty, this->SmallArray);  in swap()
258     std::swap(this->NumNonEmpty, RHS.NumNonEmpty);  in swap()
269     std::copy(this->CurArray, this->CurArray + this->NumNonEmpty,  in swap()
272     std::swap(RHS.NumNonEmpty, this->NumNonEmpty);  in swap()
281   unsigned MinNonEmpty = std::min(this->NumNonEmpty, RHS.NumNonEmpty);  in swap()
284   if (this->NumNonEmpty > MinNonEmpty) {  in swap()
286               this->SmallArray + this->NumNonEmpty,  in swap()
289     std::copy(RHS.SmallArray + MinNonEmpty, RHS.SmallArray + RHS.NumNonEmpty,  in swap()
293   std::swap(this->NumNonEmpty, RHS.NumNonEmpty);  in swap()