Standard library header <unordered_set> (C++11)

This header is part of the containers library.

Contents 1 Includes 2 Classes 3 Functions 3.1 Range access 4 Synopsis 4.1 Class template std::unordered_set 4.2 Class template std::unordered_multiset Includes
<compare> (C++20)	Three-way comparison operator support[edit]
<initializer_list> (C++11)	std::initializer_list class template[edit]
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]
Functions
operator==operator!= (C++11)(C++11)(removed in C++20)	compares the values in the unordered_set (function template) [edit]
std::swap(std::unordered_set) (C++11)	specializes the std::swap algorithm (function template) [edit]
erase_if(std::unordered_set) (C++20)	erases all elements satisfying specific criteria (function template) [edit]
operator==operator!= (C++11)(C++11)(removed in C++20)	compares the values in the unordered_multiset (function template) [edit]
std::swap(std::unordered_multiset) (C++11)	specializes the std::swap algorithm (function template) [edit]
erase_if(std::unordered_multiset) (C++20)	erases all elements satisfying specific criteria (function template) [edit]
Range access
begincbegin (C++11)(C++14)	returns an iterator to the beginning of a container or array (function template) [edit]
endcend (C++11)(C++14)	returns an iterator to the end of a container or array (function template) [edit]
rbegincrbegin (C++14)	returns a reverse iterator to the beginning of a container or array (function template) [edit]
rendcrend (C++14)	returns a reverse end iterator for a container or array (function template) [edit]
sizessize (C++17)(C++20)	returns the size of a container or array (function template) [edit]
empty (C++17)	checks whether the container is empty (function template) [edit]
data (C++17)	obtains the pointer to the underlying array (function template) [edit]

Synopsis

#include <compare>
#include <initializer_list>

namespace std {
  // class template unordered_set
  template<class Key,
           class Hash = hash<Key>,
           class Pred = equal_to<Key>,
           class Alloc = allocator<Key>>
  class unordered_set;

  // class template unordered_multiset
  template<class Key,
           class Hash = hash<Key>,
           class Pred = equal_to<Key>,
           class Alloc = allocator<Key>>
  class unordered_multiset;

  template<class Key, class Hash, class Pred, class Alloc>
  constexpr bool operator==(const unordered_set<Key, Hash, Pred, Alloc>& a,
                            const unordered_set<Key, Hash, Pred, Alloc>& b);

  template<class Key, class Hash, class Pred, class Alloc>
  constexpr bool operator==(const unordered_multiset<Key, Hash, Pred, Alloc>& a,
                            const unordered_multiset<Key, Hash, Pred, Alloc>& b);

  template<class Key, class Hash, class Pred, class Alloc>
  constexpr void swap(
    unordered_set<Key, Hash, Pred, Alloc>& x,
    unordered_set<Key, Hash, Pred, Alloc>& y) noexcept(noexcept(x.swap(y)));

  template<class Key, class Hash, class Pred, class Alloc>
  constexpr void swap(
    unordered_multiset<Key, Hash, Pred, Alloc>& x,
    unordered_multiset<Key, Hash, Pred, Alloc>& y) noexcept(noexcept(x.swap(y)));

  // erasure for unordered_set
  template<class K, class H, class P, class A, class Predicate>
  constexpr typename unordered_set<K, H, P, A>::size_type erase_if(
    unordered_set<K, H, P, A>& c, Predicate pred);

  // erasure for unordered_multiset
  template<class K, class H, class P, class A, class Predicate>
  constexpr typename unordered_multiset<K, H, P, A>::size_type erase_if(
    unordered_multiset<K, H, P, A>& c, Predicate pred);

  namespace pmr {
    template<class Key, class Hash = hash<Key>, class Pred = equal_to<Key>>
    using unordered_set = std::unordered_set<Key, Hash, Pred, polymorphic_allocator<Key>>;

    template<class Key, class Hash = hash<Key>, class Pred = equal_to<Key>>
    using unordered_multiset =
      std::unordered_multiset<Key, Hash, Pred, polymorphic_allocator<Key>>;
  }
}

Class template std::unordered_set

