标准库标头 <unordered_set>

 

C++

编译器支持

自立实现与有宿主实现

语言

标准库

标准库标头

具名要求

功能特性测试宏(C++20)

语言支持库

概念库(C++20)

诊断库

内存管理库

元编程库(C++11)

通用工具库

容器库

迭代器库

范围库(C++20)

算法库

字符串库

文本处理库

数值库

日期和时间库

输入/输出库

文件系统库(C++17)

并发支持库(C++11)

执行控制库(C++26)

技术规范

符号索引

外部库

 

标准库头

语言支持 <cfloat> <climits> <compare>(C++20) <contracts>(C++26) <coroutine>(C++20) <csetjmp> <csignal> <cstdarg> <cstddef> <cstdint>(C++11) <cstdlib> <exception> <initializer_list>(C++11)    <limits> <new> <source_location>(C++20) <stdfloat>(C++23) <typeinfo> <version>(C++20) 概念 <concepts>(C++20) 诊断 <cassert> <cerrno> <debugging>(C++26) <stacktrace>(C++23) <stdexcept> <system_error>(C++11) 内存管理 <memory> <memory_resource>(C++17) <scoped_allocator>(C++11) 元编程 <type_traits>(C++11) <ratio>(C++11)

通用工具 <any>(C++17) <bitset> <bit>(C++20) <charconv>(C++17) <expected>(C++23) <format>(C++20) <functional> <optional>(C++17) <stdbit.h>(C++26) <tuple>(C++11) <typeindex>(C++11) <utility> <variant>(C++17) 容器 <array>(C++11) <deque> <flat_map>(C++23) <flat_set>(C++23) <forward_list>(C++11) <hive>(C++26) <inplace_vector>(C++26)    <list> <map> <mdspan>(C++23) <queue> <set> <span>(C++20) <stack> <unordered_map>(C++11) <unordered_set>(C++11) <vector> 迭代器 <iterator> 范围 <generator>(C++23) <ranges>(C++20)

算法 <algorithm> <numeric> 字符串 <cctype> <cstring> <cuchar>(C++11) <cwchar> <cwctype> <string_view>(C++17) <string> 文本处理 <clocale> <codecvt>(C++11/17/26*) <locale> <regex>(C++11) <text_encoding>(C++26)    cpp/header#数值库数值 <cfenv>(C++11) <cmath> <complex> <linalg>(C++26) <numbers>(C++20) <random>(C++11) <simd>(C++26) <stdckdint.h>(C++26) <valarray> 时间 <chrono>(C++11) <ctime> C 兼容性 <ccomplex>(C++11/17/20*) <ciso646>(C++20 前) <cstdalign>(C++11/17/20*) <cstdbool>(C++11/17/20*) <ctgmath>(C++11/17/20*)

输入/输出 <cinttypes>(C++11) <cstdio> <filesystem>(C++17) <fstream> <iomanip> <iosfwd> <iostream> <ios> <istream> <ostream> <print>(C++23) <spanstream>(C++23) <sstream> <streambuf> <strstream>(C++98/26*) <syncstream>(C++20) 并发支持 <atomic>(C++11) <barrier>(C++20) <condition_variable>(C++11) <future>(C++11) <hazard_pointer>(C++26) <latch>(C++20) <mutex>(C++11) <rcu>(C++26) <semaphore>(C++20) <shared_mutex>(C++14) <stdatomic.h>(C++23) <stop_token>(C++20) <thread>(C++11) 执行支持 <execution>(C++17)

 

此头文件是容器库的一部分。

包含
<compare> (C++20)	三路比较运算符支持
<initializer_list> (C++11)	std::initializer_list 类模板
类
unordered_set (C++11 起)	唯一键的集合，按照键生成散列 (类模板)
unordered_multiset (C++11 起)	键的集合，按照键生成散列 (类模板)
函数
operator==operator!= (C++11)(C++11)(C++20 移除)	比较 unordered_set 中的值 (函数模板)
std::swap(std::unordered_set) (C++11)	特化 std::swap 算法 (函数模板)
erase_if(std::unordered_set) (C++20)	擦除所有满足特定判别标准的元素 (函数模板)
operator==operator!= (C++11)(C++11)(C++20 移除)	比较 unordered_multiset 中的值 (函数模板)
std::swap(std::unordered_multiset) (C++11)	特化 std::swap 算法 (函数模板)
erase_if(std::unordered_multiset) (C++20)	擦除所有满足特定判别标准的元素 (函数模板)
范围访问
begincbegin (C++11)(C++14)	返回指向容器或数组起始的迭代器 (函数模板)
endcend (C++11)(C++14)	返回指向容器或数组结尾的迭代器 (函数模板)
rbegincrbegin (C++14)	返回指向一个容器或数组的逆向迭代器 (函数模板)
rendcrend (C++14)	返回容器或数组的逆向尾迭代器 (函数模板)
sizessize (C++17)(C++20)	返回容器或数组的大小 (函数模板)
empty (C++17)	检查容器是否为空 (函数模板)
data (C++17)	获得指向底层数组的指针 (函数模板)

