713 lines
86 KiB
HTML
713 lines
86 KiB
HTML
<!DOCTYPE html>
|
|
<html lang="zh" dir="ltr" class="client-nojs" xmlns="http://www.w3.org/1999/xhtml" xml:lang="zh">
|
|
<head><meta http-equiv="x-ua-compatible" content="ie=edge">
|
|
<meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
|
|
<title>标准库头文件 <unordered_set></title>
|
|
<link rel="stylesheet" href="ext.css" />
|
|
<link rel="stylesheet" href="site_modules.css" />
|
|
</head>
|
|
<body class="mediawiki ltr sitedir-ltr ns-0 ns-subject page-cpp_header_unordered_set skin-cppreference2 action-view cpp-navbar">
|
|
<div id="cpp-content-base">
|
|
<div id="content"><a id="top"></a>
|
|
<h1 id="firstHeading" class="firstHeading"><span style="font-size:0.7em; line-height:130%">标准库头文件</span> <unordered_set></h1>
|
|
<div id="bodyContent">
|
|
<div id="contentSub"><span class="subpages">< <a href="cpp.html">cpp</a>‎ | <a href="cpp-header.html">header</a></span></div>
|
|
<div id="mw-content-text" lang="zh" dir="ltr" class="mw-content-ltr" xml:lang="zh">
|
|
<p>此头文件是<a href="cpp-container.html">容器</a>库的一部分。</p>
|
|
<table class="t-dsc-begin">
|
|
<tr>
|
|
<td colspan="2">
|
|
<h3><span class="mw-headline" id=".E5.8C.85.E5.90.AB">包含</span></h3>
|
|
</td>
|
|
</tr>
|
|
<tr class="t-dsc">
|
|
<td>
|
|
<div class="t-dsc-member-div">
|
|
<div><a href="cpp-header-compare.html"><span class="t-lines"><span><compare></span></span></a></div>
|
|
<div><span class="t-lines"><span><span class="t-mark-rev t-since-cxx20">(C++20)</span></span></span></div>
|
|
</div>
|
|
</td>
|
|
<td><a href="cpp-language-operator_comparison.html#.E4.B8.89.E8.B7.AF.E6.AF.94.E8.BE.83">三路比较运算符</a>支持</td>
|
|
</tr>
|
|
<tr class="t-dsc">
|
|
<td>
|
|
<div class="t-dsc-member-div">
|
|
<div><a href="cpp-header-initializer_list.html"><span class="t-lines"><span><initializer_list></span></span></a></div>
|
|
<div><span class="t-lines"><span><span class="t-mark-rev t-since-cxx11">(C++11)</span></span></span></div>
|
|
</div>
|
|
</td>
|
|
<td><span class="t-lc"><a href="cpp-utility-initializer_list.html">std::initializer_list</a></span> 类模板</td>
|
|
</tr>
|
|
<tr>
|
|
<td colspan="2">
|
|
<h3><span class="mw-headline" id=".E7.B1.BB">类</span></h3>
|
|
</td>
|
|
</tr>
|
|
<tr class="t-dsc">
|
|
<td>
|
|
<div class="t-dsc-member-div">
|
|
<div><a href="cpp-container-unordered_set.html"><span class="t-lines"><span>unordered_set</span></span></a></div>
|
|
<div><span class="t-lines"><span><span class="t-mark-rev t-since-cxx11">(C++11 起)</span></span></span></div>
|
|
</div>
|
|
</td>
|
|
<td>唯一键的集合，按照键生成散列<br />
|
|
<span class="t-mark">(类模板)</span></td>
|
|
</tr>
|
|
<tr class="t-dsc">
|
|
<td>
|
|
<div class="t-dsc-member-div">
|
|
<div><a href="cpp-container-unordered_multiset.html"><span class="t-lines"><span>unordered_multiset</span></span></a></div>
|
|
<div><span class="t-lines"><span><span class="t-mark-rev t-since-cxx11">(C++11 起)</span></span></span></div>
|
|
</div>
|
|
</td>
|
|
<td>键的集合，按照键生成散列<br />
|
|
<span class="t-mark">(类模板)</span></td>
|
|
</tr>
|
|
<tr>
|
|
<td colspan="2">
|
|
<h3><span class="mw-headline" id=".E5.87.BD.E6.95.B0">函数</span></h3>
|
|
</td>
|
|
</tr>
|
|
<tr class="t-dsc">
|
|
<td>
|
|
<div class="t-dsc-member-div">
|
|
<div><a href="cpp-container-unordered_set-operator_cmp.html"><span class="t-lines"><span>operator==</span><span>operator!=</span></span></a></div>
|
|
<div><span class="t-lines"><span></span><span><span class="t-mark-rev t-until-cxx20">(C++20 中移除)</span></span></span></div>
|
|
</div>
|
|
</td>
|
|
<td>比较 unordered_set 中的值<br />
|
|
<span class="t-mark">(函数模板)</span></td>
|
|
</tr>
|
|
<tr class="t-dsc">
|
|
<td>
|
|
<div class="t-dsc-member-div">
|
|
<div><a href="cpp-container-unordered_set-swap2.html"><span class="t-lines"><span>std::swap<span class="t-dsc-small">(std::unordered_set)</span></span></span></a></div>
|
|
<div><span class="t-lines"><span><span class="t-mark-rev t-since-cxx11">(C++11)</span></span></span></div>
|
|
</div>
|
|
</td>
|
|
<td>特化 <span class="t-lc"><a href="cpp-algorithm-swap.html">std::swap</a></span> 算法<br />
|
|
<span class="t-mark">(函数模板)</span></td>
|
|
</tr>
|
|
<tr class="t-dsc">
|
|
<td>
|
|
<div class="t-dsc-member-div">
|
|
<div><a href="cpp-container-unordered_set-erase_if.html"><span class="t-lines"><span>erase_if<span class="t-dsc-small">(std::unordered_set)</span></span></span></a></div>
|
|
<div><span class="t-lines"><span><span class="t-mark-rev t-since-cxx20">(C++20)</span></span></span></div>
|
|
</div>
|
|
</td>
|
|
<td>擦除所有满足特定判别标准的元素<br />
|
|
<span class="t-mark">(函数模板)</span></td>
|
|
</tr>
|
|
<tr class="t-dsc">
|
|
<td>
|
|
<div class="t-dsc-member-div">
|
|
<div><a href="cpp-container-unordered_multiset-operator_cmp.html"><span class="t-lines"><span>operator==</span><span>operator!=</span></span></a></div>
|
|
<div><span class="t-lines"><span></span><span><span class="t-mark-rev t-until-cxx20">(C++20 中移除)</span></span></span></div>
|
|
</div>
|
|
</td>
|
|
<td>比较 unordered_multiset 中的值<br />
|
|
<span class="t-mark">(函数模板)</span></td>
|
|
</tr>
|
|
<tr class="t-dsc">
|
|
<td>
|
|
<div class="t-dsc-member-div">
|
|
<div><a href="cpp-container-unordered_multiset-swap2.html"><span class="t-lines"><span>std::swap<span class="t-dsc-small">(std::unordered_multiset)</span></span></span></a></div>
|
|
<div><span class="t-lines"><span><span class="t-mark-rev t-since-cxx11">(C++11)</span></span></span></div>
|
|
</div>
|
|
</td>
|
|
<td>特化 <span class="t-lc"><a href="cpp-algorithm-swap.html">std::swap</a></span> 算法<br />
|
|
<span class="t-mark">(函数模板)</span></td>
|
|
</tr>
|
|
<tr class="t-dsc">
|
|
<td>
|
|
<div class="t-dsc-member-div">
|
|
<div><a href="cpp-container-unordered_multiset-erase_if.html"><span class="t-lines"><span>erase_if<span class="t-dsc-small">(std::unordered_multiset)</span></span></span></a></div>
|
|
<div><span class="t-lines"><span><span class="t-mark-rev t-since-cxx20">(C++20)</span></span></span></div>
|
|
</div>
|
|
</td>
|
|
<td>擦除所有满足特定判别标准的元素<br />
|
|
<span class="t-mark">(函数模板)</span></td>
|
|
</tr>
|
|
<tr>
|
|
<td colspan="2">
|
|
<h5><span class="mw-headline" id=".E8.8C.83.E5.9B.B4.E8.AE.BF.E9.97.AE">范围访问</span></h5>
|
|
</td>
|
|
</tr>
|
|
<tr class="t-dsc">
|
|
<td>
|
|
<div class="t-dsc-member-div">
|
|
<div><a href="cpp-iterator-begin.html"><span class="t-lines"><span>begin</span><span>cbegin</span></span></a></div>
|
|
<div><span class="t-lines"><span><span class="t-mark-rev t-since-cxx11">(C++11)</span></span><span><span class="t-mark-rev t-since-cxx14">(C++14)</span></span></span></div>
|
|
</div>
|
|
</td>
|
|
<td>返回指向容器或数组起始的迭代器<br />
|
|
<span class="t-mark">(函数模板)</span></td>
|
|
</tr>
|
|
<tr class="t-dsc">
|
|
<td>
|
|
<div class="t-dsc-member-div">
|
|
<div><a href="cpp-iterator-end.html"><span class="t-lines"><span>end</span><span>cend</span></span></a></div>
|
|
<div><span class="t-lines"><span><span class="t-mark-rev t-since-cxx11">(C++11)</span></span><span><span class="t-mark-rev t-since-cxx14">(C++14)</span></span></span></div>
|
|
</div>
|
|
</td>
|
|
<td>返回指向容器或数组结尾的迭代器<br />
|
|
<span class="t-mark">(函数模板)</span></td>
|
|
</tr>
|
|
<tr class="t-dsc">
|
|
<td>
|
|
<div class="t-dsc-member-div">
|
|
<div><a href="cpp-iterator-rbegin.html"><span class="t-lines"><span>rbegin</span><span>crbegin</span></span></a></div>
|
|
<div><span class="t-lines"><span><span class="t-mark-rev t-since-cxx14">(C++14)</span></span></span></div>
|
|
</div>
|
|
</td>
|
|
<td>返回指向一个容器或数组的逆向迭代器<br />
|
|
<span class="t-mark">(函数模板)</span></td>
|
|
</tr>
|
|
<tr class="t-dsc">
|
|
<td>
|
|
<div class="t-dsc-member-div">
|
|
<div><a href="cpp-iterator-rend.html"><span class="t-lines"><span>rend</span><span>crend</span></span></a></div>
|
|
<div><span class="t-lines"><span><span class="t-mark-rev t-since-cxx14">(C++14)</span></span></span></div>
|
|
</div>
|
|
</td>
|
|
<td>返回容器或数组的逆向尾迭代器<br />
|
|
<span class="t-mark">(函数模板)</span></td>
|
|
</tr>
|
|
<tr class="t-dsc">
|
|
<td>
|
|
<div class="t-dsc-member-div">
|
|
<div><a href="cpp-iterator-size.html"><span class="t-lines"><span>size</span><span>ssize</span></span></a></div>
|
|
<div><span class="t-lines"><span><span class="t-mark-rev t-since-cxx17">(C++17)</span></span><span><span class="t-mark-rev t-since-cxx20">(C++20)</span></span></span></div>
|
|
</div>
|
|
</td>
|
|
<td>返回容器或数组的大小<br />
|
|
<span class="t-mark">(函数模板)</span></td>
|
|
</tr>
|
|
<tr class="t-dsc">
|
|
<td>
|
|
<div class="t-dsc-member-div">
|
|
<div><a href="cpp-iterator-empty.html"><span class="t-lines"><span>empty</span></span></a></div>
|
|
<div><span class="t-lines"><span><span class="t-mark-rev t-since-cxx17">(C++17)</span></span></span></div>
|
|
</div>
|
|
</td>
|
|
<td>检查容器是否为空<br />
|
|
<span class="t-mark">(函数模板)</span></td>
|
|
</tr>
|
|
<tr class="t-dsc">
|
|
<td>
|
|
<div class="t-dsc-member-div">
|
|
<div><a href="cpp-iterator-data.html"><span class="t-lines"><span>data</span></span></a></div>
|
|
<div><span class="t-lines"><span><span class="t-mark-rev t-since-cxx17">(C++17)</span></span></span></div>
|
|
</div>
|
|
</td>
|
|
<td>获得指向底层数组的指针<br />
|
|
<span class="t-mark">(函数模板)</span></td>
|
|
</tr>
|
|
</table>
|
|
<h3><span class="mw-headline" id=".E6.A6.82.E8.A6.81">概要</span></h3>
|
|
<div dir="ltr" class="mw-geshi" style="text-align: left;">
|
|
<div class="cpp source-cpp">
|
|
<pre class="de1"><span class="co2">#include <compare></span>
|
|
<span class="co2">#include <initializer_list></span>
|
|
|
|
<span class="kw1">namespace</span> std <span class="br0">{</span>
|
|
<span class="co1">// 类模板 unordered_­set</span>
|
|
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> Key,
|
|
<span class="kw1">class</span> Hash <span class="sy1">=</span> hash<span class="sy1"><</span>Key<span class="sy1">></span>,
|
|
<span class="kw1">class</span> Pred <span class="sy1">=</span> equal_to<span class="sy1"><</span>Key<span class="sy1">></span>,
|
|
<span class="kw1">class</span> Alloc <span class="sy1">=</span> allocator<span class="sy1"><</span>Key<span class="sy1">>></span>
|
|
<span class="kw1">class</span> unordered_set<span class="sy4">;</span>
|
|
|
|
<span class="co1">// 类模板 unordered_­multiset</span>
|
|
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> Key,
|
|
<span class="kw1">class</span> Hash <span class="sy1">=</span> hash<span class="sy1"><</span>Key<span class="sy1">></span>,
|
|
<span class="kw1">class</span> Pred <span class="sy1">=</span> equal_to<span class="sy1"><</span>Key<span class="sy1">></span>,
|
|
<span class="kw1">class</span> Alloc <span class="sy1">=</span> allocator<span class="sy1"><</span>Key<span class="sy1">>></span>
|
|
<span class="kw1">class</span> unordered_multiset<span class="sy4">;</span>
|
|
|
|
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> Key, <span class="kw1">class</span> Hash, <span class="kw1">class</span> Pred, <span class="kw1">class</span> Alloc<span class="sy1">></span>
|
|
<span class="kw4">bool</span> operator<span class="sy1">==</span><span class="br0">(</span><span class="kw4">const</span> unordered_set<span class="sy1"><</span>Key, Hash, Pred, Alloc<span class="sy1">></span><span class="sy3">&</span> a,
|
|
<span class="kw4">const</span> unordered_set<span class="sy1"><</span>Key, Hash, Pred, Alloc<span class="sy1">></span><span class="sy3">&</span> b<span class="br0">)</span><span class="sy4">;</span>
|
|
|
|
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> Key, <span class="kw1">class</span> Hash, <span class="kw1">class</span> Pred, <span class="kw1">class</span> Alloc<span class="sy1">></span>
|
|
<span class="kw4">bool</span> operator<span class="sy1">==</span><span class="br0">(</span><span class="kw4">const</span> unordered_multiset<span class="sy1"><</span>Key, Hash, Pred, Alloc<span class="sy1">></span><span class="sy3">&</span> a,
|
|
<span class="kw4">const</span> unordered_multiset<span class="sy1"><</span>Key, Hash, Pred, Alloc<span class="sy1">></span><span class="sy3">&</span> b<span class="br0">)</span><span class="sy4">;</span>
|
|
|
|
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> Key, <span class="kw1">class</span> Hash, <span class="kw1">class</span> Pred, <span class="kw1">class</span> Alloc<span class="sy1">></span>
|
|
<span class="kw4">void</span> swap<span class="br0">(</span>unordered_set<span class="sy1"><</span>Key, Hash, Pred, Alloc<span class="sy1">></span><span class="sy3">&</span> x,
|
|
unordered_set<span class="sy1"><</span>Key, Hash, Pred, Alloc<span class="sy1">></span><span class="sy3">&</span> y<span class="br0">)</span>
|
|
<span class="kw1">noexcept</span><span class="br0">(</span><span class="kw1">noexcept</span><span class="br0">(</span>x.<span class="me1">swap</span><span class="br0">(</span>y<span class="br0">)</span><span class="br0">)</span><span class="br0">)</span><span class="sy4">;</span>
|
|
|
|
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> Key, <span class="kw1">class</span> Hash, <span class="kw1">class</span> Pred, <span class="kw1">class</span> Alloc<span class="sy1">></span>
|
|
<span class="kw4">void</span> swap<span class="br0">(</span>unordered_multiset<span class="sy1"><</span>Key, Hash, Pred, Alloc<span class="sy1">></span><span class="sy3">&</span> x,
|
|
unordered_multiset<span class="sy1"><</span>Key, Hash, Pred, Alloc<span class="sy1">></span><span class="sy3">&</span> y<span class="br0">)</span>
|
|
<span class="kw1">noexcept</span><span class="br0">(</span><span class="kw1">noexcept</span><span class="br0">(</span>x.<span class="me1">swap</span><span class="br0">(</span>y<span class="br0">)</span><span class="br0">)</span><span class="br0">)</span><span class="sy4">;</span>
|
|
|
|
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> K, <span class="kw1">class</span> H, <span class="kw1">class</span> P, <span class="kw1">class</span> A, <span class="kw1">class</span> Predicate<span class="sy1">></span>
|
|
<span class="kw1">typename</span> unordered_set<span class="sy1"><</span>K, H, P, A<span class="sy1">></span><span class="sy4">::</span><span class="me2">size_type</span>
|
|
erase_if<span class="br0">(</span>unordered_set<span class="sy1"><</span>K, H, P, A<span class="sy1">></span><span class="sy3">&</span> c, Predicate pred<span class="br0">)</span><span class="sy4">;</span>
|
|
|
|
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> K, <span class="kw1">class</span> H, <span class="kw1">class</span> P, <span class="kw1">class</span> A, <span class="kw1">class</span> Predicate<span class="sy1">></span>
|
|
<span class="kw1">typename</span> unordered_multiset<span class="sy1"><</span>K, H, P, A<span class="sy1">></span><span class="sy4">::</span><span class="me2">size_type</span>
|
|
erase_if<span class="br0">(</span>unordered_multiset<span class="sy1"><</span>K, H, P, A<span class="sy1">></span><span class="sy3">&</span> c, Predicate pred<span class="br0">)</span><span class="sy4">;</span>
|
|
|
|
<span class="kw1">namespace</span> pmr <span class="br0">{</span>
|
|
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> Key,
|
|
<span class="kw1">class</span> Hash <span class="sy1">=</span> hash<span class="sy1"><</span>Key<span class="sy1">></span>,
|
|
<span class="kw1">class</span> Pred <span class="sy1">=</span> equal_to<span class="sy1"><</span>Key<span class="sy1">>></span>
|
|
<span class="kw1">using</span> unordered_set <span class="sy1">=</span> <a href="cpp-container-unordered_set.html"><span class="kw1289">std::<span class="me2">unordered_set</span></span></a><span class="sy1"><</span>Key, Hash, Pred,
|
|
polymorphic_allocator<span class="sy1"><</span>Key<span class="sy1">>></span><span class="sy4">;</span>
|
|
|
|
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> Key,
|
|
<span class="kw1">class</span> Hash <span class="sy1">=</span> hash<span class="sy1"><</span>Key<span class="sy1">></span>,
|
|
<span class="kw1">class</span> Pred <span class="sy1">=</span> equal_to<span class="sy1"><</span>Key<span class="sy1">>></span>
|
|
<span class="kw1">using</span> unordered_multiset <span class="sy1">=</span> <a href="cpp-container-unordered_multiset.html"><span class="kw1291">std::<span class="me2">unordered_multiset</span></span></a><span class="sy1"><</span>Key, Hash, Pred,
|
|
polymorphic_allocator<span class="sy1"><</span>Key<span class="sy1">>></span><span class="sy4">;</span>
|
|
<span class="br0">}</span>
|
|
<span class="br0">}</span></pre></div>
|
|
</div>
|
|
<h4><span class="mw-headline" id=".E7.B1.BB.E6.A8.A1.E6.9D.BF_std::unordered_set">类模板 <span class="t-lc"><a href="cpp-container-unordered_set.html">std::unordered_set</a></span></span></h4>
|
|
<div dir="ltr" class="mw-geshi" style="text-align: left;">
|
|
<div class="cpp source-cpp">
|
|
<pre class="de1"><span class="kw1">namespace</span> std <span class="br0">{</span>
|
|
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> Key,
|
|
<span class="kw1">class</span> Hash <span class="sy1">=</span> hash<span class="sy1"><</span>Key<span class="sy1">></span>,
|
|
<span class="kw1">class</span> Pred <span class="sy1">=</span> equal_to<span class="sy1"><</span>Key<span class="sy1">></span>,
|
|
<span class="kw1">class</span> Allocator <span class="sy1">=</span> allocator<span class="sy1"><</span>Key<span class="sy1">>></span>
|
|
<span class="kw1">class</span> unordered_set <span class="br0">{</span>
|
|
<span class="kw1">public</span><span class="sy4">:</span>
|
|
<span class="co1">// 类型</span>
|
|
<span class="kw1">using</span> key_type <span class="sy1">=</span> Key<span class="sy4">;</span>
|
|
<span class="kw1">using</span> value_type <span class="sy1">=</span> Key<span class="sy4">;</span>
|
|
<span class="kw1">using</span> hasher <span class="sy1">=</span> Hash<span class="sy4">;</span>
|
|
<span class="kw1">using</span> key_equal <span class="sy1">=</span> Pred<span class="sy4">;</span>
|
|
<span class="kw1">using</span> allocator_type <span class="sy1">=</span> Allocator<span class="sy4">;</span>
|
|
<span class="kw1">using</span> pointer <span class="sy1">=</span> <span class="kw1">typename</span> allocator_traits<span class="sy1"><</span>Allocator<span class="sy1">></span><span class="sy4">::</span><span class="me2">pointer</span><span class="sy4">;</span>
|
|
<span class="kw1">using</span> const_pointer <span class="sy1">=</span> <span class="kw1">typename</span> allocator_traits<span class="sy1"><</span>Allocator<span class="sy1">></span><span class="sy4">::</span><span class="me2">const_pointer</span><span class="sy4">;</span>
|
|
<span class="kw1">using</span> reference <span class="sy1">=</span> value_type<span class="sy3">&</span><span class="sy4">;</span>
|
|
<span class="kw1">using</span> const_reference <span class="sy1">=</span> <span class="kw4">const</span> value_type<span class="sy3">&</span><span class="sy4">;</span>
|
|
<span class="kw1">using</span> size_type <span class="sy1">=</span> <span class="coMULTI">/* 由实现定义 */</span><span class="sy4">;</span>
|
|
<span class="kw1">using</span> difference_type <span class="sy1">=</span> <span class="coMULTI">/* 由实现定义 */</span><span class="sy4">;</span>
|
|
|
|
<span class="kw1">using</span> iterator <span class="sy1">=</span> <span class="coMULTI">/* 由实现定义 */</span><span class="sy4">;</span>
|
|
<span class="kw1">using</span> const_iterator <span class="sy1">=</span> <span class="coMULTI">/* 由实现定义 */</span><span class="sy4">;</span>
|
|
<span class="kw1">using</span> local_iterator <span class="sy1">=</span> <span class="coMULTI">/* 由实现定义 */</span><span class="sy4">;</span>
|
|
<span class="kw1">using</span> const_local_iterator <span class="sy1">=</span> <span class="coMULTI">/* 由实现定义 */</span><span class="sy4">;</span>
|
|
<span class="kw1">using</span> node_type <span class="sy1">=</span> <span class="coMULTI">/* 未指明 */</span><span class="sy4">;</span>
|
|
<span class="kw1">using</span> insert_return_type <span class="sy1">=</span> <span class="coMULTI">/*insert-return-type*/</span><span class="sy1"><</span>iterator, node_type<span class="sy1">></span><span class="sy4">;</span>
|
|
|
|
<span class="co1">// 构造/复制/销毁</span>
|
|
unordered_set<span class="br0">(</span><span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="kw1">explicit</span> unordered_set<span class="br0">(</span>size_type n,
|
|
<span class="kw4">const</span> hasher<span class="sy3">&</span> hf <span class="sy1">=</span> hasher<span class="br0">(</span><span class="br0">)</span>,
|
|
<span class="kw4">const</span> key_equal<span class="sy3">&</span> eql <span class="sy1">=</span> key_equal<span class="br0">(</span><span class="br0">)</span>,
|
|
<span class="kw4">const</span> allocator_type<span class="sy3">&</span> a <span class="sy1">=</span> allocator_type<span class="br0">(</span><span class="br0">)</span><span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> InputIt<span class="sy1">></span>
|
|
unordered_set<span class="br0">(</span>InputIt f, InputIt l,
|
|
size_type n <span class="sy1">=</span> <span class="coMULTI">/* 见描述 */</span>,
|
|
<span class="kw4">const</span> hasher<span class="sy3">&</span> hf <span class="sy1">=</span> hasher<span class="br0">(</span><span class="br0">)</span>,
|
|
<span class="kw4">const</span> key_equal<span class="sy3">&</span> eql <span class="sy1">=</span> key_equal<span class="br0">(</span><span class="br0">)</span>,
|
|
<span class="kw4">const</span> allocator_type<span class="sy3">&</span> a <span class="sy1">=</span> allocator_type<span class="br0">(</span><span class="br0">)</span><span class="br0">)</span><span class="sy4">;</span>
|
|
unordered_set<span class="br0">(</span><span class="kw4">const</span> unordered_set<span class="sy3">&</span><span class="br0">)</span><span class="sy4">;</span>
|
|
unordered_set<span class="br0">(</span>unordered_set<span class="sy3">&&</span><span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="kw1">explicit</span> unordered_set<span class="br0">(</span><span class="kw4">const</span> Allocator<span class="sy3">&</span><span class="br0">)</span><span class="sy4">;</span>
|
|
unordered_set<span class="br0">(</span><span class="kw4">const</span> unordered_set<span class="sy3">&</span>, <span class="kw4">const</span> Allocator<span class="sy3">&</span><span class="br0">)</span><span class="sy4">;</span>
|
|
unordered_set<span class="br0">(</span>unordered_set<span class="sy3">&&</span>, <span class="kw4">const</span> Allocator<span class="sy3">&</span><span class="br0">)</span><span class="sy4">;</span>
|
|
unordered_set<span class="br0">(</span>initializer_list<span class="sy1"><</span>value_type<span class="sy1">></span> il,
|
|
size_type n <span class="sy1">=</span> <span class="coMULTI">/* 见描述 */</span>,
|
|
<span class="kw4">const</span> hasher<span class="sy3">&</span> hf <span class="sy1">=</span> hasher<span class="br0">(</span><span class="br0">)</span>,
|
|
<span class="kw4">const</span> key_equal<span class="sy3">&</span> eql <span class="sy1">=</span> key_equal<span class="br0">(</span><span class="br0">)</span>,
|
|
<span class="kw4">const</span> allocator_type<span class="sy3">&</span> a <span class="sy1">=</span> allocator_type<span class="br0">(</span><span class="br0">)</span><span class="br0">)</span><span class="sy4">;</span>
|
|
unordered_set<span class="br0">(</span>size_type n, <span class="kw4">const</span> allocator_type<span class="sy3">&</span> a<span class="br0">)</span>
|
|
<span class="sy4">:</span> unordered_set<span class="br0">(</span>n, hasher<span class="br0">(</span><span class="br0">)</span>, key_equal<span class="br0">(</span><span class="br0">)</span>, a<span class="br0">)</span> <span class="br0">{</span> <span class="br0">}</span>
|
|
unordered_set<span class="br0">(</span>size_type n, <span class="kw4">const</span> hasher<span class="sy3">&</span> hf, <span class="kw4">const</span> allocator_type<span class="sy3">&</span> a<span class="br0">)</span>
|
|
<span class="sy4">:</span> unordered_set<span class="br0">(</span>n, hf, key_equal<span class="br0">(</span><span class="br0">)</span>, a<span class="br0">)</span> <span class="br0">{</span> <span class="br0">}</span>
|
|
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> InputIt<span class="sy1">></span>
|
|
unordered_set<span class="br0">(</span>InputIt f, InputIt l, size_type n, <span class="kw4">const</span> allocator_type<span class="sy3">&</span> a<span class="br0">)</span>
|
|
<span class="sy4">:</span> unordered_set<span class="br0">(</span>f, l, n, hasher<span class="br0">(</span><span class="br0">)</span>, key_equal<span class="br0">(</span><span class="br0">)</span>, a<span class="br0">)</span> <span class="br0">{</span> <span class="br0">}</span>
|
|
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> InputIt<span class="sy1">></span>
|
|
unordered_set<span class="br0">(</span>InputIt f, InputIt l, size_type n, <span class="kw4">const</span> hasher<span class="sy3">&</span> hf,
|
|
<span class="kw4">const</span> allocator_type<span class="sy3">&</span> a<span class="br0">)</span>
|
|
<span class="sy4">:</span> unordered_set<span class="br0">(</span>f, l, n, hf, key_equal<span class="br0">(</span><span class="br0">)</span>, a<span class="br0">)</span> <span class="br0">{</span> <span class="br0">}</span>
|
|
unordered_set<span class="br0">(</span>initializer_list<span class="sy1"><</span>value_type<span class="sy1">></span> il, size_type n, <span class="kw4">const</span> allocator_type<span class="sy3">&</span> a<span class="br0">)</span>
|
|
<span class="sy4">:</span> unordered_set<span class="br0">(</span>il, n, hasher<span class="br0">(</span><span class="br0">)</span>, key_equal<span class="br0">(</span><span class="br0">)</span>, a<span class="br0">)</span> <span class="br0">{</span> <span class="br0">}</span>
|
|
unordered_set<span class="br0">(</span>initializer_list<span class="sy1"><</span>value_type<span class="sy1">></span> il, size_type n, <span class="kw4">const</span> hasher<span class="sy3">&</span> hf,
|
|
<span class="kw4">const</span> allocator_type<span class="sy3">&</span> a<span class="br0">)</span>
|
|
<span class="sy4">:</span> unordered_set<span class="br0">(</span>il, n, hf, key_equal<span class="br0">(</span><span class="br0">)</span>, a<span class="br0">)</span> <span class="br0">{</span> <span class="br0">}</span>
|
|
~unordered_set<span class="br0">(</span><span class="br0">)</span><span class="sy4">;</span>
|
|
unordered_set<span class="sy3">&</span> operator<span class="sy1">=</span><span class="br0">(</span><span class="kw4">const</span> unordered_set<span class="sy3">&</span><span class="br0">)</span><span class="sy4">;</span>
|
|
unordered_set<span class="sy3">&</span> operator<span class="sy1">=</span><span class="br0">(</span>unordered_set<span class="sy3">&&</span><span class="br0">)</span>
|
|
<span class="kw1">noexcept</span><span class="br0">(</span>allocator_traits<span class="sy1"><</span>Allocator<span class="sy1">></span><span class="sy4">::</span><span class="me2">is_always_equal</span><span class="sy4">::</span><span class="me2">value</span> <span class="sy3">&&</span>
|
|
is_nothrow_move_assignable_v<span class="sy1"><</span>Hash<span class="sy1">></span> <span class="sy3">&&</span>
|
|
is_nothrow_move_assignable_v<span class="sy1"><</span>Pred<span class="sy1">></span><span class="br0">)</span><span class="sy4">;</span>
|
|
unordered_set<span class="sy3">&</span> operator<span class="sy1">=</span><span class="br0">(</span>initializer_list<span class="sy1"><</span>value_type<span class="sy1">></span><span class="br0">)</span><span class="sy4">;</span>
|
|
allocator_type get_allocator<span class="br0">(</span><span class="br0">)</span> <span class="kw4">const</span> <span class="kw1">noexcept</span><span class="sy4">;</span>
|
|
|
|
<span class="co1">// 迭代器</span>
|
|
iterator begin<span class="br0">(</span><span class="br0">)</span> <span class="kw1">noexcept</span><span class="sy4">;</span>
|
|
const_iterator begin<span class="br0">(</span><span class="br0">)</span> <span class="kw4">const</span> <span class="kw1">noexcept</span><span class="sy4">;</span>
|
|
iterator end<span class="br0">(</span><span class="br0">)</span> <span class="kw1">noexcept</span><span class="sy4">;</span>
|
|
const_iterator end<span class="br0">(</span><span class="br0">)</span> <span class="kw4">const</span> <span class="kw1">noexcept</span><span class="sy4">;</span>
|
|
const_iterator cbegin<span class="br0">(</span><span class="br0">)</span> <span class="kw4">const</span> <span class="kw1">noexcept</span><span class="sy4">;</span>
|
|
const_iterator cend<span class="br0">(</span><span class="br0">)</span> <span class="kw4">const</span> <span class="kw1">noexcept</span><span class="sy4">;</span>
|
|
|
|
<span class="co1">// 容量</span>
|
|
<span class="br0">[</span><span class="br0">[</span>nodiscard<span class="br0">]</span><span class="br0">]</span> <span class="kw4">bool</span> empty<span class="br0">(</span><span class="br0">)</span> <span class="kw4">const</span> <span class="kw1">noexcept</span><span class="sy4">;</span>
|
|
size_type size<span class="br0">(</span><span class="br0">)</span> <span class="kw4">const</span> <span class="kw1">noexcept</span><span class="sy4">;</span>
|
|
size_type max_size<span class="br0">(</span><span class="br0">)</span> <span class="kw4">const</span> <span class="kw1">noexcept</span><span class="sy4">;</span>
|
|
|
|
<span class="co1">// 修改器</span>
|
|
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span>... <span class="me1">Args</span><span class="sy1">></span> pair<span class="sy1"><</span>iterator, <span class="kw4">bool</span><span class="sy1">></span> emplace<span class="br0">(</span>Args<span class="sy3">&&</span>... <span class="me1">args</span><span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span>... <span class="me1">Args</span><span class="sy1">></span> iterator emplace_hint<span class="br0">(</span>const_iterator position, Args<span class="sy3">&&</span>... <span class="me1">args</span><span class="br0">)</span><span class="sy4">;</span>
|
|
pair<span class="sy1"><</span>iterator, <span class="kw4">bool</span><span class="sy1">></span> insert<span class="br0">(</span><span class="kw4">const</span> value_type<span class="sy3">&</span> obj<span class="br0">)</span><span class="sy4">;</span>
|
|
pair<span class="sy1"><</span>iterator, <span class="kw4">bool</span><span class="sy1">></span> insert<span class="br0">(</span>value_type<span class="sy3">&&</span> obj<span class="br0">)</span><span class="sy4">;</span>
|
|
iterator insert<span class="br0">(</span>const_iterator hint, <span class="kw4">const</span> value_type<span class="sy3">&</span> obj<span class="br0">)</span><span class="sy4">;</span>
|
|
iterator insert<span class="br0">(</span>const_iterator hint, value_type<span class="sy3">&&</span> obj<span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> InputIt<span class="sy1">></span> <span class="kw4">void</span> insert<span class="br0">(</span>InputIt first, InputIt last<span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="kw4">void</span> insert<span class="br0">(</span>initializer_list<span class="sy1"><</span>value_type<span class="sy1">></span><span class="br0">)</span><span class="sy4">;</span>
|
|
|
|
node_type extract<span class="br0">(</span>const_iterator position<span class="br0">)</span><span class="sy4">;</span>
|
|
node_type extract<span class="br0">(</span><span class="kw4">const</span> key_type<span class="sy3">&</span> x<span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> K<span class="sy1">></span> node_type extract<span class="br0">(</span>K<span class="sy3">&&</span> x<span class="br0">)</span><span class="sy4">;</span>
|
|
insert_return_type insert<span class="br0">(</span>node_type<span class="sy3">&&</span> nh<span class="br0">)</span><span class="sy4">;</span>
|
|
iterator insert<span class="br0">(</span>const_iterator hint, node_type<span class="sy3">&&</span> nh<span class="br0">)</span><span class="sy4">;</span>
|
|
|
|
iterator erase<span class="br0">(</span>iterator position<span class="br0">)</span><span class="sy4">;</span>
|
|
iterator erase<span class="br0">(</span>const_iterator position<span class="br0">)</span><span class="sy4">;</span>
|
|
size_type erase<span class="br0">(</span><span class="kw4">const</span> key_type<span class="sy3">&</span> k<span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> K<span class="sy1">></span> size_type erase<span class="br0">(</span>K<span class="sy3">&&</span> x<span class="br0">)</span><span class="sy4">;</span>
|
|
iterator erase<span class="br0">(</span>const_iterator first, const_iterator last<span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="kw4">void</span> swap<span class="br0">(</span>unordered_set<span class="sy3">&</span><span class="br0">)</span>
|
|
<span class="kw1">noexcept</span><span class="br0">(</span>allocator_traits<span class="sy1"><</span>Allocator<span class="sy1">></span><span class="sy4">::</span><span class="me2">is_always_equal</span><span class="sy4">::</span><span class="me2">value</span> <span class="sy3">&&</span>
|
|
is_nothrow_swappable_v<span class="sy1"><</span>Hash<span class="sy1">></span> <span class="sy3">&&</span>
|
|
is_nothrow_swappable_v<span class="sy1"><</span>Pred<span class="sy1">></span><span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="kw4">void</span> clear<span class="br0">(</span><span class="br0">)</span> <span class="kw1">noexcept</span><span class="sy4">;</span>
|
|
|
|
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> H2, <span class="kw1">class</span> P2<span class="sy1">></span>
|
|
<span class="kw4">void</span> merge<span class="br0">(</span>unordered_set<span class="sy1"><</span>Key, H2, P2, Allocator<span class="sy1">></span><span class="sy3">&</span> source<span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> H2, <span class="kw1">class</span> P2<span class="sy1">></span>
|
|
<span class="kw4">void</span> merge<span class="br0">(</span>unordered_set<span class="sy1"><</span>Key, H2, P2, Allocator<span class="sy1">></span><span class="sy3">&&</span> source<span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> H2, <span class="kw1">class</span> P2<span class="sy1">></span>
|
|
<span class="kw4">void</span> merge<span class="br0">(</span>unordered_multiset<span class="sy1"><</span>Key, H2, P2, Allocator<span class="sy1">></span><span class="sy3">&</span> source<span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> H2, <span class="kw1">class</span> P2<span class="sy1">></span>
|
|
<span class="kw4">void</span> merge<span class="br0">(</span>unordered_multiset<span class="sy1"><</span>Key, H2, P2, Allocator<span class="sy1">></span><span class="sy3">&&</span> source<span class="br0">)</span><span class="sy4">;</span>
|
|
|
|
<span class="co1">// 观察器</span>
|
|
hasher hash_function<span class="br0">(</span><span class="br0">)</span> <span class="kw4">const</span><span class="sy4">;</span>
|
|
key_equal key_eq<span class="br0">(</span><span class="br0">)</span> <span class="kw4">const</span><span class="sy4">;</span>
|
|
|
|
<span class="co1">// set 操作</span>
|
|
iterator find<span class="br0">(</span><span class="kw4">const</span> key_type<span class="sy3">&</span> k<span class="br0">)</span><span class="sy4">;</span>
|
|
const_iterator find<span class="br0">(</span><span class="kw4">const</span> key_type<span class="sy3">&</span> k<span class="br0">)</span> <span class="kw4">const</span><span class="sy4">;</span>
|
|
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> K<span class="sy1">></span>
|
|
iterator find<span class="br0">(</span><span class="kw4">const</span> K<span class="sy3">&</span> k<span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> K<span class="sy1">></span>
|
|
const_iterator find<span class="br0">(</span><span class="kw4">const</span> K<span class="sy3">&</span> k<span class="br0">)</span> <span class="kw4">const</span><span class="sy4">;</span>
|
|
size_type count<span class="br0">(</span><span class="kw4">const</span> key_type<span class="sy3">&</span> k<span class="br0">)</span> <span class="kw4">const</span><span class="sy4">;</span>
|
|
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> K<span class="sy1">></span>
|
|
size_type count<span class="br0">(</span><span class="kw4">const</span> K<span class="sy3">&</span> k<span class="br0">)</span> <span class="kw4">const</span><span class="sy4">;</span>
|
|
<span class="kw4">bool</span> contains<span class="br0">(</span><span class="kw4">const</span> key_type<span class="sy3">&</span> k<span class="br0">)</span> <span class="kw4">const</span><span class="sy4">;</span>
|
|
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> K<span class="sy1">></span>
|
|
<span class="kw4">bool</span> contains<span class="br0">(</span><span class="kw4">const</span> K<span class="sy3">&</span> k<span class="br0">)</span> <span class="kw4">const</span><span class="sy4">;</span>
|
|
pair<span class="sy1"><</span>iterator, iterator<span class="sy1">></span> equal_range<span class="br0">(</span><span class="kw4">const</span> key_type<span class="sy3">&</span> k<span class="br0">)</span><span class="sy4">;</span>
|
|
pair<span class="sy1"><</span>const_iterator, const_iterator<span class="sy1">></span> equal_range<span class="br0">(</span><span class="kw4">const</span> key_type<span class="sy3">&</span> k<span class="br0">)</span> <span class="kw4">const</span><span class="sy4">;</span>
|
|
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> K<span class="sy1">></span>
|
|
pair<span class="sy1"><</span>iterator, iterator<span class="sy1">></span> equal_range<span class="br0">(</span><span class="kw4">const</span> K<span class="sy3">&</span> k<span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> K<span class="sy1">></span>
|
|
pair<span class="sy1"><</span>const_iterator, const_iterator<span class="sy1">></span> equal_range<span class="br0">(</span><span class="kw4">const</span> K<span class="sy3">&</span> k<span class="br0">)</span> <span class="kw4">const</span><span class="sy4">;</span>
|
|
|
|
<span class="co1">// 桶接口</span>
|
|
size_type bucket_count<span class="br0">(</span><span class="br0">)</span> <span class="kw4">const</span> <span class="kw1">noexcept</span><span class="sy4">;</span>
|
|
size_type max_bucket_count<span class="br0">(</span><span class="br0">)</span> <span class="kw4">const</span> <span class="kw1">noexcept</span><span class="sy4">;</span>
|
|
size_type bucket_size<span class="br0">(</span>size_type n<span class="br0">)</span> <span class="kw4">const</span><span class="sy4">;</span>
|
|
size_type bucket<span class="br0">(</span><span class="kw4">const</span> key_type<span class="sy3">&</span> k<span class="br0">)</span> <span class="kw4">const</span><span class="sy4">;</span>
|
|
local_iterator begin<span class="br0">(</span>size_type n<span class="br0">)</span><span class="sy4">;</span>
|
|
const_local_iterator begin<span class="br0">(</span>size_type n<span class="br0">)</span> <span class="kw4">const</span><span class="sy4">;</span>
|
|
local_iterator end<span class="br0">(</span>size_type n<span class="br0">)</span><span class="sy4">;</span>
|
|
const_local_iterator end<span class="br0">(</span>size_type n<span class="br0">)</span> <span class="kw4">const</span><span class="sy4">;</span>
|
|
const_local_iterator cbegin<span class="br0">(</span>size_type n<span class="br0">)</span> <span class="kw4">const</span><span class="sy4">;</span>
|
|
const_local_iterator cend<span class="br0">(</span>size_type n<span class="br0">)</span> <span class="kw4">const</span><span class="sy4">;</span>
|
|
|
|
<span class="co1">// 散列策略</span>
|
|
<span class="kw4">float</span> load_factor<span class="br0">(</span><span class="br0">)</span> <span class="kw4">const</span> <span class="kw1">noexcept</span><span class="sy4">;</span>
|
|
<span class="kw4">float</span> max_load_factor<span class="br0">(</span><span class="br0">)</span> <span class="kw4">const</span> <span class="kw1">noexcept</span><span class="sy4">;</span>
|
|
<span class="kw4">void</span> max_load_factor<span class="br0">(</span><span class="kw4">float</span> z<span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="kw4">void</span> rehash<span class="br0">(</span>size_type n<span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="kw4">void</span> reserve<span class="br0">(</span>size_type n<span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="br0">}</span><span class="sy4">;</span>
|
|
|
|
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> InputIt,
|
|
<span class="kw1">class</span> Hash <span class="sy1">=</span> hash<span class="sy1"><</span><span class="coMULTI">/*iter-value-type*/</span><span class="sy1"><</span>InputIt<span class="sy1">>></span>,
|
|
<span class="kw1">class</span> Pred <span class="sy1">=</span> equal_to<span class="sy1"><</span><span class="coMULTI">/*iter-value-type*/</span><span class="sy1"><</span>InputIt<span class="sy1">>></span>,
|
|
<span class="kw1">class</span> Allocator <span class="sy1">=</span> allocator<span class="sy1"><</span><span class="coMULTI">/*iter-value-type*/</span><span class="sy1"><</span>InputIt<span class="sy1">>>></span>
|
|
unordered_set<span class="br0">(</span>InputIt, InputIt,
|
|
<span class="kw1">typename</span> <span class="coMULTI">/* 见描述 */</span><span class="sy4">::</span><span class="me2">size_type</span> <span class="sy1">=</span> <span class="coMULTI">/* 见描述 */</span>,
|
|
Hash <span class="sy1">=</span> Hash<span class="br0">(</span><span class="br0">)</span>, Pred <span class="sy1">=</span> Pred<span class="br0">(</span><span class="br0">)</span>, Allocator <span class="sy1">=</span> Allocator<span class="br0">(</span><span class="br0">)</span><span class="br0">)</span>
|
|
<span class="sy2">-</span><span class="sy1">></span> unordered_set<span class="sy1"><</span><span class="coMULTI">/*iter-value-type*/</span><span class="sy1"><</span>InputIt<span class="sy1">></span>,
|
|
Hash, Pred, Allocator<span class="sy1">></span><span class="sy4">;</span>
|
|
|
|
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> T, <span class="kw1">class</span> Hash <span class="sy1">=</span> hash<span class="sy1"><</span>T<span class="sy1">></span>,
|
|
<span class="kw1">class</span> Pred <span class="sy1">=</span> equal_to<span class="sy1"><</span>T<span class="sy1">></span>, <span class="kw1">class</span> Allocator <span class="sy1">=</span> allocator<span class="sy1"><</span>T<span class="sy1">>></span>
|
|
unordered_set<span class="br0">(</span>initializer_list<span class="sy1"><</span>T<span class="sy1">></span>,
|
|
<span class="kw1">typename</span> <span class="coMULTI">/* 见描述 */</span><span class="sy4">::</span><span class="me2">size_type</span> <span class="sy1">=</span> <span class="coMULTI">/* 见描述 */</span>,
|
|
Hash <span class="sy1">=</span> Hash<span class="br0">(</span><span class="br0">)</span>, Pred <span class="sy1">=</span> Pred<span class="br0">(</span><span class="br0">)</span>, Allocator <span class="sy1">=</span> Allocator<span class="br0">(</span><span class="br0">)</span><span class="br0">)</span>
|
|
<span class="sy2">-</span><span class="sy1">></span> unordered_set<span class="sy1"><</span>T, Hash, Pred, Allocator<span class="sy1">></span><span class="sy4">;</span>
|
|
|
|
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> InputIt, <span class="kw1">class</span> Allocator<span class="sy1">></span>
|
|
unordered_set<span class="br0">(</span>InputIt, InputIt, <span class="kw1">typename</span> <span class="coMULTI">/* 见描述 */</span><span class="sy4">::</span><span class="me2">size_type</span>, Allocator<span class="br0">)</span>
|
|
<span class="sy2">-</span><span class="sy1">></span> unordered_set<span class="sy1"><</span><span class="coMULTI">/*iter-value-type*/</span><span class="sy1"><</span>InputIt<span class="sy1">></span>,
|
|
hash<span class="sy1"><</span><span class="coMULTI">/*iter-value-type*/</span><span class="sy1"><</span>InputIt<span class="sy1">>></span>,
|
|
equal_to<span class="sy1"><</span><span class="coMULTI">/*iter-value-type*/</span><span class="sy1"><</span>InputIt<span class="sy1">>></span>,
|
|
Allocator<span class="sy1">></span><span class="sy4">;</span>
|
|
|
|
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> InputIt, <span class="kw1">class</span> Hash, <span class="kw1">class</span> Allocator<span class="sy1">></span>
|
|
unordered_set<span class="br0">(</span>InputIt, InputIt, <span class="kw1">typename</span> <span class="coMULTI">/* 见描述 */</span><span class="sy4">::</span><span class="me2">size_type</span>,
|
|
Hash, Allocator<span class="br0">)</span>
|
|
<span class="sy2">-</span><span class="sy1">></span> unordered_set<span class="sy1"><</span><span class="coMULTI">/*iter-value-type*/</span><span class="sy1"><</span>InputIt<span class="sy1">></span>, Hash,
|
|
equal_to<span class="sy1"><</span><span class="coMULTI">/*iter-value-type*/</span><span class="sy1"><</span>InputIt<span class="sy1">>></span>,
|
|
Allocator<span class="sy1">></span><span class="sy4">;</span>
|
|
|
|
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> T, <span class="kw1">class</span> Allocator<span class="sy1">></span>
|
|
unordered_set<span class="br0">(</span>initializer_list<span class="sy1"><</span>T<span class="sy1">></span>, <span class="kw1">typename</span> <span class="coMULTI">/* 见描述 */</span><span class="sy4">::</span><span class="me2">size_type</span>,
|
|
Allocator<span class="br0">)</span>
|
|
<span class="sy2">-</span><span class="sy1">></span> unordered_set<span class="sy1"><</span>T, hash<span class="sy1"><</span>T<span class="sy1">></span>, equal_to<span class="sy1"><</span>T<span class="sy1">></span>, Allocator<span class="sy1">></span><span class="sy4">;</span>
|
|
|
|
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> T, <span class="kw1">class</span> Hash, <span class="kw1">class</span> Allocator<span class="sy1">></span>
|
|
unordered_set<span class="br0">(</span>initializer_list<span class="sy1"><</span>T<span class="sy1">></span>, <span class="kw1">typename</span> <span class="coMULTI">/* 见描述 */</span><span class="sy4">::</span><span class="me2">size_type</span>,
|
|
Hash, Allocator<span class="br0">)</span>
|
|
<span class="sy2">-</span><span class="sy1">></span> unordered_set<span class="sy1"><</span>T, Hash, equal_to<span class="sy1"><</span>T<span class="sy1">></span>, Allocator<span class="sy1">></span><span class="sy4">;</span>
|
|
|
|
<span class="co1">// 交换</span>
|
|
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> Key, <span class="kw1">class</span> Hash, <span class="kw1">class</span> Pred, <span class="kw1">class</span> Alloc<span class="sy1">></span>
|
|
<span class="kw4">void</span> swap<span class="br0">(</span>unordered_set<span class="sy1"><</span>Key, Hash, Pred, Alloc<span class="sy1">></span><span class="sy3">&</span> x,
|
|
unordered_set<span class="sy1"><</span>Key, Hash, Pred, Alloc<span class="sy1">></span><span class="sy3">&</span> y<span class="br0">)</span>
|
|
<span class="kw1">noexcept</span><span class="br0">(</span><span class="kw1">noexcept</span><span class="br0">(</span>x.<span class="me1">swap</span><span class="br0">(</span>y<span class="br0">)</span><span class="br0">)</span><span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="br0">}</span></pre></div>
|
|
</div>
|
|
<h4><span class="mw-headline" id=".E7.B1.BB.E6.A8.A1.E6.9D.BF_std::unordered_multiset">类模板 <span class="t-lc"><a href="cpp-container-unordered_multiset.html">std::unordered_multiset</a></span></span></h4>
|
|
<div dir="ltr" class="mw-geshi" style="text-align: left;">
|
|
<div class="cpp source-cpp">
|
|
<pre class="de1"><span class="kw1">namespace</span> std <span class="br0">{</span>
|
|
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> Key,
|
|
<span class="kw1">class</span> Hash <span class="sy1">=</span> hash<span class="sy1"><</span>Key<span class="sy1">></span>,
|
|
<span class="kw1">class</span> Pred <span class="sy1">=</span> equal_to<span class="sy1"><</span>Key<span class="sy1">></span>,
|
|
<span class="kw1">class</span> Allocator <span class="sy1">=</span> allocator<span class="sy1"><</span>Key<span class="sy1">>></span>
|
|
<span class="kw1">class</span> unordered_multiset <span class="br0">{</span>
|
|
<span class="kw1">public</span><span class="sy4">:</span>
|
|
<span class="co1">// 类型</span>
|
|
<span class="kw1">using</span> key_type <span class="sy1">=</span> Key<span class="sy4">;</span>
|
|
<span class="kw1">using</span> value_type <span class="sy1">=</span> Key<span class="sy4">;</span>
|
|
<span class="kw1">using</span> hasher <span class="sy1">=</span> Hash<span class="sy4">;</span>
|
|
<span class="kw1">using</span> key_equal <span class="sy1">=</span> Pred<span class="sy4">;</span>
|
|
<span class="kw1">using</span> allocator_type <span class="sy1">=</span> Allocator<span class="sy4">;</span>
|
|
<span class="kw1">using</span> pointer <span class="sy1">=</span> <span class="kw1">typename</span> allocator_traits<span class="sy1"><</span>Allocator<span class="sy1">></span><span class="sy4">::</span><span class="me2">pointer</span><span class="sy4">;</span>
|
|
<span class="kw1">using</span> const_pointer <span class="sy1">=</span> <span class="kw1">typename</span> allocator_traits<span class="sy1"><</span>Allocator<span class="sy1">></span><span class="sy4">::</span><span class="me2">const_pointer</span><span class="sy4">;</span>
|
|
<span class="kw1">using</span> reference <span class="sy1">=</span> value_type<span class="sy3">&</span><span class="sy4">;</span>
|
|
<span class="kw1">using</span> const_reference <span class="sy1">=</span> <span class="kw4">const</span> value_type<span class="sy3">&</span><span class="sy4">;</span>
|
|
<span class="kw1">using</span> size_type <span class="sy1">=</span> <span class="coMULTI">/* 由实现定义 */</span><span class="sy4">;</span>
|
|
<span class="kw1">using</span> difference_type <span class="sy1">=</span> <span class="coMULTI">/* 由实现定义 */</span><span class="sy4">;</span>
|
|
|
|
<span class="kw1">using</span> iterator <span class="sy1">=</span> <span class="coMULTI">/* 由实现定义 */</span><span class="sy4">;</span>
|
|
<span class="kw1">using</span> const_iterator <span class="sy1">=</span> <span class="coMULTI">/* 由实现定义 */</span><span class="sy4">;</span>
|
|
<span class="kw1">using</span> local_iterator <span class="sy1">=</span> <span class="coMULTI">/* 由实现定义 */</span><span class="sy4">;</span>
|
|
<span class="kw1">using</span> const_local_iterator <span class="sy1">=</span> <span class="coMULTI">/* 由实现定义 */</span><span class="sy4">;</span>
|
|
<span class="kw1">using</span> node_type <span class="sy1">=</span> <span class="coMULTI">/* 未指明 */</span><span class="sy4">;</span>
|
|
|
|
<span class="co1">// 构造/复制/销毁</span>
|
|
unordered_multiset<span class="br0">(</span><span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="kw1">explicit</span> unordered_multiset<span class="br0">(</span>size_type n,
|
|
<span class="kw4">const</span> hasher<span class="sy3">&</span> hf <span class="sy1">=</span> hasher<span class="br0">(</span><span class="br0">)</span>,
|
|
<span class="kw4">const</span> key_equal<span class="sy3">&</span> eql <span class="sy1">=</span> key_equal<span class="br0">(</span><span class="br0">)</span>,
|
|
<span class="kw4">const</span> allocator_type<span class="sy3">&</span> a <span class="sy1">=</span> allocator_type<span class="br0">(</span><span class="br0">)</span><span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> InputIt<span class="sy1">></span>
|
|
unordered_multiset<span class="br0">(</span>InputIt f, InputIt l,
|
|
size_type n <span class="sy1">=</span> <span class="coMULTI">/* 见描述 */</span>,
|
|
<span class="kw4">const</span> hasher<span class="sy3">&</span> hf <span class="sy1">=</span> hasher<span class="br0">(</span><span class="br0">)</span>,
|
|
<span class="kw4">const</span> key_equal<span class="sy3">&</span> eql <span class="sy1">=</span> key_equal<span class="br0">(</span><span class="br0">)</span>,
|
|
<span class="kw4">const</span> allocator_type<span class="sy3">&</span> a <span class="sy1">=</span> allocator_type<span class="br0">(</span><span class="br0">)</span><span class="br0">)</span><span class="sy4">;</span>
|
|
unordered_multiset<span class="br0">(</span><span class="kw4">const</span> unordered_multiset<span class="sy3">&</span><span class="br0">)</span><span class="sy4">;</span>
|
|
unordered_multiset<span class="br0">(</span>unordered_multiset<span class="sy3">&&</span><span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="kw1">explicit</span> unordered_multiset<span class="br0">(</span><span class="kw4">const</span> Allocator<span class="sy3">&</span><span class="br0">)</span><span class="sy4">;</span>
|
|
unordered_multiset<span class="br0">(</span><span class="kw4">const</span> unordered_multiset<span class="sy3">&</span>, <span class="kw4">const</span> Allocator<span class="sy3">&</span><span class="br0">)</span><span class="sy4">;</span>
|
|
unordered_multiset<span class="br0">(</span>unordered_multiset<span class="sy3">&&</span>, <span class="kw4">const</span> Allocator<span class="sy3">&</span><span class="br0">)</span><span class="sy4">;</span>
|
|
unordered_multiset<span class="br0">(</span>initializer_list<span class="sy1"><</span>value_type<span class="sy1">></span> il,
|
|
size_type n <span class="sy1">=</span> <span class="coMULTI">/* 见描述 */</span>,
|
|
<span class="kw4">const</span> hasher<span class="sy3">&</span> hf <span class="sy1">=</span> hasher<span class="br0">(</span><span class="br0">)</span>,
|
|
<span class="kw4">const</span> key_equal<span class="sy3">&</span> eql <span class="sy1">=</span> key_equal<span class="br0">(</span><span class="br0">)</span>,
|
|
<span class="kw4">const</span> allocator_type<span class="sy3">&</span> a <span class="sy1">=</span> allocator_type<span class="br0">(</span><span class="br0">)</span><span class="br0">)</span><span class="sy4">;</span>
|
|
unordered_multiset<span class="br0">(</span>size_type n, <span class="kw4">const</span> allocator_type<span class="sy3">&</span> a<span class="br0">)</span>
|
|
<span class="sy4">:</span> unordered_multiset<span class="br0">(</span>n, hasher<span class="br0">(</span><span class="br0">)</span>, key_equal<span class="br0">(</span><span class="br0">)</span>, a<span class="br0">)</span> <span class="br0">{</span> <span class="br0">}</span>
|
|
unordered_multiset<span class="br0">(</span>size_type n, <span class="kw4">const</span> hasher<span class="sy3">&</span> hf, <span class="kw4">const</span> allocator_type<span class="sy3">&</span> a<span class="br0">)</span>
|
|
<span class="sy4">:</span> unordered_multiset<span class="br0">(</span>n, hf, key_equal<span class="br0">(</span><span class="br0">)</span>, a<span class="br0">)</span> <span class="br0">{</span> <span class="br0">}</span>
|
|
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> InputIt<span class="sy1">></span>
|
|
unordered_multiset<span class="br0">(</span>InputIt f, InputIt l, size_type n, <span class="kw4">const</span> allocator_type<span class="sy3">&</span> a<span class="br0">)</span>
|
|
<span class="sy4">:</span> unordered_multiset<span class="br0">(</span>f, l, n, hasher<span class="br0">(</span><span class="br0">)</span>, key_equal<span class="br0">(</span><span class="br0">)</span>, a<span class="br0">)</span> <span class="br0">{</span> <span class="br0">}</span>
|
|
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> InputIt<span class="sy1">></span>
|
|
unordered_multiset<span class="br0">(</span>InputIt f, InputIt l, size_type n, <span class="kw4">const</span> hasher<span class="sy3">&</span> hf,
|
|
<span class="kw4">const</span> allocator_type<span class="sy3">&</span> a<span class="br0">)</span>
|
|
<span class="sy4">:</span> unordered_multiset<span class="br0">(</span>f, l, n, hf, key_equal<span class="br0">(</span><span class="br0">)</span>, a<span class="br0">)</span> <span class="br0">{</span> <span class="br0">}</span>
|
|
unordered_multiset<span class="br0">(</span>initializer_list<span class="sy1"><</span>value_type<span class="sy1">></span> il, size_type n,
|
|
<span class="kw4">const</span> allocator_type<span class="sy3">&</span> a<span class="br0">)</span>
|
|
<span class="sy4">:</span> unordered_multiset<span class="br0">(</span>il, n, hasher<span class="br0">(</span><span class="br0">)</span>, key_equal<span class="br0">(</span><span class="br0">)</span>, a<span class="br0">)</span> <span class="br0">{</span> <span class="br0">}</span>
|
|
unordered_multiset<span class="br0">(</span>initializer_list<span class="sy1"><</span>value_type<span class="sy1">></span> il, size_type n, <span class="kw4">const</span> hasher<span class="sy3">&</span> hf,
|
|
<span class="kw4">const</span> allocator_type<span class="sy3">&</span> a<span class="br0">)</span>
|
|
<span class="sy4">:</span> unordered_multiset<span class="br0">(</span>il, n, hf, key_equal<span class="br0">(</span><span class="br0">)</span>, a<span class="br0">)</span> <span class="br0">{</span> <span class="br0">}</span>
|
|
~unordered_multiset<span class="br0">(</span><span class="br0">)</span><span class="sy4">;</span>
|
|
unordered_multiset<span class="sy3">&</span> operator<span class="sy1">=</span><span class="br0">(</span><span class="kw4">const</span> unordered_multiset<span class="sy3">&</span><span class="br0">)</span><span class="sy4">;</span>
|
|
unordered_multiset<span class="sy3">&</span> operator<span class="sy1">=</span><span class="br0">(</span>unordered_multiset<span class="sy3">&&</span><span class="br0">)</span>
|
|
<span class="kw1">noexcept</span><span class="br0">(</span>allocator_traits<span class="sy1"><</span>Allocator<span class="sy1">></span><span class="sy4">::</span><span class="me2">is_always_equal</span><span class="sy4">::</span><span class="me2">value</span> <span class="sy3">&&</span>
|
|
is_nothrow_move_assignable_v<span class="sy1"><</span>Hash<span class="sy1">></span> <span class="sy3">&&</span>
|
|
is_nothrow_move_assignable_v<span class="sy1"><</span>Pred<span class="sy1">></span><span class="br0">)</span><span class="sy4">;</span>
|
|
unordered_multiset<span class="sy3">&</span> operator<span class="sy1">=</span><span class="br0">(</span>initializer_list<span class="sy1"><</span>value_type<span class="sy1">></span><span class="br0">)</span><span class="sy4">;</span>
|
|
allocator_type get_allocator<span class="br0">(</span><span class="br0">)</span> <span class="kw4">const</span> <span class="kw1">noexcept</span><span class="sy4">;</span>
|
|
|
|
<span class="co1">// 迭代器</span>
|
|
iterator begin<span class="br0">(</span><span class="br0">)</span> <span class="kw1">noexcept</span><span class="sy4">;</span>
|
|
const_iterator begin<span class="br0">(</span><span class="br0">)</span> <span class="kw4">const</span> <span class="kw1">noexcept</span><span class="sy4">;</span>
|
|
iterator end<span class="br0">(</span><span class="br0">)</span> <span class="kw1">noexcept</span><span class="sy4">;</span>
|
|
const_iterator end<span class="br0">(</span><span class="br0">)</span> <span class="kw4">const</span> <span class="kw1">noexcept</span><span class="sy4">;</span>
|
|
const_iterator cbegin<span class="br0">(</span><span class="br0">)</span> <span class="kw4">const</span> <span class="kw1">noexcept</span><span class="sy4">;</span>
|
|
const_iterator cend<span class="br0">(</span><span class="br0">)</span> <span class="kw4">const</span> <span class="kw1">noexcept</span><span class="sy4">;</span>
|
|
|
|
<span class="co1">// 容量</span>
|
|
<span class="br0">[</span><span class="br0">[</span>nodiscard<span class="br0">]</span><span class="br0">]</span> <span class="kw4">bool</span> empty<span class="br0">(</span><span class="br0">)</span> <span class="kw4">const</span> <span class="kw1">noexcept</span><span class="sy4">;</span>
|
|
size_type size<span class="br0">(</span><span class="br0">)</span> <span class="kw4">const</span> <span class="kw1">noexcept</span><span class="sy4">;</span>
|
|
size_type max_size<span class="br0">(</span><span class="br0">)</span> <span class="kw4">const</span> <span class="kw1">noexcept</span><span class="sy4">;</span>
|
|
|
|
<span class="co1">// 修改器</span>
|
|
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span>... <span class="me1">Args</span><span class="sy1">></span> iterator emplace<span class="br0">(</span>Args<span class="sy3">&&</span>... <span class="me1">args</span><span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span>... <span class="me1">Args</span><span class="sy1">></span> iterator emplace_hint<span class="br0">(</span>const_iterator position, Args<span class="sy3">&&</span>... <span class="me1">args</span><span class="br0">)</span><span class="sy4">;</span>
|
|
iterator insert<span class="br0">(</span><span class="kw4">const</span> value_type<span class="sy3">&</span> obj<span class="br0">)</span><span class="sy4">;</span>
|
|
iterator insert<span class="br0">(</span>value_type<span class="sy3">&&</span> obj<span class="br0">)</span><span class="sy4">;</span>
|
|
iterator insert<span class="br0">(</span>const_iterator hint, <span class="kw4">const</span> value_type<span class="sy3">&</span> obj<span class="br0">)</span><span class="sy4">;</span>
|
|
iterator insert<span class="br0">(</span>const_iterator hint, value_type<span class="sy3">&&</span> obj<span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> InputIt<span class="sy1">></span> <span class="kw4">void</span> insert<span class="br0">(</span>InputIt first, InputIt last<span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="kw4">void</span> insert<span class="br0">(</span>initializer_list<span class="sy1"><</span>value_type<span class="sy1">></span><span class="br0">)</span><span class="sy4">;</span>
|
|
|
|
node_type extract<span class="br0">(</span>const_iterator position<span class="br0">)</span><span class="sy4">;</span>
|
|
node_type extract<span class="br0">(</span><span class="kw4">const</span> key_type<span class="sy3">&</span> x<span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> K<span class="sy1">></span> node_type extract<span class="br0">(</span>K<span class="sy3">&&</span> x<span class="br0">)</span><span class="sy4">;</span>
|
|
iterator insert<span class="br0">(</span>node_type<span class="sy3">&&</span> nh<span class="br0">)</span><span class="sy4">;</span>
|
|
iterator insert<span class="br0">(</span>const_iterator hint, node_type<span class="sy3">&&</span> nh<span class="br0">)</span><span class="sy4">;</span>
|
|
|
|
iterator erase<span class="br0">(</span>iterator position<span class="br0">)</span><span class="sy4">;</span>
|
|
iterator erase<span class="br0">(</span>const_iterator position<span class="br0">)</span><span class="sy4">;</span>
|
|
size_type erase<span class="br0">(</span><span class="kw4">const</span> key_type<span class="sy3">&</span> k<span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> K<span class="sy1">></span> size_type erase<span class="br0">(</span>K<span class="sy3">&&</span> x<span class="br0">)</span><span class="sy4">;</span>
|
|
iterator erase<span class="br0">(</span>const_iterator first, const_iterator last<span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="kw4">void</span> swap<span class="br0">(</span>unordered_multiset<span class="sy3">&</span><span class="br0">)</span>
|
|
<span class="kw1">noexcept</span><span class="br0">(</span>allocator_traits<span class="sy1"><</span>Allocator<span class="sy1">></span><span class="sy4">::</span><span class="me2">is_always_equal</span><span class="sy4">::</span><span class="me2">value</span> <span class="sy3">&&</span>
|
|
is_nothrow_swappable_v<span class="sy1"><</span>Hash<span class="sy1">></span> <span class="sy3">&&</span>
|
|
is_nothrow_swappable_v<span class="sy1"><</span>Pred<span class="sy1">></span><span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="kw4">void</span> clear<span class="br0">(</span><span class="br0">)</span> <span class="kw1">noexcept</span><span class="sy4">;</span>
|
|
|
|
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> H2, <span class="kw1">class</span> P2<span class="sy1">></span>
|
|
<span class="kw4">void</span> merge<span class="br0">(</span>unordered_multiset<span class="sy1"><</span>Key, H2, P2, Allocator<span class="sy1">></span><span class="sy3">&</span> source<span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> H2, <span class="kw1">class</span> P2<span class="sy1">></span>
|
|
<span class="kw4">void</span> merge<span class="br0">(</span>unordered_multiset<span class="sy1"><</span>Key, H2, P2, Allocator<span class="sy1">></span><span class="sy3">&&</span> source<span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> H2, <span class="kw1">class</span> P2<span class="sy1">></span>
|
|
<span class="kw4">void</span> merge<span class="br0">(</span>unordered_set<span class="sy1"><</span>Key, H2, P2, Allocator<span class="sy1">></span><span class="sy3">&</span> source<span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> H2, <span class="kw1">class</span> P2<span class="sy1">></span>
|
|
<span class="kw4">void</span> merge<span class="br0">(</span>unordered_set<span class="sy1"><</span>Key, H2, P2, Allocator<span class="sy1">></span><span class="sy3">&&</span> source<span class="br0">)</span><span class="sy4">;</span>
|
|
|
|
<span class="co1">// 观察器</span>
|
|
hasher hash_function<span class="br0">(</span><span class="br0">)</span> <span class="kw4">const</span><span class="sy4">;</span>
|
|
key_equal key_eq<span class="br0">(</span><span class="br0">)</span> <span class="kw4">const</span><span class="sy4">;</span>
|
|
|
|
<span class="co1">// set 操作</span>
|
|
iterator find<span class="br0">(</span><span class="kw4">const</span> key_type<span class="sy3">&</span> k<span class="br0">)</span><span class="sy4">;</span>
|
|
const_iterator find<span class="br0">(</span><span class="kw4">const</span> key_type<span class="sy3">&</span> k<span class="br0">)</span> <span class="kw4">const</span><span class="sy4">;</span>
|
|
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> K<span class="sy1">></span>
|
|
iterator find<span class="br0">(</span><span class="kw4">const</span> K<span class="sy3">&</span> k<span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> K<span class="sy1">></span>
|
|
const_iterator find<span class="br0">(</span><span class="kw4">const</span> K<span class="sy3">&</span> k<span class="br0">)</span> <span class="kw4">const</span><span class="sy4">;</span>
|
|
size_type count<span class="br0">(</span><span class="kw4">const</span> key_type<span class="sy3">&</span> k<span class="br0">)</span> <span class="kw4">const</span><span class="sy4">;</span>
|
|
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> K<span class="sy1">></span>
|
|
size_type count<span class="br0">(</span><span class="kw4">const</span> K<span class="sy3">&</span> k<span class="br0">)</span> <span class="kw4">const</span><span class="sy4">;</span>
|
|
<span class="kw4">bool</span> contains<span class="br0">(</span><span class="kw4">const</span> key_type<span class="sy3">&</span> k<span class="br0">)</span> <span class="kw4">const</span><span class="sy4">;</span>
|
|
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> K<span class="sy1">></span>
|
|
<span class="kw4">bool</span> contains<span class="br0">(</span><span class="kw4">const</span> K<span class="sy3">&</span> k<span class="br0">)</span> <span class="kw4">const</span><span class="sy4">;</span>
|
|
pair<span class="sy1"><</span>iterator, iterator<span class="sy1">></span> equal_range<span class="br0">(</span><span class="kw4">const</span> key_type<span class="sy3">&</span> k<span class="br0">)</span><span class="sy4">;</span>
|
|
pair<span class="sy1"><</span>const_iterator, const_iterator<span class="sy1">></span> equal_range<span class="br0">(</span><span class="kw4">const</span> key_type<span class="sy3">&</span> k<span class="br0">)</span> <span class="kw4">const</span><span class="sy4">;</span>
|
|
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> K<span class="sy1">></span>
|
|
pair<span class="sy1"><</span>iterator, iterator<span class="sy1">></span> equal_range<span class="br0">(</span><span class="kw4">const</span> K<span class="sy3">&</span> k<span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> K<span class="sy1">></span>
|
|
pair<span class="sy1"><</span>const_iterator, const_iterator<span class="sy1">></span> equal_range<span class="br0">(</span><span class="kw4">const</span> K<span class="sy3">&</span> k<span class="br0">)</span> <span class="kw4">const</span><span class="sy4">;</span>
|
|
|
|
<span class="co1">// 桶接口</span>
|
|
size_type bucket_count<span class="br0">(</span><span class="br0">)</span> <span class="kw4">const</span> <span class="kw1">noexcept</span><span class="sy4">;</span>
|
|
size_type max_bucket_count<span class="br0">(</span><span class="br0">)</span> <span class="kw4">const</span> <span class="kw1">noexcept</span><span class="sy4">;</span>
|
|
size_type bucket_size<span class="br0">(</span>size_type n<span class="br0">)</span> <span class="kw4">const</span><span class="sy4">;</span>
|
|
size_type bucket<span class="br0">(</span><span class="kw4">const</span> key_type<span class="sy3">&</span> k<span class="br0">)</span> <span class="kw4">const</span><span class="sy4">;</span>
|
|
local_iterator begin<span class="br0">(</span>size_type n<span class="br0">)</span><span class="sy4">;</span>
|
|
const_local_iterator begin<span class="br0">(</span>size_type n<span class="br0">)</span> <span class="kw4">const</span><span class="sy4">;</span>
|
|
local_iterator end<span class="br0">(</span>size_type n<span class="br0">)</span><span class="sy4">;</span>
|
|
const_local_iterator end<span class="br0">(</span>size_type n<span class="br0">)</span> <span class="kw4">const</span><span class="sy4">;</span>
|
|
const_local_iterator cbegin<span class="br0">(</span>size_type n<span class="br0">)</span> <span class="kw4">const</span><span class="sy4">;</span>
|
|
const_local_iterator cend<span class="br0">(</span>size_type n<span class="br0">)</span> <span class="kw4">const</span><span class="sy4">;</span>
|
|
|
|
<span class="co1">// 散列策略</span>
|
|
<span class="kw4">float</span> load_factor<span class="br0">(</span><span class="br0">)</span> <span class="kw4">const</span> <span class="kw1">noexcept</span><span class="sy4">;</span>
|
|
<span class="kw4">float</span> max_load_factor<span class="br0">(</span><span class="br0">)</span> <span class="kw4">const</span> <span class="kw1">noexcept</span><span class="sy4">;</span>
|
|
<span class="kw4">void</span> max_load_factor<span class="br0">(</span><span class="kw4">float</span> z<span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="kw4">void</span> rehash<span class="br0">(</span>size_type n<span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="kw4">void</span> reserve<span class="br0">(</span>size_type n<span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="br0">}</span><span class="sy4">;</span>
|
|
|
|
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> InputIt,
|
|
<span class="kw1">class</span> Hash <span class="sy1">=</span> hash<span class="sy1"><</span><span class="coMULTI">/*iter-value-type*/</span><span class="sy1"><</span>InputIt<span class="sy1">>></span>,
|
|
<span class="kw1">class</span> Pred <span class="sy1">=</span> equal_to<span class="sy1"><</span><span class="coMULTI">/*iter-value-type*/</span><span class="sy1"><</span>InputIt<span class="sy1">>></span>,
|
|
<span class="kw1">class</span> Allocator <span class="sy1">=</span> allocator<span class="sy1"><</span><span class="coMULTI">/*iter-value-type*/</span><span class="sy1"><</span>InputIt<span class="sy1">>>></span>
|
|
unordered_multiset<span class="br0">(</span>InputIt, InputIt,
|
|
<span class="coMULTI">/* 见描述 */</span><span class="sy4">::</span><span class="me2">size_type</span> <span class="sy1">=</span> <span class="coMULTI">/* 见描述 */</span>,
|
|
Hash <span class="sy1">=</span> Hash<span class="br0">(</span><span class="br0">)</span>, Pred <span class="sy1">=</span> Pred<span class="br0">(</span><span class="br0">)</span>, Allocator <span class="sy1">=</span> Allocator<span class="br0">(</span><span class="br0">)</span><span class="br0">)</span>
|
|
<span class="sy2">-</span><span class="sy1">></span> unordered_multiset<span class="sy1"><</span><span class="coMULTI">/*iter-value-type*/</span><span class="sy1"><</span>InputIt<span class="sy1">></span>,
|
|
Hash, Pred, Allocator<span class="sy1">></span><span class="sy4">;</span>
|
|
|
|
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> T, <span class="kw1">class</span> Hash <span class="sy1">=</span> hash<span class="sy1"><</span>T<span class="sy1">></span>,
|
|
<span class="kw1">class</span> Pred <span class="sy1">=</span> equal_to<span class="sy1"><</span>T<span class="sy1">></span>, <span class="kw1">class</span> Allocator <span class="sy1">=</span> allocator<span class="sy1"><</span>T<span class="sy1">>></span>
|
|
unordered_multiset<span class="br0">(</span>initializer_list<span class="sy1"><</span>T<span class="sy1">></span>,
|
|
<span class="kw1">typename</span> <span class="coMULTI">/* 见描述 */</span><span class="sy4">::</span><span class="me2">size_type</span> <span class="sy1">=</span> <span class="coMULTI">/* 见描述 */</span>,
|
|
Hash <span class="sy1">=</span> Hash<span class="br0">(</span><span class="br0">)</span>, Pred <span class="sy1">=</span> Pred<span class="br0">(</span><span class="br0">)</span>, Allocator <span class="sy1">=</span> Allocator<span class="br0">(</span><span class="br0">)</span><span class="br0">)</span>
|
|
<span class="sy2">-</span><span class="sy1">></span> unordered_multiset<span class="sy1"><</span>T, Hash, Pred, Allocator<span class="sy1">></span><span class="sy4">;</span>
|
|
|
|
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> InputIt, <span class="kw1">class</span> Allocator<span class="sy1">></span>
|
|
unordered_multiset<span class="br0">(</span>InputIt, InputIt, <span class="kw1">typename</span> <span class="coMULTI">/* 见描述 */</span><span class="sy4">::</span><span class="me2">size_type</span>,
|
|
Allocator<span class="br0">)</span>
|
|
<span class="sy2">-</span><span class="sy1">></span> unordered_multiset<span class="sy1"><</span><span class="coMULTI">/*iter-value-type*/</span><span class="sy1"><</span>InputIt<span class="sy1">></span>,
|
|
hash<span class="sy1"><</span><span class="coMULTI">/*iter-value-type*/</span><span class="sy1"><</span>InputIt<span class="sy1">>></span>,
|
|
equal_to<span class="sy1"><</span><span class="coMULTI">/*iter-value-type*/</span><span class="sy1"><</span>InputIt<span class="sy1">>></span>,
|
|
Allocator<span class="sy1">></span><span class="sy4">;</span>
|
|
|
|
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> InputIt, <span class="kw1">class</span> Hash, <span class="kw1">class</span> Allocator<span class="sy1">></span>
|
|
unordered_multiset<span class="br0">(</span>InputIt, InputIt, <span class="kw1">typename</span> <span class="coMULTI">/* 见描述 */</span><span class="sy4">::</span><span class="me2">size_type</span>,
|
|
Hash, Allocator<span class="br0">)</span>
|
|
<span class="sy2">-</span><span class="sy1">></span> unordered_multiset<span class="sy1"><</span><span class="coMULTI">/*iter-value-type*/</span><span class="sy1"><</span>InputIt<span class="sy1">></span>, Hash,
|
|
equal_to<span class="sy1"><</span><span class="coMULTI">/*iter-value-type*/</span><span class="sy1"><</span>InputIt<span class="sy1">>></span>,
|
|
Allocator<span class="sy1">></span><span class="sy4">;</span>
|
|
|
|
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> T, <span class="kw1">class</span> Allocator<span class="sy1">></span>
|
|
unordered_multiset<span class="br0">(</span>initializer_list<span class="sy1"><</span>T<span class="sy1">></span>, <span class="kw1">typename</span> <span class="coMULTI">/* 见描述 */</span><span class="sy4">::</span><span class="me2">size_type</span>,
|
|
Allocator<span class="br0">)</span>
|
|
<span class="sy2">-</span><span class="sy1">></span> unordered_multiset<span class="sy1"><</span>T, hash<span class="sy1"><</span>T<span class="sy1">></span>, equal_to<span class="sy1"><</span>T<span class="sy1">></span>, Allocator<span class="sy1">></span><span class="sy4">;</span>
|
|
|
|
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> T, <span class="kw1">class</span> Hash, <span class="kw1">class</span> Allocator<span class="sy1">></span>
|
|
unordered_multiset<span class="br0">(</span>initializer_list<span class="sy1"><</span>T<span class="sy1">></span>, <span class="kw1">typename</span> <span class="coMULTI">/* 见描述 */</span><span class="sy4">::</span><span class="me2">size_type</span>,
|
|
Hash, Allocator<span class="br0">)</span>
|
|
<span class="sy2">-</span><span class="sy1">></span> unordered_multiset<span class="sy1"><</span>T, Hash, equal_to<span class="sy1"><</span>T<span class="sy1">></span>, Allocator<span class="sy1">></span><span class="sy4">;</span>
|
|
|
|
<span class="co1">// swap</span>
|
|
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> Key, <span class="kw1">class</span> Hash, <span class="kw1">class</span> Pred, <span class="kw1">class</span> Alloc<span class="sy1">></span>
|
|
<span class="kw4">void</span> swap<span class="br0">(</span>unordered_multiset<span class="sy1"><</span>Key, Hash, Pred, Alloc<span class="sy1">></span><span class="sy3">&</span> x,
|
|
unordered_multiset<span class="sy1"><</span>Key, Hash, Pred, Alloc<span class="sy1">></span><span class="sy3">&</span> y<span class="br0">)</span>
|
|
<span class="kw1">noexcept</span><span class="br0">(</span><span class="kw1">noexcept</span><span class="br0">(</span>x.<span class="me1">swap</span><span class="br0">(</span>y<span class="br0">)</span><span class="br0">)</span><span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="br0">}</span></pre></div>
|
|
</div>
|
|
</div>
|
|
<div class="visualClear"></div>
|
|
</div>
|
|
</div>
|
|
</div>
|
|
</body>
|
|
</html>
|