namespace std {
  template<class Key,
           class Hash = hash<Key>,
           class Pred = equal_to<Key>,
           class Allocator = allocator<Key>>
  class unordered_set
  {
  public:
    // types
    using key_type = Key;
    using value_type = Key;
    using hasher = Hash;
    using key_equal = Pred;
    using allocator_type = Allocator;
    using pointer = allocator_traits<Allocator>::pointer;
    using const_pointer = allocator_traits<Allocator>::const_pointer;
    using reference = value_type&;
    using const_reference = const value_type&;
    using size_type = /* implementation-defined */;
    using difference_type = /* implementation-defined */;

    using iterator = /* implementation-defined */;
    using const_iterator = /* implementation-defined */;
    using local_iterator = /* implementation-defined */;
    using const_local_iterator = /* implementation-defined */;
    using node_type = /* unspecified */;
    using insert_return_type = /*insert-return-type*/<iterator, node_type>;

    // construct/copy/destroy
    constexpr unordered_set();
    constexpr explicit unordered_set(size_type n,
                                     const hasher& hf = hasher(),
                                     const key_equal& eql = key_equal(),
                                     const allocator_type& a = allocator_type());
    template<class InputIter>
    constexpr unordered_set(InputIter f,
                            InputIter l,
                            size_type n = /* see description */,
                            const hasher& hf = hasher(),
                            const key_equal& eql = key_equal(),
                            const allocator_type& a = allocator_type());
    template<container-compatible-range<value_type> R>
    constexpr unordered_set(from_range_t,
                            R&& rg,
                            size_type n = /* see description */,
                            const hasher& hf = hasher(),
                            const key_equal& eql = key_equal(),
                            const allocator_type& a = allocator_type());
    constexpr unordered_set(const unordered_set&);
    constexpr unordered_set(unordered_set&&);
    constexpr explicit unordered_set(const Allocator&);
    constexpr unordered_set(const unordered_set&, const type_identity_t<Allocator>&);
    constexpr unordered_set(unordered_set&&, const type_identity_t<Allocator>&);
    constexpr unordered_set(initializer_list<value_type> il,
                            size_type n = /* see description */,
                            const hasher& hf = hasher(),
                            const key_equal& eql = key_equal(),
                            const allocator_type& a = allocator_type());
    constexpr unordered_set(size_type n, const allocator_type& a)
      : unordered_set(n, hasher(), key_equal(), a)
    {
    }
    constexpr unordered_set(size_type n, const hasher& hf, const allocator_type& a)
      : unordered_set(n, hf, key_equal(), a)
    {
    }
    template<class InputIter>
    constexpr unordered_set(InputIter f,
                            InputIter l,
                            size_type n,
                            const allocator_type& a)
      : unordered_set(f, l, n, hasher(), key_equal(), a)
    {
    }
    template<class InputIter>
    constexpr unordered_set(
      InputIter f, InputIter l, size_type n, const hasher& hf, const allocator_type& a)
      : unordered_set(f, l, n, hf, key_equal(), a)
    {
    }
    constexpr unordered_set(initializer_list<value_type> il,
                            size_type n,
                            const allocator_type& a)
      : unordered_set(il, n, hasher(), key_equal(), a)
    {
    }
    template<container-compatible-range<value_type> R>
    constexpr unordered_set(from_range_t, R&& rg, size_type n, const allocator_type& a)
      : unordered_set(from_range, std::forward<R>(rg), n, hasher(), key_equal(), a)
    {
    }
    template<container-compatible-range<value_type> R>
    constexpr unordered_set(
      from_range_t, R&& rg, size_type n, const hasher& hf, const allocator_type& a)
      : unordered_set(from_range, std::forward<R>(rg), n, hf, key_equal(), a)
    {
    }
    constexpr unordered_set(initializer_list<value_type> il,
                            size_type n,
                            const hasher& hf,
                            const allocator_type& a)
      : unordered_set(il, n, hf, key_equal(), a)
    {
    }
    constexpr ~unordered_set();
    constexpr unordered_set& operator=(const unordered_set&);
    constexpr unordered_set& operator=(unordered_set&&) noexcept(
      allocator_traits<Allocator>::is_always_equal::value&&
        is_nothrow_move_assignable_v<Hash>&& is_nothrow_move_assignable_v<Pred>);
    constexpr unordered_set& operator=(initializer_list<value_type>);
    constexpr allocator_type get_allocator() const noexcept;