概要

#include <compare>#include <initializer_list>   namespace std {// 类模板 unordered_­settemplate<class Key, class Hash = hash<Key>, class Pred = equal_to<Key>, class Alloc = allocator<Key>>class unordered_set;   // 类模板 unordered_­multisettemplate<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>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>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>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>void swap(unordered_multiset<Key, Hash, Pred, Alloc>& x, unordered_multiset<Key, Hash, Pred, Alloc>& y)noexcept(noexcept(x.swap(y)));   // unordered_set 的擦除template<class K, class H, class P, class A, class Predicate>typename unordered_set<K, H, P, A>::size_type erase_if(unordered_set<K, H, P, A>& c, Predicate pred);   // unordered_multiset 的擦除template<class K, class H, class P, class A, class Predicate>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>>;}}

类模板 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:// 类型using key_type = Key;using value_type = Key;using hasher = Hash;using key_equal = Pred;using allocator_type = Allocator;using pointer =typename allocator_traits<Allocator>::pointer;using const_pointer =typename allocator_traits<Allocator>::const_pointer;using reference = value_type&;using const_reference =const value_type&;using size_type =/* 由实现定义 */;using difference_type =/* 由实现定义 */;   using iterator =/* 由实现定义 */;using const_iterator =/* 由实现定义 */;using local_iterator =/* 由实现定义 */;using const_local_iterator =/* 由实现定义 */;using node_type =/* 未指明 */;using insert_return_type =/*insert-return-type*/<iterator, node_type>;   // 构造/复制/销毁 unordered_set();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> unordered_set(InputIter f, InputIter l, size_type n =/* 见描述 */, const hasher& hf = hasher(), const key_equal& eql = key_equal(), const allocator_type& a = allocator_type());template<container-compatible-range<value_type> R> unordered_set(from_range_t, R&& rg, size_type n =/* 见描述 */, const hasher& hf = hasher(), const key_equal& eql = key_equal(), const allocator_type& a = allocator_type()); unordered_set(const unordered_set&); unordered_set(unordered_set&&);explicit unordered_set(const Allocator&); unordered_set(const unordered_set&, const type_identity_t<Allocator>&); unordered_set(unordered_set&&, const type_identity_t<Allocator>&); unordered_set(initializer_list<value_type> il, size_type n =/* 见描述 */, const hasher& hf = hasher(), const key_equal& eql = key_equal(), const allocator_type& a = allocator_type()); unordered_set(size_type n, const allocator_type& a): unordered_set(n, hasher(), key_equal(), a){} unordered_set(size_type n, const hasher& hf, const allocator_type& a): unordered_set(n, hf, key_equal(), a){}template<class InputIter> 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> 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){} 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> 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> 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){} 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){} ~unordered_set(); unordered_set& operator=(const unordered_set&); 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>); unordered_set& operator=(initializer_list<value_type>); allocator_type get_allocator()constnoexcept;   // 迭代器 iterator begin()noexcept; const_iterator begin()constnoexcept; iterator end()noexcept; const_iterator end()constnoexcept; const_iterator cbegin()constnoexcept; const_iterator cend()constnoexcept;   // 容量bool empty()constnoexcept; size_type size()constnoexcept; size_type max_size()constnoexcept;   // 修改器template<class... Args> pair<iterator, bool> emplace(Args&&... args);template<class... Args> iterator emplace_hint(const_iterator position, Args&&... args); pair<iterator, bool> insert(const value_type& obj); pair<iterator, bool> insert(value_type&& obj);template<class K> pair<iterator, bool> insert(K&& obj); iterator insert(const_iterator hint, const value_type& obj); iterator insert(const_iterator hint, value_type&& obj);template<class K> iterator insert(const_iterator hint, K&& obj);template<class InputIter>void insert(InputIter first, InputIter last);template<container-compatible-range<value_type> R>void insert_range(R&& rg);void insert(initializer_list<value_type>);   node_type extract(const_iterator position); node_type extract(const key_type& x);template<class K> node_type extract(K&& x); insert_return_type insert(node_type&& nh); iterator insert(const_iterator hint, node_type&& nh);   iterator erase(iterator position) requires(!same_as<iterator, const_iterator>); iterator erase(const_iterator position); size_type erase(const key_type& k);template<class K> size_type erase(K&& x); iterator erase(const_iterator first, const_iterator last);void swap(unordered_set&)noexcept( allocator_traits<Allocator>::is_always_equal::value&& is_nothrow_swappable_v<Hash>&& is_nothrow_swappable_v<Pred>);void clear()noexcept;   template<class H2, class P2>void merge(unordered_set<Key, H2, P2, Allocator>& source);template<class H2, class P2>void merge(unordered_set<Key, H2, P2, Allocator>&& source);template<class H2, class P2>void merge(unordered_multiset<Key, H2, P2, Allocator>& source);template<class H2, class P2>void merge(unordered_multiset<Key, H2, P2, Allocator>&& source);   // 观察器 hasher hash_function()const; key_equal key_eq()const;   // set 操作 iterator find(const key_type& k); const_iterator find(const key_type& k)const;template<class K> iterator find(const K& k);template<class K> const_iterator find(const K& k)const; size_type count(const key_type& k)const;template<class K> size_type count(const K& k)const;bool contains(const key_type& k)const;template<class K>bool contains(const K& k)const; pair<iterator, iterator> equal_range(const key_type& k); pair<const_iterator, const_iterator> equal_range(const key_type& k)const;template<class K> pair<iterator, iterator> equal_range(const K& k);template<class K> pair<const_iterator, const_iterator> equal_range(const K& k)const;   // 桶接口 size_type bucket_count()constnoexcept; size_type max_bucket_count()constnoexcept; size_type bucket_size(size_type n)const; size_type bucket(const key_type& k)const;template<class K> size_type bucket(const K& k)const; local_iterator begin(size_type n); const_local_iterator begin(size_type n)const; local_iterator end(size_type n); const_local_iterator end(size_type n)const; const_local_iterator cbegin(size_type n)const; const_local_iterator cend(size_type n)const;   // 散列策略float load_factor()constnoexcept;float max_load_factor()constnoexcept;void max_load_factor(float z);void rehash(size_type n);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/* 见描述 */::size_type=/* 见描述 */, 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/* 见描述 */::size_type=/* 见描述 */, 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/* 见描述 */::size_type=/* 见描述 */, Hash = Hash(), Pred = Pred(), Allocator = Allocator())-> unordered_set<T, Hash, Pred, Allocator>;   template<class InputIter, class Allocator> unordered_set(InputIter, InputIter, typename/* 见描述 */::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/* 见描述 */::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/* 见描述 */::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/* 见描述 */::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/* 见描述 */::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/* 见描述 */::size_type, Hash, Allocator)-> unordered_set<T, Hash, equal_to<T>, Allocator>;}

