-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathinsert.html
More file actions
578 lines (499 loc) · 48.2 KB
/
Copy pathinsert.html
File metadata and controls
578 lines (499 loc) · 48.2 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
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
<!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::flat_map::insert - cpprefjp C++日本語リファレンス</title>
<meta name="viewport" content="width=device-width,initial-scale=1">
<meta name="keywords" content="
C++,標準ライブラリ,リファレンス,ドキュメント,STL,std,flat_map,std,flat_map,function,cpp23
">
<meta name="title" content="std::flat_map::insert - cpprefjp C++日本語リファレンス" />
<meta itemprop="name" content="std::flat_map::insert - cpprefjp C++日本語リファレンス" />
<meta property="og:title" content="std::flat_map::insert - cpprefjp C++日本語リファレンス" />
<meta property="og:url" content="https://cpprefjp.github.io/reference/flat_map/flat_map/insert.html" />
<meta property="og:site_name" content="cpprefjp - C++日本語リファレンス" />
<meta property="og:type" content="article" />
<meta property="og:description" content="新しく一つの要素(引数 `x` を使う)または要素のシーケンス(入力イテレータまたは `initializer_list` を使う)を挿入し、コンテナを拡張する。" />
<meta name="twitter:card" content="summary" />
<meta name="twitter:title" content="std::flat_map::insert - cpprefjp C++日本語リファレンス" />
<meta name="twitter:url" content="https://cpprefjp.github.io/reference/flat_map/flat_map/insert.html" />
<meta name="twitter:description" content="新しく一つの要素(引数 `x` を使う)または要素のシーケンス(入力イテレータまたは `initializer_list` を使う)を挿入し、コンテナを拡張する。" />
<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=557cd0469f26f0f797224f46d1b6e764266f07cc">
<link rel="icon" type="image/png" sizes="32x32" href="../../../static/favicons/favicon-32x32.png?cachebust=557cd0469f26f0f797224f46d1b6e764266f07cc">
<link rel="icon" type="image/png" sizes="16x16" href="../../../static/favicons/favicon-16x16.png?cachebust=557cd0469f26f0f797224f46d1b6e764266f07cc">
<link rel="manifest" href="../../../manifest.json?cachebust=557cd0469f26f0f797224f46d1b6e764266f07cc">
<meta name="theme-color" content="#f5f8fc">
<link rel="stylesheet" href="../../../static/pygments/default.css?cachebust=557cd0469f26f0f797224f46d1b6e764266f07cc">
<!-- <link rel="stylesheet" href="../../../static/css/root.css"> -->
<link href="../../../static/kunai/css/kunai-stage-0.css?cachebust=557cd0469f26f0f797224f46d1b6e764266f07cc" rel="stylesheet">
<link href="../../../static/kunai/css/kunai-stage-1.css?cachebust=557cd0469f26f0f797224f46d1b6e764266f07cc" rel="stylesheet">
<link href="../../../static/kunai/css/kunai-stage-2.css?cachebust=557cd0469f26f0f797224f46d1b6e764266f07cc" rel="stylesheet">
<link href="../../../static/kunai/css/kunai-stage-3.css?cachebust=557cd0469f26f0f797224f46d1b6e764266f07cc" rel="stylesheet">
<script type="text/javascript" src="../../../static/kunai/js/kunai-vendor.js?cachebust=557cd0469f26f0f797224f46d1b6e764266f07cc"></script>
<script type="text/javascript" src="../../../static/kunai/js/kunai.js?cachebust=557cd0469f26f0f797224f46d1b6e764266f07cc"></script>
<script type="text/javascript">
document.addEventListener('DOMContentLoaded', function() {
var kn = new Kunai;
kn.cpprefjp();
});
</script>
</head>
<body>
<header data-kunai-mdinfo="{"meta": {"header": ["flat_map"], "namespace": ["std"], "class": ["flat_map"], "id-type": ["function"], "cpp": ["cpp23"]}, "sources": [{"id": "19ee539a5ee963aab4bb49f6b87ec93d388de040", "source": "#include <iostream>\n#include <flat_map>\n#include <utility>\n\nint main()\n{\n std::flat_map<int, char> fm;\n\n // \u5358\u4e00\u8981\u7d20\u3092\u633f\u5165\u3059\u308b\n fm.insert(std::pair{3, 'a'});\n fm.insert({3, 'a'});\n\n std::flat_map<int, char> fm2 = {\n {5, 'd'},\n {15, 'e'}\n };\n\n // \u30b7\u30fc\u30b1\u30f3\u30b9\u3092\u633f\u5165\u3059\u308b\n fm.insert(fm2.begin(), fm2.end());\n\n // \u633f\u5165\u3059\u308b\u30b7\u30fc\u30b1\u30f3\u30b9\u304c\u30bd\u30fc\u30c8\u6e08\u307f\u304b\u3064\u91cd\u8907\u8981\u7d20\u304c\u306a\u3044\u3053\u3068\u304c\u308f\u304b\u3063\u3066\u3044\u308b\u5834\u5408\u3001\n // \u4ee5\u4e0b\u306e\u3088\u3046\u306b\u6307\u5b9a\u3057\u305f\u65b9\u304c\u9ad8\u901f\u306b\u306a\u308b\n fm.insert(std::sorted_unique, fm2.begin(), fm2.end());\n\n for (const auto& [key, value] : fm) {\n std::cout << key << \" : \" << value << std::endl;\n }\n}\n"}], "page_id": ["reference", "flat_map", "flat_map", "insert"]}">
<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/flat_map.html" itemprop="url">
<span itemprop="name">flat_map</span>
</a>
</span>
</li>
<li itemscope itemtype="http://www.schema.org/SiteNavigationElement">
<span>
<a href="../../../reference/flat_map/flat_map.html" itemprop="url">
<span itemprop="name">flat_map</span>
</a>
</span>
</li>
<li class="active" itemscope itemtype="http://www.schema.org/SiteNavigationElement">
<span>
<span itemprop="name">insert</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-07-22T16:08:23+09:00">
2026年07月22日 16時08分23秒 (JST)
</time>
<br/>
<span itemprop="author" itemscope itemtype="http://schema.org/Person">
<span itemprop="name">rotarymars</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/flat_map/flat_map/insert.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/flat_map/flat_map/insert.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</div><div class="header"><flat_map></div><h1 itemprop="name"><span class="namespace" title="namespace std">std::</span><span class="class" title="class flat_map">flat_map::</span><span class="token">insert</span><span class="cpp cpp23" title="C++23で追加">(C++23)</span></h1>
<div itemprop="articleBody"><p><div class="codehilite"><pre><span></span><code><span class="n"><a href="../../utility/pair.html">pair</a></span><span class="o"><</span><span class="n">iterator</span><span class="p">,</span><span class="w"> </span><span class="kt">bool</span><span class="o">></span>
<span class="w"> </span><span class="n">insert</span><span class="p">(</span><span class="k">const</span><span class="w"> </span><span class="n">value_type</span><span class="o">&</span><span class="w"> </span><span class="n">x</span><span class="p">);</span><span class="w"> </span><span class="c1">// (1) C++23</span>
<span class="k">constexpr</span><span class="w"> </span><span class="n"><a href="../../utility/pair.html">pair</a></span><span class="o"><</span><span class="n">iterator</span><span class="p">,</span><span class="w"> </span><span class="kt">bool</span><span class="o">></span>
<span class="w"> </span><span class="n">insert</span><span class="p">(</span><span class="k">const</span><span class="w"> </span><span class="n">value_type</span><span class="o">&</span><span class="w"> </span><span class="n">x</span><span class="p">);</span><span class="w"> </span><span class="c1">// (1) C++26</span>
<span class="n"><a href="../../utility/pair.html">pair</a></span><span class="o"><</span><span class="n">iterator</span><span class="p">,</span><span class="w"> </span><span class="kt">bool</span><span class="o">></span>
<span class="w"> </span><span class="n">insert</span><span class="p">(</span><span class="n">value_type</span><span class="o">&&</span><span class="w"> </span><span class="n">x</span><span class="p">);</span><span class="w"> </span><span class="c1">// (2) C++23</span>
<span class="k">constexpr</span><span class="w"> </span><span class="n"><a href="../../utility/pair.html">pair</a></span><span class="o"><</span><span class="n">iterator</span><span class="p">,</span><span class="w"> </span><span class="kt">bool</span><span class="o">></span>
<span class="w"> </span><span class="n">insert</span><span class="p">(</span><span class="n">value_type</span><span class="o">&&</span><span class="w"> </span><span class="n">x</span><span class="p">);</span><span class="w"> </span><span class="c1">// (2) C++26</span>
<span class="n">iterator</span>
<span class="w"> </span><span class="nf">insert</span><span class="p">(</span><span class="n">const_iterator</span><span class="w"> </span><span class="n">position</span><span class="p">,</span>
<span class="w"> </span><span class="k">const</span><span class="w"> </span><span class="n">value_type</span><span class="o">&</span><span class="w"> </span><span class="n">x</span><span class="p">);</span><span class="w"> </span><span class="c1">// (3) C++23</span>
<span class="k">constexpr</span><span class="w"> </span><span class="n">iterator</span>
<span class="w"> </span><span class="nf">insert</span><span class="p">(</span><span class="n">const_iterator</span><span class="w"> </span><span class="n">position</span><span class="p">,</span>
<span class="w"> </span><span class="k">const</span><span class="w"> </span><span class="n">value_type</span><span class="o">&</span><span class="w"> </span><span class="n">x</span><span class="p">);</span><span class="w"> </span><span class="c1">// (3) C++26</span>
<span class="n">iterator</span>
<span class="w"> </span><span class="nf">insert</span><span class="p">(</span><span class="n">const_iterator</span><span class="w"> </span><span class="n">position</span><span class="p">,</span>
<span class="w"> </span><span class="n">value_type</span><span class="o">&&</span><span class="w"> </span><span class="n">x</span><span class="p">);</span><span class="w"> </span><span class="c1">// (4) C++23</span>
<span class="k">constexpr</span><span class="w"> </span><span class="n">iterator</span>
<span class="w"> </span><span class="nf">insert</span><span class="p">(</span><span class="n">const_iterator</span><span class="w"> </span><span class="n">position</span><span class="p">,</span>
<span class="w"> </span><span class="n">value_type</span><span class="o">&&</span><span class="w"> </span><span class="n">x</span><span class="p">);</span><span class="w"> </span><span class="c1">// (4) C++26</span>
<span class="k">template</span><span class="o"><</span><span class="k">class</span><span class="w"> </span><span class="nc">P</span><span class="o">></span>
<span class="n"><a href="../../utility/pair.html">pair</a></span><span class="o"><</span><span class="n">iterator</span><span class="p">,</span><span class="w"> </span><span class="kt">bool</span><span class="o">></span>
<span class="w"> </span><span class="n">insert</span><span class="p">(</span><span class="n">P</span><span class="o">&&</span><span class="w"> </span><span class="n">x</span><span class="p">);</span><span class="w"> </span><span class="c1">// (5) C++23</span>
<span class="k">template</span><span class="o"><</span><span class="k">class</span><span class="w"> </span><span class="nc">P</span><span class="o">></span>
<span class="k">constexpr</span><span class="w"> </span><span class="n"><a href="../../utility/pair.html">pair</a></span><span class="o"><</span><span class="n">iterator</span><span class="p">,</span><span class="w"> </span><span class="kt">bool</span><span class="o">></span>
<span class="w"> </span><span class="n">insert</span><span class="p">(</span><span class="n">P</span><span class="o">&&</span><span class="w"> </span><span class="n">x</span><span class="p">);</span><span class="w"> </span><span class="c1">// (5) C++26</span>
<span class="k">template</span><span class="o"><</span><span class="k">class</span><span class="w"> </span><span class="nc">P</span><span class="o">></span>
<span class="n">iterator</span>
<span class="w"> </span><span class="n">insert</span><span class="p">(</span><span class="n">const_iterator</span><span class="w"> </span><span class="n">position</span><span class="p">,</span>
<span class="w"> </span><span class="n">P</span><span class="o">&&</span><span class="p">);</span><span class="w"> </span><span class="c1">// (6) C++23</span>
<span class="k">template</span><span class="o"><</span><span class="k">class</span><span class="w"> </span><span class="nc">P</span><span class="o">></span>
<span class="k">constexpr</span><span class="w"> </span><span class="n">iterator</span>
<span class="w"> </span><span class="n">insert</span><span class="p">(</span><span class="n">const_iterator</span><span class="w"> </span><span class="n">position</span><span class="p">,</span>
<span class="w"> </span><span class="n">P</span><span class="o">&&</span><span class="p">);</span><span class="w"> </span><span class="c1">// (6) C++26</span>
<span class="k">template</span><span class="o"><</span><span class="k">class</span><span class="w"> </span><span class="nc">InputIterator</span><span class="o">></span>
<span class="kt">void</span>
<span class="w"> </span><span class="n">insert</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="c1">// (7) C++23</span>
<span class="k">template</span><span class="o"><</span><span class="k">class</span><span class="w"> </span><span class="nc">InputIterator</span><span class="o">></span>
<span class="k">constexpr</span><span class="w"> </span><span class="kt">void</span>
<span class="w"> </span><span class="n">insert</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="c1">// (7) C++26</span>
<span class="k">template</span><span class="o"><</span><span class="k">class</span><span class="w"> </span><span class="nc">InputIterator</span><span class="o">></span>
<span class="kt">void</span>
<span class="w"> </span><span class="n">insert</span><span class="p">(</span><span class="n"><a href="../sorted_unique_t.html">sorted_unique_t</a></span><span class="p">,</span>
<span class="w"> </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="c1">// (8) C++23</span>
<span class="k">template</span><span class="o"><</span><span class="k">class</span><span class="w"> </span><span class="nc">InputIterator</span><span class="o">></span>
<span class="k">constexpr</span><span class="w"> </span><span class="kt">void</span>
<span class="w"> </span><span class="n">insert</span><span class="p">(</span><span class="n"><a href="../sorted_unique_t.html">sorted_unique_t</a></span><span class="p">,</span>
<span class="w"> </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="c1">// (8) C++26</span>
<span class="kt">void</span>
<span class="w"> </span><span class="nf">insert</span><span class="p">(</span><span class="n"><a href="../../initializer_list/initializer_list.html">initializer_list</a></span><span class="o"><</span><span class="n">value_type</span><span class="o">></span><span class="w"> </span><span class="n">il</span><span class="p">);</span><span class="w"> </span><span class="c1">// (9) C++23</span>
<span class="k">constexpr</span><span class="w"> </span><span class="kt">void</span>
<span class="w"> </span><span class="nf">insert</span><span class="p">(</span><span class="n"><a href="../../initializer_list/initializer_list.html">initializer_list</a></span><span class="o"><</span><span class="n">value_type</span><span class="o">></span><span class="w"> </span><span class="n">il</span><span class="p">);</span><span class="w"> </span><span class="c1">// (9) C++26</span>
<span class="kt">void</span>
<span class="w"> </span><span class="nf">insert</span><span class="p">(</span><span class="n"><a href="../sorted_unique_t.html">sorted_unique_t</a></span><span class="w"> </span><span class="n">s</span><span class="p">,</span>
<span class="w"> </span><span class="n"><a href="../../initializer_list/initializer_list.html">initializer_list</a></span><span class="o"><</span><span class="n">value_type</span><span class="o">></span><span class="w"> </span><span class="n">il</span><span class="p">);</span><span class="w"> </span><span class="c1">// (10) C++23</span>
<span class="k">constexpr</span><span class="w"> </span><span class="kt">void</span>
<span class="w"> </span><span class="nf">insert</span><span class="p">(</span><span class="n"><a href="../sorted_unique_t.html">sorted_unique_t</a></span><span class="w"> </span><span class="n">s</span><span class="p">,</span>
<span class="w"> </span><span class="n"><a href="../../initializer_list/initializer_list.html">initializer_list</a></span><span class="o"><</span><span class="n">value_type</span><span class="o">></span><span class="w"> </span><span class="n">il</span><span class="p">);</span><span class="w"> </span><span class="c1">// (10) C++26</span>
</code></pre></div>
</p>
<h2>概要</h2>
<p>新しく一つの要素(引数 <code>x</code> を使う)または要素のシーケンス(入力イテレータまたは <code>initializer_list</code> を使う)を挿入し、コンテナを拡張する。</p>
<p>これは、挿入された要素の数だけコンテナの <code><a href="size.html">size()</a></code> を増やす。</p>
<p><code>flat_map</code> コンテナは重複したキーを持つ要素を許さないため、挿入操作はそれぞれの要素が他のコンテナ内の既存要素と同じキーかどうかをチェックする。もし同じであれば要素は挿入されず、<a class="cpprefjp-defined-word" data-desc="関数呼び出し式の評価結果となるオブジェクト・値">戻り値</a>を持つ関数の場合はそれへのイテレータなどを返す。</p>
<p>重複した値を許す、類似したコンテナについては <code><a href="../flat_multimap.html">flat_multimap</a></code> を参照。</p>
<p>内部的に <code>flat_map</code> コンテナは、コンストラクト時に指定された比較オブジェクトによって要素を下位から上位へとソートして保持する。</p>
<ul>
<li>(1) : 単一要素を挿入する</li>
<li>(2) : 単一要素の一時オブジェクトを挿入する</li>
<li>(3) : 指定された位置に、単一要素を挿入する</li>
<li>(4) : 指定された位置に、単一要素の一時オブジェクトを挿入する</li>
<li>(5) : 単一要素として要素型<code>value_type</code>のコンストラクタ引数を受け取って挿入する</li>
<li>(6) : 指定された位置に、要素型<code>value_type</code>のコンストラクタ引数を受け取って挿入する</li>
<li>(7) : <a class="cpprefjp-defined-word" data-desc="2つのイテレータで表現される半開区間を表す。C++20からイテレータと番兵で異なる型であっても指定可能になる">イテレータ範囲</a><code>[first, last)</code>を挿入する</li>
<li>(8) : ソート済みかつ重複要素のない<a class="cpprefjp-defined-word" data-desc="2つのイテレータで表現される半開区間を表す。C++20からイテレータと番兵で異なる型であっても指定可能になる">イテレータ範囲</a><code>[first, last)</code>を挿入する</li>
<li>(9) : 初期化子リストを挿入する</li>
<li>(10) : ソート済みかつ重複要素のない初期化子リストを挿入する</li>
</ul>
<h2>要件</h2>
<ul>
<li>(5), (6) : <code><a href="../../type_traits/is_constructible.html">is_constructible_v</a><<a href="../../utility/pair.html">pair</a><key_type, mapped_type>, P></code>が<code>true</code>であること</li>
</ul>
<h2>効果</h2>
<ul>
<li>
<p>(1) :
<br />
<div class="codehilite"><pre><span></span><code><span class="k">return</span><span class="w"> </span><span class="n"><a href="emplace.html">emplace</a></span><span class="p">(</span><span class="n">x</span><span class="p">);</span>
</code></pre></div>
</p>
</li>
<li>
<p>(2) :
<br />
<div class="codehilite"><pre><span></span><code><span class="k">return</span><span class="w"> </span><span class="n"><a href="emplace.html">emplace</a></span><span class="p">(</span><span class="n">std</span><span class="o">::</span><span class="n"><a href="../../utility/move.html">move</a></span><span class="p">(</span><span class="n">x</span><span class="p">));</span>
</code></pre></div>
</p>
</li>
<li>
<p>(3) :
<br />
<div class="codehilite"><pre><span></span><code><span class="k">return</span><span class="w"> </span><span class="n"><a href="emplace_hint.html">emplace_hint</a></span><span class="p">(</span><span class="n">position</span><span class="p">,</span><span class="w"> </span><span class="n">x</span><span class="p">);</span>
</code></pre></div>
</p>
</li>
<li>
<p>(4) :
<br />
<div class="codehilite"><pre><span></span><code><span class="k">return</span><span class="w"> </span><span class="n"><a href="emplace_hint.html">emplace_hint</a></span><span class="p">(</span><span class="n">position</span><span class="p">,</span><span class="w"> </span><span class="n">std</span><span class="o">::</span><span class="n"><a href="../../utility/move.html">move</a></span><span class="p">(</span><span class="n">x</span><span class="p">));</span>
</code></pre></div>
</p>
</li>
<li>
<p>(5) : 以下と等価：
<br />
<div class="codehilite"><pre><span></span><code><span class="k">return</span><span class="w"> </span><span class="n"><a href="emplace.html">emplace</a></span><span class="p">(</span><span class="n"><a href="../../utility/forward.html">std::forward</a></span><span class="o"><</span><span class="n">P</span><span class="o">></span><span class="p">(</span><span class="n">x</span><span class="p">));</span>
</code></pre></div>
</p>
</li>
<li>
<p>(6) : 以下と等価：
<br />
<div class="codehilite"><pre><span></span><code><span class="k">return</span><span class="w"> </span><span class="n"><a href="emplace_hint.html">emplace_hint</a></span><span class="p">(</span><span class="n">position</span><span class="p">,</span><span class="w"> </span><span class="n"><a href="../../utility/forward.html">std::forward</a></span><span class="o"><</span><span class="n">P</span><span class="o">></span><span class="p">(</span><span class="n">x</span><span class="p">));.</span>
</code></pre></div>
</p>
</li>
<li>
<p>(7) : メンバ変数として保持しているコンテナ<code>c</code>に、以下のように挿入する：
<br />
<div class="codehilite"><pre><span></span><code><span class="k">for</span><span class="w"> </span><span class="p">(;</span><span class="w"> </span><span class="n"><a href="../../utility/pair/first.html">first</a></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="o">++</span><span class="n"><a href="../../utility/pair/first.html">first</a></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">value</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="o">*</span><span class="n"><a href="../../utility/pair/first.html">first</a></span><span class="p">;</span>
<span class="w"> </span><span class="n"><a href="containers.html">c.keys</a></span><span class="p">.</span><span class="n"><a href="../../vector/vector/insert.html">insert</a></span><span class="p">(</span><span class="n"><a href="containers.html">c.keys</a></span><span class="p">.</span><span class="n"><a href="../../vector/vector/end.html">end()</a></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">value</span><span class="p">.</span><span class="n"><a href="../../utility/pair/first.html">first</a></span><span class="p">));</span>
<span class="w"> </span><span class="n"><a href="containers.html">c.values</a></span><span class="p">.</span><span class="n"><a href="../../vector/vector/insert.html">insert</a></span><span class="p">(</span><span class="n"><a href="containers.html">c.values</a></span><span class="p">.</span><span class="n"><a href="../../vector/vector/end.html">end()</a></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">value</span><span class="p">.</span><span class="n"><a href="../../utility/pair/second.html">second</a></span><span class="p">));</span>
<span class="p">}</span>
</code></pre></div>
</p>
<ul>
<li>次に、新しく挿入された要素の範囲を<code>value_comp()</code>を基準にソートする</li>
<li>次に、ソートされた結果の範囲と、既存の要素のソートされた範囲をひとつのソートされた範囲にマージする</li>
<li>最後に、重複する要素を以下のように削除する：</li>
</ul>
<p><div class="codehilite"><pre><span></span><code><span class="k">auto</span><span class="w"> </span><span class="n">zv</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n"><a href="../../ranges/zip_view.html">ranges::zip_view</a></span><span class="p">(</span><span class="n"><a href="containers.html">c.keys</a></span><span class="p">,</span><span class="w"> </span><span class="n"><a href="containers.html">c.values</a></span><span class="p">);</span>
<span class="k">auto</span><span class="w"> </span><span class="n">it</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n"><a href="../../algorithm/ranges_unique.html">ranges::unique</a></span><span class="p">(</span><span class="n">zv</span><span class="p">,</span><span class="w"> </span><span class="n"><a href="key_equiv.html">key_equiv</a></span><span class="p">(</span><span class="n">compare</span><span class="p">)).</span><span class="n">begin</span><span class="p">();</span>
<span class="k">auto</span><span class="w"> </span><span class="n">dist</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n"><a href="../../iterator/distance.html">distance</a></span><span class="p">(</span><span class="n">zv</span><span class="p">.</span><span class="n">begin</span><span class="p">(),</span><span class="w"> </span><span class="n">it</span><span class="p">);</span>
<span class="n"><a href="containers.html">c.keys</a></span><span class="p">.</span><span class="n">erase</span><span class="p">(</span><span class="n"><a href="containers.html">c.keys</a></span><span class="p">.</span><span class="n">begin</span><span class="p">()</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">dist</span><span class="p">,</span><span class="w"> </span><span class="n"><a href="containers.html">c.keys</a></span><span class="p">.</span><span class="n">end</span><span class="p">());</span>
<span class="n"><a href="containers.html">c.values</a></span><span class="p">.</span><span class="n">erase</span><span class="p">(</span><span class="n"><a href="containers.html">c.values</a></span><span class="p">.</span><span class="n">begin</span><span class="p">()</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">dist</span><span class="p">,</span><span class="w"> </span><span class="n"><a href="containers.html">c.values</a></span><span class="p">.</span><span class="n">end</span><span class="p">());</span>
</code></pre></div>
</p>
</li>
<li>
<p>(8) : メンバ変数として保持しているコンテナ<code>c</code>に、以下のように挿入する：
<br />
<div class="codehilite"><pre><span></span><code><span class="k">for</span><span class="w"> </span><span class="p">(;</span><span class="w"> </span><span class="n"><a href="../../utility/pair/first.html">first</a></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="o">++</span><span class="n"><a href="../../utility/pair/first.html">first</a></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">value</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="o">*</span><span class="n"><a href="../../utility/pair/first.html">first</a></span><span class="p">;</span>
<span class="w"> </span><span class="n"><a href="containers.html">c.keys</a></span><span class="p">.</span><span class="n"><a href="../../vector/vector/insert.html">insert</a></span><span class="p">(</span><span class="n"><a href="containers.html">c.keys</a></span><span class="p">.</span><span class="n"><a href="../../vector/vector/end.html">end()</a></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">value</span><span class="p">.</span><span class="n"><a href="../../utility/pair/first.html">first</a></span><span class="p">));</span>
<span class="w"> </span><span class="n"><a href="containers.html">c.values</a></span><span class="p">.</span><span class="n"><a href="../../vector/vector/insert.html">insert</a></span><span class="p">(</span><span class="n"><a href="containers.html">c.values</a></span><span class="p">.</span><span class="n"><a href="../../vector/vector/end.html">end()</a></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">value</span><span class="p">.</span><span class="n"><a href="../../utility/pair/second.html">second</a></span><span class="p">));</span>
<span class="p">}</span>
</code></pre></div>
</p>
<ul>
<li>次に、ソートされた結果の範囲と、既存の要素のソートされた範囲をひとつのソートされた範囲にマージする</li>
<li>最後に、重複する要素を以下のように削除する：</li>
</ul>
<p><div class="codehilite"><pre><span></span><code><span class="k">auto</span><span class="w"> </span><span class="n">zv</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n"><a href="../../ranges/zip_view.html">ranges::zip_view</a></span><span class="p">(</span><span class="n"><a href="containers.html">c.keys</a></span><span class="p">,</span><span class="w"> </span><span class="n"><a href="containers.html">c.values</a></span><span class="p">);</span>
<span class="k">auto</span><span class="w"> </span><span class="n">it</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n"><a href="../../algorithm/ranges_unique.html">ranges::unique</a></span><span class="p">(</span><span class="n">zv</span><span class="p">,</span><span class="w"> </span><span class="n"><a href="key_equiv.html">key_equiv</a></span><span class="p">(</span><span class="n">compare</span><span class="p">)).</span><span class="n">begin</span><span class="p">();</span>
<span class="k">auto</span><span class="w"> </span><span class="n">dist</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n"><a href="../../iterator/distance.html">distance</a></span><span class="p">(</span><span class="n">zv</span><span class="p">.</span><span class="n">begin</span><span class="p">(),</span><span class="w"> </span><span class="n">it</span><span class="p">);</span>
<span class="n"><a href="containers.html">c.keys</a></span><span class="p">.</span><span class="n">erase</span><span class="p">(</span><span class="n"><a href="containers.html">c.keys</a></span><span class="p">.</span><span class="n">begin</span><span class="p">()</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">dist</span><span class="p">,</span><span class="w"> </span><span class="n"><a href="containers.html">c.keys</a></span><span class="p">.</span><span class="n">end</span><span class="p">());</span>
<span class="n"><a href="containers.html">c.values</a></span><span class="p">.</span><span class="n">erase</span><span class="p">(</span><span class="n"><a href="containers.html">c.values</a></span><span class="p">.</span><span class="n">begin</span><span class="p">()</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">dist</span><span class="p">,</span><span class="w"> </span><span class="n"><a href="containers.html">c.values</a></span><span class="p">.</span><span class="n">end</span><span class="p">());</span>
</code></pre></div>
</p>
</li>
<li>
<p>(9) :
<br />
<div class="codehilite"><pre><span></span><code><span class="n">insert</span><span class="p">(</span><span class="n"><a href="../../initializer_list/initializer_list/begin.html">il.begin()</a></span><span class="p">,</span><span class="w"> </span><span class="n"><a href="../../initializer_list/initializer_list/end.html">il.end()</a></span><span class="p">);</span>
</code></pre></div>
</p>
</li>
<li>
<p>(10) :
<br />
<div class="codehilite"><pre><span></span><code><span class="n">insert</span><span class="p">(</span><span class="n">s</span><span class="p">,</span><span class="w"> </span><span class="n"><a href="../../initializer_list/initializer_list/begin.html">il.begin()</a></span><span class="p">,</span><span class="w"> </span><span class="n"><a href="../../initializer_list/initializer_list/end.html">il.end()</a></span><span class="p">);</span>
</code></pre></div>
</p>
</li>
</ul>
<h2><a class="cpprefjp-defined-word" data-desc="関数呼び出し式の評価結果となるオブジェクト・値">戻り値</a></h2>
<ul>
<li>(1), (2), (5) : <a class="cpprefjp-defined-word" data-desc="関数呼び出し式の評価結果となるオブジェクト・値">戻り値</a>としては、イテレータと<code>bool</code>値の組を返す。<ul>
<li>挿入された場合には、<code>first</code> に挿入された要素へのイテレータ、 <code>second</code> に <code>true</code> が設定される。</li>
<li>挿入されなかった場合には、 <code>first</code> に <code>x</code> と等価のキーを持つ要素へのイテレータ、 <code>second</code> に <code>false</code> が設定される。</li>
</ul>
</li>
<li>(3), (4), (6) :<ul>
<li>挿入された場合には、新しく挿入された要素を指すイテレータを返す。</li>
<li>挿入されなかった場合には、<code>x</code>のキーと等価のキーを持つ要素へのイテレータを返す。</li>
</ul>
</li>
<li>(7), (8), (9), (10) : なし</li>
</ul>
<h2><a class="cpprefjp-defined-word" data-desc="関数等の意味論を構成する要素の1つ。Complexity。関数が使うアルゴリズムの空間計算量・時間計算量">計算量</a></h2>
<ul>
<li>(1)~(6) : コンテナサイズ（<code><a href="size.html">size()</a></code>）に対して線形</li>
<li>(7) : Nをこの操作の前の<code><a href="size.html">size()</a></code>、Mを<code><a href="../../iterator/distance.html">distance</a>(first, last)</code>として、N + MlogM</li>
<li>(8) : Nをこの操作のあとの<code><a href="size.html">size()</a></code>として、Nに対して線形</li>
<li>(9) : Nをこの操作の前の<code><a href="size.html">size()</a></code>、Mを<code>il.size()</code>として、N + MlogM</li>
<li>(10) : Nをこの操作のあとの<code><a href="size.html">size()</a></code>として、Nに対して線形</li>
</ul>
<h2>備考</h2>
<ul>
<li>(7), (8) : この操作はインプレース・マージを行うため、追加のメモリ確保を行う可能性がある</li>
</ul>
<h2>例</h2>
<p><div class="yata" id="19ee539a5ee963aab4bb49f6b87ec93d388de040"><div class="codehilite"><pre><span></span><code><span class="cp">#include <a href="../../iostream.html"><iostream></a></span>
<span class="cp">#include <a href="../../flat_map.html"><flat_map></a></span>
<span class="cp">#include <a href="../../utility.html"><utility></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">std</span><span class="o">::</span><span class="n">flat_map</span><span class="o"><</span><span class="kt">int</span><span class="p">,</span><span class="w"> </span><span class="kt">char</span><span class="o">></span><span class="w"> </span><span class="n">fm</span><span class="p">;</span>
<span class="w"> </span><span class="c1">// 単一要素を挿入する</span>
<span class="w"> </span><span class="n">fm</span><span class="p">.</span><span class="n"><span style="color:#ff0000">insert</span></span><span class="p">(</span><span class="n"><a href="../../utility/pair.html">std::pair</a></span><span class="p">{</span><span class="mi">3</span><span class="p">,</span><span class="w"> </span><span class="sc">'a'</span><span class="p">});</span>
<span class="w"> </span><span class="n">fm</span><span class="p">.</span><span class="n"><span style="color:#ff0000">insert</span></span><span class="p">({</span><span class="mi">3</span><span class="p">,</span><span class="w"> </span><span class="sc">'a'</span><span class="p">});</span>
<span class="w"> </span><span class="n">std</span><span class="o">::</span><span class="n">flat_map</span><span class="o"><</span><span class="kt">int</span><span class="p">,</span><span class="w"> </span><span class="kt">char</span><span class="o">></span><span class="w"> </span><span class="n">fm2</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
<span class="w"> </span><span class="p">{</span><span class="mi">5</span><span class="p">,</span><span class="w"> </span><span class="sc">'d'</span><span class="p">},</span>
<span class="w"> </span><span class="p">{</span><span class="mi">15</span><span class="p">,</span><span class="w"> </span><span class="sc">'e'</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="n">fm</span><span class="p">.</span><span class="n"><span style="color:#ff0000">insert</span></span><span class="p">(</span><span class="n">fm2</span><span class="p">.</span><span class="n"><a href="begin.html">begin()</a></span><span class="p">,</span><span class="w"> </span><span class="n">fm2</span><span class="p">.</span><span class="n"><a href="end.html">end()</a></span><span class="p">);</span>
<span class="w"> </span><span class="c1">// 挿入するシーケンスがソート済みかつ重複要素がないことがわかっている場合、</span>
<span class="w"> </span><span class="c1">// 以下のように指定した方が高速になる</span>
<span class="w"> </span><span class="n">fm</span><span class="p">.</span><span class="n"><span style="color:#ff0000">insert</span></span><span class="p">(</span><span class="n"><a href="../sorted_unique_t.html">std::sorted_unique</a></span><span class="p">,</span><span class="w"> </span><span class="n">fm2</span><span class="p">.</span><span class="n"><a href="begin.html">begin()</a></span><span class="p">,</span><span class="w"> </span><span class="n">fm2</span><span class="p">.</span><span class="n"><a href="end.html">end()</a></span><span class="p">);</span>
<span class="w"> </span><span class="k">for</span><span class="w"> </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="p">[</span><span class="n">key</span><span class="p">,</span><span class="w"> </span><span class="n">value</span><span class="p">]</span><span class="w"> </span><span class="o">:</span><span class="w"> </span><span class="n">fm</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">key</span><span class="w"> </span><span class="o"><<</span><span class="w"> </span><span class="s">" : "</span><span class="w"> </span><span class="o"><<</span><span class="w"> </span><span class="n">value</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>3 : a
5 : d
15 : e
</code></pre></p>
<h2>バージョン</h2>
<h3>処理系</h3>
<ul>
<li><a href="../../../implementation.html#clang">Clang</a>: ??</li>
<li><a href="../../../implementation.html#gcc">GCC</a>: ??</li>
<li><a href="../../../implementation.html#visual_cpp">Visual C++</a>: ??</li>
</ul>
<h2>関連項目</h2>
<table border="1" bordercolor="#888" style="border-collapse:collapse">
<thead>
<tr>
<th>名前</th>
<th>説明</th>
</tr>
</thead>
<tbody>
<tr>
<td><code><a href="insert_or_assign.html">flat_map::insert_or_assign</a></code></td>
<td>要素を挿入、あるいは代入する</td>
</tr>
<tr>
<td><code><a href="insert_range.html">flat_map::insert_range</a></code></td>
<td>Rangeを挿入する</td>
</tr>
<tr>
<td><code><a href="emplace.html">flat_map::emplace</a></code></td>
<td>要素を直接構築する</td>
</tr>
<tr>
<td><code><a href="emplace_hint.html">flat_map::emplace_hint</a></code></td>
<td>ヒントを使って要素を直接構築する</td>
</tr>
<tr>
<td><code><a href="try_emplace.html">flat_map::try_emplace</a></code></td>
<td>キーが存在しない場合のみ要素を直接構築する</td>
</tr>
</tbody>
</table>
<h2>参照</h2>
<ul>
<li><a href="https://open-std.org/jtc1/sc22/wg21/docs/papers/2025/p3372r3.html" target="_blank">P3372R3 constexpr containers and adaptors</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>