Lines Matching refs:NumBuckets
107 const size_t num_buckets = hash_set->NumBuckets();
181 AllocateStorage(other.NumBuckets());
291 return iterator(this, NumBuckets());
296 return const_iterator(this, NumBuckets());
338 unwrapped_next_index += NumBuckets();
343 unwrapped_next_ideal_index += NumBuckets();
438 if (num_buckets > NumBuckets()) {
447 for (size_t i = 0; i < NumBuckets(); ++i) {
452 total += i + NumBuckets() - ideal_location;
463 return static_cast<double>(Size()) / static_cast<double>(NumBuckets());
502 elements_until_expand_ = NumBuckets() * max_load_factor_;
516 size_t NumBuckets() const {
522 DCHECK_LT(index, NumBuckets());
528 DCHECK_LT(index, NumBuckets());
543 DCHECK_EQ(index, NumBuckets());
549 // Find the hash table slot for an element, or return NumBuckets() if not found.
554 if (UNLIKELY(NumBuckets() == 0)) {
562 return NumBuckets();
588 for (size_t i = 0; i < NumBuckets(); ++i) {
592 allocfn_.deallocate(data_, NumBuckets());
632 elements_until_expand_ = NumBuckets() * max_load_factor_;
636 DCHECK_LT(index, NumBuckets()); // Don't try to get a slot out of range.
641 DCHECK_LE(non_empty_count, NumBuckets()); // Don't loop forever.
