-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathminmax_element.html
More file actions
389 lines (318 loc) · 35.5 KB
/
Copy pathminmax_element.html
File metadata and controls
389 lines (318 loc) · 35.5 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
<!doctype html>
<html class="cpprefjp" lang="ja" itemscope="" itemtype="http://schema.org/WebPage">
<head>
<!-- Google tag (gtag.js) -->
<script async src="https://www.googletagmanager.com/gtag/js?id=G-NXNBNVBTJS"></script>
<script>
window.dataLayer = window.dataLayer || [];
function gtag(){dataLayer.push(arguments);}
gtag('js', new Date());
gtag('config', 'G-NXNBNVBTJS');
</script>
<meta charset="UTF-8">
<title>std::minmax_element - cpprefjp C++日本語リファレンス</title>
<meta name="viewport" content="width=device-width,initial-scale=1">
<meta name="keywords" content="
C++,標準ライブラリ,リファレンス,ドキュメント,STL,std,algorithm,std,function template,cpp11
">
<meta name="title" content="std::minmax_element - cpprefjp C++日本語リファレンス" />
<meta itemprop="name" content="std::minmax_element - cpprefjp C++日本語リファレンス" />
<meta property="og:title" content="std::minmax_element - cpprefjp C++日本語リファレンス" />
<meta property="og:url" content="https://cpprefjp.github.io/reference/algorithm/minmax_element.html" />
<meta property="og:site_name" content="cpprefjp - C++日本語リファレンス" />
<meta property="og:type" content="article" />
<meta property="og:description" content="イテレータ範囲`[first, last)`のうち、最小要素を指すイテレータと最大要素を指すイテレータの組を取得する。" />
<meta name="twitter:card" content="summary" />
<meta name="twitter:title" content="std::minmax_element - cpprefjp C++日本語リファレンス" />
<meta name="twitter:url" content="https://cpprefjp.github.io/reference/algorithm/minmax_element.html" />
<meta name="twitter:description" content="イテレータ範囲`[first, last)`のうち、最小要素を指すイテレータと最大要素を指すイテレータの組を取得する。" />
<link rel="alternate" type="application/atom+xml" title="Atom" href="https://cpprefjp.github.io/rss.xml" />
<link rel="apple-touch-icon" sizes="180x180" href="../../static/favicons/apple-touch-icon.png?cachebust=1c661255f2059937c46deddf68e0bfa3500bac91">
<link rel="icon" type="image/png" sizes="32x32" href="../../static/favicons/favicon-32x32.png?cachebust=1c661255f2059937c46deddf68e0bfa3500bac91">
<link rel="icon" type="image/png" sizes="16x16" href="../../static/favicons/favicon-16x16.png?cachebust=1c661255f2059937c46deddf68e0bfa3500bac91">
<link rel="manifest" href="../../manifest.json?cachebust=1c661255f2059937c46deddf68e0bfa3500bac91">
<meta name="theme-color" content="#f5f8fc">
<link rel="stylesheet" href="../../static/pygments/default.css?cachebust=1c661255f2059937c46deddf68e0bfa3500bac91">
<!-- <link rel="stylesheet" href="../../static/css/root.css"> -->
<link href="../../static/kunai/css/kunai-stage-0.css?cachebust=1c661255f2059937c46deddf68e0bfa3500bac91" rel="stylesheet">
<link href="../../static/kunai/css/kunai-stage-1.css?cachebust=1c661255f2059937c46deddf68e0bfa3500bac91" rel="stylesheet">
<link href="../../static/kunai/css/kunai-stage-2.css?cachebust=1c661255f2059937c46deddf68e0bfa3500bac91" rel="stylesheet">
<link href="../../static/kunai/css/kunai-stage-3.css?cachebust=1c661255f2059937c46deddf68e0bfa3500bac91" rel="stylesheet">
<script type="text/javascript" src="../../static/kunai/js/kunai-vendor.js?cachebust=1c661255f2059937c46deddf68e0bfa3500bac91"></script>
<script type="text/javascript" src="../../static/kunai/js/kunai.js?cachebust=1c661255f2059937c46deddf68e0bfa3500bac91"></script>
<script type="text/javascript">
document.addEventListener('DOMContentLoaded', function() {
var kn = new Kunai;
kn.cpprefjp();
});
</script>
</head>
<body>
<header data-kunai-mdinfo="{"meta": {"header": ["algorithm"], "namespace": ["std"], "id-type": ["function template"], "cpp": ["cpp11"]}, "sources": [{"id": "ac15f1f02d47055d3a67f5752b02a1515c709682", "source": "#include <cassert>\n#include <algorithm>\n#include <vector>\n\nint main()\n{\n std::vector<int> v = {3, 1, 4};\n\n auto i = std::minmax_element(v.begin(), v.end());\n assert(*i.first == 1);\n assert(*i.second == 4);\n\n auto j = std::minmax_element(v.begin(), v.end(), [](int a, int b) {\n return a > b;\n });\n assert(*j.first == 4);\n assert(*j.second == 1);\n}\n"}], "page_id": ["reference", "algorithm", "minmax_element"]}">
<nav class="navbar navbar-default" role="navigation">
<div class="container-fluid">
<div class="navbar-header">
<button type="button" class="navbar-toggle collapsed" data-toggle="collapse" data-target="#navbar-collapse">
<span class="sr-only">Toggle navigation</span>
<span class="icon-bar"></span>
<span class="icon-bar"></span>
<span class="icon-bar"></span>
</button>
<a class="navbar-brand" href="../../index.html">
<div class="title-wrapper clearfix">
<div class="title">cpprefjp - C++日本語リファレンス</div>
</div>
</a>
</div>
<div class="collapse navbar-collapse" id="navbar-collapse">
<ul class="nav navbar-nav navbar-right">
<li>
<div class="google-search">
<script>
(function() {
var cx = '013316413321391058734:ji_u66hl7hq';
var gcse = document.createElement('script');
gcse.type = 'text/javascript';
gcse.async = true;
gcse.src = (document.location.protocol == 'https:' ? 'https:' : 'http:') +
'//www.google.com/cse/cse.js?cx=' + cx;
var s = document.getElementsByTagName('script')[0];
s.parentNode.insertBefore(gcse, s);
})();
</script>
<div class="gcse-search"></div>
</div>
</li>
<li>
<a href="https://github.com/cpprefjp/site">GitHub Project</a>
</li>
</ul>
</div>
</div>
</nav>
</header>
<main id="main" role="main">
<div class="container-fluid">
<div class="row">
<div class="col-sm-9 col-sm-push-3" itemscope itemtype="http://schema.org/Article">
<div class="row">
<div class="col-sm-12 google-search-result">
<gcse:searchresults></gcse:searchresults>
</div>
</div>
<div class="row">
<div class="col-sm-12 content-header">
<ol class="breadcrumb">
<li itemscope itemtype="http://www.schema.org/SiteNavigationElement">
<span>
<a href="../../index.html" itemprop="url">
<i class="fa fa-fw fa-home"></i>
</a>
</span>
</li>
<li itemscope itemtype="http://www.schema.org/SiteNavigationElement">
<span>
<a href="../../reference.html" itemprop="url">
<span itemprop="name">リファレンス</span>
</a>
</span>
</li>
<li itemscope itemtype="http://www.schema.org/SiteNavigationElement">
<span>
<a href="../../reference/algorithm.html" itemprop="url">
<span itemprop="name">algorithm</span>
</a>
</span>
</li>
<li class="active" itemscope itemtype="http://www.schema.org/SiteNavigationElement">
<span>
<span itemprop="name">minmax_element</span>
</span>
</li>
</ol>
<div class="crsearch"></div>
</div>
</div>
<div class="row">
<div class="col-sm-12 edit-button">
<p class="text-right"><small>
最終更新日時(UTC):
<span itemprop="datePublished" content="2026-04-13T06:17:49">
2026年04月13日 06時17分49秒
</span>
<br/>
<span itemprop="author" itemscope itemtype="http://schema.org/Person">
<span itemprop="name">teruyamato0731</span>
</span>
が更新
</small></p>
<p class="text-right">
<a class="history" target="_blank" href="https://github.com/cpprefjp/site/commits/master/reference/algorithm/minmax_element.md">
<span class="fa fa-fw fa-clock-o fa-flip-horizontal"></span>履歴
</a>
<a class="edit" target="_blank" href="https://github.com/cpprefjp/site/edit/master/reference/algorithm/minmax_element.md">
<span class="fa fa-fw fa-pencil"></span>編集
</a>
</p>
</div>
</div>
<div class="row">
<div class="col-sm-12 content-body">
<div class="identifier-type">function template</div><div class="header"><algorithm></div><h1 itemprop="name"><span class="namespace" title="namespace std">std::</span><span class="token">minmax_element</span><span class="cpp cpp11" title="C++11で追加">(C++11)</span></h1>
<div itemprop="articleBody"><p><div class="codehilite"><pre><span></span><code><span class="k">namespace</span><span class="w"> </span><span class="nn">std</span><span class="w"> </span><span class="p">{</span>
<span class="w"> </span><span class="k">template</span><span class="o"><</span><span class="k">class</span><span class="w"> </span><span class="nc">ForwardIterator</span><span class="o">></span>
<span class="w"> </span><span class="n"><a href="../utility/pair.html">pair</a></span><span class="o"><</span><span class="n">ForwardIterator</span><span class="p">,</span><span class="w"> </span><span class="n">ForwardIterator</span><span class="o">></span>
<span class="w"> </span><span class="n">minmax_element</span><span class="p">(</span><span class="n">ForwardIterator</span><span class="w"> </span><span class="n">first</span><span class="p">,</span>
<span class="w"> </span><span class="n">ForwardIterator</span><span class="w"> </span><span class="n">last</span><span class="p">);</span><span class="w"> </span><span class="c1">// (1) C++11</span>
<span class="w"> </span><span class="k">template</span><span class="o"><</span><span class="k">class</span><span class="w"> </span><span class="nc">ForwardIterator</span><span class="p">,</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">Compare</span><span class="o">></span>
<span class="w"> </span><span class="n"><a href="../utility/pair.html">pair</a></span><span class="o"><</span><span class="n">ForwardIterator</span><span class="p">,</span><span class="w"> </span><span class="n">ForwardIterator</span><span class="o">></span>
<span class="w"> </span><span class="n">minmax_element</span><span class="p">(</span><span class="n">ForwardIterator</span><span class="w"> </span><span class="n">first</span><span class="p">,</span>
<span class="w"> </span><span class="n">ForwardIterator</span><span class="w"> </span><span class="n">last</span><span class="p">,</span>
<span class="w"> </span><span class="n">Compare</span><span class="w"> </span><span class="n">comp</span><span class="p">);</span><span class="w"> </span><span class="c1">// (2) C++11</span>
<span class="w"> </span><span class="k">template</span><span class="w"> </span><span class="o"><</span><span class="k">class</span><span class="w"> </span><span class="nc"><a href="../execution/execution/execution_policy.html">ExecutionPolicy</a></span><span class="p">,</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">ForwardIterator</span><span class="o">></span>
<span class="w"> </span><span class="n"><a href="../utility/pair.html">pair</a></span><span class="o"><</span><span class="n">ForwardIterator</span><span class="p">,</span><span class="w"> </span><span class="n">ForwardIterator</span><span class="o">></span>
<span class="w"> </span><span class="n">minmax_element</span><span class="p">(</span><span class="n"><a href="../execution/execution/execution_policy.html">ExecutionPolicy</a></span><span class="o">&&</span><span class="w"> </span><span class="n">exec</span><span class="p">,</span>
<span class="w"> </span><span class="n">ForwardIterator</span><span class="w"> </span><span class="n">first</span><span class="p">,</span>
<span class="w"> </span><span class="n">ForwardIterator</span><span class="w"> </span><span class="n">last</span><span class="p">);</span><span class="w"> </span><span class="c1">// (3) C++17</span>
<span class="w"> </span><span class="k">template</span><span class="w"> </span><span class="o"><</span><span class="k">class</span><span class="w"> </span><span class="nc"><a href="../execution/execution/execution_policy.html">ExecutionPolicy</a></span><span class="p">,</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">ForwardIterator</span><span class="p">,</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">Compare</span><span class="o">></span>
<span class="w"> </span><span class="n"><a href="../utility/pair.html">pair</a></span><span class="o"><</span><span class="n">ForwardIterator</span><span class="p">,</span><span class="w"> </span><span class="n">ForwardIterator</span><span class="o">></span>
<span class="w"> </span><span class="n">minmax_element</span><span class="p">(</span><span class="n"><a href="../execution/execution/execution_policy.html">ExecutionPolicy</a></span><span class="o">&&</span><span class="w"> </span><span class="n">exec</span><span class="p">,</span>
<span class="w"> </span><span class="n">ForwardIterator</span><span class="w"> </span><span class="n">first</span><span class="p">,</span>
<span class="w"> </span><span class="n">ForwardIterator</span><span class="w"> </span><span class="n">last</span><span class="p">,</span>
<span class="w"> </span><span class="n">Compare</span><span class="w"> </span><span class="n">comp</span><span class="p">);</span><span class="w"> </span><span class="c1">// (4) C++17</span>
<span class="p">}</span>
</code></pre></div>
</p>
<h2>概要</h2>
<p><a class="cpprefjp-defined-word" data-desc="2つのイテレータで表現される半開区間を表す。C++20からイテレータと番兵で異なる型であっても指定可能になる">イテレータ範囲</a><code>[first, last)</code>のうち、最小要素を指すイテレータと最大要素を指すイテレータの組を取得する。</p>
<p>この関数の<a class="cpprefjp-defined-word" data-desc="関数呼び出し式の評価結果となるオブジェクト・値">戻り値</a>となるイテレータの<code><a href="../utility/pair.html">pair</a></code>では、<code>first</code>に最小要素を指すイテレータ、<code>second</code>に最大要素を指すイテレータが代入される。</p>
<h2><a class="cpprefjp-defined-word" data-desc="関数呼び出し式の評価結果となるオブジェクト・値">戻り値</a></h2>
<p><code>operator<</code> もしくは <code>comp</code> を比較基準とした際の、最小の要素を指すイテレータを <code>first</code>、最大の要素を指すイテレータを <code>second</code> に持つ <code><a href="../utility/pair.html">pair</a></code> オブジェクトを返す。</p>
<p>ただし、<code>first == last</code> の場合には、<code><a href="../utility/make_pair.html">make_pair</a>(first, first)</code>を返す。</p>
<h2><a class="cpprefjp-defined-word" data-desc="関数等の意味論を構成する要素の1つ。Complexity。関数が使うアルゴリズムの空間計算量・時間計算量">計算量</a></h2>
<p><code>n</code> を範囲の要素数とする場合、<code><a href="max.html">max</a>(floor(3(n - 1) / 2), 0)</code> 回の<a class="cpprefjp-defined-word" data-desc="boolを返す関数・関数オブジェクト。predicate">述語</a>適用を行う。</p>
<h2>備考</h2>
<ul>
<li><code>comp</code> は 2 引数の関数オブジェクトで、1 番目の引数が 2 番目の引数「より小さい」場合に <code>true</code> を、そうでない場合に <code>false</code> を返すものとして扱われる。</li>
<li>最小の要素が複数ある場合、<code><a href="min_element.html">min_element</a></code> と同様、最も左側（<code>first</code> に近い方）にある要素を指すイテレータを返す。<br />
一方、最大の要素が複数ある場合、<code><a href="max_element.html">max_element</a></code> と<strong>異なり</strong>、最も右側（<code>last</code> に近い方）にあるイテレータを返す。</li>
<li>最小の要素と最大の要素の両方が必要な場合には、<code><a href="min_element.html">min_element</a></code> と <code><a href="max_element.html">max_element</a></code> をそれぞれ呼び出すよりも本関数を呼び出した方が、<a class="cpprefjp-defined-word" data-desc="関数等の意味論を構成する要素の1つ。Complexity。関数が使うアルゴリズムの空間計算量・時間計算量">計算量</a>の点で効率的である。<br />
ただし、上記の通り最大の要素に関しては <code><a href="max_element.html">max_element</a></code> と結果が異なる可能性があるため、注意する必要がある。</li>
</ul>
<h2>例</h2>
<p><div class="yata" id="ac15f1f02d47055d3a67f5752b02a1515c709682"><div class="codehilite"><pre><span></span><code><span class="cp">#include <a href="../cassert.html"><cassert></a></span>
<span class="cp">#include <a href="../algorithm.html"><algorithm></a></span>
<span class="cp">#include <a href="../vector.html"><vector></a></span>
<span class="kt">int</span><span class="w"> </span><span class="nf">main</span><span class="p">()</span>
<span class="p">{</span>
<span class="w"> </span><span class="n"><a href="../vector/vector.html">std::vector</a></span><span class="o"><</span><span class="kt">int</span><span class="o">></span><span class="w"> </span><span class="n">v</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span><span class="mi">3</span><span class="p">,</span><span class="w"> </span><span class="mi">1</span><span class="p">,</span><span class="w"> </span><span class="mi">4</span><span class="p">};</span>
<span class="w"> </span><span class="k">auto</span><span class="w"> </span><span class="n">i</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n"><span style="color:#ff0000">std::minmax_element</span></span><span class="p">(</span><span class="n"><a href="../vector/vector/begin.html">v.begin()</a></span><span class="p">,</span><span class="w"> </span><span class="n"><a href="../vector/vector/end.html">v.end()</a></span><span class="p">);</span>
<span class="w"> </span><span class="n"><a href="../cassert/assert.html">assert</a></span><span class="p">(</span><span class="n"><a href="../utility/pair/first.html">*i.first</a></span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="mi">1</span><span class="p">);</span>
<span class="w"> </span><span class="n"><a href="../cassert/assert.html">assert</a></span><span class="p">(</span><span class="n"><a href="../utility/pair/second.html">*i.second</a></span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="mi">4</span><span class="p">);</span>
<span class="w"> </span><span class="k">auto</span><span class="w"> </span><span class="n">j</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n"><span style="color:#ff0000">std::minmax_element</span></span><span class="p">(</span><span class="n"><a href="../vector/vector/begin.html">v.begin()</a></span><span class="p">,</span><span class="w"> </span><span class="n"><a href="../vector/vector/end.html">v.end()</a></span><span class="p">,</span><span class="w"> </span><span class="p">[](</span><span class="kt">int</span><span class="w"> </span><span class="n">a</span><span class="p">,</span><span class="w"> </span><span class="kt">int</span><span class="w"> </span><span class="n">b</span><span class="p">)</span><span class="w"> </span><span class="p">{</span>
<span class="w"> </span><span class="k">return</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="o">></span><span class="w"> </span><span class="n">b</span><span class="p">;</span>
<span class="w"> </span><span class="p">});</span>
<span class="w"> </span><span class="n"><a href="../cassert/assert.html">assert</a></span><span class="p">(</span><span class="n"><a href="../utility/pair/first.html">*j.first</a></span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="mi">4</span><span class="p">);</span>
<span class="w"> </span><span class="n"><a href="../cassert/assert.html">assert</a></span><span class="p">(</span><span class="n"><a href="../utility/pair/second.html">*j.second</a></span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="mi">1</span><span class="p">);</span>
<span class="p">}</span>
</code></pre></div>
</div></p>
<h3>出力</h3>
<p><pre><code></code></pre></p>
<h2>実装例</h2>
<p><div class="codehilite"><pre><span></span><code><span class="k">template</span><span class="w"> </span><span class="o"><</span><span class="k">class</span><span class="w"> </span><span class="nc">ForwardIterator</span><span class="p">,</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">Compare</span><span class="o">></span>
<span class="n"><a href="../utility/pair.html">std::pair</a></span><span class="o"><</span><span class="n">ForwardIterator</span><span class="p">,</span><span class="w"> </span><span class="n">ForwardIterator</span><span class="o">></span>
<span class="n">minmax_element</span><span class="p">(</span><span class="n">ForwardIterator</span><span class="w"> </span><span class="n">first</span><span class="p">,</span><span class="w"> </span><span class="n">ForwardIterator</span><span class="w"> </span><span class="n">last</span><span class="p">,</span><span class="w"> </span><span class="n">Compare</span><span class="w"> </span><span class="n">comp</span><span class="p">)</span>
<span class="p">{</span>
<span class="w"> </span><span class="c1">// 結果用オブジェクト</span>
<span class="w"> </span><span class="n"><a href="../utility/pair.html">std::pair</a></span><span class="o"><</span><span class="n">ForwardIterator</span><span class="p">,</span><span class="w"> </span><span class="n">ForwardIterator</span><span class="o">></span><span class="w"> </span><span class="n">result</span><span class="p">(</span><span class="n">first</span><span class="p">,</span><span class="w"> </span><span class="n">first</span><span class="p">);</span>
<span class="w"> </span><span class="c1">// イテレータ範囲の要素数が 0 か 1 だったら、そのまま result を返す</span>
<span class="w"> </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">first</span><span class="w"> </span><span class="o">!=</span><span class="w"> </span><span class="n">last</span><span class="w"> </span><span class="o">&&</span><span class="w"> </span><span class="o">++</span><span class="n">first</span><span class="w"> </span><span class="o">!=</span><span class="w"> </span><span class="n">last</span><span class="p">)</span><span class="w"> </span><span class="p">{</span>
<span class="w"> </span><span class="c1">// 最初の 2 個を比較して、小さい方を .first に、大きい方を .second に設定</span>
<span class="w"> </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">comp</span><span class="p">(</span><span class="o">*</span><span class="n">first</span><span class="p">,</span><span class="w"> </span><span class="o">*</span><span class="n">result</span><span class="p">.</span><span class="n">first</span><span class="p">))</span>
<span class="w"> </span><span class="n">result</span><span class="p">.</span><span class="n">first</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">first</span><span class="p">;</span>
<span class="w"> </span><span class="k">else</span>
<span class="w"> </span><span class="n">result</span><span class="p">.</span><span class="n">second</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">first</span><span class="p">;</span>
<span class="w"> </span><span class="c1">// 残りの要素を 2 個ずつ繰り返し</span>
<span class="w"> </span><span class="k">while</span><span class="w"> </span><span class="p">(</span><span class="o">++</span><span class="n">first</span><span class="w"> </span><span class="o">!=</span><span class="w"> </span><span class="n">last</span><span class="p">)</span><span class="w"> </span><span class="p">{</span>
<span class="w"> </span><span class="n">ForwardIterator</span><span class="w"> </span><span class="n">prev</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">first</span><span class="p">;</span>
<span class="w"> </span><span class="c1">// 残りの要素が 1 個しか無かったら、.first と .second の両方の要素と比較して、</span>
<span class="w"> </span><span class="c1">// 必要に応じて結果を更新後、ループを抜ける</span>
<span class="w"> </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="o">++</span><span class="n">first</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">last</span><span class="p">)</span><span class="w"> </span><span class="p">{</span>
<span class="w"> </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">comp</span><span class="p">(</span><span class="o">*</span><span class="n">prev</span><span class="p">,</span><span class="w"> </span><span class="o">*</span><span class="n">result</span><span class="p">.</span><span class="n">first</span><span class="p">))</span>
<span class="w"> </span><span class="n">result</span><span class="p">.</span><span class="n">first</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">prev</span><span class="p">;</span>
<span class="w"> </span><span class="k">else</span><span class="w"> </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="o">!</span><span class="n">comp</span><span class="p">(</span><span class="o">*</span><span class="n">prev</span><span class="p">,</span><span class="w"> </span><span class="o">*</span><span class="n">result</span><span class="p">.</span><span class="n">second</span><span class="p">))</span>
<span class="w"> </span><span class="n">result</span><span class="p">.</span><span class="n">second</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">prev</span><span class="p">;</span>
<span class="w"> </span><span class="k">break</span><span class="p">;</span>
<span class="w"> </span><span class="p">}</span>
<span class="w"> </span><span class="c1">// 残りの要素が 2 個以上あれば、まずその 2 個を比較してから、小さい方を .first と、</span>
<span class="w"> </span><span class="c1">// 大きい方を .second と比較して、必要に応じて結果を更新</span>
<span class="w"> </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">comp</span><span class="p">(</span><span class="o">*</span><span class="n">first</span><span class="p">,</span><span class="w"> </span><span class="o">*</span><span class="n">prev</span><span class="p">))</span><span class="w"> </span><span class="p">{</span>
<span class="w"> </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">comp</span><span class="p">(</span><span class="o">*</span><span class="n">first</span><span class="p">,</span><span class="w"> </span><span class="o">*</span><span class="n">result</span><span class="p">.</span><span class="n">first</span><span class="p">))</span>
<span class="w"> </span><span class="n">result</span><span class="p">.</span><span class="n">first</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">first</span><span class="p">;</span>
<span class="w"> </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="o">!</span><span class="n">comp</span><span class="p">(</span><span class="o">*</span><span class="n">prev</span><span class="p">,</span><span class="w"> </span><span class="o">*</span><span class="n">result</span><span class="p">.</span><span class="n">second</span><span class="p">))</span>
<span class="w"> </span><span class="n">result</span><span class="p">.</span><span class="n">second</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">prev</span><span class="p">;</span>
<span class="w"> </span><span class="p">}</span><span class="w"> </span><span class="k">else</span><span class="w"> </span><span class="p">{</span>
<span class="w"> </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">comp</span><span class="p">(</span><span class="o">*</span><span class="n">prev</span><span class="p">,</span><span class="w"> </span><span class="o">*</span><span class="n">result</span><span class="p">.</span><span class="n">first</span><span class="p">))</span>
<span class="w"> </span><span class="n">result</span><span class="p">.</span><span class="n">first</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">prev</span><span class="p">;</span>
<span class="w"> </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="o">!</span><span class="n">comp</span><span class="p">(</span><span class="o">*</span><span class="n">first</span><span class="p">,</span><span class="w"> </span><span class="o">*</span><span class="n">result</span><span class="p">.</span><span class="n">second</span><span class="p">))</span>
<span class="w"> </span><span class="n">result</span><span class="p">.</span><span class="n">second</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">first</span><span class="p">;</span>
<span class="w"> </span><span class="p">}</span>
<span class="w"> </span><span class="p">}</span>
<span class="w"> </span><span class="p">}</span>
<span class="w"> </span><span class="k">return</span><span class="w"> </span><span class="n">result</span><span class="p">;</span>
<span class="p">}</span>
<span class="c1">// operator< 用の関数オブジェクト（std::less は特殊化されているかもしれないので）</span>
<span class="k">struct</span><span class="w"> </span><span class="nc">less_inner</span><span class="w"> </span><span class="p">{</span>
<span class="w"> </span><span class="k">template</span><span class="w"> </span><span class="o"><</span><span class="k">class</span><span class="w"> </span><span class="nc">T</span><span class="o">></span>
<span class="w"> </span><span class="kt">bool</span><span class="w"> </span><span class="k">operator</span><span class="p">()(</span><span class="k">const</span><span class="w"> </span><span class="n">T</span><span class="o">&</span><span class="w"> </span><span class="n">lhs</span><span class="p">,</span><span class="w"> </span><span class="k">const</span><span class="w"> </span><span class="n">T</span><span class="o">&</span><span class="w"> </span><span class="n">rhs</span><span class="p">)</span><span class="w"> </span><span class="k">const</span><span class="w"> </span><span class="p">{</span><span class="w"> </span><span class="k">return</span><span class="w"> </span><span class="kt">bool</span><span class="p">(</span><span class="n">lhs</span><span class="w"> </span><span class="o"><</span><span class="w"> </span><span class="n">rhs</span><span class="p">);</span><span class="w"> </span><span class="p">}</span>
<span class="p">};</span>
<span class="k">template</span><span class="w"> </span><span class="o"><</span><span class="k">class</span><span class="w"> </span><span class="nc">ForwardIterator</span><span class="o">></span>
<span class="kr">inline</span><span class="w"> </span><span class="n"><a href="../utility/pair.html">std::pair</a></span><span class="o"><</span><span class="n">ForwardIterator</span><span class="p">,</span><span class="w"> </span><span class="n">ForwardIterator</span><span class="o">></span>
<span class="n">minmax_element</span><span class="p">(</span><span class="n">ForwardIterator</span><span class="w"> </span><span class="n">first</span><span class="p">,</span><span class="w"> </span><span class="n">ForwardIterator</span><span class="w"> </span><span class="n">last</span><span class="p">)</span>
<span class="p">{</span>
<span class="w"> </span><span class="k">return</span><span class="w"> </span><span class="n">std</span><span class="o">::</span><span class="n">minmax_element</span><span class="p">(</span><span class="n">first</span><span class="p">,</span><span class="w"> </span><span class="n">last</span><span class="p">,</span><span class="w"> </span><span class="n">less_inner</span><span class="p">());</span>
<span class="p">}</span>
</code></pre></div>
</p>
<h2>バージョン</h2>
<h3>言語</h3>
<ul>
<li>C++11</li>
</ul>
<h3>処理系</h3>
<ul>
<li><a href="../../implementation.html#clang">Clang</a>: ??</li>
<li><a href="../../implementation.html#gcc">GCC</a>: 4.7.0 <span aria-label="検証済" role="img" title="検証済">✅</span></li>
<li><a href="../../implementation.html#icc">ICC</a>: ??</li>
<li><a href="../../implementation.html#visual_cpp">Visual C++</a>: 2010 <span aria-label="検証済" role="img" title="検証済">✅</span>, 2012 <span aria-label="検証済" role="img" title="検証済">✅</span>, 2013 <span aria-label="検証済" role="img" title="検証済">✅</span>, 2015 <span aria-label="検証済" role="img" title="検証済">✅</span></li>
</ul>
<h2>関連項目</h2>
<ul>
<li><code><a href="ranges_minmax_element.html">ranges::minmax_element</a></code></li>
</ul>
<h2>参照</h2>
<ul>
<li><a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2005/n1840.pdf" target="_blank">N1840 C++0x Proposal: Function template <code>std::minmax</code> and / or algorithm <code>std::minmax_element</code></a></li>
<li><a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2006/n1990.htm" target="_blank">N1990 Proposed Text for <code>minmax</code> (N1840)</a></li>
<li><a href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#715" target="_blank">LWG Issue 715. <code>minmax_element</code> complexity is too lax</a></li>
</ul></div>
</div>
</div>
</div>
<div id="sidebar" class="col-sm-3 col-sm-pull-9">
</div>
</div>
</div>
</main>
<footer class="footer navbar navbar-default">
<div class="container-fluid">
<p><small>
本サイトの情報は、
<a href="https://creativecommons.org/licenses/by/4.0/deed.ja" rel="nofollow">クリエイティブ・コモンズ 表示 4.0 非移植 ライセンス(CC BY)</a>
の下に提供されています。
</small></p>
</div>
</footer>
</body>
</html>