439   iterator insert(const_iterator hint ATTRIBUTE_UNUSED, const T& element) {  in insert()  argument
440     return insert(element);  in insert()
442   iterator insert(const_iterator hint ATTRIBUTE_UNUSED, T&& element) {  in insert()  argument
443     return insert(std::move(element));  in insert()
447   iterator insert(const T& element) {  in insert()  argument
448     return InsertWithHash(element, hashfn_(element));  in insert()
450   iterator insert(T&& element) {  in insert()  argument
451     return InsertWithHash(std::move(element), hashfn_(element));  in insert()
455   iterator InsertWithHash(U&& element, size_t hash) {  in InsertWithHash()  argument
456     DCHECK_EQ(hash, hashfn_(element));  in InsertWithHash()
462     data_[index] = std::forward<U>(element);  in InsertWithHash()
509       const T& element = ElementForIndex(i);  in TotalProbeDistance()  local
510       if (!emptyfn_.IsEmpty(element)) {  in TotalProbeDistance()
511         size_t ideal_location = IndexForHash(hashfn_(element));  in TotalProbeDistance()
531       T& element = data_[i];  in Verify()  local
532       if (!emptyfn_.IsEmpty(element)) {  in Verify()
535         std::swap(temp, element);  in Verify()
541         std::swap(temp, element);  in Verify()
613   size_t FindIndex(const K& element, size_t hash) const {  in FindIndex()  argument
618     DCHECK_EQ(hashfn_(element), hash);  in FindIndex()
625       if (pred_(slot, element)) {  in FindIndex()
680       T& element = old_data[i];  in Resize()  local
681       if (!emptyfn_.IsEmpty(element)) {  in Resize()
682         data_[FirstAvailableSlot(IndexForHash(hashfn_(element)))] = std::move(element);  in Resize()
685         allocfn_.destroy(allocfn_.address(element));  in Resize()