-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathtransform_inclusive_scan.html
More file actions
432 lines (364 loc) · 39.7 KB
/
transform_inclusive_scan.html
File metadata and controls
432 lines (364 loc) · 39.7 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
<!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>transform_inclusive_scan - cpprefjp C++日本語リファレンス</title>
<meta name="viewport" content="width=device-width,initial-scale=1">
<meta name="keywords" content="
C++,標準ライブラリ,リファレンス,ドキュメント,STL,std,numeric,std,function template,cpp17
">
<meta name="title" content="transform_inclusive_scan - cpprefjp C++日本語リファレンス" />
<meta itemprop="name" content="transform_inclusive_scan - cpprefjp C++日本語リファレンス" />
<meta property="og:title" content="transform_inclusive_scan - cpprefjp C++日本語リファレンス" />
<meta property="og:url" content="https://cpprefjp.github.io/reference/numeric/transform_inclusive_scan.html" />
<meta property="og:site_name" content="cpprefjp - C++日本語リファレンス" />
<meta property="og:type" content="article" />
<meta property="og:description" content="イテレータ範囲`[first, last)`の要素を変換しながら部分和を計算する。この関数は、i番目の部分和を求める際にi番目の要素を含め、範囲`[0, i]`までの部分和を計算する。" />
<meta name="twitter:card" content="summary" />
<meta name="twitter:title" content="transform_inclusive_scan - cpprefjp C++日本語リファレンス" />
<meta name="twitter:url" content="https://cpprefjp.github.io/reference/numeric/transform_inclusive_scan.html" />
<meta name="twitter:description" content="イテレータ範囲`[first, last)`の要素を変換しながら部分和を計算する。この関数は、i番目の部分和を求める際にi番目の要素を含め、範囲`[0, i]`までの部分和を計算する。" />
<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=be86fa2321ebe02b6955b61b98b778e377bcbf95">
<link rel="icon" type="image/png" sizes="32x32" href="../../static/favicons/favicon-32x32.png?cachebust=be86fa2321ebe02b6955b61b98b778e377bcbf95">
<link rel="icon" type="image/png" sizes="16x16" href="../../static/favicons/favicon-16x16.png?cachebust=be86fa2321ebe02b6955b61b98b778e377bcbf95">
<link rel="manifest" href="../../manifest.json?cachebust=be86fa2321ebe02b6955b61b98b778e377bcbf95">
<meta name="theme-color" content="#f5f8fc">
<link rel="stylesheet" href="../../static/pygments/default.css?cachebust=be86fa2321ebe02b6955b61b98b778e377bcbf95">
<!-- <link rel="stylesheet" href="../../static/css/root.css"> -->
<link href="../../static/kunai/css/kunai-stage-0.css?cachebust=be86fa2321ebe02b6955b61b98b778e377bcbf95" rel="stylesheet">
<link href="../../static/kunai/css/kunai-stage-1.css?cachebust=be86fa2321ebe02b6955b61b98b778e377bcbf95" rel="stylesheet">
<link href="../../static/kunai/css/kunai-stage-2.css?cachebust=be86fa2321ebe02b6955b61b98b778e377bcbf95" rel="stylesheet">
<link href="../../static/kunai/css/kunai-stage-3.css?cachebust=be86fa2321ebe02b6955b61b98b778e377bcbf95" rel="stylesheet">
<script type="text/javascript" src="../../static/kunai/js/kunai-vendor.js?cachebust=be86fa2321ebe02b6955b61b98b778e377bcbf95"></script>
<script type="text/javascript" src="../../static/kunai/js/kunai.js?cachebust=be86fa2321ebe02b6955b61b98b778e377bcbf95"></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"], "cpp": ["cpp17"]}, "sources": [{"id": "0d067e43fa775f9ae9da08338935288587ed0e66", "source": "#include <iostream>\n#include <vector>\n#include <string>\n#include <numeric>\n\nint main()\n{\n // (1)\n {\n std::vector<int> v = {1, 2, 3, 4, 5};\n std::vector<int> result(v.size());\n\n // result[0] = 1*10\n // result[1] = 1*10 + 2*10\n // result[2] = 1*10 + 2*10 + 3*10\n // result[3] = 1*10 + 2*10 + 3*10 + 4*10\n // result[4] = 1*10 + 2*10 + 3*10 + 4*10 + 5*10\n std::transform_inclusive_scan(v.begin(), v.end(), result.begin(),\n [](int a, int b) { return a + b; },\n [](int x) { return x * 10; }); // \u5909\u63db\u95a2\u6570\u3067\u578b\u5909\u63db\u306f\u3067\u304d\u306a\u3044\n\n for (int x : result) {\n std::cout << x << ' ';\n }\n std::cout << std::endl;\n }\n\n // (2)\n {\n std::vector<std::string> v = {\"1\", \"2\", \"3\", \"4\", \"5\"};\n std::vector<int> result(v.size());\n\n // result[0] = 0 + stoi(\"1\")\n // result[1] = 0 + stoi(\"1\") + stoi(\"2\")\n // result[2] = 0 + stoi(\"1\") + stoi(\"2\") + stoi(\"3\")\n // result[3] = 0 + stoi(\"1\") + stoi(\"2\") + stoi(\"3\") + stoi(\"4\")\n // result[4] = 0 + stoi(\"1\") + stoi(\"2\") + stoi(\"3\") + stoi(\"4\") + stoi(\"5\")\n std::transform_inclusive_scan(v.begin(), v.end(), result.begin(),\n [](int a, int b) { return a + b; },\n [](const std::string& s) { return std::stoi(s); },\n 0);\n\n for (int x : result) {\n std::cout << x << ' ';\n }\n std::cout << std::endl;\n }\n}\n"}], "page_id": ["reference", "numeric", "transform_inclusive_scan"]}">
<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">transform_inclusive_scan</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="2024-06-11T13:45:38">
2024年06月11日 13時45分38秒
</span>
<br/>
<span itemprop="author" itemscope itemtype="http://schema.org/Person">
<span itemprop="name">Akira Takahashi</span>
</span>
が更新
</small></p>
<p class="text-right">
<a class="history" target="_blank" href="https://github.com/cpprefjp/site/commits/master/reference/numeric/transform_inclusive_scan.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/transform_inclusive_scan.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">transform_inclusive_scan</span><span class="cpp cpp17" title="C++17で追加">(C++17)</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="p">,</span>
<span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">BinaryOperation</span><span class="p">,</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">UnaryOperation</span><span class="o">></span>
<span class="w"> </span><span class="n">OutputIterator</span>
<span class="w"> </span><span class="n">transform_inclusive_scan</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="n">UnaryOperation</span><span class="w"> </span><span class="n">unary_op</span><span class="p">);</span><span class="w"> </span><span class="c1">// (1) 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">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="p">,</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">UnaryOperation</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">transform_inclusive_scan</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="n">UnaryOperation</span><span class="w"> </span><span class="n">unary_op</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="p">,</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">UnaryOperation</span><span class="p">,</span><span class="w"> </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="n">OutputIterator</span>
<span class="w"> </span><span class="n">transform_inclusive_scan</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="n">UnaryOperation</span><span class="w"> </span><span class="n">unary_op</span><span class="p">,</span>
<span class="w"> </span><span class="n">T</span><span class="w"> </span><span class="n">init</span><span class="p">);</span><span class="w"> </span><span class="c1">// (2) 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">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="p">,</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">UnaryOperation</span><span class="p">,</span><span class="w"> </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="k">constexpr</span><span class="w"> </span><span class="n">OutputIterator</span>
<span class="w"> </span><span class="n">transform_inclusive_scan</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="n">UnaryOperation</span><span class="w"> </span><span class="n">unary_op</span><span class="p">,</span>
<span class="w"> </span><span class="n">T</span><span class="w"> </span><span class="n">init</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="p">,</span>
<span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">BinaryOperation</span><span class="p">,</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">UnaryOperation</span><span class="o">></span>
<span class="w"> </span><span class="n">ForwardIterator2</span>
<span class="w"> </span><span class="n">transform_inclusive_scan</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="n">UnaryOperation</span><span class="w"> </span><span class="n">unary_op</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="p">,</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">UnaryOperation</span><span class="p">,</span><span class="w"> </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="n">ForwardIterator2</span>
<span class="w"> </span><span class="n">transform_inclusive_scan</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="n">UnaryOperation</span><span class="w"> </span><span class="n">unary_op</span><span class="p">,</span>
<span class="w"> </span><span class="n">T</span><span class="w"> </span><span class="n">init</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>の要素を変換しながら部分和を計算する。この関数は、i番目の部分和を求める際にi番目の要素を含め、範囲<code>[0, i]</code>までの部分和を計算する。</p>
<p><code>transform_inclusive_scan()</code>の引数として、初期値<code>0</code>、シーケンス<code>{1, 2, 3}</code>が与えられ、和に相当する二項演算関数オブジェクト<code>binary_op</code>を<code>operator+</code>、要素変換の関数オブジェクト<code>unary_op</code>をパラメータをそのまま返す関数<code>f()</code>であるとして、以下のような結果が行われる：</p>
<p><div class="codehilite"><pre><span></span><code><span class="p">{</span>
<span class="w"> </span><span class="mi">1</span><span class="p">,</span><span class="w"> </span><span class="c1">// (0 + ) f(1)</span>
<span class="w"> </span><span class="mi">3</span><span class="p">,</span><span class="w"> </span><span class="c1">// (0 + ) f(1) + f(2)</span>
<span class="w"> </span><span class="mi">6</span><span class="w"> </span><span class="c1">// (0 + ) f(1) + f(2) + f(3)</span>
<span class="p">}</span>
</code></pre></div>
</p>
<p>初期値が与えられない場合、その演算は行われない (初期値の代わりにイテレータの要素型を<a class="cpprefjp-defined-word" data-desc="値初期化。`T x{};`構文での初期化。組み込み型の場合はゼロ相当の値で、クラス型の場合はデフォルトコンストラクタで初期化する。配列型の場合は各要素が再帰的に値初期化される">値構築</a>した値を使用したりはしない)。</p>
<ul>
<li>(1) : 二項演算として任意の関数オブジェクト<code>binary_op</code>、要素を変換する関数オブジェクト<code>unary_op</code>を使用して部分和を求める</li>
<li>(2) : 初期値を<code>init</code>、二項演算として任意の関数オブジェクト<code>binary_op</code>、要素を変換する関数オブジェクト<code>unary_op</code>を使用して部分和を求める</li>
<li>(3) : (1)の並列アルゴリズム版。第1パラメータとして実行ポリシーをとる</li>
<li>(4) : (2)の並列アルゴリズム版。第1パラメータとして実行ポリシーをとる</li>
</ul>
<h2>要件</h2>
<ul>
<li>(1), (2), (3), (4) : 関数オブジェクト<code>unary_op</code>と<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>
<h2><a class="cpprefjp-defined-word" data-desc="関数等の意味論を構成する要素の1つ。Constraints。関数であればオーバーロード解決に参加するための条件、それ以外であれば受け付ける型の条件">テンプレートパラメータ制約</a></h2>
<ul>
<li>(1), (3) : <code>ForwardIterator</code>の要素型が<code><a href="../concepts/move_constructible.html">std::move_constructible</a></code>要件を満たすこと</li>
<li>(2), (4) : 型<code>T</code>が<code><a href="../concepts/move_constructible.html">std::move_constructible</a></code>要件を満たすこと</li>
<li>(1), (3) : 以下の全ての演算結果の型が、<code>ForwardIterator</code>の要素型に変換可能であること<ul>
<li><code>binary_op(unary_op(*first), unary_op(*first))</code></li>
</ul>
</li>
<li>(2), (4) : 以下の全ての演算結果の型が、型<code>T</code>に変換可能であること<ul>
<li><code>binary_op(init, init)</code></li>
<li><code>binary_op(init, unary_op(*first))</code></li>
<li><code>binary_op(unary_op(*first), unary_op(*first))</code></li>
</ul>
</li>
</ul>
<h2>効果</h2>
<ul>
<li>(1), (3) : 範囲<code>[0, last - first)</code>の各値を<code>K</code>として、出力先のイテレータ<code>result + K</code>に、<code>{unary_op(*first), unary_op(*(first + 1)), unary_op(*(first + 2)), ..., unary_op(*(last - 1))}</code>の<code>K</code>番目までの要素の合計値を順不同に代入する</li>
<li>(2), (4) : 範囲<code>[0, last - first)</code>の各値を<code>K</code>として、出力先のイテレータ<code>result + K</code>に、初期値を<code>init</code>として<code>{unary_op(*first), unary_op(*(first + 1)), unary_op(*(first + 2)), ..., unary_op(*(last - 1))}</code>の<code>K</code>番目までの要素の合計値を順不同に代入する</li>
</ul>
<h2><a class="cpprefjp-defined-word" data-desc="関数呼び出し式の評価結果となるオブジェクト・値">戻り値</a></h2>
<p>結果範囲の末尾イテレータを返す</p>
<h2><a class="cpprefjp-defined-word" data-desc="関数等の意味論を構成する要素の1つ。Complexity。関数が使うアルゴリズムの空間計算量・時間計算量">計算量</a></h2>
<p>関数オブジェクト<code>unary_op</code>と<code>binary_op</code>をO(<code>last - first</code>)回だけ適用する</p>
<h2>備考</h2>
<ul>
<li>(1), (2), (3), (4) :<ul>
<li><code>result</code>は<code>first</code>と同値になるだろう</li>
<li>関数オブジェクト<code>binary_op</code>に数学的な結合性がない場合、この関数は非決定的な動作になる可能性がある</li>
</ul>
</li>
<li>(2), (4) : 関数オブジェクト<code>unary_op</code>は初期値<code>init</code>に対しては適用しない</li>
</ul>
<h2>例</h2>
<p><div class="yata" id="0d067e43fa775f9ae9da08338935288587ed0e66"><div class="codehilite"><pre><span></span><code><span class="cp">#include <a href="../iostream.html"><iostream></a></span>
<span class="cp">#include <a href="../vector.html"><vector></a></span>
<span class="cp">#include <a href="../string.html"><string></a></span>
<span class="cp">#include <a href="../numeric.html"><numeric></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="c1">// (1)</span>
<span class="w"> </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">1</span><span class="p">,</span><span class="w"> </span><span class="mi">2</span><span class="p">,</span><span class="w"> </span><span class="mi">3</span><span class="p">,</span><span class="w"> </span><span class="mi">4</span><span class="p">,</span><span class="w"> </span><span class="mi">5</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">result</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">// result[0] = 1*10</span>
<span class="w"> </span><span class="c1">// result[1] = 1*10 + 2*10</span>
<span class="w"> </span><span class="c1">// result[2] = 1*10 + 2*10 + 3*10</span>
<span class="w"> </span><span class="c1">// result[3] = 1*10 + 2*10 + 3*10 + 4*10</span>
<span class="w"> </span><span class="c1">// result[4] = 1*10 + 2*10 + 3*10 + 4*10 + 5*10</span>
<span class="w"> </span><span class="n"><span style="color:#ff0000">std::transform_inclusive_scan</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="../vector/vector/begin.html">result.begin()</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="p">[](</span><span class="kt">int</span><span class="w"> </span><span class="n">x</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">x</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="mi">10</span><span class="p">;</span><span class="w"> </span><span class="p">});</span><span class="w"> </span><span class="c1">// 変換関数で型変換はできない</span>
<span class="w"> </span><span class="k">for</span><span class="w"> </span><span class="p">(</span><span class="kt">int</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">result</span><span class="p">)</span><span class="w"> </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="sc">' '</span><span class="p">;</span>
<span class="w"> </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"><a href="../ostream/endl.html">std::endl</a></span><span class="p">;</span>
<span class="w"> </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"><a href="../vector/vector.html">std::vector</a></span><span class="o"><</span><span class="n"><a href="../string/basic_string.html">std::string</a></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="s">"1"</span><span class="p">,</span><span class="w"> </span><span class="s">"2"</span><span class="p">,</span><span class="w"> </span><span class="s">"3"</span><span class="p">,</span><span class="w"> </span><span class="s">"4"</span><span class="p">,</span><span class="w"> </span><span class="s">"5"</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">result</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">// result[0] = 0 + stoi("1")</span>
<span class="w"> </span><span class="c1">// result[1] = 0 + stoi("1") + stoi("2")</span>
<span class="w"> </span><span class="c1">// result[2] = 0 + stoi("1") + stoi("2") + stoi("3")</span>
<span class="w"> </span><span class="c1">// result[3] = 0 + stoi("1") + stoi("2") + stoi("3") + stoi("4")</span>
<span class="w"> </span><span class="c1">// result[4] = 0 + stoi("1") + stoi("2") + stoi("3") + stoi("4") + stoi("5")</span>
<span class="w"> </span><span class="n"><span style="color:#ff0000">std::transform_inclusive_scan</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="../vector/vector/begin.html">result.begin()</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="p">[](</span><span class="k">const</span><span class="w"> </span><span class="n"><a href="../string/basic_string.html">std::string</a></span><span class="o">&</span><span class="w"> </span><span class="n">s</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 href="../string/stoi.html">std::stoi</a></span><span class="p">(</span><span class="n">s</span><span class="p">);</span><span class="w"> </span><span class="p">},</span>
<span class="w"> </span><span class="mi">0</span><span class="p">);</span>
<span class="w"> </span><span class="k">for</span><span class="w"> </span><span class="p">(</span><span class="kt">int</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">result</span><span class="p">)</span><span class="w"> </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="sc">' '</span><span class="p">;</span>
<span class="w"> </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"><a href="../ostream/endl.html">std::endl</a></span><span class="p">;</span>
<span class="w"> </span><span class="p">}</span>
<span class="p">}</span>
</code></pre></div>
</div></p>
<h3>出力</h3>
<p><pre><code>10 30 60 100 150
1 3 6 10 15
</code></pre></p>
<h2>バージョン</h2>
<h3>言語</h3>
<ul>
<li>C++17</li>
</ul>
<h3>処理系</h3>
<ul>
<li><a href="../../implementation.html#clang">Clang</a>: 7.0 <span aria-label="検証済" role="img" title="検証済">✅</span></li>
<li><a href="../../implementation.html#gcc">GCC</a>:</li>
<li><a href="../../implementation.html#visual_cpp">Visual C++</a>: ??</li>
</ul>
<h2>参照</h2>
<ul>
<li><a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2016/p0024r2.html" target="_blank">P0024R2 The Parallelism TS Should be Standardized</a></li>
<li><a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2017/p0452r1.html" target="_blank">P0452R1 Unifying <code><numeric></code> Parallel Algorithms</a></li>
<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/p0574r1.html" target="_blank">P0574R1: Algorithm Complexity Constraints and Parallel Overloads</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>
</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>