469 lines
25 KiB
HTML
469 lines
25 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>C++ 具名要求：比较 (Compare)</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_named_req_Compare 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%">C++ 具名要求：</span><span style="font-style:italic">比较</span> <span style="font-family: Georgia, 'DejaVu Serif', serif; font-style:italic">(Compare)</span></h1>
|
|
<div id="bodyContent">
|
|
<div id="contentSub"><span class="subpages">< <a href="cpp.html">cpp</a>‎ | <a href="cpp-named_req.html">named req</a></span></div>
|
|
<div id="mw-content-text" lang="zh" dir="ltr" class="mw-content-ltr" xml:lang="zh">
|
|
<p><strong class="selflink"><span style="font-style:italic">比较</span> <span style="font-family: Georgia, 'DejaVu Serif', serif; font-style:italic">(Compare)</span></strong> 是一些标准库设施针对用户提供的函数对象类型所期待的一组要求。</p>
|
|
<p>对满足<span style="font-style:italic">比较</span> <span style="font-family: Georgia, 'DejaVu Serif', serif; font-style:italic">(Compare)</span> 的类型的对象运用函数调用操作的返回值，当<a href="cpp-language-implicit_conversion.html">按语境转换</a>成 <span class="t-c"><span class="mw-geshi cpp source-cpp"><span class="kw4">bool</span></span></span> 时，若此类型所引入的<i>严格弱序关系</i>中，该调用的第一实参先于第二实参，则生成 <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>。</p>
|
|
<p>与任何<a href="cpp-named_req-BinaryPredicate.html"><span style="font-style:italic">二元谓词</span> <span style="font-family: Georgia, 'DejaVu Serif', serif; font-style:italic">(BinaryPredicate)</span></a> 相同，不允许该表达式的求值通过解引用的迭代器调用非 const 函数。</p>
|
|
<h3><span class="mw-headline" id=".E8.A6.81.E6.B1.82">要求</span></h3>
|
|
<p>以下情况下，类型 <code>T</code> 满足<span style="font-style:italic">比较</span> <span style="font-family: Georgia, 'DejaVu Serif', serif; font-style:italic">(Compare)</span></p>
|
|
<ul>
|
|
<li>类型 <code>T</code> 满足<a href="cpp-named_req-BinaryPredicate.html"><span style="font-style:italic">二元谓词</span> <span style="font-family: Georgia, 'DejaVu Serif', serif; font-style:italic">(BinaryPredicate)</span></a> ，且</li>
|
|
</ul>
|
|
<p>给定</p>
|
|
<ul>
|
|
<li><code>T</code> 类型的对象 <code>comp</code></li>
|
|
<li><code>equiv(a, b)</code>，为等价于 <code>!comp(a, b) && !comp(b, a)</code> 的表达式</li>
|
|
</ul>
|
|
<p>下列表达是必须合法且拥有其指定的效果</p>
|
|
<table class="wikitable">
|
|
<tr>
|
|
<th>表达式</th>
|
|
<th>返回类型</th>
|
|
<th>要求</th>
|
|
</tr>
|
|
<tr>
|
|
<td><span class="t-c"><span class="mw-geshi cpp source-cpp">comp<span class="br0">(</span>a, b<span class="br0">)</span></span></span></td>
|
|
<td><a href="cpp-language-implicit_conversion.html">可隐式转换</a>为 <span class="t-c"><span class="mw-geshi cpp source-cpp"><span class="kw4">bool</span></span></span></td>
|
|
<td>建立具有下列性质的<a href="https://en.wikipedia.org/wiki/Strict_weak_ordering" class="extiw" title="enwiki:Strict weak ordering">严格弱序</a>关系
|
|
<ul>
|
|
<li>对于所有 <code>a</code>，<span class="t-c"><span class="mw-geshi cpp source-cpp">comp<span class="br0">(</span>a,a<span class="br0">)</span><span class="sy1">==</span><span class="kw2">false</span></span></span></li>
|
|
<li>若 <span class="t-c"><span class="mw-geshi cpp source-cpp">comp<span class="br0">(</span>a,b<span class="br0">)</span><span class="sy1">==</span><span class="kw2">true</span></span></span> 则 <span class="t-c"><span class="mw-geshi cpp source-cpp">comp<span class="br0">(</span>b,a<span class="br0">)</span><span class="sy1">==</span><span class="kw2">false</span></span></span></li>
|
|
<li>若 <span class="t-c"><span class="mw-geshi cpp source-cpp">comp<span class="br0">(</span>a,b<span class="br0">)</span><span class="sy1">==</span><span class="kw2">true</span></span></span> 且 <span class="t-c"><span class="mw-geshi cpp source-cpp">comp<span class="br0">(</span>b,c<span class="br0">)</span><span class="sy1">==</span><span class="kw2">true</span></span></span> 则 <span class="t-c"><span class="mw-geshi cpp source-cpp">comp<span class="br0">(</span>a,c<span class="br0">)</span><span class="sy1">==</span><span class="kw2">true</span></span></span></li>
|
|
</ul>
|
|
</td>
|
|
</tr>
|
|
<tr>
|
|
<td><span class="t-c"><span class="mw-geshi cpp source-cpp">equiv<span class="br0">(</span>a, b<span class="br0">)</span></span></span></td>
|
|
<td><span class="t-c"><span class="mw-geshi cpp source-cpp"><span class="kw4">bool</span></span></span></td>
|
|
<td>建立具有下列性质的等价关系
|
|
<ul>
|
|
<li>对于所有 <code>a</code>，<span class="t-c"><span class="mw-geshi cpp source-cpp">equiv<span class="br0">(</span>a,a<span class="br0">)</span><span class="sy1">==</span><span class="kw2">true</span></span></span></li>
|
|
<li>若 <span class="t-c"><span class="mw-geshi cpp source-cpp">equiv<span class="br0">(</span>a,b<span class="br0">)</span><span class="sy1">==</span><span class="kw2">true</span></span></span> 则 <span class="t-c"><span class="mw-geshi cpp source-cpp">equiv<span class="br0">(</span>b,a<span class="br0">)</span><span class="sy1">==</span><span class="kw2">true</span></span></span></li>
|
|
<li>若 <span class="t-c"><span class="mw-geshi cpp source-cpp">equiv<span class="br0">(</span>a,b<span class="br0">)</span><span class="sy1">==</span><span class="kw2">true</span></span></span> 且 <span class="t-c"><span class="mw-geshi cpp source-cpp">equiv<span class="br0">(</span>b,c<span class="br0">)</span><span class="sy1">==</span><span class="kw2">true</span></span></span> 则 <span class="t-c"><span class="mw-geshi cpp source-cpp">equiv<span class="br0">(</span>a,c<span class="br0">)</span><span class="sy1">==</span><span class="kw2">true</span></span></span></li>
|
|
</ul>
|
|
</td>
|
|
</tr>
|
|
</table>
|
|
<p>注：<code>comp</code> 在 <code>equiv</code> 所确定的等价类上引入了一种<i>严格全序</i>。</p>
|
|
<h3><span class="mw-headline" id=".E6.A0.87.E5.87.86.E5.BA.93">标准库</span></h3>
|
|
<p>下列标准库设施期待<span style="font-style:italic">比较</span> <span style="font-family: Georgia, 'DejaVu Serif', serif; font-style:italic">(Compare)</span> 类型。</p>
|
|
<table class="t-dsc-begin">
|
|
<tr class="t-dsc">
|
|
<td>
|
|
<div class="t-dsc-member-div">
|
|
<div><a href="cpp-container-set.html"><span class="t-lines"><span>set</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-container-map.html"><span class="t-lines"><span>map</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-container-multiset.html"><span class="t-lines"><span>multiset</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-container-multimap.html"><span class="t-lines"><span>multimap</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-container-priority_queue.html"><span class="t-lines"><span>priority_queue</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-container-forward_list-sort.html"><span class="t-lines"><span>sort</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">(<code>std::forward_list<T,Allocator></code> 的公开成员函数)</span></td>
|
|
</tr>
|
|
<tr class="t-dsc">
|
|
<td>
|
|
<div class="t-dsc-member-div">
|
|
<div><a href="cpp-container-list-sort.html"><span class="t-lines"><span>sort</span></span></a></div>
|
|
</div>
|
|
</td>
|
|
<td>对元素进行排序<br />
|
|
<span class="t-mark">(<code>std::list<T,Allocator></code> 的公开成员函数)</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-partial_sort.html"><span class="t-lines"><span>partial_sort</span></span></a></div>
|
|
</div>
|
|
</td>
|
|
<td>排序一个范围的前 N 个元素<br />
|
|
<span class="t-mark">(函数模板)</span></td>
|
|
</tr>
|
|
<tr class="t-dsc">
|
|
<td>
|
|
<div class="t-dsc-member-div">
|
|
<div><a href="cpp-algorithm-partial_sort_copy.html"><span class="t-lines"><span>partial_sort_copy</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-is_sorted_until.html"><span class="t-lines"><span>is_sorted_until</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-nth_element.html"><span class="t-lines"><span>nth_element</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-lower_bound.html"><span class="t-lines"><span>lower_bound</span></span></a></div>
|
|
</div>
|
|
</td>
|
|
<td>返回指向第一个<i>不小于</i>给定值的元素的迭代器<br />
|
|
<span class="t-mark">(函数模板)</span></td>
|
|
</tr>
|
|
<tr class="t-dsc">
|
|
<td>
|
|
<div class="t-dsc-member-div">
|
|
<div><a href="cpp-algorithm-upper_bound.html"><span class="t-lines"><span>upper_bound</span></span></a></div>
|
|
</div>
|
|
</td>
|
|
<td>返回指向第一个<i>大于</i>给定值的元素的迭代器<br />
|
|
<span class="t-mark">(函数模板)</span></td>
|
|
</tr>
|
|
<tr class="t-dsc">
|
|
<td>
|
|
<div class="t-dsc-member-div">
|
|
<div><a href="cpp-algorithm-binary_search.html"><span class="t-lines"><span>binary_search</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-equal_range.html"><span class="t-lines"><span>equal_range</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-merge.html"><span class="t-lines"><span>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-container-forward_list-merge.html"><span class="t-lines"><span>merge</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">(<code>std::forward_list<T,Allocator></code> 的公开成员函数)</span></td>
|
|
</tr>
|
|
<tr class="t-dsc">
|
|
<td>
|
|
<div class="t-dsc-member-div">
|
|
<div><a href="cpp-container-list-merge.html"><span class="t-lines"><span>merge</span></span></a></div>
|
|
</div>
|
|
</td>
|
|
<td>合并二个已排序列表<br />
|
|
<span class="t-mark">(<code>std::list<T,Allocator></code> 的公开成员函数)</span></td>
|
|
</tr>
|
|
<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-includes.html"><span class="t-lines"><span>includes</span></span></a></div>
|
|
</div>
|
|
</td>
|
|
<td>若一个序列是另一个的子列则返回 true<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_difference.html"><span class="t-lines"><span>set_difference</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-set_intersection.html"><span class="t-lines"><span>set_intersection</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-set_symmetric_difference.html"><span class="t-lines"><span>set_symmetric_difference</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-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-push_heap.html"><span class="t-lines"><span>push_heap</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-pop_heap.html"><span class="t-lines"><span>pop_heap</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-make_heap.html"><span class="t-lines"><span>make_heap</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_heap.html"><span class="t-lines"><span>sort_heap</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_heap.html"><span class="t-lines"><span>is_heap</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_heap_until.html"><span class="t-lines"><span>is_heap_until</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-max.html"><span class="t-lines"><span>max</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-max_element.html"><span class="t-lines"><span>max_element</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-min.html"><span class="t-lines"><span>min</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-min_element.html"><span class="t-lines"><span>min_element</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-minmax.html"><span class="t-lines"><span>minmax</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-minmax_element.html"><span class="t-lines"><span>minmax_element</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-lexicographical_compare.html"><span class="t-lines"><span>lexicographical_compare</span></span></a></div>
|
|
</div>
|
|
</td>
|
|
<td>当一个范围按字典顺序小于另一个范围时，返回 true<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>
|
|
</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-concepts-strict_weak_order.html"><span class="t-lines"><span>strict_weak_order</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>
|