Searched refs:NumberOfDeletedElements (Results 1 – 8 of 8) sorted by relevance
47 int nod = table->NumberOfDeletedElements(); in EnsureGrowable()111 int new_entry = nof + table->NumberOfDeletedElements(); in Add()165 int nod = table->NumberOfDeletedElements(); in Rehash()208 int nod = table->NumberOfDeletedElements(); in Delete()257 int new_entry = nof + table->NumberOfDeletedElements(); in Add()390 int new_entry = nof + table->NumberOfDeletedElements(); in Add()423 int new_entry = nof + table->NumberOfDeletedElements(); in Add()451 int nod = table->NumberOfDeletedElements(); in Delete()473 int nod = table->NumberOfDeletedElements(); in Rehash()510 if (table->NumberOfDeletedElements() < (capacity >> 1)) { in Grow()[all …]
22 int HashTableBase::NumberOfDeletedElements() const { in NumberOfDeletedElements() function34 SetNumberOfDeletedElements(NumberOfDeletedElements() + 1); in ElementRemoved()39 SetNumberOfDeletedElements(NumberOfDeletedElements() + n); in ElementsRemoved()
118 int NumberOfDeletedElements() const { in NumberOfDeletedElements() function125 return NumberOfElements() + NumberOfDeletedElements(); in UsedCapacity()364 int NumberOfDeletedElements() const { in NumberOfDeletedElements() function529 int used = NumberOfElements() + NumberOfDeletedElements(); in UsedCapacity()
71 inline int NumberOfDeletedElements() const; in NON_EXPORTED_BASE()
137 DCHECK((table->NumberOfDeletedElements() << 1) > table->NumberOfElements() || in RUNTIME_FUNCTION()
1364 for (int entry = NumberOfElements(); entry < NumberOfDeletedElements(); in SmallOrderedHashTableVerify()1372 for (int entry = NumberOfElements() + NumberOfDeletedElements(); in SmallOrderedHashTableVerify()
884 os << "\n - deleted: " << table->NumberOfDeletedElements(); in PrintHashTableWithHeader()
16898 int nod = NumberOfDeletedElements(); in HasSufficientCapacityToAdd()18212 if ((table->NumberOfDeletedElements() << 1) > table->NumberOfElements()) { in Put()