125 lines
18 KiB
HTML
125 lines
18 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>std::unordered_multiset 的推导指引</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_container_unordered_multiset_deduction_guides skin-cppreference2 action-view cpp-page-template cpp-navbar">
|
|
<div id="cpp-content-base">
|
|
<div id="content"><a id="top"></a>
|
|
<h1 id="firstHeading" class="firstHeading"><code>std::unordered_multiset</code> 的推导指引</h1>
|
|
<div id="bodyContent">
|
|
<div id="contentSub"><span class="subpages">< <a href="cpp.html">cpp</a>‎ | <a href="cpp-container.html">container</a>‎ | <a href="cpp-container-unordered_multiset.html">unordered multiset</a></span></div>
|
|
<div id="mw-content-text" lang="zh" dir="ltr" class="mw-content-ltr" xml:lang="zh">
|
|
<div class="t-page-template" style="">
|
|
<p></p>
|
|
</div>
|
|
<table class="t-dcl-begin">
|
|
<tbody>
|
|
<tr class="t-dsc-header">
|
|
<td>
|
|
<div>定义于头文件 <code><a href="cpp-header-unordered_set.html"><unordered_set></a></code></div>
|
|
</td>
|
|
<td></td>
|
|
<td></td>
|
|
</tr>
|
|
<tr class="t-dcl t-since-cxx17">
|
|
<td>
|
|
<div><span class="mw-geshi cpp source-cpp"><span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> InputIt,<br /></span>
|
|
<p> <span class="kw1">class</span> Hash <span class="sy1">=</span> <a href="cpp-utility-hash.html"><span class="kw1124">std::<span class="me2">hash</span></span></a><span class="sy1"><</span><span class="kw1">typename</span> <a href="cpp-iterator-iterator_traits.html"><span class="kw651">std::<span class="me2">iterator_traits</span></span></a><span class="sy1"><</span>InputIt<span class="sy1">></span><span class="sy4">::</span><span class="me2">value_type</span><span class="sy1">></span>,<br />
|
|
<span class="kw1">class</span> Pred <span class="sy1">=</span> <a href="cpp-utility-functional-equal_to.html"><span class="kw1035">std::<span class="me2">equal_to</span></span></a><span class="sy1"><</span><span class="kw1">typename</span> <a href="cpp-iterator-iterator_traits.html"><span class="kw651">std::<span class="me2">iterator_traits</span></span></a><span class="sy1"><</span>InputIt<span class="sy1">></span><span class="sy4">::</span><span class="me2">value_type</span><span class="sy1">></span>,<br />
|
|
<span class="kw1">class</span> Alloc <span class="sy1">=</span> <a href="cpp-memory-allocator.html"><span class="kw700">std::<span class="me2">allocator</span></span></a><span class="sy1"><</span><span class="kw1">typename</span> <a href="cpp-iterator-iterator_traits.html"><span class="kw651">std::<span class="me2">iterator_traits</span></span></a><span class="sy1"><</span>InputIt<span class="sy1">></span><span class="sy4">::</span><span class="me2">value_type</span><span class="sy1">>></span><br />
|
|
unordered_multiset<span class="br0">(</span>InputIt, InputIt,<br />
|
|
<span class="kw1">typename</span> <span class="coMULTI">/*see below*/</span><span class="sy4">::</span><span class="me2">size_type</span> <span class="sy1">=</span> <span class="coMULTI">/*see below*/</span>,<br />
|
|
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>, Alloc <span class="sy1">=</span> Alloc<span class="br0">(</span><span class="br0">)</span><span class="br0">)</span><br /></p>
|
|
<span class="sy2">-</span><span class="sy1">></span> unordered_multiset<span class="sy1"><</span><span class="kw1">typename</span> <a href="cpp-iterator-iterator_traits.html"><span class="kw651">std::<span class="me2">iterator_traits</span></span></a><span class="sy1"><</span>InputIt<span class="sy1">></span><span class="sy4">::</span><span class="me2">value_type</span>, Hash, Pred, Alloc<span class="sy1">></span><span class="sy4">;</span></div>
|
|
</td>
|
|
<td>(1)</td>
|
|
<td><span class="t-mark-rev t-since-cxx17">(C++17 起)</span></td>
|
|
</tr>
|
|
<tr class="t-dcl t-since-cxx17">
|
|
<td>
|
|
<div><span class="mw-geshi cpp source-cpp"><span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> T,<br /></span>
|
|
<p> <span class="kw1">class</span> Hash <span class="sy1">=</span> <a href="cpp-utility-hash.html"><span class="kw1124">std::<span class="me2">hash</span></span></a><span class="sy1"><</span>T<span class="sy1">></span>,<br />
|
|
<span class="kw1">class</span> Pred <span class="sy1">=</span> <a href="cpp-utility-functional-equal_to.html"><span class="kw1035">std::<span class="me2">equal_to</span></span></a><span class="sy1"><</span>T<span class="sy1">></span>,<br />
|
|
<span class="kw1">class</span> Alloc <span class="sy1">=</span> <a href="cpp-memory-allocator.html"><span class="kw700">std::<span class="me2">allocator</span></span></a><span class="sy1"><</span>T<span class="sy1">>></span><br />
|
|
unordered_multiset<span class="br0">(</span><a href="cpp-utility-initializer_list.html"><span class="kw960">std::<span class="me2">initializer_list</span></span></a><span class="sy1"><</span>T<span class="sy1">></span>,<br />
|
|
<span class="kw1">typename</span> <span class="coMULTI">/*see below*/</span><span class="sy4">::</span><span class="me2">size_type</span> <span class="sy1">=</span> <span class="coMULTI">/*see below*/</span>,<br />
|
|
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>, Alloc <span class="sy1">=</span> Alloc<span class="br0">(</span><span class="br0">)</span><span class="br0">)</span><br /></p>
|
|
<span class="sy2">-</span><span class="sy1">></span> unordered_multiset<span class="sy1"><</span>T, Hash, Pred, Alloc<span class="sy1">></span><span class="sy4">;</span></div>
|
|
</td>
|
|
<td>(2)</td>
|
|
<td><span class="t-mark-rev t-since-cxx17">(C++17 起)</span></td>
|
|
</tr>
|
|
<tr class="t-dcl t-since-cxx17">
|
|
<td>
|
|
<div><span class="mw-geshi cpp source-cpp"><span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> InputIt, <span class="kw1">class</span> Alloc<span class="sy1">></span><br /></span>
|
|
<p>unordered_multiset<span class="br0">(</span>InputIt, InputIt, <span class="kw1">typename</span> <span class="coMULTI">/*see below*/</span><span class="sy4">::</span><span class="me2">size_type</span>, Alloc<span class="br0">)</span><br />
|
|
<span class="sy2">-</span><span class="sy1">></span> unordered_multiset<span class="sy1"><</span><span class="kw1">typename</span> <a href="cpp-iterator-iterator_traits.html"><span class="kw651">std::<span class="me2">iterator_traits</span></span></a><span class="sy1"><</span>InputIt<span class="sy1">></span><span class="sy4">::</span><span class="me2">value_type</span>,<br />
|
|
<a href="cpp-utility-hash.html"><span class="kw1124">std::<span class="me2">hash</span></span></a><span class="sy1"><</span><span class="kw1">typename</span> <a href="cpp-iterator-iterator_traits.html"><span class="kw651">std::<span class="me2">iterator_traits</span></span></a><span class="sy1"><</span>InputIt<span class="sy1">></span><span class="sy4">::</span><span class="me2">value_type</span><span class="sy1">></span>,<br />
|
|
<a href="cpp-utility-functional-equal_to.html"><span class="kw1035">std::<span class="me2">equal_to</span></span></a><span class="sy1"><</span><span class="kw1">typename</span> <a href="cpp-iterator-iterator_traits.html"><span class="kw651">std::<span class="me2">iterator_traits</span></span></a><span class="sy1"><</span>InputIt<span class="sy1">></span><span class="sy4">::</span><span class="me2">value_type</span><span class="sy1">></span>,<br /></p>
|
|
Alloc<span class="sy1">></span><span class="sy4">;</span></div>
|
|
</td>
|
|
<td>(3)</td>
|
|
<td><span class="t-mark-rev t-since-cxx17">(C++17 起)</span></td>
|
|
</tr>
|
|
<tr class="t-dcl t-since-cxx17">
|
|
<td>
|
|
<div><span class="mw-geshi cpp source-cpp"><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> Alloc<span class="sy1">></span><br /></span>
|
|
<p>unordered_multiset<span class="br0">(</span>InputIt, InputIt, <span class="kw1">typename</span> <span class="coMULTI">/*see below*/</span><span class="sy4">::</span><span class="me2">size_type</span>, Hash, Alloc<span class="br0">)</span><br />
|
|
<span class="sy2">-</span><span class="sy1">></span> unordered_multiset<span class="sy1"><</span><span class="kw1">typename</span> <a href="cpp-iterator-iterator_traits.html"><span class="kw651">std::<span class="me2">iterator_traits</span></span></a><span class="sy1"><</span>InputIt<span class="sy1">></span><span class="sy4">::</span><span class="me2">value_type</span>, Hash,<br /></p>
|
|
<a href="cpp-utility-functional-equal_to.html"><span class="kw1035">std::<span class="me2">equal_to</span></span></a><span class="sy1"><</span><span class="kw1">typename</span> <a href="cpp-iterator-iterator_traits.html"><span class="kw651">std::<span class="me2">iterator_traits</span></span></a><span class="sy1"><</span>InputIt<span class="sy1">></span><span class="sy4">::</span><span class="me2">value_type</span><span class="sy1">></span>, Allocator<span class="sy1">></span><span class="sy4">;</span></div>
|
|
</td>
|
|
<td>(4)</td>
|
|
<td><span class="t-mark-rev t-since-cxx17">(C++17 起)</span></td>
|
|
</tr>
|
|
<tr class="t-dcl t-since-cxx17">
|
|
<td>
|
|
<div><span class="mw-geshi cpp source-cpp"><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><br /></span>
|
|
<p>unordered_multiset<span class="br0">(</span><a href="cpp-utility-initializer_list.html"><span class="kw960">std::<span class="me2">initializer_list</span></span></a><span class="sy1"><</span>T<span class="sy1">></span>, <span class="kw1">typename</span> <span class="coMULTI">/*see below*/</span><span class="sy4">::</span><span class="me2">size_type</span>, Allocator<span class="br0">)</span><br /></p>
|
|
<span class="sy2">-</span><span class="sy1">></span> unordered_multiset<span class="sy1"><</span>T, <a href="cpp-utility-hash.html"><span class="kw1124">std::<span class="me2">hash</span></span></a><span class="sy1"><</span>T<span class="sy1">></span>, <a href="cpp-utility-functional-equal_to.html"><span class="kw1035">std::<span class="me2">equal_to</span></span></a><span class="sy1"><</span>T<span class="sy1">></span>, Alloc<span class="sy1">></span><span class="sy4">;</span></div>
|
|
</td>
|
|
<td>(5)</td>
|
|
<td><span class="t-mark-rev t-since-cxx17">(C++17 起)</span></td>
|
|
</tr>
|
|
<tr class="t-dcl t-since-cxx17">
|
|
<td>
|
|
<div><span class="mw-geshi cpp source-cpp"><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> Alloc<span class="sy1">></span><br /></span>
|
|
<p>unordered_multiset<span class="br0">(</span><a href="cpp-utility-initializer_list.html"><span class="kw960">std::<span class="me2">initializer_list</span></span></a><span class="sy1"><</span>T<span class="sy1">></span>, <span class="kw1">typename</span> <span class="coMULTI">/*see below*/</span><span class="sy4">::</span><span class="me2">size_type</span>, Hash, Alloc<span class="br0">)</span><br /></p>
|
|
<span class="sy2">-</span><span class="sy1">></span> unordered_multiset<span class="sy1"><</span>T, Hash, <a href="cpp-utility-functional-equal_to.html"><span class="kw1035">std::<span class="me2">equal_to</span></span></a><span class="sy1"><</span>T<span class="sy1">></span>, Alloc<span class="sy1">></span><span class="sy4">;</span></div>
|
|
</td>
|
|
<td>(6)</td>
|
|
<td><span class="t-mark-rev t-since-cxx17">(C++17 起)</span></td>
|
|
</tr>
|
|
<tr class="t-dcl-sep">
|
|
<td></td>
|
|
<td></td>
|
|
<td></td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
<p>为 unordered_multiset 提供这些<a href="cpp-language-class_template_argument_deduction.html">推导指引</a>以允许从迭代器范围（重载 <span class="t-v">(1,3,4)</span> ）和 <span class="t-lc"><a href="cpp-utility-initializer_list.html">std::initializer_list</a></span> （重载 <span class="t-v">(2,5.6)</span> ）推导。此重载仅若 <code>InputIt</code> 满足<a href="cpp-named_req-InputIterator.html"><span style="font-style:italic">老式输入迭代器</span> <span style="font-family: Georgia, 'DejaVu Serif', serif; font-style:italic">(LegacyInputIterator)</span></a> 、 <code>Alloc</code> 满足<a href="cpp-named_req-Allocator.html"><span style="font-style:italic">分配器</span> <span style="font-family: Georgia, 'DejaVu Serif', serif; font-style:italic">(Allocator)</span></a> 、 <code>Hash</code> 或 <code>Pred</code> 均不满足<a href="cpp-named_req-Allocator.html"><span style="font-style:italic">分配器</span> <span style="font-family: Georgia, 'DejaVu Serif', serif; font-style:italic">(Allocator)</span></a> 、 <code>Hash</code> 不是整数类型才参与重载决议</p>
|
|
<p>注意：库确定类型是否满足<a href="cpp-named_req-InputIterator.html"><span style="font-style:italic">老式输入迭代器</span> <span style="font-family: Georgia, 'DejaVu Serif', serif; font-style:italic">(LegacyInputIterator)</span></a> 的程度是未指定的，除了最低要求是整数类型不具备输入迭代器的条件。类似地，确定类型是否满足<a href="cpp-named_req-Allocator.html"><span style="font-style:italic">分配器</span> <span style="font-family: Georgia, 'DejaVu Serif', serif; font-style:italic">(Allocator)</span></a> 是未指定的，除了最低要求是成员类型 <code>Alloc::value_type</code> 必须存在，且表达式 <span class="t-c"><span class="mw-geshi cpp source-cpp"><a href="cpp-utility-declval.html"><span class="kw1120">std::<span class="me2">declval</span></span></a><span class="sy1"><</span>Alloc<span class="sy3">&</span><span class="sy1">></span><span class="br0">(</span><span class="br0">)</span>.<span class="me1">allocate</span><span class="br0">(</span><a href="cpp-types-size_t.html"><span class="kw100">std::<span class="me2">size_t</span></span></a><span class="br0">{</span><span class="br0">}</span><span class="br0">)</span></span></span> 在作为不求值操作数时必须为良构。</p>
|
|
<p>这些指引中的 <span class="t-c"><span class="mw-geshi cpp source-cpp">size_type</span></span> 参数类型指代推导指引所推导出的类型的 <span class="t-c"><span class="mw-geshi cpp source-cpp">size_type</span></span> 成员类型。</p>
|
|
<h3><span class="mw-headline" id=".E7.A4.BA.E4.BE.8B">示例</span></h3>
|
|
<div class="t-example">
|
|
<div class="t-example-live-link"></div>
|
|
<div dir="ltr" class="mw-geshi" style="text-align: left;">
|
|
<div class="cpp source-cpp">
|
|
<pre class="de1"><span class="co2">#include <unordered_set></span>
|
|
<span class="kw4">int</span> main<span class="br0">(</span><span class="br0">)</span> <span class="br0">{</span>
|
|
<a href="cpp-container-unordered_multiset.html"><span class="kw1291">std::<span class="me2">unordered_multiset</span></span></a> s <span class="sy1">=</span> <span class="br0">{</span><span class="nu0">1</span>,<span class="nu0">2</span>,<span class="nu0">3</span>,<span class="nu0">4</span><span class="br0">}</span><span class="sy4">;</span> <span class="co1">// 指引 #2 推导 std::unordered_multiset<int></span>
|
|
<a href="cpp-container-unordered_multiset.html"><span class="kw1291">std::<span class="me2">unordered_multiset</span></span></a> s2<span class="br0">(</span>s.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span>, s.<span class="me1">end</span><span class="br0">(</span><span class="br0">)</span><span class="br0">)</span><span class="sy4">;</span> <span class="co1">// 指引 #1 推导 std::unordered_multiset<int></span>
|
|
<span class="br0">}</span></pre></div>
|
|
</div>
|
|
</div>
|
|
</div>
|
|
<div class="visualClear"></div>
|
|
</div>
|
|
</div>
|
|
</div>
|
|
</body>
|
|
</html>
|