Repository navigation
Expand file tree
/
Copy pathadjacent_difference.html
More file actions
476 lines (404 loc) · 41.8 KB
/
Copy pathadjacent_difference.html
File metadata and controls
476 lines (404 loc) · 41.8 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
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
<!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::adjacent_difference - cpprefjp C++日本語リファレンス</title>
<meta name="viewport" content="width=device-width,initial-scale=1">
<meta name="keywords" content="
C++,標準ライブラリ,リファレンス,ドキュメント,STL,std,numeric,std,function template
">
<meta name="title" content="std::adjacent_difference - cpprefjp C++日本語リファレンス" />
<meta itemprop="name" content="std::adjacent_difference - cpprefjp C++日本語リファレンス" />
<meta property="og:title" content="std::adjacent_difference - cpprefjp C++日本語リファレンス" />
<meta property="og:url" content="https://cpprefjp.github.io/reference/numeric/adjacent_difference.html" />
<meta property="og:site_name" content="cpprefjp - C++日本語リファレンス" />
<meta property="og:type" content="article" />
<meta property="og:description" content="隣接する要素間の差を計算する。" />
<meta property="og:image" content="" />
<meta name="twitter:card" content="summary" />
<meta name="twitter:title" content="std::adjacent_difference - cpprefjp C++日本語リファレンス" />
<meta name="twitter:url" content="https://cpprefjp.github.io/reference/numeric/adjacent_difference.html" />
<meta name="twitter:description" content="隣接する要素間の差を計算する。" />
<meta name="twitter:image" content="" />
<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=807374ab51c48a5ce84749cf2ad281ba69eb3e58">
<link rel="icon" type="image/png" sizes="32x32" href="../../static/favicons/favicon-32x32.png?cachebust=807374ab51c48a5ce84749cf2ad281ba69eb3e58">
<link rel="icon" type="image/png" sizes="16x16" href="../../static/favicons/favicon-16x16.png?cachebust=807374ab51c48a5ce84749cf2ad281ba69eb3e58">
<link rel="manifest" href="../../manifest.json?cachebust=807374ab51c48a5ce84749cf2ad281ba69eb3e58">
<meta name="theme-color" content="#f5f8fc">
<link rel="stylesheet" href="../../static/pygments/default.css?cachebust=807374ab51c48a5ce84749cf2ad281ba69eb3e58">
<!-- <link rel="stylesheet" href="../../static/css/root.css"> -->
<link href="../../static/kunai/css/kunai-stage-0.css?cachebust=807374ab51c48a5ce84749cf2ad281ba69eb3e58" rel="stylesheet">
<link href="../../static/kunai/css/kunai-stage-1.css?cachebust=807374ab51c48a5ce84749cf2ad281ba69eb3e58" rel="stylesheet">
<link href="../../static/kunai/css/kunai-stage-2.css?cachebust=807374ab51c48a5ce84749cf2ad281ba69eb3e58" rel="stylesheet">
<link href="../../static/kunai/css/kunai-stage-3.css?cachebust=807374ab51c48a5ce84749cf2ad281ba69eb3e58" rel="stylesheet">
<script type="text/javascript" src="../../static/kunai/js/kunai-vendor.js?cachebust=807374ab51c48a5ce84749cf2ad281ba69eb3e58"></script>
<script type="text/javascript" src="../../static/kunai/js/kunai.js?cachebust=807374ab51c48a5ce84749cf2ad281ba69eb3e58"></script>
<script type="text/javascript">
document.addEventListener('DOMContentLoaded', function() {
var kn = new Kunai;
kn.cpprefjp();
});
</script>
</head>
<body>
<header data-kunai-mdinfo="{"meta": {"header": ["numeric"], "namespace": ["std"], "id-type": ["function template"]}, "sources": [{"id": "e2c19572467c6008d00435417863ec8296824daa", "source": "#include <iostream>\n#include <numeric>\n#include <vector>\n\ntemplate <class Range>\nvoid print(const Range& r)\n{\n for(const auto& x : r)\n std::cout << x << \" --> \";\n std::cout << \"end\" << std::endl;\n}\n\nint main()\n{\n std::vector<double> v = {0.0, 0.2, 0.4, 0.6, 0.8};\n std::vector<double> diffs(v.size());\n\n // (1) : operator-()\u3092\u4f7f\u7528\u3057\u3066\u3001\u96a3\u63a5\u8981\u7d20\u306e\u5dee\u3092\u8a08\u7b97\u3059\u308b\n std::adjacent_difference(v.cbegin(), v.cend(), diffs.begin());\n print(diffs);\n\n // (2) : \u6700\u5f8c\u306e\u5f15\u6570\u3068\u3057\u3066\u4e0e\u3048\u305f\u4efb\u610f\u306e2\u9805\u6f14\u7b97\u95a2\u6570\u306b\u3088\u3063\u3066\u3001\n // \u96a3\u63a5\u8981\u7d20\u306e\u5dee\u3092\u8a08\u7b97\u3059\u308b\n std::adjacent_difference(v.cbegin(), v.cend(), diffs.begin(),\n [](double a, double b) {\n return a*a - b*b; // 2\u70b9\u9593\u306e\u8ddd\u96e2\u306e\u8a08\u7b97\n });\n print(diffs);\n}\n"}], "page_id": ["reference", "numeric", "adjacent_difference"]}">
<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/numeric.html" itemprop="url">
<span itemprop="name">numeric</span>
</a>
</span>
</li>
<li class="active" itemscope itemtype="http://www.schema.org/SiteNavigationElement">
<span>
<span itemprop="name">adjacent_difference</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>
最終更新日時:
<time itemprop="datePublished" class="js-local-time"
datetime="2026-08-27T11:00:15+09:00">
2026年08月27日 11時00分15秒 (JST)
</time>
<br/>
<span itemprop="author" itemscope itemtype="http://schema.org/Person">
<span itemprop="name">Akira Takahashi</span>
</span>
が更新
</small></p>
<script>
(function () {
// 最終更新日時を閲覧者のローカルタイムゾーンで表示し直す (issue #53 の正規化)。
// JS が無効な環境ではサーバ生成の JST 表記がそのまま残る。
function pad(n) { return (n < 10 ? '0' : '') + n; }
var els = document.querySelectorAll('time.js-local-time[datetime]');
for (var i = 0; i < els.length; i++) {
var el = els[i];
var d = new Date(el.getAttribute('datetime'));
if (isNaN(d.getTime())) { continue; }
var tz = '';
try {
var parts = new Intl.DateTimeFormat(undefined, { timeZoneName: 'short' }).formatToParts(d);
for (var j = 0; j < parts.length; j++) {
if (parts[j].type === 'timeZoneName') { tz = parts[j].value; break; }
}
} catch (e) {}
el.textContent = d.getFullYear() + '年' + pad(d.getMonth() + 1) + '月' + pad(d.getDate()) + '日 '
+ pad(d.getHours()) + '時' + pad(d.getMinutes()) + '分' + pad(d.getSeconds()) + '秒'
+ (tz ? ' (' + tz + ')' : '');
}
})();
</script>
<p class="text-right">
<a class="history" target="_blank" href="https://github.com/cpprefjp/site/commits/master/reference/numeric/adjacent_difference.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/numeric/adjacent_difference.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"><numeric></div><h1 itemprop="name"><span class="namespace" title="namespace std">std::</span><span class="token">adjacent_difference</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="w"> </span><span class="o"><</span><span class="k">class</span><span class="w"> </span><span class="nc">InputIterator</span><span class="p">,</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">OutputIterator</span><span class="o">></span>
<span class="w"> </span><span class="n">OutputIterator</span>
<span class="w"> </span><span class="n">adjacent_difference</span><span class="p">(</span><span class="n">InputIterator</span><span class="w"> </span><span class="n">first</span><span class="p">,</span>
<span class="w"> </span><span class="n">InputIterator</span><span class="w"> </span><span class="n">last</span><span class="p">,</span>
<span class="w"> </span><span class="n">OutputIterator</span><span class="w"> </span><span class="n">result</span><span class="p">);</span><span class="w"> </span><span class="c1">// (1) C++98</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">InputIterator</span><span class="p">,</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">OutputIterator</span><span class="o">></span>
<span class="w"> </span><span class="k">constexpr</span><span class="w"> </span><span class="n">OutputIterator</span>
<span class="w"> </span><span class="n">adjacent_difference</span><span class="p">(</span><span class="n">InputIterator</span><span class="w"> </span><span class="n">first</span><span class="p">,</span>
<span class="w"> </span><span class="n">InputIterator</span><span class="w"> </span><span class="n">last</span><span class="p">,</span>
<span class="w"> </span><span class="n">OutputIterator</span><span class="w"> </span><span class="n">result</span><span class="p">);</span><span class="w"> </span><span class="c1">// (1) C++20</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">InputIterator</span><span class="p">,</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">OutputIterator</span><span class="p">,</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">BinaryOperation</span><span class="o">></span>
<span class="w"> </span><span class="n">OutputIterator</span>
<span class="w"> </span><span class="n">adjacent_difference</span><span class="p">(</span><span class="n">InputIterator</span><span class="w"> </span><span class="n">first</span><span class="p">,</span>
<span class="w"> </span><span class="n">InputIterator</span><span class="w"> </span><span class="n">last</span><span class="p">,</span>
<span class="w"> </span><span class="n">OutputIterator</span><span class="w"> </span><span class="n">result</span><span class="p">,</span>
<span class="w"> </span><span class="n">BinaryOperation</span><span class="w"> </span><span class="n">binary_op</span><span class="p">);</span><span class="w"> </span><span class="c1">// (2) C++98</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">InputIterator</span><span class="p">,</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">OutputIterator</span><span class="p">,</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">BinaryOperation</span><span class="o">></span>
<span class="w"> </span><span class="k">constexpr</span><span class="w"> </span><span class="n">OutputIterator</span>
<span class="w"> </span><span class="n">adjacent_difference</span><span class="p">(</span><span class="n">InputIterator</span><span class="w"> </span><span class="n">first</span><span class="p">,</span>
<span class="w"> </span><span class="n">InputIterator</span><span class="w"> </span><span class="n">last</span><span class="p">,</span>
<span class="w"> </span><span class="n">OutputIterator</span><span class="w"> </span><span class="n">result</span><span class="p">,</span>
<span class="w"> </span><span class="n">BinaryOperation</span><span class="w"> </span><span class="n">binary_op</span><span class="p">);</span><span class="w"> </span><span class="c1">// (2) C++20</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">ForwardIterator1</span><span class="p">,</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">ForwardIterator2</span><span class="o">></span>
<span class="w"> </span><span class="n">ForwardIterator2</span>
<span class="w"> </span><span class="n">adjacent_difference</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">ForwardIterator1</span><span class="w"> </span><span class="n">first</span><span class="p">,</span>
<span class="w"> </span><span class="n">ForwardIterator1</span><span class="w"> </span><span class="n">last</span><span class="p">,</span>
<span class="w"> </span><span class="n">ForwardIterator2</span><span class="w"> </span><span class="n">result</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">ForwardIterator1</span><span class="p">,</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">ForwardIterator2</span><span class="p">,</span>
<span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">BinaryOperation</span><span class="o">></span>
<span class="w"> </span><span class="n">ForwardIterator2</span>
<span class="w"> </span><span class="n">adjacent_difference</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">ForwardIterator1</span><span class="w"> </span><span class="n">first</span><span class="p">,</span>
<span class="w"> </span><span class="n">ForwardIterator1</span><span class="w"> </span><span class="n">last</span><span class="p">,</span>
<span class="w"> </span><span class="n">ForwardIterator2</span><span class="w"> </span><span class="n">result</span><span class="p">,</span>
<span class="w"> </span><span class="n">BinaryOperation</span><span class="w"> </span><span class="n">binary_op</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>隣接する要素間の差を計算する。</p>
<p>この関数に与えられた<a class="cpprefjp-defined-word" data-desc="2つのイテレータで表現される半開区間を表す。C++20からイテレータと番兵で異なる型であっても指定可能になる">イテレータ範囲</a><code>[first, last)</code>を<code>r</code>として、その範囲の隣接する要素同士の差を、<code>{r[0], r[1] - r[0], r[2] - r[1], r[3] - r[2], r[4] - r[3]}</code>のように演算して求められた新たな範囲を返す。</p>
<ul>
<li>(1), (3) : 各隣接要素<code>a</code>と<code>b</code>を<code>operator-(b, a)</code>で減算した結果を、<code>result</code>出力イテレータに書き込む</li>
<li>(2), (4) : 各隣接要素<code>a</code>と<code>b</code>を<code>binary_op(b, a)</code>で減算した結果を、<code>result</code>出力イテレータに書き込む</li>
</ul>
<h2>要件</h2>
<ul>
<li>(2) :<ul>
<li>C++98まで : 関数オブジェクト<code>binary_op</code>の呼び出しは、副作用を起こしてはならない</li>
<li>C++11から : 関数オブジェクト<code>binary_op</code>の呼び出しが、<a class="cpprefjp-defined-word" data-desc="2つのイテレータで表現される半開区間を表す。C++20からイテレータと番兵で異なる型であっても指定可能になる">イテレータ範囲</a><code>[first, last]</code>および<a class="cpprefjp-defined-word" data-desc="2つのイテレータで表現される半開区間を表す。C++20からイテレータと番兵で異なる型であっても指定可能になる">イテレータ範囲</a><code>[result, result + (last - first)]</code>の要素変更、イテレータの無効化をしてはならない</li>
</ul>
</li>
<li>(3), (4) :<ul>
<li><a class="cpprefjp-defined-word" data-desc="2つのイテレータで表現される半開区間を表す。C++20からイテレータと番兵で異なる型であっても指定可能になる">イテレータ範囲</a><code>[first, last)</code>と<a class="cpprefjp-defined-word" data-desc="2つのイテレータで表現される半開区間を表す。C++20からイテレータと番兵で異なる型であっても指定可能になる">イテレータ範囲</a><code>[result, result + (last - first))</code>は重なってはならない</li>
</ul>
</li>
</ul>
<h2><a class="cpprefjp-defined-word" data-desc="関数等の意味論を構成する要素の1つ。Constraints。関数であればオーバーロード解決に参加するための条件、それ以外であれば受け付ける型の条件">テンプレートパラメータ制約</a></h2>
<ul>
<li>(1) :<ul>
<li>C++11から : <code>InputIterator</code>が指す値の型が、<a href="../type_traits/is_move_assignable.html">ムーブ代入可能</a>であり、<code>*first</code>で初期化でき、<code>result</code>出力イテレータに書き込めること</li>
<li>C++11からC++17まで : <code>InputIterator</code>が指す値の型のオブジェクト<code>a</code>と<code>b</code>において、式<code>b - a</code>の結果が<code>result</code>出力イテレータに書き込めること</li>
<li>C++20から : <code>InputIterator</code>が指す値の型のオブジェクト<code>a</code>と<code>b</code>において、式<code>b - <a href="../utility/move.html">std::move</a>(a)</code>の結果が<code>result</code>出力イテレータに書き込めること</li>
</ul>
</li>
<li>(2) <ul>
<li>C++11から : <code>InputIterator</code>が指す値の型が、<a href="../type_traits/is_move_assignable.html">ムーブ代入可能</a>であり、<code>*first</code>で初期化でき、<code>result</code>出力イテレータに書き込めること</li>
<li>C++11からC++17まで : <code>InputIterator</code>が指す値の型のオブジェクト<code>a</code>と<code>b</code>において、式<code>binary_op(b, a)</code>の結果が<code>result</code>出力イテレータに書き込めること</li>
<li>C++20から : <code>InputIterator</code>が指す値の型のオブジェクト<code>a</code>と<code>b</code>において、式<code>binary_op(b, <a href="../utility/move.html">std::move</a>(a))</code>の結果が<code>result</code>出力イテレータに書き込めること</li>
</ul>
</li>
<li>(3) :<ul>
<li>C++17 : <code>ForwardIterator1</code>が指す値の型が、<a href="../type_traits/is_move_assignable.html">ムーブ代入可能</a>であり、<code>*first</code>で初期化でき、<code>ForwardIterator2</code>が指す値の型に対して代入できること。かつ、オブジェクト<code>a</code>と<code>b</code>において式<code>b - a</code>の結果が<code>ForwardIterator2</code>が指す値の型に対して代入できること</li>
<li>C++20から : 式<code>*first</code>、および式<code>*first - *first</code>の結果が、<code>result</code>出力イテレータに書き込めること</li>
</ul>
</li>
<li>(4) :<ul>
<li>C++17 : <code>ForwardIterator1</code>が指す値の型が、<a href="../type_traits/is_move_assignable.html">ムーブ代入可能</a>であり、<code>*first</code>で初期化でき、<code>ForwardIterator2</code>が指す値の型に対して代入できること。かつ、オブジェクト<code>a</code>と<code>b</code>において式<code>binary_op(b, a)</code>の結果が<code>ForwardIterator2</code>が指す値の型に対して代入できること</li>
<li>C++20から : 式<code>*first</code>、および式<code>binary_op(*first, *first)</code>の結果が、<code>result</code>出力イテレータに書き込めること</li>
</ul>
</li>
</ul>
<h2>効果</h2>
<ul>
<li>(1), (2) : 非空の<a class="cpprefjp-defined-word" data-desc="2つのイテレータで表現される半開区間を表す。C++20からイテレータと番兵で異なる型であっても指定可能になる">イテレータ範囲</a><code>[first, last)</code>について、<ol>
<li><code>*result = *first</code>で結果の初期値を書き込む。<code>acc = *first</code>としてひとつ前の位置の値を保持する</li>
<li><a class="cpprefjp-defined-word" data-desc="2つのイテレータで表現される半開区間を表す。C++20からイテレータと番兵で異なる型であっても指定可能になる">イテレータ範囲</a><code>[first + 1, last)</code>の各イテレータを<code>i</code>、そのイテレータが指す値を<code>val</code>として定義する
3.<ul>
<li>C++17 : (1)であれば<code>val - acc</code>、(2)であれば<code>binary_op(val, acc)</code>で隣接値を求めて、その結果を<code>*result</code>に代入する</li>
<li>C++20 : (1)であれば<code>val - <a href="../utility/move.html">std::move</a>(acc)</code>、(2)であれば<code>binary_op(val, <a href="../utility/move.html">std::move</a>d(acc))</code>で隣接値を求めて、その結果を<code>*result</code>に代入する</li>
</ul>
</li>
<li><code>val</code>を<code>acc</code>にムーブ代入し、ひとつ前の位置の値を更新する</li>
</ol>
</li>
<li>(3), (4) : 非空の<a class="cpprefjp-defined-word" data-desc="2つのイテレータで表現される半開区間を表す。C++20からイテレータと番兵で異なる型であっても指定可能になる">イテレータ範囲</a><code>[first, last)</code>について、((3)の場合、<code>binary_op</code>は<code><a href="../functional/minus.html">minus</a><></code>型のオブジェクトとする)<ol>
<li><code>*result = *first</code>を行う</li>
<li>インデックス範囲<code>[1, last - first - 1]</code>のそれぞれの値<code>d</code>について、<code>*(result + d) = binary_op(*(first + d), *(first + (d - 1)))</code>を行う</li>
</ol>
</li>
</ul>
<h2><a class="cpprefjp-defined-word" data-desc="関数呼び出し式の評価結果となるオブジェクト・値">戻り値</a></h2>
<p><div class="codehilite"><pre><span></span><code><span class="n">result</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="p">(</span><span class="n">last</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">first</span><span class="p">)</span>
</code></pre></div>
</p>
<h2><a class="cpprefjp-defined-word" data-desc="関数等の意味論を構成する要素の1つ。Complexity。関数が使うアルゴリズムの空間計算量・時間計算量">計算量</a></h2>
<p>ちょうど<code>max((last - first) - 1, 0)</code>回の2項演算を適用する</p>
<h2>備考</h2>
<ul>
<li>(1), (2) : <code>result</code>は<code>first</code>と同値になるだろう</li>
</ul>
<h2>例</h2>
<p><div class="yata" id="e2c19572467c6008d00435417863ec8296824daa"><div class="codehilite"><pre><span></span><code><span class="cp">#include <a href="../iostream.html"><iostream></a></span>
<span class="cp">#include <a href="../numeric.html"><numeric></a></span>
<span class="cp">#include <a href="../vector.html"><vector></a></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">Range</span><span class="o">></span>
<span class="kt">void</span><span class="w"> </span><span class="n">print</span><span class="p">(</span><span class="k">const</span><span class="w"> </span><span class="n">Range</span><span class="o">&</span><span class="w"> </span><span class="n">r</span><span class="p">)</span>
<span class="p">{</span>
<span class="w"> </span><span class="k">for</span><span class="p">(</span><span class="k">const</span><span class="w"> </span><span class="k">auto</span><span class="o">&</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="o">:</span><span class="w"> </span><span class="n">r</span><span class="p">)</span>
<span class="w"> </span><span class="n"><a href="../iostream/cout.html">std::cout</a></span><span class="w"> </span><span class="o"><<</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="o"><<</span><span class="w"> </span><span class="s">" --> "</span><span class="p">;</span>
<span class="w"> </span><span class="n"><a href="../iostream/cout.html">std::cout</a></span><span class="w"> </span><span class="o"><<</span><span class="w"> </span><span class="s">"end"</span><span class="w"> </span><span class="o"><<</span><span class="w"> </span><span class="n"><a href="../ostream/endl.html">std::endl</a></span><span class="p">;</span>
<span class="p">}</span>
<span class="kt">int</span><span class="w"> </span><span class="n">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">double</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="mf">0.0</span><span class="p">,</span><span class="w"> </span><span class="mf">0.2</span><span class="p">,</span><span class="w"> </span><span class="mf">0.4</span><span class="p">,</span><span class="w"> </span><span class="mf">0.6</span><span class="p">,</span><span class="w"> </span><span class="mf">0.8</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">double</span><span class="o">></span><span class="w"> </span><span class="n">diffs</span><span class="p">(</span><span class="n"><a href="../vector/vector/size.html">v.size()</a></span><span class="p">);</span>
<span class="w"> </span><span class="c1">// (1) : operator-()を使用して、隣接要素の差を計算する</span>
<span class="w"> </span><span class="n"><span style="color:#ff0000">std::adjacent_difference</span></span><span class="p">(</span><span class="n">v</span><span class="p">.</span><span class="n">cbegin</span><span class="p">(),</span><span class="w"> </span><span class="n">v</span><span class="p">.</span><span class="n">cend</span><span class="p">(),</span><span class="w"> </span><span class="n"><a href="../vector/vector/begin.html">diffs.begin()</a></span><span class="p">);</span>
<span class="w"> </span><span class="n">print</span><span class="p">(</span><span class="n">diffs</span><span class="p">);</span>
<span class="w"> </span><span class="c1">// (2) : 最後の引数として与えた任意の2項演算関数によって、</span>
<span class="w"> </span><span class="c1">// 隣接要素の差を計算する</span>
<span class="w"> </span><span class="n"><span style="color:#ff0000">std::adjacent_difference</span></span><span class="p">(</span><span class="n">v</span><span class="p">.</span><span class="n">cbegin</span><span class="p">(),</span><span class="w"> </span><span class="n">v</span><span class="p">.</span><span class="n">cend</span><span class="p">(),</span><span class="w"> </span><span class="n"><a href="../vector/vector/begin.html">diffs.begin()</a></span><span class="p">,</span>
<span class="w"> </span><span class="p">[](</span><span class="kt">double</span><span class="w"> </span><span class="n">a</span><span class="p">,</span><span class="w"> </span><span class="kt">double</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="o">*</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="o">*</span><span class="n">b</span><span class="p">;</span><span class="w"> </span><span class="c1">// 2点間の距離の計算</span>
<span class="w"> </span><span class="p">});</span>
<span class="w"> </span><span class="n">print</span><span class="p">(</span><span class="n">diffs</span><span class="p">);</span>
<span class="p">}</span>
</code></pre></div>
</div></p>
<h3>出力</h3>
<p><pre><code>0 --> 0.2 --> 0.2 --> 0.2 --> 0.2 --> end
0 --> 0.04 --> 0.12 --> 0.2 --> 0.28 --> end
</code></pre></p>
<h2>実装例</h2>
<p><div class="codehilite"><pre><span></span><code><span class="cp">#include <a href="../iterator.html"><iterator></a></span>
<span class="cp">#include <a href="../functional.html"><functional></a></span>
<span class="c1">// (2)</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">InputIterator</span><span class="p">,</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">OutputIterator</span><span class="p">,</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">BinaryOperation</span><span class="o">></span>
<span class="n">OutputIterator</span><span class="w"> </span><span class="n">adjacent_difference</span><span class="p">(</span><span class="n">InputIterator</span><span class="w"> </span><span class="n">first</span><span class="p">,</span>
<span class="w"> </span><span class="n">InputIterator</span><span class="w"> </span><span class="n">last</span><span class="p">,</span>
<span class="w"> </span><span class="n">OutputIterator</span><span class="w"> </span><span class="n">result</span><span class="p">,</span>
<span class="w"> </span><span class="n">BinaryOperation</span><span class="w"> </span><span class="n">binary_op</span><span class="p">)</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">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="k">return</span><span class="w"> </span><span class="n">result</span><span class="p">;</span>
<span class="w"> </span><span class="k">using</span><span class="w"> </span><span class="n">value_type</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="k">typename</span><span class="w"> </span><span class="nc"><a href="../iterator/iterator_traits.html">std::iterator_traits</a></span><span class="o"><</span><span class="n">InputIterator</span><span class="o">>::</span><span class="n">value_type</span><span class="p">;</span>
<span class="w"> </span><span class="n">value_type</span><span class="w"> </span><span class="n">acc</span><span class="w"> </span><span class="o">=</span><span class="w"> </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="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">acc</span><span class="p">;</span>
<span class="w"> </span><span class="o">++</span><span class="n">result</span><span class="p">;</span>
<span class="w"> </span><span class="o">++</span><span class="n">first</span><span class="p">;</span>
<span class="w"> </span><span class="k">while</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="p">)</span><span class="w"> </span><span class="p">{</span>
<span class="w"> </span><span class="n">value_type</span><span class="w"> </span><span class="n">val</span><span class="w"> </span><span class="o">=</span><span class="w"> </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="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">binary_op</span><span class="p">(</span><span class="n">val</span><span class="p">,</span><span class="w"> </span><span class="n"><a href="../utility/move.html">std::move</a></span><span class="p">(</span><span class="n">acc</span><span class="p">));</span>
<span class="w"> </span><span class="n">acc</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n"><a href="../utility/move.html">std::move</a></span><span class="p">(</span><span class="n">val</span><span class="p">);</span>
<span class="w"> </span><span class="o">++</span><span class="n">result</span><span class="p">;</span>
<span class="w"> </span><span class="o">++</span><span class="n">first</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">// (1)</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">InputIterator</span><span class="p">,</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">OutputIterator</span><span class="o">></span>
<span class="n">OutputIterator</span><span class="w"> </span><span class="n">adjacent_difference</span><span class="p">(</span><span class="n">InputIterator</span><span class="w"> </span><span class="n">first</span><span class="p">,</span><span class="w"> </span><span class="n">InputIterator</span><span class="w"> </span><span class="n">last</span><span class="p">,</span><span class="w"> </span><span class="n">OutputIterator</span><span class="w"> </span><span class="n">result</span><span class="p">)</span>
<span class="p">{</span>
<span class="w"> </span><span class="k">using</span><span class="w"> </span><span class="n">value_type</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="k">typename</span><span class="w"> </span><span class="nc"><a href="../iterator/iterator_traits.html">std::iterator_traits</a></span><span class="o"><</span><span class="n">InputIterator</span><span class="o">>::</span><span class="n">value_type</span><span class="p">;</span>
<span class="w"> </span><span class="k">return</span><span class="w"> </span><span class="n">adjacent_difference</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">result</span><span class="p">,</span><span class="w"> </span><span class="n"><a href="../functional/minus.html">std::minus</a></span><span class="o"><</span><span class="n">value_type</span><span class="o">></span><span class="p">());</span>
<span class="p">}</span>
</code></pre></div>
</p>
<h2>参照</h2>
<ul>
<li><a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2017/p0467r2.html" target="_blank">P0467R2 Iterator Concerns for Parallel Algorithms</a></li>
<li><a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2017/p0623r0.html" target="_blank">P0623R0 Final C++17 Parallel Algorithms Fixes</a></li>
<li><a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2017/p0616r0.pdf" target="_blank">P0616R0 De-pessimize legacy <code><numeric></code> algorithms with <code>std::move</code></a></li>
<li><a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2019/p1645r1.html" target="_blank">P1645R1 <code>constexpr</code> for <code><numeric></code> algorithms</a><ul>
<li>C++20で、並列バージョン以外の数値計算アルゴリズムが<code>constexpr</code>対応した</li>
</ul>
</li>
<li><a href="https://cplusplus.github.io/LWG/issue539" target="_blank">LWG Issue 539. <code>partial_sum</code> and <code>adjacent_difference</code> should mention requirements</a><ul>
<li>C++11で、アキュムレータを用いた効果の規定へ整理され、要件が明記された。あわせて<a class="cpprefjp-defined-word" data-desc="関数等の意味論を構成する要素の1つ。Complexity。関数が使うアルゴリズムの空間計算量・時間計算量">計算量</a>が<code>max((last - first) - 1, 0)</code>となり、空の範囲に対して負の回数とならないよう修正された(編集上の誤りの訂正であり、実際の挙動は変わらない)</li>
</ul>
</li>
<li><a href="https://cplusplus.github.io/LWG/issue3058" target="_blank">LWG Issue 3058. Parallel <code>adjacent_difference</code> shouldn't require creating temporaries</a><ul>
<li>C++20で、並列版(3), (4)の効果から中間一時オブジェクトの生成要求が取り除かれ、要件も結果が<code>result</code>に書き込み可能であることへ整理された</li>
</ul>
</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>

