Apr 26, 2025 · std::unordered_map is an associative container that contains key-value pairs with unique keys. Search, insertion, and removal of elements have average constant-time complexity.

Apr 26, 2025 · std::unordered_set is an associative container that contains a set of unique objects of type Key. Search, insertion, and removal have average constant-time complexity.

Nov 21, 2021 · unordered_set(std::initializer_list<value_type> init, size_type bucket_count, const Allocator & alloc ) : unordered_set ( init, bucket_count, Hash(), key_equal(), alloc){} (14) (since …

Nov 27, 2023 · unordered_multiset (unordered_multiset &&); explicit unordered_multiset (const Allocator &); unordered_multiset (const unordered_multiset &, const type_identity_t <Allocator>&);

May 9, 2025 · The value_type must be EmplaceConstructible into unordered_set from std::forward<K>(obj). This overload participates in overload resolution only if Hash and KeyEqual are …

Apr 26, 2025 · std::unordered_multimap is an unordered associative container that supports equivalent keys (an unordered_multimap may contain multiple copies of each key value) and that associates …

Dec 4, 2021 · (C++17) Lookup unordered_map::at unordered_map::operator [] unordered_map::count unordered_map::find unordered_map::contains (C++20) unordered_map::equal_range Bucket …

Nov 27, 2023 · Classes unordered_map (C++11) collection of key-value pairs, hashed by keys, keys are unique (class template) [edit] unordered_multimap (C++11) collection of key-value pairs, hashed by …

Nov 29, 2021 · (C++20) unordered_set::equal_range Bucket interface unordered_set::begin(size_type)unordered_set::cbegin(size_type) …

May 9, 2025 · unordered_map::merge (C++17) unordered_map::insert unordered_map::insert_range (C++23) unordered_map::insert_or_assign (C++17) unordered_map::emplace …