294 lines
28 KiB
HTML
294 lines
28 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::minmax, std::ranges::minmax_result</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_minmax 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>minmax, <span style="font-size:0.7em; line-height:130%">std::ranges::</span>minmax_result</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> <span class="kw1">class</span> T, <span class="kw1">class</span> Proj <span class="sy1">=</span> std<span class="sy4">::</span><span class="me2">identity</span>,<br /></span>
|
|
<p> std<span class="sy4">::</span><span class="me2">indirect_strict_weak_order</span><span class="sy1"><</span><br />
|
|
std<span class="sy4">::</span><span class="me2">projected</span><span class="sy1"><</span><span class="kw4">const</span> T<span class="sy2">*</span>, Proj<span class="sy1">>></span> Comp <span class="sy1">=</span> ranges<span class="sy4">::</span><span class="me2">less</span> <span class="sy1">></span><br />
|
|
<span class="kw4">constexpr</span> ranges<span class="sy4">::</span><span class="me2">minmax_result</span><span class="sy1"><</span><span class="kw4">const</span> T<span class="sy3">&</span><span class="sy1">></span><br /></p>
|
|
minmax<span class="br0">(</span> <span class="kw4">const</span> T<span class="sy3">&</span> a, <span class="kw4">const</span> T<span class="sy3">&</span> b, Comp comp <span class="sy1">=</span> <span class="br0">{</span><span class="br0">}</span>, Proj proj <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> <span class="kw1">class</span> T, <span class="kw1">class</span> Proj <span class="sy1">=</span> std<span class="sy4">::</span><span class="me2">identity</span>,<br /></span>
|
|
<p> std<span class="sy4">::</span><span class="me2">indirect_strict_weak_order</span><span class="sy1"><</span><br />
|
|
std<span class="sy4">::</span><span class="me2">projected</span><span class="sy1"><</span><span class="kw4">const</span> T<span class="sy2">*</span>, Proj<span class="sy1">>></span> Comp <span class="sy1">=</span> ranges<span class="sy4">::</span><span class="me2">less</span> <span class="sy1">></span><br />
|
|
<span class="kw4">constexpr</span> ranges<span class="sy4">::</span><span class="me2">minmax_result</span><span class="sy1"><</span><span class="kw4">const</span> T<span class="sy3">&</span><span class="sy1">></span><br /></p>
|
|
minmax<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>T<span class="sy1">></span> r, Comp comp <span class="sy1">=</span> <span class="br0">{</span><span class="br0">}</span>, Proj proj <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 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">input_range</span> R, <span class="kw1">class</span> Proj <span class="sy1">=</span> std<span class="sy4">::</span><span class="me2">identity</span>,<br /></span>
|
|
<p> std<span class="sy4">::</span><span class="me2">indirect_strict_weak_order</span><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>R<span class="sy1">></span>, Proj<span class="sy1">>></span> Comp <span class="sy1">=</span> ranges<span class="sy4">::</span><span class="me2">less</span> <span class="sy1">></span><br />
|
|
requires std<span class="sy4">::</span><span class="me2">indirectly_copyable_storable</span><span class="sy1"><</span>ranges<span class="sy4">::</span><span class="me2">iterator_t</span><span class="sy1"><</span>R<span class="sy1">></span>, ranges<span class="sy4">::</span><span class="me2">range_value_t</span><span class="sy1"><</span>R<span class="sy1">></span><span class="sy2">*</span><span class="sy1">></span><br />
|
|
<span class="kw4">constexpr</span> ranges<span class="sy4">::</span><span class="me2">minmax_result</span><span class="sy1"><</span>ranges<span class="sy4">::</span><span class="me2">range_value_t</span><span class="sy1"><</span>R<span class="sy1">>></span><br /></p>
|
|
minmax<span class="br0">(</span> R<span class="sy3">&&</span> r, Comp comp <span class="sy1">=</span> <span class="br0">{</span><span class="br0">}</span>, Proj proj <span class="sy1">=</span> <span class="br0">{</span><span class="br0">}</span> <span class="br0">)</span><span class="sy4">;</span></div>
|
|
</td>
|
|
<td>(3)</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>
|
|
<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> <span class="kw1">class</span> T <span class="sy1">></span><br />
|
|
<span class="kw1">using</span> minmax_result <span class="sy1">=</span> ranges<span class="sy4">::</span><span class="me2">min_max_result</span><span class="sy1"><</span>T<span class="sy1">></span><span class="sy4">;</span></span></div>
|
|
</td>
|
|
<td>(4)</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>
|
|
<p>返回给定的投影后值的最小者与最大者。</p>
|
|
<div class="t-li1"><span class="t-li">1)</span> 返回 <code>a</code> 与 <code>b</code> 的较小者与较大者的引用。</div>
|
|
<div class="t-li1"><span class="t-li">2)</span> 返回 initializer_list <code>r</code> 中的最小与最大值。</div>
|
|
<div class="t-li1"><span class="t-li">3)</span> 返回范围 <code>r</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="Parameters">Parameters</span></h3>
|
|
<table class="t-par-begin">
|
|
<tr class="t-par">
|
|
<td>a, b</td>
|
|
<td>-</td>
|
|
<td>要比较的值</td>
|
|
</tr>
|
|
<tr class="t-par">
|
|
<td>r</td>
|
|
<td>-</td>
|
|
<td>要比较的非空的值范围</td>
|
|
</tr>
|
|
<tr class="t-par">
|
|
<td>comp</td>
|
|
<td>-</td>
|
|
<td>应用到投影后元素的值</td>
|
|
</tr>
|
|
<tr class="t-par">
|
|
<td>proj</td>
|
|
<td>-</td>
|
|
<td>应用到元素的投影</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>b</code> 小于 <code>a</code> ,则为 <span class="t-c"><span class="mw-geshi cpp source-cpp"><span class="br0">{</span>b, a</span></span>} ;否则返回 <span class="t-c"><span class="mw-geshi cpp source-cpp"><span class="br0">{</span>a, b</span></span>} 。</div>
|
|
<div class="t-li1"><span class="t-li">2-3)</span> <span class="t-c"><span class="mw-geshi cpp source-cpp"><span class="br0">{</span>s, l</span></span>} ,其中 <code>s</code> 与 <code>l</code> 分别为 <code>r</code> 中分别按照其被投影值的的最小与最大值。若数个值等价于最小与最大,则返回最左的最小值与最右的最大值。若范围为空(由 <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>r<span class="br0">)</span></span></span> 确定)则行为未定义。</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)</span> 至多比较一次并投影二次。</div>
|
|
<div class="t-li1"><span class="t-li">2-3)</span> 至多比较 <span class="t-c"><span class="mw-geshi cpp source-cpp"><span class="nu0">3</span> <span class="sy2">/</span> <span class="nu0">2</span> <span class="sy2">*</span> ranges<span class="sy4">::</span><span class="me2">distance</span><span class="br0">(</span>r<span class="br0">)</span></span></span> 次并且应用两倍次数的投影。</div>
|
|
<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> minmax_fn <span class="br0">{</span>
|
|
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> T, <span class="kw1">class</span> Proj <span class="sy1">=</span> std<span class="sy4">::</span><span class="me2">identity</span>,
|
|
std<span class="sy4">::</span><span class="me2">indirect_strict_weak_order</span><span class="sy1"><</span>
|
|
std<span class="sy4">::</span><span class="me2">projected</span><span class="sy1"><</span><span class="kw4">const</span> T<span class="sy2">*</span>, Proj<span class="sy1">>></span> Comp <span class="sy1">=</span> ranges<span class="sy4">::</span><span class="me2">less</span><span class="sy1">></span>
|
|
<span class="kw4">constexpr</span> ranges<span class="sy4">::</span><span class="me2">minmax_result</span><span class="sy1"><</span><span class="kw4">const</span> T<span class="sy3">&</span><span class="sy1">></span> operator<span class="br0">(</span><span class="br0">)</span><span class="br0">(</span>
|
|
<span class="kw4">const</span> T<span class="sy3">&</span> a, <span class="kw4">const</span> T<span class="sy3">&</span> b, Comp comp <span class="sy1">=</span> <span class="br0">{</span><span class="br0">}</span>, Proj proj <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">if</span> <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>comp, <a href="cpp-utility-functional-invoke.html"><span class="kw1058">std::<span class="me2">invoke</span></span></a><span class="br0">(</span>proj, b<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>proj, a<span class="br0">)</span><span class="br0">)</span><span class="br0">)</span> <span class="br0">{</span>
|
|
<span class="kw1">return</span> <span class="br0">{</span>b, a<span class="br0">}</span><span class="sy4">;</span>
|
|
<span class="br0">}</span>
|
|
|
|
<span class="kw1">return</span> <span class="br0">{</span>a, b<span class="br0">}</span><span class="sy4">;</span>
|
|
<span class="br0">}</span>
|
|
|
|
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> T, <span class="kw1">class</span> Proj <span class="sy1">=</span> std<span class="sy4">::</span><span class="me2">identity</span>,
|
|
std<span class="sy4">::</span><span class="me2">indirect_strict_weak_order</span><span class="sy1"><</span>
|
|
std<span class="sy4">::</span><span class="me2">projected</span><span class="sy1"><</span><span class="kw4">const</span> T<span class="sy2">*</span>, Proj<span class="sy1">>></span> Comp <span class="sy1">=</span> ranges<span class="sy4">::</span><span class="me2">less</span><span class="sy1">></span>
|
|
<span class="kw4">constexpr</span> ranges<span class="sy4">::</span><span class="me2">minmax_result</span><span class="sy1"><</span><span class="kw4">const</span> T<span class="sy3">&</span><span class="sy1">></span> operator<span class="br0">(</span><span class="br0">)</span><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>T<span class="sy1">></span> r, Comp comp <span class="sy1">=</span> <span class="br0">{</span><span class="br0">}</span>, Proj proj <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="kw4">auto</span> result <span class="sy1">=</span> ranges<span class="sy4">::</span><span class="me2">minmax_element</span><span class="br0">(</span>r, <a href="cpp-utility-functional-ref.html"><span class="kw1069">std::<span class="me2">ref</span></span></a><span class="br0">(</span>comp<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>proj<span class="br0">)</span><span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="kw1">return</span> <span class="br0">{</span>std<span class="sy4">::</span><span class="me2">move</span><span class="br0">(</span><span class="sy2">*</span>result.<span class="me1">min</span><span class="br0">)</span>, std<span class="sy4">::</span><span class="me2">move</span><span class="br0">(</span><span class="sy2">*</span>result.<span class="me1">max</span><span class="br0">)</span><span class="br0">}</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">input_range</span> R, <span class="kw1">class</span> Proj <span class="sy1">=</span> std<span class="sy4">::</span><span class="me2">identity</span>,
|
|
std<span class="sy4">::</span><span class="me2">indirect_strict_weak_order</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>R<span class="sy1">></span>, Proj<span class="sy1">>></span> Comp <span class="sy1">=</span> ranges<span class="sy4">::</span><span class="me2">less</span><span class="sy1">></span>
|
|
requires std<span class="sy4">::</span><span class="me2">indirectly_copyable_storable</span><span class="sy1"><</span>ranges<span class="sy4">::</span><span class="me2">iterator_t</span><span class="sy1"><</span>R<span class="sy1">></span>,
|
|
ranges<span class="sy4">::</span><span class="me2">range_value_t</span><span class="sy1"><</span>R<span class="sy1">></span><span class="sy2">*</span><span class="sy1">></span>
|
|
<span class="kw4">constexpr</span> ranges<span class="sy4">::</span><span class="me2">minmax_result</span><span class="sy1"><</span>ranges<span class="sy4">::</span><span class="me2">range_value_t</span><span class="sy1"><</span>R<span class="sy1">>></span> operator<span class="br0">(</span><span class="br0">)</span><span class="br0">(</span>
|
|
R<span class="sy3">&&</span> r, Comp comp <span class="sy1">=</span> <span class="br0">{</span><span class="br0">}</span>, Proj proj <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="kw4">auto</span> result <span class="sy1">=</span> ranges<span class="sy4">::</span><span class="me2">minmax_element</span><span class="br0">(</span>r, <a href="cpp-utility-functional-ref.html"><span class="kw1069">std::<span class="me2">ref</span></span></a><span class="br0">(</span>comp<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>proj<span class="br0">)</span><span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="kw1">return</span> <span class="br0">{</span>std<span class="sy4">::</span><span class="me2">move</span><span class="br0">(</span><span class="sy2">*</span>result.<span class="me1">min</span><span class="br0">)</span>, std<span class="sy4">::</span><span class="me2">move</span><span class="br0">(</span><span class="sy2">*</span>result.<span class="me1">max</span><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> minmax_fn minmax<span class="sy4">;</span></pre></div>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</table>
|
|
<h3><span class="mw-headline" id=".E6.B3.A8.E8.A7.A3">注解</span></h3>
|
|
<p>对于重载 <span class="t-v">(1,2)</span> ,若参数之一为临时量,则返回的引用在含有对 <code>minmax</code> 的该调用的完全表达式结束后变为悬垂引用。</p>
|
|
<div dir="ltr" class="mw-geshi" style="text-align: left;">
|
|
<div class="cpp source-cpp">
|
|
<pre class="de1"><span class="kw4">int</span> n <span class="sy1">=</span> <span class="nu0">1</span><span class="sy4">;</span>
|
|
<span class="kw4">auto</span> p <span class="sy1">=</span> ranges<span class="sy4">::</span><span class="me2">minmax</span><span class="br0">(</span>n, n<span class="sy2">+</span><span class="nu0">1</span><span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="kw4">int</span> m <span class="sy1">=</span> p.<span class="me1">first</span><span class="sy4">;</span> <span class="co1">// ok</span>
|
|
<span class="kw4">int</span> x <span class="sy1">=</span> p.<span class="me1">second</span><span class="sy4">;</span> <span class="co1">// 未定义行为</span></pre></div>
|
|
</div>
|
|
<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 <iostream></span>
|
|
<span class="co2">#include <random></span>
|
|
<span class="co2">#include <vector></span>
|
|
|
|
<span class="kw4">int</span> main<span class="br0">(</span><span class="br0">)</span>
|
|
<span class="br0">{</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> v<span class="br0">{</span><span class="nu0">3</span>, <span class="nu0">1</span>, <span class="nu0">4</span>, <span class="nu0">9</span>, <span class="nu0">1</span>, <span class="nu0">5</span>, <span class="nu0">9</span>, <span class="nu0">2</span>, <span class="nu0">6</span><span class="br0">}</span><span class="sy4">;</span>
|
|
<a href="cpp-numeric-random-mersenne_twister_engine.html"><span class="kw1490">std::<span class="me2">mt19937_64</span></span></a> generator<span class="sy4">;</span>
|
|
<span class="kw1">namespace</span> ranges <span class="sy1">=</span> std<span class="sy4">::</span><span class="me2">ranges</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> distribution<span class="br0">(</span><span class="nu0">0</span>, ranges<span class="sy4">::</span><span class="me2">distance</span><span class="br0">(</span>v<span class="br0">)</span><span class="br0">)</span><span class="sy4">;</span>
|
|
|
|
<span class="kw4">auto</span> bounds <span class="sy1">=</span> ranges<span class="sy4">::</span><span class="me2">minmax</span><span class="br0">(</span>distribution<span class="br0">(</span>generator<span class="br0">)</span>, distribution<span class="br0">(</span>generator<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> <span class="st0">"v["</span> <span class="sy1"><<</span> bounds.<span class="me1">min</span> <span class="sy1"><<</span> <span class="st0">":"</span> <span class="sy1"><<</span> bounds.<span class="me1">max</span> <span class="sy1"><<</span> <span class="st0">"]: "</span><span class="sy4">;</span>
|
|
<span class="kw1">for</span> <span class="br0">(</span><span class="kw4">int</span> i <span class="sy1">=</span> bounds.<span class="me1">min</span><span class="sy4">;</span> i <span class="sy1"><</span> bounds.<span class="me1">max</span><span class="sy4">;</span> <span class="sy2">++</span>i<span class="br0">)</span> <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> v<span class="br0">[</span>i<span class="br0">]</span> <span class="sy1"><<</span> <span class="st0">' '</span><span class="sy4">;</span>
|
|
<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 class="es1">\n</span>'</span><span class="sy4">;</span>
|
|
|
|
<span class="kw4">auto</span> <span class="br0">[</span>min, max<span class="br0">]</span> <span class="sy1">=</span> ranges<span class="sy4">::</span><span class="me2">minmax</span><span class="br0">(</span>v<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> <span class="st0">"smallest: "</span> <span class="sy1"><<</span> min <span class="sy1"><<</span> <span class="st0">'<span class="es1">\n</span>'</span>
|
|
<span class="sy1"><<</span> <span class="st0">"largest: "</span> <span class="sy1"><<</span> max <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">v[2:7]: 4 9 1 5 9
|
|
smallest: 1
|
|
largest: 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-ranges-min.html"><span class="t-lines"><span>ranges::min</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-max.html"><span class="t-lines"><span>ranges::max</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-minmax_element.html"><span class="t-lines"><span>ranges::minmax_element</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-clamp.html"><span class="t-lines"><span>ranges::clamp</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-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>
|
|
</table>
|
|
</div>
|
|
<div class="visualClear"></div>
|
|
</div>
|
|
</div>
|
|
</div>
|
|
</body>
|
|
</html>
|