111       const size_t num_buckets = hash_set->NumBuckets();  in NextNonEmptySlot()
185     AllocateStorage(other.NumBuckets());  in HashSet()
295     return iterator(this, NumBuckets());  in end()
300     return const_iterator(this, NumBuckets());  in end()
342         unwrapped_next_index += NumBuckets();  in Erase()
347         unwrapped_next_ideal_index += NumBuckets();  in Erase()
444     if (num_buckets > NumBuckets()) {  in Reserve()
453     for (size_t i = 0; i < NumBuckets(); ++i) {  in TotalProbeDistance()
458           total += i + NumBuckets() - ideal_location;  in TotalProbeDistance()
469     return static_cast<double>(Size()) / static_cast<double>(NumBuckets());  in CalculateLoadFactor()
508     elements_until_expand_ = NumBuckets() * max_load_factor_;  in SetLoadFactor()
522   size_t NumBuckets() const {  in NumBuckets()  function
528     DCHECK_LT(index, NumBuckets());  in ElementForIndex()
534     DCHECK_LT(index, NumBuckets());  in ElementForIndex()
549       DCHECK_EQ(index, NumBuckets());  in NextIndex()
560     if (UNLIKELY(NumBuckets() == 0)) {  in FindIndex()
568         return NumBuckets();  in FindIndex()
594       for (size_t i = 0; i < NumBuckets(); ++i) {  in DeallocateStorage()
598         allocfn_.deallocate(data_, NumBuckets());  in DeallocateStorage()
638     elements_until_expand_ = NumBuckets() * max_load_factor_;  in Resize()
642     DCHECK_LT(index, NumBuckets());  // Don't try to get a slot out of range.  in FirstAvailableSlot()
647       DCHECK_LE(non_empty_count, NumBuckets());  // Don't loop forever.  in FirstAvailableSlot()