48   HashSetIterator(HashSetType* hash_set, size_t index) : index_(index), hash_set_(hash_set) {}  in HashSetIterator()  argument
468     auto find_fail_fn = [&](size_t index) {  in InsertWithHash()
470       return index;  in InsertWithHash()
472     size_t index = FindIndexImpl(element, hash, find_fail_fn);  in InsertWithHash()  local
474       data_[index] = std::forward<U>(element);  in InsertWithHash()
477     return std::make_pair(iterator(this, index), find_failed);  in InsertWithHash()
595   T& ElementForIndex(size_t index) {  in ElementForIndex()  argument
596     DCHECK_LT(index, NumBuckets());  in ElementForIndex()
598     return data_[index];  in ElementForIndex()
601   const T& ElementForIndex(size_t index) const {  in ElementForIndex()  argument
602     DCHECK_LT(index, NumBuckets());  in ElementForIndex()
604     return data_[index];  in ElementForIndex()
615   size_t NextIndex(size_t index) const {  in NextIndex()  argument
616     if (UNLIKELY(++index >= num_buckets_)) {  in NextIndex()
617       DCHECK_EQ(index, NumBuckets());  in NextIndex()
620     return index;  in NextIndex()
631     auto fail_fn = [&](size_t index ATTRIBUTE_UNUSED) { return NumBuckets(); };  in FindIndex()
640     size_t index = IndexForHash(hash);  in FindIndexImpl()  local
642       const T& slot = ElementForIndex(index);  in FindIndexImpl()
644         return fail_fn(index);  in FindIndexImpl()
647         return index;  in FindIndexImpl()
649       index = NextIndex(index);  in FindIndexImpl()
653   bool IsFreeSlot(size_t index) const {  in IsFreeSlot()  argument
654     return emptyfn_.IsEmpty(ElementForIndex(index));  in IsFreeSlot()
717   ALWAYS_INLINE size_t FirstAvailableSlot(size_t index) const {  in FirstAvailableSlot()  argument
718     DCHECK_LT(index, NumBuckets());  // Don't try to get a slot out of range.  in FirstAvailableSlot()
720     while (!emptyfn_.IsEmpty(data_[index])) {  in FirstAvailableSlot()
721       index = NextIndex(index);  in FirstAvailableSlot()
725     return index;  in FirstAvailableSlot()
728   size_t NextNonEmptySlot(size_t index) const {  in NextNonEmptySlot()  argument
730     DCHECK_LT(index, num_buckets);  in NextNonEmptySlot()
732       ++index;  in NextNonEmptySlot()
733     } while (index < num_buckets && IsFreeSlot(index));  in NextNonEmptySlot()
734     return index;  in NextNonEmptySlot()