类模板 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:// 类型using key_type = Key;using value_type = Key;using hasher = Hash;using key_equal = Pred;using allocator_type = Allocator;using pointer =typename allocator_traits<Allocator>::pointer;using const_pointer =typename allocator_traits<Allocator>::const_pointer;using reference = value_type&;using const_reference =const value_type&;using size_type =/* 由实现定义 */;using difference_type =/* 由实现定义 */;   using iterator =/* 由实现定义 */;using const_iterator =/* 由实现定义 */;using local_iterator =/* 由实现定义 */;using const_local_iterator =/* 由实现定义 */;using node_type =/* 未指明 */;   // 构造/复制/销毁 unordered_multiset();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> unordered_multiset(InputIter f, InputIter l, size_type n =/* 见描述 */, const hasher& hf = hasher(), const key_equal& eql = key_equal(), const allocator_type& a = allocator_type());template<container-compatible-range<value_type> R> unordered_multiset(from_range_t, R&& rg, size_type n =/* 见描述 */, const hasher& hf = hasher(), const key_equal& eql = key_equal(), const allocator_type& a = allocator_type()); unordered_multiset(const unordered_multiset&); unordered_multiset(unordered_multiset&&);explicit unordered_multiset(const Allocator&); unordered_multiset(const unordered_multiset&, const type_identity_t<Allocator>&); unordered_multiset(unordered_multiset&&, const type_identity_t<Allocator>&); unordered_multiset(initializer_list<value_type> il, size_type n =/* 见描述 */, const hasher& hf = hasher(), const key_equal& eql = key_equal(), const allocator_type& a = allocator_type()); unordered_multiset(size_type n, const allocator_type& a): unordered_multiset(n, hasher(), key_equal(), a){} unordered_multiset(size_type n, const hasher& hf, const allocator_type& a): unordered_multiset(n, hf, key_equal(), a){}template<class InputIter> 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> 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> 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> 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){} unordered_multiset(initializer_list<value_type> il, size_type n, const allocator_type& a): unordered_multiset(il, n, hasher(), key_equal(), a){} 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){} ~unordered_multiset(); unordered_multiset& operator=(const unordered_multiset&); 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>); unordered_multiset& operator=(initializer_list<value_type>); allocator_type get_allocator()constnoexcept;   // 迭代器 iterator begin()noexcept; const_iterator begin()constnoexcept; iterator end()noexcept; const_iterator end()constnoexcept; const_iterator cbegin()constnoexcept; const_iterator cend()constnoexcept;   // 容量bool empty()constnoexcept; size_type size()constnoexcept; size_type max_size()constnoexcept;   // 修改器template<class... Args> iterator emplace(Args&&... args);template<class... Args> iterator emplace_hint(const_iterator position, Args&&... args); iterator insert(const value_type& obj); iterator insert(value_type&& obj); iterator insert(const_iterator hint, const value_type& obj); iterator insert(const_iterator hint, value_type&& obj);template<class InputIter>void insert(InputIter first, InputIter last);template<container-compatible-range<value_type> R>void insert_range(R&& rg);void insert(initializer_list<value_type>);   node_type extract(const_iterator position); node_type extract(const key_type& x);template<class K> node_type extract(K&& x); iterator insert(node_type&& nh); iterator insert(const_iterator hint, node_type&& nh);   iterator erase(iterator position) requires(!same_as<iterator, const_iterator>); iterator erase(const_iterator position); size_type erase(const key_type& k);template<class K> size_type erase(K&& x); iterator erase(const_iterator first, const_iterator last);void swap(unordered_multiset&)noexcept( allocator_traits<Allocator>::is_always_equal::value&& is_nothrow_swappable_v<Hash>&& is_nothrow_swappable_v<Pred>);void clear()noexcept;   template<class H2, class P2>void merge(unordered_multiset<Key, H2, P2, Allocator>& source);template<class H2, class P2>void merge(unordered_multiset<Key, H2, P2, Allocator>&& source);template<class H2, class P2>void merge(unordered_set<Key, H2, P2, Allocator>& source);template<class H2, class P2>void merge(unordered_set<Key, H2, P2, Allocator>&& source);   // 观察器 hasher hash_function()const; key_equal key_eq()const;   // set 操作 iterator find(const key_type& k); const_iterator find(const key_type& k)const;template<class K> iterator find(const K& k);template<class K> const_iterator find(const K& k)const; size_type count(const key_type& k)const;template<class K> size_type count(const K& k)const;bool contains(const key_type& k)const;template<class K>bool contains(const K& k)const; pair<iterator, iterator> equal_range(const key_type& k); pair<const_iterator, const_iterator> equal_range(const key_type& k)const;template<class K> pair<iterator, iterator> equal_range(const K& k);template<class K> pair<const_iterator, const_iterator> equal_range(const K& k)const;   // 桶接口 size_type bucket_count()constnoexcept; size_type max_bucket_count()constnoexcept; size_type bucket_size(size_type n)const; size_type bucket(const key_type& k)const;template<class K> size_type bucket(const K& k)const; local_iterator begin(size_type n); const_local_iterator begin(size_type n)const; local_iterator end(size_type n); const_local_iterator end(size_type n)const; const_local_iterator cbegin(size_type n)const; const_local_iterator cend(size_type n)const;   // 散列策略float load_factor()constnoexcept;float max_load_factor()constnoexcept;void max_load_factor(float z);void rehash(size_type n);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, /* 见描述 */::size_type=/* 见描述 */, 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/* 见描述 */::size_type=/* 见描述 */, 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/* 见描述 */::size_type=/* 见描述 */, Hash = Hash(), Pred = Pred(), Allocator = Allocator())-> unordered_multiset<T, Hash, Pred, Allocator>;   template<class InputIter, class Allocator> unordered_multiset(InputIter, InputIter, typename/* 见描述 */::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/* 见描述 */::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/* 见描述 */::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/* 见描述 */::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/* 见描述 */::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/* 见描述 */::size_type, Hash, Allocator)-> unordered_multiset<T, Hash, equal_to<T>, Allocator>;}