304 lines
35 KiB
HTML
304 lines
35 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::ranges::is_permutation</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_ranges_is_permutation 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::ranges::</span>is_permutation</h1>
|
|
<div id="bodyContent">
|
|
<div id="contentSub"><span class="subpages">< <a href="cpp.html">cpp</a>‎ | <a href="cpp-algorithm.html">algorithm</a>‎ | <a href="cpp-algorithm-ranges.html">ranges</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>
|
|
<tr class="t-dcl-sep">
|
|
<td></td>
|
|
<td></td>
|
|
<td></td>
|
|
</tr>
|
|
<tr class="t-dcl-h">
|
|
<td>
|
|
<div>调用签名</div>
|
|
</td>
|
|
<td></td>
|
|
<td></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>std<span class="sy4">::</span><span class="me2">forward_iterator</span> I1, std<span class="sy4">::</span><span class="me2">sentinel_for</span><span class="sy1"><</span>I1<span class="sy1">></span> S1,<br /></span>
|
|
<p> std<span class="sy4">::</span><span class="me2">forward_iterator</span> I2, std<span class="sy4">::</span><span class="me2">sentinel_for</span><span class="sy1"><</span>I2<span class="sy1">></span> S2,<br />
|
|
<span class="kw1">class</span> Proj1 <span class="sy1">=</span> std<span class="sy4">::</span><span class="me2">identity</span>, <span class="kw1">class</span> Proj2 <span class="sy1">=</span> std<span class="sy4">::</span><span class="me2">identity</span>,<br />
|
|
std<span class="sy4">::</span><span class="me2">indirect_equivalence_relation</span><span class="sy1"><</span>std<span class="sy4">::</span><span class="me2">projected</span><span class="sy1"><</span>I1, Proj1<span class="sy1">></span>,<br />
|
|
std<span class="sy4">::</span><span class="me2">projected</span><span class="sy1"><</span>I2, Proj2<span class="sy1">>></span><br />
|
|
Pred <span class="sy1">=</span> ranges<span class="sy4">::</span><span class="me2">equal_to</span><span class="sy1">></span><br />
|
|
<span class="kw4">constexpr</span> <span class="kw4">bool</span> is_permutation<span class="br0">(</span>I1 first1, S1 last1, I2 first2, S2 last2,<br /></p>
|
|
Pred pred <span class="sy1">=</span> <span class="br0">{</span><span class="br0">}</span>, Proj1 proj1 <span class="sy1">=</span> <span class="br0">{</span><span class="br0">}</span>, Proj2 proj2 <span class="sy1">=</span> <span class="br0">{</span><span class="br0">}</span><span class="br0">)</span><span class="sy4">;</span></div>
|
|
</td>
|
|
<td>(1)</td>
|
|
<td><span class="t-mark-rev t-since-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>ranges<span class="sy4">::</span><span class="me2">forward_range</span> R1, ranges<span class="sy4">::</span><span class="me2">forward_range</span> R2,<br /></span>
|
|
<p> <span class="kw1">class</span> Proj1 <span class="sy1">=</span> std<span class="sy4">::</span><span class="me2">identity</span>, <span class="kw1">class</span> Proj2 <span class="sy1">=</span> std<span class="sy4">::</span><span class="me2">identity</span>,<br />
|
|
std<span class="sy4">::</span><span class="me2">indirect_equivalence_relation</span><span class="sy1"><</span>std<span class="sy4">::</span><span class="me2">projected</span><span class="sy1"><</span>ranges<span class="sy4">::</span><span class="me2">iterator_t</span><span class="sy1"><</span>R1<span class="sy1">></span>, Proj1<span class="sy1">></span>,<br />
|
|
std<span class="sy4">::</span><span class="me2">projected</span><span class="sy1"><</span>ranges<span class="sy4">::</span><span class="me2">iterator_t</span><span class="sy1"><</span>R2<span class="sy1">></span>, Proj2<span class="sy1">>></span><br />
|
|
Pred <span class="sy1">=</span> ranges<span class="sy4">::</span><span class="me2">equal_to</span><span class="sy1">></span><br />
|
|
<span class="kw4">constexpr</span> <span class="kw4">bool</span> is_permutation<span class="br0">(</span>R1<span class="sy3">&&</span> r1, R2<span class="sy3">&&</span> r2, Pred pred <span class="sy1">=</span> <span class="br0">{</span><span class="br0">}</span>,<br /></p>
|
|
Proj1 proj1 <span class="sy1">=</span> <span class="br0">{</span><span class="br0">}</span>, Proj2 proj2 <span class="sy1">=</span> <span class="br0">{</span><span class="br0">}</span><span class="br0">)</span><span class="sy4">;</span></div>
|
|
</td>
|
|
<td>(2)</td>
|
|
<td><span class="t-mark-rev t-since-cxx20">(C++20 起)</span></td>
|
|
</tr>
|
|
<tr class="t-dcl-sep">
|
|
<td></td>
|
|
<td></td>
|
|
<td></td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
<div class="t-li1"><span class="t-li">1)</span> 若存在范围 <code>[first1, last1)</code> 中的元素的排列使得该范围<i>等于</i> <code>[first2, last2)</code> (在应用对应的投影 <code>Proj1</code> 和 <code>Proj2</code> 后,并以 <code>Pred</code> 为比较器)则返回 <span class="t-c"><span class="mw-geshi cpp source-cpp"><span class="kw2">true</span></span></span> 。否则返回 <span class="t-c"><span class="mw-geshi cpp source-cpp"><span class="kw2">false</span></span></span> 。</div>
|
|
<div class="t-li1"><span class="t-li">2)</span> 同 <span class="t-v">(1)</span> ,但以 <code>r1</code> 为第一源范围并以 <code>r2</code> 为第二源范围,如同以 <span class="t-c"><span class="mw-geshi cpp source-cpp">ranges<span class="sy4">::</span><span class="me2">begin</span><span class="br0">(</span>r1<span class="br0">)</span></span></span> 为 <code>first1</code> ,以 <span class="t-c"><span class="mw-geshi cpp source-cpp">ranges<span class="sy4">::</span><span class="me2">end</span><span class="br0">(</span>r1<span class="br0">)</span></span></span> 为 <code>last1</code> ,以 <span class="t-c"><span class="mw-geshi cpp source-cpp">ranges<span class="sy4">::</span><span class="me2">begin</span><span class="br0">(</span>r2<span class="br0">)</span></span></span> 为 <code>first2</code> ,并以 <span class="t-c"><span class="mw-geshi cpp source-cpp">ranges<span class="sy4">::</span><span class="me2">end</span><span class="br0">(</span>r2<span class="br0">)</span></span></span> 为 <code>last2</code> 。</div>
|
|
<p>此页面上描述的仿函数实体是 <i>niebloid</i> ,即:</p>
|
|
<ul>
|
|
<li>调用它们中的任何一者时不可指定显式模板实参。</li>
|
|
<li>它们无一对<a href="cpp-language-adl.html">实参依赖查找</a>可见。</li>
|
|
<li>在<a href="cpp-language-unqualified_lookup.html">通常无限定查找</a>寻找函数调用运算符左侧的名称找到它们之一时,它禁止<a href="cpp-language-adl.html">实参依赖查找</a>。</li>
|
|
</ul>
|
|
<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>r1</td>
|
|
<td>-</td>
|
|
<td>第一元素范围</td>
|
|
</tr>
|
|
<tr class="t-par">
|
|
<td>r2</td>
|
|
<td>-</td>
|
|
<td>第二元素范围</td>
|
|
</tr>
|
|
<tr class="t-par">
|
|
<td>pred</td>
|
|
<td>-</td>
|
|
<td>应用到投影后元素的谓词</td>
|
|
</tr>
|
|
<tr class="t-par">
|
|
<td>proj1</td>
|
|
<td>-</td>
|
|
<td>应用到第一范围中元素的投影</td>
|
|
</tr>
|
|
<tr class="t-par">
|
|
<td>proj2</td>
|
|
<td>-</td>
|
|
<td>应用到第一范围中元素的投影</td>
|
|
</tr>
|
|
</table>
|
|
<h3><span class="mw-headline" id=".E8.BF.94.E5.9B.9E.E5.80.BC">返回值</span></h3>
|
|
<p>若范围 <code>[first1, last1)</code> 为 <code>[first2, last2)</code> 的重排列则为 <span class="t-c"><span class="mw-geshi cpp source-cpp"><span class="kw2">true</span></span></span> 。</p>
|
|
<h3><span class="mw-headline" id=".E5.A4.8D.E6.9D.82.E5.BA.A6">复杂度</span></h3>
|
|
<p>至多应用 <span class="mjax" style="display:none">\(\scriptsize \mathcal{O}(N^2)\)</span><span class="mjax-fallback texhtml" style="white-space: nowrap;">O(N<sup>2</sup>)</span> 次谓词和每个投影,或若序列已经相等则准确应用 <span class="mjax" style="display:none">\(\scriptsize N\)</span><span class="mjax-fallback texhtml" style="white-space: nowrap;">N</span> 次,其中 <span class="mjax" style="display:none">\(\scriptsize N\)</span><span class="mjax-fallback texhtml" style="white-space: nowrap;">N</span> 为 <span class="t-c"><span class="mw-geshi cpp source-cpp">ranges<span class="sy4">::</span><span class="me2">distance</span><span class="br0">(</span>first1, last1<span class="br0">)</span></span></span> 。 然而若 <span class="t-c"><span class="mw-geshi cpp source-cpp">ranges<span class="sy4">::</span><span class="me2">distance</span><span class="br0">(</span>first1, last1<span class="br0">)</span> <span class="sy3">!</span><span class="sy1">=</span> ranges<span class="sy4">::</span><span class="me2">distance</span><span class="br0">(</span>first2, last2<span class="br0">)</span></span></span> ,则不应用谓词和投影。</p>
|
|
<h3><span class="mw-headline" id=".E6.B3.A8.E8.A7.A3">注解</span></h3>
|
|
<p><i>排列</i>关系是<a href="https://en.wikipedia.org/wiki/equivalence_relation" class="extiw" title="enwiki:equivalence relation">等价关系</a>。</p>
|
|
<p><strong class="selflink"><tt>ranges::is_permutation</tt></strong> 能用于按照其名称地<i>测试</i>重排算法(例如排序、打乱、划分)的正确性。若 <code>x</code> 为原范围而 <code>y</code> 是<i>重排后</i>范围则 <span class="t-c"><span class="mw-geshi cpp source-cpp"><a href="cpp-algorithm-is_permutation.html"><span class="kw1648">std::<span class="me2">is_permutation</span></span></a><span class="br0">(</span>x, y<span class="br0">)</span> <span class="sy1">==</span> <span class="kw2">true</span></span></span> 表示 <code>y</code> 由可能位于其他位置的<i>“相同”</i>元素组成。</p>
|
|
<h3><span class="mw-headline" id=".E5.8F.AF.E8.83.BD.E7.9A.84.E5.AE.9E.E7.8E.B0">可能的实现</span></h3>
|
|
<table class="eq-fun-cpp-table">
|
|
<tr>
|
|
<td>
|
|
<div dir="ltr" class="mw-geshi" style="text-align: left;">
|
|
<div class="cpp source-cpp">
|
|
<pre class="de1"><span class="kw1">struct</span> is_permutation_fn
|
|
<span class="br0">{</span>
|
|
<span class="kw1">template</span><span class="sy1"><</span>std<span class="sy4">::</span><span class="me2">forward_iterator</span> I1, std<span class="sy4">::</span><span class="me2">sentinel_for</span><span class="sy1"><</span>I1<span class="sy1">></span> S1,
|
|
std<span class="sy4">::</span><span class="me2">forward_iterator</span> I2, std<span class="sy4">::</span><span class="me2">sentinel_for</span><span class="sy1"><</span>I2<span class="sy1">></span> S2,
|
|
<span class="kw1">class</span> Proj1 <span class="sy1">=</span> std<span class="sy4">::</span><span class="me2">identity</span>, <span class="kw1">class</span> Proj2 <span class="sy1">=</span> std<span class="sy4">::</span><span class="me2">identity</span>,
|
|
std<span class="sy4">::</span><span class="me2">indirect_equivalence_relation</span><span class="sy1"><</span>std<span class="sy4">::</span><span class="me2">projected</span><span class="sy1"><</span>I1, Proj1<span class="sy1">></span>,
|
|
std<span class="sy4">::</span><span class="me2">projected</span><span class="sy1"><</span>I2, Proj2<span class="sy1">>></span>
|
|
Pred <span class="sy1">=</span> ranges<span class="sy4">::</span><span class="me2">equal_to</span><span class="sy1">></span>
|
|
<span class="kw4">constexpr</span> <span class="kw4">bool</span> operator<span class="br0">(</span><span class="br0">)</span><span class="br0">(</span>I1 first1, S1 last1, I2 first2, S2 last2,
|
|
Pred pred <span class="sy1">=</span> <span class="br0">{</span><span class="br0">}</span>, Proj1 proj1 <span class="sy1">=</span> <span class="br0">{</span><span class="br0">}</span>, Proj2 proj2 <span class="sy1">=</span> <span class="br0">{</span><span class="br0">}</span><span class="br0">)</span> <span class="kw4">const</span> <span class="br0">{</span>
|
|
<span class="co1">// 跳过公共前缀</span>
|
|
<span class="kw4">auto</span> ret <span class="sy1">=</span> std<span class="sy4">::</span><span class="me2">ranges</span><span class="sy4">::</span><span class="me2">mismatch</span><span class="br0">(</span>first1, last1, first2, last2,
|
|
<a href="cpp-utility-functional-ref.html"><span class="kw1069">std::<span class="me2">ref</span></span></a><span class="br0">(</span>pred<span class="br0">)</span>, <a href="cpp-utility-functional-ref.html"><span class="kw1069">std::<span class="me2">ref</span></span></a><span class="br0">(</span>proj1<span class="br0">)</span>, <a href="cpp-utility-functional-ref.html"><span class="kw1069">std::<span class="me2">ref</span></span></a><span class="br0">(</span>proj2<span class="br0">)</span><span class="br0">)</span><span class="sy4">;</span>
|
|
first1 <span class="sy1">=</span> ret.<span class="me1">in1</span>, first2 <span class="sy1">=</span> ret.<span class="me1">in2</span><span class="sy4">;</span>
|
|
|
|
<span class="co1">// 在剩余部分迭代,统计每个来自 [first1, last1) 中的元素在 [first2, last2) 中出现多少次</span>
|
|
<span class="kw1">for</span> <span class="br0">(</span><span class="kw4">auto</span> i<span class="br0">{</span> first1 <span class="br0">}</span><span class="sy4">;</span> i <span class="sy3">!</span><span class="sy1">=</span> last1<span class="sy4">;</span> <span class="sy2">++</span>i<span class="br0">)</span> <span class="br0">{</span>
|
|
<span class="kw4">const</span> <span class="kw4">auto</span> i_proj<span class="br0">{</span> <a href="cpp-utility-functional-invoke.html"><span class="kw1058">std::<span class="me2">invoke</span></span></a><span class="br0">(</span>proj1, <span class="sy2">*</span>i<span class="br0">)</span> <span class="br0">}</span><span class="sy4">;</span>
|
|
<span class="kw4">auto</span> i_cmp <span class="sy1">=</span> <span class="br0">[</span><span class="sy3">&</span><span class="br0">]</span><span class="sy1"><</span><span class="kw1">typename</span> T<span class="sy1">></span><span class="br0">(</span>T<span class="sy3">&&</span> t<span class="br0">)</span> <span class="br0">{</span>
|
|
<span class="kw1">return</span> <a href="cpp-utility-functional-invoke.html"><span class="kw1058">std::<span class="me2">invoke</span></span></a><span class="br0">(</span>pred, i_proj, <a href="cpp-utility-forward.html"><span class="kw1117">std::<span class="me2">forward</span></span></a><span class="sy1"><</span>T<span class="sy1">></span><span class="br0">(</span>t<span class="br0">)</span><span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="br0">}</span><span class="sy4">;</span>
|
|
|
|
<span class="kw1">if</span> <span class="br0">(</span>i <span class="sy3">!</span><span class="sy1">=</span> ranges<span class="sy4">::</span><span class="me2">find_if</span><span class="br0">(</span>first1, i, i_cmp, proj1<span class="br0">)</span><span class="br0">)</span>
|
|
<span class="kw1">continue</span><span class="sy4">;</span> <span class="co1">// 已检查过此 *i</span>
|
|
|
|
<span class="kw1">if</span> <span class="br0">(</span><span class="kw4">const</span> <span class="kw4">auto</span> m<span class="br0">{</span> ranges<span class="sy4">::</span><span class="me2">count_if</span><span class="br0">(</span>first2, last2, i_cmp, proj2<span class="br0">)</span> <span class="br0">}</span><span class="sy4">;</span>
|
|
m <span class="sy1">==</span> <span class="nu0">0</span> or m <span class="sy3">!</span><span class="sy1">=</span> ranges<span class="sy4">::</span><span class="me2">count_if</span><span class="br0">(</span>i, last1, i_cmp, proj1<span class="br0">)</span><span class="br0">)</span>
|
|
<span class="kw1">return</span> <span class="kw2">false</span><span class="sy4">;</span>
|
|
<span class="br0">}</span>
|
|
<span class="kw1">return</span> <span class="kw2">true</span><span class="sy4">;</span>
|
|
<span class="br0">}</span>
|
|
|
|
<span class="kw1">template</span><span class="sy1"><</span>ranges<span class="sy4">::</span><span class="me2">forward_range</span> R1, ranges<span class="sy4">::</span><span class="me2">forward_range</span> R2,
|
|
<span class="kw1">class</span> Proj1 <span class="sy1">=</span> std<span class="sy4">::</span><span class="me2">identity</span>, <span class="kw1">class</span> Proj2 <span class="sy1">=</span> std<span class="sy4">::</span><span class="me2">identity</span>,
|
|
std<span class="sy4">::</span><span class="me2">indirect_equivalence_relation</span><span class="sy1"><</span>std<span class="sy4">::</span><span class="me2">projected</span><span class="sy1"><</span>ranges<span class="sy4">::</span><span class="me2">iterator_t</span><span class="sy1"><</span>R1<span class="sy1">></span>, Proj1<span class="sy1">></span>,
|
|
std<span class="sy4">::</span><span class="me2">projected</span><span class="sy1"><</span>ranges<span class="sy4">::</span><span class="me2">iterator_t</span><span class="sy1"><</span>R2<span class="sy1">></span>, Proj2<span class="sy1">>></span>
|
|
Pred <span class="sy1">=</span> ranges<span class="sy4">::</span><span class="me2">equal_to</span><span class="sy1">></span>
|
|
<span class="kw4">constexpr</span> <span class="kw4">bool</span> operator<span class="br0">(</span><span class="br0">)</span><span class="br0">(</span>R1<span class="sy3">&&</span> r1, R2<span class="sy3">&&</span> r2, Pred pred <span class="sy1">=</span> <span class="br0">{</span><span class="br0">}</span>,
|
|
Proj1 proj1 <span class="sy1">=</span> <span class="br0">{</span><span class="br0">}</span>, Proj2 proj2 <span class="sy1">=</span> <span class="br0">{</span><span class="br0">}</span><span class="br0">)</span> <span class="kw4">const</span> <span class="br0">{</span>
|
|
<span class="kw1">return</span> <span class="br0">(</span><span class="sy2">*</span>this<span class="br0">)</span><span class="br0">(</span>ranges<span class="sy4">::</span><span class="me2">begin</span><span class="br0">(</span>r1<span class="br0">)</span>, ranges<span class="sy4">::</span><span class="me2">end</span><span class="br0">(</span>r1<span class="br0">)</span>,
|
|
ranges<span class="sy4">::</span><span class="me2">begin</span><span class="br0">(</span>r2<span class="br0">)</span>, ranges<span class="sy4">::</span><span class="me2">end</span><span class="br0">(</span>r2<span class="br0">)</span>,
|
|
std<span class="sy4">::</span><span class="me2">move</span><span class="br0">(</span>pred<span class="br0">)</span>, std<span class="sy4">::</span><span class="me2">move</span><span class="br0">(</span>proj1<span class="br0">)</span>, std<span class="sy4">::</span><span class="me2">move</span><span class="br0">(</span>proj2<span class="br0">)</span><span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="br0">}</span>
|
|
<span class="br0">}</span><span class="sy4">;</span>
|
|
|
|
<span class="kw1">inline</span> <span class="kw4">constexpr</span> is_permutation_fn is_permutation<span class="br0">{</span><span class="br0">}</span><span class="sy4">;</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 <algorithm></span>
|
|
<span class="co2">#include <array></span>
|
|
<span class="co2">#include <cmath></span>
|
|
<span class="co2">#include <iostream></span>
|
|
<span class="co2">#include <ranges></span>
|
|
|
|
<span class="kw4">auto</span><span class="sy3">&</span> operator<span class="sy1"><<</span> <span class="br0">(</span><span class="kw4">auto</span><span class="sy3">&</span> os, std<span class="sy4">::</span><span class="me2">ranges</span><span class="sy4">::</span><span class="me2">forward_range</span> <span class="kw4">auto</span> <span class="kw4">const</span><span class="sy3">&</span> v<span class="br0">)</span> <span class="br0">{</span>
|
|
os <span class="sy1"><<</span> <span class="st0">"{ "</span><span class="sy4">;</span>
|
|
<span class="kw1">for</span> <span class="br0">(</span><span class="kw4">auto</span> <span class="kw4">const</span><span class="sy3">&</span> e <span class="sy4">:</span> v<span class="br0">)</span> os <span class="sy1"><<</span> e <span class="sy1"><<</span> <span class="st0">' '</span><span class="sy4">;</span>
|
|
<span class="kw1">return</span> os <span class="sy1"><<</span> <span class="st0">"}"</span><span class="sy4">;</span>
|
|
<span class="br0">}</span>
|
|
|
|
<span class="kw4">int</span> main<span class="br0">(</span><span class="br0">)</span>
|
|
<span class="br0">{</span>
|
|
<span class="kw4">static</span> <span class="kw4">constexpr</span> <span class="kw4">auto</span> r1 <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="nu0">5</span><span class="br0">}</span><span class="sy4">;</span>
|
|
<span class="kw4">static</span> <span class="kw4">constexpr</span> <span class="kw4">auto</span> r2 <span class="sy1">=</span> <span class="br0">{</span><span class="nu0">3</span>,<span class="nu0">5</span>,<span class="nu0">4</span>,<span class="nu0">1</span>,<span class="nu0">2</span><span class="br0">}</span><span class="sy4">;</span>
|
|
<span class="kw4">static</span> <span class="kw4">constexpr</span> <span class="kw4">auto</span> r3 <span class="sy1">=</span> <span class="br0">{</span><span class="nu0">3</span>,<span class="nu0">5</span>,<span class="nu0">4</span>,<span class="nu0">1</span>,<span class="nu0">1</span><span class="br0">}</span><span class="sy4">;</span>
|
|
|
|
static_assert<span class="br0">(</span>
|
|
std<span class="sy4">::</span><span class="me2">ranges</span><span class="sy4">::</span><span class="me2">is_permutation</span><span class="br0">(</span>r1, r1<span class="br0">)</span> <span class="sy3">&&</span>
|
|
std<span class="sy4">::</span><span class="me2">ranges</span><span class="sy4">::</span><span class="me2">is_permutation</span><span class="br0">(</span>r1, r2<span class="br0">)</span> <span class="sy3">&&</span>
|
|
std<span class="sy4">::</span><span class="me2">ranges</span><span class="sy4">::</span><span class="me2">is_permutation</span><span class="br0">(</span>r2, r1<span class="br0">)</span> <span class="sy3">&&</span>
|
|
std<span class="sy4">::</span><span class="me2">ranges</span><span class="sy4">::</span><span class="me2">is_permutation</span><span class="br0">(</span>r1.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span>, r1.<span class="me1">end</span><span class="br0">(</span><span class="br0">)</span>, r2.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span>, r2.<span class="me1">end</span><span class="br0">(</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> <a href="cpp-io-manip-boolalpha.html"><span class="kw1764">std::<span class="me2">boolalpha</span></span></a>
|
|
<span class="sy1"><<</span> <span class="st0">"is_permutation( "</span> <span class="sy1"><<</span> r1 <span class="sy1"><<</span> <span class="st0">", "</span> <span class="sy1"><<</span> r2 <span class="sy1"><<</span> <span class="st0">" ): "</span>
|
|
<span class="sy1"><<</span> std<span class="sy4">::</span><span class="me2">ranges</span><span class="sy4">::</span><span class="me2">is_permutation</span><span class="br0">(</span>r1, r2<span class="br0">)</span> <span class="sy1"><<</span> <span class="st0">'<span class="es1">\n</span>'</span>
|
|
<span class="sy1"><<</span> <span class="st0">"is_permutation( "</span> <span class="sy1"><<</span> r1 <span class="sy1"><<</span> <span class="st0">", "</span> <span class="sy1"><<</span> r3 <span class="sy1"><<</span> <span class="st0">" ): "</span>
|
|
<span class="sy1"><<</span> std<span class="sy4">::</span><span class="me2">ranges</span><span class="sy4">::</span><span class="me2">is_permutation</span><span class="br0">(</span>r1, r3<span class="br0">)</span> <span class="sy1"><<</span> <span class="st0">'<span class="es1">\n</span>'</span>
|
|
|
|
<span class="sy1"><<</span> <span class="st0">"is_permutation with custom predicate and projections: "</span>
|
|
<span class="sy1"><<</span> std<span class="sy4">::</span><span class="me2">ranges</span><span class="sy4">::</span><span class="me2">is_permutation</span><span class="br0">(</span>
|
|
<a href="cpp-container-array.html"><span class="kw1268">std::<span class="me2">array</span></span></a><span class="br0">{</span> <span class="sy2">-</span><span class="nu0">14</span>, <span class="sy2">-</span><span class="nu0">11</span>, <span class="sy2">-</span><span class="nu0">13</span>, <span class="sy2">-</span><span class="nu0">15</span>, <span class="sy2">-</span><span class="nu0">12</span> <span class="br0">}</span>, <span class="co1">// 第一范围</span>
|
|
<a href="cpp-container-array.html"><span class="kw1268">std::<span class="me2">array</span></span></a><span class="br0">{</span> <span class="st0">'F'</span>, <span class="st0">'E'</span>, <span class="st0">'C'</span>, <span class="st0">'B'</span>, <span class="st0">'D'</span> <span class="br0">}</span>, <span class="co1">// 第二范围</span>
|
|
<span class="br0">[</span><span class="br0">]</span><span class="br0">(</span><span class="kw4">int</span> x, <span class="kw4">int</span> y<span class="br0">)</span> <span class="br0">{</span> <span class="kw1">return</span> abs<span class="br0">(</span>x<span class="br0">)</span> <span class="sy1">==</span> abs<span class="br0">(</span>y<span class="br0">)</span><span class="sy4">;</span> <span class="br0">}</span>, <span class="co1">// 谓词</span>
|
|
<span class="br0">[</span><span class="br0">]</span><span class="br0">(</span><span class="kw4">int</span> x<span class="br0">)</span> <span class="br0">{</span> <span class="kw1">return</span> x <span class="sy2">+</span> <span class="nu0">10</span><span class="sy4">;</span> <span class="br0">}</span>, <span class="co1">// 第一范围的投影</span>
|
|
<span class="br0">[</span><span class="br0">]</span><span class="br0">(</span><span class="kw4">char</span> y<span class="br0">)</span> <span class="br0">{</span> <span class="kw1">return</span> <span class="kw4">int</span><span class="br0">(</span>y <span class="sy2">-</span> <span class="st0">'A'</span><span class="br0">)</span><span class="sy4">;</span> <span class="br0">}</span><span class="br0">)</span> <span class="co1">// 第二范围的投影</span>
|
|
<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">is_permutation( { 1 2 3 4 5 }, { 3 5 4 1 2 } ): true
|
|
is_permutation( { 1 2 3 4 5 }, { 3 5 4 1 1 } ): false
|
|
is_permutation with custom predicate and projections: true</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-ranges-next_permutation.html"><span class="t-lines"><span>ranges::next_permutation</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>
|
|
<tr class="t-dsc">
|
|
<td>
|
|
<div class="t-dsc-member-div">
|
|
<div><a href="cpp-algorithm-ranges-prev_permutation.html"><span class="t-lines"><span>ranges::prev_permutation</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>
|
|
<tr class="t-dsc">
|
|
<td>
|
|
<div class="t-dsc-member-div">
|
|
<div><a href="cpp-algorithm-is_permutation.html"><span class="t-lines"><span>is_permutation</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-next_permutation.html"><span class="t-lines"><span>next_permutation</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-prev_permutation.html"><span class="t-lines"><span>prev_permutation</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-concepts-equivalence_relation.html"><span class="t-lines"><span>equivalence_relation</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-concepts-relation.html"><code>relation</code></a> 施加等价关系<br />
|
|
<span class="t-mark">(概念)</span></td>
|
|
</tr>
|
|
</table>
|
|
</div>
|
|
<div class="visualClear"></div>
|
|
</div>
|
|
</div>
|
|
</div>
|
|
</body>
|
|
</html>
|