    // iterators
    constexpr iterator begin() noexcept;
    constexpr const_iterator begin() const noexcept;
    constexpr iterator end() noexcept;
    constexpr const_iterator end() const noexcept;
    constexpr const_iterator cbegin() const noexcept;
    constexpr const_iterator cend() const noexcept;

    // capacity
    constexpr bool empty() const noexcept;
    constexpr size_type size() const noexcept;
    constexpr size_type max_size() const noexcept;

    // modifiers
    template<class... Args> constexpr pair<iterator, bool> emplace(Args&&... args);
    template<class... Args>
    constexpr iterator emplace_hint(const_iterator position, Args&&... args);
    constexpr pair<iterator, bool> insert(const value_type& obj);
    constexpr pair<iterator, bool> insert(value_type&& obj);
    template<class K> constexpr pair<iterator, bool> insert(K&& obj);
    constexpr iterator insert(const_iterator hint, const value_type& obj);
    constexpr iterator insert(const_iterator hint, value_type&& obj);
    template<class K> constexpr iterator insert(const_iterator hint, K&& obj);
    template<class InputIter> constexpr void insert(InputIter first, InputIter last);
    template<container-compatible-range<value_type> R>
    constexpr void insert_range(R&& rg);
    constexpr void insert(initializer_list<value_type>);

    constexpr node_type extract(const_iterator position);
    constexpr node_type extract(const key_type& x);
    template<class K> constexpr node_type extract(K&& x);
    constexpr insert_return_type insert(node_type&& nh);
    constexpr iterator insert(const_iterator hint, node_type&& nh);

    constexpr iterator erase(iterator position)
      requires(!same_as<iterator, const_iterator>);
    constexpr iterator erase(const_iterator position);
    constexpr size_type erase(const key_type& k);
    template<class K> constexpr size_type erase(K&& x);
    constexpr iterator erase(const_iterator first, const_iterator last);
    constexpr void swap(unordered_set&) noexcept(
      allocator_traits<Allocator>::is_always_equal::value&& is_nothrow_swappable_v<Hash>&&
        is_nothrow_swappable_v<Pred>);
    constexpr void clear() noexcept;

    template<class H2, class P2>
    constexpr void merge(unordered_set<Key, H2, P2, Allocator>& source);
    template<class H2, class P2>
    constexpr void merge(unordered_set<Key, H2, P2, Allocator>&& source);
    template<class H2, class P2>
    constexpr void merge(unordered_multiset<Key, H2, P2, Allocator>& source);
    template<class H2, class P2>
    constexpr void merge(unordered_multiset<Key, H2, P2, Allocator>&& source);

    // observers
    constexpr hasher hash_function() const;
    constexpr key_equal key_eq() const;

    // set operations
    constexpr iterator find(const key_type& k);
    constexpr const_iterator find(const key_type& k) const;
    template<class K> constexpr iterator find(const K& k);
    template<class K> constexpr const_iterator find(const K& k) const;
    constexpr size_type count(const key_type& k) const;
    template<class K> constexpr size_type count(const K& k) const;
    constexpr bool contains(const key_type& k) const;
    template<class K> constexpr bool contains(const K& k) const;
    constexpr pair<iterator, iterator> equal_range(const key_type& k);
    constexpr pair<const_iterator, const_iterator> equal_range(const key_type& k) const;
    template<class K> constexpr pair<iterator, iterator> equal_range(const K& k);
    template<class K>
    constexpr pair<const_iterator, const_iterator> equal_range(const K& k) const;

    // bucket interface
    constexpr size_type bucket_count() const noexcept;
    constexpr size_type max_bucket_count() const noexcept;
    constexpr size_type bucket_size(size_type n) const;
    constexpr size_type bucket(const key_type& k) const;
    template<class K> constexpr size_type bucket(const K& k) const;
    constexpr local_iterator begin(size_type n);
    constexpr const_local_iterator begin(size_type n) const;
    constexpr local_iterator end(size_type n);
    constexpr const_local_iterator end(size_type n) const;
    constexpr const_local_iterator cbegin(size_type n) const;
    constexpr const_local_iterator cend(size_type n) const;

