229     AllocateStorage(other.NumBuckets());  in HashSet()
339     return iterator(this, NumBuckets());  in end()
344     return const_iterator(this, NumBuckets());  in end()
388         unwrapped_next_index += NumBuckets();  in erase()
393         unwrapped_next_ideal_index += NumBuckets();  in erase()
499     if (num_buckets > NumBuckets()) {  in reserve()
508     for (size_t i = 0; i < NumBuckets(); ++i) {  in TotalProbeDistance()
513           total += i + NumBuckets() - ideal_location;  in TotalProbeDistance()
524     return static_cast<double>(size()) / static_cast<double>(NumBuckets());  in CalculateLoadFactor()
563     elements_until_expand_ = NumBuckets() * max_load_factor_;  in SetLoadFactor()
577   size_t NumBuckets() const {  in NumBuckets()  function
583     DCHECK_LT(index, NumBuckets());  in ElementForIndex()
589     DCHECK_LT(index, NumBuckets());  in ElementForIndex()
604       DCHECK_EQ(index, NumBuckets());  in NextIndex()
615     if (UNLIKELY(NumBuckets() == 0)) {  in FindIndex()
623         return NumBuckets();  in FindIndex()
649       for (size_t i = 0; i < NumBuckets(); ++i) {  in DeallocateStorage()
653         allocfn_.deallocate(data_, NumBuckets());  in DeallocateStorage()
693     elements_until_expand_ = NumBuckets() * max_load_factor_;  in Resize()
697     DCHECK_LT(index, NumBuckets());  // Don't try to get a slot out of range.  in FirstAvailableSlot()
702       DCHECK_LE(non_empty_count, NumBuckets());  // Don't loop forever.  in FirstAvailableSlot()
708     const size_t num_buckets = NumBuckets();  in NextNonEmptySlot()