302   Iterator Find(const K& element) {  in Find()  argument
303     return FindWithHash(element, hashfn_(element));  in Find()
307   ConstIterator Find(const K& element) const {  in Find()  argument
308     return FindWithHash(element, hashfn_(element));  in Find()
312   Iterator FindWithHash(const K& element, size_t hash) {  in FindWithHash()  argument
313     return Iterator(this, FindIndex(element, hash));  in FindWithHash()
317   ConstIterator FindWithHash(const K& element, size_t hash) const {  in FindWithHash()  argument
318     return ConstIterator(this, FindIndex(element, hash));  in FindWithHash()
322   void Insert(const T& element) {  in Insert()  argument
323     InsertWithHash(element, hashfn_(element));  in Insert()
326   void InsertWithHash(const T& element, size_t hash) {  in InsertWithHash()  argument
327     DCHECK_EQ(hash, hashfn_(element));  in InsertWithHash()
333     data_[index] = element;  in InsertWithHash()
350       const T& element = ElementForIndex(i);  in TotalProbeDistance()  local
351       if (!emptyfn_.IsEmpty(element)) {  in TotalProbeDistance()
352         size_t ideal_location = IndexForHash(hashfn_(element));  in TotalProbeDistance()
372       T& element = data_[i];  in Verify()  local
373       if (!emptyfn_.IsEmpty(element)) {  in Verify()
376         std::swap(temp, element);  in Verify()
382         std::swap(temp, element);  in Verify()
416   size_t FindIndex(const K& element, size_t hash) const {  in FindIndex()  argument
417     DCHECK_EQ(hashfn_(element), hash);  in FindIndex()
424       if (pred_(slot, element)) {  in FindIndex()
485       T& element = old_data[i];  in Resize()  local
486       if (!emptyfn_.IsEmpty(element)) {  in Resize()
487         data_[FirstAvailableSlot(IndexForHash(hashfn_(element)))] = std::move(element);  in Resize()
490         allocfn_.destroy(allocfn_.address(element));  in Resize()