Lines Matching refs:element
445 std::pair<iterator, bool> insert(const_iterator hint ATTRIBUTE_UNUSED, const T& element) { in insert() argument
446 return insert(element); in insert()
448 std::pair<iterator, bool> insert(const_iterator hint ATTRIBUTE_UNUSED, T&& element) { in insert() argument
449 return insert(std::move(element)); in insert()
453 std::pair<iterator, bool> insert(const T& element) { in insert() argument
454 return InsertWithHash(element, hashfn_(element)); in insert()
456 std::pair<iterator, bool> insert(T&& element) { in insert() argument
457 return InsertWithHash(std::move(element), hashfn_(element)); in insert()
461 std::pair<iterator, bool> InsertWithHash(U&& element, size_t hash) { in InsertWithHash() argument
462 DCHECK_EQ(hash, hashfn_(element)); in InsertWithHash()
472 size_t index = FindIndexImpl(element, hash, find_fail_fn); in InsertWithHash()
474 data_[index] = std::forward<U>(element); in InsertWithHash()
522 const T& element = ElementForIndex(i); in TotalProbeDistance() local
523 if (!emptyfn_.IsEmpty(element)) { in TotalProbeDistance()
524 size_t ideal_location = IndexForHash(hashfn_(element)); in TotalProbeDistance()
544 T& element = data_[i]; in Verify() local
545 if (!emptyfn_.IsEmpty(element)) { in Verify()
548 std::swap(temp, element); in Verify()
554 std::swap(temp, element); in Verify()
626 size_t FindIndex(const K& element, size_t hash) const { in FindIndex() argument
632 return FindIndexImpl(element, hash, fail_fn); in FindIndex()
637 size_t FindIndexImpl(const K& element, size_t hash, FailFn fail_fn) const { in FindIndexImpl() argument
639 DCHECK_EQ(hashfn_(element), hash); in FindIndexImpl()
646 if (pred_(slot, element)) { in FindIndexImpl()
701 T& element = old_data[i]; in Resize() local
702 if (!emptyfn_.IsEmpty(element)) { in Resize()
703 data_[FirstAvailableSlot(IndexForHash(hashfn_(element)))] = std::move(element); in Resize()
706 allocfn_.destroy(allocfn_.address(element)); in Resize()