    // hash policy
    constexpr float load_factor() const noexcept;
    constexpr float max_load_factor() const noexcept;
    constexpr void max_load_factor(float z);
    constexpr void rehash(size_type n);
    constexpr void reserve(size_type n);
  };

  template<class InputIter,
           class Hash = hash</*iter-value-type*/<InputIter>>,
           class Pred = equal_to</*iter-value-type*/<InputIter>>,
           class Allocator = allocator</*iter-value-type*/<InputIter>>>
  unordered_set(InputIter,
                InputIter,
                typename /* see description */ ::size_type = /* see description */,
                Hash = Hash(),
                Pred = Pred(),
                Allocator = Allocator())
    -> unordered_set</*iter-value-type*/<InputIter>, Hash, Pred, Allocator>;

  template<ranges::input_range R,
           class Hash = hash<ranges::range_value_t<R>>,
           class Pred = equal_to<ranges::range_value_t<R>>,
           class Allocator = allocator<ranges::range_value_t<R>>>
  unordered_set(from_range_t,
                R&&,
                typename /* see description */ ::size_type = /* see description */,
                Hash = Hash(),
                Pred = Pred(),
                Allocator = Allocator())
    -> unordered_set<ranges::range_value_t<R>, Hash, Pred, Allocator>;

  template<class T,
           class Hash = hash<T>,
           class Pred = equal_to<T>,
           class Allocator = allocator<T>>
  unordered_set(initializer_list<T>,
                typename /* see description */ ::size_type = /* see description */,
                Hash = Hash(),
                Pred = Pred(),
                Allocator = Allocator()) -> unordered_set<T, Hash, Pred, Allocator>;

  template<class InputIter, class Allocator>
  unordered_set(InputIter,
                InputIter,
                typename /* see description */ ::size_type,
                Allocator) -> unordered_set</*iter-value-type*/<InputIter>,
                                            hash</*iter-value-type*/<InputIter>>,
                                            equal_to</*iter-value-type*/<InputIter>>,
                                            Allocator>;

  template<class InputIter, class Hash, class Allocator>
  unordered_set(
    InputIter, InputIter, typename /* see description */ ::size_type, Hash, Allocator)
    -> unordered_set</*iter-value-type*/<InputIter>,
                     Hash,
                     equal_to</*iter-value-type*/<InputIter>>,
                     Allocator>;

  template<ranges::input_range R, class Allocator>
  unordered_set(from_range_t, R&&, typename /* see description */ ::size_type, Allocator)
    -> unordered_set<ranges::range_value_t<R>,
                     hash<ranges::range_value_t<R>>,
                     equal_to<ranges::range_value_t<R>>,
                     Allocator>;

  template<ranges::input_range R, class Allocator>
  unordered_set(from_range_t, R&&, Allocator)
    -> unordered_set<ranges::range_value_t<R>,
                     hash<ranges::range_value_t<R>>,
                     equal_to<ranges::range_value_t<R>>,
                     Allocator>;

  template<ranges::input_range R, class Hash, class Allocator>
  unordered_set(
    from_range_t, R&&, typename /* see description */ ::size_type, Hash, Allocator)
    -> unordered_set<ranges::range_value_t<R>,
                     Hash,
                     equal_to<ranges::range_value_t<R>>,
                     Allocator>;

  template<class T, class Allocator>
  unordered_set(initializer_list<T>,
                typename /* see description */ ::size_type,
                Allocator) -> unordered_set<T, hash<T>, equal_to<T>, Allocator>;

  template<class T, class Hash, class Allocator>
  unordered_set(initializer_list<T>,
                typename /* see description */ ::size_type,
                Hash,
                Allocator) -> unordered_set<T, Hash, equal_to<T>, Allocator>;
}

Class template std::unordered_multiset

namespace std {
  template<class Key,
           class Hash = hash<Key>,
           class Pred = equal_to<Key>,
           class Allocator = allocator<Key>>
  class unordered_multiset
  {
  public:
    // types
    using key_type = Key;
    using value_type = Key;
    using hasher = Hash;
    using key_equal = Pred;
    using allocator_type = Allocator;
    using pointer = allocator_traits<Allocator>::pointer;
    using const_pointer = allocator_traits<Allocator>::const_pointer;
    using reference = value_type&;
    using const_reference = const value_type&;
    using size_type = /* implementation-defined */;
    using difference_type = /* implementation-defined */;

