321 lines
29 KiB
HTML
321 lines
29 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::set<Key,Compare,Allocator>::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_container_set_set 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::set<Key,Compare,Allocator>::</span>set</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-set.html">set</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">
|
|
<td class="t-dcl-nopad">
|
|
<div><span class="mw-geshi cpp source-cpp">set<span class="br0">(</span><span class="br0">)</span><span class="sy4">;</span><br /></span>
|
|
<p><span class="kw1">explicit</span> set<span class="br0">(</span> <span class="kw4">const</span> Compare<span class="sy3">&</span> comp,<br /></p>
|
|
<span class="kw4">const</span> Allocator<span class="sy3">&</span> alloc <span class="sy1">=</span> Allocator<span class="br0">(</span><span class="br0">)</span> <span class="br0">)</span><span class="sy4">;</span></div>
|
|
</td>
|
|
<td class="t-dcl-nopad"></td>
|
|
<td class="t-dcl-nopad"></td>
|
|
</tr>
|
|
<tr class="t-dcl t-since-cxx11">
|
|
<td>
|
|
<div><span class="mw-geshi cpp source-cpp"><span class="kw1">explicit</span> set<span class="br0">(</span> <span class="kw4">const</span> Allocator<span class="sy3">&</span> alloc <span class="br0">)</span><span class="sy4">;</span></span></div>
|
|
</td>
|
|
<td>(1)</td>
|
|
<td><span class="t-mark-rev t-since-cxx11">(C++11 起)</span></td>
|
|
</tr>
|
|
</tbody>
|
|
<tbody class="t-dcl-rev t-dcl-rev-num">
|
|
<tr class="t-dcl-rev-aux">
|
|
<td></td>
|
|
<td rowspan="142">(2)</td>
|
|
<td></td>
|
|
</tr>
|
|
<tr class="t-dcl t-since-cxx98">
|
|
<td class="t-dcl-nopad">
|
|
<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="sy1">></span><br /></span>
|
|
<p>set<span class="br0">(</span> InputIt first, InputIt last,<br />
|
|
<span class="kw4">const</span> Compare<span class="sy3">&</span> comp <span class="sy1">=</span> Compare<span class="br0">(</span><span class="br0">)</span>,<br /></p>
|
|
<span class="kw4">const</span> Allocator<span class="sy3">&</span> alloc <span class="sy1">=</span> Allocator<span class="br0">(</span><span class="br0">)</span> <span class="br0">)</span><span class="sy4">;</span></div>
|
|
</td>
|
|
<td class="t-dcl-nopad"></td>
|
|
<td class="t-dcl-nopad"></td>
|
|
</tr>
|
|
<tr class="t-dcl t-since-cxx14">
|
|
<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="sy1">></span><br /></span>
|
|
<p>set<span class="br0">(</span> InputIt first, InputIt last, <span class="kw4">const</span> Allocator<span class="sy3">&</span> alloc<span class="br0">)</span><br /></p>
|
|
<span class="sy4">:</span> set<span class="br0">(</span>first, last, Compare<span class="br0">(</span><span class="br0">)</span>, alloc<span class="br0">)</span> <span class="br0">{</span><span class="br0">}</span></div>
|
|
</td>
|
|
<td class="t-dcl-nopad"></td>
|
|
<td><span class="t-mark-rev t-since-cxx14">(C++14 起)</span></td>
|
|
</tr>
|
|
</tbody>
|
|
<tbody>
|
|
<tr class="t-dcl t-since-cxx98">
|
|
<td>
|
|
<div><span class="mw-geshi cpp source-cpp">set<span class="br0">(</span> <span class="kw4">const</span> set<span class="sy3">&</span> other <span class="br0">)</span><span class="sy4">;</span></span></div>
|
|
</td>
|
|
<td>(3)</td>
|
|
<td class="t-dcl-nopad"></td>
|
|
</tr>
|
|
<tr class="t-dcl t-since-cxx11">
|
|
<td>
|
|
<div><span class="mw-geshi cpp source-cpp">set<span class="br0">(</span> <span class="kw4">const</span> set<span class="sy3">&</span> other, <span class="kw4">const</span> Allocator<span class="sy3">&</span> alloc <span class="br0">)</span><span class="sy4">;</span></span></div>
|
|
</td>
|
|
<td>(3)</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">set<span class="br0">(</span> set<span class="sy3">&&</span> other <span class="br0">)</span><span class="sy4">;</span></span></div>
|
|
</td>
|
|
<td>(4)</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">set<span class="br0">(</span> set<span class="sy3">&&</span> other, <span class="kw4">const</span> Allocator<span class="sy3">&</span> alloc <span class="br0">)</span><span class="sy4">;</span></span></div>
|
|
</td>
|
|
<td>(4)</td>
|
|
<td><span class="t-mark-rev t-since-cxx11">(C++11 起)</span></td>
|
|
</tr>
|
|
</tbody>
|
|
<tbody class="t-dcl-rev t-dcl-rev-num">
|
|
<tr class="t-dcl-rev-aux">
|
|
<td></td>
|
|
<td rowspan="142">(5)</td>
|
|
<td></td>
|
|
</tr>
|
|
<tr class="t-dcl t-since-cxx11">
|
|
<td>
|
|
<div><span class="mw-geshi cpp source-cpp">set<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>value_type<span class="sy1">></span> init,<br /></span>
|
|
<p> <span class="kw4">const</span> Compare<span class="sy3">&</span> comp <span class="sy1">=</span> Compare<span class="br0">(</span><span class="br0">)</span>,<br /></p>
|
|
<span class="kw4">const</span> Allocator<span class="sy3">&</span> alloc <span class="sy1">=</span> Allocator<span class="br0">(</span><span class="br0">)</span> <span class="br0">)</span><span class="sy4">;</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-cxx14">
|
|
<td>
|
|
<div><span class="mw-geshi cpp source-cpp">set<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>value_type<span class="sy1">></span> init, <span class="kw4">const</span> Allocator<span class="sy3">&</span> alloc <span class="br0">)</span><br />
|
|
<span class="sy4">:</span> set<span class="br0">(</span>init, Compare<span class="br0">(</span><span class="br0">)</span>, alloc<span class="br0">)</span> <span class="br0">{</span><span class="br0">}</span></span></div>
|
|
</td>
|
|
<td class="t-dcl-nopad"></td>
|
|
<td><span class="t-mark-rev t-since-cxx14">(C++14 起)</span></td>
|
|
</tr>
|
|
</tbody>
|
|
<tbody>
|
|
<tr class="t-dcl-sep">
|
|
<td></td>
|
|
<td></td>
|
|
<td></td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
<p>从各种数据源，可选地用用户提供的分配器 <code>alloc</code> 或比较函数对象 <code>comp</code> 构造新容器。</p>
|
|
<div class="t-li1"><span class="t-li">1)</span> <a href="cpp-language-default_constructor.html">默认构造函数</a>。构造新容器。</div>
|
|
<div class="t-li1"><span class="t-li">2)</span> 范围构造函数。构造拥有范围 <code>[first, last)</code> 内容的容器。若范围中的多个元素拥有比较等价的关键，则插入哪个元素是未指定的（待决的 <a rel="nofollow" class="external text" href="https://cplusplus.github.io/LWG/issue2844">LWG2844</a> ）。</div>
|
|
<div class="t-li1"><span class="t-li">3)</span> <a href="cpp-language-copy_constructor.html">复制构造函数</a>。以 <code>other</code> 内容的副本构造容器。
|
|
<table class="t-rev-begin">
|
|
<tr class="t-rev t-since-cxx11">
|
|
<td>
|
|
<p>若不提供 <code>alloc</code> ，则通过调用<br />
|
|
<span class="t-c"><span class="mw-geshi cpp source-cpp"><a href="cpp-memory-allocator_traits.html"><span class="kw701">std::<span class="me2">allocator_traits</span></span></a><span class="sy1"><</span>allocator_type<span class="sy1">></span><span class="sy4">::</span><span class="me2">select_on_container_copy_construction</span><span class="br0">(</span><br />
|
|
other.<span class="me1">get_allocator</span><span class="br0">(</span><span class="br0">)</span><span class="br0">)</span></span></span><br />
|
|
获得分配器。</p>
|
|
</td>
|
|
<td><span class="t-mark-rev t-since-cxx11">(C++11 起)</span></td>
|
|
</tr>
|
|
<tr class="t-rev t-since-cxx23">
|
|
<td>
|
|
<p>在用于<a href="cpp-language-class_template_argument_deduction.html">类模板实参推导</a>时，仅从首个实参推导模板形参 <code>Allocator</code> 。</p>
|
|
</td>
|
|
<td><span class="t-mark-rev t-since-cxx23">(C++23 起)</span></td>
|
|
</tr>
|
|
</table>
|
|
</div>
|
|
<div class="t-li1"><span class="t-li">4)</span> <a href="cpp-language-move_constructor.html">移动构造函数</a>。用移动语义构造拥有 <code>other</code> 内容的容器。若不提供 <code>alloc</code> ，则以从属于 <code>other</code> 的分配器移动构造获得分配器。
|
|
<table class="t-rev-begin">
|
|
<tr class="t-rev t-since-cxx23">
|
|
<td>
|
|
<p>在用于<a href="cpp-language-class_template_argument_deduction.html">类模板实参推导</a>时，仅从首个实参推导模板形参 <code>Allocator</code> 。</p>
|
|
</td>
|
|
<td><span class="t-mark-rev t-since-cxx23">(C++23 起)</span></td>
|
|
</tr>
|
|
</table>
|
|
</div>
|
|
<div class="t-li1"><span class="t-li">5)</span> <a href="cpp-language-list_initialization.html">initializer_list 构造函数</a>。构造拥有 initializer_list <code>init</code> 内容的容器。若范围中的多个元素拥有比较等价的关键，则插入哪个元素是未指定的（待决的 <a rel="nofollow" class="external text" href="https://cplusplus.github.io/LWG/issue2844">LWG2844</a> ）。</div>
|
|
<h3><span class="mw-headline" id=".E5.8F.82.E6.95.B0">参数</span></h3>
|
|
<table class="t-par-begin">
|
|
<tr class="t-par">
|
|
<td>alloc</td>
|
|
<td>-</td>
|
|
<td>用于此容器所有内存分配的分配器</td>
|
|
</tr>
|
|
<tr class="t-par">
|
|
<td>comp</td>
|
|
<td>-</td>
|
|
<td>用于所有关键比较的比较函数对象</td>
|
|
</tr>
|
|
<tr class="t-par">
|
|
<td>first, last</td>
|
|
<td>-</td>
|
|
<td>复制元素的来源范围</td>
|
|
</tr>
|
|
<tr class="t-par">
|
|
<td>other</td>
|
|
<td>-</td>
|
|
<td>将用作初始化容器元素所用源的另一容器</td>
|
|
</tr>
|
|
<tr class="t-par">
|
|
<td>init</td>
|
|
<td>-</td>
|
|
<td>初始化容器元素所用的 initializer_list</td>
|
|
</tr>
|
|
<tr class="t-par-hitem">
|
|
<td colspan="3">类型要求</td>
|
|
</tr>
|
|
<tr class="t-par-req">
|
|
<td colspan="3">-
|
|
<div class="spacer"></div>
|
|
<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> 的要求。</td>
|
|
</tr>
|
|
<tr class="t-par-req">
|
|
<td colspan="3">-
|
|
<div class="spacer"></div>
|
|
<code>Compare</code> 必须满足<a href="cpp-named_req-Compare.html"><span style="font-style:italic">比较</span> <span style="font-family: Georgia, 'DejaVu Serif', serif; font-style:italic">(Compare)</span></a> 的要求。</td>
|
|
</tr>
|
|
<tr class="t-par-req">
|
|
<td colspan="3">-
|
|
<div class="spacer"></div>
|
|
<code>Allocator</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> 的要求。</td>
|
|
</tr>
|
|
</table>
|
|
<h3><span class="mw-headline" id=".E5.A4.8D.E6.9D.82.E5.BA.A6">复杂度</span></h3>
|
|
<div class="t-li1"><span class="t-li">1)</span> 常数</div>
|
|
<div class="t-li1"><span class="t-li">2)</span> 通常为 <span class="texhtml" style="white-space: nowrap;">N log(N)</span> ，若范围已按照 <code>value_comp()</code> 排序则与 <code>N</code> 成线性，其中 <span class="t-c"><span class="mw-geshi cpp source-cpp">N <span class="sy1">=</span> <a href="cpp-iterator-distance.html"><span class="kw673">std::<span class="me2">distance</span></span></a><span class="br0">(</span>first, last<span class="br0">)</span></span></span> 。</div>
|
|
<div class="t-li1"><span class="t-li">3)</span> 与 <code>other</code> 的大小成线性。</div>
|
|
<div class="t-li1"><span class="t-li">4)</span> 常数。若给定 <code>alloc</code> 而 <span class="t-c"><span class="mw-geshi cpp source-cpp">alloc <span class="sy3">!</span><span class="sy1">=</span> other.<span class="me1">get_allocator</span><span class="br0">(</span><span class="br0">)</span></span></span> ，则为线性。</div>
|
|
<div class="t-li1"><span class="t-li">5)</span> <span class="texhtml" style="white-space: nowrap;">N log(N)</span> ，其中通常有 <span class="t-c"><span class="mw-geshi cpp source-cpp">N <span class="sy1">=</span> init.<span class="me1">size</span><span class="br0">(</span><span class="br0">)</span></span></span> 。若 <code>init</code> 已按照 <code>value_comp()</code> 排序则与 <code>N</code> 成线性。</div>
|
|
<h3><span class="mw-headline" id=".E5.BC.82.E5.B8.B8">异常</span></h3>
|
|
<p>调用 <code>Allocator::allocate</code> 可能抛出。</p>
|
|
<h3><span class="mw-headline" id=".E6.B3.A8.E8.A7.A3">注解</span></h3>
|
|
<p>在容器移动构造（重载 <span class="t-v">(4)</span> ）后，指向 <code>other</code> 的引用及迭代器（除了尾迭代器）保持合法，但指代现于 <span class="t-c"><span class="mw-geshi cpp source-cpp"><span class="sy2">*</span>this</span></span> 中的元素。当前标准由 <a rel="nofollow" class="external text" href="https://eel.is/c++draft/container.requirements.general#12">[container.requirements.general]/12</a> 中的总括陈述作出此保证，而 <a rel="nofollow" class="external text" href="https://cplusplus.github.io/LWG/issue2321">LWG 2321</a> 正在考虑更严格的保证。</p>
|
|
<p>尽管在 C++23 前未正式要求，一些实现已经在较早的模式中将 <code>Allocator</code> 放入<a href="cpp-language-template_argument_deduction.html#.E9.9D.9E.E6.8E.A8.E5.AF.BC.E8.AF.AD.E5.A2.83">非推导语境</a>。</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 <iostream></span>
|
|
<span class="co2">#include <string></span>
|
|
<span class="co2">#include <set></span>
|
|
<span class="co2">#include <cmath></span>
|
|
|
|
<span class="kw1">struct</span> Point <span class="br0">{</span> <span class="kw4">double</span> x, y<span class="sy4">;</span> <span class="br0">}</span><span class="sy4">;</span>
|
|
<span class="kw1">struct</span> PointCmp <span class="br0">{</span>
|
|
<span class="kw4">bool</span> operator<span class="br0">(</span><span class="br0">)</span><span class="br0">(</span><span class="kw4">const</span> Point<span class="sy3">&</span> lhs, <span class="kw4">const</span> Point<span class="sy3">&</span> rhs<span class="br0">)</span> <span class="kw4">const</span> <span class="br0">{</span>
|
|
<span class="kw1">return</span> <a href="cpp-numeric-math-hypot.html"><span class="kw1331">std::<span class="me2">hypot</span></span></a><span class="br0">(</span>lhs.<span class="me1">x</span>, lhs.<span class="me1">y</span><span class="br0">)</span> <span class="sy1"><</span> <a href="cpp-numeric-math-hypot.html"><span class="kw1331">std::<span class="me2">hypot</span></span></a><span class="br0">(</span>rhs.<span class="me1">x</span>, rhs.<span class="me1">y</span><span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="br0">}</span>
|
|
<span class="br0">}</span><span class="sy4">;</span>
|
|
|
|
<span class="kw4">int</span> main<span class="br0">(</span><span class="br0">)</span>
|
|
<span class="br0">{</span>
|
|
<span class="co1">// (1) 默认初始化器</span>
|
|
<a href="cpp-container-set.html"><span class="kw1277">std::<span class="me2">set</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><span class="sy1">></span> a<span class="sy4">;</span>
|
|
a.<span class="me1">insert</span><span class="br0">(</span><span class="st0">"cat"</span><span class="br0">)</span><span class="sy4">;</span>
|
|
a.<span class="me1">insert</span><span class="br0">(</span><span class="st0">"dog"</span><span class="br0">)</span><span class="sy4">;</span>
|
|
a.<span class="me1">insert</span><span class="br0">(</span><span class="st0">"horse"</span><span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="kw1">for</span><span class="br0">(</span><span class="kw4">auto</span><span class="sy3">&</span> str<span class="sy4">:</span> a<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> str <span class="sy1"><<</span> <span class="st0">' '</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="co1">// (2) 迭代器初始化器</span>
|
|
<a href="cpp-container-set.html"><span class="kw1277">std::<span class="me2">set</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><span class="sy1">></span> b<span class="br0">(</span>a.<span class="me1">find</span><span class="br0">(</span><span class="st0">"dog"</span><span class="br0">)</span>, a.<span class="me1">end</span><span class="br0">(</span><span class="br0">)</span><span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="kw1">for</span><span class="br0">(</span><span class="kw4">auto</span><span class="sy3">&</span> str<span class="sy4">:</span> b<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> str <span class="sy1"><<</span> <span class="st0">' '</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="co1">// (3) 复制构造函数</span>
|
|
<a href="cpp-container-set.html"><span class="kw1277">std::<span class="me2">set</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><span class="sy1">></span> c<span class="br0">(</span>a<span class="br0">)</span><span class="sy4">;</span>
|
|
c.<span class="me1">insert</span><span class="br0">(</span><span class="st0">"another horse"</span><span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="kw1">for</span><span class="br0">(</span><span class="kw4">auto</span><span class="sy3">&</span> str<span class="sy4">:</span> c<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> str <span class="sy1"><<</span> <span class="st0">' '</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="co1">// (4) 移动构造函数</span>
|
|
<a href="cpp-container-set.html"><span class="kw1277">std::<span class="me2">set</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><span class="sy1">></span> d<span class="br0">(</span>std<span class="sy4">::</span><span class="me2">move</span><span class="br0">(</span>a<span class="br0">)</span><span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="kw1">for</span><span class="br0">(</span><span class="kw4">auto</span><span class="sy3">&</span> str<span class="sy4">:</span> d<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> str <span class="sy1"><<</span> <span class="st0">' '</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>
|
|
<a href="cpp-io-cout.html"><span class="kw1758">std::<span class="me2">cout</span></span></a> <span class="sy1"><<</span> <span class="st0">"moved-from set is "</span><span class="sy4">;</span>
|
|
<span class="kw1">for</span><span class="br0">(</span><span class="kw4">auto</span><span class="sy3">&</span> str<span class="sy4">:</span> a<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> str <span class="sy1"><<</span> <span class="st0">' '</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="co1">// (5) initializer_list 构造函数</span>
|
|
<a href="cpp-container-set.html"><span class="kw1277">std::<span class="me2">set</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><span class="sy1">></span> e <span class="br0">{</span><span class="st0">"one"</span>, <span class="st0">"two"</span>, <span class="st0">"three"</span>, <span class="st0">"five"</span>, <span class="st0">"eight"</span><span class="br0">}</span><span class="sy4">;</span>
|
|
<span class="kw1">for</span><span class="br0">(</span><span class="kw4">auto</span><span class="sy3">&</span> str<span class="sy4">:</span> e<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> str <span class="sy1"><<</span> <span class="st0">' '</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="co1">// 自定义比较</span>
|
|
<a href="cpp-container-set.html"><span class="kw1277">std::<span class="me2">set</span></span></a><span class="sy1"><</span>Point, PointCmp<span class="sy1">></span> z <span class="sy1">=</span> <span class="br0">{</span><span class="br0">{</span><span class="nu0">2</span>, <span class="nu0">5</span><span class="br0">}</span>, <span class="br0">{</span><span class="nu0">3</span>, <span class="nu0">4</span><span class="br0">}</span>, <span class="br0">{</span><span class="nu0">1</span>, <span class="nu0">1</span><span class="br0">}</span><span class="br0">}</span><span class="sy4">;</span>
|
|
z.<span class="me1">insert</span><span class="br0">(</span><span class="br0">{</span><span class="nu0">1</span>, <span class="sy2">-</span><span class="nu0">1</span><span class="br0">}</span><span class="br0">)</span><span class="sy4">;</span> <span class="co1">// 这会失败，因为 1,-1 的长度等于 1,1</span>
|
|
<span class="kw1">for</span><span class="br0">(</span><span class="kw4">auto</span><span class="sy3">&</span> p<span class="sy4">:</span> z<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> <span class="st0">'('</span> <span class="sy1"><<</span> p.<span class="me1">x</span> <span class="sy1"><<</span> <span class="st0">','</span> <span class="sy1"><<</span> p.<span class="me1">y</span> <span class="sy1"><<</span> <span class="st0">") "</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">cat dog horse
|
|
dog horse
|
|
another horse cat dog horse
|
|
cat dog horse
|
|
moved-from set is
|
|
eight five one three two
|
|
(1,1) (3,4) (2,5)</pre></div>
|
|
</div>
|
|
</div>
|
|
<h3><span class="mw-headline" id=".E7.BC.BA.E9.99.B7.E6.8A.A5.E5.91.8A">缺陷报告</span></h3>
|
|
<p>下列更改行为的缺陷报告追溯地应用于以前出版的 C++ 标准。</p>
|
|
<table class="dsctable" style="font-size:0.8em">
|
|
<tr>
|
|
<th>DR</th>
|
|
<th>应用于</th>
|
|
<th>出版时的行为</th>
|
|
<th>正确行为</th>
|
|
</tr>
|
|
<tr>
|
|
<td><a rel="nofollow" class="external text" href="https://cplusplus.github.io/LWG/issue2193">LWG 2193</a></td>
|
|
<td>C++11</td>
|
|
<td>默认构造函数为 explicit</td>
|
|
<td>使之为非 explicit</td>
|
|
</tr>
|
|
</table>
|
|
<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-set-operator=.html"><span class="t-lines"><span>operator=</span></span></a></div>
|
|
</div>
|
|
</td>
|
|
<td>赋值给容器<br />
|
|
<span class="t-mark">(公开成员函数)</span></td>
|
|
</tr>
|
|
</table>
|
|
</div>
|
|
<div class="visualClear"></div>
|
|
</div>
|
|
</div>
|
|
</div>
|
|
</body>
|
|
</html>
|