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
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
1415
1416
1417
1418
1419
1420
1421
1422
1423
1424
1425
1426
1427
1428
1429
1430
1431
1432
1433
1434
1435
1436
|
<!DOCTYPE html>
<html lang="en" dir="ltr" class="client-nojs">
<head>
<title>Standard library header <algorithm> - cppreference.com</title>
<meta charset="UTF-8" />
<meta name="generator" content="MediaWiki 1.21.2" />
<link rel="alternate" type="application/x-wiki" title="Edit" href="http://en.cppreference.com/mwiki/index.php?title=cpp/header/algorithm&action=edit" />
<link rel="edit" title="Edit" href="http://en.cppreference.com/mwiki/index.php?title=cpp/header/algorithm&action=edit" />
<link rel="shortcut icon" href="../../../favicon.ico" />
<link rel="search" type="application/opensearchdescription+xml" href="../../../mwiki/opensearch_desc.php" title="cppreference.com (en)" />
<link rel="EditURI" type="application/rsd+xml" href="http://en.cppreference.com/mwiki/api.php?action=rsd" />
<link rel="alternate" type="application/atom+xml" title="cppreference.com Atom feed" href="http://en.cppreference.com/mwiki/index.php?title=Special:RecentChanges&feed=atom" />
<link rel="stylesheet" href="../../../mwiki/load.php%3Fdebug=false&lang=en&modules=ext.gadget.ColiruCompiler%257Cext.rtlcite%257Cmediawiki.legacy.commonPrint%252Cshared%257Cskins.cppreference2&only=styles&skin=cppreference2&*.css" />
<meta name="ResourceLoaderDynamicStyles" content="" />
<link rel="stylesheet" href="../../../mwiki/load.php%3Fdebug=false&lang=en&modules=site&only=styles&skin=cppreference2&*.css" />
<style>a:lang(ar),a:lang(ckb),a:lang(fa),a:lang(kk-arab),a:lang(mzn),a:lang(ps),a:lang(ur){text-decoration:none}#toc{display:none}.editsection{display:none}
/* cache key: mwiki1-mwiki_en_:resourceloader:filter:minify-css:7:472787eddcf4605d11de8c7ef047234f */</style>
<script src="../../../mwiki/load.php%3Fdebug=false&lang=en&modules=startup&only=scripts&skin=cppreference2&*"></script>
<script>if(window.mw){
mw.config.set({"wgCanonicalNamespace":"","wgCanonicalSpecialPageName":false,"wgNamespaceNumber":0,"wgPageName":"cpp/header/algorithm","wgTitle":"cpp/header/algorithm","wgCurRevisionId":57426,"wgArticleId":9750,"wgIsArticle":true,"wgAction":"view","wgUserName":null,"wgUserGroups":["*"],"wgCategories":[],"wgBreakFrames":false,"wgPageContentLanguage":"en","wgSeparatorTransformTable":["",""],"wgDigitTransformTable":["",""],"wgDefaultDateFormat":"dmy","wgMonthNames":["","January","February","March","April","May","June","July","August","September","October","November","December"],"wgMonthNamesShort":["","Jan","Feb","Mar","Apr","May","Jun","Jul","Aug","Sep","Oct","Nov","Dec"],"wgRelevantPageName":"cpp/header/algorithm","wgRestrictionEdit":[],"wgRestrictionMove":[]});
}</script><script>if(window.mw){
mw.loader.implement("user.options",function(){mw.user.options.set({"ccmeonemails":0,"cols":80,"date":"default","diffonly":0,"disablemail":0,"disablesuggest":0,"editfont":"default","editondblclick":0,"editsection":0,"editsectiononrightclick":0,"enotifminoredits":0,"enotifrevealaddr":0,"enotifusertalkpages":1,"enotifwatchlistpages":0,"extendwatchlist":0,"externaldiff":0,"externaleditor":0,"fancysig":0,"forceeditsummary":0,"gender":"unknown","hideminor":0,"hidepatrolled":0,"imagesize":2,"justify":0,"math":1,"minordefault":0,"newpageshidepatrolled":0,"nocache":0,"noconvertlink":0,"norollbackdiff":0,"numberheadings":0,"previewonfirst":0,"previewontop":1,"quickbar":5,"rcdays":7,"rclimit":50,"rememberpassword":0,"rows":25,"searchlimit":20,"showhiddencats":0,"showjumplinks":1,"shownumberswatching":1,"showtoc":0,"showtoolbar":1,"skin":"cppreference2","stubthreshold":0,"thumbsize":2,"underline":2,"uselivepreview":0,"usenewrc":0,"watchcreations":0,"watchdefault":0,"watchdeletion":0,
"watchlistdays":3,"watchlisthideanons":0,"watchlisthidebots":0,"watchlisthideliu":0,"watchlisthideminor":0,"watchlisthideown":0,"watchlisthidepatrolled":0,"watchmoves":0,"wllimit":250,"variant":"en","language":"en","searchNs0":true,"searchNs1":false,"searchNs2":false,"searchNs3":false,"searchNs4":false,"searchNs5":false,"searchNs6":false,"searchNs7":false,"searchNs8":false,"searchNs9":false,"searchNs10":false,"searchNs11":false,"searchNs12":false,"searchNs13":false,"searchNs14":false,"searchNs15":false,"gadget-ColiruCompiler":1});;},{},{});mw.loader.implement("user.tokens",function(){mw.user.tokens.set({"editToken":"+\\","patrolToken":false,"watchToken":false});;},{},{});
/* cache key: mwiki1-mwiki_en_:resourceloader:filter:minify-js:7:ca03345b1e2c4d90a25d968753a73b92 */
}</script>
<script>if(window.mw){
mw.loader.load(["mediawiki.page.startup","mediawiki.legacy.wikibits","mediawiki.legacy.ajax"]);
}</script>
<style type="text/css">/*<![CDATA[*/
.source-cpp {line-height: normal;}
.source-cpp li, .source-cpp pre {
line-height: normal; border: 0px none white;
}
/**
* GeSHi Dynamically Generated Stylesheet
* --------------------------------------
* Dynamically generated stylesheet for cpp
* CSS class: source-cpp, CSS id:
* GeSHi (C) 2004 - 2007 Nigel McNie, 2007 - 2008 Benny Baumann
* (http://qbnz.com/highlighter/ and http://geshi.org/)
* --------------------------------------
*/
.cpp.source-cpp .de1, .cpp.source-cpp .de2 {font: normal normal 1em/1.2em monospace; margin:0; padding:0; background:none; vertical-align:top;}
.cpp.source-cpp {font-family:monospace;}
.cpp.source-cpp .imp {font-weight: bold; color: red;}
.cpp.source-cpp li, .cpp.source-cpp .li1 {font-weight: normal; vertical-align:top;}
.cpp.source-cpp .ln {width:1px;text-align:right;margin:0;padding:0 2px;vertical-align:top;}
.cpp.source-cpp .li2 {font-weight: bold; vertical-align:top;}
.cpp.source-cpp .kw1 {color: #0000dd;}
.cpp.source-cpp .kw2 {color: #0000ff;}
.cpp.source-cpp .kw3 {color: #0000dd;}
.cpp.source-cpp .kw4 {color: #0000ff;}
.cpp.source-cpp .co1 {color: #909090;}
.cpp.source-cpp .co2 {color: #339900;}
.cpp.source-cpp .coMULTI {color: #ff0000; font-style: italic;}
.cpp.source-cpp .es0 {color: #008000; font-weight: bold;}
.cpp.source-cpp .es1 {color: #008000; font-weight: bold;}
.cpp.source-cpp .es2 {color: #008000; font-weight: bold;}
.cpp.source-cpp .es3 {color: #008000; font-weight: bold;}
.cpp.source-cpp .es4 {color: #008000; font-weight: bold;}
.cpp.source-cpp .es5 {color: #008000; font-weight: bold;}
.cpp.source-cpp .br0 {color: #008000;}
.cpp.source-cpp .sy0 {color: #008000;}
.cpp.source-cpp .sy1 {color: #000080;}
.cpp.source-cpp .sy2 {color: #000040;}
.cpp.source-cpp .sy3 {color: #000040;}
.cpp.source-cpp .sy4 {color: #008080;}
.cpp.source-cpp .st0 {color: #008000;}
.cpp.source-cpp .nu0 {color: #000080;}
.cpp.source-cpp .nu6 {color: #000080;}
.cpp.source-cpp .nu8 {color: #000080;}
.cpp.source-cpp .nu12 {color: #000080;}
.cpp.source-cpp .nu16 {color:#000080;}
.cpp.source-cpp .nu17 {color:#000080;}
.cpp.source-cpp .nu18 {color:#000080;}
.cpp.source-cpp .nu19 {color:#000080;}
.cpp.source-cpp .ln-xtra, .cpp.source-cpp li.ln-xtra, .cpp.source-cpp div.ln-xtra {background-color: #ffc;}
.cpp.source-cpp span.xtra { display:block; }
/*]]>*/
</style><!--[if lt IE 7]><style type="text/css">body{behavior:url("/mwiki/skins/cppreference2/csshover.min.htc")}</style><![endif]--></head>
<body class="mediawiki ltr sitedir-ltr ns-0 ns-subject page-cpp_header_algorithm skin-cppreference2 action-view cpp-navbar">
<!-- header -->
<div id="mw-head" class="noprint">
<div id="cpp-head-first-base">
<div id="cpp-head-first">
<h5><a href="../../../index.html">
cppreference.com </a></h5>
<div id="cpp-head-search">
<!-- 0 -->
<div id="p-search">
<h5><label for="searchInput">Search</label></h5>
<form action="http://en.cppreference.com/mwiki/index.php" id="searchform">
<input type='hidden' name="title" value="Special:Search"/>
<div id="simpleSearch">
<input name="search" title="Search cppreference.com [f]" accesskey="f" id="searchInput" /> <button type="submit" name="button" title="Search the pages for this text" id="searchButton"><img src="../../../mwiki/skins/cppreference2/images/search-ltr.png%3F303" alt="Search" /></button> </div>
</form>
</div>
<!-- /0 -->
</div>
<div id="cpp-head-personal">
<!-- 0 -->
<div id="p-personal" class="">
<span id="pt-createaccount"><a href="http://en.cppreference.com/mwiki/index.php?title=Special:UserLogin&returnto=cpp%2Fheader%2Falgorithm&type=signup">Create account</a></span> <div class="menu">
<ul>
<li id="pt-login"><a href="http://en.cppreference.com/mwiki/index.php?title=Special:UserLogin&returnto=cpp%2Fheader%2Falgorithm" title="You are encouraged to log in; however, it is not mandatory [o]" accesskey="o">Log in</a></li> </ul>
</div>
</div>
<!-- /0 -->
</div>
</div>
</div>
<div id="cpp-head-second-base">
<div id="cpp-head-second">
<div id="cpp-head-tools-left">
<!-- 0 -->
<div id="p-namespaces" class="vectorTabs">
<h5>Namespaces</h5>
<ul>
<li id="ca-nstab-main" class="selected"><span><a href="algorithm.html" title="View the content page [c]" accesskey="c">Page</a></span></li>
<li id="ca-talk"><span><a href="http://en.cppreference.com/w/Talk:cpp/header/algorithm" title="Discussion about the content page [t]" accesskey="t">Discussion</a></span></li>
</ul>
</div>
<!-- /0 -->
<!-- 1 -->
<div id="p-variants" class="vectorMenu emptyPortlet">
<h5><span>Variants</span><a href="algorithm.html#"></a></h5>
<div class="menu">
<ul>
</ul>
</div>
</div>
<!-- /1 -->
</div>
<div id="cpp-head-tools-right">
<!-- 0 -->
<div id="p-views" class="vectorTabs">
<h5>Views</h5>
<ul>
<li id="ca-view" class="selected"><span><a href="algorithm.html" >View</a></span></li>
<li id="ca-edit"><span><a href="http://en.cppreference.com/mwiki/index.php?title=cpp/header/algorithm&action=edit" title="You can edit this page. Please use the preview button before saving [e]" accesskey="e">Edit</a></span></li>
<li id="ca-history" class="collapsible"><span><a href="http://en.cppreference.com/mwiki/index.php?title=cpp/header/algorithm&action=history" title="Past revisions of this page [h]" accesskey="h">History</a></span></li>
</ul>
</div>
<!-- /0 -->
<!-- 1 -->
<div id="p-cactions" class="vectorMenu emptyPortlet">
<h5><span>Actions</span><a href="algorithm.html#"></a></h5>
<div class="menu">
<ul>
</ul>
</div>
</div>
<!-- /1 -->
</div>
</div>
</div>
</div>
<!-- /header -->
<!-- content -->
<div id="cpp-content-base">
<div id="content">
<a id="top"></a>
<div id="mw-js-message" style="display:none;"></div>
<!-- firstHeading -->
<h1 id="firstHeading" class="firstHeading"><span style="font-size:0.7em; line-height:130%">Standard library header</span> <algorithm></h1>
<!-- /firstHeading -->
<!-- bodyContent -->
<div id="bodyContent">
<!-- tagline -->
<div id="siteSub">From cppreference.com</div>
<!-- /tagline -->
<!-- subtitle -->
<div id="contentSub"><span class="subpages">< <a href="../../cpp.html" title="cpp">cpp</a>‎ | <a href="../header.html" title="cpp/header">header</a></span></div>
<!-- /subtitle -->
<!-- bodycontent -->
<div id="mw-content-text" lang="en" dir="ltr" class="mw-content-ltr"><div class="t-navbar" style=""><div class="t-navbar-sep"> </div><div class="t-navbar-head"><a href="../../cpp.html" title="cpp"> C++</a><div class="t-navbar-menu"><div><div><table class="t-nv-begin" cellpadding="0" style="line-height:1.1em;">
<tr class="t-nv"><td colspan="5"> <a href="../language.1.html" title="cpp/language"> Language</a> </td></tr>
<tr class="t-nv"><td colspan="5"> <a href="../header.html" title="cpp/header"> Standard library headers</a> </td></tr>
<tr class="t-nv"><td colspan="5"> <a href="../concept.html" title="cpp/concept"> Concepts</a> </td></tr>
<tr class="t-nv"><td colspan="5"> <a href="../utility.html" title="cpp/utility"> Utilities library</a> </td></tr>
<tr class="t-nv"><td colspan="5"> <a href="../string.html" title="cpp/string"> Strings library</a> </td></tr>
<tr class="t-nv"><td colspan="5"> <a href="../container.html" title="cpp/container"> Containers library</a> </td></tr>
<tr class="t-nv"><td colspan="5"> <a href="../algorithm.html" title="cpp/algorithm"> Algorithms library</a> </td></tr>
<tr class="t-nv"><td colspan="5"> <a href="../iterator.html" title="cpp/iterator"> Iterators library</a> </td></tr>
<tr class="t-nv"><td colspan="5"> <a href="../numeric.html" title="cpp/numeric"> Numerics library</a> </td></tr>
<tr class="t-nv"><td colspan="5"> <a href="../io.html" title="cpp/io"> Input/output library</a> </td></tr>
<tr class="t-nv"><td colspan="5"> <a href="../locale.html" title="cpp/locale"> Localizations library</a> </td></tr>
<tr class="t-nv"><td colspan="5"> <a href="../regex.html" title="cpp/regex"> Regular expressions library</a> <span class="t-mark-rev t-since-cxx11">(C++11)</span> </td></tr>
<tr class="t-nv"><td colspan="5"> <a href="../atomic.html" title="cpp/atomic"> Atomic operations library</a> <span class="t-mark-rev t-since-cxx11">(C++11)</span> </td></tr>
<tr class="t-nv"><td colspan="5"> <a href="../thread.html" title="cpp/thread"> Thread support library</a> <span class="t-mark-rev t-since-cxx11">(C++11)</span> </td></tr>
<tr class="t-nv"><td colspan="5"> <a href="../experimental.html" title="cpp/experimental"> Technical Specifications</a> </td></tr>
</table></div><div><span class="editsection noprint plainlinks" title="Edit this template"><a rel="nofollow" class="external text" href="http://en.cppreference.com/mwiki/index.php?title=Template:cpp/navbar_content&action=edit">[edit]</a></span></div></div></div></div><div class="t-navbar-sep"> </div><div class="t-navbar-head"><a href="../header.html" title="cpp/header"> Standard Library header files </a><div class="t-navbar-menu"><div><div style="display:inline-block">
<div><table class="t-nv-begin" cellpadding="0" style="">
<tr class="t-nv-h1"><td colspan="5"> Language Support</td></tr>
<tr class="t-nv-col-table"><td><div><table class="t-nv-begin" cellpadding="0" style="">
<tr class="t-nv"><td colspan="5"> <a href="cstddef.html" title="cpp/header/cstddef"><tt><cstddef></tt></a></td></tr>
<tr class="t-nv"><td colspan="5"> <a href="limits.html" title="cpp/header/limits"><tt><limits></tt></a></td></tr>
<tr class="t-nv"><td colspan="5"> <a href="climits.html" title="cpp/header/climits"><tt><climits></tt></a></td></tr>
<tr class="t-nv"><td colspan="5"> <a href="cfloat.html" title="cpp/header/cfloat"><tt><cfloat></tt></a></td></tr>
<tr class="t-nv"><td colspan="5"> <a href="cstdint.html" title="cpp/header/cstdint"><tt><cstdint></tt></a></td></tr>
<tr class="t-nv"><td colspan="5"> <a href="new.html" title="cpp/header/new"><tt><new></tt></a></td></tr>
<tr class="t-nv"><td colspan="5"> <a href="typeinfo.html" title="cpp/header/typeinfo"><tt><typeinfo></tt></a></td></tr>
<tr class="t-nv"><td colspan="5"> <a href="exception.html" title="cpp/header/exception"><tt><exception></tt></a></td></tr>
<tr class="t-nv"><td colspan="5"> <a href="ciso646.html" title="cpp/header/ciso646"><tt><ciso646></tt></a></td></tr>
</table></div></td><td><div><table class="t-nv-begin" cellpadding="0" style="">
<tr class="t-nv"><td colspan="5"> <a href="initializer_list.html" title="cpp/header/initializer list"><tt><initializer_list></tt></a></td></tr>
<tr class="t-nv"><td colspan="5"> <a href="csignal.html" title="cpp/header/csignal"><tt><csignal></tt></a></td></tr>
<tr class="t-nv"><td colspan="5"> <a href="csetjmp.html" title="cpp/header/csetjmp"><tt><csetjmp></tt></a></td></tr>
<tr class="t-nv"><td colspan="5"> <a href="cstdalign.html" title="cpp/header/cstdalign"><tt><cstdalign></tt></a></td></tr>
<tr class="t-nv"><td colspan="5"> <a href="cstdarg.html" title="cpp/header/cstdarg"><tt><cstdarg></tt></a></td></tr>
<tr class="t-nv"><td colspan="5"> <a href="cstdbool.html" title="cpp/header/cstdbool"><tt><cstdbool></tt></a></td></tr>
<tr class="t-nv"><td colspan="5"> <a href="cstdlib.html" title="cpp/header/cstdlib"><tt><cstdlib></tt></a></td></tr>
<tr class="t-nv"><td colspan="5"> <a href="ctime.html" title="cpp/header/ctime"><tt><ctime></tt></a></td></tr>
</table></div></td></tr>
<tr class="t-nv-h1"><td colspan="5"> Diagnostics</td></tr>
<tr class="t-nv-col-table"><td><div><table class="t-nv-begin" cellpadding="0" style="">
<tr class="t-nv"><td colspan="5"> <a href="stdexcept.html" title="cpp/header/stdexcept"><tt><stdexcept></tt></a></td></tr>
<tr class="t-nv"><td colspan="5"> <a href="cassert.html" title="cpp/header/cassert"><tt><cassert></tt></a></td></tr>
</table></div></td><td><div><table class="t-nv-begin" cellpadding="0" style="">
<tr class="t-nv"><td colspan="5"> <a href="cerrno.html" title="cpp/header/cerrno"><tt><cerrno></tt></a></td></tr>
<tr class="t-nv"><td colspan="5"> <a href="system_error.html" title="cpp/header/system error"><tt><system_error></tt></a></td></tr>
</table></div></td></tr>
<tr class="t-nv-h1"><td colspan="5"> General utilities</td></tr>
<tr class="t-nv-col-table"><td><div><table class="t-nv-begin" cellpadding="0" style="">
<tr class="t-nv"><td colspan="5"> <a href="utility.html" title="cpp/header/utility"><tt><utility></tt></a></td></tr>
<tr class="t-nv"><td colspan="5"> <a href="tuple.html" title="cpp/header/tuple"><tt><tuple></tt></a></td></tr>
<tr class="t-nv"><td colspan="5"> <a href="bitset.html" title="cpp/header/bitset"><tt><bitset></tt></a></td></tr>
<tr class="t-nv"><td colspan="5"> <a href="memory.html" title="cpp/header/memory"><tt><memory></tt></a></td></tr>
<tr class="t-nv"><td colspan="5"> <a href="cstdlib.html" title="cpp/header/cstdlib"><tt><cstdlib></tt></a></td></tr>
<tr class="t-nv"><td colspan="5"> <a href="cstring.html" title="cpp/header/cstring"><tt><cstring></tt></a></td></tr>
<tr class="t-nv"><td colspan="5"> <a href="functional.html" title="cpp/header/functional"><tt><functional></tt></a></td></tr>
</table></div></td><td><div><table class="t-nv-begin" cellpadding="0" style="">
<tr class="t-nv"><td colspan="5"> <a href="type_traits.html" title="cpp/header/type traits"><tt><type_traits></tt></a></td></tr>
<tr class="t-nv"><td colspan="5"> <a href="ratio.html" title="cpp/header/ratio"><tt><ratio></tt></a></td></tr>
<tr class="t-nv"><td colspan="5"> <a href="chrono.html" title="cpp/header/chrono"><tt><chrono></tt></a></td></tr>
<tr class="t-nv"><td colspan="5"> <a href="ctime.html" title="cpp/header/ctime"><tt><ctime></tt></a></td></tr>
<tr class="t-nv"><td colspan="5"> <a href="scoped_allocator.html" title="cpp/header/scoped allocator"><tt><scoped_allocator></tt></a></td></tr>
<tr class="t-nv"><td colspan="5"> <a href="typeindex.html" title="cpp/header/typeindex"><tt><typeindex></tt></a></td></tr>
</table></div></td></tr>
<tr class="t-nv-h1"><td colspan="5"> Strings</td></tr>
<tr class="t-nv-col-table"><td><div><table class="t-nv-begin" cellpadding="0" style="">
<tr class="t-nv"><td colspan="5"> <a href="string.html" title="cpp/header/string"><tt><string></tt></a></td></tr>
<tr class="t-nv"><td colspan="5"> <a href="cctype.html" title="cpp/header/cctype"><tt><cctype></tt></a></td></tr>
<tr class="t-nv"><td colspan="5"> <a href="cwctype.html" title="cpp/header/cwctype"><tt><cwctype></tt></a></td></tr>
<tr class="t-nv"><td colspan="5"> <a href="cstring.html" title="cpp/header/cstring"><tt><cstring></tt></a></td></tr>
</table></div></td><td><div><table class="t-nv-begin" cellpadding="0" style="">
<tr class="t-nv"><td colspan="5"> <a href="cwchar.html" title="cpp/header/cwchar"><tt><cwchar></tt></a></td></tr>
<tr class="t-nv"><td colspan="5"> <a href="cstdlib.html" title="cpp/header/cstdlib"><tt><cstdlib></tt></a></td></tr>
<tr class="t-nv"><td colspan="5"> <a href="cuchar.html" title="cpp/header/cuchar"><tt><cuchar></tt></a></td></tr>
</table></div></td></tr>
<tr class="t-nv-h1"><td colspan="5"> Localization</td></tr>
<tr class="t-nv-col-table"><td><div><table class="t-nv-begin" cellpadding="0" style="">
<tr class="t-nv"><td colspan="5"> <a href="locale.html" title="cpp/header/locale"><tt><locale></tt></a></td></tr>
<tr class="t-nv"><td colspan="5"> <a href="codecvt.html" title="cpp/header/codecvt"><tt><codecvt></tt></a></td></tr>
<tr class="t-nv"><td colspan="5"> <a href="clocale.html" title="cpp/header/clocale"><tt><clocale></tt></a></td></tr>
</table></div></td></tr>
</table></div>
</div>
<div style="display:inline-block">
<div><table class="t-nv-begin" cellpadding="0" style="">
<tr class="t-nv-h1"><td colspan="5"> Containers</td></tr>
<tr class="t-nv-col-table"><td><div><table class="t-nv-begin" cellpadding="0" style="">
<tr class="t-nv"><td colspan="5"> <a href="array.html" title="cpp/header/array"><tt><array></tt></a></td></tr>
<tr class="t-nv"><td colspan="5"> <a href="deque.html" title="cpp/header/deque"><tt><deque></tt></a></td></tr>
<tr class="t-nv"><td colspan="5"> <a href="forward_list.html" title="cpp/header/forward list"><tt><forward_list></tt></a></td></tr>
<tr class="t-nv"><td colspan="5"> <a href="list.html" title="cpp/header/list"><tt><list></tt></a></td></tr>
<tr class="t-nv"><td colspan="5"> <a href="vector.html" title="cpp/header/vector"><tt><vector></tt></a></td></tr>
</table></div></td><td><div><table class="t-nv-begin" cellpadding="0" style="">
<tr class="t-nv"><td colspan="5"> <a href="map.html" title="cpp/header/map"><tt><map></tt></a></td></tr>
<tr class="t-nv"><td colspan="5"> <a href="set.html" title="cpp/header/set"><tt><set></tt></a></td></tr>
<tr class="t-nv"><td colspan="5"> <a href="unordered_map.html" title="cpp/header/unordered map"><tt><unordered_map></tt></a></td></tr>
<tr class="t-nv"><td colspan="5"> <a href="unordered_set.html" title="cpp/header/unordered set"><tt><unordered_set></tt></a></td></tr>
<tr class="t-nv"><td colspan="5"> <a href="queue.html" title="cpp/header/queue"><tt><queue></tt></a></td></tr>
<tr class="t-nv"><td colspan="5"> <a href="stack.html" title="cpp/header/stack"><tt><stack></tt></a></td></tr>
</table></div></td></tr>
<tr class="t-nv-h1"><td colspan="5"> Iterators</td></tr>
<tr class="t-nv-col-table"><td><div><table class="t-nv-begin" cellpadding="0" style="">
<tr class="t-nv"><td colspan="5"> <a href="iterator.html" title="cpp/header/iterator"><tt><iterator></tt></a></td></tr>
</table></div></td></tr>
<tr class="t-nv-h1"><td colspan="5"> Algorithms</td></tr>
<tr class="t-nv-col-table"><td><div><table class="t-nv-begin" cellpadding="0" style="">
<tr class="t-nv"><td colspan="5"> <strong class="selflink"><tt><algorithm></tt></strong></td></tr>
</table></div></td><td><div><table class="t-nv-begin" cellpadding="0" style="">
<tr class="t-nv"><td colspan="5"> <a href="cstdlib.html" title="cpp/header/cstdlib"><tt><cstdlib></tt></a></td></tr>
</table></div></td></tr>
<tr class="t-nv-h1"><td colspan="5"> Numerics</td></tr>
<tr class="t-nv-col-table"><td><div><table class="t-nv-begin" cellpadding="0" style="">
<tr class="t-nv"><td colspan="5"> <a href="cfenv.html" title="cpp/header/cfenv"><tt><cfenv></tt></a></td></tr>
<tr class="t-nv"><td colspan="5"> <a href="complex.html" title="cpp/header/complex"><tt><complex></tt></a></td></tr>
<tr class="t-nv"><td colspan="5"> <a href="random.html" title="cpp/header/random"><tt><random></tt></a></td></tr>
<tr class="t-nv"><td colspan="5"> <a href="valarray.html" title="cpp/header/valarray"><tt><valarray></tt></a></td></tr>
</table></div></td><td><div><table class="t-nv-begin" cellpadding="0" style="">
<tr class="t-nv"><td colspan="5"> <a href="numeric.html" title="cpp/header/numeric"><tt><numeric></tt></a></td></tr>
<tr class="t-nv"><td colspan="5"> <a href="cmath.html" title="cpp/header/cmath"><tt><cmath></tt></a></td></tr>
<tr class="t-nv"><td colspan="5"> <a href="ctgmath.html" title="cpp/header/ctgmath"><tt><ctgmath></tt></a></td></tr>
<tr class="t-nv"><td colspan="5"> <a href="cstdlib.html" title="cpp/header/cstdlib"><tt><cstdlib></tt></a></td></tr>
</table></div></td></tr>
<tr class="t-nv-h1"><td colspan="5"> Input/Output</td></tr>
<tr class="t-nv-col-table"><td><div><table class="t-nv-begin" cellpadding="0" style="">
<tr class="t-nv"><td colspan="5"> <a href="iosfwd.html" title="cpp/header/iosfwd"><tt><iosfwd></tt></a></td></tr>
<tr class="t-nv"><td colspan="5"> <a href="iostream.html" title="cpp/header/iostream"><tt><iostream></tt></a></td></tr>
<tr class="t-nv"><td colspan="5"> <a href="ios.html" title="cpp/header/ios"><tt><ios></tt></a></td></tr>
<tr class="t-nv"><td colspan="5"> <a href="streambuf.html" title="cpp/header/streambuf"><tt><streambuf></tt></a></td></tr>
<tr class="t-nv"><td colspan="5"> <a href="istream.html" title="cpp/header/istream"><tt><istream></tt></a></td></tr>
<tr class="t-nv"><td colspan="5"> <a href="ostream.html" title="cpp/header/ostream"><tt><ostream></tt></a></td></tr>
</table></div></td><td><div><table class="t-nv-begin" cellpadding="0" style="">
<tr class="t-nv"><td colspan="5"> <a href="iomanip.html" title="cpp/header/iomanip"><tt><iomanip></tt></a></td></tr>
<tr class="t-nv"><td colspan="5"> <a href="sstream.html" title="cpp/header/sstream"><tt><sstream></tt></a></td></tr>
<tr class="t-nv"><td colspan="5"> <a href="fstream.html" title="cpp/header/fstream"><tt><fstream></tt></a></td></tr>
<tr class="t-nv"><td colspan="5"> <a href="cstdio.html" title="cpp/header/cstdio"><tt><cstdio></tt></a></td></tr>
<tr class="t-nv"><td colspan="5"> <a href="cinttypes.html" title="cpp/header/cinttypes"><tt><cinttypes></tt></a></td></tr>
</table></div></td></tr>
<tr class="t-nv-h1"><td colspan="5"> Regular expressions</td></tr>
<tr class="t-nv-col-table"><td><div><table class="t-nv-begin" cellpadding="0" style="">
<tr class="t-nv"><td colspan="5"> <a href="regex.html" title="cpp/header/regex"><tt><regex></tt></a></td></tr>
</table></div></td></tr>
<tr class="t-nv-h1"><td colspan="5"> Thread support</td></tr>
<tr class="t-nv-col-table"><td><div><table class="t-nv-begin" cellpadding="0" style="">
<tr class="t-nv"><td colspan="5"> <a href="thread.html" title="cpp/header/thread"><tt><thread></tt></a></td></tr>
<tr class="t-nv"><td colspan="5"> <a href="mutex.html" title="cpp/header/mutex"><tt><mutex></tt></a></td></tr>
<tr class="t-nv"><td colspan="5"> <a href="atomic.html" title="cpp/header/atomic"><tt><atomic></tt></a></td></tr>
</table></div></td><td><div><table class="t-nv-begin" cellpadding="0" style="">
<tr class="t-nv"><td colspan="5"> <a href="shared_mutex.html" title="cpp/header/shared mutex"><tt><shared_mutex></tt></a></td></tr>
<tr class="t-nv"><td colspan="5"> <a href="condition_variable.html" title="cpp/header/condition variable"><tt><condition_variable></tt></a></td></tr>
<tr class="t-nv"><td colspan="5"> <a href="future.html" title="cpp/header/future"><tt><future></tt></a></td></tr>
</table></div></td></tr>
</table></div>
</div><div><span class="editsection noprint plainlinks" title="Edit this template"><a rel="nofollow" class="external text" href="http://en.cppreference.com/mwiki/index.php?title=Template:cpp/header/navbar_content&action=edit">[edit]</a></span></div></div></div></div><div class="t-navbar-sep"> </div></div>
<p>This header is part of the <a href="../algorithm.html" title="cpp/algorithm">algorithm</a> library.
</p>
<table id="toc" class="toc"><tr><td><div id="toctitle"><h2>Contents</h2></div>
<ul>
<li class="toclevel-1 tocsection-1"><a href="algorithm.html#Functions"><span class="tocnumber">1</span> <span class="toctext">Functions</span></a>
<ul>
<li class="toclevel-2"><a href="algorithm.html#Non-modifying_sequence_operations"><span class="tocnumber">1.1</span> <span class="toctext">Non-modifying sequence operations</span></a></li>
<li class="toclevel-2"><a href="algorithm.html#Modifying_sequence_operations"><span class="tocnumber">1.2</span> <span class="toctext">Modifying sequence operations</span></a></li>
<li class="toclevel-2"><a href="algorithm.html#Partitioning_operations"><span class="tocnumber">1.3</span> <span class="toctext">Partitioning operations</span></a></li>
<li class="toclevel-2"><a href="algorithm.html#Sorting_operations_.28on_sorted_ranges.29"><span class="tocnumber">1.4</span> <span class="toctext">Sorting operations (on sorted ranges)</span></a></li>
<li class="toclevel-2"><a href="algorithm.html#Binary_search_operations_.28on_sorted_ranges.29"><span class="tocnumber">1.5</span> <span class="toctext">Binary search operations (on sorted ranges)</span></a></li>
<li class="toclevel-2"><a href="algorithm.html#Set_operations_.28on_sorted_ranges.29"><span class="tocnumber">1.6</span> <span class="toctext">Set operations (on sorted ranges)</span></a></li>
<li class="toclevel-2"><a href="algorithm.html#Heap_operations"><span class="tocnumber">1.7</span> <span class="toctext">Heap operations</span></a></li>
<li class="toclevel-2"><a href="algorithm.html#Minimum.2Fmaximum_operations"><span class="tocnumber">1.8</span> <span class="toctext">Minimum/maximum operations</span></a></li>
</ul>
</li>
<li class="toclevel-1 tocsection-2"><a href="algorithm.html#Synopsis"><span class="tocnumber">2</span> <span class="toctext">Synopsis</span></a></li>
</ul>
</td></tr></table>
<h3><span class="editsection">[<a href="http://en.cppreference.com/mwiki/index.php?title=cpp/header/algorithm&action=edit&section=1" title="Edit section: Functions">edit</a>]</span> <span class="mw-headline" id="Functions">Functions</span></h3>
<table class="t-dsc-begin">
<tr>
<td colspan="2"> <h5> <span class="mw-headline" id="Non-modifying_sequence_operations"> Non-modifying sequence operations </span></h5>
</td></tr>
<tr class="t-dsc">
<td> <div class="t-dsc-member-div"><div><a href="../algorithm/all_any_none_of.html" title="cpp/algorithm/all any none of"> <span class="t-lines"><span>all_of</span><span>any_of</span><span>none_of</span></span></a></div><div><span class="t-lines"><span><span class="t-mark-rev t-since-cxx11">(C++11)</span></span><span><span class="t-mark-rev t-since-cxx11">(C++11)</span></span><span><span class="t-mark-rev t-since-cxx11">(C++11)</span></span></span></div></div>
</td>
<td> checks if a predicate is <span class="t-c"><span class="mw-geshi cpp source-cpp"><span class="kw2">true</span></span></span> for all, any or none of the elements in a range <br /> <span class="t-mark">(function template)</span> <span class="editsection noprint plainlinks" title="Edit this template"><a rel="nofollow" class="external text" href="http://en.cppreference.com/mwiki/index.php?title=Template:cpp/algorithm/dsc_all_any_none_of&action=edit">[edit]</a></span>
</td></tr>
<tr class="t-dsc">
<td> <div class="t-dsc-member-div"><div><a href="../algorithm/for_each.html" title="cpp/algorithm/for each"> <span class="t-lines"><span>for_each</span></span></a></div></div>
</td>
<td> applies a function to a range of elements <br /> <span class="t-mark">(function template)</span> <span class="editsection noprint plainlinks" title="Edit this template"><a rel="nofollow" class="external text" href="http://en.cppreference.com/mwiki/index.php?title=Template:cpp/algorithm/dsc_for_each&action=edit">[edit]</a></span>
</td></tr>
<tr class="t-dsc">
<td> <div class="t-dsc-member-div"><div><a href="../algorithm/count.html" title="cpp/algorithm/count"> <span class="t-lines"><span>count</span><span>count_if</span></span></a></div></div>
</td>
<td> returns the number of elements satisfying specific criteria <br /> <span class="t-mark">(function template)</span> <span class="editsection noprint plainlinks" title="Edit this template"><a rel="nofollow" class="external text" href="http://en.cppreference.com/mwiki/index.php?title=Template:cpp/algorithm/dsc_count&action=edit">[edit]</a></span>
</td></tr>
<tr class="t-dsc">
<td> <div class="t-dsc-member-div"><div><a href="../algorithm/mismatch.html" title="cpp/algorithm/mismatch"> <span class="t-lines"><span>mismatch</span></span></a></div></div>
</td>
<td> finds the first position where two ranges differ <br /> <span class="t-mark">(function template)</span> <span class="editsection noprint plainlinks" title="Edit this template"><a rel="nofollow" class="external text" href="http://en.cppreference.com/mwiki/index.php?title=Template:cpp/algorithm/dsc_mismatch&action=edit">[edit]</a></span>
</td></tr>
<tr class="t-dsc">
<td> <div class="t-dsc-member-div"><div><a href="../algorithm/equal.html" title="cpp/algorithm/equal"> <span class="t-lines"><span>equal</span></span></a></div></div>
</td>
<td> determines if two sets of elements are the same <br /> <span class="t-mark">(function template)</span> <span class="editsection noprint plainlinks" title="Edit this template"><a rel="nofollow" class="external text" href="http://en.cppreference.com/mwiki/index.php?title=Template:cpp/algorithm/dsc_equal&action=edit">[edit]</a></span>
</td></tr>
<tr class="t-dsc">
<td> <div class="t-dsc-member-div"><div><a href="../algorithm/find.html" title="cpp/algorithm/find"> <span class="t-lines"><span>find</span><span>find_if</span><span>find_if_not</span></span></a></div><div><span class="t-lines"><span></span><span></span><span><span class="t-mark-rev t-since-cxx11">(C++11)</span></span></span></div></div>
</td>
<td> finds the first element satisfying specific criteria <br /> <span class="t-mark">(function template)</span> <span class="editsection noprint plainlinks" title="Edit this template"><a rel="nofollow" class="external text" href="http://en.cppreference.com/mwiki/index.php?title=Template:cpp/algorithm/dsc_find&action=edit">[edit]</a></span>
</td></tr>
<tr class="t-dsc">
<td> <div class="t-dsc-member-div"><div><a href="../algorithm/find_end.html" title="cpp/algorithm/find end"> <span class="t-lines"><span>find_end</span></span></a></div></div>
</td>
<td> finds the last sequence of elements in a certain range <br /> <span class="t-mark">(function template)</span> <span class="editsection noprint plainlinks" title="Edit this template"><a rel="nofollow" class="external text" href="http://en.cppreference.com/mwiki/index.php?title=Template:cpp/algorithm/dsc_find_end&action=edit">[edit]</a></span>
</td></tr>
<tr class="t-dsc">
<td> <div class="t-dsc-member-div"><div><a href="../algorithm/find_first_of.html" title="cpp/algorithm/find first of"> <span class="t-lines"><span>find_first_of</span></span></a></div></div>
</td>
<td> searches for any one of a set of elements <br /> <span class="t-mark">(function template)</span> <span class="editsection noprint plainlinks" title="Edit this template"><a rel="nofollow" class="external text" href="http://en.cppreference.com/mwiki/index.php?title=Template:cpp/algorithm/dsc_find_first_of&action=edit">[edit]</a></span>
</td></tr>
<tr class="t-dsc">
<td> <div class="t-dsc-member-div"><div><a href="../algorithm/adjacent_find.html" title="cpp/algorithm/adjacent find"> <span class="t-lines"><span>adjacent_find</span></span></a></div></div>
</td>
<td> finds the first two adjacent items that are equal (or satisfy a given predicate) <br /> <span class="t-mark">(function template)</span> <span class="editsection noprint plainlinks" title="Edit this template"><a rel="nofollow" class="external text" href="http://en.cppreference.com/mwiki/index.php?title=Template:cpp/algorithm/dsc_adjacent_find&action=edit">[edit]</a></span>
</td></tr>
<tr class="t-dsc">
<td> <div class="t-dsc-member-div"><div><a href="../algorithm/search.html" title="cpp/algorithm/search"> <span class="t-lines"><span>search</span></span></a></div></div>
</td>
<td> searches for a range of elements <br /> <span class="t-mark">(function template)</span> <span class="editsection noprint plainlinks" title="Edit this template"><a rel="nofollow" class="external text" href="http://en.cppreference.com/mwiki/index.php?title=Template:cpp/algorithm/dsc_search&action=edit">[edit]</a></span>
</td></tr>
<tr class="t-dsc">
<td> <div class="t-dsc-member-div"><div><a href="../algorithm/search_n.html" title="cpp/algorithm/search n"> <span class="t-lines"><span>search_n</span></span></a></div></div>
</td>
<td> searches for a number consecutive copies of an element in a range <br /> <span class="t-mark">(function template)</span> <span class="editsection noprint plainlinks" title="Edit this template"><a rel="nofollow" class="external text" href="http://en.cppreference.com/mwiki/index.php?title=Template:cpp/algorithm/dsc_search_n&action=edit">[edit]</a></span>
</td></tr>
<tr>
<td colspan="2"> <h5> <span class="mw-headline" id="Modifying_sequence_operations"> Modifying sequence operations </span></h5>
</td></tr>
<tr class="t-dsc">
<td> <div class="t-dsc-member-div"><div><a href="../algorithm/copy.html" title="cpp/algorithm/copy"> <span class="t-lines"><span>copy</span><span>copy_if</span></span></a></div><div><span class="t-lines"><span></span><span><span class="t-mark-rev t-since-cxx11">(C++11)</span></span></span></div></div>
</td>
<td> copies a range of elements to a new location <br /> <span class="t-mark">(function template)</span> <span class="editsection noprint plainlinks" title="Edit this template"><a rel="nofollow" class="external text" href="http://en.cppreference.com/mwiki/index.php?title=Template:cpp/algorithm/dsc_copy&action=edit">[edit]</a></span>
</td></tr>
<tr class="t-dsc">
<td> <div class="t-dsc-member-div"><div><a href="../algorithm/copy_n.html" title="cpp/algorithm/copy n"> <span class="t-lines"><span>copy_n</span></span></a></div><div><span class="t-lines"><span><span class="t-mark-rev t-since-cxx11">(C++11)</span></span></span></div></div>
</td>
<td> copies a number of elements to a new location <br /> <span class="t-mark">(function template)</span> <span class="editsection noprint plainlinks" title="Edit this template"><a rel="nofollow" class="external text" href="http://en.cppreference.com/mwiki/index.php?title=Template:cpp/algorithm/dsc_copy_n&action=edit">[edit]</a></span>
</td></tr>
<tr class="t-dsc">
<td> <div class="t-dsc-member-div"><div><a href="../algorithm/copy_backward.html" title="cpp/algorithm/copy backward"> <span class="t-lines"><span>copy_backward</span></span></a></div></div>
</td>
<td> copies a range of elements in backwards order <br /> <span class="t-mark">(function template)</span> <span class="editsection noprint plainlinks" title="Edit this template"><a rel="nofollow" class="external text" href="http://en.cppreference.com/mwiki/index.php?title=Template:cpp/algorithm/dsc_copy_backward&action=edit">[edit]</a></span>
</td></tr>
<tr class="t-dsc">
<td> <div class="t-dsc-member-div"><div><a href="../algorithm/move.html" title="cpp/algorithm/move"> <span class="t-lines"><span>move</span></span></a></div><div><span class="t-lines"><span><span class="t-mark-rev t-since-cxx11">(C++11)</span></span></span></div></div>
</td>
<td> moves a range of elements to a new location <br /> <span class="t-mark">(function template)</span> <span class="editsection noprint plainlinks" title="Edit this template"><a rel="nofollow" class="external text" href="http://en.cppreference.com/mwiki/index.php?title=Template:cpp/algorithm/dsc_move&action=edit">[edit]</a></span>
</td></tr>
<tr class="t-dsc">
<td> <div class="t-dsc-member-div"><div><a href="../algorithm/move_backward.html" title="cpp/algorithm/move backward"> <span class="t-lines"><span>move_backward</span></span></a></div><div><span class="t-lines"><span><span class="t-mark-rev t-since-cxx11">(C++11)</span></span></span></div></div>
</td>
<td> moves a range of elements to a new location in backwards order <br /> <span class="t-mark">(function template)</span> <span class="editsection noprint plainlinks" title="Edit this template"><a rel="nofollow" class="external text" href="http://en.cppreference.com/mwiki/index.php?title=Template:cpp/algorithm/dsc_move_backward&action=edit">[edit]</a></span>
</td></tr>
<tr class="t-dsc">
<td> <div class="t-dsc-member-div"><div><a href="../algorithm/fill.html" title="cpp/algorithm/fill"> <span class="t-lines"><span>fill</span></span></a></div></div>
</td>
<td> assigns a range of elements a certain value <br /> <span class="t-mark">(function template)</span> <span class="editsection noprint plainlinks" title="Edit this template"><a rel="nofollow" class="external text" href="http://en.cppreference.com/mwiki/index.php?title=Template:cpp/algorithm/dsc_fill&action=edit">[edit]</a></span>
</td></tr>
<tr class="t-dsc">
<td> <div class="t-dsc-member-div"><div><a href="../algorithm/fill_n.html" title="cpp/algorithm/fill n"> <span class="t-lines"><span>fill_n</span></span></a></div></div>
</td>
<td> assigns a value to a number of elements <br /> <span class="t-mark">(function template)</span> <span class="editsection noprint plainlinks" title="Edit this template"><a rel="nofollow" class="external text" href="http://en.cppreference.com/mwiki/index.php?title=Template:cpp/algorithm/dsc_fill_n&action=edit">[edit]</a></span>
</td></tr>
<tr class="t-dsc">
<td> <div class="t-dsc-member-div"><div><a href="../algorithm/transform.html" title="cpp/algorithm/transform"> <span class="t-lines"><span>transform</span></span></a></div></div>
</td>
<td> applies a function to a range of elements <br /> <span class="t-mark">(function template)</span> <span class="editsection noprint plainlinks" title="Edit this template"><a rel="nofollow" class="external text" href="http://en.cppreference.com/mwiki/index.php?title=Template:cpp/algorithm/dsc_transform&action=edit">[edit]</a></span>
</td></tr>
<tr class="t-dsc">
<td> <div class="t-dsc-member-div"><div><a href="../algorithm/generate.html" title="cpp/algorithm/generate"> <span class="t-lines"><span>generate</span></span></a></div></div>
</td>
<td> saves the result of a function in a range <br /> <span class="t-mark">(function template)</span> <span class="editsection noprint plainlinks" title="Edit this template"><a rel="nofollow" class="external text" href="http://en.cppreference.com/mwiki/index.php?title=Template:cpp/algorithm/dsc_generate&action=edit">[edit]</a></span>
</td></tr>
<tr class="t-dsc">
<td> <div class="t-dsc-member-div"><div><a href="../algorithm/generate_n.html" title="cpp/algorithm/generate n"> <span class="t-lines"><span>generate_n</span></span></a></div></div>
</td>
<td> saves the result of N applications of a function <br /> <span class="t-mark">(function template)</span> <span class="editsection noprint plainlinks" title="Edit this template"><a rel="nofollow" class="external text" href="http://en.cppreference.com/mwiki/index.php?title=Template:cpp/algorithm/dsc_generate_n&action=edit">[edit]</a></span>
</td></tr>
<tr class="t-dsc">
<td> <div class="t-dsc-member-div"><div><a href="../algorithm/remove.html" title="cpp/algorithm/remove"> <span class="t-lines"><span>remove</span><span>remove_if</span></span></a></div></div>
</td>
<td> removes elements satisfying specific criteria <br /> <span class="t-mark">(function template)</span> <span class="editsection noprint plainlinks" title="Edit this template"><a rel="nofollow" class="external text" href="http://en.cppreference.com/mwiki/index.php?title=Template:cpp/algorithm/dsc_remove&action=edit">[edit]</a></span>
</td></tr>
<tr class="t-dsc">
<td> <div class="t-dsc-member-div"><div><a href="../algorithm/remove_copy.html" title="cpp/algorithm/remove copy"> <span class="t-lines"><span>remove_copy</span><span>remove_copy_if</span></span></a></div></div>
</td>
<td> copies a range of elements omitting those that satisfy specific criteria <br /> <span class="t-mark">(function template)</span> <span class="editsection noprint plainlinks" title="Edit this template"><a rel="nofollow" class="external text" href="http://en.cppreference.com/mwiki/index.php?title=Template:cpp/algorithm/dsc_remove_copy&action=edit">[edit]</a></span>
</td></tr>
<tr class="t-dsc">
<td> <div class="t-dsc-member-div"><div><a href="../algorithm/replace.html" title="cpp/algorithm/replace"> <span class="t-lines"><span>replace</span><span>replace_if</span></span></a></div></div>
</td>
<td> replaces all values satisfying specific criteria with another value <br /> <span class="t-mark">(function template)</span> <span class="editsection noprint plainlinks" title="Edit this template"><a rel="nofollow" class="external text" href="http://en.cppreference.com/mwiki/index.php?title=Template:cpp/algorithm/dsc_replace&action=edit">[edit]</a></span>
</td></tr>
<tr class="t-dsc">
<td> <div class="t-dsc-member-div"><div><a href="../algorithm/replace_copy.html" title="cpp/algorithm/replace copy"> <span class="t-lines"><span>replace_copy</span><span>replace_copy_if</span></span></a></div></div>
</td>
<td> copies a range, replacing elements satisfying specific criteria with another value <br /> <span class="t-mark">(function template)</span> <span class="editsection noprint plainlinks" title="Edit this template"><a rel="nofollow" class="external text" href="http://en.cppreference.com/mwiki/index.php?title=Template:cpp/algorithm/dsc_replace_copy&action=edit">[edit]</a></span>
</td></tr>
<tr class="t-dsc">
<td> <div class="t-dsc-member-div"><div><a href="../algorithm/swap.html" title="cpp/algorithm/swap"> <span class="t-lines"><span>swap</span></span></a></div></div>
</td>
<td> swaps the values of two objects <br /> <span class="t-mark">(function template)</span> <span class="editsection noprint plainlinks" title="Edit this template"><a rel="nofollow" class="external text" href="http://en.cppreference.com/mwiki/index.php?title=Template:cpp/algorithm/dsc_swap&action=edit">[edit]</a></span>
</td></tr>
<tr class="t-dsc">
<td> <div class="t-dsc-member-div"><div><a href="../algorithm/swap_ranges.html" title="cpp/algorithm/swap ranges"> <span class="t-lines"><span>swap_ranges</span></span></a></div></div>
</td>
<td> swaps two ranges of elements <br /> <span class="t-mark">(function template)</span> <span class="editsection noprint plainlinks" title="Edit this template"><a rel="nofollow" class="external text" href="http://en.cppreference.com/mwiki/index.php?title=Template:cpp/algorithm/dsc_swap_ranges&action=edit">[edit]</a></span>
</td></tr>
<tr class="t-dsc">
<td> <div class="t-dsc-member-div"><div><a href="../algorithm/iter_swap.html" title="cpp/algorithm/iter swap"> <span class="t-lines"><span>iter_swap</span></span></a></div></div>
</td>
<td> swaps the elements pointed to by two iterators <br /> <span class="t-mark">(function template)</span> <span class="editsection noprint plainlinks" title="Edit this template"><a rel="nofollow" class="external text" href="http://en.cppreference.com/mwiki/index.php?title=Template:cpp/algorithm/dsc_iter_swap&action=edit">[edit]</a></span>
</td></tr>
<tr class="t-dsc">
<td> <div class="t-dsc-member-div"><div><a href="../algorithm/reverse.html" title="cpp/algorithm/reverse"> <span class="t-lines"><span>reverse</span></span></a></div></div>
</td>
<td> reverses the order of elements in a range <br /> <span class="t-mark">(function template)</span> <span class="editsection noprint plainlinks" title="Edit this template"><a rel="nofollow" class="external text" href="http://en.cppreference.com/mwiki/index.php?title=Template:cpp/algorithm/dsc_reverse&action=edit">[edit]</a></span>
</td></tr>
<tr class="t-dsc">
<td> <div class="t-dsc-member-div"><div><a href="../algorithm/reverse_copy.html" title="cpp/algorithm/reverse copy"> <span class="t-lines"><span>reverse_copy</span></span></a></div></div>
</td>
<td> creates a copy of a range that is reversed <br /> <span class="t-mark">(function template)</span> <span class="editsection noprint plainlinks" title="Edit this template"><a rel="nofollow" class="external text" href="http://en.cppreference.com/mwiki/index.php?title=Template:cpp/algorithm/dsc_reverse_copy&action=edit">[edit]</a></span>
</td></tr>
<tr class="t-dsc">
<td> <div class="t-dsc-member-div"><div><a href="../algorithm/rotate.html" title="cpp/algorithm/rotate"> <span class="t-lines"><span>rotate</span></span></a></div></div>
</td>
<td> rotates the order of elements in a range <br /> <span class="t-mark">(function template)</span> <span class="editsection noprint plainlinks" title="Edit this template"><a rel="nofollow" class="external text" href="http://en.cppreference.com/mwiki/index.php?title=Template:cpp/algorithm/dsc_rotate&action=edit">[edit]</a></span>
</td></tr>
<tr class="t-dsc">
<td> <div class="t-dsc-member-div"><div><a href="../algorithm/rotate_copy.html" title="cpp/algorithm/rotate copy"> <span class="t-lines"><span>rotate_copy</span></span></a></div></div>
</td>
<td> copies and rotate a range of elements <br /> <span class="t-mark">(function template)</span> <span class="editsection noprint plainlinks" title="Edit this template"><a rel="nofollow" class="external text" href="http://en.cppreference.com/mwiki/index.php?title=Template:cpp/algorithm/dsc_rotate_copy&action=edit">[edit]</a></span>
</td></tr>
<tr class="t-dsc">
<td> <div class="t-dsc-member-div"><div><a href="../algorithm/random_shuffle.html" title="cpp/algorithm/random shuffle"> <span class="t-lines"><span>random_shuffle</span><span>shuffle</span></span></a></div><div><span class="t-lines"><span><span class="t-mark-rev t-until-cxx17">(until C++17)</span></span><span><span class="t-mark-rev t-since-cxx11">(C++11)</span></span></span></div></div>
</td>
<td> randomly re-orders elements in a range <br /> <span class="t-mark">(function template)</span> <span class="editsection noprint plainlinks" title="Edit this template"><a rel="nofollow" class="external text" href="http://en.cppreference.com/mwiki/index.php?title=Template:cpp/algorithm/dsc_random_shuffle&action=edit">[edit]</a></span>
</td></tr>
<tr class="t-dsc">
<td> <div class="t-dsc-member-div"><div><a href="../algorithm/unique.html" title="cpp/algorithm/unique"> <span class="t-lines"><span>unique</span></span></a></div></div>
</td>
<td> removes consecutive duplicate elements in a range <br /> <span class="t-mark">(function template)</span> <span class="editsection noprint plainlinks" title="Edit this template"><a rel="nofollow" class="external text" href="http://en.cppreference.com/mwiki/index.php?title=Template:cpp/algorithm/dsc_unique&action=edit">[edit]</a></span>
</td></tr>
<tr class="t-dsc">
<td> <div class="t-dsc-member-div"><div><a href="../algorithm/unique_copy.html" title="cpp/algorithm/unique copy"> <span class="t-lines"><span>unique_copy</span></span></a></div></div>
</td>
<td> creates a copy of some range of elements that contains no consecutive duplicates <br /> <span class="t-mark">(function template)</span> <span class="editsection noprint plainlinks" title="Edit this template"><a rel="nofollow" class="external text" href="http://en.cppreference.com/mwiki/index.php?title=Template:cpp/algorithm/dsc_unique_copy&action=edit">[edit]</a></span>
</td></tr>
<tr>
<td colspan="2"> <h5> <span class="mw-headline" id="Partitioning_operations"> Partitioning operations </span></h5>
</td></tr>
<tr class="t-dsc">
<td> <div class="t-dsc-member-div"><div><a href="../algorithm/is_partitioned.html" title="cpp/algorithm/is partitioned"> <span class="t-lines"><span>is_partitioned</span></span></a></div><div><span class="t-lines"><span><span class="t-mark-rev t-since-cxx11">(C++11)</span></span></span></div></div>
</td>
<td> determines if the range is partitioned by the given predicate <br /> <span class="t-mark">(function template)</span> <span class="editsection noprint plainlinks" title="Edit this template"><a rel="nofollow" class="external text" href="http://en.cppreference.com/mwiki/index.php?title=Template:cpp/algorithm/dsc_is_partitioned&action=edit">[edit]</a></span>
</td></tr>
<tr class="t-dsc">
<td> <div class="t-dsc-member-div"><div><a href="../algorithm/partition.html" title="cpp/algorithm/partition"> <span class="t-lines"><span>partition</span></span></a></div></div>
</td>
<td> divides a range of elements into two groups <br /> <span class="t-mark">(function template)</span> <span class="editsection noprint plainlinks" title="Edit this template"><a rel="nofollow" class="external text" href="http://en.cppreference.com/mwiki/index.php?title=Template:cpp/algorithm/dsc_partition&action=edit">[edit]</a></span>
</td></tr>
<tr class="t-dsc">
<td> <div class="t-dsc-member-div"><div><a href="../algorithm/partition_copy.html" title="cpp/algorithm/partition copy"> <span class="t-lines"><span>partition_copy</span></span></a></div><div><span class="t-lines"><span><span class="t-mark-rev t-since-cxx11">(C++11)</span></span></span></div></div>
</td>
<td> copies a range dividing the elements into two groups <br /> <span class="t-mark">(function template)</span> <span class="editsection noprint plainlinks" title="Edit this template"><a rel="nofollow" class="external text" href="http://en.cppreference.com/mwiki/index.php?title=Template:cpp/algorithm/dsc_partition_copy&action=edit">[edit]</a></span>
</td></tr>
<tr class="t-dsc">
<td> <div class="t-dsc-member-div"><div><a href="../algorithm/stable_partition.html" title="cpp/algorithm/stable partition"> <span class="t-lines"><span>stable_partition</span></span></a></div></div>
</td>
<td> divides elements into two groups while preserving their relative order <br /> <span class="t-mark">(function template)</span> <span class="editsection noprint plainlinks" title="Edit this template"><a rel="nofollow" class="external text" href="http://en.cppreference.com/mwiki/index.php?title=Template:cpp/algorithm/dsc_stable_partition&action=edit">[edit]</a></span>
</td></tr>
<tr class="t-dsc">
<td> <div class="t-dsc-member-div"><div><a href="../algorithm/partition_point.html" title="cpp/algorithm/partition point"> <span class="t-lines"><span>partition_point</span></span></a></div><div><span class="t-lines"><span><span class="t-mark-rev t-since-cxx11">(C++11)</span></span></span></div></div>
</td>
<td> locates the partition point of a partitioned range <br /> <span class="t-mark">(function template)</span> <span class="editsection noprint plainlinks" title="Edit this template"><a rel="nofollow" class="external text" href="http://en.cppreference.com/mwiki/index.php?title=Template:cpp/algorithm/dsc_partition_point&action=edit">[edit]</a></span>
</td></tr>
<tr>
<td colspan="2"> <h5> <span class="mw-headline" id="Sorting_operations_.28on_sorted_ranges.29"> Sorting operations (on sorted ranges) </span></h5>
</td></tr>
<tr class="t-dsc">
<td> <div class="t-dsc-member-div"><div><a href="../algorithm/is_sorted.html" title="cpp/algorithm/is sorted"> <span class="t-lines"><span>is_sorted</span></span></a></div><div><span class="t-lines"><span><span class="t-mark-rev t-since-cxx11">(C++11)</span></span></span></div></div>
</td>
<td> checks whether a range is sorted into ascending order <br /> <span class="t-mark">(function template)</span> <span class="editsection noprint plainlinks" title="Edit this template"><a rel="nofollow" class="external text" href="http://en.cppreference.com/mwiki/index.php?title=Template:cpp/algorithm/dsc_is_sorted&action=edit">[edit]</a></span>
</td></tr>
<tr class="t-dsc">
<td> <div class="t-dsc-member-div"><div><a href="../algorithm/is_sorted_until.html" title="cpp/algorithm/is sorted until"> <span class="t-lines"><span>is_sorted_until</span></span></a></div><div><span class="t-lines"><span><span class="t-mark-rev t-since-cxx11">(C++11)</span></span></span></div></div>
</td>
<td> finds the largest sorted subrange <br /> <span class="t-mark">(function template)</span> <span class="editsection noprint plainlinks" title="Edit this template"><a rel="nofollow" class="external text" href="http://en.cppreference.com/mwiki/index.php?title=Template:cpp/algorithm/dsc_is_sorted_until&action=edit">[edit]</a></span>
</td></tr>
<tr class="t-dsc">
<td> <div class="t-dsc-member-div"><div><a href="../algorithm/sort.html" title="cpp/algorithm/sort"> <span class="t-lines"><span>sort</span></span></a></div></div>
</td>
<td> sorts a range into ascending order <br /> <span class="t-mark">(function template)</span> <span class="editsection noprint plainlinks" title="Edit this template"><a rel="nofollow" class="external text" href="http://en.cppreference.com/mwiki/index.php?title=Template:cpp/algorithm/dsc_sort&action=edit">[edit]</a></span>
</td></tr>
<tr class="t-dsc">
<td> <div class="t-dsc-member-div"><div><a href="../algorithm/partial_sort.html" title="cpp/algorithm/partial sort"> <span class="t-lines"><span>partial_sort</span></span></a></div></div>
</td>
<td> sorts the first N elements of a range <br /> <span class="t-mark">(function template)</span> <span class="editsection noprint plainlinks" title="Edit this template"><a rel="nofollow" class="external text" href="http://en.cppreference.com/mwiki/index.php?title=Template:cpp/algorithm/dsc_partial_sort&action=edit">[edit]</a></span>
</td></tr>
<tr class="t-dsc">
<td> <div class="t-dsc-member-div"><div><a href="../algorithm/partial_sort_copy.html" title="cpp/algorithm/partial sort copy"> <span class="t-lines"><span>partial_sort_copy</span></span></a></div></div>
</td>
<td> copies and partially sorts a range of elements <br /> <span class="t-mark">(function template)</span> <span class="editsection noprint plainlinks" title="Edit this template"><a rel="nofollow" class="external text" href="http://en.cppreference.com/mwiki/index.php?title=Template:cpp/algorithm/dsc_partial_sort_copy&action=edit">[edit]</a></span>
</td></tr>
<tr class="t-dsc">
<td> <div class="t-dsc-member-div"><div><a href="../algorithm/stable_sort.html" title="cpp/algorithm/stable sort"> <span class="t-lines"><span>stable_sort</span></span></a></div></div>
</td>
<td> sorts a range of elements while preserving order between equal elements <br /> <span class="t-mark">(function template)</span> <span class="editsection noprint plainlinks" title="Edit this template"><a rel="nofollow" class="external text" href="http://en.cppreference.com/mwiki/index.php?title=Template:cpp/algorithm/dsc_stable_sort&action=edit">[edit]</a></span>
</td></tr>
<tr class="t-dsc">
<td> <div class="t-dsc-member-div"><div><a href="../algorithm/nth_element.html" title="cpp/algorithm/nth element"> <span class="t-lines"><span>nth_element</span></span></a></div></div>
</td>
<td> partially sorts the given range making sure that it is partitioned by the given element <br /> <span class="t-mark">(function template)</span> <span class="editsection noprint plainlinks" title="Edit this template"><a rel="nofollow" class="external text" href="http://en.cppreference.com/mwiki/index.php?title=Template:cpp/algorithm/dsc_nth_element&action=edit">[edit]</a></span>
</td></tr>
<tr>
<td colspan="2"> <h5> <span class="mw-headline" id="Binary_search_operations_.28on_sorted_ranges.29"> Binary search operations (on sorted ranges) </span></h5>
</td></tr>
<tr class="t-dsc">
<td> <div class="t-dsc-member-div"><div><a href="../algorithm/lower_bound.html" title="cpp/algorithm/lower bound"> <span class="t-lines"><span>lower_bound</span></span></a></div></div>
</td>
<td> returns an iterator to the first element <i>not less</i> than the given value <br /> <span class="t-mark">(function template)</span> <span class="editsection noprint plainlinks" title="Edit this template"><a rel="nofollow" class="external text" href="http://en.cppreference.com/mwiki/index.php?title=Template:cpp/algorithm/dsc_lower_bound&action=edit">[edit]</a></span>
</td></tr>
<tr class="t-dsc">
<td> <div class="t-dsc-member-div"><div><a href="../algorithm/upper_bound.html" title="cpp/algorithm/upper bound"> <span class="t-lines"><span>upper_bound</span></span></a></div></div>
</td>
<td> returns an iterator to the first element <i>greater</i> than a certain value <br /> <span class="t-mark">(function template)</span> <span class="editsection noprint plainlinks" title="Edit this template"><a rel="nofollow" class="external text" href="http://en.cppreference.com/mwiki/index.php?title=Template:cpp/algorithm/dsc_upper_bound&action=edit">[edit]</a></span>
</td></tr>
<tr class="t-dsc">
<td> <div class="t-dsc-member-div"><div><a href="../algorithm/binary_search.html" title="cpp/algorithm/binary search"> <span class="t-lines"><span>binary_search</span></span></a></div></div>
</td>
<td> determines if an element exists in a certain range <br /> <span class="t-mark">(function template)</span> <span class="editsection noprint plainlinks" title="Edit this template"><a rel="nofollow" class="external text" href="http://en.cppreference.com/mwiki/index.php?title=Template:cpp/algorithm/dsc_binary_search&action=edit">[edit]</a></span>
</td></tr>
<tr class="t-dsc">
<td> <div class="t-dsc-member-div"><div><a href="../algorithm/equal_range.html" title="cpp/algorithm/equal range"> <span class="t-lines"><span>equal_range</span></span></a></div></div>
</td>
<td> returns range of elements matching a specific key <br /> <span class="t-mark">(function template)</span> <span class="editsection noprint plainlinks" title="Edit this template"><a rel="nofollow" class="external text" href="http://en.cppreference.com/mwiki/index.php?title=Template:cpp/algorithm/dsc_equal_range&action=edit">[edit]</a></span>
</td></tr>
<tr>
<td colspan="2"> <h5> <span class="mw-headline" id="Set_operations_.28on_sorted_ranges.29"> Set operations (on sorted ranges) </span></h5>
</td></tr>
<tr class="t-dsc">
<td> <div class="t-dsc-member-div"><div><a href="../algorithm/merge.html" title="cpp/algorithm/merge"> <span class="t-lines"><span>merge</span></span></a></div></div>
</td>
<td> merges two sorted ranges <br /> <span class="t-mark">(function template)</span> <span class="editsection noprint plainlinks" title="Edit this template"><a rel="nofollow" class="external text" href="http://en.cppreference.com/mwiki/index.php?title=Template:cpp/algorithm/dsc_merge&action=edit">[edit]</a></span>
</td></tr>
<tr class="t-dsc">
<td> <div class="t-dsc-member-div"><div><a href="../algorithm/inplace_merge.html" title="cpp/algorithm/inplace merge"> <span class="t-lines"><span>inplace_merge</span></span></a></div></div>
</td>
<td> merges two ordered ranges in-place <br /> <span class="t-mark">(function template)</span> <span class="editsection noprint plainlinks" title="Edit this template"><a rel="nofollow" class="external text" href="http://en.cppreference.com/mwiki/index.php?title=Template:cpp/algorithm/dsc_inplace_merge&action=edit">[edit]</a></span>
</td></tr>
<tr class="t-dsc">
<td> <div class="t-dsc-member-div"><div><a href="../algorithm/includes.html" title="cpp/algorithm/includes"> <span class="t-lines"><span>includes</span></span></a></div></div>
</td>
<td> returns true if one set is a subset of another <br /> <span class="t-mark">(function template)</span> <span class="editsection noprint plainlinks" title="Edit this template"><a rel="nofollow" class="external text" href="http://en.cppreference.com/mwiki/index.php?title=Template:cpp/algorithm/dsc_includes&action=edit">[edit]</a></span>
</td></tr>
<tr class="t-dsc">
<td> <div class="t-dsc-member-div"><div><a href="../algorithm/set_difference.html" title="cpp/algorithm/set difference"> <span class="t-lines"><span>set_difference</span></span></a></div></div>
</td>
<td> computes the difference between two sets <br /> <span class="t-mark">(function template)</span> <span class="editsection noprint plainlinks" title="Edit this template"><a rel="nofollow" class="external text" href="http://en.cppreference.com/mwiki/index.php?title=Template:cpp/algorithm/dsc_set_difference&action=edit">[edit]</a></span>
</td></tr>
<tr class="t-dsc">
<td> <div class="t-dsc-member-div"><div><a href="../algorithm/set_intersection.html" title="cpp/algorithm/set intersection"> <span class="t-lines"><span>set_intersection</span></span></a></div></div>
</td>
<td> computes the intersection of two sets <br /> <span class="t-mark">(function template)</span> <span class="editsection noprint plainlinks" title="Edit this template"><a rel="nofollow" class="external text" href="http://en.cppreference.com/mwiki/index.php?title=Template:cpp/algorithm/dsc_set_intersection&action=edit">[edit]</a></span>
</td></tr>
<tr class="t-dsc">
<td> <div class="t-dsc-member-div"><div><a href="../algorithm/set_symmetric_difference.html" title="cpp/algorithm/set symmetric difference"> <span class="t-lines"><span>set_symmetric_difference</span></span></a></div></div>
</td>
<td> computes the symmetric difference between two sets <br /> <span class="t-mark">(function template)</span> <span class="editsection noprint plainlinks" title="Edit this template"><a rel="nofollow" class="external text" href="http://en.cppreference.com/mwiki/index.php?title=Template:cpp/algorithm/dsc_set_symmetric_difference&action=edit">[edit]</a></span>
</td></tr>
<tr class="t-dsc">
<td> <div class="t-dsc-member-div"><div><a href="../algorithm/set_union.html" title="cpp/algorithm/set union"> <span class="t-lines"><span>set_union</span></span></a></div></div>
</td>
<td> computes the union of two sets <br /> <span class="t-mark">(function template)</span> <span class="editsection noprint plainlinks" title="Edit this template"><a rel="nofollow" class="external text" href="http://en.cppreference.com/mwiki/index.php?title=Template:cpp/algorithm/dsc_set_union&action=edit">[edit]</a></span>
</td></tr>
<tr>
<td colspan="2"> <h5> <span class="mw-headline" id="Heap_operations"> Heap operations </span></h5>
</td></tr>
<tr class="t-dsc">
<td> <div class="t-dsc-member-div"><div><a href="../algorithm/is_heap.html" title="cpp/algorithm/is heap"> <span class="t-lines"><span>is_heap</span></span></a></div><div><span class="t-lines"><span><span class="t-mark-rev t-since-cxx11">(C++11)</span></span></span></div></div>
</td>
<td> checks if the given range is a max heap <br /> <span class="t-mark">(function template)</span> <span class="editsection noprint plainlinks" title="Edit this template"><a rel="nofollow" class="external text" href="http://en.cppreference.com/mwiki/index.php?title=Template:cpp/algorithm/dsc_is_heap&action=edit">[edit]</a></span>
</td></tr>
<tr class="t-dsc">
<td> <div class="t-dsc-member-div"><div><a href="../algorithm/is_heap_until.html" title="cpp/algorithm/is heap until"> <span class="t-lines"><span>is_heap_until</span></span></a></div><div><span class="t-lines"><span><span class="t-mark-rev t-since-cxx11">(C++11)</span></span></span></div></div>
</td>
<td> finds the largest subrange that is a max heap <br /> <span class="t-mark">(function template)</span> <span class="editsection noprint plainlinks" title="Edit this template"><a rel="nofollow" class="external text" href="http://en.cppreference.com/mwiki/index.php?title=Template:cpp/algorithm/dsc_is_heap_until&action=edit">[edit]</a></span>
</td></tr>
<tr class="t-dsc">
<td> <div class="t-dsc-member-div"><div><a href="../algorithm/make_heap.html" title="cpp/algorithm/make heap"> <span class="t-lines"><span>make_heap</span></span></a></div></div>
</td>
<td> creates a max heap out of a range of elements <br /> <span class="t-mark">(function template)</span> <span class="editsection noprint plainlinks" title="Edit this template"><a rel="nofollow" class="external text" href="http://en.cppreference.com/mwiki/index.php?title=Template:cpp/algorithm/dsc_make_heap&action=edit">[edit]</a></span>
</td></tr>
<tr class="t-dsc">
<td> <div class="t-dsc-member-div"><div><a href="../algorithm/push_heap.html" title="cpp/algorithm/push heap"> <span class="t-lines"><span>push_heap</span></span></a></div></div>
</td>
<td> adds an element to a max heap <br /> <span class="t-mark">(function template)</span> <span class="editsection noprint plainlinks" title="Edit this template"><a rel="nofollow" class="external text" href="http://en.cppreference.com/mwiki/index.php?title=Template:cpp/algorithm/dsc_push_heap&action=edit">[edit]</a></span>
</td></tr>
<tr class="t-dsc">
<td> <div class="t-dsc-member-div"><div><a href="../algorithm/pop_heap.html" title="cpp/algorithm/pop heap"> <span class="t-lines"><span>pop_heap</span></span></a></div></div>
</td>
<td> removes the largest element from a max heap <br /> <span class="t-mark">(function template)</span> <span class="editsection noprint plainlinks" title="Edit this template"><a rel="nofollow" class="external text" href="http://en.cppreference.com/mwiki/index.php?title=Template:cpp/algorithm/dsc_pop_heap&action=edit">[edit]</a></span>
</td></tr>
<tr class="t-dsc">
<td> <div class="t-dsc-member-div"><div><a href="../algorithm/sort_heap.html" title="cpp/algorithm/sort heap"> <span class="t-lines"><span>sort_heap</span></span></a></div></div>
</td>
<td> turns a max heap into a range of elements sorted in ascending order <br /> <span class="t-mark">(function template)</span> <span class="editsection noprint plainlinks" title="Edit this template"><a rel="nofollow" class="external text" href="http://en.cppreference.com/mwiki/index.php?title=Template:cpp/algorithm/dsc_sort_heap&action=edit">[edit]</a></span>
</td></tr>
<tr>
<td colspan="2"> <h5> <span class="mw-headline" id="Minimum.2Fmaximum_operations"> Minimum/maximum operations </span></h5>
</td></tr>
<tr class="t-dsc">
<td> <div class="t-dsc-member-div"><div><a href="../algorithm/max.html" title="cpp/algorithm/max"> <span class="t-lines"><span>max</span></span></a></div></div>
</td>
<td> returns the greater of the given values <br /> <span class="t-mark">(function template)</span> <span class="editsection noprint plainlinks" title="Edit this template"><a rel="nofollow" class="external text" href="http://en.cppreference.com/mwiki/index.php?title=Template:cpp/algorithm/dsc_max&action=edit">[edit]</a></span>
</td></tr>
<tr class="t-dsc">
<td> <div class="t-dsc-member-div"><div><a href="../algorithm/max_element.html" title="cpp/algorithm/max element"> <span class="t-lines"><span>max_element</span></span></a></div></div>
</td>
<td> returns the largest element in a range <br /> <span class="t-mark">(function template)</span> <span class="editsection noprint plainlinks" title="Edit this template"><a rel="nofollow" class="external text" href="http://en.cppreference.com/mwiki/index.php?title=Template:cpp/algorithm/dsc_max_element&action=edit">[edit]</a></span>
</td></tr>
<tr class="t-dsc">
<td> <div class="t-dsc-member-div"><div><a href="../algorithm/min.html" title="cpp/algorithm/min"> <span class="t-lines"><span>min</span></span></a></div></div>
</td>
<td> returns the smaller of the given values <br /> <span class="t-mark">(function template)</span> <span class="editsection noprint plainlinks" title="Edit this template"><a rel="nofollow" class="external text" href="http://en.cppreference.com/mwiki/index.php?title=Template:cpp/algorithm/dsc_min&action=edit">[edit]</a></span>
</td></tr>
<tr class="t-dsc">
<td> <div class="t-dsc-member-div"><div><a href="../algorithm/min_element.html" title="cpp/algorithm/min element"> <span class="t-lines"><span>min_element</span></span></a></div></div>
</td>
<td> returns the smallest element in a range <br /> <span class="t-mark">(function template)</span> <span class="editsection noprint plainlinks" title="Edit this template"><a rel="nofollow" class="external text" href="http://en.cppreference.com/mwiki/index.php?title=Template:cpp/algorithm/dsc_min_element&action=edit">[edit]</a></span>
</td></tr>
<tr class="t-dsc">
<td> <div class="t-dsc-member-div"><div><a href="../algorithm/minmax.html" title="cpp/algorithm/minmax"> <span class="t-lines"><span>minmax</span></span></a></div><div><span class="t-lines"><span><span class="t-mark-rev t-since-cxx11">(C++11)</span></span></span></div></div>
</td>
<td> returns the larger and the smaller of two elements <br /> <span class="t-mark">(function template)</span> <span class="editsection noprint plainlinks" title="Edit this template"><a rel="nofollow" class="external text" href="http://en.cppreference.com/mwiki/index.php?title=Template:cpp/algorithm/dsc_minmax&action=edit">[edit]</a></span>
</td></tr>
<tr class="t-dsc">
<td> <div class="t-dsc-member-div"><div><a href="../algorithm/minmax_element.html" title="cpp/algorithm/minmax element"> <span class="t-lines"><span>minmax_element</span></span></a></div><div><span class="t-lines"><span><span class="t-mark-rev t-since-cxx11">(C++11)</span></span></span></div></div>
</td>
<td> returns the smallest and the largest element in a range <br /> <span class="t-mark">(function template)</span> <span class="editsection noprint plainlinks" title="Edit this template"><a rel="nofollow" class="external text" href="http://en.cppreference.com/mwiki/index.php?title=Template:cpp/algorithm/dsc_minmax_element&action=edit">[edit]</a></span>
</td></tr>
<tr class="t-dsc">
<td> <div class="t-dsc-member-div"><div><a href="../algorithm/lexicographical_compare.html" title="cpp/algorithm/lexicographical compare"> <span class="t-lines"><span>lexicographical_compare</span></span></a></div></div>
</td>
<td> returns true if one range is lexicographically less than another <br /> <span class="t-mark">(function template)</span> <span class="editsection noprint plainlinks" title="Edit this template"><a rel="nofollow" class="external text" href="http://en.cppreference.com/mwiki/index.php?title=Template:cpp/algorithm/dsc_lexicographical_compare&action=edit">[edit]</a></span>
</td></tr>
<tr class="t-dsc">
<td> <div class="t-dsc-member-div"><div><a href="../algorithm/is_permutation.html" title="cpp/algorithm/is permutation"> <span class="t-lines"><span>is_permutation</span></span></a></div><div><span class="t-lines"><span><span class="t-mark-rev t-since-cxx11">(C++11)</span></span></span></div></div>
</td>
<td> determines if a sequence is a permutation of another sequence <br /> <span class="t-mark">(function template)</span> <span class="editsection noprint plainlinks" title="Edit this template"><a rel="nofollow" class="external text" href="http://en.cppreference.com/mwiki/index.php?title=Template:cpp/algorithm/dsc_is_permutation&action=edit">[edit]</a></span>
</td></tr>
<tr class="t-dsc">
<td> <div class="t-dsc-member-div"><div><a href="../algorithm/next_permutation.html" title="cpp/algorithm/next permutation"> <span class="t-lines"><span>next_permutation</span></span></a></div></div>
</td>
<td> generates the next greater lexicographic permutation of a range of elements <br /> <span class="t-mark">(function template)</span> <span class="editsection noprint plainlinks" title="Edit this template"><a rel="nofollow" class="external text" href="http://en.cppreference.com/mwiki/index.php?title=Template:cpp/algorithm/dsc_next_permutation&action=edit">[edit]</a></span>
</td></tr>
<tr class="t-dsc">
<td> <div class="t-dsc-member-div"><div><a href="../algorithm/prev_permutation.html" title="cpp/algorithm/prev permutation"> <span class="t-lines"><span>prev_permutation</span></span></a></div></div>
</td>
<td> generates the next smaller lexicographic permutation of a range of elements <br /> <span class="t-mark">(function template)</span> <span class="editsection noprint plainlinks" title="Edit this template"><a rel="nofollow" class="external text" href="http://en.cppreference.com/mwiki/index.php?title=Template:cpp/algorithm/dsc_prev_permutation&action=edit">[edit]</a></span>
</td></tr>
</table>
<h3><span class="editsection">[<a href="http://en.cppreference.com/mwiki/index.php?title=cpp/header/algorithm&action=edit&section=2" title="Edit section: Synopsis">edit</a>]</span> <span class="mw-headline" id="Synopsis">Synopsis</span></h3>
<div dir="ltr" class="mw-geshi" style="text-align: left;"><div class="cpp source-cpp"><pre class="de1"><span class="co2">#include <initializer_list></span>
<span class="kw1">namespace</span> std
<span class="br0">{</span>
<span class="co1">// non-modifying sequence operations:</span>
<span class="kw1">template</span> <span class="sy1"><</span><span class="kw1">class</span> InputIterator, <span class="kw1">class</span> Predicate<span class="sy1">></span>
<span class="kw4">bool</span> all_of<span class="br0">(</span>InputIterator first, InputIterator last, Predicate pred<span class="br0">)</span><span class="sy4">;</span>
<span class="kw1">template</span> <span class="sy1"><</span><span class="kw1">class</span> InputIterator, <span class="kw1">class</span> Predicate<span class="sy1">></span>
<span class="kw4">bool</span> any_of<span class="br0">(</span>InputIterator first, InputIterator last, Predicate pred<span class="br0">)</span><span class="sy4">;</span>
<span class="kw1">template</span> <span class="sy1"><</span><span class="kw1">class</span> InputIterator, <span class="kw1">class</span> Predicate<span class="sy1">></span>
<span class="kw4">bool</span> none_of<span class="br0">(</span>InputIterator first, InputIterator last, Predicate pred<span class="br0">)</span><span class="sy4">;</span>
 
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> InputIterator, <span class="kw1">class</span> Function<span class="sy1">></span>
Function for_each<span class="br0">(</span>InputIterator first, InputIterator last, Function f<span class="br0">)</span><span class="sy4">;</span>
 
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> InputIterator, <span class="kw1">class</span> T<span class="sy1">></span>
InputIterator find<span class="br0">(</span>InputIterator first, InputIterator last,
<span class="kw4">const</span> T<span class="sy3">&</span> value<span class="br0">)</span><span class="sy4">;</span>
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> InputIterator, <span class="kw1">class</span> Predicate<span class="sy1">></span>
InputIterator find_if<span class="br0">(</span>InputIterator first, InputIterator last,
Predicate pred<span class="br0">)</span><span class="sy4">;</span>
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> InputIterator, <span class="kw1">class</span> Predicate<span class="sy1">></span>
InputIterator find_if_not<span class="br0">(</span>InputIterator first, InputIterator last,
Predicate pred<span class="br0">)</span><span class="sy4">;</span>
 
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> ForwardIterator1, <span class="kw1">class</span> ForwardIterator2<span class="sy1">></span>
ForwardIterator1
find_end<span class="br0">(</span>ForwardIterator1 first1, ForwardIterator1 last1,
ForwardIterator2 first2, ForwardIterator2 last2<span class="br0">)</span><span class="sy4">;</span>
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> ForwardIterator1, <span class="kw1">class</span> ForwardIterator2,
<span class="kw1">class</span> BinaryPredicate<span class="sy1">></span>
ForwardIterator1
find_end<span class="br0">(</span>ForwardIterator1 first1, ForwardIterator1 last1,
ForwardIterator2 first2, ForwardIterator2 last2,
BinaryPredicate pred<span class="br0">)</span><span class="sy4">;</span>
 
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> InputIterator, <span class="kw1">class</span> ForwardIterator<span class="sy1">></span>
InputIterator
find_first_of<span class="br0">(</span>InputIterator first1, InputIterator last1,
ForwardIterator first2, ForwardIterator last2<span class="br0">)</span><span class="sy4">;</span>
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> InputIterator, <span class="kw1">class</span> ForwardIterator,
<span class="kw1">class</span> BinaryPredicate<span class="sy1">></span>
InputIterator
find_first_of<span class="br0">(</span>InputIterator first1, InputIterator last1,
ForwardIterator first2, ForwardIterator last2,
BinaryPredicate pred<span class="br0">)</span><span class="sy4">;</span>
 
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> ForwardIterator<span class="sy1">></span>
ForwardIterator adjacent_find<span class="br0">(</span>ForwardIterator first,
ForwardIterator last<span class="br0">)</span><span class="sy4">;</span>
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> ForwardIterator, <span class="kw1">class</span> BinaryPredicate<span class="sy1">></span>
ForwardIterator adjacent_find<span class="br0">(</span>ForwardIterator first,
ForwardIterator last,
BinaryPredicate pred<span class="br0">)</span><span class="sy4">;</span>
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> InputIterator, <span class="kw1">class</span> T<span class="sy1">></span>
<span class="kw1">typename</span> iterator_traits<span class="sy1"><</span>InputIterator<span class="sy1">></span><span class="sy4">::</span><span class="me2">difference_type</span>
count<span class="br0">(</span>InputIterator first, InputIterator last, <span class="kw4">const</span> T<span class="sy3">&</span> value<span class="br0">)</span><span class="sy4">;</span>
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> InputIterator, <span class="kw1">class</span> Predicate<span class="sy1">></span>
<span class="kw1">typename</span> iterator_traits<span class="sy1"><</span>InputIterator<span class="sy1">></span><span class="sy4">::</span><span class="me2">difference_type</span>
count_if<span class="br0">(</span>InputIterator first, InputIterator last, Predicate pred<span class="br0">)</span><span class="sy4">;</span>
 
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> InputIterator1, <span class="kw1">class</span> InputIterator2<span class="sy1">></span>
pair<span class="sy1"><</span>InputIterator1, InputIterator2<span class="sy1">></span>
mismatch<span class="br0">(</span>InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2<span class="br0">)</span><span class="sy4">;</span>
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> InputIterator1, <span class="kw1">class</span> InputIterator2, <span class="kw1">class</span> BinaryPredicate<span class="sy1">></span>
pair<span class="sy1"><</span>InputIterator1, InputIterator2<span class="sy1">></span>
mismatch<span class="br0">(</span>InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2, BinaryPredicate pred<span class="br0">)</span><span class="sy4">;</span>
 
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> InputIterator1, <span class="kw1">class</span> InputIterator2<span class="sy1">></span>
<span class="kw4">bool</span> equal<span class="br0">(</span>InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2<span class="br0">)</span><span class="sy4">;</span>
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> InputIterator1, <span class="kw1">class</span> InputIterator2, <span class="kw1">class</span> BinaryPredicate<span class="sy1">></span>
<span class="kw4">bool</span> equal<span class="br0">(</span>InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2, BinaryPredicate pred<span class="br0">)</span><span class="sy4">;</span>
 
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> ForwardIterator1, <span class="kw1">class</span> ForwardIterator2<span class="sy1">></span>
<span class="kw4">bool</span> is_permutation<span class="br0">(</span>ForwardIterator1 first1, ForwardIterator1 last1,
ForwardIterator2 first2<span class="br0">)</span><span class="sy4">;</span>
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> ForwardIterator1, <span class="kw1">class</span> ForwardIterator2,
<span class="kw1">class</span> BinaryPredicate<span class="sy1">></span>
<span class="kw4">bool</span> is_permutation<span class="br0">(</span>ForwardIterator1 first1, ForwardIterator1 last1,
ForwardIterator2 first2, BinaryPredicate pred<span class="br0">)</span><span class="sy4">;</span>
 
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> ForwardIterator1, <span class="kw1">class</span> ForwardIterator2<span class="sy1">></span>
ForwardIterator1 search<span class="br0">(</span>
ForwardIterator1 first1, ForwardIterator1 last1,
ForwardIterator2 first2, ForwardIterator2 last2<span class="br0">)</span><span class="sy4">;</span>
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> ForwardIterator1, <span class="kw1">class</span> ForwardIterator2,
<span class="kw1">class</span> BinaryPredicate<span class="sy1">></span>
ForwardIterator1 search<span class="br0">(</span>
ForwardIterator1 first1, ForwardIterator1 last1,
ForwardIterator2 first2, ForwardIterator2 last2,
BinaryPredicate pred<span class="br0">)</span><span class="sy4">;</span>
 
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> ForwardIterator, <span class="kw1">class</span> Size, <span class="kw1">class</span> T<span class="sy1">></span>
ForwardIterator search_n<span class="br0">(</span>ForwardIterator first, ForwardIterator last,
Size count, <span class="kw4">const</span> T<span class="sy3">&</span> value<span class="br0">)</span><span class="sy4">;</span>
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> ForwardIterator, <span class="kw1">class</span> Size, <span class="kw1">class</span> T, <span class="kw1">class</span> BinaryPredicate<span class="sy1">></span>
ForwardIterator1 search_n<span class="br0">(</span>ForwardIterator first, ForwardIterator last,
Size count, <span class="kw4">const</span> T<span class="sy3">&</span> value,
BinaryPredicate pred<span class="br0">)</span><span class="sy4">;</span>
 
<span class="co1">// modifying sequence operations:</span>
 
<span class="co1">// copy:</span>
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> InputIterator, <span class="kw1">class</span> OutputIterator<span class="sy1">></span>
OutputIterator copy<span class="br0">(</span>InputIterator first, InputIterator last,
OutputIterator result<span class="br0">)</span><span class="sy4">;</span>
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> InputIterator, <span class="kw1">class</span> Size, <span class="kw1">class</span> OutputIterator<span class="sy1">></span>
OutputIterator copy_n<span class="br0">(</span>InputIterator first, Size n,
OutputIterator result<span class="br0">)</span><span class="sy4">;</span>
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> InputIterator, <span class="kw1">class</span> OutputIterator, <span class="kw1">class</span> Predicate<span class="sy1">></span>
OutputIterator copy_if<span class="br0">(</span>InputIterator first, InputIterator last,
OutputIterator result, Predicate pred<span class="br0">)</span><span class="sy4">;</span>
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> BidirectionalIterator1, <span class="kw1">class</span> BidirectionalIterator2<span class="sy1">></span>
BidirectionalIterator2 copy_backward<span class="br0">(</span>
BidirectionalIterator1 first, BidirectionalIterator1 last,
BidirectionalIterator2 result<span class="br0">)</span><span class="sy4">;</span>
 
<span class="co1">// move:</span>
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> InputIterator, <span class="kw1">class</span> OutputIterator<span class="sy1">></span>
OutputIterator move<span class="br0">(</span>InputIterator first, InputIterator last,
OutputIterator result<span class="br0">)</span><span class="sy4">;</span>
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> BidirectionalIterator1, <span class="kw1">class</span> BidirectionalIterator2<span class="sy1">></span>
BidirectionalIterator2 move_backward<span class="br0">(</span>
BidirectionalIterator1 first, BidirectionalIterator1 last,
BidirectionalIterator2 result<span class="br0">)</span><span class="sy4">;</span>
 
<span class="co1">// swap:</span>
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> ForwardIterator1, <span class="kw1">class</span> ForwardIterator2<span class="sy1">></span>
ForwardIterator2 swap_ranges<span class="br0">(</span>ForwardIterator1 first1,
ForwardIterator1 last1, ForwardIterator2 first2<span class="br0">)</span><span class="sy4">;</span>
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> ForwardIterator1, <span class="kw1">class</span> ForwardIterator2<span class="sy1">></span>
<span class="kw4">void</span> iter_swap<span class="br0">(</span>ForwardIterator1 a, ForwardIterator2 b<span class="br0">)</span><span class="sy4">;</span>
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> InputIterator, <span class="kw1">class</span> OutputIterator, <span class="kw1">class</span> UnaryOperation<span class="sy1">></span>
OutputIterator transform<span class="br0">(</span>InputIterator first, InputIterator last,
OutputIterator result, UnaryOperation op<span class="br0">)</span><span class="sy4">;</span>
 
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> InputIterator1, <span class="kw1">class</span> InputIterator2, <span class="kw1">class</span> OutputIterator,
<span class="kw1">class</span> BinaryOperation<span class="sy1">></span>
OutputIterator transform<span class="br0">(</span>InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2, OutputIterator result,
BinaryOperation binary_op<span class="br0">)</span><span class="sy4">;</span>
 
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> ForwardIterator, <span class="kw1">class</span> T<span class="sy1">></span>
<span class="kw4">void</span> replace<span class="br0">(</span>ForwardIterator first, ForwardIterator last,
<span class="kw4">const</span> T<span class="sy3">&</span> old_value, <span class="kw4">const</span> T<span class="sy3">&</span> new_value<span class="br0">)</span><span class="sy4">;</span>
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> ForwardIterator, <span class="kw1">class</span> Predicate, <span class="kw1">class</span> T<span class="sy1">></span>
<span class="kw4">void</span> replace_if<span class="br0">(</span>ForwardIterator first, ForwardIterator last,
Predicate pred, <span class="kw4">const</span> T<span class="sy3">&</span> new_value<span class="br0">)</span><span class="sy4">;</span>
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> InputIterator, <span class="kw1">class</span> OutputIterator, <span class="kw1">class</span> T<span class="sy1">></span>
OutputIterator replace_copy<span class="br0">(</span>InputIterator first, InputIterator last,
OutputIterator result,
<span class="kw4">const</span> T<span class="sy3">&</span> old_value, <span class="kw4">const</span> T<span class="sy3">&</span> new_value<span class="br0">)</span><span class="sy4">;</span>
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> InputIterator, <span class="kw1">class</span> OutputIterator, <span class="kw1">class</span> Predicate, <span class="kw1">class</span> T<span class="sy1">></span>
OutputIterator replace_copy_if<span class="br0">(</span>InputIterator first, InputIterator last,
OutputIterator result,
Predicate pred, <span class="kw4">const</span> T<span class="sy3">&</span> new_value<span class="br0">)</span><span class="sy4">;</span>
 
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> ForwardIterator, <span class="kw1">class</span> T<span class="sy1">></span>
<span class="kw4">void</span> fill<span class="br0">(</span>ForwardIterator first, ForwardIterator last, <span class="kw4">const</span> T<span class="sy3">&</span> value<span class="br0">)</span><span class="sy4">;</span>
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> OutputIterator, <span class="kw1">class</span> Size, <span class="kw1">class</span> T<span class="sy1">></span>
OutputIterator fill_n<span class="br0">(</span>OutputIterator first, Size n, <span class="kw4">const</span> T<span class="sy3">&</span> value<span class="br0">)</span><span class="sy4">;</span>
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> ForwardIterator, <span class="kw1">class</span> Generator<span class="sy1">></span>
<span class="kw4">void</span> generate<span class="br0">(</span>ForwardIterator first, ForwardIterator last,
Generator gen<span class="br0">)</span><span class="sy4">;</span>
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> OutputIterator, <span class="kw1">class</span> Size, <span class="kw1">class</span> Generator<span class="sy1">></span>
OutputIterator generate_n<span class="br0">(</span>OutputIterator first, Size n, Generator gen<span class="br0">)</span><span class="sy4">;</span>
 
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> ForwardIterator, <span class="kw1">class</span> T<span class="sy1">></span>
ForwardIterator remove<span class="br0">(</span>ForwardIterator first, ForwardIterator last,
<span class="kw4">const</span> T<span class="sy3">&</span> value<span class="br0">)</span><span class="sy4">;</span>
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> ForwardIterator, <span class="kw1">class</span> Predicate<span class="sy1">></span>
ForwardIterator remove_if<span class="br0">(</span>ForwardIterator first, ForwardIterator last,
Predicate pred<span class="br0">)</span><span class="sy4">;</span>
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> InputIterator, <span class="kw1">class</span> OutputIterator, <span class="kw1">class</span> T<span class="sy1">></span>
OutputIterator remove_copy<span class="br0">(</span>InputIterator first, InputIterator last,
OutputIterator result, <span class="kw4">const</span> T<span class="sy3">&</span> value<span class="br0">)</span><span class="sy4">;</span>
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> InputIterator, <span class="kw1">class</span> OutputIterator, <span class="kw1">class</span> Predicate<span class="sy1">></span>
OutputIterator remove_copy_if<span class="br0">(</span>InputIterator first, InputIterator last,
OutputIterator result, Predicate pred<span class="br0">)</span><span class="sy4">;</span>
 
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> ForwardIterator<span class="sy1">></span>
ForwardIterator unique<span class="br0">(</span>ForwardIterator first, ForwardIterator last<span class="br0">)</span><span class="sy4">;</span>
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> ForwardIterator, <span class="kw1">class</span> BinaryPredicate<span class="sy1">></span>
ForwardIterator unique<span class="br0">(</span>ForwardIterator first, ForwardIterator last,
BinaryPredicate pred<span class="br0">)</span><span class="sy4">;</span>
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> InputIterator, <span class="kw1">class</span> OutputIterator<span class="sy1">></span>
OutputIterator unique_copy<span class="br0">(</span>InputIterator first, InputIterator last,
OutputIterator result<span class="br0">)</span><span class="sy4">;</span>
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> InputIterator, <span class="kw1">class</span> OutputIterator, <span class="kw1">class</span> BinaryPredicate<span class="sy1">></span>
OutputIterator unique_copy<span class="br0">(</span>InputIterator first, InputIterator last,
OutputIterator result, BinaryPredicate pred<span class="br0">)</span><span class="sy4">;</span>
 
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> BidirectionalIterator<span class="sy1">></span>
<span class="kw4">void</span> reverse<span class="br0">(</span>BidirectionalIterator first, BidirectionalIterator last<span class="br0">)</span><span class="sy4">;</span>
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> BidirectionalIterator, <span class="kw1">class</span> OutputIterator<span class="sy1">></span>
OutputIterator reverse_copy<span class="br0">(</span>BidirectionalIterator first,
BidirectionalIterator last,
OutputIterator result<span class="br0">)</span><span class="sy4">;</span>
 
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> ForwardIterator<span class="sy1">></span>
ForwardIterator rotate<span class="br0">(</span>ForwardIterator first, ForwardIterator middle,
ForwardIterator last<span class="br0">)</span><span class="sy4">;</span>
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> ForwardIterator, <span class="kw1">class</span> OutputIterator<span class="sy1">></span>
OutputIterator rotate_copy<span class="br0">(</span>
ForwardIterator first, ForwardIterator middle,
ForwardIterator last, OutputIterator result<span class="br0">)</span><span class="sy4">;</span>
 
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> RandomAccessIterator<span class="sy1">></span>
<span class="kw4">void</span> random_shuffle<span class="br0">(</span>RandomAccessIterator first,
RandomAccessIterator last<span class="br0">)</span><span class="sy4">;</span>
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> RandomAccessIterator, <span class="kw1">class</span> RandomNumberGenerator<span class="sy1">></span>
<span class="kw4">void</span> random_shuffle<span class="br0">(</span>RandomAccessIterator first,
RandomAccessIterator last,
RandomNumberGenerator<span class="sy3">&&</span> rand<span class="br0">)</span><span class="sy4">;</span>
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> RandomAccessIterator, <span class="kw1">class</span> UniformRandomNumberGenerator<span class="sy1">></span>
<span class="kw4">void</span> shuffle<span class="br0">(</span>RandomAccessIterator first,
RandomAccessIterator last,
UniformRandomNumberGenerator<span class="sy3">&&</span> rand<span class="br0">)</span><span class="sy4">;</span>
 
<span class="co1">// partitions:</span>
<span class="kw1">template</span> <span class="sy1"><</span><span class="kw1">class</span> InputIterator, <span class="kw1">class</span> Predicate<span class="sy1">></span>
<span class="kw4">bool</span> is_partitioned<span class="br0">(</span>InputIterator first, InputIterator last, Predicate pred<span class="br0">)</span><span class="sy4">;</span>
 
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> ForwardIterator, <span class="kw1">class</span> Predicate<span class="sy1">></span>
ForwardIterator partition<span class="br0">(</span>ForwardIterator first,
ForwardIterator last,
Predicate pred<span class="br0">)</span><span class="sy4">;</span>
 
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> BidirectionalIterator, <span class="kw1">class</span> Predicate<span class="sy1">></span>
BidirectionalIterator stable_partition<span class="br0">(</span>BidirectionalIterator first,
BidirectionalIterator last,
Predicate pred<span class="br0">)</span><span class="sy4">;</span>
 
<span class="kw1">template</span> <span class="sy1"><</span><span class="kw1">class</span> InputIterator, <span class="kw1">class</span> OutputIterator1,
<span class="kw1">class</span> OutputIterator2, <span class="kw1">class</span> Predicate<span class="sy1">></span>
pair<span class="sy1"><</span>OutputIterator1, OutputIterator2<span class="sy1">></span>
partition_copy<span class="br0">(</span>InputIterator first, InputIterator last,
OutputIterator1 out_true, OutputIterator2 out_false,
Predicate pred<span class="br0">)</span><span class="sy4">;</span>
 
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> ForwardIterator, <span class="kw1">class</span> Predicate<span class="sy1">></span>
ForwardIterator partition_point<span class="br0">(</span>ForwardIterator first,
ForwardIterator last,
Predicate pred<span class="br0">)</span><span class="sy4">;</span>
 
<span class="co1">// sorting and related operations:</span>
 
<span class="co1">// sorting:</span>
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> RandomAccessIterator<span class="sy1">></span>
<span class="kw4">void</span> sort<span class="br0">(</span>RandomAccessIterator first, RandomAccessIterator last<span class="br0">)</span><span class="sy4">;</span>
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> RandomAccessIterator, <span class="kw1">class</span> Compare<span class="sy1">></span>
<span class="kw4">void</span> sort<span class="br0">(</span>RandomAccessIterator first, RandomAccessIterator last,
Compare comp<span class="br0">)</span><span class="sy4">;</span>
 
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> RandomAccessIterator<span class="sy1">></span>
<span class="kw4">void</span> stable_sort<span class="br0">(</span>RandomAccessIterator first, RandomAccessIterator last<span class="br0">)</span><span class="sy4">;</span>
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> RandomAccessIterator, <span class="kw1">class</span> Compare<span class="sy1">></span>
<span class="kw4">void</span> stable_sort<span class="br0">(</span>RandomAccessIterator first, RandomAccessIterator last,
Compare comp<span class="br0">)</span><span class="sy4">;</span>
 
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> RandomAccessIterator<span class="sy1">></span>
<span class="kw4">void</span> partial_sort<span class="br0">(</span>RandomAccessIterator first,
RandomAccessIterator middle,
RandomAccessIterator last<span class="br0">)</span><span class="sy4">;</span>
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> RandomAccessIterator, <span class="kw1">class</span> Compare<span class="sy1">></span>
<span class="kw4">void</span> partial_sort<span class="br0">(</span>RandomAccessIterator first,
RandomAccessIterator middle,
RandomAccessIterator last, Compare comp<span class="br0">)</span><span class="sy4">;</span>
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> InputIterator, <span class="kw1">class</span> RandomAccessIterator<span class="sy1">></span>
RandomAccessIterator partial_sort_copy<span class="br0">(</span>
InputIterator first, InputIterator last,
RandomAccessIterator result_first,
RandomAccessIterator result_last<span class="br0">)</span><span class="sy4">;</span>
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> InputIterator, <span class="kw1">class</span> RandomAccessIterator, <span class="kw1">class</span> Compare<span class="sy1">></span>
RandomAccessIterator partial_sort_copy<span class="br0">(</span>
InputIterator first, InputIterator last,
RandomAccessIterator result_first,
RandomAccessIterator result_last,
Compare comp<span class="br0">)</span><span class="sy4">;</span>
 
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> ForwardIterator<span class="sy1">></span>
<span class="kw4">bool</span> is_sorted<span class="br0">(</span>ForwardIterator first, ForwardIterator last<span class="br0">)</span><span class="sy4">;</span>
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> ForwardIterator, <span class="kw1">class</span> Compare<span class="sy1">></span>
<span class="kw4">bool</span> is_sorted<span class="br0">(</span>ForwardIterator first, ForwardIterator last,
Compare comp<span class="br0">)</span><span class="sy4">;</span>
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> ForwardIterator<span class="sy1">></span>
ForwardIterator is_sorted_until<span class="br0">(</span>ForwardIterator first, ForwardIterator last<span class="br0">)</span><span class="sy4">;</span>
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> ForwardIterator, <span class="kw1">class</span> Compare<span class="sy1">></span>
ForwardIterator is_sorted_until<span class="br0">(</span>ForwardIterator first, ForwardIterator last,
Compare comp<span class="br0">)</span><span class="sy4">;</span>
 
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> RandomAccessIterator<span class="sy1">></span>
<span class="kw4">void</span> nth_element<span class="br0">(</span>RandomAccessIterator first, RandomAccessIterator nth,
RandomAccessIterator last<span class="br0">)</span><span class="sy4">;</span>
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> RandomAccessIterator, <span class="kw1">class</span> Compare<span class="sy1">></span>
<span class="kw4">void</span> nth_element<span class="br0">(</span>RandomAccessIterator first, RandomAccessIterator nth,
RandomAccessIterator last, Compare comp<span class="br0">)</span><span class="sy4">;</span>
<span class="co1">// binary search:</span>
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> ForwardIterator, <span class="kw1">class</span> T<span class="sy1">></span>
ForwardIterator lower_bound<span class="br0">(</span>ForwardIterator first, ForwardIterator last,
<span class="kw4">const</span> T<span class="sy3">&</span> value<span class="br0">)</span><span class="sy4">;</span>
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> ForwardIterator, <span class="kw1">class</span> T, <span class="kw1">class</span> Compare<span class="sy1">></span>
ForwardIterator lower_bound<span class="br0">(</span>ForwardIterator first, ForwardIterator last,
<span class="kw4">const</span> T<span class="sy3">&</span> value, Compare comp<span class="br0">)</span><span class="sy4">;</span>
 
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> ForwardIterator, <span class="kw1">class</span> T<span class="sy1">></span>
ForwardIterator upper_bound<span class="br0">(</span>ForwardIterator first, ForwardIterator last,
<span class="kw4">const</span> T<span class="sy3">&</span> value<span class="br0">)</span><span class="sy4">;</span>
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> ForwardIterator, <span class="kw1">class</span> T, <span class="kw1">class</span> Compare<span class="sy1">></span>
ForwardIterator upper_bound<span class="br0">(</span>ForwardIterator first, ForwardIterator last,
<span class="kw4">const</span> T<span class="sy3">&</span> value, Compare comp<span class="br0">)</span><span class="sy4">;</span>
 
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> ForwardIterator, <span class="kw1">class</span> T<span class="sy1">></span>
pair<span class="sy1"><</span>ForwardIterator, ForwardIterator<span class="sy1">></span>
equal_range<span class="br0">(</span>ForwardIterator first, ForwardIterator last,
<span class="kw4">const</span> T<span class="sy3">&</span> value<span class="br0">)</span><span class="sy4">;</span>
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> ForwardIterator, <span class="kw1">class</span> T, <span class="kw1">class</span> Compare<span class="sy1">></span>
pair<span class="sy1"><</span>ForwardIterator, ForwardIterator<span class="sy1">></span>
equal_range<span class="br0">(</span>ForwardIterator first, ForwardIterator last,
<span class="kw4">const</span> T<span class="sy3">&</span> value, Compare comp<span class="br0">)</span><span class="sy4">;</span>
 
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> ForwardIterator, <span class="kw1">class</span> T<span class="sy1">></span>
<span class="kw4">bool</span> binary_search<span class="br0">(</span>ForwardIterator first, ForwardIterator last,
<span class="kw4">const</span> T<span class="sy3">&</span> value<span class="br0">)</span><span class="sy4">;</span>
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> ForwardIterator, <span class="kw1">class</span> T, <span class="kw1">class</span> Compare<span class="sy1">></span>
<span class="kw4">bool</span> binary_search<span class="br0">(</span>ForwardIterator first, ForwardIterator last,
<span class="kw4">const</span> T<span class="sy3">&</span> value, Compare comp<span class="br0">)</span><span class="sy4">;</span>
 
<span class="co1">// merge:</span>
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> InputIterator1, <span class="kw1">class</span> InputIterator2, <span class="kw1">class</span> OutputIterator<span class="sy1">></span>
OutputIterator merge<span class="br0">(</span>InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2, InputIterator2 last2,
OutputIterator result<span class="br0">)</span><span class="sy4">;</span>
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> InputIterator1, <span class="kw1">class</span> InputIterator2, <span class="kw1">class</span> OutputIterator,
<span class="kw1">class</span> Compare<span class="sy1">></span>
OutputIterator merge<span class="br0">(</span>InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2, InputIterator2 last2,
OutputIterator result, Compare comp<span class="br0">)</span><span class="sy4">;</span>
 
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> BidirectionalIterator<span class="sy1">></span>
<span class="kw4">void</span> inplace_merge<span class="br0">(</span>BidirectionalIterator first,
BidirectionalIterator middle,
BidirectionalIterator last<span class="br0">)</span><span class="sy4">;</span>
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> BidirectionalIterator, <span class="kw1">class</span> Compare<span class="sy1">></span>
<span class="kw4">void</span> inplace_merge<span class="br0">(</span>BidirectionalIterator first,
BidirectionalIterator middle,
BidirectionalIterator last, Compare comp<span class="br0">)</span><span class="sy4">;</span>
 
<span class="co1">// set operations:</span>
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> InputIterator1, <span class="kw1">class</span> InputIterator2<span class="sy1">></span>
<span class="kw4">bool</span> includes<span class="br0">(</span>InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2, InputIterator2 last2<span class="br0">)</span><span class="sy4">;</span>
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> InputIterator1, <span class="kw1">class</span> InputIterator2, <span class="kw1">class</span> Compare<span class="sy1">></span>
<span class="kw4">bool</span> includes<span class="br0">(</span>
InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2, InputIterator2 last2, Compare comp<span class="br0">)</span><span class="sy4">;</span>
 
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> InputIterator1, <span class="kw1">class</span> InputIterator2, <span class="kw1">class</span> OutputIterator<span class="sy1">></span>
OutputIterator set_union<span class="br0">(</span>InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2, InputIterator2 last2,
OutputIterator result<span class="br0">)</span><span class="sy4">;</span>
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> InputIterator1, <span class="kw1">class</span> InputIterator2, <span class="kw1">class</span> OutputIterator,
<span class="kw1">class</span> Compare<span class="sy1">></span>
OutputIterator set_union<span class="br0">(</span>InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2, InputIterator2 last2,
OutputIterator result, Compare comp<span class="br0">)</span><span class="sy4">;</span>
 
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> InputIterator1, <span class="kw1">class</span> InputIterator2, <span class="kw1">class</span> OutputIterator<span class="sy1">></span>
OutputIterator set_intersection<span class="br0">(</span>
InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2, InputIterator2 last2,
OutputIterator result<span class="br0">)</span><span class="sy4">;</span>
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> InputIterator1, <span class="kw1">class</span> InputIterator2, <span class="kw1">class</span> OutputIterator,
<span class="kw1">class</span> Compare<span class="sy1">></span>
OutputIterator set_intersection<span class="br0">(</span>
InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2, InputIterator2 last2,
OutputIterator result, Compare comp<span class="br0">)</span><span class="sy4">;</span>
 
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> InputIterator1, <span class="kw1">class</span> InputIterator2, <span class="kw1">class</span> OutputIterator<span class="sy1">></span>
OutputIterator set_difference<span class="br0">(</span>
InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2, InputIterator2 last2,
OutputIterator result<span class="br0">)</span><span class="sy4">;</span>
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> InputIterator1, <span class="kw1">class</span> InputIterator2, <span class="kw1">class</span> OutputIterator,
<span class="kw1">class</span> Compare<span class="sy1">></span>
OutputIterator set_difference<span class="br0">(</span>
InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2, InputIterator2 last2,
OutputIterator result, Compare comp<span class="br0">)</span><span class="sy4">;</span>
 
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> InputIterator1, <span class="kw1">class</span> InputIterator2, <span class="kw1">class</span> OutputIterator<span class="sy1">></span>
OutputIterator set_symmetric_difference<span class="br0">(</span>
InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2, InputIterator2 last2,
OutputIterator result<span class="br0">)</span><span class="sy4">;</span>
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> InputIterator1, <span class="kw1">class</span> InputIterator2, <span class="kw1">class</span> OutputIterator,
<span class="kw1">class</span> Compare<span class="sy1">></span>
OutputIterator set_symmetric_difference<span class="br0">(</span>
InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2, InputIterator2 last2,
OutputIterator result, Compare comp<span class="br0">)</span><span class="sy4">;</span>
 
<span class="co1">// heap operations:</span>
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> RandomAccessIterator<span class="sy1">></span>
<span class="kw4">void</span> push_heap<span class="br0">(</span>RandomAccessIterator first, RandomAccessIterator last<span class="br0">)</span><span class="sy4">;</span>
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> RandomAccessIterator, <span class="kw1">class</span> Compare<span class="sy1">></span>
<span class="kw4">void</span> push_heap<span class="br0">(</span>RandomAccessIterator first, RandomAccessIterator last,
Compare comp<span class="br0">)</span><span class="sy4">;</span>
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> RandomAccessIterator<span class="sy1">></span>
<span class="kw4">void</span> pop_heap<span class="br0">(</span>RandomAccessIterator first, RandomAccessIterator last<span class="br0">)</span><span class="sy4">;</span>
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> RandomAccessIterator, <span class="kw1">class</span> Compare<span class="sy1">></span>
<span class="kw4">void</span> pop_heap<span class="br0">(</span>RandomAccessIterator first, RandomAccessIterator last,
Compare comp<span class="br0">)</span><span class="sy4">;</span>
 
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> RandomAccessIterator<span class="sy1">></span>
<span class="kw4">void</span> make_heap<span class="br0">(</span>RandomAccessIterator first, RandomAccessIterator last<span class="br0">)</span><span class="sy4">;</span>
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> RandomAccessIterator, <span class="kw1">class</span> Compare<span class="sy1">></span>
<span class="kw4">void</span> make_heap<span class="br0">(</span>RandomAccessIterator first, RandomAccessIterator last,
Compare comp<span class="br0">)</span><span class="sy4">;</span>
 
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> RandomAccessIterator<span class="sy1">></span>
<span class="kw4">void</span> sort_heap<span class="br0">(</span>RandomAccessIterator first, RandomAccessIterator last<span class="br0">)</span><span class="sy4">;</span>
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> RandomAccessIterator, <span class="kw1">class</span> Compare<span class="sy1">></span>
<span class="kw4">void</span> sort_heap<span class="br0">(</span>RandomAccessIterator first, RandomAccessIterator last,
Compare comp<span class="br0">)</span><span class="sy4">;</span>
 
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> RandomAccessIterator<span class="sy1">></span>
<span class="kw4">bool</span> is_heap<span class="br0">(</span>RandomAccessIterator first, RandomAccessIterator last<span class="br0">)</span><span class="sy4">;</span>
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> RandomAccessIterator, <span class="kw1">class</span> Compare<span class="sy1">></span>
<span class="kw4">bool</span> is_heap<span class="br0">(</span>RandomAccessIterator first, RandomAccessIterator last, Compare comp<span class="br0">)</span><span class="sy4">;</span>
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> RandomAccessIterator<span class="sy1">></span>
RandomAccessIterator is_heap_until<span class="br0">(</span>RandomAccessIterator first, RandomAccessIterator last<span class="br0">)</span><span class="sy4">;</span>
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> RandomAccessIterator, <span class="kw1">class</span> Compare<span class="sy1">></span>
RandomAccessIterator is_heap_until<span class="br0">(</span>RandomAccessIterator first, RandomAccessIterator last,
Compare comp<span class="br0">)</span><span class="sy4">;</span>
<span class="co1">// minimum and maximum:</span>
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> T<span class="sy1">></span> <span class="kw4">const</span> T<span class="sy3">&</span> min<span class="br0">(</span><span class="kw4">const</span> T<span class="sy3">&</span> a, <span class="kw4">const</span> T<span class="sy3">&</span> b<span class="br0">)</span><span class="sy4">;</span>
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> T, <span class="kw1">class</span> Compare<span class="sy1">></span>
<span class="kw4">const</span> T<span class="sy3">&</span> min<span class="br0">(</span><span class="kw4">const</span> T<span class="sy3">&</span> a, <span class="kw4">const</span> T<span class="sy3">&</span> b, Compare comp<span class="br0">)</span><span class="sy4">;</span>
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> T<span class="sy1">></span>
T min<span class="br0">(</span>initializer_list<span class="sy1"><</span>T<span class="sy1">></span> t<span class="br0">)</span><span class="sy4">;</span>
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> T, <span class="kw1">class</span> Compare<span class="sy1">></span>
T min<span class="br0">(</span>initializer_list<span class="sy1"><</span>T<span class="sy1">></span> t, Compare comp<span class="br0">)</span><span class="sy4">;</span>
 
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> T<span class="sy1">></span> <span class="kw4">const</span> T<span class="sy3">&</span> max<span class="br0">(</span><span class="kw4">const</span> T<span class="sy3">&</span> a, <span class="kw4">const</span> T<span class="sy3">&</span> b<span class="br0">)</span><span class="sy4">;</span>
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> T, <span class="kw1">class</span> Compare<span class="sy1">></span>
<span class="kw4">const</span> T<span class="sy3">&</span> max<span class="br0">(</span><span class="kw4">const</span> T<span class="sy3">&</span> a, <span class="kw4">const</span> T<span class="sy3">&</span> b, Compare comp<span class="br0">)</span><span class="sy4">;</span>
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> T<span class="sy1">></span>
T max<span class="br0">(</span>initializer_list<span class="sy1"><</span>T<span class="sy1">></span> t<span class="br0">)</span><span class="sy4">;</span>
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> T, <span class="kw1">class</span> Compare<span class="sy1">></span>
T max<span class="br0">(</span>initializer_list<span class="sy1"><</span>T<span class="sy1">></span> t, Compare comp<span class="br0">)</span><span class="sy4">;</span>
 
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> T<span class="sy1">></span> pair<span class="sy1"><</span><span class="kw4">const</span> T<span class="sy3">&</span>, <span class="kw4">const</span> T<span class="sy3">&</span><span class="sy1">></span> minmax<span class="br0">(</span><span class="kw4">const</span> T<span class="sy3">&</span> a, <span class="kw4">const</span> T<span class="sy3">&</span> b<span class="br0">)</span><span class="sy4">;</span>
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> T, <span class="kw1">class</span> Compare<span class="sy1">></span>
pair<span class="sy1"><</span><span class="kw4">const</span> T<span class="sy3">&</span>, <span class="kw4">const</span> T<span class="sy3">&</span><span class="sy1">></span> minmax<span class="br0">(</span><span class="kw4">const</span> T<span class="sy3">&</span> a, <span class="kw4">const</span> T<span class="sy3">&</span> b, Compare comp<span class="br0">)</span><span class="sy4">;</span>
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> T<span class="sy1">></span>
pair<span class="sy1"><</span>T, T<span class="sy1">></span> minmax<span class="br0">(</span>initializer_list<span class="sy1"><</span>T<span class="sy1">></span> t<span class="br0">)</span><span class="sy4">;</span>
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> T, <span class="kw1">class</span> Compare<span class="sy1">></span>
pair<span class="sy1"><</span>T, T<span class="sy1">></span> minmax<span class="br0">(</span>initializer_list<span class="sy1"><</span>T<span class="sy1">></span> t, Compare comp<span class="br0">)</span><span class="sy4">;</span>
 
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> ForwardIterator<span class="sy1">></span>
ForwardIterator min_element<span class="br0">(</span>ForwardIterator first, ForwardIterator last<span class="br0">)</span><span class="sy4">;</span>
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> ForwardIterator, <span class="kw1">class</span> Compare<span class="sy1">></span>
ForwardIterator min_element<span class="br0">(</span>ForwardIterator first, ForwardIterator last,
Compare comp<span class="br0">)</span><span class="sy4">;</span>
 
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> ForwardIterator<span class="sy1">></span>
ForwardIterator max_element<span class="br0">(</span>ForwardIterator first, ForwardIterator last<span class="br0">)</span><span class="sy4">;</span>
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> ForwardIterator, <span class="kw1">class</span> Compare<span class="sy1">></span>
ForwardIterator max_element<span class="br0">(</span>ForwardIterator first, ForwardIterator last,
Compare comp<span class="br0">)</span><span class="sy4">;</span>
 
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> ForwardIterator<span class="sy1">></span>
pair<span class="sy1"><</span>ForwardIterator, ForwardIterator<span class="sy1">></span>
minmax_element<span class="br0">(</span>ForwardIterator first, ForwardIterator last<span class="br0">)</span><span class="sy4">;</span>
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> ForwardIterator, <span class="kw1">class</span> Compare<span class="sy1">></span>
pair<span class="sy1"><</span>ForwardIterator, ForwardIterator<span class="sy1">></span>
minmax_element<span class="br0">(</span>ForwardIterator first, ForwardIterator last, Compare comp<span class="br0">)</span><span class="sy4">;</span>
 
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> InputIterator1, <span class="kw1">class</span> InputIterator2<span class="sy1">></span>
<span class="kw4">bool</span> lexicographical_compare<span class="br0">(</span>
InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2, InputIterator2 last2<span class="br0">)</span><span class="sy4">;</span>
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> InputIterator1, <span class="kw1">class</span> InputIterator2, <span class="kw1">class</span> Compare<span class="sy1">></span>
<span class="kw4">bool</span> lexicographical_compare<span class="br0">(</span>
InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2, InputIterator2 last2,
Compare comp<span class="br0">)</span><span class="sy4">;</span>
 
<span class="co1">// permutations:</span>
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> BidirectionalIterator<span class="sy1">></span>
<span class="kw4">bool</span> next_permutation<span class="br0">(</span>BidirectionalIterator first,
BidirectionalIterator last<span class="br0">)</span><span class="sy4">;</span>
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> BidirectionalIterator, <span class="kw1">class</span> Compare<span class="sy1">></span>
<span class="kw4">bool</span> next_permutation<span class="br0">(</span>BidirectionalIterator first,
BidirectionalIterator last, Compare comp<span class="br0">)</span><span class="sy4">;</span>
 
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> BidirectionalIterator<span class="sy1">></span>
<span class="kw4">bool</span> prev_permutation<span class="br0">(</span>BidirectionalIterator first,
BidirectionalIterator last<span class="br0">)</span><span class="sy4">;</span>
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> BidirectionalIterator, <span class="kw1">class</span> Compare<span class="sy1">></span>
<span class="kw4">bool</span> prev_permutation<span class="br0">(</span>BidirectionalIterator first,
BidirectionalIterator last, Compare comp<span class="br0">)</span><span class="sy4">;</span>
<span class="br0">}</span></pre></div></div>
<!--
NewPP limit report
Preprocessor visited node count: 11972/1000000
Preprocessor generated node count: 8234/1000000
Post‐expand include size: 410651/2097152 bytes
Template argument size: 98982/2097152 bytes
Highest expansion depth: 20/40
Expensive parser function count: 0/100
-->
<!-- Saved in parser cache with key mwiki1-mwiki_en_:pcache:idhash:9750-0!*!0!!en!*!* and timestamp 20150928014357 -->
</div> <!-- /bodycontent -->
<!-- printfooter -->
<div class="printfooter">
Retrieved from "<a href="http://en.cppreference.com/mwiki/index.php?title=cpp/header/algorithm&oldid=57426">http://en.cppreference.com/mwiki/index.php?title=cpp/header/algorithm&oldid=57426</a>" </div>
<!-- /printfooter -->
<!-- catlinks -->
<div id='catlinks' class='catlinks catlinks-allhidden'></div> <!-- /catlinks -->
<div class="visualClear"></div>
<!-- debughtml -->
<!-- /debughtml -->
</div>
<!-- /bodyContent -->
</div>
</div>
<!-- /content -->
<!-- footer -->
<div id="cpp-footer-base" class="noprint">
<div id="footer">
<div id="cpp-navigation">
<h5>Navigation</h5>
<ul>
<li id="n-Support-us"><a href="http://www.cppreference.com/support" rel="nofollow">Support us</a></li><li id="n-recentchanges"><a href="http://en.cppreference.com/w/Special:RecentChanges" title="A list of recent changes in the wiki [r]" accesskey="r">Recent changes</a></li><li id="n-FAQ"><a href="http://en.cppreference.com/w/Cppreference:FAQ">FAQ</a></li><li id="n-Offline-version"><a href="http://en.cppreference.com/w/Cppreference:Archives">Offline version</a></li> </ul>
</div>
<div id="cpp-toolbox">
<h5><span>Toolbox</span><a href="algorithm.html#"></a></h5>
<ul>
<li id="t-whatlinkshere"><a href="http://en.cppreference.com/w/Special:WhatLinksHere/cpp/header/algorithm" title="A list of all wiki pages that link here [j]" accesskey="j">What links here</a></li><li id="t-recentchangeslinked"><a href="http://en.cppreference.com/w/Special:RecentChangesLinked/cpp/header/algorithm" title="Recent changes in pages linked from this page [k]" accesskey="k">Related changes</a></li><li id="t-upload"><a href="http://upload.cppreference.com/w/Special:Upload" title="Upload files [u]" accesskey="u">Upload file</a></li><li id="t-specialpages"><a href="http://en.cppreference.com/w/Special:SpecialPages" title="A list of all special pages [q]" accesskey="q">Special pages</a></li><li id="t-print"><a href="http://en.cppreference.com/mwiki/index.php?title=cpp/header/algorithm&printable=yes" rel="alternate" title="Printable version of this page [p]" accesskey="p">Printable version</a></li><li id="t-permalink"><a href="http://en.cppreference.com/mwiki/index.php?title=cpp/header/algorithm&oldid=57426" title="Permanent link to this revision of the page">Permanent link</a></li><li id="t-info"><a href="http://en.cppreference.com/mwiki/index.php?title=cpp/header/algorithm&action=info">Page information</a></li> </ul>
</div>
<ul id="footer-info">
<li id="footer-info-lastmod"> This page was last modified on 31 May 2013, at 22:53.</li>
<li id="footer-info-viewcount">This page has been accessed 32,479 times.</li>
</ul>
<ul id="footer-places">
<li id="footer-places-privacy"><a href="http://en.cppreference.com/w/Cppreference:Privacy_policy" title="Cppreference:Privacy policy">Privacy policy</a></li>
<li id="footer-places-about"><a href="http://en.cppreference.com/w/Cppreference:About" title="Cppreference:About">About cppreference.com</a></li>
<li id="footer-places-disclaimer"><a href="http://en.cppreference.com/w/Cppreference:General_disclaimer" title="Cppreference:General disclaimer">Disclaimers</a></li>
</ul>
<ul id="footer-icons" class="noprint">
<li id="footer-poweredbyico">
<a href="http://www.mediawiki.org/"><img src="../../../mwiki/skins/common/images/poweredby_mediawiki_88x31.png" alt="Powered by MediaWiki" width="88" height="31" /></a> <a href="http://qbnz.com/highlighter/"><img src="../../../../upload.cppreference.com/mwiki/images/2/2b/powered_by_geshi_88x31.png" alt="Powered by GeSHi" height="31" width="88" /></a> <a href="http://www.tigertech.net/referral/cppreference.com"><img src="../../../../upload.cppreference.com/mwiki/images/9/94/powered_by_tigertech_88x31.png" alt="Hosted by Tiger Technologies" height="31" width="88" /></a> </li>
</ul>
<div style="clear:both">
</div>
</div>
</div>
<!-- /footer -->
<script>if(window.mw){
mw.loader.state({"site":"loading","user":"missing","user.groups":"ready"});
}</script>
<script src="../../../mwiki/load.php%3Fdebug=false&lang=en&modules=skins.cppreference2&only=scripts&skin=cppreference2&*"></script>
<script>if(window.mw){
mw.loader.load(["mediawiki.action.view.postEdit","mediawiki.user","mediawiki.page.ready","mediawiki.searchSuggest","mediawiki.hidpi","ext.gadget.ColiruCompiler"], null, true);
}</script>
<script src="../../../mwiki/load.php%3Fdebug=false&lang=en&modules=site&only=scripts&skin=cppreference2&*"></script>
<script type="text/javascript">
var gaJsHost = (("https:" == document.location.protocol) ? "https://ssl." : "http://www.");
document.write(unescape("%3Cscript src='" + gaJsHost + "google-analytics.com/ga.js' type='text/javascript'%3E%3C/script%3E"));
</script>
<script type="text/javascript">
var _gaq = _gaq || [];
_gaq.push(['_setAccount', 'UA-2828341-1']);
_gaq.push(['_setDomainName', 'cppreference.com']);
_gaq.push(['_trackPageview']);
</script><!-- Served in 3.185 secs. -->
</body>
<!-- Cached 20150928014357 -->
</html>
|
