83 lines
9.0 KiB
HTML
83 lines
9.0 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>operator==, operator<=>(std::basic_stacktrace)</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_utility_basic_stacktrace_operator_cmp skin-cppreference2 action-view cpp-navbar">
|
|
<div id="cpp-content-base">
|
|
<div id="content"><a id="top"></a>
|
|
<h1 id="firstHeading" class="firstHeading">operator==, operator<=><small>(std::basic_stacktrace)</small></h1>
|
|
<div id="bodyContent">
|
|
<div id="contentSub"><span class="subpages">< <a href="cpp.html">cpp</a>‎ | <a href="cpp-utility.html">utility</a>‎ | <a href="cpp-utility-basic_stacktrace.html">basic stacktrace</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-dcl t-since-cxx23">
|
|
<td>
|
|
<div><span class="mw-geshi cpp source-cpp"><span class="kw1">template</span><span class="sy1"><</span> <span class="kw1">class</span> Allocator2 <span class="sy1">></span><br /></span>
|
|
<p><span class="kw1">friend</span> <span class="kw4">bool</span> operator<span class="sy1">==</span><span class="br0">(</span> <span class="kw4">const</span> basic_stacktrace<span class="sy3">&</span> lhs,<br /></p>
|
|
<span class="kw4">const</span> basic_stacktrace<span class="sy1"><</span>Allocator2<span class="sy1">></span><span class="sy3">&</span> rhs <span class="br0">)</span> <span class="kw1">noexcept</span><span class="sy4">;</span></div>
|
|
</td>
|
|
<td>(1)</td>
|
|
<td><span class="t-mark-rev t-since-cxx23">(C++23 起)</span></td>
|
|
</tr>
|
|
<tr class="t-dcl t-since-cxx23">
|
|
<td>
|
|
<div><span class="mw-geshi cpp source-cpp"><span class="kw1">template</span><span class="sy1"><</span> <span class="kw1">class</span> Allocator2 <span class="sy1">></span><br /></span>
|
|
<p><span class="kw1">friend</span> std<span class="sy4">::</span><span class="me2">strong_ordering</span><br />
|
|
operator<span class="sy1"><=></span><span class="br0">(</span> <span class="kw4">const</span> basic_stacktrace<span class="sy3">&</span> lhs,<br /></p>
|
|
<span class="kw4">const</span> basic_stacktrace<span class="sy1"><</span>Allocator2<span class="sy1">></span><span class="sy3">&</span> rhs <span class="br0">)</span> <span class="kw1">noexcept</span><span class="sy4">;</span></div>
|
|
</td>
|
|
<td>(2)</td>
|
|
<td><span class="t-mark-rev t-since-cxx23">(C++23 起)</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>lhs</code> 与 <code>rhs</code> 的内容是否相等，即它们拥有相同元素数且 <code>lhs</code> 中的元素比较等于 <code>rhs</code> 中相同位置的元素。</div>
|
|
<div class="t-li1"><span class="t-li"></span> 等价于 <span class="t-c"><span class="mw-geshi cpp source-cpp"><span class="kw1">return</span> <a href="cpp-algorithm-equal.html"><span class="kw1573">std::<span class="me2">equal</span></span></a><span class="br0">(</span>lhs.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span>, lhs.<span class="me1">end</span><span class="br0">(</span><span class="br0">)</span>, rhs.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span>, rhs.<span class="me1">end</span><span class="br0">(</span><span class="br0">)</span><span class="br0">)</span><span class="sy4">;</span></span></span> 。</div>
|
|
<div class="t-li1"><span class="t-li">2)</span> 返回 <code>lhs</code> 与 <code>rhs</code> 中的栈踪条目数的相对顺序，若它们不相等。否则（若 <code>lhs</code> 与 <code>rhs</code> 的元素数相等），则返回 <code>lhs</code> 与 <code>rhs</code> 的元素的字典序。</div>
|
|
<div class="t-li1"><span class="t-li"></span> 等价于<br />
|
|
<span class="t-c"><span class="mw-geshi cpp source-cpp"><span class="kw1">if</span> <span class="br0">(</span><span class="kw4">auto</span> cmp <span class="sy1">=</span> lhs.<span class="me1">size</span><span class="br0">(</span><span class="br0">)</span> <span class="sy1"><=></span> rhs.<span class="me1">size</span><span class="br0">(</span><span class="br0">)</span><span class="sy4">;</span> cmp <span class="sy3">!</span><span class="sy1">=</span> <span class="nu0">0</span><span class="br0">)</span><br /></span></span>
|
|
<p> <span class="kw1">return</span> cmp<span class="sy4">;</span><br />
|
|
<span class="kw1">else</span><br />
|
|
<span class="kw1">return</span> std<span class="sy4">::</span><span class="me2">lexicographical_compare_three_way</span><span class="br0">(</span>lhs.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span>, lhs.<span class="me1">end</span><span class="br0">(</span><span class="br0">)</span>,<br /></p>
|
|
rhs.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span>, rhs.<span class="me1">end</span><span class="br0">(</span><span class="br0">)</span><span class="br0">)</span><span class="sy4">;</span> 。</div>
|
|
<p>这些函数模板对通常<a href="cpp-language-unqualified_lookup.html">无限定</a>或<a href="cpp-language-qualified_lookup.html">有限定查找</a>不可见，而只能在 <code>std::basic_stacktrace<Allocator></code> 为参数的关联类时由<a href="cpp-language-adl.html">实参依赖查找</a>找到。</p>
|
|
<p><code><</code>、 <code><=</code>、 <code>></code>、 <code>>=</code> 及 <code>!=</code> 运算符分别从 <code>operator<=></code> 与 <code>operator==</code> <a href="cpp-language-operators.html#.E5.85.B3.E7.B3.BB.E8.BF.90.E7.AE.97.E7.AC.A6">合成</a>。</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>lhs, rhs</td>
|
|
<td>-</td>
|
|
<td>要比较内容的 <code>basic_stacktrace</code></td>
|
|
</tr>
|
|
</table>
|
|
<h3><span class="mw-headline" id=".E8.BF.94.E5.9B.9E.E5.80.BC">返回值</span></h3>
|
|
<div class="t-li1"><span class="t-li">1)</span> 若 <code>lhs</code> 与 <code>rhs</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-c"><span class="mw-geshi cpp source-cpp">lhs.<span class="me1">size</span><span class="br0">(</span><span class="br0">)</span> <span class="sy1"><=></span> rhs.<span class="me1">size</span><span class="br0">(</span><span class="br0">)</span></span></span> ，若结果不是 <span class="t-lc">std::strong_order::equal</span> ，否则为 <code>lhs</code> 与 <code>rhs</code> 的元素的字典序。</div>
|
|
<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-2)</span> 若 <code>lhs</code> 与 <code>rhs</code> 大小不同则为常数，否则与 <code>lhs</code> 的大小成线性。</div>
|
|
<h3><span class="mw-headline" id=".E7.A4.BA.E4.BE.8B">示例</span></h3>
|
|
<table class="metadata plainlinks ambox mbox-small-left ambox-notice" style="">
|
|
<tr>
|
|
<td class="mbox-empty-cell"></td>
|
|
<td class="mbox-text" style="">本节未完成<br />
|
|
原因：暂无示例</td>
|
|
</tr>
|
|
</table>
|
|
</div>
|
|
<div class="visualClear"></div>
|
|
</div>
|
|
</div>
|
|
</div>
|
|
</body>
|
|
</html>
|