138 lines
12 KiB
HTML
138 lines
12 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_multimap<Key,T,Hash,KeyEqual,Allocator>::begin, std::unordered_multimap<Key,T,Hash,KeyEqual,Allocator>::cbegin</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_multimap_begin 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"><span style="font-size:0.7em; line-height:130%">std::unordered_multimap<Key,T,Hash,KeyEqual,Allocator>::</span>begin, <span style="font-size:0.7em; line-height:130%">std::unordered_multimap<Key,T,Hash,KeyEqual,Allocator>::</span>cbegin</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_multimap.html">unordered multimap</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-dcl t-since-cxx11">
|
|
<td>
|
|
<div><span class="mw-geshi cpp source-cpp">iterator begin<span class="br0">(</span><span class="br0">)</span> <span class="kw1">noexcept</span><span class="sy4">;</span></span></div>
|
|
</td>
|
|
<td class="t-dcl-nopad"></td>
|
|
<td><span class="t-mark-rev t-since-cxx11">(C++11 起)</span></td>
|
|
</tr>
|
|
<tr class="t-dcl t-since-cxx11">
|
|
<td>
|
|
<div><span class="mw-geshi cpp source-cpp">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></span></div>
|
|
</td>
|
|
<td class="t-dcl-nopad"></td>
|
|
<td><span class="t-mark-rev t-since-cxx11">(C++11 起)</span></td>
|
|
</tr>
|
|
<tr class="t-dcl t-since-cxx11">
|
|
<td>
|
|
<div><span class="mw-geshi cpp source-cpp">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></span></div>
|
|
</td>
|
|
<td class="t-dcl-nopad"></td>
|
|
<td><span class="t-mark-rev t-since-cxx11">(C++11 起)</span></td>
|
|
</tr>
|
|
<tr class="t-dcl-sep">
|
|
<td></td>
|
|
<td></td>
|
|
<td></td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
<p>返回指向 <code>unordered_multimap</code> 首元素的迭代器。</p>
|
|
<p>若 <code>unordered_multimap</code> 为空,则返回的迭代器将等于 <span class="t-lc"><a href="cpp-container-unordered_multimap-end.html">end()</a></span> 。</p>
|
|
<div class="t-image">
|
|
<p><img alt="range-begin-end.svg" src="range-begin-end.svg" width="546" height="157" /></p>
|
|
</div>
|
|
<h3><span class="mw-headline" id=".E5.8F.82.E6.95.B0">参数</span></h3>
|
|
<p>(无)</p>
|
|
<h3><span class="mw-headline" id=".E8.BF.94.E5.9B.9E.E5.80.BC">返回值</span></h3>
|
|
<p>指向首元素的迭代器。</p>
|
|
<h3><span class="mw-headline" id=".E5.A4.8D.E6.9D.82.E5.BA.A6">复杂度</span></h3>
|
|
<p>常数。</p>
|
|
<p><br /></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_map></span>
|
|
<span class="co2">#include <algorithm></span>
|
|
<span class="co2">#include <cassert></span>
|
|
<span class="co2">#include <iostream></span>
|
|
<span class="co2">#include <string></span>
|
|
<span class="co2">#include <utility></span>
|
|
|
|
<span class="kw4">int</span> main<span class="br0">(</span><span class="br0">)</span>
|
|
<span class="br0">{</span>
|
|
<span class="kw4">auto</span> show_node <span class="sy1">=</span> <span class="br0">[</span><span class="br0">]</span><span class="br0">(</span><span class="kw4">const</span> <a href="cpp-utility-pair.html"><span class="kw1096">std::<span class="me2">pair</span></span></a><span class="sy1"><</span><a href="cpp-string-basic_string.html"><span class="kw1230">std::<span class="me2">string</span></span></a>, <a href="cpp-string-basic_string.html"><span class="kw1230">std::<span class="me2">string</span></span></a><span class="sy1">></span><span class="sy3">&</span> node<span class="br0">)</span> <span class="br0">{</span>
|
|
<a href="cpp-io-cout.html"><span class="kw1758">std::<span class="me2">cout</span></span></a> <span class="sy1"><<</span> node.<span class="me1">first</span> <span class="sy1"><<</span> <span class="st0">" : "</span> <span class="sy1"><<</span> node.<span class="me1">second</span> <span class="sy1"><<</span> <span class="st0">'<span class="es1">\n</span>'</span><span class="sy4">;</span>
|
|
<span class="br0">}</span><span class="sy4">;</span>
|
|
|
|
<a href="cpp-container-unordered_multimap.html"><span class="kw1295">std::<span class="me2">unordered_multimap</span></span></a><span class="sy1"><</span><a href="cpp-string-basic_string.html"><span class="kw1230">std::<span class="me2">string</span></span></a>, <a href="cpp-string-basic_string.html"><span class="kw1230">std::<span class="me2">string</span></span></a><span class="sy1">></span> lemmas<span class="sy4">;</span>
|
|
<a href="cpp-error-assert.html"><span class="kw774">assert</span></a><span class="br0">(</span>lemmas.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span> <span class="sy1">==</span> lemmas.<span class="me1">end</span><span class="br0">(</span><span class="br0">)</span><span class="br0">)</span><span class="sy4">;</span> <span class="co1">// OK</span>
|
|
<a href="cpp-error-assert.html"><span class="kw774">assert</span></a><span class="br0">(</span>lemmas.<span class="me1">cbegin</span><span class="br0">(</span><span class="br0">)</span> <span class="sy1">==</span> lemmas.<span class="me1">cend</span><span class="br0">(</span><span class="br0">)</span><span class="br0">)</span><span class="sy4">;</span> <span class="co1">// OK</span>
|
|
|
|
lemmas.<span class="me1">insert</span><span class="br0">(</span><span class="br0">{</span> <span class="st0">"1. ∀x ∈ N ∃y ∈ N"</span>, <span class="st0">"x ≤ y"</span> <span class="br0">}</span><span class="br0">)</span><span class="sy4">;</span>
|
|
show_node<span class="br0">(</span><span class="sy2">*</span>lemmas.<span class="me1">cbegin</span><span class="br0">(</span><span class="br0">)</span><span class="br0">)</span><span class="sy4">;</span>
|
|
<a href="cpp-error-assert.html"><span class="kw774">assert</span></a><span class="br0">(</span>lemmas.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span> <span class="sy3">!</span><span class="sy1">=</span> lemmas.<span class="me1">end</span><span class="br0">(</span><span class="br0">)</span><span class="br0">)</span><span class="sy4">;</span> <span class="co1">// OK</span>
|
|
<a href="cpp-error-assert.html"><span class="kw774">assert</span></a><span class="br0">(</span>lemmas.<span class="me1">cbegin</span><span class="br0">(</span><span class="br0">)</span> <span class="sy3">!</span><span class="sy1">=</span> lemmas.<span class="me1">cend</span><span class="br0">(</span><span class="br0">)</span><span class="br0">)</span><span class="sy4">;</span> <span class="co1">// OK</span>
|
|
lemmas.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span><span class="sy2">-</span><span class="sy1">></span>second <span class="sy1">=</span> <span class="st0">"x < y"</span><span class="sy4">;</span>
|
|
show_node<span class="br0">(</span><span class="sy2">*</span>lemmas.<span class="me1">cbegin</span><span class="br0">(</span><span class="br0">)</span><span class="br0">)</span><span class="sy4">;</span>
|
|
|
|
lemmas.<span class="me1">insert</span><span class="br0">(</span><span class="br0">{</span> <span class="st0">"2. ∀x,y ∈ N"</span>, <span class="st0">"x = y V x ≠ y"</span> <span class="br0">}</span><span class="br0">)</span><span class="sy4">;</span>
|
|
show_node<span class="br0">(</span><span class="sy2">*</span>lemmas.<span class="me1">cbegin</span><span class="br0">(</span><span class="br0">)</span><span class="br0">)</span><span class="sy4">;</span>
|
|
|
|
lemmas.<span class="me1">insert</span><span class="br0">(</span><span class="br0">{</span> <span class="st0">"3. ∀x ∈ N ∃y ∈ N"</span>, <span class="st0">"y = x + 1"</span> <span class="br0">}</span><span class="br0">)</span><span class="sy4">;</span>
|
|
show_node<span class="br0">(</span><span class="sy2">*</span>lemmas.<span class="me1">cbegin</span><span class="br0">(</span><span class="br0">)</span><span class="br0">)</span><span class="sy4">;</span>
|
|
|
|
<a href="cpp-io-cout.html"><span class="kw1758">std::<span class="me2">cout</span></span></a> <span class="sy1"><<</span> <span class="st0">"lemmas: <span class="es1">\n</span>"</span><span class="sy4">;</span>
|
|
<a href="cpp-algorithm-for_each.html"><span class="kw1568">std::<span class="me2">for_each</span></span></a><span class="br0">(</span>lemmas.<span class="me1">cbegin</span><span class="br0">(</span><span class="br0">)</span>, lemmas.<span class="me1">cend</span><span class="br0">(</span><span class="br0">)</span>,
|
|
<span class="br0">[</span><span class="sy3">&</span><span class="br0">]</span><span class="br0">(</span><span class="kw4">const</span> <span class="kw4">auto</span><span class="sy3">&</span> n<span class="br0">)</span> <span class="br0">{</span> show_node<span class="br0">(</span>n<span class="br0">)</span><span class="sy4">;</span> <span class="br0">}</span><span class="br0">)</span><span class="sy4">;</span>
|
|
<a href="cpp-io-cout.html"><span class="kw1758">std::<span class="me2">cout</span></span></a> <span class="sy1"><<</span> <span class="st0">"<span class="es1">\n</span>"</span><span class="sy4">;</span>
|
|
<span class="br0">}</span></pre></div>
|
|
</div>
|
|
<p>可能的输出:</p>
|
|
<div dir="ltr" class="mw-geshi" style="text-align: left;">
|
|
<div class="text source-text">
|
|
<pre class="de1">1. ∀x ∈ N ∃y ∈ N : x ≤ y
|
|
1. ∀x ∈ N ∃y ∈ N : x < y
|
|
2. ∀x,y ∈ N : x = y V x ≠ y
|
|
3. ∀x ∈ N ∃y ∈ N : y = x + 1
|
|
lemmas:
|
|
3. ∀x ∈ N ∃y ∈ N : y = x + 1
|
|
1. ∀x ∈ N ∃y ∈ N : x < y
|
|
2. ∀x,y ∈ N : x = y V x ≠ y</pre></div>
|
|
</div>
|
|
</div>
|
|
<h3><span class="mw-headline" id=".E5.8F.82.E9.98.85">参阅</span></h3>
|
|
<table class="t-dsc-begin">
|
|
<tr class="t-dsc">
|
|
<td>
|
|
<div class="t-dsc-member-div">
|
|
<div><a href="cpp-container-unordered_multimap-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></div>
|
|
</div>
|
|
</td>
|
|
<td>返回指向末尾的迭代器<br />
|
|
<span class="t-mark">(公开成员函数)</span></td>
|
|
</tr>
|
|
</table>
|
|
<table class="t-dcl-begin">
|
|
<tbody></tbody>
|
|
</table>
|
|
</div>
|
|
<div class="visualClear"></div>
|
|
</div>
|
|
</div>
|
|
</div>
|
|
</body>
|
|
</html>
|