About 63,200 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_map<Key,T,Hash,KeyEqual,Allocator>:: …

    Nov 29, 2021 · Constructs new container from a variety of data sources. Optionally uses user supplied bucket_count as a minimal number of buckets to create, hash as the hash function, …

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

    Nov 27, 2023 · Contents 1Includes 2Classes 3Functions 3.1Range access 4Synopsis 4.1Class template std::unordered_set 4.2Class template std::unordered_multiset <compare> (C++20) …

  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 …

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

    Nov 5, 2023 · 1) Checks if there is an element with key equivalent to key in the container.

  7. std::unordered_map<Key,T,Hash,KeyEqual,Allocator>:: erase

    Dec 4, 2021 · Removes specified elements from the container.The order of the remaining elements is preserved. (This makes it possible to erase individual elements while iterating …

  8. Standard library header <unordered_map> (C++11) - Reference

    Nov 27, 2023 · Compiler support Freestanding and hosted Language Standard library Standard library headers Named requirements Feature test macros (C++20) Language support library …

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

    Nov 29, 2021 · Attempts to extract (“splice”) each element in source and insert it into *this using the hash function and key equality predicate of *this. If there is an element in *this with key …

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

    Dec 4, 2021 · This overload participates in overload resolution only if Hash and KeyEqual are both transparent. This assumes that such Hash is callable with both K and Key type, and that the …