| blob | dd6d7f338c430994f94f39f6dacc1892b7b0b651 |
1 // Algorithm implementation -*- C++ -*-
3 // Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007
4 // Free Software Foundation, Inc.
5 //
6 // This file is part of the GNU ISO C++ Library. This library is free
7 // software; you can redistribute it and/or modify it under the
8 // terms of the GNU General Public License as published by the
9 // Free Software Foundation; either version 2, or (at your option)
10 // any later version.
12 // This library is distributed in the hope that it will be useful,
13 // but WITHOUT ANY WARRANTY; without even the implied warranty of
14 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 // GNU General Public License for more details.
17 // You should have received a copy of the GNU General Public License along
18 // with this library; see the file COPYING. If not, write to the Free
19 // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
20 // USA.
22 // As a special exception, you may use this file as part of a free software
23 // library without restriction. Specifically, if other files instantiate
24 // templates or use macros or inline functions from this file, or you compile
25 // this file and link it with other files to produce an executable, this
26 // file does not by itself cause the resulting executable to be covered by
27 // the GNU General Public License. This exception does not however
28 // invalidate any other reasons why the executable file might be covered by
29 // the GNU General Public License.
31 /*
32 *
33 * Copyright (c) 1994
34 * Hewlett-Packard Company
35 *
36 * Permission to use, copy, modify, distribute and sell this software
37 * and its documentation for any purpose is hereby granted without fee,
38 * provided that the above copyright notice appear in all copies and
39 * that both that copyright notice and this permission notice appear
40 * in supporting documentation. Hewlett-Packard Company makes no
41 * representations about the suitability of this software for any
42 * purpose. It is provided "as is" without express or implied warranty.
43 *
44 *
45 * Copyright (c) 1996
46 * Silicon Graphics Computer Systems, Inc.
47 *
48 * Permission to use, copy, modify, distribute and sell this software
49 * and its documentation for any purpose is hereby granted without fee,
50 * provided that the above copyright notice appear in all copies and
51 * that both that copyright notice and this permission notice appear
52 * in supporting documentation. Silicon Graphics makes no
53 * representations about the suitability of this software for any
54 * purpose. It is provided "as is" without express or implied warranty.
55 */
57 /** @file stl_algo.h
58 * This is an internal header file, included by other library headers.
59 * You should not attempt to use it directly.
60 */
62 #ifndef _STL_ALGO_H
63 #define _STL_ALGO_H 1
66 #include <bits/stl_heap.h>
68 #include <bits/algorithmfwd.h>
69 #include <debug/debug.h>
71 // See concept_check.h for the __glibcxx_*_requires macros.
75 /**
76 * @brief Find the median of three values.
77 * @param a A value.
78 * @param b A value.
79 * @param c A value.
80 * @return One of @p a, @p b or @p c.
81 *
82 * If @c {l,m,n} is some convolution of @p {a,b,c} such that @c l<=m<=n
83 * then the value returned will be @c m.
84 * This is an SGI extension.
85 * @ingroup SGIextensions
86 */
90 {
91 // concept requirements
98 else
104 else
106 }
108 /**
109 * @brief Find the median of three values using a predicate for comparison.
110 * @param a A value.
111 * @param b A value.
112 * @param c A value.
113 * @param comp A binary predicate.
114 * @return One of @p a, @p b or @p c.
115 *
116 * If @c {l,m,n} is some convolution of @p {a,b,c} such that @p comp(l,m)
117 * and @p comp(m,n) are both true then the value returned will be @c m.
118 * This is an SGI extension.
119 * @ingroup SGIextensions
120 */
124 {
125 // concept requirements
133 else
139 else
141 }
143 // for_each
145 /**
146 * @if maint
147 * This is an overload used by find() for the Input Iterator case.
148 * @endif
149 */
151 inline _InputIterator
154 {
158 }
160 /**
161 * @if maint
162 * This is an overload used by find_if() for the Input Iterator case.
163 * @endif
164 */
166 inline _InputIterator
169 {
173 }
175 /**
176 * @if maint
177 * This is an overload used by find() for the RAI case.
178 * @endif
179 */
181 _RandomAccessIterator
184 {
189 {
205 }
208 {
224 }
225 }
227 /**
228 * @if maint
229 * This is an overload used by find_if() for the RAI case.
230 * @endif
231 */
233 _RandomAccessIterator
236 {
241 {
257 }
260 {
276 }
277 }
279 // set_difference
280 // set_intersection
281 // set_symmetric_difference
282 // set_union
283 // for_each
284 // find
285 // find_if
286 // find_first_of
287 // adjacent_find
288 // count
289 // count_if
290 // search
292 /**
293 * @if maint
294 * This is an uglified
295 * search_n(_ForwardIterator, _ForwardIterator, _Integer, const _Tp&)
296 * overloaded for forward iterators.
297 * @endif
298 */
300 _ForwardIterator
304 {
307 {
313 {
316 }
322 }
324 }
326 /**
327 * @if maint
328 * This is an uglified
329 * search_n(_ForwardIterator, _ForwardIterator, _Integer, const _Tp&)
330 * overloaded for random access iterators.
331 * @endif
332 */
334 _RandomAccessIter
338 {
341 _DistanceType;
354 {
355 // __lookAhead here is always pointing to the last element of next
356 // possible match.
358 {
363 }
367 {
370 }
375 }
376 }
378 // search_n
380 /**
381 * @if maint
382 * This is an uglified
383 * search_n(_ForwardIterator, _ForwardIterator, _Integer, const _Tp&,
384 * _BinaryPredicate)
385 * overloaded for forward iterators.
386 * @endif
387 */
389 typename _BinaryPredicate>
390 _ForwardIterator
394 {
399 {
405 {
408 }
417 }
419 }
421 /**
422 * @if maint
423 * This is an uglified
424 * search_n(_ForwardIterator, _ForwardIterator, _Integer, const _Tp&,
425 * _BinaryPredicate)
426 * overloaded for random access iterators.
427 * @endif
428 */
430 typename _BinaryPredicate>
431 _RandomAccessIter
435 {
438 _DistanceType;
451 {
452 // __lookAhead here is always pointing to the last element of next
453 // possible match.
455 {
460 }
464 {
467 }
472 }
473 }
475 // find_end for forward iterators.
477 _ForwardIterator1
481 {
484 else
485 {
488 {
489 _ForwardIterator1 __new_result
493 else
494 {
498 }
499 }
500 }
501 }
504 typename _BinaryPredicate>
505 _ForwardIterator1
509 _BinaryPredicate __comp)
510 {
513 else
514 {
517 {
518 _ForwardIterator1 __new_result
523 else
524 {
528 }
529 }
530 }
531 }
533 // find_end for bidirectional iterators (much faster).
535 _BidirectionalIterator1
537 _BidirectionalIterator1 __last1,
538 _BidirectionalIterator2 __first2,
539 _BidirectionalIterator2 __last2,
541 {
542 // concept requirements
544 _BidirectionalIterator1>)
546 _BidirectionalIterator2>)
554 __rlast1,
556 __rlast2);
560 else
561 {
565 }
566 }
569 typename _BinaryPredicate>
570 _BidirectionalIterator1
572 _BidirectionalIterator1 __last1,
573 _BidirectionalIterator2 __first2,
574 _BidirectionalIterator2 __last2,
576 _BinaryPredicate __comp)
577 {
578 // concept requirements
580 _BidirectionalIterator1>)
582 _BidirectionalIterator2>)
591 __comp);
595 else
596 {
600 }
601 }
603 /**
604 * @brief Find last matching subsequence in a sequence.
605 * @param first1 Start of range to search.
606 * @param last1 End of range to search.
607 * @param first2 Start of sequence to match.
608 * @param last2 End of sequence to match.
609 * @return The last iterator @c i in the range
610 * @p [first1,last1-(last2-first2)) such that @c *(i+N) == @p *(first2+N)
611 * for each @c N in the range @p [0,last2-first2), or @p last1 if no
612 * such iterator exists.
613 *
614 * Searches the range @p [first1,last1) for a sub-sequence that compares
615 * equal value-by-value with the sequence given by @p [first2,last2) and
616 * returns an iterator to the first element of the sub-sequence, or
617 * @p last1 if the sub-sequence is not found. The sub-sequence will be the
618 * last such subsequence contained in [first,last1).
619 *
620 * Because the sub-sequence must lie completely within the range
621 * @p [first1,last1) it must start at a position less than
622 * @p last1-(last2-first2) where @p last2-first2 is the length of the
623 * sub-sequence.
624 * This means that the returned iterator @c i will be in the range
625 * @p [first1,last1-(last2-first2))
626 */
628 inline _ForwardIterator1
631 {
632 // concept requirements
644 }
646 /**
647 * @brief Find last matching subsequence in a sequence using a predicate.
648 * @param first1 Start of range to search.
649 * @param last1 End of range to search.
650 * @param first2 Start of sequence to match.
651 * @param last2 End of sequence to match.
652 * @param comp The predicate to use.
653 * @return The last iterator @c i in the range
654 * @p [first1,last1-(last2-first2)) such that @c predicate(*(i+N), @p
655 * (first2+N)) is true for each @c N in the range @p [0,last2-first2), or
656 * @p last1 if no such iterator exists.
657 *
658 * Searches the range @p [first1,last1) for a sub-sequence that compares
659 * equal value-by-value with the sequence given by @p [first2,last2) using
660 * comp as a predicate and returns an iterator to the first element of the
661 * sub-sequence, or @p last1 if the sub-sequence is not found. The
662 * sub-sequence will be the last such subsequence contained in
663 * [first,last1).
664 *
665 * Because the sub-sequence must lie completely within the range
666 * @p [first1,last1) it must start at a position less than
667 * @p last1-(last2-first2) where @p last2-first2 is the length of the
668 * sub-sequence.
669 * This means that the returned iterator @c i will be in the range
670 * @p [first1,last1-(last2-first2))
671 */
673 typename _BinaryPredicate>
674 inline _ForwardIterator1
677 _BinaryPredicate __comp)
678 {
679 // concept requirements
691 __comp);
692 }
695 /**
696 * @brief Copy a sequence, removing elements of a given value.
697 * @param first An input iterator.
698 * @param last An input iterator.
699 * @param result An output iterator.
700 * @param value The value to be removed.
701 * @return An iterator designating the end of the resulting sequence.
702 *
703 * Copies each element in the range @p [first,last) not equal to @p value
704 * to the range beginning at @p result.
705 * remove_copy() is stable, so the relative order of elements that are
706 * copied is unchanged.
707 */
709 _OutputIterator
712 {
713 // concept requirements
723 {
726 }
728 }
730 /**
731 * @brief Copy a sequence, removing elements for which a predicate is true.
732 * @param first An input iterator.
733 * @param last An input iterator.
734 * @param result An output iterator.
735 * @param pred A predicate.
736 * @return An iterator designating the end of the resulting sequence.
737 *
738 * Copies each element in the range @p [first,last) for which
739 * @p pred returns true to the range beginning at @p result.
740 *
741 * remove_copy_if() is stable, so the relative order of elements that are
742 * copied is unchanged.
743 */
745 typename _Predicate>
746 _OutputIterator
749 {
750 // concept requirements
760 {
763 }
765 }
767 /**
768 * @brief Remove elements from a sequence.
769 * @param first An input iterator.
770 * @param last An input iterator.
771 * @param value The value to be removed.
772 * @return An iterator designating the end of the resulting sequence.
773 *
774 * All elements equal to @p value are removed from the range
775 * @p [first,last).
776 *
777 * remove() is stable, so the relative order of elements that are
778 * not removed is unchanged.
779 *
780 * Elements between the end of the resulting sequence and @p last
781 * are still present, but their value is unspecified.
782 */
784 _ForwardIterator
787 {
788 // concept requirements
790 _ForwardIterator>)
802 {
805 }
807 }
809 /**
810 * @brief Remove elements from a sequence using a predicate.
811 * @param first A forward iterator.
812 * @param last A forward iterator.
813 * @param pred A predicate.
814 * @return An iterator designating the end of the resulting sequence.
815 *
816 * All elements for which @p pred returns true are removed from the range
817 * @p [first,last).
818 *
819 * remove_if() is stable, so the relative order of elements that are
820 * not removed is unchanged.
821 *
822 * Elements between the end of the resulting sequence and @p last
823 * are still present, but their value is unspecified.
824 */
826 _ForwardIterator
828 _Predicate __pred)
829 {
830 // concept requirements
832 _ForwardIterator>)
844 {
847 }
849 }
851 /**
852 * @brief Remove consecutive duplicate values from a sequence.
853 * @param first A forward iterator.
854 * @param last A forward iterator.
855 * @return An iterator designating the end of the resulting sequence.
856 *
857 * Removes all but the first element from each group of consecutive
858 * values that compare equal.
859 * unique() is stable, so the relative order of elements that are
860 * not removed is unchanged.
861 * Elements between the end of the resulting sequence and @p last
862 * are still present, but their value is unspecified.
863 */
865 _ForwardIterator
867 {
868 // concept requirements
870 _ForwardIterator>)
875 // Skip the beginning, if already unique.
880 // Do the real copy work.
887 }
889 /**
890 * @brief Remove consecutive values from a sequence using a predicate.
891 * @param first A forward iterator.
892 * @param last A forward iterator.
893 * @param binary_pred A binary predicate.
894 * @return An iterator designating the end of the resulting sequence.
895 *
896 * Removes all but the first element from each group of consecutive
897 * values for which @p binary_pred returns true.
898 * unique() is stable, so the relative order of elements that are
899 * not removed is unchanged.
900 * Elements between the end of the resulting sequence and @p last
901 * are still present, but their value is unspecified.
902 */
904 _ForwardIterator
906 _BinaryPredicate __binary_pred)
907 {
908 // concept requirements
910 _ForwardIterator>)
916 // Skip the beginning, if already unique.
921 // Do the real copy work.
928 }
930 /**
931 * @if maint
932 * This is an uglified unique_copy(_InputIterator, _InputIterator,
933 * _OutputIterator)
934 * overloaded for forward iterators and output iterator as result.
935 * @endif
936 */
938 _OutputIterator
940 _OutputIterator __result,
942 {
943 // concept requirements -- taken care of in dispatching function
948 {
951 }
953 }
955 /**
956 * @if maint
957 * This is an uglified unique_copy(_InputIterator, _InputIterator,
958 * _OutputIterator)
959 * overloaded for input iterators and output iterator as result.
960 * @endif
961 */
963 _OutputIterator
965 _OutputIterator __result,
967 {
968 // concept requirements -- taken care of in dispatching function
973 {
976 }
978 }
980 /**
981 * @if maint
982 * This is an uglified unique_copy(_InputIterator, _InputIterator,
983 * _OutputIterator)
984 * overloaded for input iterators and forward iterator as result.
985 * @endif
986 */
988 _ForwardIterator
990 _ForwardIterator __result,
992 {
993 // concept requirements -- taken care of in dispatching function
999 }
1001 /**
1002 * @if maint
1003 * This is an uglified
1004 * unique_copy(_InputIterator, _InputIterator, _OutputIterator,
1005 * _BinaryPredicate)
1006 * overloaded for forward iterators and output iterator as result.
1007 * @endif
1008 */
1010 typename _BinaryPredicate>
1011 _OutputIterator
1015 {
1016 // concept requirements -- iterators already checked
1025 {
1028 }
1030 }
1032 /**
1033 * @if maint
1034 * This is an uglified
1035 * unique_copy(_InputIterator, _InputIterator, _OutputIterator,
1036 * _BinaryPredicate)
1037 * overloaded for input iterators and output iterator as result.
1038 * @endif
1039 */
1041 typename _BinaryPredicate>
1042 _OutputIterator
1046 {
1047 // concept requirements -- iterators already checked
1056 {
1059 }
1061 }
1063 /**
1064 * @if maint
1065 * This is an uglified
1066 * unique_copy(_InputIterator, _InputIterator, _OutputIterator,
1067 * _BinaryPredicate)
1068 * overloaded for input iterators and forward iterator as result.
1069 * @endif
1070 */
1072 typename _BinaryPredicate>
1073 _ForwardIterator
1077 {
1078 // concept requirements -- iterators already checked
1088 }
1090 /**
1091 * @if maint
1092 * This is an uglified reverse(_BidirectionalIterator,
1093 * _BidirectionalIterator)
1094 * overloaded for bidirectional iterators.
1095 * @endif
1096 */
1098 void
1100 bidirectional_iterator_tag)
1101 {
1105 else
1106 {
1109 }
1110 }
1112 /**
1113 * @if maint
1114 * This is an uglified reverse(_BidirectionalIterator,
1115 * _BidirectionalIterator)
1116 * overloaded for random access iterators.
1117 * @endif
1118 */
1120 void
1122 random_access_iterator_tag)
1123 {
1128 {
1132 }
1133 }
1135 /**
1136 * @brief Reverse a sequence.
1137 * @param first A bidirectional iterator.
1138 * @param last A bidirectional iterator.
1139 * @return reverse() returns no value.
1140 *
1141 * Reverses the order of the elements in the range @p [first,last),
1142 * so that the first element becomes the last etc.
1143 * For every @c i such that @p 0<=i<=(last-first)/2), @p reverse()
1144 * swaps @p *(first+i) and @p *(last-(i+1))
1145 */
1149 {
1150 // concept requirements
1152 _BidirectionalIterator>)
1155 }
1157 /**
1158 * @brief Copy a sequence, reversing its elements.
1159 * @param first A bidirectional iterator.
1160 * @param last A bidirectional iterator.
1161 * @param result An output iterator.
1162 * @return An iterator designating the end of the resulting sequence.
1163 *
1164 * Copies the elements in the range @p [first,last) to the range
1165 * @p [result,result+(last-first)) such that the order of the
1166 * elements is reversed.
1167 * For every @c i such that @p 0<=i<=(last-first), @p reverse_copy()
1168 * performs the assignment @p *(result+(last-first)-i) = *(first+i).
1169 * The ranges @p [first,last) and @p [result,result+(last-first))
1170 * must not overlap.
1171 */
1173 _OutputIterator
1175 _OutputIterator __result)
1176 {
1177 // concept requirements
1179 _BidirectionalIterator>)
1185 {
1189 }
1191 }
1193 /**
1194 * @if maint
1195 * This is a helper function for the rotate algorithm specialized on RAIs.
1196 * It returns the greatest common divisor of two integer values.
1197 * @endif
1198 */
1200 _EuclideanRingElement
1202 {
1204 {
1208 }
1210 }
1212 /**
1213 * @if maint
1214 * This is a helper function for the rotate algorithm.
1215 * @endif
1216 */
1218 void
1220 _ForwardIterator __middle,
1221 _ForwardIterator __last,
1222 forward_iterator_tag)
1223 {
1228 do
1229 {
1235 }
1241 {
1249 }
1250 }
1252 /**
1253 * @if maint
1254 * This is a helper function for the rotate algorithm.
1255 * @endif
1256 */
1258 void
1260 _BidirectionalIterator __middle,
1261 _BidirectionalIterator __last,
1262 bidirectional_iterator_tag)
1263 {
1264 // concept requirements
1266 _BidirectionalIterator>)
1275 {
1278 }
1282 else
1284 }
1286 /**
1287 * @if maint
1288 * This is a helper function for the rotate algorithm.
1289 * @endif
1290 */
1292 void
1294 _RandomAccessIterator __middle,
1295 _RandomAccessIterator __last,
1296 random_access_iterator_tag)
1297 {
1298 // concept requirements
1300 _RandomAccessIterator>)
1306 _Distance;
1308 _ValueType;
1315 {
1318 }
1323 {
1328 {
1330 {
1332 {
1335 }
1339 }
1340 }
1341 else
1342 {
1344 {
1346 {
1349 }
1352 }
1353 }
1357 }
1358 }
1360 /**
1361 * @brief Rotate the elements of a sequence.
1362 * @param first A forward iterator.
1363 * @param middle A forward iterator.
1364 * @param last A forward iterator.
1365 * @return Nothing.
1366 *
1367 * Rotates the elements of the range @p [first,last) by @p (middle-first)
1368 * positions so that the element at @p middle is moved to @p first, the
1369 * element at @p middle+1 is moved to @first+1 and so on for each element
1370 * in the range @p [first,last).
1371 *
1372 * This effectively swaps the ranges @p [first,middle) and
1373 * @p [middle,last).
1374 *
1375 * Performs @p *(first+(n+(last-middle))%(last-first))=*(first+n) for
1376 * each @p n in the range @p [0,last-first).
1377 */
1381 _ForwardIterator __last)
1382 {
1383 // concept requirements
1385 _ForwardIterator>)
1390 _IterType;
1392 }
1394 /**
1395 * @brief Copy a sequence, rotating its elements.
1396 * @param first A forward iterator.
1397 * @param middle A forward iterator.
1398 * @param last A forward iterator.
1399 * @param result An output iterator.
1400 * @return An iterator designating the end of the resulting sequence.
1401 *
1402 * Copies the elements of the range @p [first,last) to the range
1403 * beginning at @result, rotating the copied elements by @p (middle-first)
1404 * positions so that the element at @p middle is moved to @p result, the
1405 * element at @p middle+1 is moved to @result+1 and so on for each element
1406 * in the range @p [first,last).
1407 *
1408 * Performs @p *(result+(n+(last-middle))%(last-first))=*(first+n) for
1409 * each @p n in the range @p [0,last-first).
1410 */
1412 _OutputIterator
1415 {
1416 // concept requirements
1425 }
1427 /**
1428 * @if maint
1429 * This is a helper function...
1430 * @endif
1431 */
1433 _ForwardIterator
1436 {
1448 {
1451 }
1454 }
1456 /**
1457 * @if maint
1458 * This is a helper function...
1459 * @endif
1460 */
1462 _BidirectionalIterator
1465 {
1467 {
1473 else
1481 else
1485 }
1486 }
1488 // partition
1490 /**
1491 * @if maint
1492 * This is a helper function...
1493 * @endif
1494 */
1496 _ForwardIterator
1498 _ForwardIterator __last,
1500 {
1506 __middle,
1507 __pred,
1510 __pred,
1511 __len
1516 }
1518 /**
1519 * @if maint
1520 * This is a helper function...
1521 * @endif
1522 */
1524 typename _Distance>
1525 _ForwardIterator
1527 _ForwardIterator __last,
1529 _Pointer __buffer,
1530 _Distance __buffer_size)
1531 {
1533 {
1538 {
1541 }
1542 else
1543 {
1546 }
1549 }
1550 else
1551 {
1554 _ForwardIterator __begin =
1557 __buffer_size);
1558 _ForwardIterator __end =
1565 }
1566 }
1568 /**
1569 * @brief Move elements for which a predicate is true to the beginning
1570 * of a sequence, preserving relative ordering.
1571 * @param first A forward iterator.
1572 * @param last A forward iterator.
1573 * @param pred A predicate functor.
1574 * @return An iterator @p middle such that @p pred(i) is true for each
1575 * iterator @p i in the range @p [first,middle) and false for each @p i
1576 * in the range @p [middle,last).
1577 *
1578 * Performs the same function as @p partition() with the additional
1579 * guarantee that the relative ordering of elements in each group is
1580 * preserved, so any two elements @p x and @p y in the range
1581 * @p [first,last) such that @p pred(x)==pred(y) will have the same
1582 * relative ordering after calling @p stable_partition().
1583 */
1585 _ForwardIterator
1587 _Predicate __pred)
1588 {
1589 // concept requirements
1591 _ForwardIterator>)
1598 else
1599 {
1601 _ValueType;
1603 _DistanceType;
1606 __last);
1608 return
1613 else
1614 return
1617 }
1618 }
1620 /**
1621 * @if maint
1622 * This is a helper function for the sort routines.
1623 * @endif
1624 */
1626 void
1628 _RandomAccessIterator __middle,
1629 _RandomAccessIterator __last)
1630 {
1635 }
1637 /**
1638 * @if maint
1639 * This is a helper function for the sort routines.
1640 * @endif
1641 */
1643 void
1645 _RandomAccessIterator __middle,
1647 {
1652 }
1654 // partial_sort
1656 /**
1657 * @brief Copy the smallest elements of a sequence.
1658 * @param first An iterator.
1659 * @param last Another iterator.
1660 * @param result_first A random-access iterator.
1661 * @param result_last Another random-access iterator.
1662 * @return An iterator indicating the end of the resulting sequence.
1663 *
1664 * Copies and sorts the smallest N values from the range @p [first,last)
1665 * to the range beginning at @p result_first, where the number of
1666 * elements to be copied, @p N, is the smaller of @p (last-first) and
1667 * @p (result_last-result_first).
1668 * After the sort if @p i and @j are iterators in the range
1669 * @p [result_first,result_first+N) such that @i precedes @j then
1670 * @p *j<*i is false.
1671 * The value returned is @p result_first+N.
1672 */
1674 _RandomAccessIterator
1676 _RandomAccessIterator __result_first,
1677 _RandomAccessIterator __result_last)
1678 {
1680 _InputValueType;
1682 _OutputValueType;
1684 _DistanceType;
1686 // concept requirements
1689 _OutputValueType>)
1691 _OutputValueType>)
1700 {
1704 }
1707 {
1714 }
1717 }
1719 /**
1720 * @brief Copy the smallest elements of a sequence using a predicate for
1721 * comparison.
1722 * @param first An input iterator.
1723 * @param last Another input iterator.
1724 * @param result_first A random-access iterator.
1725 * @param result_last Another random-access iterator.
1726 * @param comp A comparison functor.
1727 * @return An iterator indicating the end of the resulting sequence.
1728 *
1729 * Copies and sorts the smallest N values from the range @p [first,last)
1730 * to the range beginning at @p result_first, where the number of
1731 * elements to be copied, @p N, is the smaller of @p (last-first) and
1732 * @p (result_last-result_first).
1733 * After the sort if @p i and @j are iterators in the range
1734 * @p [result_first,result_first+N) such that @i precedes @j then
1735 * @p comp(*j,*i) is false.
1736 * The value returned is @p result_first+N.
1737 */
1739 _RandomAccessIterator
1741 _RandomAccessIterator __result_first,
1742 _RandomAccessIterator __result_last,
1743 _Compare __comp)
1744 {
1746 _InputValueType;
1748 _OutputValueType;
1750 _DistanceType;
1752 // concept requirements
1755 _RandomAccessIterator>)
1757 _OutputValueType>)
1769 {
1773 }
1776 {
1782 __comp);
1784 }
1787 }
1789 /**
1790 * @if maint
1791 * This is a helper function for the sort routine.
1792 * @endif
1793 */
1795 void
1797 {
1801 {
1805 }
1807 }
1809 /**
1810 * @if maint
1811 * This is a helper function for the sort routine.
1812 * @endif
1813 */
1815 void
1817 _Compare __comp)
1818 {
1822 {
1826 }
1828 }
1830 /**
1831 * @if maint
1832 * This is a helper function for the sort routine.
1833 * @endif
1834 */
1836 void
1838 _RandomAccessIterator __last)
1839 {
1844 {
1848 {
1851 }
1852 else
1854 }
1855 }
1857 /**
1858 * @if maint
1859 * This is a helper function for the sort routine.
1860 * @endif
1861 */
1863 void
1866 {
1870 {
1874 {
1877 }
1878 else
1880 }
1881 }
1883 /**
1884 * @if maint
1885 * This is a helper function for the sort routine.
1886 * @endif
1887 */
1891 _RandomAccessIterator __last)
1892 {
1894 _ValueType;
1898 }
1900 /**
1901 * @if maint
1902 * This is a helper function for the sort routine.
1903 * @endif
1904 */
1909 {
1911 _ValueType;
1915 }
1917 /**
1918 * @if maint
1919 * @doctodo
1920 * This controls some aspect of the sort routines.
1921 * @endif
1922 */
1925 /**
1926 * @if maint
1927 * This is a helper function for the sort routine.
1928 * @endif
1929 */
1931 void
1933 _RandomAccessIterator __last)
1934 {
1936 {
1939 }
1940 else
1942 }
1944 /**
1945 * @if maint
1946 * This is a helper function for the sort routine.
1947 * @endif
1948 */
1950 void
1953 {
1955 {
1958 __comp);
1959 }
1960 else
1962 }
1964 /**
1965 * @if maint
1966 * This is a helper function...
1967 * @endif
1968 */
1970 _RandomAccessIterator
1973 {
1975 {
1985 }
1986 }
1988 /**
1989 * @if maint
1990 * This is a helper function...
1991 * @endif
1992 */
1994 _RandomAccessIterator
1996 _RandomAccessIterator __last,
1998 {
2000 {
2010 }
2011 }
2013 /**
2014 * @if maint
2015 * This is a helper function for the sort routine.
2016 * @endif
2017 */
2019 void
2021 _RandomAccessIterator __last,
2022 _Size __depth_limit)
2023 {
2025 _ValueType;
2028 {
2030 {
2033 }
2035 _RandomAccessIterator __cut =
2038 *(__first
2039 + (__last
2042 *(__last
2046 }
2047 }
2049 /**
2050 * @if maint
2051 * This is a helper function for the sort routine.
2052 * @endif
2053 */
2055 void
2057 _RandomAccessIterator __last,
2059 {
2061 _ValueType;
2064 {
2066 {
2069 }
2071 _RandomAccessIterator __cut =
2074 *(__first
2075 + (__last
2079 __comp)),
2080 __comp);
2083 }
2084 }
2086 /**
2087 * @if maint
2088 * This is a helper function for the sort routines.
2089 * @endif
2090 */
2092 inline _Size
2094 {
2095 _Size __k;
2099 }
2101 // sort
2104 void
2107 {
2109 _ValueType;
2112 {
2114 {
2116 // Place the nth largest element in its final position.
2119 }
2121 _RandomAccessIterator __cut =
2124 *(__first
2125 + (__last
2128 *(__last
2132 else
2134 }
2136 }
2139 void
2142 _Compare __comp)
2143 {
2145 _ValueType;
2148 {
2150 {
2152 // Place the nth largest element in its final position.
2155 }
2157 _RandomAccessIterator __cut =
2160 *(__first
2161 + (__last
2165 __comp)),
2166 __comp);
2169 else
2171 }
2173 }
2175 // nth_element
2177 /**
2178 * @brief Finds the first position in which @a val could be inserted
2179 * without changing the ordering.
2180 * @param first An iterator.
2181 * @param last Another iterator.
2182 * @param val The search term.
2183 * @return An iterator pointing to the first element "not less
2184 * than" @a val, or end() if every element is less than
2185 * @a val.
2186 * @ingroup binarysearch
2187 */
2189 _ForwardIterator
2192 {
2194 _ValueType;
2196 _DistanceType;
2198 // concept requirements
2204 _DistanceType __half;
2205 _ForwardIterator __middle;
2208 {
2213 {
2217 }
2218 else
2220 }
2222 }
2224 /**
2225 * @brief Finds the first position in which @a val could be inserted
2226 * without changing the ordering.
2227 * @param first An iterator.
2228 * @param last Another iterator.
2229 * @param val The search term.
2230 * @param comp A functor to use for comparisons.
2231 * @return An iterator pointing to the first element "not less than" @a val,
2232 * or end() if every element is less than @a val.
2233 * @ingroup binarysearch
2234 *
2235 * The comparison function should have the same effects on ordering as
2236 * the function used for the initial sort.
2237 */
2239 _ForwardIterator
2242 {
2244 _ValueType;
2246 _DistanceType;
2248 // concept requirements
2256 _DistanceType __half;
2257 _ForwardIterator __middle;
2260 {
2265 {
2269 }
2270 else
2272 }
2274 }
2276 /**
2277 * @brief Finds the last position in which @a val could be inserted
2278 * without changing the ordering.
2279 * @param first An iterator.
2280 * @param last Another iterator.
2281 * @param val The search term.
2282 * @return An iterator pointing to the first element greater than @a val,
2283 * or end() if no elements are greater than @a val.
2284 * @ingroup binarysearch
2285 */
2287 _ForwardIterator
2290 {
2292 _ValueType;
2294 _DistanceType;
2296 // concept requirements
2302 _DistanceType __half;
2303 _ForwardIterator __middle;
2306 {
2312 else
2313 {
2317 }
2318 }
2320 }
2322 /**
2323 * @brief Finds the last position in which @a val could be inserted
2324 * without changing the ordering.
2325 * @param first An iterator.
2326 * @param last Another iterator.
2327 * @param val The search term.
2328 * @param comp A functor to use for comparisons.
2329 * @return An iterator pointing to the first element greater than @a val,
2330 * or end() if no elements are greater than @a val.
2331 * @ingroup binarysearch
2332 *
2333 * The comparison function should have the same effects on ordering as
2334 * the function used for the initial sort.
2335 */
2337 _ForwardIterator
2340 {
2342 _ValueType;
2344 _DistanceType;
2346 // concept requirements
2354 _DistanceType __half;
2355 _ForwardIterator __middle;
2358 {
2364 else
2365 {
2369 }
2370 }
2372 }
2374 /**
2375 * @brief Finds the largest subrange in which @a val could be inserted
2376 * at any place in it without changing the ordering.
2377 * @param first An iterator.
2378 * @param last Another iterator.
2379 * @param val The search term.
2380 * @return An pair of iterators defining the subrange.
2381 * @ingroup binarysearch
2382 *
2383 * This is equivalent to
2384 * @code
2385 * std::make_pair(lower_bound(first, last, val),
2386 * upper_bound(first, last, val))
2387 * @endcode
2388 * but does not actually call those functions.
2389 */
2394 {
2396 _ValueType;
2398 _DistanceType;
2400 // concept requirements
2408 _DistanceType __half;
2412 {
2417 {
2421 }
2424 else
2425 {
2430 }
2431 }
2433 }
2435 /**
2436 * @brief Finds the largest subrange in which @a val could be inserted
2437 * at any place in it without changing the ordering.
2438 * @param first An iterator.
2439 * @param last Another iterator.
2440 * @param val The search term.
2441 * @param comp A functor to use for comparisons.
2442 * @return An pair of iterators defining the subrange.
2443 * @ingroup binarysearch
2444 *
2445 * This is equivalent to
2446 * @code
2447 * std::make_pair(lower_bound(first, last, val, comp),
2448 * upper_bound(first, last, val, comp))
2449 * @endcode
2450 * but does not actually call those functions.
2451 */
2456 _Compare __comp)
2457 {
2459 _ValueType;
2461 _DistanceType;
2463 // concept requirements
2475 _DistanceType __half;
2479 {
2484 {
2488 }
2491 else
2492 {
2497 }
2498 }
2500 }
2502 /**
2503 * @brief Determines whether an element exists in a range.
2504 * @param first An iterator.
2505 * @param last Another iterator.
2506 * @param val The search term.
2507 * @return True if @a val (or its equivelent) is in [@a first,@a last ].
2508 * @ingroup binarysearch
2509 *
2510 * Note that this does not actually return an iterator to @a val. For
2511 * that, use std::find or a container's specialized find member functions.
2512 */
2514 bool
2517 {
2519 _ValueType;
2521 // concept requirements
2529 }
2531 /**
2532 * @brief Determines whether an element exists in a range.
2533 * @param first An iterator.
2534 * @param last Another iterator.
2535 * @param val The search term.
2536 * @param comp A functor to use for comparisons.
2537 * @return True if @a val (or its equivelent) is in [@a first,@a last ].
2538 * @ingroup binarysearch
2539 *
2540 * Note that this does not actually return an iterator to @a val. For
2541 * that, use std::find or a container's specialized find member functions.
2542 *
2543 * The comparison function should have the same effects on ordering as
2544 * the function used for the initial sort.
2545 */
2547 bool
2550 {
2552 _ValueType;
2554 // concept requirements
2565 }
2567 // merge
2569 /**
2570 * @if maint
2571 * This is a helper function for the merge routines.
2572 * @endif
2573 */
2575 typename _BidirectionalIterator3>
2576 _BidirectionalIterator3
2578 _BidirectionalIterator1 __last1,
2579 _BidirectionalIterator2 __first2,
2580 _BidirectionalIterator2 __last2,
2581 _BidirectionalIterator3 __result)
2582 {
2590 {
2592 {
2597 }
2598 else
2599 {
2604 }
2605 }
2606 }
2608 /**
2609 * @if maint
2610 * This is a helper function for the merge routines.
2611 * @endif
2612 */
2615 _BidirectionalIterator3
2617 _BidirectionalIterator1 __last1,
2618 _BidirectionalIterator2 __first2,
2619 _BidirectionalIterator2 __last2,
2620 _BidirectionalIterator3 __result,
2621 _Compare __comp)
2622 {
2630 {
2632 {
2637 }
2638 else
2639 {
2644 }
2645 }
2646 }
2648 /**
2649 * @if maint
2650 * This is a helper function for the merge routines.
2651 * @endif
2652 */
2654 typename _Distance>
2655 _BidirectionalIterator1
2657 _BidirectionalIterator1 __middle,
2658 _BidirectionalIterator1 __last,
2660 _BidirectionalIterator2 __buffer,
2661 _Distance __buffer_size)
2662 {
2663 _BidirectionalIterator2 __buffer_end;
2665 {
2669 }
2671 {
2675 }
2676 else
2677 {
2681 }
2682 }
2684 /**
2685 * @if maint
2686 * This is a helper function for the merge routines.
2687 * @endif
2688 */
2690 typename _Pointer>
2691 void
2693 _BidirectionalIterator __middle,
2694 _BidirectionalIterator __last,
2697 {
2699 {
2702 __first);
2703 }
2705 {
2709 }
2710 else
2711 {
2717 {
2723 }
2724 else
2725 {
2731 }
2732 _BidirectionalIterator __new_middle =
2735 __buffer_size);
2741 }
2742 }
2744 /**
2745 * @if maint
2746 * This is a helper function for the merge routines.
2747 * @endif
2748 */
2751 void
2753 _BidirectionalIterator __middle,
2754 _BidirectionalIterator __last,
2757 _Compare __comp)
2758 {
2760 {
2764 }
2766 {
2770 }
2771 else
2772 {
2778 {
2782 __comp);
2784 }
2785 else
2786 {
2790 __comp);
2792 }
2793 _BidirectionalIterator __new_middle =
2796 __buffer_size);
2803 }
2804 }
2806 /**
2807 * @if maint
2808 * This is a helper function for the merge routines.
2809 * @endif
2810 */
2812 void
2814 _BidirectionalIterator __middle,
2815 _BidirectionalIterator __last,
2817 {
2821 {
2825 }
2831 {
2836 }
2837 else
2838 {
2843 }
2851 }
2853 /**
2854 * @if maint
2855 * This is a helper function for the merge routines.
2856 * @endif
2857 */
2859 typename _Compare>
2860 void
2862 _BidirectionalIterator __middle,
2863 _BidirectionalIterator __last,
2865 _Compare __comp)
2866 {
2870 {
2874 }
2880 {
2884 __comp);
2886 }
2887 else
2888 {
2892 __comp);
2894 }
2902 }
2904 /**
2905 * @brief Merges two sorted ranges in place.
2906 * @param first An iterator.
2907 * @param middle Another iterator.
2908 * @param last Another iterator.
2909 * @return Nothing.
2910 *
2911 * Merges two sorted and consecutive ranges, [first,middle) and
2912 * [middle,last), and puts the result in [first,last). The output will
2913 * be sorted. The sort is @e stable, that is, for equivalent
2914 * elements in the two ranges, elements from the first range will always
2915 * come before elements from the second.
2916 *
2917 * If enough additional memory is available, this takes (last-first)-1
2918 * comparisons. Otherwise an NlogN algorithm is used, where N is
2919 * distance(first,last).
2920 */
2922 void
2924 _BidirectionalIterator __middle,
2925 _BidirectionalIterator __last)
2926 {
2928 _ValueType;
2930 _DistanceType;
2932 // concept requirements
2934 _BidirectionalIterator>)
2946 __last);
2949 else
2952 }
2954 /**
2955 * @brief Merges two sorted ranges in place.
2956 * @param first An iterator.
2957 * @param middle Another iterator.
2958 * @param last Another iterator.
2959 * @param comp A functor to use for comparisons.
2960 * @return Nothing.
2961 *
2962 * Merges two sorted and consecutive ranges, [first,middle) and
2963 * [middle,last), and puts the result in [first,last). The output will
2964 * be sorted. The sort is @e stable, that is, for equivalent
2965 * elements in the two ranges, elements from the first range will always
2966 * come before elements from the second.
2967 *
2968 * If enough additional memory is available, this takes (last-first)-1
2969 * comparisons. Otherwise an NlogN algorithm is used, where N is
2970 * distance(first,last).
2971 *
2972 * The comparison function should have the same effects on ordering as
2973 * the function used for the initial sort.
2974 */
2976 void
2978 _BidirectionalIterator __middle,
2979 _BidirectionalIterator __last,
2980 _Compare __comp)
2981 {
2983 _ValueType;
2985 _DistanceType;
2987 // concept requirements
2989 _BidirectionalIterator>)
3002 __last);
3006 else
3009 __comp);
3010 }
3013 typename _Distance>
3014 void
3016 _RandomAccessIterator1 __last,
3017 _RandomAccessIterator2 __result,
3018 _Distance __step_size)
3019 {
3023 {
3026 __result);
3028 }
3033 __result);
3034 }
3038 void
3040 _RandomAccessIterator1 __last,
3042 _Compare __comp)
3043 {
3047 {
3050 __result,
3051 __comp);
3053 }
3058 }
3061 void
3063 _RandomAccessIterator __last,
3064 _Distance __chunk_size)
3065 {
3067 {
3070 }
3072 }
3075 typename _Compare>
3076 void
3078 _RandomAccessIterator __last,
3080 {
3082 {
3085 }
3087 }
3092 void
3094 _RandomAccessIterator __last,
3095 _Pointer __buffer)
3096 {
3098 _Distance;
3107 {
3112 }
3113 }
3116 void
3118 _RandomAccessIterator __last,
3120 {
3122 _Distance;
3131 {
3138 }
3139 }
3142 typename _Distance>
3143 void
3145 _RandomAccessIterator __last,
3147 {
3151 {
3156 }
3157 else
3158 {
3161 }
3166 }
3170 void
3172 _RandomAccessIterator __last,
3174 _Compare __comp)
3175 {
3179 {
3184 }
3185 else
3186 {
3189 }
3194 __comp);
3195 }
3197 /**
3198 * @if maint
3199 * This is a helper function for the stable sorting routines.
3200 * @endif
3201 */
3203 void
3205 _RandomAccessIterator __last)
3206 {
3208 {
3211 }
3218 }
3220 /**
3221 * @if maint
3222 * This is a helper function for the stable sorting routines.
3223 * @endif
3224 */
3226 void
3229 {
3231 {
3234 }
3241 __comp);
3242 }
3244 // stable_sort
3246 // Set algorithms: includes, set_union, set_intersection, set_difference,
3247 // set_symmetric_difference. All of these algorithms have the precondition
3248 // that their input ranges are sorted and the postcondition that their output
3249 // ranges are sorted.
3251 /**
3252 * @brief Determines whether all elements of a sequence exists in a range.
3253 * @param first1 Start of search range.
3254 * @param last1 End of search range.
3255 * @param first2 Start of sequence
3256 * @param last2 End of sequence.
3257 * @return True if each element in [first2,last2) is contained in order
3258 * within [first1,last1). False otherwise.
3259 * @ingroup setoperations
3260 *
3261 * This operation expects both [first1,last1) and [first2,last2) to be
3262 * sorted. Searches for the presence of each element in [first2,last2)
3263 * within [first1,last1). The iterators over each range only move forward,
3264 * so this is a linear algorithm. If an element in [first2,last2) is not
3265 * found before the search iterator reaches @a last2, false is returned.
3266 */
3268 bool
3271 {
3273 _ValueType1;
3275 _ValueType2;
3277 // concept requirements
3290 else
3294 }
3296 /**
3297 * @brief Determines whether all elements of a sequence exists in a range
3298 * using comparison.
3299 * @param first1 Start of search range.
3300 * @param last1 End of search range.
3301 * @param first2 Start of sequence
3302 * @param last2 End of sequence.
3303 * @param comp Comparison function to use.
3304 * @return True if each element in [first2,last2) is contained in order
3305 * within [first1,last1) according to comp. False otherwise.
3306 * @ingroup setoperations
3307 *
3308 * This operation expects both [first1,last1) and [first2,last2) to be
3309 * sorted. Searches for the presence of each element in [first2,last2)
3310 * within [first1,last1), using comp to decide. The iterators over each
3311 * range only move forward, so this is a linear algorithm. If an element
3312 * in [first2,last2) is not found before the search iterator reaches @a
3313 * last2, false is returned.
3314 */
3316 typename _Compare>
3317 bool
3320 {
3322 _ValueType1;
3324 _ValueType2;
3326 // concept requirements
3341 else
3345 }
3347 // nth_element
3348 // merge
3349 // set_difference
3350 // set_intersection
3351 // set_union
3352 // stable_sort
3353 // set_symmetric_difference
3354 // min_element
3355 // max_element
3357 /**
3358 * @brief Permute range into the next "dictionary" ordering.
3359 * @param first Start of range.
3360 * @param last End of range.
3361 * @return False if wrapped to first permutation, true otherwise.
3362 *
3363 * Treats all permutations of the range as a set of "dictionary" sorted
3364 * sequences. Permutes the current sequence into the next one of this set.
3365 * Returns true if there are more sequences to generate. If the sequence
3366 * is the largest of the set, the smallest is generated and false returned.
3367 */
3369 bool
3371 _BidirectionalIterator __last)
3372 {
3373 // concept requirements
3375 _BidirectionalIterator>)
3390 {
3394 {
3397 {}
3401 }
3403 {
3406 }
3407 }
3408 }
3410 /**
3411 * @brief Permute range into the next "dictionary" ordering using
3412 * comparison functor.
3413 * @param first Start of range.
3414 * @param last End of range.
3415 * @param comp A comparison functor.
3416 * @return False if wrapped to first permutation, true otherwise.
3417 *
3418 * Treats all permutations of the range [first,last) as a set of
3419 * "dictionary" sorted sequences ordered by @a comp. Permutes the current
3420 * sequence into the next one of this set. Returns true if there are more
3421 * sequences to generate. If the sequence is the largest of the set, the
3422 * smallest is generated and false returned.
3423 */
3425 bool
3428 {
3429 // concept requirements
3431 _BidirectionalIterator>)
3447 {
3451 {
3454 {}
3458 }
3460 {
3463 }
3464 }
3465 }
3467 /**
3468 * @brief Permute range into the previous "dictionary" ordering.
3469 * @param first Start of range.
3470 * @param last End of range.
3471 * @return False if wrapped to last permutation, true otherwise.
3472 *
3473 * Treats all permutations of the range as a set of "dictionary" sorted
3474 * sequences. Permutes the current sequence into the previous one of this
3475 * set. Returns true if there are more sequences to generate. If the
3476 * sequence is the smallest of the set, the largest is generated and false
3477 * returned.
3478 */
3480 bool
3482 _BidirectionalIterator __last)
3483 {
3484 // concept requirements
3486 _BidirectionalIterator>)
3501 {
3505 {
3508 {}
3512 }
3514 {
3517 }
3518 }
3519 }
3521 /**
3522 * @brief Permute range into the previous "dictionary" ordering using
3523 * comparison functor.
3524 * @param first Start of range.
3525 * @param last End of range.
3526 * @param comp A comparison functor.
3527 * @return False if wrapped to last permutation, true otherwise.
3528 *
3529 * Treats all permutations of the range [first,last) as a set of
3530 * "dictionary" sorted sequences ordered by @a comp. Permutes the current
3531 * sequence into the previous one of this set. Returns true if there are
3532 * more sequences to generate. If the sequence is the smallest of the set,
3533 * the largest is generated and false returned.
3534 */
3536 bool
3539 {
3540 // concept requirements
3542 _BidirectionalIterator>)
3558 {
3562 {
3565 {}
3569 }
3571 {
3574 }
3575 }
3576 }
3578 // replace
3579 // replace_if
3581 /**
3582 * @brief Copy a sequence, replacing each element of one value with another
3583 * value.
3584 * @param first An input iterator.
3585 * @param last An input iterator.
3586 * @param result An output iterator.
3587 * @param old_value The value to be replaced.
3588 * @param new_value The replacement value.
3589 * @return The end of the output sequence, @p result+(last-first).
3590 *
3591 * Copies each element in the input range @p [first,last) to the
3592 * output range @p [result,result+(last-first)) replacing elements
3593 * equal to @p old_value with @p new_value.
3594 */
3596 _OutputIterator
3598 _OutputIterator __result,
3600 {
3601 // concept requirements
3612 else
3615 }
3617 /**
3618 * @brief Copy a sequence, replacing each value for which a predicate
3619 * returns true with another value.
3620 * @param first An input iterator.
3621 * @param last An input iterator.
3622 * @param result An output iterator.
3623 * @param pred A predicate.
3624 * @param new_value The replacement value.
3625 * @return The end of the output sequence, @p result+(last-first).
3626 *
3627 * Copies each element in the range @p [first,last) to the range
3628 * @p [result,result+(last-first)) replacing elements for which
3629 * @p pred returns true with @p new_value.
3630 */
3633 _OutputIterator
3635 _OutputIterator __result,
3637 {
3638 // concept requirements
3649 else
3652 }
3654 #ifdef __GXX_EXPERIMENTAL_CXX0X__
3655 /**
3656 * @brief Determines whether the elements of a sequence are sorted.
3657 * @param first An iterator.
3658 * @param last Another iterator.
3659 * @return True if the elements are sorted, false otherwise.
3660 */
3666 /**
3667 * @brief Determines whether the elements of a sequence are sorted
3668 * according to a comparison functor.
3669 * @param first An iterator.
3670 * @param last Another iterator.
3671 * @param comp A comparison functor.
3672 * @return True if the elements are sorted, false otherwise.
3673 */
3677 _Compare __comp)
3680 /**
3681 * @brief Determines the end of a sorted sequence.
3682 * @param first An iterator.
3683 * @param last Another iterator.
3684 * @return An iterator pointing to the last iterator i in [first, last)
3685 * for which the range [first, i) is sorted.
3686 */
3688 _ForwardIterator
3690 {
3691 // concept requirements
3705 }
3707 /**
3708 * @brief Determines the end of a sorted sequence using comparison functor.
3709 * @param first An iterator.
3710 * @param last Another iterator.
3711 * @param comp A comparison functor.
3712 * @return An iterator pointing to the last iterator i in [first, last)
3713 * for which the range [first, i) is sorted.
3714 */
3716 _ForwardIterator
3718 _Compare __comp)
3719 {
3720 // concept requirements
3735 }
3738 _GLIBCXX_END_NAMESPACE
3742 /**
3743 * @brief Apply a function to every element of a sequence.
3744 * @param first An input iterator.
3745 * @param last An input iterator.
3746 * @param f A unary function object.
3747 * @return @p f.
3748 *
3749 * Applies the function object @p f to each element in the range
3750 * @p [first,last). @p f must not modify the order of the sequence.
3751 * If @p f has a return value it is ignored.
3752 */
3754 _Function
3756 {
3757 // concept requirements
3763 }
3765 /**
3766 * @brief Find the first occurrence of a value in a sequence.
3767 * @param first An input iterator.
3768 * @param last An input iterator.
3769 * @param val The value to find.
3770 * @return The first iterator @c i in the range @p [first,last)
3771 * such that @c *i == @p val, or @p last if no such iterator exists.
3772 */
3774 inline _InputIterator
3777 {
3778 // concept requirements
3785 }
3787 /**
3788 * @brief Find the first element in a sequence for which a
3789 * predicate is true.
3790 * @param first An input iterator.
3791 * @param last An input iterator.
3792 * @param pred A predicate.
3793 * @return The first iterator @c i in the range @p [first,last)
3794 * such that @p pred(*i) is true, or @p last if no such iterator exists.
3795 */
3797 inline _InputIterator
3799 _Predicate __pred)
3800 {
3801 // concept requirements
3808 }
3810 /**
3811 * @brief Find element from a set in a sequence.
3812 * @param first1 Start of range to search.
3813 * @param last1 End of range to search.
3814 * @param first2 Start of match candidates.
3815 * @param last2 End of match candidates.
3816 * @return The first iterator @c i in the range
3817 * @p [first1,last1) such that @c *i == @p *(i2) such that i2 is an
3818 * interator in [first2,last2), or @p last1 if no such iterator exists.
3819 *
3820 * Searches the range @p [first1,last1) for an element that is equal to
3821 * some element in the range [first2,last2). If found, returns an iterator
3822 * in the range [first1,last1), otherwise returns @p last1.
3823 */
3825 _InputIterator
3828 {
3829 // concept requirements
3843 }
3845 /**
3846 * @brief Find element from a set in a sequence using a predicate.
3847 * @param first1 Start of range to search.
3848 * @param last1 End of range to search.
3849 * @param first2 Start of match candidates.
3850 * @param last2 End of match candidates.
3851 * @param comp Predicate to use.
3852 * @return The first iterator @c i in the range
3853 * @p [first1,last1) such that @c comp(*i, @p *(i2)) is true and i2 is an
3854 * interator in [first2,last2), or @p last1 if no such iterator exists.
3855 *
3857 * Searches the range @p [first1,last1) for an element that is
3858 * equal to some element in the range [first2,last2). If found,
3859 * returns an iterator in the range [first1,last1), otherwise
3860 * returns @p last1.
3861 */
3863 typename _BinaryPredicate>
3864 _InputIterator
3867 _BinaryPredicate __comp)
3868 {
3869 // concept requirements
3883 }
3885 /**
3886 * @brief Find two adjacent values in a sequence that are equal.
3887 * @param first A forward iterator.
3888 * @param last A forward iterator.
3889 * @return The first iterator @c i such that @c i and @c i+1 are both
3890 * valid iterators in @p [first,last) and such that @c *i == @c *(i+1),
3891 * or @p last if no such iterator exists.
3892 */
3894 _ForwardIterator
3896 {
3897 // concept requirements
3906 {
3910 }
3912 }
3914 /**
3915 * @brief Find two adjacent values in a sequence using a predicate.
3916 * @param first A forward iterator.
3917 * @param last A forward iterator.
3918 * @param binary_pred A binary predicate.
3919 * @return The first iterator @c i such that @c i and @c i+1 are both
3920 * valid iterators in @p [first,last) and such that
3921 * @p binary_pred(*i,*(i+1)) is true, or @p last if no such iterator
3922 * exists.
3923 */
3925 _ForwardIterator
3927 _BinaryPredicate __binary_pred)
3928 {
3929 // concept requirements
3939 {
3943 }
3945 }
3947 /**
3948 * @brief Count the number of copies of a value in a sequence.
3949 * @param first An input iterator.
3950 * @param last An input iterator.
3951 * @param value The value to be counted.
3952 * @return The number of iterators @c i in the range @p [first,last)
3953 * for which @c *i == @p value
3954 */
3958 {
3959 // concept requirements
3969 }
3971 /**
3972 * @brief Count the elements of a sequence for which a predicate is true.
3973 * @param first An input iterator.
3974 * @param last An input iterator.
3975 * @param pred A predicate.
3976 * @return The number of iterators @c i in the range @p [first,last)
3977 * for which @p pred(*i) is true.
3978 */
3982 {
3983 // concept requirements
3993 }
3995 /**
3996 * @brief Search a sequence for a matching sub-sequence.
3997 * @param first1 A forward iterator.
3998 * @param last1 A forward iterator.
3999 * @param first2 A forward iterator.
4000 * @param last2 A forward iterator.
4001 * @return The first iterator @c i in the range
4002 * @p [first1,last1-(last2-first2)) such that @c *(i+N) == @p *(first2+N)
4003 * for each @c N in the range @p [0,last2-first2), or @p last1 if no
4004 * such iterator exists.
4005 *
4006 * Searches the range @p [first1,last1) for a sub-sequence that compares
4007 * equal value-by-value with the sequence given by @p [first2,last2) and
4008 * returns an iterator to the first element of the sub-sequence, or
4009 * @p last1 if the sub-sequence is not found.
4010 *
4011 * Because the sub-sequence must lie completely within the range
4012 * @p [first1,last1) it must start at a position less than
4013 * @p last1-(last2-first2) where @p last2-first2 is the length of the
4014 * sub-sequence.
4015 * This means that the returned iterator @c i will be in the range
4016 * @p [first1,last1-(last2-first2))
4017 */
4019 _ForwardIterator1
4022 {
4023 // concept requirements
4032 // Test for empty ranges
4036 // Test for a pattern of length 1.
4041 // General case.
4042 _ForwardIterator2 __p;
4046 {
4057 {
4062 }
4064 }
4066 }
4068 /**
4069 * @brief Search a sequence for a matching sub-sequence using a predicate.
4070 * @param first1 A forward iterator.
4071 * @param last1 A forward iterator.
4072 * @param first2 A forward iterator.
4073 * @param last2 A forward iterator.
4074 * @param predicate A binary predicate.
4075 * @return The first iterator @c i in the range
4076 * @p [first1,last1-(last2-first2)) such that
4077 * @p predicate(*(i+N),*(first2+N)) is true for each @c N in the range
4078 * @p [0,last2-first2), or @p last1 if no such iterator exists.
4079 *
4080 * Searches the range @p [first1,last1) for a sub-sequence that compares
4081 * equal value-by-value with the sequence given by @p [first2,last2),
4082 * using @p predicate to determine equality, and returns an iterator
4083 * to the first element of the sub-sequence, or @p last1 if no such
4084 * iterator exists.
4085 *
4086 * @see search(_ForwardIter1, _ForwardIter1, _ForwardIter2, _ForwardIter2)
4087 */
4089 typename _BinaryPredicate>
4090 _ForwardIterator1
4093 _BinaryPredicate __predicate)
4094 {
4095 // concept requirements
4104 // Test for empty ranges
4108 // Test for a pattern of length 1.
4111 {
4116 }
4118 // General case.
4119 _ForwardIterator2 __p;
4123 {
4136 {
4141 }
4143 }
4145 }
4148 /**
4149 * @brief Search a sequence for a number of consecutive values.
4150 * @param first A forward iterator.
4151 * @param last A forward iterator.
4152 * @param count The number of consecutive values.
4153 * @param val The value to find.
4154 * @return The first iterator @c i in the range @p [first,last-count)
4155 * such that @c *(i+N) == @p val for each @c N in the range @p [0,count),
4156 * or @p last if no such iterator exists.
4157 *
4158 * Searches the range @p [first,last) for @p count consecutive elements
4159 * equal to @p val.
4160 */
4162 _ForwardIterator
4165 {
4166 // concept requirements
4178 }
4181 /**
4182 * @brief Search a sequence for a number of consecutive values using a
4183 * predicate.
4184 * @param first A forward iterator.
4185 * @param last A forward iterator.
4186 * @param count The number of consecutive values.
4187 * @param val The value to find.
4188 * @param binary_pred A binary predicate.
4189 * @return The first iterator @c i in the range @p [first,last-count)
4190 * such that @p binary_pred(*(i+N),val) is true for each @c N in the
4191 * range @p [0,count), or @p last if no such iterator exists.
4192 *
4193 * Searches the range @p [first,last) for @p count consecutive elements
4194 * for which the predicate returns true.
4195 */
4197 typename _BinaryPredicate>
4198 _ForwardIterator
4201 _BinaryPredicate __binary_pred)
4202 {
4203 // concept requirements
4212 {
4216 }
4219 }
4222 /**
4223 * @brief Perform an operation on a sequence.
4224 * @param first An input iterator.
4225 * @param last An input iterator.
4226 * @param result An output iterator.
4227 * @param unary_op A unary operator.
4228 * @return An output iterator equal to @p result+(last-first).
4229 *
4230 * Applies the operator to each element in the input range and assigns
4231 * the results to successive elements of the output sequence.
4232 * Evaluates @p *(result+N)=unary_op(*(first+N)) for each @c N in the
4233 * range @p [0,last-first).
4234 *
4235 * @p unary_op must not alter its argument.
4236 */
4238 typename _UnaryOperation>
4239 _OutputIterator
4242 {
4243 // concept requirements
4246 // "the type returned by a _UnaryOperation"
4253 }
4255 /**
4256 * @brief Perform an operation on corresponding elements of two sequences.
4257 * @param first1 An input iterator.
4258 * @param last1 An input iterator.
4259 * @param first2 An input iterator.
4260 * @param result An output iterator.
4261 * @param binary_op A binary operator.
4262 * @return An output iterator equal to @p result+(last-first).
4263 *
4264 * Applies the operator to the corresponding elements in the two
4265 * input ranges and assigns the results to successive elements of the
4266 * output sequence.
4267 * Evaluates @p *(result+N)=binary_op(*(first1+N),*(first2+N)) for each
4268 * @c N in the range @p [0,last1-first1).
4269 *
4270 * @p binary_op must not alter either of its arguments.
4271 */
4274 _OutputIterator
4277 _BinaryOperation __binary_op)
4278 {
4279 // concept requirements
4283 // "the type returned by a _BinaryOperation"
4290 }
4292 /**
4293 * @brief Replace each occurrence of one value in a sequence with another
4294 * value.
4295 * @param first A forward iterator.
4296 * @param last A forward iterator.
4297 * @param old_value The value to be replaced.
4298 * @param new_value The replacement value.
4299 * @return replace() returns no value.
4300 *
4301 * For each iterator @c i in the range @p [first,last) if @c *i ==
4302 * @p old_value then the assignment @c *i = @p new_value is performed.
4303 */
4305 void
4308 {
4309 // concept requirements
4311 _ForwardIterator>)
4321 }
4323 /**
4324 * @brief Replace each value in a sequence for which a predicate returns
4325 * true with another value.
4326 * @param first A forward iterator.
4327 * @param last A forward iterator.
4328 * @param pred A predicate.
4329 * @param new_value The replacement value.
4330 * @return replace_if() returns no value.
4331 *
4332 * For each iterator @c i in the range @p [first,last) if @p pred(*i)
4333 * is true then the assignment @c *i = @p new_value is performed.
4334 */
4336 void
4339 {
4340 // concept requirements
4342 _ForwardIterator>)
4352 }
4354 /**
4355 * @brief Assign the result of a function object to each value in a
4356 * sequence.
4357 * @param first A forward iterator.
4358 * @param last A forward iterator.
4359 * @param gen A function object taking no arguments and returning
4360 * std::iterator_traits<_ForwardIterator>::value_type
4361 * @return generate() returns no value.
4362 *
4363 * Performs the assignment @c *i = @p gen() for each @c i in the range
4364 * @p [first,last).
4365 */
4367 void
4369 _Generator __gen)
4370 {
4371 // concept requirements
4379 }
4381 /**
4382 * @brief Assign the result of a function object to each value in a
4383 * sequence.
4384 * @param first A forward iterator.
4385 * @param n The length of the sequence.
4386 * @param gen A function object taking no arguments and returning
4387 * std::iterator_traits<_ForwardIterator>::value_type
4388 * @return The end of the sequence, @p first+n
4389 *
4390 * Performs the assignment @c *i = @p gen() for each @c i in the range
4391 * @p [first,first+n).
4392 */
4394 _OutputIterator
4396 {
4397 // concept requirements
4399 // "the type returned by a _Generator"
4405 }
4408 /**
4409 * @brief Copy a sequence, removing consecutive duplicate values.
4410 * @param first An input iterator.
4411 * @param last An input iterator.
4412 * @param result An output iterator.
4413 * @return An iterator designating the end of the resulting sequence.
4414 *
4415 * Copies each element in the range @p [first,last) to the range
4416 * beginning at @p result, except that only the first element is copied
4417 * from groups of consecutive elements that compare equal.
4418 * unique_copy() is stable, so the relative order of elements that are
4419 * copied is unchanged.
4420 *
4421 * @if maint
4422 * _GLIBCXX_RESOLVE_LIB_DEFECTS
4423 * DR 241. Does unique_copy() require CopyConstructible and Assignable?
4424 *
4425 * _GLIBCXX_RESOLVE_LIB_DEFECTS
4426 * DR 538. 241 again: Does unique_copy() require CopyConstructible and
4427 * Assignable?
4428 * @endif
4429 */
4431 inline _OutputIterator
4433 _OutputIterator __result)
4434 {
4435 // concept requirements
4448 }
4450 /**
4451 * @brief Copy a sequence, removing consecutive values using a predicate.
4452 * @param first An input iterator.
4453 * @param last An input iterator.
4454 * @param result An output iterator.
4455 * @param binary_pred A binary predicate.
4456 * @return An iterator designating the end of the resulting sequence.
4457 *
4458 * Copies each element in the range @p [first,last) to the range
4459 * beginning at @p result, except that only the first element is copied
4460 * from groups of consecutive elements for which @p binary_pred returns
4461 * true.
4462 * unique_copy() is stable, so the relative order of elements that are
4463 * copied is unchanged.
4464 *
4465 * @if maint
4466 * _GLIBCXX_RESOLVE_LIB_DEFECTS
4467 * DR 241. Does unique_copy() require CopyConstructible and Assignable?
4468 * @endif
4469 */
4471 typename _BinaryPredicate>
4472 inline _OutputIterator
4474 _OutputIterator __result,
4475 _BinaryPredicate __binary_pred)
4476 {
4477 // concept requirements -- predicates checked later
4488 }
4491 /**
4492 * @brief Randomly shuffle the elements of a sequence.
4493 * @param first A forward iterator.
4494 * @param last A forward iterator.
4495 * @return Nothing.
4496 *
4497 * Reorder the elements in the range @p [first,last) using a random
4498 * distribution, so that every possible ordering of the sequence is
4499 * equally likely.
4500 */
4504 {
4505 // concept requirements
4507 _RandomAccessIterator>)
4513 }
4515 /**
4516 * @brief Shuffle the elements of a sequence using a random number
4517 * generator.
4518 * @param first A forward iterator.
4519 * @param last A forward iterator.
4520 * @param rand The RNG functor or function.
4521 * @return Nothing.
4522 *
4523 * Reorders the elements in the range @p [first,last) using @p rand to
4524 * provide a random distribution. Calling @p rand(N) for a positive
4525 * integer @p N should return a randomly chosen integer from the
4526 * range [0,N).
4527 */
4529 void
4532 {
4533 // concept requirements
4535 _RandomAccessIterator>)
4542 }
4545 /**
4546 * @brief Move elements for which a predicate is true to the beginning
4547 * of a sequence.
4548 * @param first A forward iterator.
4549 * @param last A forward iterator.
4550 * @param pred A predicate functor.
4551 * @return An iterator @p middle such that @p pred(i) is true for each
4552 * iterator @p i in the range @p [first,middle) and false for each @p i
4553 * in the range @p [middle,last).
4554 *
4555 * @p pred must not modify its operand. @p partition() does not preserve
4556 * the relative ordering of elements in each group, use
4557 * @p stable_partition() if this is needed.
4558 */
4560 inline _ForwardIterator
4562 _Predicate __pred)
4563 {
4564 // concept requirements
4566 _ForwardIterator>)
4573 }
4577 /**
4578 * @brief Sort the smallest elements of a sequence.
4579 * @param first An iterator.
4580 * @param middle Another iterator.
4581 * @param last Another iterator.
4582 * @return Nothing.
4583 *
4584 * Sorts the smallest @p (middle-first) elements in the range
4585 * @p [first,last) and moves them to the range @p [first,middle). The
4586 * order of the remaining elements in the range @p [middle,last) is
4587 * undefined.
4588 * After the sort if @p i and @j are iterators in the range
4589 * @p [first,middle) such that @i precedes @j and @k is an iterator in
4590 * the range @p [middle,last) then @p *j<*i and @p *k<*i are both false.
4591 */
4595 _RandomAccessIterator __middle,
4596 _RandomAccessIterator __last)
4597 {
4599 _ValueType;
4601 // concept requirements
4603 _RandomAccessIterator>)
4610 }
4612 /**
4613 * @brief Sort the smallest elements of a sequence using a predicate
4614 * for comparison.
4615 * @param first An iterator.
4616 * @param middle Another iterator.
4617 * @param last Another iterator.
4618 * @param comp A comparison functor.
4619 * @return Nothing.
4620 *
4621 * Sorts the smallest @p (middle-first) elements in the range
4622 * @p [first,last) and moves them to the range @p [first,middle). The
4623 * order of the remaining elements in the range @p [middle,last) is
4624 * undefined.
4625 * After the sort if @p i and @j are iterators in the range
4626 * @p [first,middle) such that @i precedes @j and @k is an iterator in
4627 * the range @p [middle,last) then @p *comp(j,*i) and @p comp(*k,*i)
4628 * are both false.
4629 */
4633 _RandomAccessIterator __middle,
4634 _RandomAccessIterator __last,
4635 _Compare __comp)
4636 {
4638 _ValueType;
4640 // concept requirements
4642 _RandomAccessIterator>)
4650 }
4652 /**
4653 * @brief Sort a sequence just enough to find a particular position.
4654 * @param first An iterator.
4655 * @param nth Another iterator.
4656 * @param last Another iterator.
4657 * @return Nothing.
4658 *
4659 * Rearranges the elements in the range @p [first,last) so that @p *nth
4660 * is the same element that would have been in that position had the
4661 * whole sequence been sorted.
4662 * whole sequence been sorted. The elements either side of @p *nth are
4663 * not completely sorted, but for any iterator @i in the range
4664 * @p [first,nth) and any iterator @j in the range @p [nth,last) it
4665 * holds that @p *j<*i is false.
4666 */
4670 _RandomAccessIterator __last)
4671 {
4673 _ValueType;
4675 // concept requirements
4677 _RandomAccessIterator>)
4687 }
4689 /**
4690 * @brief Sort a sequence just enough to find a particular position
4691 * using a predicate for comparison.
4692 * @param first An iterator.
4693 * @param nth Another iterator.
4694 * @param last Another iterator.
4695 * @param comp A comparison functor.
4696 * @return Nothing.
4697 *
4698 * Rearranges the elements in the range @p [first,last) so that @p *nth
4699 * is the same element that would have been in that position had the
4700 * whole sequence been sorted. The elements either side of @p *nth are
4701 * not completely sorted, but for any iterator @i in the range
4702 * @p [first,nth) and any iterator @j in the range @p [nth,last) it
4703 * holds that @p comp(*j,*i) is false.
4704 */
4709 {
4711 _ValueType;
4713 // concept requirements
4715 _RandomAccessIterator>)
4726 }
4729 /**
4730 * @brief Sort the elements of a sequence.
4731 * @param first An iterator.
4732 * @param last Another iterator.
4733 * @return Nothing.
4734 *
4735 * Sorts the elements in the range @p [first,last) in ascending order,
4736 * such that @p *(i+1)<*i is false for each iterator @p i in the range
4737 * @p [first,last-1).
4738 *
4739 * The relative ordering of equivalent elements is not preserved, use
4740 * @p stable_sort() if this is needed.
4741 */
4745 {
4747 _ValueType;
4749 // concept requirements
4751 _RandomAccessIterator>)
4756 {
4760 }
4761 }
4763 /**
4764 * @brief Sort the elements of a sequence using a predicate for comparison.
4765 * @param first An iterator.
4766 * @param last Another iterator.
4767 * @param comp A comparison functor.
4768 * @return Nothing.
4769 *
4770 * Sorts the elements in the range @p [first,last) in ascending order,
4771 * such that @p comp(*(i+1),*i) is false for every iterator @p i in the
4772 * range @p [first,last-1).
4773 *
4774 * The relative ordering of equivalent elements is not preserved, use
4775 * @p stable_sort() if this is needed.
4776 */
4780 _Compare __comp)
4781 {
4783 _ValueType;
4785 // concept requirements
4787 _RandomAccessIterator>)
4789 _ValueType>)
4793 {
4797 }
4798 }
4800 /**
4801 * @brief Merges two sorted ranges.
4802 * @param first1 An iterator.
4803 * @param first2 Another iterator.
4804 * @param last1 Another iterator.
4805 * @param last2 Another iterator.
4806 * @param result An iterator pointing to the end of the merged range.
4807 * @return An iterator pointing to the first element "not less
4808 * than" @a val.
4809 *
4810 * Merges the ranges [first1,last1) and [first2,last2) into the sorted range
4811 * [result, result + (last1-first1) + (last2-first2)). Both input ranges
4812 * must be sorted, and the output range must not overlap with either of
4813 * the input ranges. The sort is @e stable, that is, for equivalent
4814 * elements in the two ranges, elements from the first range will always
4815 * come before elements from the second.
4816 */
4818 typename _OutputIterator>
4819 _OutputIterator
4822 _OutputIterator __result)
4823 {
4825 _ValueType1;
4827 _ValueType2;
4829 // concept requirements
4833 _ValueType1>)
4835 _ValueType2>)
4841 {
4843 {
4846 }
4847 else
4848 {
4851 }
4853 }
4855 __result));
4856 }
4858 /**
4859 * @brief Merges two sorted ranges.
4860 * @param first1 An iterator.
4861 * @param first2 Another iterator.
4862 * @param last1 Another iterator.
4863 * @param last2 Another iterator.
4864 * @param result An iterator pointing to the end of the merged range.
4865 * @param comp A functor to use for comparisons.
4866 * @return An iterator pointing to the first element "not less
4867 * than" @a val.
4868 *
4869 * Merges the ranges [first1,last1) and [first2,last2) into the sorted range
4870 * [result, result + (last1-first1) + (last2-first2)). Both input ranges
4871 * must be sorted, and the output range must not overlap with either of
4872 * the input ranges. The sort is @e stable, that is, for equivalent
4873 * elements in the two ranges, elements from the first range will always
4874 * come before elements from the second.
4875 *
4876 * The comparison function should have the same effects on ordering as
4877 * the function used for the initial sort.
4878 */
4881 _OutputIterator
4885 {
4887 _ValueType1;
4889 _ValueType2;
4891 // concept requirements
4895 _ValueType1>)
4897 _ValueType2>)
4904 {
4906 {
4909 }
4910 else
4911 {
4914 }
4916 }
4918 __result));
4919 }
4922 /**
4923 * @brief Sort the elements of a sequence, preserving the relative order
4924 * of equivalent elements.
4925 * @param first An iterator.
4926 * @param last Another iterator.
4927 * @return Nothing.
4928 *
4929 * Sorts the elements in the range @p [first,last) in ascending order,
4930 * such that @p *(i+1)<*i is false for each iterator @p i in the range
4931 * @p [first,last-1).
4932 *
4933 * The relative ordering of equivalent elements is preserved, so any two
4934 * elements @p x and @p y in the range @p [first,last) such that
4935 * @p x<y is false and @p y<x is false will have the same relative
4936 * ordering after calling @p stable_sort().
4937 */
4941 {
4943 _ValueType;
4945 _DistanceType;
4947 // concept requirements
4949 _RandomAccessIterator>)
4954 __last);
4957 else
4960 }
4962 /**
4963 * @brief Sort the elements of a sequence using a predicate for comparison,
4964 * preserving the relative order of equivalent elements.
4965 * @param first An iterator.
4966 * @param last Another iterator.
4967 * @param comp A comparison functor.
4968 * @return Nothing.
4969 *
4970 * Sorts the elements in the range @p [first,last) in ascending order,
4971 * such that @p comp(*(i+1),*i) is false for each iterator @p i in the
4972 * range @p [first,last-1).
4973 *
4974 * The relative ordering of equivalent elements is preserved, so any two
4975 * elements @p x and @p y in the range @p [first,last) such that
4976 * @p comp(x,y) is false and @p comp(y,x) is false will have the same
4977 * relative ordering after calling @p stable_sort().
4978 */
4982 _Compare __comp)
4983 {
4985 _ValueType;
4987 _DistanceType;
4989 // concept requirements
4991 _RandomAccessIterator>)
4993 _ValueType,
4994 _ValueType>)
4998 __last);
5001 else
5004 }
5007 /**
5008 * @brief Return the union of two sorted ranges.
5009 * @param first1 Start of first range.
5010 * @param last1 End of first range.
5011 * @param first2 Start of second range.
5012 * @param last2 End of second range.
5013 * @return End of the output range.
5014 * @ingroup setoperations
5015 *
5016 * This operation iterates over both ranges, copying elements present in
5017 * each range in order to the output range. Iterators increment for each
5018 * range. When the current element of one range is less than the other,
5019 * that element is copied and the iterator advanced. If an element is
5020 * contained in both ranges, the element from the first range is copied and
5021 * both ranges advance. The output range may not overlap either input
5022 * range.
5023 */
5025 typename _OutputIterator>
5026 _OutputIterator
5029 _OutputIterator __result)
5030 {
5032 _ValueType1;
5034 _ValueType2;
5036 // concept requirements
5040 _ValueType1>)
5042 _ValueType2>)
5049 {
5051 {
5054 }
5056 {
5059 }
5060 else
5061 {
5065 }
5067 }
5069 __result));
5070 }
5072 /**
5073 * @brief Return the union of two sorted ranges using a comparison functor.
5074 * @param first1 Start of first range.
5075 * @param last1 End of first range.
5076 * @param first2 Start of second range.
5077 * @param last2 End of second range.
5078 * @param comp The comparison functor.
5079 * @return End of the output range.
5080 * @ingroup setoperations
5081 *
5082 * This operation iterates over both ranges, copying elements present in
5083 * each range in order to the output range. Iterators increment for each
5084 * range. When the current element of one range is less than the other
5085 * according to @a comp, that element is copied and the iterator advanced.
5086 * If an equivalent element according to @a comp is contained in both
5087 * ranges, the element from the first range is copied and both ranges
5088 * advance. The output range may not overlap either input range.
5089 */
5092 _OutputIterator
5096 {
5098 _ValueType1;
5100 _ValueType2;
5102 // concept requirements
5106 _ValueType1>)
5108 _ValueType2>)
5117 {
5119 {
5122 }
5124 {
5127 }
5128 else
5129 {
5133 }
5135 }
5137 __result));
5138 }
5140 /**
5141 * @brief Return the intersection of two sorted ranges.
5142 * @param first1 Start of first range.
5143 * @param last1 End of first range.
5144 * @param first2 Start of second range.
5145 * @param last2 End of second range.
5146 * @return End of the output range.
5147 * @ingroup setoperations
5148 *
5149 * This operation iterates over both ranges, copying elements present in
5150 * both ranges in order to the output range. Iterators increment for each
5151 * range. When the current element of one range is less than the other,
5152 * that iterator advances. If an element is contained in both ranges, the
5153 * element from the first range is copied and both ranges advance. The
5154 * output range may not overlap either input range.
5155 */
5157 typename _OutputIterator>
5158 _OutputIterator
5161 _OutputIterator __result)
5162 {
5164 _ValueType1;
5166 _ValueType2;
5168 // concept requirements
5172 _ValueType1>)
5183 else
5184 {
5189 }
5191 }
5193 /**
5194 * @brief Return the intersection of two sorted ranges using comparison
5195 * functor.
5196 * @param first1 Start of first range.
5197 * @param last1 End of first range.
5198 * @param first2 Start of second range.
5199 * @param last2 End of second range.
5200 * @param comp The comparison functor.
5201 * @return End of the output range.
5202 * @ingroup setoperations
5203 *
5204 * This operation iterates over both ranges, copying elements present in
5205 * both ranges in order to the output range. Iterators increment for each
5206 * range. When the current element of one range is less than the other
5207 * according to @a comp, that iterator advances. If an element is
5208 * contained in both ranges according to @a comp, the element from the
5209 * first range is copied and both ranges advance. The output range may not
5210 * overlap either input range.
5211 */
5214 _OutputIterator
5218 {
5220 _ValueType1;
5222 _ValueType2;
5224 // concept requirements
5228 _ValueType1>)
5241 else
5242 {
5247 }
5249 }
5251 /**
5252 * @brief Return the difference of two sorted ranges.
5253 * @param first1 Start of first range.
5254 * @param last1 End of first range.
5255 * @param first2 Start of second range.
5256 * @param last2 End of second range.
5257 * @return End of the output range.
5258 * @ingroup setoperations
5259 *
5260 * This operation iterates over both ranges, copying elements present in
5261 * the first range but not the second in order to the output range.
5262 * Iterators increment for each range. When the current element of the
5263 * first range is less than the second, that element is copied and the
5264 * iterator advances. If the current element of the second range is less,
5265 * the iterator advances, but no element is copied. If an element is
5266 * contained in both ranges, no elements are copied and both ranges
5267 * advance. The output range may not overlap either input range.
5268 */
5270 typename _OutputIterator>
5271 _OutputIterator
5274 _OutputIterator __result)
5275 {
5277 _ValueType1;
5279 _ValueType2;
5281 // concept requirements
5285 _ValueType1>)
5293 {
5297 }
5300 else
5301 {
5304 }
5306 }
5308 /**
5309 * @brief Return the difference of two sorted ranges using comparison
5310 * functor.
5311 * @param first1 Start of first range.
5312 * @param last1 End of first range.
5313 * @param first2 Start of second range.
5314 * @param last2 End of second range.
5315 * @param comp The comparison functor.
5316 * @return End of the output range.
5317 * @ingroup setoperations
5318 *
5319 * This operation iterates over both ranges, copying elements present in
5320 * the first range but not the second in order to the output range.
5321 * Iterators increment for each range. When the current element of the
5322 * first range is less than the second according to @a comp, that element
5323 * is copied and the iterator advances. If the current element of the
5324 * second range is less, no element is copied and the iterator advances.
5325 * If an element is contained in both ranges according to @a comp, no
5326 * elements are copied and both ranges advance. The output range may not
5327 * overlap either input range.
5328 */
5331 _OutputIterator
5335 {
5337 _ValueType1;
5339 _ValueType2;
5341 // concept requirements
5345 _ValueType1>)
5355 {
5359 }
5362 else
5363 {
5366 }
5368 }
5370 /**
5371 * @brief Return the symmetric difference of two sorted ranges.
5372 * @param first1 Start of first range.
5373 * @param last1 End of first range.
5374 * @param first2 Start of second range.
5375 * @param last2 End of second range.
5376 * @return End of the output range.
5377 * @ingroup setoperations
5378 *
5379 * This operation iterates over both ranges, copying elements present in
5380 * one range but not the other in order to the output range. Iterators
5381 * increment for each range. When the current element of one range is less
5382 * than the other, that element is copied and the iterator advances. If an
5383 * element is contained in both ranges, no elements are copied and both
5384 * ranges advance. The output range may not overlap either input range.
5385 */
5387 typename _OutputIterator>
5388 _OutputIterator
5391 _OutputIterator __result)
5392 {
5394 _ValueType1;
5396 _ValueType2;
5398 // concept requirements
5402 _ValueType1>)
5404 _ValueType2>)
5412 {
5416 }
5418 {
5422 }
5423 else
5424 {
5427 }
5430 }
5432 /**
5433 * @brief Return the symmetric difference of two sorted ranges using
5434 * comparison functor.
5435 * @param first1 Start of first range.
5436 * @param last1 End of first range.
5437 * @param first2 Start of second range.
5438 * @param last2 End of second range.
5439 * @param comp The comparison functor.
5440 * @return End of the output range.
5441 * @ingroup setoperations
5442 *
5443 * This operation iterates over both ranges, copying elements present in
5444 * one range but not the other in order to the output range. Iterators
5445 * increment for each range. When the current element of one range is less
5446 * than the other according to @a comp, that element is copied and the
5447 * iterator advances. If an element is contained in both ranges according
5448 * to @a comp, no elements are copied and both ranges advance. The output
5449 * range may not overlap either input range.
5450 */
5453 _OutputIterator
5456 _OutputIterator __result,
5457 _Compare __comp)
5458 {
5460 _ValueType1;
5462 _ValueType2;
5464 // concept requirements
5468 _ValueType1>)
5470 _ValueType2>)
5480 {
5484 }
5486 {
5490 }
5491 else
5492 {
5495 }
5498 }
5501 /**
5502 * @brief Return the minimum element in a range.
5503 * @param first Start of range.
5504 * @param last End of range.
5505 * @return Iterator referencing the first instance of the smallest value.
5506 */
5508 _ForwardIterator
5510 {
5511 // concept requirements
5524 }
5526 /**
5527 * @brief Return the minimum element in a range using comparison functor.
5528 * @param first Start of range.
5529 * @param last End of range.
5530 * @param comp Comparison functor.
5531 * @return Iterator referencing the first instance of the smallest value
5532 * according to comp.
5533 */
5535 _ForwardIterator
5537 _Compare __comp)
5538 {
5539 // concept requirements
5553 }
5555 /**
5556 * @brief Return the maximum element in a range.
5557 * @param first Start of range.
5558 * @param last End of range.
5559 * @return Iterator referencing the first instance of the largest value.
5560 */
5562 _ForwardIterator
5564 {
5565 // concept requirements
5578 }
5580 /**
5581 * @brief Return the maximum element in a range using comparison functor.
5582 * @param first Start of range.
5583 * @param last End of range.
5584 * @param comp Comparison functor.
5585 * @return Iterator referencing the first instance of the largest value
5586 * according to comp.
5587 */
5589 _ForwardIterator
5591 _Compare __comp)
5592 {
5593 // concept requirements
5606 }
5608 _GLIBCXX_END_NESTED_NAMESPACE