    using iterator = /* implementation-defined */;
    using const_iterator = /* implementation-defined */;
    using local_iterator = /* implementation-defined */;
    using const_local_iterator = /* implementation-defined */;
    using node_type = /* unspecified */;

    // construct/copy/destroy
    constexpr unordered_multiset();
    constexpr explicit unordered_multiset(size_type n,
                                          const hasher& hf = hasher(),
                                          const key_equal& eql = key_equal(),
                                          const allocator_type& a = allocator_type());
    template<class InputIter>
    constexpr unordered_multiset(InputIter f,
                                 InputIter l,
                                 size_type n = /* see description */,
                                 const hasher& hf = hasher(),
                                 const key_equal& eql = key_equal(),
                                 const allocator_type& a = allocator_type());
    template<container-compatible-range<value_type> R>
    constexpr unordered_multiset(from_range_t,
                                 R&& rg,
                                 size_type n = /* see description */,
                                 const hasher& hf = hasher(),
                                 const key_equal& eql = key_equal(),
                                 const allocator_type& a = allocator_type());
    constexpr unordered_multiset(const unordered_multiset&);
    constexpr unordered_multiset(unordered_multiset&&);
    constexpr explicit unordered_multiset(const Allocator&);
    constexpr unordered_multiset(const unordered_multiset&,
                                 const type_identity_t<Allocator>&);
    constexpr unordered_multiset(unordered_multiset&&, const type_identity_t<Allocator>&);
    constexpr unordered_multiset(initializer_list<value_type> il,
                                 size_type n = /* see description */,
                                 const hasher& hf = hasher(),
                                 const key_equal& eql = key_equal(),
                                 const allocator_type& a = allocator_type());
    constexpr unordered_multiset(size_type n, const allocator_type& a)
      : unordered_multiset(n, hasher(), key_equal(), a)
    {
    }
    constexpr unordered_multiset(size_type n, const hasher& hf, const allocator_type& a)
      : unordered_multiset(n, hf, key_equal(), a)
    {
    }
    template<class InputIter>
    constexpr unordered_multiset(InputIter f,
                                 InputIter l,
                                 size_type n,
                                 const allocator_type& a)
      : unordered_multiset(f, l, n, hasher(), key_equal(), a)
    {
    }
    template<class InputIter>
    constexpr unordered_multiset(
      InputIter f, InputIter l, size_type n, const hasher& hf, const allocator_type& a)
      : unordered_multiset(f, l, n, hf, key_equal(), a)
    {
    }
    template<container-compatible-range<value_type> R>
    constexpr unordered_multiset(from_range_t,
                                 R&& rg,
                                 size_type n,
                                 const allocator_type& a)
      : unordered_multiset(from_range, std::forward<R>(rg), n, hasher(), key_equal(), a)
    {
    }
    template<container-compatible-range<value_type> R>
    constexpr unordered_multiset(
      from_range_t, R&& rg, size_type n, const hasher& hf, const allocator_type& a)
      : unordered_multiset(from_range, std::forward<R>(rg), n, hf, key_equal(), a)
    {
    }
    constexpr unordered_multiset(initializer_list<value_type> il,
                                 size_type n,
                                 const allocator_type& a)
      : unordered_multiset(il, n, hasher(), key_equal(), a)
    {
    }
    constexpr unordered_multiset(initializer_list<value_type> il,
                                 size_type n,
                                 const hasher& hf,
                                 const allocator_type& a)
      : unordered_multiset(il, n, hf, key_equal(), a)
    {
    }
    constexpr ~unordered_multiset();
    constexpr unordered_multiset& operator=(const unordered_multiset&);
    constexpr unordered_multiset& operator=(unordered_multiset&&) noexcept(
      allocator_traits<Allocator>::is_always_equal::value&&
        is_nothrow_move_assignable_v<Hash>&& is_nothrow_move_assignable_v<Pred>);
    constexpr unordered_multiset& operator=(initializer_list<value_type>);
    constexpr allocator_type get_allocator() const noexcept;

    // iterators
    constexpr iterator begin() noexcept;
    constexpr const_iterator begin() const noexcept;
    constexpr iterator end() noexcept;
    constexpr const_iterator end() const noexcept;
    constexpr const_iterator cbegin() const noexcept;
    constexpr const_iterator cend() const noexcept;

