About 50 results
Open links in new tab
  1. std::unordered_map - cppreference.com

    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.

  2. std:: unordered_set - cppreference.com

    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.

  3. std::unordered_set<Key,Hash,KeyEqual,Allocator>:: unordered_set

    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 …

  4. Standard library header <unordered_set> (C++11) - Reference

    Nov 27, 2023 · Classes unordered_set (C++11) collection of unique keys, hashed by keys (class template) [edit] unordered_multiset (C++11) collection of keys, hashed by keys (class template) [edit]

  5. std::unordered_set<Key,Hash,KeyEqual,Allocator>:: insert

    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 …

  6. std::unordered_map<Key,T,Hash,KeyEqual,Allocator>:: find

    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 …

  7. std:: unordered_multimap - cppreference.com

    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 …

  8. std::unordered_set<Key,Hash,KeyEqual,Allocator>:: contains

    Nov 5, 2023 · #include <iostream>#include <unordered_set>int(){std::unordered_set<int>{1234};for(int:{25})if(contains())std::cout<<<<": …

  9. std::unordered_map<Key,T,Hash,KeyEqual,Allocator>:: insert

    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 …

  10. std:: unordered_multiset - cppreference.com

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