-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathop_constructor.html
More file actions
642 lines (552 loc) · 66.3 KB
/
op_constructor.html
File metadata and controls
642 lines (552 loc) · 66.3 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
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
<!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>priority_queue::コンストラクタ - cpprefjp C++日本語リファレンス</title>
<meta name="viewport" content="width=device-width,initial-scale=1">
<meta name="keywords" content="
C++,標準ライブラリ,リファレンス,ドキュメント,STL,std,queue,std,priority_queue,function
">
<meta name="title" content="priority_queue::コンストラクタ - cpprefjp C++日本語リファレンス" />
<meta itemprop="name" content="priority_queue::コンストラクタ - cpprefjp C++日本語リファレンス" />
<meta property="og:title" content="priority_queue::コンストラクタ - cpprefjp C++日本語リファレンス" />
<meta property="og:url" content="https://cpprefjp.github.io/reference/queue/priority_queue/op_constructor.html" />
<meta property="og:site_name" content="cpprefjp - C++日本語リファレンス" />
<meta property="og:type" content="article" />
<meta property="og:description" content="- (1) : デフォルトコンストラクタ" />
<meta name="twitter:card" content="summary" />
<meta name="twitter:title" content="priority_queue::コンストラクタ - cpprefjp C++日本語リファレンス" />
<meta name="twitter:url" content="https://cpprefjp.github.io/reference/queue/priority_queue/op_constructor.html" />
<meta name="twitter:description" content="- (1) : デフォルトコンストラクタ" />
<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": ["queue"], "namespace": ["std"], "class": ["priority_queue"], "id-type": ["function"]}, "sources": [{"id": "e985ff0fc56ce4141a6aeaa8be359a6e7aef8a00", "source": "#include <iostream>\n#include <queue>\n#include <vector>\n#include <string>\n\ntemplate <class PriorityQueue>\nvoid pop_print(const std::string& name, PriorityQueue& que)\n{\n std::cout << name << \" : \";\n while (!que.empty()) {\n std::cout << que.top() << ' ';\n que.pop();\n }\n std::cout << std::endl;\n}\n\nint main()\n{\n // \u30c7\u30d5\u30a9\u30eb\u30c8\u69cb\u7bc9\n std::priority_queue<int> que1;\n\n // que1\u304b\u3089\u30b3\u30d4\u30fc\u69cb\u7bc9\n std::priority_queue<int> que2 = que1;\n\n // que2\u304b\u3089\u30e0\u30fc\u30d6\u69cb\u7bc9\n std::priority_queue<int> que3 = std::move(que2);\n\n // \u30a4\u30c6\u30ec\u30fc\u30bf\u7bc4\u56f2\u304b\u3089\u69cb\u7bc9\n const std::vector<int> v = {3, 1, 4};\n std::priority_queue<int> que4(v.begin(), v.end());\n\n // \u30a4\u30c6\u30ec\u30fc\u30bf\u7bc4\u56f2\u3001\u6bd4\u8f03\u95a2\u6570\u30aa\u30d6\u30b8\u30a7\u30af\u30c8\u3001\u30b3\u30f3\u30c6\u30ca\u304b\u3089\u69cb\u7bc9\n const std::vector<int> v2 = {5, 2};\n std::priority_queue<int> que5(v.begin(), v.end(), {}, v2);\n\n pop_print(\"que3\", que3);\n pop_print(\"que4\", que4);\n pop_print(\"que5\", que5);\n}\n"}], "page_id": ["reference", "queue", "priority_queue", "op_constructor"]}">
<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/queue.html" itemprop="url">
<span itemprop="name">queue</span>
</a>
</span>
</li>
<li itemscope itemtype="http://www.schema.org/SiteNavigationElement">
<span>
<a href="../../../reference/queue/priority_queue.html" itemprop="url">
<span itemprop="name">priority_queue</span>
</a>
</span>
</li>
<li class="active" itemscope itemtype="http://www.schema.org/SiteNavigationElement">
<span>
<span itemprop="name">コンストラクタ</span>
</span>
</li>
</ol>
<div class="crsearch"></div>
</div>
</div>
<div class="row">
<div class="col-sm-12 edit-button">
<p class="text-right"><small>
最終更新日時(UTC):
<span itemprop="datePublished" content="2026-02-17T14:22:33">
2026年02月17日 14時22分33秒
</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/queue/priority_queue/op_constructor.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/queue/priority_queue/op_constructor.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"><queue></div><h1 itemprop="name"><span class="namespace" title="namespace std">std::</span><span class="class" title="class priority_queue">priority_queue::</span><span class="token">コンストラクタ</span></h1>
<div itemprop="articleBody"><p><div class="codehilite"><pre><span></span><code><span class="k">explicit</span>
<span class="w"> </span><span class="n">priority_queue</span><span class="p">(</span><span class="k">const</span><span class="w"> </span><span class="n">Compare</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">Compare</span><span class="p">(),</span>
<span class="w"> </span><span class="k">const</span><span class="w"> </span><span class="n">Container</span><span class="o">&</span><span class="w"> </span><span class="n">other</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">Container</span><span class="p">());</span><span class="w"> </span><span class="c1">// (1) C++03</span>
<span class="k">explicit</span>
<span class="w"> </span><span class="n">priority_queue</span><span class="p">(</span><span class="k">const</span><span class="w"> </span><span class="n">Compare</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">Compare</span><span class="p">(),</span>
<span class="w"> </span><span class="n">Container</span><span class="o">&&</span><span class="w"> </span><span class="n">y</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">Container</span><span class="p">());</span><span class="w"> </span><span class="c1">// (1) C++11</span>
<span class="n">priority_queue</span><span class="p">()</span>
<span class="w"> </span><span class="o">:</span><span class="w"> </span><span class="n">priority_queue</span><span class="p">(</span><span class="n">Compare</span><span class="p">())</span><span class="w"> </span><span class="p">{}</span><span class="w"> </span><span class="c1">// (1) C++20</span>
<span class="k">constexpr</span>
<span class="w"> </span><span class="n">priority_queue</span><span class="p">()</span>
<span class="w"> </span><span class="o">:</span><span class="w"> </span><span class="n">priority_queue</span><span class="p">(</span><span class="n">Compare</span><span class="p">())</span><span class="w"> </span><span class="p">{}</span><span class="w"> </span><span class="c1">// (1) C++26</span>
<span class="k">explicit</span>
<span class="w"> </span><span class="n">priority_queue</span><span class="p">(</span><span class="k">const</span><span class="w"> </span><span class="n">Compare</span><span class="o">&</span><span class="w"> </span><span class="n">x</span><span class="p">)</span>
<span class="w"> </span><span class="o">:</span><span class="w"> </span><span class="n">priority_queue</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">Container</span><span class="p">())</span><span class="w"> </span><span class="p">{}</span><span class="w"> </span><span class="c1">// (2) C++20</span>
<span class="k">constexpr</span><span class="w"> </span><span class="k">explicit</span>
<span class="w"> </span><span class="n">priority_queue</span><span class="p">(</span><span class="k">const</span><span class="w"> </span><span class="n">Compare</span><span class="o">&</span><span class="w"> </span><span class="n">x</span><span class="p">)</span>
<span class="w"> </span><span class="o">:</span><span class="w"> </span><span class="n">priority_queue</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">Container</span><span class="p">())</span><span class="w"> </span><span class="p">{}</span><span class="w"> </span><span class="c1">// (2) C++26</span>
<span class="n">priority_queue</span><span class="p">(</span><span class="k">const</span><span class="w"> </span><span class="n">Compare</span><span class="o">&</span><span class="w"> </span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="k">const</span><span class="w"> </span><span class="n">Container</span><span class="o">&</span><span class="w"> </span><span class="n">other</span><span class="p">);</span><span class="w"> </span><span class="c1">// (3) C++11</span>
<span class="k">constexpr</span><span class="w"> </span><span class="n">priority_queue</span><span class="p">(</span><span class="k">const</span><span class="w"> </span><span class="n">Compare</span><span class="o">&</span><span class="w"> </span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="k">const</span><span class="w"> </span><span class="n">Container</span><span class="o">&</span><span class="w"> </span><span class="n">other</span><span class="p">);</span><span class="w"> </span><span class="c1">// (3) C++26</span>
<span class="n">priority_queue</span><span class="p">(</span><span class="k">const</span><span class="w"> </span><span class="n">priority_queue</span><span class="o">&</span><span class="p">);</span><span class="w"> </span><span class="c1">// (4) C++03</span>
<span class="n">priority_queue</span><span class="p">(</span><span class="k">const</span><span class="w"> </span><span class="n">priority_queue</span><span class="o">&</span><span class="p">)</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="k">default</span><span class="p">;</span><span class="w"> </span><span class="c1">// (4) C++11</span>
<span class="k">constexpr</span><span class="w"> </span><span class="n">priority_queue</span><span class="p">(</span><span class="k">const</span><span class="w"> </span><span class="n">priority_queue</span><span class="o">&</span><span class="p">)</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="k">default</span><span class="p">;</span><span class="w"> </span><span class="c1">// (4) C++26</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="o">></span>
<span class="n">priority_queue</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="k">const</span><span class="w"> </span><span class="n">Compare</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">Compare</span><span class="p">(),</span>
<span class="w"> </span><span class="k">const</span><span class="w"> </span><span class="n">Container</span><span class="o">&</span><span class="w"> </span><span class="n">other</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">Container</span><span class="p">());</span><span class="w"> </span><span class="c1">// (5) C++03</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="o">></span>
<span class="k">constexpr</span>
<span class="w"> </span><span class="n">priority_queue</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="k">const</span><span class="w"> </span><span class="n">Compare</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">Compare</span><span class="p">(),</span>
<span class="w"> </span><span class="k">const</span><span class="w"> </span><span class="n">Container</span><span class="o">&</span><span class="w"> </span><span class="n">other</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">Container</span><span class="p">());</span><span class="w"> </span><span class="c1">// (5) C++26</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="o">></span>
<span class="n">priority_queue</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="k">const</span><span class="w"> </span><span class="n">Compare</span><span class="o">&</span><span class="w"> </span><span class="n">x</span><span class="p">,</span>
<span class="w"> </span><span class="k">const</span><span class="w"> </span><span class="n">Container</span><span class="o">&</span><span class="w"> </span><span class="n">other</span><span class="p">);</span><span class="w"> </span><span class="c1">// (6) C++11</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="o">></span>
<span class="k">constexpr</span>
<span class="w"> </span><span class="n">priority_queue</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="k">const</span><span class="w"> </span><span class="n">Compare</span><span class="o">&</span><span class="w"> </span><span class="n">x</span><span class="p">,</span>
<span class="w"> </span><span class="k">const</span><span class="w"> </span><span class="n">Container</span><span class="o">&</span><span class="w"> </span><span class="n">other</span><span class="p">);</span><span class="w"> </span><span class="c1">// (6) C++26</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="o">></span>
<span class="n">priority_queue</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="k">const</span><span class="w"> </span><span class="n">Compare</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">Compare</span><span class="p">(),</span>
<span class="w"> </span><span class="n">Container</span><span class="o">&&</span><span class="w"> </span><span class="n">other</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">Container</span><span class="p">());</span><span class="w"> </span><span class="c1">// (7) C++11</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="o">></span>
<span class="k">constexpr</span>
<span class="w"> </span><span class="n">priority_queue</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="k">const</span><span class="w"> </span><span class="n">Compare</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">Compare</span><span class="p">(),</span>
<span class="w"> </span><span class="n">Container</span><span class="o">&&</span><span class="w"> </span><span class="n">other</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">Container</span><span class="p">());</span><span class="w"> </span><span class="c1">// (7) C++26</span>
<span class="n">priority_queue</span><span class="p">(</span><span class="n">priority_queue</span><span class="o">&&</span><span class="p">)</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="k">default</span><span class="p">;</span><span class="w"> </span><span class="c1">// (8) C++11</span>
<span class="k">constexpr</span><span class="w"> </span><span class="n">priority_queue</span><span class="p">(</span><span class="n">priority_queue</span><span class="o">&&</span><span class="p">)</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="k">default</span><span class="p">;</span><span class="w"> </span><span class="c1">// (8) C++26</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">Alloc</span><span class="o">></span>
<span class="k">explicit</span><span class="w"> </span><span class="n">priority_queue</span><span class="p">(</span><span class="k">const</span><span class="w"> </span><span class="n">Alloc</span><span class="o">&</span><span class="w"> </span><span class="n">alloc</span><span class="p">);</span><span class="w"> </span><span class="c1">// (9) C++11</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">Alloc</span><span class="o">></span>
<span class="k">constexpr</span><span class="w"> </span><span class="k">explicit</span><span class="w"> </span><span class="n">priority_queue</span><span class="p">(</span><span class="k">const</span><span class="w"> </span><span class="n">Alloc</span><span class="o">&</span><span class="w"> </span><span class="n">alloc</span><span class="p">);</span><span class="w"> </span><span class="c1">// (9) C++26</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">Alloc</span><span class="o">></span>
<span class="n">priority_queue</span><span class="p">(</span><span class="k">const</span><span class="w"> </span><span class="n">Compare</span><span class="o">&</span><span class="w"> </span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="k">const</span><span class="w"> </span><span class="n">Alloc</span><span class="o">&</span><span class="w"> </span><span class="n">alloc</span><span class="p">);</span><span class="w"> </span><span class="c1">// (10) C++11</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">Alloc</span><span class="o">></span>
<span class="k">constexpr</span><span class="w"> </span><span class="n">priority_queue</span><span class="p">(</span><span class="k">const</span><span class="w"> </span><span class="n">Compare</span><span class="o">&</span><span class="w"> </span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="k">const</span><span class="w"> </span><span class="n">Alloc</span><span class="o">&</span><span class="w"> </span><span class="n">alloc</span><span class="p">);</span><span class="w"> </span><span class="c1">// (10) C++26</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">Alloc</span><span class="o">></span>
<span class="n">priority_queue</span><span class="p">(</span><span class="k">const</span><span class="w"> </span><span class="n">Compare</span><span class="o">&</span><span class="w"> </span><span class="n">x</span><span class="p">,</span>
<span class="w"> </span><span class="k">const</span><span class="w"> </span><span class="n">Container</span><span class="o">&</span><span class="w"> </span><span class="n">other</span><span class="p">,</span>
<span class="w"> </span><span class="k">const</span><span class="w"> </span><span class="n">Alloc</span><span class="o">&</span><span class="w"> </span><span class="n">alloc</span><span class="p">);</span><span class="w"> </span><span class="c1">// (11) C++11</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">Alloc</span><span class="o">></span>
<span class="k">constexpr</span>
<span class="w"> </span><span class="n">priority_queue</span><span class="p">(</span><span class="k">const</span><span class="w"> </span><span class="n">Compare</span><span class="o">&</span><span class="w"> </span><span class="n">x</span><span class="p">,</span>
<span class="w"> </span><span class="k">const</span><span class="w"> </span><span class="n">Container</span><span class="o">&</span><span class="w"> </span><span class="n">other</span><span class="p">,</span>
<span class="w"> </span><span class="k">const</span><span class="w"> </span><span class="n">Alloc</span><span class="o">&</span><span class="w"> </span><span class="n">alloc</span><span class="p">);</span><span class="w"> </span><span class="c1">// (11) C++26</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">Alloc</span><span class="o">></span>
<span class="n">priority_queue</span><span class="p">(</span><span class="k">const</span><span class="w"> </span><span class="n">Compare</span><span class="w"> </span><span class="n">x</span><span class="o">&</span><span class="p">,</span>
<span class="w"> </span><span class="n">Container</span><span class="o">&&</span><span class="w"> </span><span class="n">other</span><span class="p">,</span>
<span class="w"> </span><span class="k">const</span><span class="w"> </span><span class="n">Alloc</span><span class="o">&</span><span class="w"> </span><span class="n">alloc</span><span class="p">);</span><span class="w"> </span><span class="c1">// (12) C++11</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">Alloc</span><span class="o">></span>
<span class="k">constexpr</span>
<span class="w"> </span><span class="n">priority_queue</span><span class="p">(</span><span class="k">const</span><span class="w"> </span><span class="n">Compare</span><span class="w"> </span><span class="n">x</span><span class="o">&</span><span class="p">,</span>
<span class="w"> </span><span class="n">Container</span><span class="o">&&</span><span class="w"> </span><span class="n">other</span><span class="p">,</span>
<span class="w"> </span><span class="k">const</span><span class="w"> </span><span class="n">Alloc</span><span class="o">&</span><span class="w"> </span><span class="n">alloc</span><span class="p">);</span><span class="w"> </span><span class="c1">// (12) C++26</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">Alloc</span><span class="o">></span>
<span class="n">priority_queue</span><span class="p">(</span><span class="k">const</span><span class="w"> </span><span class="n">priority_queue</span><span class="o">&</span><span class="w"> </span><span class="n">que</span><span class="p">,</span>
<span class="w"> </span><span class="k">const</span><span class="w"> </span><span class="n">Alloc</span><span class="o">&</span><span class="w"> </span><span class="n">alloc</span><span class="p">);</span><span class="w"> </span><span class="c1">// (13) C++11</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">Alloc</span><span class="o">></span>
<span class="k">constexpr</span>
<span class="w"> </span><span class="n">priority_queue</span><span class="p">(</span><span class="k">const</span><span class="w"> </span><span class="n">priority_queue</span><span class="o">&</span><span class="w"> </span><span class="n">que</span><span class="p">,</span>
<span class="w"> </span><span class="k">const</span><span class="w"> </span><span class="n">Alloc</span><span class="o">&</span><span class="w"> </span><span class="n">alloc</span><span class="p">);</span><span class="w"> </span><span class="c1">// (13) C++26</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">Alloc</span><span class="o">></span>
<span class="n">priority_queue</span><span class="p">(</span><span class="n">priority_queue</span><span class="o">&&</span><span class="w"> </span><span class="n">que</span><span class="p">,</span>
<span class="w"> </span><span class="k">const</span><span class="w"> </span><span class="n">Alloc</span><span class="o">&</span><span class="w"> </span><span class="n">alloc</span><span class="p">);</span><span class="w"> </span><span class="c1">// (14) C++11</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">Alloc</span><span class="o">></span>
<span class="k">constexpr</span>
<span class="w"> </span><span class="n">priority_queue</span><span class="p">(</span><span class="n">priority_queue</span><span class="o">&&</span><span class="w"> </span><span class="n">que</span><span class="p">,</span>
<span class="w"> </span><span class="k">const</span><span class="w"> </span><span class="n">Alloc</span><span class="o">&</span><span class="w"> </span><span class="n">alloc</span><span class="p">);</span><span class="w"> </span><span class="c1">// (14) C++26</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">Alloc</span><span class="o">></span>
<span class="n">priority_queue</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="k">const</span><span class="w"> </span><span class="n">Compare</span><span class="o">&</span><span class="w"> </span><span class="n">x</span><span class="p">,</span>
<span class="w"> </span><span class="k">const</span><span class="w"> </span><span class="n">Alloc</span><span class="o">&</span><span class="w"> </span><span class="n">alloc</span><span class="p">);</span><span class="w"> </span><span class="c1">// (15) C++23</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">Alloc</span><span class="o">></span>
<span class="k">constexpr</span>
<span class="w"> </span><span class="n">priority_queue</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="k">const</span><span class="w"> </span><span class="n">Compare</span><span class="o">&</span><span class="w"> </span><span class="n">x</span><span class="p">,</span>
<span class="w"> </span><span class="k">const</span><span class="w"> </span><span class="n">Alloc</span><span class="o">&</span><span class="w"> </span><span class="n">alloc</span><span class="p">);</span><span class="w"> </span><span class="c1">// (15) C++26</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">Alloc</span><span class="o">></span>
<span class="n">priority_queue</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="k">const</span><span class="w"> </span><span class="n">Compare</span><span class="o">&</span><span class="w"> </span><span class="n">x</span><span class="p">,</span>
<span class="w"> </span><span class="k">const</span><span class="w"> </span><span class="n">Container</span><span class="o">&</span><span class="w"> </span><span class="n">other</span><span class="p">,</span>
<span class="w"> </span><span class="k">const</span><span class="w"> </span><span class="n">Alloc</span><span class="o">&</span><span class="w"> </span><span class="n">alloc</span><span class="p">);</span><span class="w"> </span><span class="c1">// (16) C++23</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">Alloc</span><span class="o">></span>
<span class="k">constexpr</span>
<span class="w"> </span><span class="n">priority_queue</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="k">const</span><span class="w"> </span><span class="n">Compare</span><span class="o">&</span><span class="w"> </span><span class="n">x</span><span class="p">,</span>
<span class="w"> </span><span class="k">const</span><span class="w"> </span><span class="n">Container</span><span class="o">&</span><span class="w"> </span><span class="n">other</span><span class="p">,</span>
<span class="w"> </span><span class="k">const</span><span class="w"> </span><span class="n">Alloc</span><span class="o">&</span><span class="w"> </span><span class="n">alloc</span><span class="p">);</span><span class="w"> </span><span class="c1">// (16) C++26</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">Alloc</span><span class="o">></span>
<span class="n">priority_queue</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="k">const</span><span class="w"> </span><span class="n">Compare</span><span class="o">&</span><span class="w"> </span><span class="n">x</span><span class="p">,</span>
<span class="w"> </span><span class="n">Container</span><span class="o">&&</span><span class="w"> </span><span class="n">other</span><span class="p">,</span>
<span class="w"> </span><span class="k">const</span><span class="w"> </span><span class="n">Alloc</span><span class="o">&</span><span class="w"> </span><span class="n">alloc</span><span class="p">);</span><span class="w"> </span><span class="c1">// (17) C++23</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">Alloc</span><span class="o">></span>
<span class="k">constexpr</span>
<span class="w"> </span><span class="n">priority_queue</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="k">const</span><span class="w"> </span><span class="n">Compare</span><span class="o">&</span><span class="w"> </span><span class="n">x</span><span class="p">,</span>
<span class="w"> </span><span class="n">Container</span><span class="o">&&</span><span class="w"> </span><span class="n">other</span><span class="p">,</span>
<span class="w"> </span><span class="k">const</span><span class="w"> </span><span class="n">Alloc</span><span class="o">&</span><span class="w"> </span><span class="n">alloc</span><span class="p">);</span><span class="w"> </span><span class="c1">// (17) C++26</span>
<span class="k">template</span><span class="w"> </span><span class="o"><</span><span class="n">container</span><span class="o">-</span><span class="n">compatible</span><span class="o">-</span><span class="n"><a href="../../ranges/range.html">range</a></span><span class="o"><</span><span class="n">T</span><span class="o">></span><span class="w"> </span><span class="n">R</span><span class="o">></span>
<span class="n">priority_queue</span><span class="p">(</span><span class="n"><a href="../../ranges/from_range_t.html">from_range_t</a></span><span class="p">,</span><span class="w"> </span><span class="n">R</span><span class="o">&&</span><span class="w"> </span><span class="n">rg</span><span class="p">,</span>
<span class="w"> </span><span class="k">const</span><span class="w"> </span><span class="n">Compare</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">Compare</span><span class="p">());</span><span class="w"> </span><span class="c1">// (18) C++23</span>
<span class="k">template</span><span class="w"> </span><span class="o"><</span><span class="n">container</span><span class="o">-</span><span class="n">compatible</span><span class="o">-</span><span class="n"><a href="../../ranges/range.html">range</a></span><span class="o"><</span><span class="n">T</span><span class="o">></span><span class="w"> </span><span class="n">R</span><span class="o">></span>
<span class="k">constexpr</span>
<span class="w"> </span><span class="n">priority_queue</span><span class="p">(</span><span class="n"><a href="../../ranges/from_range_t.html">from_range_t</a></span><span class="p">,</span><span class="w"> </span><span class="n">R</span><span class="o">&&</span><span class="w"> </span><span class="n">rg</span><span class="p">,</span>
<span class="w"> </span><span class="k">const</span><span class="w"> </span><span class="n">Compare</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">Compare</span><span class="p">());</span><span class="w"> </span><span class="c1">// (18) C++26</span>
<span class="k">template</span><span class="w"> </span><span class="o"><</span><span class="n">container</span><span class="o">-</span><span class="n">compatible</span><span class="o">-</span><span class="n"><a href="../../ranges/range.html">range</a></span><span class="o"><</span><span class="n">T</span><span class="o">></span><span class="w"> </span><span class="n">R</span><span class="p">,</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">Alloc</span><span class="o">></span>
<span class="n">priority_queue</span><span class="p">(</span><span class="n"><a href="../../ranges/from_range_t.html">from_range_t</a></span><span class="p">,</span><span class="w"> </span><span class="n">R</span><span class="o">&&</span><span class="w"> </span><span class="n">rg</span><span class="p">,</span>
<span class="w"> </span><span class="k">const</span><span class="w"> </span><span class="n">Compare</span><span class="o">&</span><span class="w"> </span><span class="n">x</span><span class="p">,</span>
<span class="w"> </span><span class="k">const</span><span class="w"> </span><span class="n">Alloc</span><span class="o">&</span><span class="w"> </span><span class="n">alloc</span><span class="p">);</span><span class="w"> </span><span class="c1">// (19) C++23</span>
<span class="k">template</span><span class="w"> </span><span class="o"><</span><span class="n">container</span><span class="o">-</span><span class="n">compatible</span><span class="o">-</span><span class="n"><a href="../../ranges/range.html">range</a></span><span class="o"><</span><span class="n">T</span><span class="o">></span><span class="w"> </span><span class="n">R</span><span class="p">,</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">Alloc</span><span class="o">></span>
<span class="k">constexpr</span>
<span class="w"> </span><span class="n">priority_queue</span><span class="p">(</span><span class="n"><a href="../../ranges/from_range_t.html">from_range_t</a></span><span class="p">,</span><span class="w"> </span><span class="n">R</span><span class="o">&&</span><span class="w"> </span><span class="n">rg</span><span class="p">,</span>
<span class="w"> </span><span class="k">const</span><span class="w"> </span><span class="n">Compare</span><span class="o">&</span><span class="w"> </span><span class="n">x</span><span class="p">,</span>
<span class="w"> </span><span class="k">const</span><span class="w"> </span><span class="n">Alloc</span><span class="o">&</span><span class="w"> </span><span class="n">alloc</span><span class="p">);</span><span class="w"> </span><span class="c1">// (19) C++26</span>
<span class="k">template</span><span class="w"> </span><span class="o"><</span><span class="n">container</span><span class="o">-</span><span class="n">compatible</span><span class="o">-</span><span class="n"><a href="../../ranges/range.html">range</a></span><span class="o"><</span><span class="n">T</span><span class="o">></span><span class="w"> </span><span class="n">R</span><span class="p">,</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">Alloc</span><span class="o">></span>
<span class="n">priority_queue</span><span class="p">(</span><span class="n"><a href="../../ranges/from_range_t.html">from_range_t</a></span><span class="p">,</span><span class="w"> </span><span class="n">R</span><span class="o">&&</span><span class="w"> </span><span class="n">rg</span><span class="p">,</span>
<span class="w"> </span><span class="k">const</span><span class="w"> </span><span class="n">Alloc</span><span class="o">&</span><span class="w"> </span><span class="n">alloc</span><span class="p">);</span><span class="w"> </span><span class="c1">// (20) C++23</span>
<span class="k">template</span><span class="w"> </span><span class="o"><</span><span class="n">container</span><span class="o">-</span><span class="n">compatible</span><span class="o">-</span><span class="n"><a href="../../ranges/range.html">range</a></span><span class="o"><</span><span class="n">T</span><span class="o">></span><span class="w"> </span><span class="n">R</span><span class="p">,</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">Alloc</span><span class="o">></span>
<span class="k">constexpr</span>
<span class="w"> </span><span class="n">priority_queue</span><span class="p">(</span><span class="n"><a href="../../ranges/from_range_t.html">from_range_t</a></span><span class="p">,</span><span class="w"> </span><span class="n">R</span><span class="o">&&</span><span class="w"> </span><span class="n">rg</span><span class="p">,</span>
<span class="w"> </span><span class="k">const</span><span class="w"> </span><span class="n">Alloc</span><span class="o">&</span><span class="w"> </span><span class="n">alloc</span><span class="p">);</span><span class="w"> </span><span class="c1">// (20) C++26</span>
</code></pre></div>
</p>
<h2>概要</h2>
<ul>
<li>(1) : デフォルトコンストラクタ<ul>
<li>C++03 : 比較関数と元となるコンテナをコピーして構築する。</li>
<li>C++11 : 比較関数をコピー、元となるコンテナをムーブして構築する。</li>
<li>C++20 : (2)に委譲。</li>
</ul>
</li>
<li>(2) : 比較関数のコピーと元となるコンテナを<a class="cpprefjp-defined-word" data-desc="デフォルト初期化。`T x;`構文での初期化。トリビアルにデフォルト構築可能な型の場合は初期化されず（オブジェクトのlifetimeは開始される）、そうではないクラス型はデフォルトコンストラクタで初期化する。配列型の場合は各要素が再帰的にデフォルト初期化される">デフォルト構築</a>して構築するコンストラクタ。</li>
<li>(3) : 比較関数と、元となるコンテナのコピーから構築するコンストラクタ。</li>
<li>(4) : コピーコンストラクタ</li>
<li>(5), (6), (7) : <a class="cpprefjp-defined-word" data-desc="2つのイテレータで表現される半開区間を表す。C++20からイテレータと番兵で異なる型であっても指定可能になる">イテレータ範囲</a>で優先順位付きキューを構築する。</li>
<li>(8) : ムーブコンストラクタ</li>
<li>(9) : アロケータを受け取るコンストラクタ</li>
<li>(10) : 比較関数とアロケータを受け取るコンストラクタ</li>
<li>(11) : 比較関数、元となるコンテナのコピー、アロケータを受け取るコンストラクタ</li>
<li>(12) : 比較関数、元となるコンテナの一時オブジェクト、アロケータを受け取るコンストラクタ</li>
<li>(13) : アロケータ指定でコピー構築する</li>
<li>(14) : アロケータ指定でムーブ構築する</li>
<li>(15), (16), (17) : アロケータ指定で<a class="cpprefjp-defined-word" data-desc="2つのイテレータで表現される半開区間を表す。C++20からイテレータと番兵で異なる型であっても指定可能になる">イテレータ範囲</a>から優先順位付きキューを構築する</li>
<li>(18), (19), (20) : Rangeから優先順位付きキューを構築する</li>
</ul>
<h2>要件</h2>
<p><code>Compare</code>型パラメータ<code>x</code>が、<a href="../../algorithm.html#strict-weak-ordering">狭義の弱順序</a>で定義されていること。</p>
<h2>効果</h2>
<ul>
<li>(1) :<ul>
<li>C++03<ol>
<li>メンバ変数<code>comp</code>を<code>x</code>でコピー構築する。</li>
<li>メンバ変数<code>c</code>を<code>other</code>でコピー構築する。</li>
<li><code><a href="../../algorithm/make_heap.html">make_heap</a>(c.begin(), c.end(), comp)</code>を呼び出す。</li>
</ol>
</li>
<li>C++11<ol>
<li>メンバ変数<code>comp</code>を<code>x</code>でコピー構築する。</li>
<li>メンバ変数<code>c</code>を<code>y</code>でムーブ構築する。</li>
<li><code><a href="../../algorithm/make_heap.html">make_heap</a>(c.begin(), c.end(), comp)</code>を呼び出す。</li>
</ol>
</li>
</ul>
</li>
<li>(3) :<ol>
<li>メンバ変数<code>comp</code>を<code>x</code>でコピー構築する。</li>
<li>メンバ変数<code>c</code>を<code>other</code>でコピー構築する。</li>
<li><code><a href="../../algorithm/make_heap.html">make_heap</a>(c.begin(), c.end(), comp)</code>を呼び出す。</li>
</ol>
</li>
<li>(4) :<ol>
<li>メンバ変数<code>comp</code>を<code>x</code>でコピー構築する。</li>
<li>メンバ変数<code>c</code>を<code>other</code>でムーブ構築する。</li>
<li><code><a href="../../algorithm/make_heap.html">make_heap</a>(c.begin(), c.end(), comp)</code>を呼び出す。</li>
</ol>
</li>
<li>(5):<ol>
<li>メンバ変数<code>comp</code>を<code>x</code>でコピー構築する。</li>
<li>メンバ変数<code>c</code>を<code>other</code>でコピー構築する。</li>
<li><code>c.insert(c.end(), first, last)</code>を呼び出す。</li>
<li><code><a href="../../algorithm/make_heap.html">make_heap</a>(c.begin(), c.end(), comp)</code>を呼び出す。</li>
</ol>
</li>
<li>(6) :<ol>
<li><code>c.insert(c.end(), first, last)</code>を呼び出す。</li>
<li><code><a href="../../algorithm/make_heap.html">make_heap</a>(c.begin(), c.end(), comp)</code>を呼び出す。</li>
</ol>
</li>
<li>(7):<ol>
<li>メンバ変数<code>comp</code>を<code>x</code>でコピー構築する。</li>
<li>メンバ変数<code>c</code>を<code>other</code>でムーブ構築する。</li>
<li><code>c.insert(c.end(), first, last)</code>を呼び出す。</li>
<li><code><a href="../../algorithm/make_heap.html">make_heap</a>(c.begin(), c.end(), comp)</code>を呼び出す。</li>
</ol>
</li>
<li>(9) :<ol>
<li>メンバ変数<code>c</code>のメモリアロケートに<code>alloc</code>を使用する。</li>
<li>メンバ変数<code>comp</code>を<a class="cpprefjp-defined-word" data-desc="`T x{};`構文での初期化。組み込み型の場合はゼロ相当の値で、クラス型の場合はデフォルトコンストラクタで初期化する。配列型の場合は各要素が再帰的に値初期化される">値初期化</a>する。</li>
</ol>
</li>
<li>(10) :<ol>
<li>メンバ変数<code>c</code>のメモリアロケートに<code>alloc</code>を使用する。</li>
<li>メンバ変数<code>comp</code>を<code>x</code>で初期化する。</li>
</ol>
</li>
<li>(11) :<ol>
<li>メンバ変数<code>comp</code>を<code>x</code>でコピー構築する。</li>
<li>メンバ変数<code>c</code>を<code>other</code>でコピー構築する。</li>
<li>メンバ変数<code>c</code>のメモリアロケートに<code>alloc</code>を使用する。</li>
<li><code><a href="../../algorithm/make_heap.html">make_heap</a>(c.begin(), c.end(), comp)</code>を呼び出す。</li>
</ol>
</li>
<li>(12) :<ol>
<li>メンバ変数<code>comp</code>を<code>x</code>でコピー構築する。</li>
<li>メンバ変数<code>c</code>を<code>other</code>でムーブ構築する。</li>
<li>メンバ変数<code>c</code>のメモリアロケートに<code>alloc</code>を使用する。</li>
<li><code><a href="../../algorithm/make_heap.html">make_heap</a>(c.begin(), c.end(), comp)</code>を呼び出す。</li>
</ol>
</li>
<li>(13) :<ol>
<li>メンバ変数<code>comp</code>を<code>que.comp</code>でコピー構築する。</li>
<li>メンバ変数<code>c</code>を<code>que.c</code>でコピー構築する。</li>
<li>メンバ変数<code>c</code>のメモリアロケートに<code>alloc</code>を使用する。</li>
<li><code><a href="../../algorithm/make_heap.html">make_heap</a>(c.begin(), c.end(), comp)</code>を呼び出す。</li>
</ol>
</li>
<li>(14) :<ol>
<li>メンバ変数<code>comp</code>を<code>que.comp</code>でムーブ構築する。</li>
<li>メンバ変数<code>c</code>を<code>que.c</code>でムーブ構築する。</li>
<li>メンバ変数<code>c</code>のメモリアロケートに<code>alloc</code>を使用する。</li>
<li><code><a href="../../algorithm/make_heap.html">make_heap</a>(c.begin(), c.end(), comp)</code>を呼び出す。</li>
</ol>
</li>
<li>(15) :<ol>
<li>メンバ変数<code>comp</code>を<code>x</code>でコピー構築する。</li>
<li>メンバ変数<code>c</code>のメモリアロケートに<code>alloc</code>を使用する。</li>
<li><code>c.insert(c.end(), first, last)</code>を呼び出す。</li>
<li><code><a href="../../algorithm/make_heap.html">make_heap</a>(c.begin(), c.end(), comp)</code>を呼び出す。</li>
</ol>
</li>
<li>(16) :<ol>
<li>メンバ変数<code>comp</code>を<code>x</code>でコピー構築する。</li>
<li>メンバ変数<code>c</code>を<code>other</code>でコピー構築する。</li>
<li>メンバ変数<code>c</code>のメモリアロケートに<code>alloc</code>を使用する。</li>
<li><code>c.insert(c.end(), first, last)</code>を呼び出す。</li>
<li><code><a href="../../algorithm/make_heap.html">make_heap</a>(c.begin(), c.end(), comp)</code>を呼び出す。</li>
</ol>
</li>
<li>(17) :<ol>
<li>メンバ変数<code>comp</code>を<code>x</code>でコピー構築する。</li>
<li>メンバ変数<code>c</code>を<code>other</code>でムーブ構築する。</li>
<li>メンバ変数<code>c</code>のメモリアロケートに<code>alloc</code>を使用する。</li>
<li><code>c.insert(c.end(), first, last)</code>を呼び出す。</li>
<li><code><a href="../../algorithm/make_heap.html">make_heap</a>(c.begin(), c.end(), comp)</code>を呼び出す。</li>
</ol>
</li>
<li>(18) :<ol>
<li>メンバ変数<code>comp</code>を<code>x</code>でコピー構築する。</li>
<li><code>c.insert(c.end(), ranges::begin(rg), ranges::end(rg))</code>を呼び出す。</li>
<li><code><a href="../../algorithm/make_heap.html">make_heap</a>(c.begin(), c.end(), comp)</code>を呼び出す。</li>
</ol>
</li>
<li>(19) :<ol>
<li>メンバ変数<code>comp</code>を<code>x</code>でコピー構築する。</li>
<li>メンバ変数<code>c</code>のメモリアロケートに<code>alloc</code>を使用する。</li>
<li><code>c.insert(c.end(), ranges::begin(rg), ranges::end(rg))</code>を呼び出す。</li>
<li><code><a href="../../algorithm/make_heap.html">make_heap</a>(c.begin(), c.end(), comp)</code>を呼び出す。</li>
</ol>
</li>
<li>(20) :<ol>
<li>メンバ変数<code>comp</code>を<a class="cpprefjp-defined-word" data-desc="`T x{};`構文での初期化。組み込み型の場合はゼロ相当の値で、クラス型の場合はデフォルトコンストラクタで初期化する。配列型の場合は各要素が再帰的に値初期化される">値初期化</a>する。</li>
<li>メンバ変数<code>c</code>のメモリアロケートに<code>alloc</code>を使用する。</li>
<li><code>c.insert(c.end(), ranges::begin(rg), ranges::end(rg))</code>を呼び出す。</li>
<li><code><a href="../../algorithm/make_heap.html">make_heap</a>(c.begin(), c.end(), comp)</code>を呼び出す。</li>
</ol>
</li>
</ul>
<h2>例</h2>
<p><div class="yata" id="e985ff0fc56ce4141a6aeaa8be359a6e7aef8a00"><div class="codehilite"><pre><span></span><code><span class="cp">#include <a href="../../iostream.html"><iostream></a></span>
<span class="cp">#include <a href="../../queue.html"><queue></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="k">template</span><span class="w"> </span><span class="o"><</span><span class="k">class</span><span class="w"> </span><span class="nc">PriorityQueue</span><span class="o">></span>
<span class="kt">void</span><span class="w"> </span><span class="n">pop_print</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">name</span><span class="p">,</span><span class="w"> </span><span class="n">PriorityQueue</span><span class="o">&</span><span class="w"> </span><span class="n">que</span><span class="p">)</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">name</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="k">while</span><span class="w"> </span><span class="p">(</span><span class="o">!</span><span class="n"><a href="empty.html">que.empty()</a></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="top.html">que.top()</a></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="n"><a href="pop.html">que.pop()</a></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="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="c1">// デフォルト構築</span>
<span class="w"> </span><span class="n">std</span><span class="o">::</span><span class="n">priority_queue</span><span class="o"><</span><span class="kt">int</span><span class="o">></span><span class="w"> </span><span class="n">que1</span><span class="p">;</span>
<span class="w"> </span><span class="c1">// que1からコピー構築</span>
<span class="w"> </span><span class="n">std</span><span class="o">::</span><span class="n">priority_queue</span><span class="o"><</span><span class="kt">int</span><span class="o">></span><span class="w"> </span><span class="n">que2</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">que1</span><span class="p">;</span>
<span class="w"> </span><span class="c1">// que2からムーブ構築</span>
<span class="w"> </span><span class="n">std</span><span class="o">::</span><span class="n">priority_queue</span><span class="o"><</span><span class="kt">int</span><span class="o">></span><span class="w"> </span><span class="n">que3</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">que2</span><span class="p">);</span>
<span class="w"> </span><span class="c1">// イテレータ範囲から構築</span>
<span class="w"> </span><span class="k">const</span><span class="w"> </span><span class="n"><a href="../../vector/vector.html">std::vector</a></span><span class="o"><</span><span class="kt">int</span><span class="o">></span><span class="w"> </span><span class="n">v</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span><span class="mi">3</span><span class="p">,</span><span class="w"> </span><span class="mi">1</span><span class="p">,</span><span class="w"> </span><span class="mi">4</span><span class="p">};</span>
<span class="w"> </span><span class="n">std</span><span class="o">::</span><span class="n">priority_queue</span><span class="o"><</span><span class="kt">int</span><span class="o">></span><span class="w"> </span><span class="n">que4</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="c1">// イテレータ範囲、比較関数オブジェクト、コンテナから構築</span>
<span class="w"> </span><span class="k">const</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">v2</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span><span class="mi">5</span><span class="p">,</span><span class="w"> </span><span class="mi">2</span><span class="p">};</span>
<span class="w"> </span><span class="n">std</span><span class="o">::</span><span class="n">priority_queue</span><span class="o"><</span><span class="kt">int</span><span class="o">></span><span class="w"> </span><span class="n">que5</span><span class="p">(</span><span class="n"><a href="../../vector/vector/begin.html">v.begin()</a></span><span class="p">,</span><span class="w"> </span><span class="n"><a href="../../vector/vector/end.html">v.end()</a></span><span class="p">,</span><span class="w"> </span><span class="p">{},</span><span class="w"> </span><span class="n">v2</span><span class="p">);</span>
<span class="w"> </span><span class="n">pop_print</span><span class="p">(</span><span class="s">"que3"</span><span class="p">,</span><span class="w"> </span><span class="n">que3</span><span class="p">);</span>
<span class="w"> </span><span class="n">pop_print</span><span class="p">(</span><span class="s">"que4"</span><span class="p">,</span><span class="w"> </span><span class="n">que4</span><span class="p">);</span>
<span class="w"> </span><span class="n">pop_print</span><span class="p">(</span><span class="s">"que5"</span><span class="p">,</span><span class="w"> </span><span class="n">que5</span><span class="p">);</span>
<span class="p">}</span>
</code></pre></div>
</div></p>
<h3>出力</h3>
<p><pre><code>que3 :
que4 : 4 3 1
que5 : 5 4 3 2 1
</code></pre></p>
<h3>処理系</h3>
<ul>
<li><a href="../../../implementation.html#clang">Clang</a>: ??</li>
<li><a href="../../../implementation.html#gcc">GCC</a>: 4.7.0(アロケータ付き初期化以外は使用可能) <span aria-label="検証済" role="img" title="検証済">✅</span></li>
<li><a href="../../../implementation.html#icc">ICC</a>: ??</li>
<li><a href="../../../implementation.html#visual_cpp">Visual C++</a>: ??</li>
</ul>
<h2>参照</h2>
<ul>
<li><a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2018/p0935r0.html" target="_blank">P0935R0 Eradicating unnecessarily explicit default constructors from the standard library</a></li>
<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>