369 lines
37 KiB
HTML
369 lines
37 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::merge</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_algorithm_merge 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%">std::</span>merge</h1>
|
|
<div id="bodyContent">
|
|
<div id="contentSub"><span class="subpages">< <a href="cpp.html">cpp</a>‎ | <a href="cpp-algorithm.html">algorithm</a></span></div>
|
|
<div id="mw-content-text" lang="zh" dir="ltr" class="mw-content-ltr" xml:lang="zh">
|
|
<table class="t-dcl-begin">
|
|
<tbody>
|
|
<tr class="t-dsc-header">
|
|
<td>
|
|
<div>定义于头文件 <code><a href="cpp-header-algorithm.html"><algorithm></a></code></div>
|
|
</td>
|
|
<td></td>
|
|
<td></td>
|
|
</tr>
|
|
</tbody>
|
|
<tbody class="t-dcl-rev t-dcl-rev-num">
|
|
<tr class="t-dcl-rev-aux">
|
|
<td></td>
|
|
<td rowspan="142">(1)</td>
|
|
<td></td>
|
|
</tr>
|
|
<tr class="t-dcl t-until-cxx20">
|
|
<td>
|
|
<div><span class="mw-geshi cpp source-cpp"><span class="kw1">template</span><span class="sy1"><</span> <span class="kw1">class</span> InputIt1, <span class="kw1">class</span> InputIt2, <span class="kw1">class</span> OutputIt <span class="sy1">></span><br /></span>
|
|
<p>OutputIt merge<span class="br0">(</span> InputIt1 first1, InputIt1 last1,<br />
|
|
InputIt2 first2, InputIt2 last2,<br /></p>
|
|
OutputIt d_first <span class="br0">)</span><span class="sy4">;</span></div>
|
|
</td>
|
|
<td class="t-dcl-nopad"></td>
|
|
<td><span class="t-mark-rev t-until-cxx20">(C++20 前)</span></td>
|
|
</tr>
|
|
<tr class="t-dcl t-since-cxx20">
|
|
<td>
|
|
<div><span class="mw-geshi cpp source-cpp"><span class="kw1">template</span><span class="sy1"><</span> <span class="kw1">class</span> InputIt1, <span class="kw1">class</span> InputIt2, <span class="kw1">class</span> OutputIt <span class="sy1">></span><br /></span>
|
|
<p><span class="kw4">constexpr</span> OutputIt merge<span class="br0">(</span> InputIt1 first1, InputIt1 last1,<br />
|
|
InputIt2 first2, InputIt2 last2,<br /></p>
|
|
OutputIt d_first <span class="br0">)</span><span class="sy4">;</span></div>
|
|
</td>
|
|
<td class="t-dcl-nopad"></td>
|
|
<td><span class="t-mark-rev t-since-cxx20">(C++20 起)</span></td>
|
|
</tr>
|
|
</tbody>
|
|
<tbody>
|
|
<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> ExecutionPolicy, <span class="kw1">class</span> ForwardIt1, <span class="kw1">class</span> ForwardIt2,<br /></span>
|
|
<p> <span class="kw1">class</span> ForwardIt3 <span class="sy1">></span><br />
|
|
ForwardIt3 merge<span class="br0">(</span> ExecutionPolicy<span class="sy3">&&</span> policy,<br />
|
|
ForwardIt1 first1, ForwardIt1 last1,<br />
|
|
ForwardIt2 first2, ForwardIt2 last2,<br /></p>
|
|
ForwardIt3 d_first <span class="br0">)</span><span class="sy4">;</span></div>
|
|
</td>
|
|
<td>(2)</td>
|
|
<td><span class="t-mark-rev t-since-cxx17">(C++17 起)</span></td>
|
|
</tr>
|
|
</tbody>
|
|
<tbody class="t-dcl-rev t-dcl-rev-num">
|
|
<tr class="t-dcl-rev-aux">
|
|
<td></td>
|
|
<td rowspan="142">(3)</td>
|
|
<td></td>
|
|
</tr>
|
|
<tr class="t-dcl t-until-cxx20">
|
|
<td>
|
|
<div><span class="mw-geshi cpp source-cpp"><span class="kw1">template</span><span class="sy1"><</span> <span class="kw1">class</span> InputIt1, <span class="kw1">class</span> InputIt2, <span class="kw1">class</span> OutputIt, <span class="kw1">class</span> Compare <span class="sy1">></span><br /></span>
|
|
<p>OutputIt merge<span class="br0">(</span> InputIt1 first1, InputIt1 last1,<br />
|
|
InputIt2 first2, InputIt2 last2,<br /></p>
|
|
OutputIt d_first, Compare comp <span class="br0">)</span><span class="sy4">;</span></div>
|
|
</td>
|
|
<td class="t-dcl-nopad"></td>
|
|
<td><span class="t-mark-rev t-until-cxx20">(C++20 前)</span></td>
|
|
</tr>
|
|
<tr class="t-dcl t-since-cxx20">
|
|
<td>
|
|
<div><span class="mw-geshi cpp source-cpp"><span class="kw1">template</span><span class="sy1"><</span> <span class="kw1">class</span> InputIt1, <span class="kw1">class</span> InputIt2, <span class="kw1">class</span> OutputIt, <span class="kw1">class</span> Compare <span class="sy1">></span><br /></span>
|
|
<p><span class="kw4">constexpr</span> OutputIt merge<span class="br0">(</span> InputIt1 first1, InputIt1 last1,<br />
|
|
InputIt2 first2, InputIt2 last2,<br /></p>
|
|
OutputIt d_first, Compare comp <span class="br0">)</span><span class="sy4">;</span></div>
|
|
</td>
|
|
<td class="t-dcl-nopad"></td>
|
|
<td><span class="t-mark-rev t-since-cxx20">(C++20 起)</span></td>
|
|
</tr>
|
|
</tbody>
|
|
<tbody>
|
|
<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> ExecutionPolicy, <span class="kw1">class</span> ForwardIt1, <span class="kw1">class</span> ForwardIt2,<br /></span>
|
|
<p> <span class="kw1">class</span> ForwardIt3, <span class="kw1">class</span> Compare<span class="sy1">></span><br />
|
|
ForwardIt3 merge<span class="br0">(</span> ExecutionPolicy<span class="sy3">&&</span> policy,<br />
|
|
ForwardIt1 first1, ForwardIt1 last1,<br />
|
|
ForwardIt2 first2, ForwardIt2 last2,<br /></p>
|
|
ForwardIt3 d_first, Compare comp <span class="br0">)</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-sep">
|
|
<td></td>
|
|
<td></td>
|
|
<td></td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
<p>归并二个<i>已排序</i>范围 <code>[first1, last1)</code> 和 <code>[first2, last2)</code> 到始于 <code>d_first</code> 的一个<i>已排序</i>范围中。</p>
|
|
<p>若对于任何指向序列的迭代器 <code>it</code> 与任何使得 <code>it + n</code> 为指向序列元素的合法迭代器的非负整数 <code>n</code> ， <span class="t-c"><span class="mw-geshi cpp source-cpp">comp<span class="br0">(</span><span class="sy2">*</span><span class="br0">(</span>it <span class="sy2">+</span> n<span class="br0">)</span>, <span class="sy2">*</span>it<span class="br0">)</span></span></span> 求值为 <code>false</code> ，则称序列相对于 <code>comp</code> <i>已排序</i>。</p>
|
|
<div class="t-li1"><span class="t-li">1)</span> 用 <code>operator<</code> 比较元素。</div>
|
|
<div class="t-li1"><span class="t-li">3)</span> 用给定的二元比较函数 <code>comp</code> 比较元素。</div>
|
|
<div class="t-li1"><span class="t-li">2,4)</span> 同 <span class="t-v">(1,3)</span> ，但按照 <code>policy</code> 执行。这些重载仅若 <span class="t-rev-inl t-until-cxx20"><span><span class="t-c"><span class="mw-geshi cpp source-cpp"><a href="cpp-algorithm-is_execution_policy.html"><span class="kw1564">std::<span class="me2">is_execution_policy_v</span></span></a><span class="sy1"><</span><a href="cpp-types-decay.html"><span class="kw629">std::<span class="me2">decay_t</span></span></a><span class="sy1"><</span>ExecutionPolicy<span class="sy1">>></span></span></span></span> <span><span class="t-mark-rev t-until-cxx20">(C++20 前)</span></span></span><span class="t-rev-inl t-since-cxx20"><span><span class="t-c"><span class="mw-geshi cpp source-cpp"><a href="cpp-algorithm-is_execution_policy.html"><span class="kw1564">std::<span class="me2">is_execution_policy_v</span></span></a><span class="sy1"><</span>std<span class="sy4">::</span><span class="me2">remove_cvref_t</span><span class="sy1"><</span>ExecutionPolicy<span class="sy1">>></span></span></span></span> <span><span class="t-mark-rev t-since-cxx20">(C++20 起)</span></span></span> 为 true 才参与重载决议。</div>
|
|
<p>此归并是<i>稳定</i>的，意思是对于原范围中的等价元素，来自第一范围的元素（保持其原顺序）先于来自第二范围的元素（保持其原顺序）。</p>
|
|
<p>若目标范围与输入范围之一重叠，则行为未定义（输入范围可相互重叠）。</p>
|
|
<h3><span class="mw-headline" id=".E5.8F.82.E6.95.B0">参数</span></h3>
|
|
<table class="t-par-begin">
|
|
<tr class="t-par">
|
|
<td>first1, last1</td>
|
|
<td>-</td>
|
|
<td>要归并的元素的第一范围</td>
|
|
</tr>
|
|
<tr class="t-par">
|
|
<td>first2, last2</td>
|
|
<td>-</td>
|
|
<td>要归并到元素的第二范围</td>
|
|
</tr>
|
|
<tr class="t-par">
|
|
<td>d_first</td>
|
|
<td>-</td>
|
|
<td>目标范围的起始</td>
|
|
</tr>
|
|
<tr class="t-par">
|
|
<td>policy</td>
|
|
<td>-</td>
|
|
<td>所用的执行策略。细节见<a href="cpp-algorithm-execution_policy_tag_t.html">执行策略</a>。</td>
|
|
</tr>
|
|
<tr class="t-par">
|
|
<td>comp</td>
|
|
<td>-</td>
|
|
<td>比较函数对象（即满足<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> 概念的对象），若第一参数<i>小于</i>（即<i>先</i>序于）第二参数则返回 ​<span class="t-c"><span class="mw-geshi cpp source-cpp"><span class="kw2">true</span></span></span> 。<br />
|
|
<p>比较函数的签名应等价于如下：</p>
|
|
<p><span class="t-cc"><span class="mw-geshi cpp source-cpp"> <span class="kw4">bool</span> cmp<span class="br0">(</span><span class="kw4">const</span> Type1 <span class="sy3">&</span>a, <span class="kw4">const</span> Type2 <span class="sy3">&</span>b<span class="br0">)</span><span class="sy4">;</span></span></span></p>
|
|
<p>虽然签名不必有 <span class="t-c"><span class="mw-geshi cpp source-cpp"><span class="kw4">const</span> <span class="sy3">&</span></span></span> ，函数也不能修改传递给它的对象，而且必须接受（可为 const 的）类型 <code>Type1</code> 与 <code>Type2</code> 的值，无关乎<a href="cpp-language-value_category.html">值类别</a>（从而不允许 <span class="t-c"><span class="mw-geshi cpp source-cpp">Type1 <span class="sy3">&</span></span></span> <span class="t-rev-inl t-since-cxx11"><span>，亦不允许 <span class="t-c"><span class="mw-geshi cpp source-cpp">Type1</span></span> ，除非 <code>Type1</code> 的移动等价于复制</span> <span><span class="t-mark-rev t-since-cxx11">(C++11 起)</span></span></span>）。<br />
|
|
类型 <span class="t-c"><span class="mw-geshi cpp source-cpp">Type1</span></span> 与 <span class="t-c"><span class="mw-geshi cpp source-cpp">Type2</span></span> 必须使得 <span class="t-c"><span class="mw-geshi cpp source-cpp">InputIt1</span></span> 与 <span class="t-c"><span class="mw-geshi cpp source-cpp">InputIt2</span></span> 类型的对象在解引用后能隐式转换到 <span class="t-c"><span class="mw-geshi cpp source-cpp">Type1</span></span> 与 <span class="t-c"><span class="mw-geshi cpp source-cpp">Type2</span></span> 两者。 ​</p>
|
|
</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>InputIt1, InputIt2</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>ForwardIt1, ForwardIt2, ForwardIt3</code> 必须满足<a href="cpp-named_req-ForwardIterator.html"><span style="font-style:italic">老式向前迭代器</span> <span style="font-family: Georgia, 'DejaVu Serif', serif; font-style:italic">(LegacyForwardIterator)</span></a> 的要求。</td>
|
|
</tr>
|
|
<tr class="t-par-req">
|
|
<td colspan="3">-
|
|
<div class="spacer"></div>
|
|
<code>OutputIt</code> 必须满足<a href="cpp-named_req-OutputIterator.html"><span style="font-style:italic">老式输出迭代器</span> <span style="font-family: Georgia, 'DejaVu Serif', serif; font-style:italic">(LegacyOutputIterator)</span></a> 的要求。</td>
|
|
</tr>
|
|
</table>
|
|
<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>
|
|
<div class="t-li1"><span class="t-li">1,3)</span> 至多 <span class="t-c"><span class="mw-geshi cpp source-cpp"><a href="cpp-iterator-distance.html"><span class="kw673">std::<span class="me2">distance</span></span></a><span class="br0">(</span>first1, last1<span class="br0">)</span> <span class="sy2">+</span> <a href="cpp-iterator-distance.html"><span class="kw673">std::<span class="me2">distance</span></span></a><span class="br0">(</span>first2, last2<span class="br0">)</span> <span class="sy2">-</span> <span class="nu0">1</span></span></span> 次比较。</div>
|
|
<div class="t-li1"><span class="t-li">2,4)</span> <span class="t-c"><span class="mw-geshi cpp source-cpp">O<span class="br0">(</span><a href="cpp-iterator-distance.html"><span class="kw673">std::<span class="me2">distance</span></span></a><span class="br0">(</span>first1, last1<span class="br0">)</span> <span class="sy2">+</span> <a href="cpp-iterator-distance.html"><span class="kw673">std::<span class="me2">distance</span></span></a><span class="br0">(</span>first2, last2<span class="br0">)</span><span class="br0">)</span></span></span> 。</div>
|
|
<h3><span class="mw-headline" id=".E5.BC.82.E5.B8.B8">异常</span></h3>
|
|
<p>拥有名为 <code>ExecutionPolicy</code> 的模板形参的重载按下列方式报告错误：</p>
|
|
<ul>
|
|
<li>若作为算法一部分调用的函数的执行抛出异常，且 <code>ExecutionPolicy</code> 为<a href="cpp-algorithm-execution_policy_tag_t.html">标准策略</a>之一，则调用 <span class="t-lc"><a href="cpp-error-terminate.html">std::terminate</a></span> 。对于任何其他 <code>ExecutionPolicy</code> ，行为是实现定义的。</li>
|
|
<li>若算法无法分配内存，则抛出 <span class="t-lc"><a href="cpp-memory-new-bad_alloc.html">std::bad_alloc</a></span> 。</li>
|
|
</ul>
|
|
<h3><span class="mw-headline" id=".E6.B3.A8.E8.A7.A3">注解</span></h3>
|
|
<p>此算法进行类似 <span class="t-c"><span class="mw-geshi cpp source-cpp"><a href="cpp-algorithm-set_union.html"><span class="kw1632">std::<span class="me2">set_union</span></span></a></span></span> 所做的任务。都消耗二个已排序输入范围，并产生拥有来自两个输入的元素的输出。此二算法的区别在于处理来自二个输入的比较等价（见<a href="cpp-named_req-LessThanComparable.html"><span style="font-style:italic">可小于比较</span> <span style="font-family: Georgia, 'DejaVu Serif', serif; font-style:italic">(LessThanComparable)</span></a> 上的注解）的值。若任何等价的值在第一范围出现 <code>n</code> 次，在第二范围出现 <code>m</code> 次，则 <code>std::merge</code> 会输出所有 <span class="t-c"><span class="mw-geshi cpp source-cpp">n<span class="sy2">+</span>m</span></span> 次出现，而 <code>std::set_union</code> 将只输出 <span class="t-c"><span class="mw-geshi cpp source-cpp"><a href="cpp-algorithm-max.html"><span class="kw1639">std::<span class="me2">max</span></span></a><span class="br0">(</span>n, m<span class="br0">)</span></span></span> 次。故 <code>std::merge</code> 准确输出 <span class="t-c"><span class="mw-geshi cpp source-cpp"><a href="cpp-iterator-distance.html"><span class="kw673">std::<span class="me2">distance</span></span></a><span class="br0">(</span>first1, last1<span class="br0">)</span> <span class="sy2">+</span> <a href="cpp-iterator-distance.html"><span class="kw673">std::<span class="me2">distance</span></span></a><span class="br0">(</span>first2, last2<span class="br0">)</span></span></span> 个值，而 <code>std::set_union</code> 可能产生得更少。</p>
|
|
<h3><span class="mw-headline" id=".E5.8F.AF.E8.83.BD.E7.9A.84.E5.AE.9E.E7.8E.B0">可能的实现</span></h3>
|
|
<p>参阅 <a rel="nofollow" class="external text" href="https://github.com/gcc-mirror/gcc/blob/d9375e490072d1aae73a93949aa158fcd2a27018/libstdc%2B%2B-v3/include/bits/stl_algo.h#L4856">libstdc++</a> 与 <a rel="nofollow" class="external text" href="https://github.com/llvm-mirror/libcxx/blob/a12cb9d211019d99b5875b6d8034617cbc24c2cc/include/algorithm#L4348">libc++</a> 中的实现。</p>
|
|
<table class="eq-fun-cpp-table">
|
|
<tr>
|
|
<th>版本一</th>
|
|
</tr>
|
|
<tr>
|
|
<td>
|
|
<div dir="ltr" class="mw-geshi" style="text-align: left;">
|
|
<div class="cpp source-cpp">
|
|
<pre class="de1"><span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> InputIt1, <span class="kw1">class</span> InputIt2, <span class="kw1">class</span> OutputIt<span class="sy1">></span>
|
|
OutputIt merge<span class="br0">(</span>InputIt1 first1, InputIt1 last1,
|
|
InputIt2 first2, InputIt2 last2,
|
|
OutputIt d_first<span class="br0">)</span>
|
|
<span class="br0">{</span>
|
|
<span class="kw1">for</span> <span class="br0">(</span><span class="sy4">;</span> first1 <span class="sy3">!</span><span class="sy1">=</span> last1<span class="sy4">;</span> <span class="sy2">++</span>d_first<span class="br0">)</span> <span class="br0">{</span>
|
|
<span class="kw1">if</span> <span class="br0">(</span>first2 <span class="sy1">==</span> last2<span class="br0">)</span> <span class="br0">{</span>
|
|
<span class="kw1">return</span> <a href="cpp-algorithm-copy.html"><span class="kw1582">std::<span class="me2">copy</span></span></a><span class="br0">(</span>first1, last1, d_first<span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="br0">}</span>
|
|
<span class="kw1">if</span> <span class="br0">(</span><span class="sy2">*</span>first2 <span class="sy1"><</span> <span class="sy2">*</span>first1<span class="br0">)</span> <span class="br0">{</span>
|
|
<span class="sy2">*</span>d_first <span class="sy1">=</span> <span class="sy2">*</span>first2<span class="sy4">;</span>
|
|
<span class="sy2">++</span>first2<span class="sy4">;</span>
|
|
<span class="br0">}</span> <span class="kw1">else</span> <span class="br0">{</span>
|
|
<span class="sy2">*</span>d_first <span class="sy1">=</span> <span class="sy2">*</span>first1<span class="sy4">;</span>
|
|
<span class="sy2">++</span>first1<span class="sy4">;</span>
|
|
<span class="br0">}</span>
|
|
<span class="br0">}</span>
|
|
<span class="kw1">return</span> <a href="cpp-algorithm-copy.html"><span class="kw1582">std::<span class="me2">copy</span></span></a><span class="br0">(</span>first2, last2, d_first<span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="br0">}</span></pre></div>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
<tr>
|
|
<th>版本二</th>
|
|
</tr>
|
|
<tr>
|
|
<td>
|
|
<div dir="ltr" class="mw-geshi" style="text-align: left;">
|
|
<div class="cpp source-cpp">
|
|
<pre class="de1"><span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> InputIt1, <span class="kw1">class</span> InputIt2,
|
|
<span class="kw1">class</span> OutputIt, <span class="kw1">class</span> Compare<span class="sy1">></span>
|
|
OutputIt merge<span class="br0">(</span>InputIt1 first1, InputIt1 last1,
|
|
InputIt2 first2, InputIt2 last2,
|
|
OutputIt d_first, Compare comp<span class="br0">)</span>
|
|
<span class="br0">{</span>
|
|
<span class="kw1">for</span> <span class="br0">(</span><span class="sy4">;</span> first1 <span class="sy3">!</span><span class="sy1">=</span> last1<span class="sy4">;</span> <span class="sy2">++</span>d_first<span class="br0">)</span> <span class="br0">{</span>
|
|
<span class="kw1">if</span> <span class="br0">(</span>first2 <span class="sy1">==</span> last2<span class="br0">)</span> <span class="br0">{</span>
|
|
<span class="kw1">return</span> <a href="cpp-algorithm-copy.html"><span class="kw1582">std::<span class="me2">copy</span></span></a><span class="br0">(</span>first1, last1, d_first<span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="br0">}</span>
|
|
<span class="kw1">if</span> <span class="br0">(</span>comp<span class="br0">(</span><span class="sy2">*</span>first2, <span class="sy2">*</span>first1<span class="br0">)</span><span class="br0">)</span> <span class="br0">{</span>
|
|
<span class="sy2">*</span>d_first <span class="sy1">=</span> <span class="sy2">*</span>first2<span class="sy4">;</span>
|
|
<span class="sy2">++</span>first2<span class="sy4">;</span>
|
|
<span class="br0">}</span> <span class="kw1">else</span> <span class="br0">{</span>
|
|
<span class="sy2">*</span>d_first <span class="sy1">=</span> <span class="sy2">*</span>first1<span class="sy4">;</span>
|
|
<span class="sy2">++</span>first1<span class="sy4">;</span>
|
|
<span class="br0">}</span>
|
|
<span class="br0">}</span>
|
|
<span class="kw1">return</span> <a href="cpp-algorithm-copy.html"><span class="kw1582">std::<span class="me2">copy</span></span></a><span class="br0">(</span>first2, last2, d_first<span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="br0">}</span></pre></div>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</table>
|
|
<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 <iterator></span>
|
|
<span class="co2">#include <algorithm></span>
|
|
<span class="co2">#include <vector></span>
|
|
<span class="co2">#include <random></span>
|
|
<span class="co2">#include <functional></span>
|
|
|
|
<span class="kw4">int</span> main<span class="br0">(</span><span class="br0">)</span>
|
|
<span class="br0">{</span>
|
|
<span class="co1">// 以随机数填充 vector</span>
|
|
<a href="cpp-numeric-random-random_device.html"><span class="kw1486">std::<span class="me2">random_device</span></span></a> rd<span class="sy4">;</span>
|
|
<a href="cpp-numeric-random-mersenne_twister_engine.html"><span class="kw1489">std::<span class="me2">mt19937</span></span></a> mt<span class="br0">(</span>rd<span class="br0">(</span><span class="br0">)</span><span class="br0">)</span><span class="sy4">;</span>
|
|
<a href="cpp-numeric-random-uniform_int_distribution.html"><span class="kw1502">std::<span class="me2">uniform_int_distribution</span></span></a><span class="sy1"><></span> dis<span class="br0">(</span><span class="nu0">0</span>, <span class="nu0">9</span><span class="br0">)</span><span class="sy4">;</span>
|
|
|
|
<a href="cpp-container-vector.html"><span class="kw1269">std::<span class="me2">vector</span></span></a><span class="sy1"><</span><span class="kw4">int</span><span class="sy1">></span> v1<span class="br0">(</span><span class="nu0">10</span><span class="br0">)</span>, v2<span class="br0">(</span><span class="nu0">10</span><span class="br0">)</span><span class="sy4">;</span>
|
|
<a href="cpp-algorithm-generate.html"><span class="kw1590">std::<span class="me2">generate</span></span></a><span class="br0">(</span>v1.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span>, v1.<span class="me1">end</span><span class="br0">(</span><span class="br0">)</span>, <a href="cpp-utility-functional-bind.html"><span class="kw1052">std::<span class="me2">bind</span></span></a><span class="br0">(</span>dis, <a href="cpp-utility-functional-ref.html"><span class="kw1069">std::<span class="me2">ref</span></span></a><span class="br0">(</span>mt<span class="br0">)</span><span class="br0">)</span><span class="br0">)</span><span class="sy4">;</span>
|
|
<a href="cpp-algorithm-generate.html"><span class="kw1590">std::<span class="me2">generate</span></span></a><span class="br0">(</span>v2.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span>, v2.<span class="me1">end</span><span class="br0">(</span><span class="br0">)</span>, <a href="cpp-utility-functional-bind.html"><span class="kw1052">std::<span class="me2">bind</span></span></a><span class="br0">(</span>dis, <a href="cpp-utility-functional-ref.html"><span class="kw1069">std::<span class="me2">ref</span></span></a><span class="br0">(</span>mt<span class="br0">)</span><span class="br0">)</span><span class="br0">)</span><span class="sy4">;</span>
|
|
|
|
<span class="co1">// 排序</span>
|
|
<a href="cpp-algorithm-sort.html"><span class="kw1618">std::<span class="me2">sort</span></span></a><span class="br0">(</span>v1.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span>, v1.<span class="me1">end</span><span class="br0">(</span><span class="br0">)</span><span class="br0">)</span><span class="sy4">;</span>
|
|
<a href="cpp-algorithm-sort.html"><span class="kw1618">std::<span class="me2">sort</span></span></a><span class="br0">(</span>v2.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span>, v2.<span class="me1">end</span><span class="br0">(</span><span class="br0">)</span><span class="br0">)</span><span class="sy4">;</span>
|
|
|
|
<span class="co1">// 输出 v1</span>
|
|
<a href="cpp-io-cout.html"><span class="kw1757">std::<span class="me2">cout</span></span></a> <span class="sy1"><<</span> <span class="st0">"v1 : "</span><span class="sy4">;</span>
|
|
<a href="cpp-algorithm-copy.html"><span class="kw1582">std::<span class="me2">copy</span></span></a><span class="br0">(</span>v1.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span>, v1.<span class="me1">end</span><span class="br0">(</span><span class="br0">)</span>, <a href="cpp-iterator-ostream_iterator.html"><span class="kw670">std::<span class="me2">ostream_iterator</span></span></a><span class="sy1"><</span><span class="kw4">int</span><span class="sy1">></span><span class="br0">(</span><a href="cpp-io-cout.html"><span class="kw1757">std::<span class="me2">cout</span></span></a>, <span class="st0">" "</span><span class="br0">)</span><span class="br0">)</span><span class="sy4">;</span>
|
|
<a href="cpp-io-cout.html"><span class="kw1757">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">// 输出 v2</span>
|
|
<a href="cpp-io-cout.html"><span class="kw1757">std::<span class="me2">cout</span></span></a> <span class="sy1"><<</span> <span class="st0">"v2 : "</span><span class="sy4">;</span>
|
|
<a href="cpp-algorithm-copy.html"><span class="kw1582">std::<span class="me2">copy</span></span></a><span class="br0">(</span>v2.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span>, v2.<span class="me1">end</span><span class="br0">(</span><span class="br0">)</span>, <a href="cpp-iterator-ostream_iterator.html"><span class="kw670">std::<span class="me2">ostream_iterator</span></span></a><span class="sy1"><</span><span class="kw4">int</span><span class="sy1">></span><span class="br0">(</span><a href="cpp-io-cout.html"><span class="kw1757">std::<span class="me2">cout</span></span></a>, <span class="st0">" "</span><span class="br0">)</span><span class="br0">)</span><span class="sy4">;</span>
|
|
<a href="cpp-io-cout.html"><span class="kw1757">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-vector.html"><span class="kw1269">std::<span class="me2">vector</span></span></a><span class="sy1"><</span><span class="kw4">int</span><span class="sy1">></span> dst<span class="sy4">;</span>
|
|
std<span class="sy4">::</span><span class="me2">merge</span><span class="br0">(</span>v1.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span>, v1.<span class="me1">end</span><span class="br0">(</span><span class="br0">)</span>, v2.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span>, v2.<span class="me1">end</span><span class="br0">(</span><span class="br0">)</span>, <a href="cpp-iterator-back_inserter.html"><span class="kw665">std::<span class="me2">back_inserter</span></span></a><span class="br0">(</span>dst<span class="br0">)</span><span class="br0">)</span><span class="sy4">;</span>
|
|
|
|
<span class="co1">// 输出</span>
|
|
<a href="cpp-io-cout.html"><span class="kw1757">std::<span class="me2">cout</span></span></a> <span class="sy1"><<</span> <span class="st0">"dst: "</span><span class="sy4">;</span>
|
|
<a href="cpp-algorithm-copy.html"><span class="kw1582">std::<span class="me2">copy</span></span></a><span class="br0">(</span>dst.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span>, dst.<span class="me1">end</span><span class="br0">(</span><span class="br0">)</span>, <a href="cpp-iterator-ostream_iterator.html"><span class="kw670">std::<span class="me2">ostream_iterator</span></span></a><span class="sy1"><</span><span class="kw4">int</span><span class="sy1">></span><span class="br0">(</span><a href="cpp-io-cout.html"><span class="kw1757">std::<span class="me2">cout</span></span></a>, <span class="st0">" "</span><span class="br0">)</span><span class="br0">)</span><span class="sy4">;</span>
|
|
<a href="cpp-io-cout.html"><span class="kw1757">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">v1 : 0 1 3 4 4 5 5 8 8 9
|
|
v2 : 0 2 2 3 6 6 8 8 8 9
|
|
dst: 0 0 1 2 2 3 3 4 4 5 5 6 6 8 8 8 8 8 9 9</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-algorithm-inplace_merge.html"><span class="t-lines"><span>inplace_merge</span></span></a></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-algorithm-is_sorted.html"><span class="t-lines"><span>is_sorted</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-algorithm-set_union.html"><span class="t-lines"><span>set_union</span></span></a></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-algorithm-sort.html"><span class="t-lines"><span>sort</span></span></a></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-algorithm-stable_sort.html"><span class="t-lines"><span>stable_sort</span></span></a></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-algorithm-ranges-merge.html"><span class="t-lines"><span>ranges::merge</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">(niebloid)</span></td>
|
|
</tr>
|
|
</table>
|
|
</div>
|
|
<div class="visualClear"></div>
|
|
</div>
|
|
</div>
|
|
</div>
|
|
</body>
|
|
</html>
|