    // capacity
    constexpr bool empty() const noexcept;
    constexpr size_type size() const noexcept;
    constexpr size_type max_size() const noexcept;

    // modifiers
    template<class... Args> constexpr iterator emplace(Args&&... args);
    template<class... Args>
    constexpr iterator emplace_hint(const_iterator position, Args&&... args);
    constexpr iterator insert(const value_type& obj);
    constexpr iterator insert(value_type&& obj);
    constexpr iterator insert(const_iterator hint, const value_type& obj);
    constexpr iterator insert(const_iterator hint, value_type&& obj);
    template<class InputIter> constexpr void insert(InputIter first, InputIter last);
    template<container-compatible-range<value_type> R>
    constexpr void insert_range(R&& rg);
    constexpr void insert(initializer_list<value_type>);

    constexpr node_type extract(const_iterator position);
    constexpr node_type extract(const key_type& x);
    template<class K> constexpr node_type extract(K&& x);
    constexpr iterator insert(node_type&& nh);
    constexpr iterator insert(const_iterator hint, node_type&& nh);

    constexpr iterator erase(iterator position)
      requires(!same_as<iterator, const_iterator>);
    constexpr iterator erase(const_iterator position);
    constexpr size_type erase(const key_type& k);
    template<class K> constexpr size_type erase(K&& x);
    constexpr iterator erase(const_iterator first, const_iterator last);
    constexpr void swap(unordered_multiset&) noexcept(
      allocator_traits<Allocator>::is_always_equal::value&& is_nothrow_swappable_v<Hash>&&
        is_nothrow_swappable_v<Pred>);
    constexpr void clear() noexcept;

    template<class H2, class P2>
    constexpr void merge(unordered_multiset<Key, H2, P2, Allocator>& source);
    template<class H2, class P2>
    constexpr void merge(unordered_multiset<Key, H2, P2, Allocator>&& source);
    template<class H2, class P2>
    constexpr void merge(unordered_set<Key, H2, P2, Allocator>& source);
    template<class H2, class P2>
    constexpr void merge(unordered_set<Key, H2, P2, Allocator>&& source);

    // observers
    constexpr hasher hash_function() const;
    constexpr key_equal key_eq() const;

    // set operations
    constexpr iterator find(const key_type& k);
    constexpr const_iterator find(const key_type& k) const;
    template<class K> constexpr iterator find(const K& k);
    template<class K> constexpr const_iterator find(const K& k) const;
    constexpr size_type count(const key_type& k) const;
    template<class K> constexpr size_type count(const K& k) const;
    constexpr bool contains(const key_type& k) const;
    template<class K> constexpr bool contains(const K& k) const;
    constexpr pair<iterator, iterator> equal_range(const key_type& k);
    constexpr pair<const_iterator, const_iterator> equal_range(const key_type& k) const;
    template<class K> constexpr pair<iterator, iterator> equal_range(const K& k);
    template<class K>
    constexpr pair<const_iterator, const_iterator> equal_range(const K& k) const;

    // bucket interface
    constexpr size_type bucket_count() const noexcept;
    constexpr size_type max_bucket_count() const noexcept;
    constexpr size_type bucket_size(size_type n) const;
    constexpr size_type bucket(const key_type& k) const;
    template<class K> constexpr size_type bucket(const K& k) const;
    constexpr local_iterator begin(size_type n);
    constexpr const_local_iterator begin(size_type n) const;
    constexpr local_iterator end(size_type n);
    constexpr const_local_iterator end(size_type n) const;
    constexpr const_local_iterator cbegin(size_type n) const;
    constexpr const_local_iterator cend(size_type n) const;

    // hash policy
    constexpr float load_factor() const noexcept;
    constexpr float max_load_factor() const noexcept;
    constexpr void max_load_factor(float z);
    constexpr void rehash(size_type n);
    constexpr void reserve(size_type n);
  };

  template<class InputIter,
           class Hash = hash</*iter-value-type*/<InputIter>>,
           class Pred = equal_to</*iter-value-type*/<InputIter>>,
           class Allocator = allocator</*iter-value-type*/<InputIter>>>
  unordered_multiset(InputIter,
                     InputIter,
                     typename /* see description */ ::size_type = /* see description */,
                     Hash = Hash(),
                     Pred = Pred(),
                     Allocator = Allocator())
    -> unordered_multiset</*iter-value-type*/<InputIter>, Hash, Pred, Allocator>;

  template<ranges::input_range R,
           class Hash = hash<ranges::range_value_t<R>>,
           class Pred = equal_to<ranges::range_value_t<R>>,
           class Allocator = allocator<ranges::range_value_t<R>>>
  unordered_multiset(from_range_t,
                     R&&,
                     typename /* see description */ ::size_type = /* see description */,
                     Hash = Hash(),
                     Pred = Pred(),
                     Allocator = Allocator())
    -> unordered_multiset<ranges::range_value_t<R>, Hash, Pred, Allocator>;

  template<class T,
           class Hash = hash<T>,
           class Pred = equal_to<T>,
           class Allocator = allocator<T>>
  unordered_multiset(initializer_list<T>,
                     typename /* see description */ ::size_type = /* see description */,
                     Hash = Hash(),
                     Pred = Pred(),
                     Allocator = Allocator())
    -> unordered_multiset<T, Hash, Pred, Allocator>;

  template<class InputIter, class Allocator>
  unordered_multiset(InputIter,
                     InputIter,
                     typename /* see description */ ::size_type,
                     Allocator)
    -> unordered_multiset</*iter-value-type*/<InputIter>,
                          hash</*iter-value-type*/<InputIter>>,
                          equal_to</*iter-value-type*/<InputIter>>,
                          Allocator>;

  template<class InputIter, class Hash, class Allocator>
  unordered_multiset(
    InputIter, InputIter, typename /* see description */ ::size_type, Hash, Allocator)
    -> unordered_multiset</*iter-value-type*/<InputIter>,
                          Hash,
                          equal_to</*iter-value-type*/<InputIter>>,
                          Allocator>;

  template<ranges::input_range R, class Allocator>
  unordered_multiset(from_range_t,
                     R&&,
                     typename /* see description */ ::size_type,
                     Allocator) -> unordered_multiset<ranges::range_value_t<R>,
                                                      hash<ranges::range_value_t<R>>,
                                                      equal_to<ranges::range_value_t<R>>,
                                                      Allocator>;

  template<ranges::input_range R, class Allocator>
  unordered_multiset(from_range_t, R&&, Allocator)
    -> unordered_multiset<ranges::range_value_t<R>,
                          hash<ranges::range_value_t<R>>,
                          equal_to<ranges::range_value_t<R>>,
                          Allocator>;

  template<ranges::input_range R, class Hash, class Allocator>
  unordered_multiset(
    from_range_t, R&&, typename /* see description */ ::size_type, Hash, Allocator)
    -> unordered_multiset<ranges::range_value_t<R>,
                          Hash,
                          equal_to<ranges::range_value_t<R>>,
                          Allocator>;

  template<class T, class Allocator>
  unordered_multiset(initializer_list<T>,
                     typename /* see description */ ::size_type,
                     Allocator) -> unordered_multiset<T, hash<T>, equal_to<T>, Allocator>;

  template<class T, class Hash, class Allocator>
  unordered_multiset(initializer_list<T>,
                     typename /* see description */ ::size_type,
                     Hash,
                     Allocator) -> unordered_multiset<T, Hash, equal_to<T>, Allocator>;
}

Compiler support
Freestanding and hosted
Language
Standard library
Standard library headers
Named requirements
Feature test macros (C++20)
Language support library
Concepts library (C++20)
Diagnostics library
Memory management library
Metaprogramming library (C++11)
General utilities library
Containers library
Iterators library
Ranges library (C++20)
Algorithms library
Strings library
Text processing library
Numerics library
Date and time library
Input/output library
Filesystem library (C++17)
Concurrency support library (C++11)
Execution control library (C++26)
Technical specifications
Symbols index
External libraries

cppreference.com

Search

Namespaces

Variants

Views

Actions

Standard library header <unordered_set> (C++11)

Contents

Includes

Classes

Functions

Range access

Synopsis

Class template std::unordered_set

Class template std::unordered_multiset

Navigation

Tools