[tomato.git] / release / src-rt-6.x.4708 / toolchains / hndtools-arm-linux-2.6.36-uclibc-4.5.3 / arm-brcm-linux-uclibcgnueabi / include / c++ / 4.5.3 / bits / stl_algo.h
| blob | 5b4991e33b6464613e58f2b5f35e1c9f0fb64500 |
1 // Algorithm implementation -*- C++ -*-
3 // Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010
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 3, 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 // Under Section 7 of GPL version 3, you are granted additional
18 // permissions described in the GCC Runtime Library Exception, version
19 // 3.1, as published by the Free Software Foundation.
21 // You should have received a copy of the GNU General Public License and
22 // a copy of the GCC Runtime Library Exception along with this program;
23 // see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
24 // <http://www.gnu.org/licenses/>.
26 /*
27 *
28 * Copyright (c) 1994
29 * Hewlett-Packard Company
30 *
31 * Permission to use, copy, modify, distribute and sell this software
32 * and its documentation for any purpose is hereby granted without fee,
33 * provided that the above copyright notice appear in all copies and
34 * that both that copyright notice and this permission notice appear
35 * in supporting documentation. Hewlett-Packard Company makes no
36 * representations about the suitability of this software for any
37 * purpose. It is provided "as is" without express or implied warranty.
38 *
39 *
40 * Copyright (c) 1996
41 * Silicon Graphics Computer Systems, Inc.
42 *
43 * Permission to use, copy, modify, distribute and sell this software
44 * and its documentation for any purpose is hereby granted without fee,
45 * provided that the above copyright notice appear in all copies and
46 * that both that copyright notice and this permission notice appear
47 * in supporting documentation. Silicon Graphics makes no
48 * representations about the suitability of this software for any
49 * purpose. It is provided "as is" without express or implied warranty.
50 */
52 /** @file stl_algo.h
53 * This is an internal header file, included by other library headers.
54 * You should not attempt to use it directly.
55 */
57 #ifndef _STL_ALGO_H
58 #define _STL_ALGO_H 1
61 #include <bits/algorithmfwd.h>
62 #include <bits/stl_heap.h>
65 #ifdef __GXX_EXPERIMENTAL_CXX0X__
67 #endif
69 // See concept_check.h for the __glibcxx_*_requires macros.
73 /// Swaps the median value of *__a, *__b and *__c to *__a
75 void
77 {
78 // concept requirements
83 {
88 }
93 else
95 }
97 /// Swaps the median value of *__a, *__b and *__c under __comp to *__a
99 void
101 _Compare __comp)
102 {
103 // concept requirements
109 {
114 }
119 else
121 }
123 // for_each
125 /// This is an overload used by find() for the Input Iterator case.
127 inline _InputIterator
130 {
134 }
136 /// This is an overload used by find_if() for the Input Iterator case.
138 inline _InputIterator
141 {
145 }
147 /// This is an overload used by find() for the RAI case.
149 _RandomAccessIterator
152 {
157 {
173 }
176 {
192 }
193 }
195 /// This is an overload used by find_if() for the RAI case.
197 _RandomAccessIterator
200 {
205 {
221 }
224 {
240 }
241 }
243 #ifdef __GXX_EXPERIMENTAL_CXX0X__
244 /// This is an overload used by find_if_not() for the Input Iterator case.
246 inline _InputIterator
249 {
253 }
255 /// This is an overload used by find_if_not() for the RAI case.
257 _RandomAccessIterator
260 {
265 {
281 }
284 {
300 }
301 }
302 #endif
304 // set_difference
305 // set_intersection
306 // set_symmetric_difference
307 // set_union
308 // for_each
309 // find
310 // find_if
311 // find_first_of
312 // adjacent_find
313 // count
314 // count_if
315 // search
317 /**
318 * This is an uglified
319 * search_n(_ForwardIterator, _ForwardIterator, _Integer, const _Tp&)
320 * overloaded for forward iterators.
321 */
323 _ForwardIterator
327 {
330 {
336 {
339 }
345 }
347 }
349 /**
350 * This is an uglified
351 * search_n(_ForwardIterator, _ForwardIterator, _Integer, const _Tp&)
352 * overloaded for random access iterators.
353 */
355 _RandomAccessIter
359 {
362 _DistanceType;
375 {
376 // __lookAhead here is always pointing to the last element of next
377 // possible match.
379 {
384 }
388 {
391 }
396 }
397 }
399 // search_n
401 /**
402 * This is an uglified
403 * search_n(_ForwardIterator, _ForwardIterator, _Integer, const _Tp&,
404 * _BinaryPredicate)
405 * overloaded for forward iterators.
406 */
408 typename _BinaryPredicate>
409 _ForwardIterator
413 {
418 {
424 {
427 }
436 }
438 }
440 /**
441 * This is an uglified
442 * search_n(_ForwardIterator, _ForwardIterator, _Integer, const _Tp&,
443 * _BinaryPredicate)
444 * overloaded for random access iterators.
445 */
447 typename _BinaryPredicate>
448 _RandomAccessIter
452 {
455 _DistanceType;
468 {
469 // __lookAhead here is always pointing to the last element of next
470 // possible match.
472 {
477 }
481 {
484 }
489 }
490 }
492 // find_end for forward iterators.
494 _ForwardIterator1
498 {
501 else
502 {
505 {
506 _ForwardIterator1 __new_result
510 else
511 {
515 }
516 }
517 }
518 }
521 typename _BinaryPredicate>
522 _ForwardIterator1
526 _BinaryPredicate __comp)
527 {
530 else
531 {
534 {
535 _ForwardIterator1 __new_result
540 else
541 {
545 }
546 }
547 }
548 }
550 // find_end for bidirectional iterators (much faster).
552 _BidirectionalIterator1
554 _BidirectionalIterator1 __last1,
555 _BidirectionalIterator2 __first2,
556 _BidirectionalIterator2 __last2,
558 {
559 // concept requirements
561 _BidirectionalIterator1>)
563 _BidirectionalIterator2>)
571 __rlast1,
573 __rlast2);
577 else
578 {
582 }
583 }
586 typename _BinaryPredicate>
587 _BidirectionalIterator1
589 _BidirectionalIterator1 __last1,
590 _BidirectionalIterator2 __first2,
591 _BidirectionalIterator2 __last2,
593 _BinaryPredicate __comp)
594 {
595 // concept requirements
597 _BidirectionalIterator1>)
599 _BidirectionalIterator2>)
608 __comp);
612 else
613 {
617 }
618 }
620 /**
621 * @brief Find last matching subsequence in a sequence.
622 * @ingroup non_mutating_algorithms
623 * @param first1 Start of range to search.
624 * @param last1 End of range to search.
625 * @param first2 Start of sequence to match.
626 * @param last2 End of sequence to match.
627 * @return The last iterator @c i in the range
628 * @p [first1,last1-(last2-first2)) such that @c *(i+N) == @p *(first2+N)
629 * for each @c N in the range @p [0,last2-first2), or @p last1 if no
630 * such iterator exists.
631 *
632 * Searches the range @p [first1,last1) for a sub-sequence that compares
633 * equal value-by-value with the sequence given by @p [first2,last2) and
634 * returns an iterator to the first element of the sub-sequence, or
635 * @p last1 if the sub-sequence is not found. The sub-sequence will be the
636 * last such subsequence contained in [first,last1).
637 *
638 * Because the sub-sequence must lie completely within the range
639 * @p [first1,last1) it must start at a position less than
640 * @p last1-(last2-first2) where @p last2-first2 is the length of the
641 * sub-sequence.
642 * This means that the returned iterator @c i will be in the range
643 * @p [first1,last1-(last2-first2))
644 */
646 inline _ForwardIterator1
649 {
650 // concept requirements
662 }
664 /**
665 * @brief Find last matching subsequence in a sequence using a predicate.
666 * @ingroup non_mutating_algorithms
667 * @param first1 Start of range to search.
668 * @param last1 End of range to search.
669 * @param first2 Start of sequence to match.
670 * @param last2 End of sequence to match.
671 * @param comp The predicate to use.
672 * @return The last iterator @c i in the range
673 * @p [first1,last1-(last2-first2)) such that @c predicate(*(i+N), @p
674 * (first2+N)) is true for each @c N in the range @p [0,last2-first2), or
675 * @p last1 if no such iterator exists.
676 *
677 * Searches the range @p [first1,last1) for a sub-sequence that compares
678 * equal value-by-value with the sequence given by @p [first2,last2) using
679 * comp as a predicate and returns an iterator to the first element of the
680 * sub-sequence, or @p last1 if the sub-sequence is not found. The
681 * sub-sequence will be the last such subsequence contained in
682 * [first,last1).
683 *
684 * Because the sub-sequence must lie completely within the range
685 * @p [first1,last1) it must start at a position less than
686 * @p last1-(last2-first2) where @p last2-first2 is the length of the
687 * sub-sequence.
688 * This means that the returned iterator @c i will be in the range
689 * @p [first1,last1-(last2-first2))
690 */
692 typename _BinaryPredicate>
693 inline _ForwardIterator1
696 _BinaryPredicate __comp)
697 {
698 // concept requirements
710 __comp);
711 }
713 #ifdef __GXX_EXPERIMENTAL_CXX0X__
714 /**
715 * @brief Checks that a predicate is true for all the elements
716 * of a sequence.
717 * @ingroup non_mutating_algorithms
718 * @param first An input iterator.
719 * @param last An input iterator.
720 * @param pred A predicate.
721 * @return True if the check is true, false otherwise.
722 *
723 * Returns true if @p pred is true for each element in the range
724 * @p [first,last), and false otherwise.
725 */
731 /**
732 * @brief Checks that a predicate is false for all the elements
733 * of a sequence.
734 * @ingroup non_mutating_algorithms
735 * @param first An input iterator.
736 * @param last An input iterator.
737 * @param pred A predicate.
738 * @return True if the check is true, false otherwise.
739 *
740 * Returns true if @p pred is false for each element in the range
741 * @p [first,last), and false otherwise.
742 */
748 /**
749 * @brief Checks that a predicate is false for at least an element
750 * of a sequence.
751 * @ingroup non_mutating_algorithms
752 * @param first An input iterator.
753 * @param last An input iterator.
754 * @param pred A predicate.
755 * @return True if the check is true, false otherwise.
756 *
757 * Returns true if an element exists in the range @p [first,last) such that
758 * @p pred is true, and false otherwise.
759 */
765 /**
766 * @brief Find the first element in a sequence for which a
767 * predicate is false.
768 * @ingroup non_mutating_algorithms
769 * @param first An input iterator.
770 * @param last An input iterator.
771 * @param pred A predicate.
772 * @return The first iterator @c i in the range @p [first,last)
773 * such that @p pred(*i) is false, or @p last if no such iterator exists.
774 */
776 inline _InputIterator
778 _Predicate __pred)
779 {
780 // concept requirements
787 }
789 /**
790 * @brief Checks whether the sequence is partitioned.
791 * @ingroup mutating_algorithms
792 * @param first An input iterator.
793 * @param last An input iterator.
794 * @param pred A predicate.
795 * @return True if the range @p [first,last) is partioned by @p pred,
796 * i.e. if all elements that satisfy @p pred appear before those that
797 * do not.
798 */
802 _Predicate __pred)
803 {
806 }
808 /**
809 * @brief Find the partition point of a partitioned range.
810 * @ingroup mutating_algorithms
811 * @param first An iterator.
812 * @param last Another iterator.
813 * @param pred A predicate.
814 * @return An iterator @p mid such that @p all_of(first, mid, pred)
815 * and @p none_of(mid, last, pred) are both true.
816 */
818 _ForwardIterator
820 _Predicate __pred)
821 {
822 // concept requirements
827 // A specific debug-mode test will be necessary...
831 _DistanceType;
834 _DistanceType __half;
835 _ForwardIterator __middle;
838 {
843 {
847 }
848 else
850 }
852 }
853 #endif
856 /**
857 * @brief Copy a sequence, removing elements of a given value.
858 * @ingroup mutating_algorithms
859 * @param first An input iterator.
860 * @param last An input iterator.
861 * @param result An output iterator.
862 * @param value The value to be removed.
863 * @return An iterator designating the end of the resulting sequence.
864 *
865 * Copies each element in the range @p [first,last) not equal to @p value
866 * to the range beginning at @p result.
867 * remove_copy() is stable, so the relative order of elements that are
868 * copied is unchanged.
869 */
871 _OutputIterator
874 {
875 // concept requirements
885 {
888 }
890 }
892 /**
893 * @brief Copy a sequence, removing elements for which a predicate is true.
894 * @ingroup mutating_algorithms
895 * @param first An input iterator.
896 * @param last An input iterator.
897 * @param result An output iterator.
898 * @param pred A predicate.
899 * @return An iterator designating the end of the resulting sequence.
900 *
901 * Copies each element in the range @p [first,last) for which
902 * @p pred returns false to the range beginning at @p result.
903 *
904 * remove_copy_if() is stable, so the relative order of elements that are
905 * copied is unchanged.
906 */
908 typename _Predicate>
909 _OutputIterator
912 {
913 // concept requirements
923 {
926 }
928 }
930 #ifdef __GXX_EXPERIMENTAL_CXX0X__
931 /**
932 * @brief Copy the elements of a sequence for which a predicate is true.
933 * @ingroup mutating_algorithms
934 * @param first An input iterator.
935 * @param last An input iterator.
936 * @param result An output iterator.
937 * @param pred A predicate.
938 * @return An iterator designating the end of the resulting sequence.
939 *
940 * Copies each element in the range @p [first,last) for which
941 * @p pred returns true to the range beginning at @p result.
942 *
943 * copy_if() is stable, so the relative order of elements that are
944 * copied is unchanged.
945 */
947 typename _Predicate>
948 _OutputIterator
951 {
952 // concept requirements
962 {
965 }
967 }
971 _OutputIterator
974 {
976 {
980 }
982 }
985 typename _OutputIterator>
986 inline _OutputIterator
991 /**
992 * @brief Copies the range [first,first+n) into [result,result+n).
993 * @ingroup mutating_algorithms
994 * @param first An input iterator.
995 * @param n The number of elements to copy.
996 * @param result An output iterator.
997 * @return result+n.
998 *
999 * This inline function will boil down to a call to @c memmove whenever
1000 * possible. Failing that, if random access iterators are passed, then the
1001 * loop count will be known (and therefore a candidate for compiler
1002 * optimizations such as unrolling).
1003 */
1005 inline _OutputIterator
1007 {
1008 // concept requirements
1015 }
1017 /**
1018 * @brief Copy the elements of a sequence to separate output sequences
1019 * depending on the truth value of a predicate.
1020 * @ingroup mutating_algorithms
1021 * @param first An input iterator.
1022 * @param last An input iterator.
1023 * @param out_true An output iterator.
1024 * @param out_false An output iterator.
1025 * @param pred A predicate.
1026 * @return A pair designating the ends of the resulting sequences.
1027 *
1028 * Copies each element in the range @p [first,last) for which
1029 * @p pred returns true to the range beginning at @p out_true
1030 * and each element for which @p pred returns false to @p out_false.
1031 */
1037 _Predicate __pred)
1038 {
1039 // concept requirements
1051 {
1054 }
1055 else
1056 {
1059 }
1062 }
1063 #endif
1065 /**
1066 * @brief Remove elements from a sequence.
1067 * @ingroup mutating_algorithms
1068 * @param first An input iterator.
1069 * @param last An input iterator.
1070 * @param value The value to be removed.
1071 * @return An iterator designating the end of the resulting sequence.
1072 *
1073 * All elements equal to @p value are removed from the range
1074 * @p [first,last).
1075 *
1076 * remove() is stable, so the relative order of elements that are
1077 * not removed is unchanged.
1078 *
1079 * Elements between the end of the resulting sequence and @p last
1080 * are still present, but their value is unspecified.
1081 */
1083 _ForwardIterator
1086 {
1087 // concept requirements
1089 _ForwardIterator>)
1101 {
1104 }
1106 }
1108 /**
1109 * @brief Remove elements from a sequence using a predicate.
1110 * @ingroup mutating_algorithms
1111 * @param first A forward iterator.
1112 * @param last A forward iterator.
1113 * @param pred A predicate.
1114 * @return An iterator designating the end of the resulting sequence.
1115 *
1116 * All elements for which @p pred returns true are removed from the range
1117 * @p [first,last).
1118 *
1119 * remove_if() is stable, so the relative order of elements that are
1120 * not removed is unchanged.
1121 *
1122 * Elements between the end of the resulting sequence and @p last
1123 * are still present, but their value is unspecified.
1124 */
1126 _ForwardIterator
1128 _Predicate __pred)
1129 {
1130 // concept requirements
1132 _ForwardIterator>)
1144 {
1147 }
1149 }
1151 /**
1152 * @brief Remove consecutive duplicate values from a sequence.
1153 * @ingroup mutating_algorithms
1154 * @param first A forward iterator.
1155 * @param last A forward iterator.
1156 * @return An iterator designating the end of the resulting sequence.
1157 *
1158 * Removes all but the first element from each group of consecutive
1159 * values that compare equal.
1160 * unique() is stable, so the relative order of elements that are
1161 * not removed is unchanged.
1162 * Elements between the end of the resulting sequence and @p last
1163 * are still present, but their value is unspecified.
1164 */
1166 _ForwardIterator
1168 {
1169 // concept requirements
1171 _ForwardIterator>)
1176 // Skip the beginning, if already unique.
1181 // Do the real copy work.
1188 }
1190 /**
1191 * @brief Remove consecutive values from a sequence using a predicate.
1192 * @ingroup mutating_algorithms
1193 * @param first A forward iterator.
1194 * @param last A forward iterator.
1195 * @param binary_pred A binary predicate.
1196 * @return An iterator designating the end of the resulting sequence.
1197 *
1198 * Removes all but the first element from each group of consecutive
1199 * values for which @p binary_pred returns true.
1200 * unique() is stable, so the relative order of elements that are
1201 * not removed is unchanged.
1202 * Elements between the end of the resulting sequence and @p last
1203 * are still present, but their value is unspecified.
1204 */
1206 _ForwardIterator
1208 _BinaryPredicate __binary_pred)
1209 {
1210 // concept requirements
1212 _ForwardIterator>)
1218 // Skip the beginning, if already unique.
1223 // Do the real copy work.
1230 }
1232 /**
1233 * This is an uglified unique_copy(_InputIterator, _InputIterator,
1234 * _OutputIterator)
1235 * overloaded for forward iterators and output iterator as result.
1236 */
1238 _OutputIterator
1240 _OutputIterator __result,
1242 {
1243 // concept requirements -- taken care of in dispatching function
1248 {
1251 }
1253 }
1255 /**
1256 * This is an uglified unique_copy(_InputIterator, _InputIterator,
1257 * _OutputIterator)
1258 * overloaded for input iterators and output iterator as result.
1259 */
1261 _OutputIterator
1263 _OutputIterator __result,
1265 {
1266 // concept requirements -- taken care of in dispatching function
1271 {
1274 }
1276 }
1278 /**
1279 * This is an uglified unique_copy(_InputIterator, _InputIterator,
1280 * _OutputIterator)
1281 * overloaded for input iterators and forward iterator as result.
1282 */
1284 _ForwardIterator
1286 _ForwardIterator __result,
1288 {
1289 // concept requirements -- taken care of in dispatching function
1295 }
1297 /**
1298 * This is an uglified
1299 * unique_copy(_InputIterator, _InputIterator, _OutputIterator,
1300 * _BinaryPredicate)
1301 * overloaded for forward iterators and output iterator as result.
1302 */
1304 typename _BinaryPredicate>
1305 _OutputIterator
1309 {
1310 // concept requirements -- iterators already checked
1319 {
1322 }
1324 }
1326 /**
1327 * This is an uglified
1328 * unique_copy(_InputIterator, _InputIterator, _OutputIterator,
1329 * _BinaryPredicate)
1330 * overloaded for input iterators and output iterator as result.
1331 */
1333 typename _BinaryPredicate>
1334 _OutputIterator
1338 {
1339 // concept requirements -- iterators already checked
1348 {
1351 }
1353 }
1355 /**
1356 * This is an uglified
1357 * unique_copy(_InputIterator, _InputIterator, _OutputIterator,
1358 * _BinaryPredicate)
1359 * overloaded for input iterators and forward iterator as result.
1360 */
1362 typename _BinaryPredicate>
1363 _ForwardIterator
1367 {
1368 // concept requirements -- iterators already checked
1378 }
1380 /**
1381 * This is an uglified reverse(_BidirectionalIterator,
1382 * _BidirectionalIterator)
1383 * overloaded for bidirectional iterators.
1384 */
1386 void
1388 bidirectional_iterator_tag)
1389 {
1393 else
1394 {
1397 }
1398 }
1400 /**
1401 * This is an uglified reverse(_BidirectionalIterator,
1402 * _BidirectionalIterator)
1403 * overloaded for random access iterators.
1404 */
1406 void
1408 random_access_iterator_tag)
1409 {
1414 {
1418 }
1419 }
1421 /**
1422 * @brief Reverse a sequence.
1423 * @ingroup mutating_algorithms
1424 * @param first A bidirectional iterator.
1425 * @param last A bidirectional iterator.
1426 * @return reverse() returns no value.
1427 *
1428 * Reverses the order of the elements in the range @p [first,last),
1429 * so that the first element becomes the last etc.
1430 * For every @c i such that @p 0<=i<=(last-first)/2), @p reverse()
1431 * swaps @p *(first+i) and @p *(last-(i+1))
1432 */
1436 {
1437 // concept requirements
1439 _BidirectionalIterator>)
1442 }
1444 /**
1445 * @brief Copy a sequence, reversing its elements.
1446 * @ingroup mutating_algorithms
1447 * @param first A bidirectional iterator.
1448 * @param last A bidirectional iterator.
1449 * @param result An output iterator.
1450 * @return An iterator designating the end of the resulting sequence.
1451 *
1452 * Copies the elements in the range @p [first,last) to the range
1453 * @p [result,result+(last-first)) such that the order of the
1454 * elements is reversed.
1455 * For every @c i such that @p 0<=i<=(last-first), @p reverse_copy()
1456 * performs the assignment @p *(result+(last-first)-i) = *(first+i).
1457 * The ranges @p [first,last) and @p [result,result+(last-first))
1458 * must not overlap.
1459 */
1461 _OutputIterator
1463 _OutputIterator __result)
1464 {
1465 // concept requirements
1467 _BidirectionalIterator>)
1473 {
1477 }
1479 }
1481 /**
1482 * This is a helper function for the rotate algorithm specialized on RAIs.
1483 * It returns the greatest common divisor of two integer values.
1484 */
1486 _EuclideanRingElement
1488 {
1490 {
1494 }
1496 }
1498 /// This is a helper function for the rotate algorithm.
1500 void
1502 _ForwardIterator __middle,
1503 _ForwardIterator __last,
1504 forward_iterator_tag)
1505 {
1510 do
1511 {
1517 }
1523 {
1531 }
1532 }
1534 /// This is a helper function for the rotate algorithm.
1536 void
1538 _BidirectionalIterator __middle,
1539 _BidirectionalIterator __last,
1540 bidirectional_iterator_tag)
1541 {
1542 // concept requirements
1544 _BidirectionalIterator>)
1553 {
1556 }
1560 else
1562 }
1564 /// This is a helper function for the rotate algorithm.
1566 void
1568 _RandomAccessIterator __middle,
1569 _RandomAccessIterator __last,
1570 random_access_iterator_tag)
1571 {
1572 // concept requirements
1574 _RandomAccessIterator>)
1580 _Distance;
1582 _ValueType;
1588 {
1591 }
1596 {
1598 {
1600 {
1605 }
1608 {
1612 }
1618 }
1619 else
1620 {
1623 {
1628 }
1632 {
1636 }
1641 }
1642 }
1643 }
1645 /**
1646 * @brief Rotate the elements of a sequence.
1647 * @ingroup mutating_algorithms
1648 * @param first A forward iterator.
1649 * @param middle A forward iterator.
1650 * @param last A forward iterator.
1651 * @return Nothing.
1652 *
1653 * Rotates the elements of the range @p [first,last) by @p (middle-first)
1654 * positions so that the element at @p middle is moved to @p first, the
1655 * element at @p middle+1 is moved to @first+1 and so on for each element
1656 * in the range @p [first,last).
1657 *
1658 * This effectively swaps the ranges @p [first,middle) and
1659 * @p [middle,last).
1660 *
1661 * Performs @p *(first+(n+(last-middle))%(last-first))=*(first+n) for
1662 * each @p n in the range @p [0,last-first).
1663 */
1667 _ForwardIterator __last)
1668 {
1669 // concept requirements
1671 _ForwardIterator>)
1676 _IterType;
1678 }
1680 /**
1681 * @brief Copy a sequence, rotating its elements.
1682 * @ingroup mutating_algorithms
1683 * @param first A forward iterator.
1684 * @param middle A forward iterator.
1685 * @param last A forward iterator.
1686 * @param result An output iterator.
1687 * @return An iterator designating the end of the resulting sequence.
1688 *
1689 * Copies the elements of the range @p [first,last) to the range
1690 * beginning at @result, rotating the copied elements by @p (middle-first)
1691 * positions so that the element at @p middle is moved to @p result, the
1692 * element at @p middle+1 is moved to @result+1 and so on for each element
1693 * in the range @p [first,last).
1694 *
1695 * Performs @p *(result+(n+(last-middle))%(last-first))=*(first+n) for
1696 * each @p n in the range @p [0,last-first).
1697 */
1699 _OutputIterator
1702 {
1703 // concept requirements
1712 }
1714 /// This is a helper function...
1716 _ForwardIterator
1719 {
1731 {
1734 }
1737 }
1739 /// This is a helper function...
1741 _BidirectionalIterator
1744 {
1746 {
1752 else
1760 else
1764 }
1765 }
1767 // partition
1769 /// This is a helper function...
1771 _ForwardIterator
1773 _ForwardIterator __last,
1775 {
1781 __middle,
1782 __pred,
1785 __pred,
1786 __len
1791 }
1793 /// This is a helper function...
1795 typename _Distance>
1796 _ForwardIterator
1798 _ForwardIterator __last,
1800 _Pointer __buffer,
1801 _Distance __buffer_size)
1802 {
1804 {
1809 {
1812 }
1813 else
1814 {
1817 }
1820 }
1821 else
1822 {
1825 _ForwardIterator __begin =
1828 __buffer_size);
1829 _ForwardIterator __end =
1836 }
1837 }
1839 /**
1840 * @brief Move elements for which a predicate is true to the beginning
1841 * of a sequence, preserving relative ordering.
1842 * @ingroup mutating_algorithms
1843 * @param first A forward iterator.
1844 * @param last A forward iterator.
1845 * @param pred A predicate functor.
1846 * @return An iterator @p middle such that @p pred(i) is true for each
1847 * iterator @p i in the range @p [first,middle) and false for each @p i
1848 * in the range @p [middle,last).
1849 *
1850 * Performs the same function as @p partition() with the additional
1851 * guarantee that the relative ordering of elements in each group is
1852 * preserved, so any two elements @p x and @p y in the range
1853 * @p [first,last) such that @p pred(x)==pred(y) will have the same
1854 * relative ordering after calling @p stable_partition().
1855 */
1857 _ForwardIterator
1859 _Predicate __pred)
1860 {
1861 // concept requirements
1863 _ForwardIterator>)
1870 else
1871 {
1873 _ValueType;
1875 _DistanceType;
1878 __last);
1880 return
1885 else
1886 return
1889 }
1890 }
1892 /// This is a helper function for the sort routines.
1894 void
1896 _RandomAccessIterator __middle,
1897 _RandomAccessIterator __last)
1898 {
1903 }
1905 /// This is a helper function for the sort routines.
1907 void
1909 _RandomAccessIterator __middle,
1911 {
1916 }
1918 // partial_sort
1920 /**
1921 * @brief Copy the smallest elements of a sequence.
1922 * @ingroup sorting_algorithms
1923 * @param first An iterator.
1924 * @param last Another iterator.
1925 * @param result_first A random-access iterator.
1926 * @param result_last Another random-access iterator.
1927 * @return An iterator indicating the end of the resulting sequence.
1928 *
1929 * Copies and sorts the smallest N values from the range @p [first,last)
1930 * to the range beginning at @p result_first, where the number of
1931 * elements to be copied, @p N, is the smaller of @p (last-first) and
1932 * @p (result_last-result_first).
1933 * After the sort if @p i and @j are iterators in the range
1934 * @p [result_first,result_first+N) such that @i precedes @j then
1935 * @p *j<*i is false.
1936 * The value returned is @p result_first+N.
1937 */
1939 _RandomAccessIterator
1941 _RandomAccessIterator __result_first,
1942 _RandomAccessIterator __result_last)
1943 {
1945 _InputValueType;
1947 _OutputValueType;
1949 _DistanceType;
1951 // concept requirements
1954 _OutputValueType>)
1956 _OutputValueType>)
1965 {
1969 }
1972 {
1979 }
1982 }
1984 /**
1985 * @brief Copy the smallest elements of a sequence using a predicate for
1986 * comparison.
1987 * @ingroup sorting_algorithms
1988 * @param first An input iterator.
1989 * @param last Another input iterator.
1990 * @param result_first A random-access iterator.
1991 * @param result_last Another random-access iterator.
1992 * @param comp A comparison functor.
1993 * @return An iterator indicating the end of the resulting sequence.
1994 *
1995 * Copies and sorts the smallest N values from the range @p [first,last)
1996 * to the range beginning at @p result_first, where the number of
1997 * elements to be copied, @p N, is the smaller of @p (last-first) and
1998 * @p (result_last-result_first).
1999 * After the sort if @p i and @j are iterators in the range
2000 * @p [result_first,result_first+N) such that @i precedes @j then
2001 * @p comp(*j,*i) is false.
2002 * The value returned is @p result_first+N.
2003 */
2005 _RandomAccessIterator
2007 _RandomAccessIterator __result_first,
2008 _RandomAccessIterator __result_last,
2009 _Compare __comp)
2010 {
2012 _InputValueType;
2014 _OutputValueType;
2016 _DistanceType;
2018 // concept requirements
2021 _RandomAccessIterator>)
2023 _OutputValueType>)
2035 {
2039 }
2042 {
2048 __comp);
2050 }
2053 }
2055 /// This is a helper function for the sort routine.
2057 void
2059 {
2065 {
2069 }
2071 }
2073 /// This is a helper function for the sort routine.
2075 void
2077 _Compare __comp)
2078 {
2084 {
2088 }
2090 }
2092 /// This is a helper function for the sort routine.
2094 void
2096 _RandomAccessIterator __last)
2097 {
2102 {
2104 {
2109 }
2110 else
2112 }
2113 }
2115 /// This is a helper function for the sort routine.
2117 void
2120 {
2124 {
2126 {
2131 }
2132 else
2134 }
2135 }
2137 /// This is a helper function for the sort routine.
2141 _RandomAccessIterator __last)
2142 {
2144 _ValueType;
2148 }
2150 /// This is a helper function for the sort routine.
2155 {
2157 _ValueType;
2161 }
2163 /**
2164 * @doctodo
2165 * This controls some aspect of the sort routines.
2166 */
2169 /// This is a helper function for the sort routine.
2171 void
2173 _RandomAccessIterator __last)
2174 {
2176 {
2179 }
2180 else
2182 }
2184 /// This is a helper function for the sort routine.
2186 void
2189 {
2191 {
2194 __comp);
2195 }
2196 else
2198 }
2200 /// This is a helper function...
2202 _RandomAccessIterator
2205 {
2207 {
2217 }
2218 }
2220 /// This is a helper function...
2222 _RandomAccessIterator
2224 _RandomAccessIterator __last,
2226 {
2228 {
2238 }
2239 }
2241 /// This is a helper function...
2243 inline _RandomAccessIterator
2245 _RandomAccessIterator __last)
2246 {
2250 }
2253 /// This is a helper function...
2255 inline _RandomAccessIterator
2258 {
2262 }
2264 /// This is a helper function for the sort routine.
2266 void
2268 _RandomAccessIterator __last,
2269 _Size __depth_limit)
2270 {
2272 {
2274 {
2277 }
2279 _RandomAccessIterator __cut =
2283 }
2284 }
2286 /// This is a helper function for the sort routine.
2288 void
2290 _RandomAccessIterator __last,
2292 {
2294 {
2296 {
2299 }
2301 _RandomAccessIterator __cut =
2305 }
2306 }
2308 // sort
2311 void
2314 {
2316 _ValueType;
2319 {
2321 {
2324 // Place the nth largest element in its final position.
2327 }
2329 _RandomAccessIterator __cut =
2333 else
2335 }
2337 }
2340 void
2343 _Compare __comp)
2344 {
2346 _ValueType;
2349 {
2351 {
2353 // Place the nth largest element in its final position.
2356 }
2358 _RandomAccessIterator __cut =
2362 else
2364 }
2366 }
2368 // nth_element
2370 // lower_bound moved to stl_algobase.h
2372 /**
2373 * @brief Finds the first position in which @a val could be inserted
2374 * without changing the ordering.
2375 * @ingroup binary_search_algorithms
2376 * @param first An iterator.
2377 * @param last Another iterator.
2378 * @param val The search term.
2379 * @param comp A functor to use for comparisons.
2380 * @return An iterator pointing to the first element <em>not less
2381 * than</em> @a val, or end() if every element is less
2382 * than @a val.
2383 * @ingroup binary_search_algorithms
2384 *
2385 * The comparison function should have the same effects on ordering as
2386 * the function used for the initial sort.
2387 */
2389 _ForwardIterator
2392 {
2394 _ValueType;
2396 _DistanceType;
2398 // concept requirements
2406 _DistanceType __half;
2407 _ForwardIterator __middle;
2410 {
2415 {
2419 }
2420 else
2422 }
2424 }
2426 /**
2427 * @brief Finds the last position in which @a val could be inserted
2428 * without changing the ordering.
2429 * @ingroup binary_search_algorithms
2430 * @param first An iterator.
2431 * @param last Another iterator.
2432 * @param val The search term.
2433 * @return An iterator pointing to the first element greater than @a val,
2434 * or end() if no elements are greater than @a val.
2435 * @ingroup binary_search_algorithms
2436 */
2438 _ForwardIterator
2441 {
2443 _ValueType;
2445 _DistanceType;
2447 // concept requirements
2453 _DistanceType __half;
2454 _ForwardIterator __middle;
2457 {
2463 else
2464 {
2468 }
2469 }
2471 }
2473 /**
2474 * @brief Finds the last position in which @a val could be inserted
2475 * without changing the ordering.
2476 * @ingroup binary_search_algorithms
2477 * @param first An iterator.
2478 * @param last Another iterator.
2479 * @param val The search term.
2480 * @param comp A functor to use for comparisons.
2481 * @return An iterator pointing to the first element greater than @a val,
2482 * or end() if no elements are greater than @a val.
2483 * @ingroup binary_search_algorithms
2484 *
2485 * The comparison function should have the same effects on ordering as
2486 * the function used for the initial sort.
2487 */
2489 _ForwardIterator
2492 {
2494 _ValueType;
2496 _DistanceType;
2498 // concept requirements
2506 _DistanceType __half;
2507 _ForwardIterator __middle;
2510 {
2516 else
2517 {
2521 }
2522 }
2524 }
2526 /**
2527 * @brief Finds the largest subrange in which @a val could be inserted
2528 * at any place in it without changing the ordering.
2529 * @ingroup binary_search_algorithms
2530 * @param first An iterator.
2531 * @param last Another iterator.
2532 * @param val The search term.
2533 * @return An pair of iterators defining the subrange.
2534 * @ingroup binary_search_algorithms
2535 *
2536 * This is equivalent to
2537 * @code
2538 * std::make_pair(lower_bound(first, last, val),
2539 * upper_bound(first, last, val))
2540 * @endcode
2541 * but does not actually call those functions.
2542 */
2547 {
2549 _ValueType;
2551 _DistanceType;
2553 // concept requirements
2561 _DistanceType __half;
2565 {
2570 {
2574 }
2577 else
2578 {
2583 }
2584 }
2586 }
2588 /**
2589 * @brief Finds the largest subrange in which @a val could be inserted
2590 * at any place in it without changing the ordering.
2591 * @param first An iterator.
2592 * @param last Another iterator.
2593 * @param val The search term.
2594 * @param comp A functor to use for comparisons.
2595 * @return An pair of iterators defining the subrange.
2596 * @ingroup binary_search_algorithms
2597 *
2598 * This is equivalent to
2599 * @code
2600 * std::make_pair(lower_bound(first, last, val, comp),
2601 * upper_bound(first, last, val, comp))
2602 * @endcode
2603 * but does not actually call those functions.
2604 */
2609 _Compare __comp)
2610 {
2612 _ValueType;
2614 _DistanceType;
2616 // concept requirements
2628 _DistanceType __half;
2632 {
2637 {
2641 }
2644 else
2645 {
2650 }
2651 }
2653 }
2655 /**
2656 * @brief Determines whether an element exists in a range.
2657 * @ingroup binary_search_algorithms
2658 * @param first An iterator.
2659 * @param last Another iterator.
2660 * @param val The search term.
2661 * @return True if @a val (or its equivalent) is in [@a first,@a last ].
2662 *
2663 * Note that this does not actually return an iterator to @a val. For
2664 * that, use std::find or a container's specialized find member functions.
2665 */
2667 bool
2670 {
2672 _ValueType;
2674 // concept requirements
2682 }
2684 /**
2685 * @brief Determines whether an element exists in a range.
2686 * @ingroup binary_search_algorithms
2687 * @param first An iterator.
2688 * @param last Another iterator.
2689 * @param val The search term.
2690 * @param comp A functor to use for comparisons.
2691 * @return True if @a val (or its equivalent) is in [@a first,@a last ].
2692 *
2693 * Note that this does not actually return an iterator to @a val. For
2694 * that, use std::find or a container's specialized find member functions.
2695 *
2696 * The comparison function should have the same effects on ordering as
2697 * the function used for the initial sort.
2698 */
2700 bool
2703 {
2705 _ValueType;
2707 // concept requirements
2718 }
2720 // merge
2722 /// This is a helper function for the merge routines.
2724 typename _BidirectionalIterator3>
2725 _BidirectionalIterator3
2727 _BidirectionalIterator1 __last1,
2728 _BidirectionalIterator2 __first2,
2729 _BidirectionalIterator2 __last2,
2730 _BidirectionalIterator3 __result)
2731 {
2739 {
2741 {
2746 }
2747 else
2748 {
2753 }
2754 }
2755 }
2757 /// This is a helper function for the merge routines.
2760 _BidirectionalIterator3
2762 _BidirectionalIterator1 __last1,
2763 _BidirectionalIterator2 __first2,
2764 _BidirectionalIterator2 __last2,
2765 _BidirectionalIterator3 __result,
2766 _Compare __comp)
2767 {
2775 {
2777 {
2782 }
2783 else
2784 {
2789 }
2790 }
2791 }
2793 /// This is a helper function for the merge routines.
2795 typename _Distance>
2796 _BidirectionalIterator1
2798 _BidirectionalIterator1 __middle,
2799 _BidirectionalIterator1 __last,
2801 _BidirectionalIterator2 __buffer,
2802 _Distance __buffer_size)
2803 {
2804 _BidirectionalIterator2 __buffer_end;
2806 {
2810 }
2812 {
2816 }
2817 else
2818 {
2822 }
2823 }
2825 /// This is a helper function for the merge routines.
2827 typename _Pointer>
2828 void
2830 _BidirectionalIterator __middle,
2831 _BidirectionalIterator __last,
2834 {
2836 {
2842 __first);
2843 }
2845 {
2851 __last);
2852 }
2853 else
2854 {
2860 {
2866 }
2867 else
2868 {
2874 }
2875 _BidirectionalIterator __new_middle =
2878 __buffer_size);
2884 }
2885 }
2887 /// This is a helper function for the merge routines.
2890 void
2892 _BidirectionalIterator __middle,
2893 _BidirectionalIterator __last,
2896 _Compare __comp)
2897 {
2899 {
2906 }
2908 {
2915 }
2916 else
2917 {
2923 {
2927 __comp);
2929 }
2930 else
2931 {
2935 __comp);
2937 }
2938 _BidirectionalIterator __new_middle =
2941 __buffer_size);
2948 }
2949 }
2951 /// This is a helper function for the merge routines.
2953 void
2955 _BidirectionalIterator __middle,
2956 _BidirectionalIterator __last,
2958 {
2962 {
2966 }
2972 {
2977 }
2978 else
2979 {
2984 }
2992 }
2994 /// This is a helper function for the merge routines.
2996 typename _Compare>
2997 void
2999 _BidirectionalIterator __middle,
3000 _BidirectionalIterator __last,
3002 _Compare __comp)
3003 {
3007 {
3011 }
3017 {
3021 __comp);
3023 }
3024 else
3025 {
3029 __comp);
3031 }
3039 }
3041 /**
3042 * @brief Merges two sorted ranges in place.
3043 * @ingroup sorting_algorithms
3044 * @param first An iterator.
3045 * @param middle Another iterator.
3046 * @param last Another iterator.
3047 * @return Nothing.
3048 *
3049 * Merges two sorted and consecutive ranges, [first,middle) and
3050 * [middle,last), and puts the result in [first,last). The output will
3051 * be sorted. The sort is @e stable, that is, for equivalent
3052 * elements in the two ranges, elements from the first range will always
3053 * come before elements from the second.
3054 *
3055 * If enough additional memory is available, this takes (last-first)-1
3056 * comparisons. Otherwise an NlogN algorithm is used, where N is
3057 * distance(first,last).
3058 */
3060 void
3062 _BidirectionalIterator __middle,
3063 _BidirectionalIterator __last)
3064 {
3066 _ValueType;
3068 _DistanceType;
3070 // concept requirements
3072 _BidirectionalIterator>)
3084 __last);
3087 else
3090 }
3092 /**
3093 * @brief Merges two sorted ranges in place.
3094 * @ingroup sorting_algorithms
3095 * @param first An iterator.
3096 * @param middle Another iterator.
3097 * @param last Another iterator.
3098 * @param comp A functor to use for comparisons.
3099 * @return Nothing.
3100 *
3101 * Merges two sorted and consecutive ranges, [first,middle) and
3102 * [middle,last), and puts the result in [first,last). The output will
3103 * be sorted. The sort is @e stable, that is, for equivalent
3104 * elements in the two ranges, elements from the first range will always
3105 * come before elements from the second.
3106 *
3107 * If enough additional memory is available, this takes (last-first)-1
3108 * comparisons. Otherwise an NlogN algorithm is used, where N is
3109 * distance(first,last).
3110 *
3111 * The comparison function should have the same effects on ordering as
3112 * the function used for the initial sort.
3113 */
3115 void
3117 _BidirectionalIterator __middle,
3118 _BidirectionalIterator __last,
3119 _Compare __comp)
3120 {
3122 _ValueType;
3124 _DistanceType;
3126 // concept requirements
3128 _BidirectionalIterator>)
3141 __last);
3145 else
3148 __comp);
3149 }
3152 typename _Distance>
3153 void
3155 _RandomAccessIterator1 __last,
3156 _RandomAccessIterator2 __result,
3157 _Distance __step_size)
3158 {
3162 {
3168 __result);
3170 }
3175 __step_size),
3177 __step_size),
3179 __result);
3180 }
3184 void
3186 _RandomAccessIterator1 __last,
3188 _Compare __comp)
3189 {
3193 {
3201 }
3206 __step_size),
3208 __step_size),
3211 }
3214 void
3216 _RandomAccessIterator __last,
3217 _Distance __chunk_size)
3218 {
3220 {
3223 }
3225 }
3228 typename _Compare>
3229 void
3231 _RandomAccessIterator __last,
3233 {
3235 {
3238 }
3240 }
3245 void
3247 _RandomAccessIterator __last,
3248 _Pointer __buffer)
3249 {
3251 _Distance;
3260 {
3265 }
3266 }
3269 void
3271 _RandomAccessIterator __last,
3273 {
3275 _Distance;
3284 {
3291 }
3292 }
3295 typename _Distance>
3296 void
3298 _RandomAccessIterator __last,
3300 {
3304 {
3309 }
3310 else
3311 {
3314 }
3319 }
3323 void
3325 _RandomAccessIterator __last,
3327 _Compare __comp)
3328 {
3332 {
3337 }
3338 else
3339 {
3342 }
3347 __comp);
3348 }
3350 /// This is a helper function for the stable sorting routines.
3352 void
3354 _RandomAccessIterator __last)
3355 {
3357 {
3360 }
3367 }
3369 /// This is a helper function for the stable sorting routines.
3371 void
3374 {
3376 {
3379 }
3386 __comp);
3387 }
3389 // stable_sort
3391 // Set algorithms: includes, set_union, set_intersection, set_difference,
3392 // set_symmetric_difference. All of these algorithms have the precondition
3393 // that their input ranges are sorted and the postcondition that their output
3394 // ranges are sorted.
3396 /**
3397 * @brief Determines whether all elements of a sequence exists in a range.
3398 * @param first1 Start of search range.
3399 * @param last1 End of search range.
3400 * @param first2 Start of sequence
3401 * @param last2 End of sequence.
3402 * @return True if each element in [first2,last2) is contained in order
3403 * within [first1,last1). False otherwise.
3404 * @ingroup set_algorithms
3405 *
3406 * This operation expects both [first1,last1) and [first2,last2) to be
3407 * sorted. Searches for the presence of each element in [first2,last2)
3408 * within [first1,last1). The iterators over each range only move forward,
3409 * so this is a linear algorithm. If an element in [first2,last2) is not
3410 * found before the search iterator reaches @a last2, false is returned.
3411 */
3413 bool
3416 {
3418 _ValueType1;
3420 _ValueType2;
3422 // concept requirements
3435 else
3439 }
3441 /**
3442 * @brief Determines whether all elements of a sequence exists in a range
3443 * using comparison.
3444 * @ingroup set_algorithms
3445 * @param first1 Start of search range.
3446 * @param last1 End of search range.
3447 * @param first2 Start of sequence
3448 * @param last2 End of sequence.
3449 * @param comp Comparison function to use.
3450 * @return True if each element in [first2,last2) is contained in order
3451 * within [first1,last1) according to comp. False otherwise.
3452 * @ingroup set_algorithms
3453 *
3454 * This operation expects both [first1,last1) and [first2,last2) to be
3455 * sorted. Searches for the presence of each element in [first2,last2)
3456 * within [first1,last1), using comp to decide. The iterators over each
3457 * range only move forward, so this is a linear algorithm. If an element
3458 * in [first2,last2) is not found before the search iterator reaches @a
3459 * last2, false is returned.
3460 */
3462 typename _Compare>
3463 bool
3466 _Compare __comp)
3467 {
3469 _ValueType1;
3471 _ValueType2;
3473 // concept requirements
3488 else
3492 }
3494 // nth_element
3495 // merge
3496 // set_difference
3497 // set_intersection
3498 // set_union
3499 // stable_sort
3500 // set_symmetric_difference
3501 // min_element
3502 // max_element
3504 /**
3505 * @brief Permute range into the next @a dictionary ordering.
3506 * @ingroup sorting_algorithms
3507 * @param first Start of range.
3508 * @param last End of range.
3509 * @return False if wrapped to first permutation, true otherwise.
3510 *
3511 * Treats all permutations of the range as a set of @a dictionary sorted
3512 * sequences. Permutes the current sequence into the next one of this set.
3513 * Returns true if there are more sequences to generate. If the sequence
3514 * is the largest of the set, the smallest is generated and false returned.
3515 */
3517 bool
3519 _BidirectionalIterator __last)
3520 {
3521 // concept requirements
3523 _BidirectionalIterator>)
3538 {
3542 {
3545 {}
3549 }
3551 {
3554 }
3555 }
3556 }
3558 /**
3559 * @brief Permute range into the next @a dictionary ordering using
3560 * comparison functor.
3561 * @ingroup sorting_algorithms
3562 * @param first Start of range.
3563 * @param last End of range.
3564 * @param comp A comparison functor.
3565 * @return False if wrapped to first permutation, true otherwise.
3566 *
3567 * Treats all permutations of the range [first,last) as a set of
3568 * @a dictionary sorted sequences ordered by @a comp. Permutes the current
3569 * sequence into the next one of this set. Returns true if there are more
3570 * sequences to generate. If the sequence is the largest of the set, the
3571 * smallest is generated and false returned.
3572 */
3574 bool
3577 {
3578 // concept requirements
3580 _BidirectionalIterator>)
3596 {
3600 {
3603 {}
3607 }
3609 {
3612 }
3613 }
3614 }
3616 /**
3617 * @brief Permute range into the previous @a dictionary ordering.
3618 * @ingroup sorting_algorithms
3619 * @param first Start of range.
3620 * @param last End of range.
3621 * @return False if wrapped to last permutation, true otherwise.
3622 *
3623 * Treats all permutations of the range as a set of @a dictionary sorted
3624 * sequences. Permutes the current sequence into the previous one of this
3625 * set. Returns true if there are more sequences to generate. If the
3626 * sequence is the smallest of the set, the largest is generated and false
3627 * returned.
3628 */
3630 bool
3632 _BidirectionalIterator __last)
3633 {
3634 // concept requirements
3636 _BidirectionalIterator>)
3651 {
3655 {
3658 {}
3662 }
3664 {
3667 }
3668 }
3669 }
3671 /**
3672 * @brief Permute range into the previous @a dictionary ordering using
3673 * comparison functor.
3674 * @ingroup sorting_algorithms
3675 * @param first Start of range.
3676 * @param last End of range.
3677 * @param comp A comparison functor.
3678 * @return False if wrapped to last permutation, true otherwise.
3679 *
3680 * Treats all permutations of the range [first,last) as a set of
3681 * @a dictionary sorted sequences ordered by @a comp. Permutes the current
3682 * sequence into the previous one of this set. Returns true if there are
3683 * more sequences to generate. If the sequence is the smallest of the set,
3684 * the largest is generated and false returned.
3685 */
3687 bool
3690 {
3691 // concept requirements
3693 _BidirectionalIterator>)
3709 {
3713 {
3716 {}
3720 }
3722 {
3725 }
3726 }
3727 }
3729 // replace
3730 // replace_if
3732 /**
3733 * @brief Copy a sequence, replacing each element of one value with another
3734 * value.
3735 * @param first An input iterator.
3736 * @param last An input iterator.
3737 * @param result An output iterator.
3738 * @param old_value The value to be replaced.
3739 * @param new_value The replacement value.
3740 * @return The end of the output sequence, @p result+(last-first).
3741 *
3742 * Copies each element in the input range @p [first,last) to the
3743 * output range @p [result,result+(last-first)) replacing elements
3744 * equal to @p old_value with @p new_value.
3745 */
3747 _OutputIterator
3749 _OutputIterator __result,
3751 {
3752 // concept requirements
3763 else
3766 }
3768 /**
3769 * @brief Copy a sequence, replacing each value for which a predicate
3770 * returns true with another value.
3771 * @ingroup mutating_algorithms
3772 * @param first An input iterator.
3773 * @param last An input iterator.
3774 * @param result An output iterator.
3775 * @param pred A predicate.
3776 * @param new_value The replacement value.
3777 * @return The end of the output sequence, @p result+(last-first).
3778 *
3779 * Copies each element in the range @p [first,last) to the range
3780 * @p [result,result+(last-first)) replacing elements for which
3781 * @p pred returns true with @p new_value.
3782 */
3785 _OutputIterator
3787 _OutputIterator __result,
3789 {
3790 // concept requirements
3801 else
3804 }
3806 #ifdef __GXX_EXPERIMENTAL_CXX0X__
3807 /**
3808 * @brief Determines whether the elements of a sequence are sorted.
3809 * @ingroup sorting_algorithms
3810 * @param first An iterator.
3811 * @param last Another iterator.
3812 * @return True if the elements are sorted, false otherwise.
3813 */
3819 /**
3820 * @brief Determines whether the elements of a sequence are sorted
3821 * according to a comparison functor.
3822 * @ingroup sorting_algorithms
3823 * @param first An iterator.
3824 * @param last Another iterator.
3825 * @param comp A comparison functor.
3826 * @return True if the elements are sorted, false otherwise.
3827 */
3831 _Compare __comp)
3834 /**
3835 * @brief Determines the end of a sorted sequence.
3836 * @ingroup sorting_algorithms
3837 * @param first An iterator.
3838 * @param last Another iterator.
3839 * @return An iterator pointing to the last iterator i in [first, last)
3840 * for which the range [first, i) is sorted.
3841 */
3843 _ForwardIterator
3845 {
3846 // concept requirements
3860 }
3862 /**
3863 * @brief Determines the end of a sorted sequence using comparison functor.
3864 * @ingroup sorting_algorithms
3865 * @param first An iterator.
3866 * @param last Another iterator.
3867 * @param comp A comparison functor.
3868 * @return An iterator pointing to the last iterator i in [first, last)
3869 * for which the range [first, i) is sorted.
3870 */
3872 _ForwardIterator
3874 _Compare __comp)
3875 {
3876 // concept requirements
3891 }
3893 /**
3894 * @brief Determines min and max at once as an ordered pair.
3895 * @ingroup sorting_algorithms
3896 * @param a A thing of arbitrary type.
3897 * @param b Another thing of arbitrary type.
3898 * @return A pair(b, a) if b is smaller than a, pair(a, b) otherwise.
3899 */
3903 {
3904 // concept requirements
3909 }
3911 /**
3912 * @brief Determines min and max at once as an ordered pair.
3913 * @ingroup sorting_algorithms
3914 * @param a A thing of arbitrary type.
3915 * @param b Another thing of arbitrary type.
3916 * @param comp A @link comparison_functor comparison functor@endlink.
3917 * @return A pair(b, a) if b is smaller than a, pair(a, b) otherwise.
3918 */
3922 {
3925 }
3927 /**
3928 * @brief Return a pair of iterators pointing to the minimum and maximum
3929 * elements in a range.
3930 * @ingroup sorting_algorithms
3931 * @param first Start of range.
3932 * @param last End of range.
3933 * @return make_pair(m, M), where m is the first iterator i in
3934 * [first, last) such that no other element in the range is
3935 * smaller, and where M is the last iterator i in [first, last)
3936 * such that no other element in the range is larger.
3937 */
3941 {
3942 // concept requirements
3955 {
3958 }
3959 else
3960 {
3963 }
3969 {
3972 {
3978 }
3981 {
3986 }
3987 else
3988 {
3993 }
3997 }
4000 }
4002 /**
4003 * @brief Return a pair of iterators pointing to the minimum and maximum
4004 * elements in a range.
4005 * @ingroup sorting_algorithms
4006 * @param first Start of range.
4007 * @param last End of range.
4008 * @param comp Comparison functor.
4009 * @return make_pair(m, M), where m is the first iterator i in
4010 * [first, last) such that no other element in the range is
4011 * smaller, and where M is the last iterator i in [first, last)
4012 * such that no other element in the range is larger.
4013 */
4017 _Compare __comp)
4018 {
4019 // concept requirements
4033 {
4036 }
4037 else
4038 {
4041 }
4047 {
4050 {
4056 }
4059 {
4064 }
4065 else
4066 {
4071 }
4075 }
4078 }
4080 // N2722 + DR 915.
4082 inline _Tp
4087 inline _Tp
4092 inline _Tp
4097 inline _Tp
4104 {
4108 }
4113 {
4117 }
4119 #ifdef _GLIBCXX_USE_C99_STDINT_TR1
4120 /**
4121 * @brief Shuffle the elements of a sequence using a uniform random
4122 * number generator.
4123 * @ingroup mutating_algorithms
4124 * @param first A forward iterator.
4125 * @param last A forward iterator.
4126 * @param g A UniformRandomNumberGenerator (26.5.1.3).
4127 * @return Nothing.
4128 *
4129 * Reorders the elements in the range @p [first,last) using @p g to
4130 * provide random numbers.
4131 */
4133 typename _UniformRandomNumberGenerator>
4134 void
4137 {
4138 // concept requirements
4140 _RandomAccessIterator>)
4147 _DistanceType;
4152 __distr_type __d;
4156 }
4157 #endif
4161 _GLIBCXX_END_NAMESPACE
4165 /**
4166 * @brief Apply a function to every element of a sequence.
4167 * @ingroup non_mutating_algorithms
4168 * @param first An input iterator.
4169 * @param last An input iterator.
4170 * @param f A unary function object.
4171 * @return @p f (std::move(@p f) in C++0x).
4172 *
4173 * Applies the function object @p f to each element in the range
4174 * @p [first,last). @p f must not modify the order of the sequence.
4175 * If @p f has a return value it is ignored.
4176 */
4178 _Function
4180 {
4181 // concept requirements
4187 }
4189 /**
4190 * @brief Find the first occurrence of a value in a sequence.
4191 * @ingroup non_mutating_algorithms
4192 * @param first An input iterator.
4193 * @param last An input iterator.
4194 * @param val The value to find.
4195 * @return The first iterator @c i in the range @p [first,last)
4196 * such that @c *i == @p val, or @p last if no such iterator exists.
4197 */
4199 inline _InputIterator
4202 {
4203 // concept requirements
4210 }
4212 /**
4213 * @brief Find the first element in a sequence for which a
4214 * predicate is true.
4215 * @ingroup non_mutating_algorithms
4216 * @param first An input iterator.
4217 * @param last An input iterator.
4218 * @param pred A predicate.
4219 * @return The first iterator @c i in the range @p [first,last)
4220 * such that @p pred(*i) is true, or @p last if no such iterator exists.
4221 */
4223 inline _InputIterator
4225 _Predicate __pred)
4226 {
4227 // concept requirements
4234 }
4236 /**
4237 * @brief Find element from a set in a sequence.
4238 * @ingroup non_mutating_algorithms
4239 * @param first1 Start of range to search.
4240 * @param last1 End of range to search.
4241 * @param first2 Start of match candidates.
4242 * @param last2 End of match candidates.
4243 * @return The first iterator @c i in the range
4244 * @p [first1,last1) such that @c *i == @p *(i2) such that i2 is an
4245 * iterator in [first2,last2), or @p last1 if no such iterator exists.
4246 *
4247 * Searches the range @p [first1,last1) for an element that is equal to
4248 * some element in the range [first2,last2). If found, returns an iterator
4249 * in the range [first1,last1), otherwise returns @p last1.
4250 */
4252 _InputIterator
4255 {
4256 // concept requirements
4270 }
4272 /**
4273 * @brief Find element from a set in a sequence using a predicate.
4274 * @ingroup non_mutating_algorithms
4275 * @param first1 Start of range to search.
4276 * @param last1 End of range to search.
4277 * @param first2 Start of match candidates.
4278 * @param last2 End of match candidates.
4279 * @param comp Predicate to use.
4280 * @return The first iterator @c i in the range
4281 * @p [first1,last1) such that @c comp(*i, @p *(i2)) is true and i2 is an
4282 * iterator in [first2,last2), or @p last1 if no such iterator exists.
4283 *
4285 * Searches the range @p [first1,last1) for an element that is
4286 * equal to some element in the range [first2,last2). If found,
4287 * returns an iterator in the range [first1,last1), otherwise
4288 * returns @p last1.
4289 */
4291 typename _BinaryPredicate>
4292 _InputIterator
4295 _BinaryPredicate __comp)
4296 {
4297 // concept requirements
4311 }
4313 /**
4314 * @brief Find two adjacent values in a sequence that are equal.
4315 * @ingroup non_mutating_algorithms
4316 * @param first A forward iterator.
4317 * @param last A forward iterator.
4318 * @return The first iterator @c i such that @c i and @c i+1 are both
4319 * valid iterators in @p [first,last) and such that @c *i == @c *(i+1),
4320 * or @p last if no such iterator exists.
4321 */
4323 _ForwardIterator
4325 {
4326 // concept requirements
4335 {
4339 }
4341 }
4343 /**
4344 * @brief Find two adjacent values in a sequence using a predicate.
4345 * @ingroup non_mutating_algorithms
4346 * @param first A forward iterator.
4347 * @param last A forward iterator.
4348 * @param binary_pred A binary predicate.
4349 * @return The first iterator @c i such that @c i and @c i+1 are both
4350 * valid iterators in @p [first,last) and such that
4351 * @p binary_pred(*i,*(i+1)) is true, or @p last if no such iterator
4352 * exists.
4353 */
4355 _ForwardIterator
4357 _BinaryPredicate __binary_pred)
4358 {
4359 // concept requirements
4369 {
4373 }
4375 }
4377 /**
4378 * @brief Count the number of copies of a value in a sequence.
4379 * @ingroup non_mutating_algorithms
4380 * @param first An input iterator.
4381 * @param last An input iterator.
4382 * @param value The value to be counted.
4383 * @return The number of iterators @c i in the range @p [first,last)
4384 * for which @c *i == @p value
4385 */
4389 {
4390 // concept requirements
4400 }
4402 /**
4403 * @brief Count the elements of a sequence for which a predicate is true.
4404 * @ingroup non_mutating_algorithms
4405 * @param first An input iterator.
4406 * @param last An input iterator.
4407 * @param pred A predicate.
4408 * @return The number of iterators @c i in the range @p [first,last)
4409 * for which @p pred(*i) is true.
4410 */
4414 {
4415 // concept requirements
4425 }
4427 /**
4428 * @brief Search a sequence for a matching sub-sequence.
4429 * @ingroup non_mutating_algorithms
4430 * @param first1 A forward iterator.
4431 * @param last1 A forward iterator.
4432 * @param first2 A forward iterator.
4433 * @param last2 A forward iterator.
4434 * @return The first iterator @c i in the range
4435 * @p [first1,last1-(last2-first2)) such that @c *(i+N) == @p *(first2+N)
4436 * for each @c N in the range @p [0,last2-first2), or @p last1 if no
4437 * such iterator exists.
4438 *
4439 * Searches the range @p [first1,last1) for a sub-sequence that compares
4440 * equal value-by-value with the sequence given by @p [first2,last2) and
4441 * returns an iterator to the first element of the sub-sequence, or
4442 * @p last1 if the sub-sequence is not found.
4443 *
4444 * Because the sub-sequence must lie completely within the range
4445 * @p [first1,last1) it must start at a position less than
4446 * @p last1-(last2-first2) where @p last2-first2 is the length of the
4447 * sub-sequence.
4448 * This means that the returned iterator @c i will be in the range
4449 * @p [first1,last1-(last2-first2))
4450 */
4452 _ForwardIterator1
4455 {
4456 // concept requirements
4465 // Test for empty ranges
4469 // Test for a pattern of length 1.
4474 // General case.
4475 _ForwardIterator2 __p;
4479 {
4490 {
4495 }
4497 }
4499 }
4501 /**
4502 * @brief Search a sequence for a matching sub-sequence using a predicate.
4503 * @ingroup non_mutating_algorithms
4504 * @param first1 A forward iterator.
4505 * @param last1 A forward iterator.
4506 * @param first2 A forward iterator.
4507 * @param last2 A forward iterator.
4508 * @param predicate A binary predicate.
4509 * @return The first iterator @c i in the range
4510 * @p [first1,last1-(last2-first2)) such that
4511 * @p predicate(*(i+N),*(first2+N)) is true for each @c N in the range
4512 * @p [0,last2-first2), or @p last1 if no such iterator exists.
4513 *
4514 * Searches the range @p [first1,last1) for a sub-sequence that compares
4515 * equal value-by-value with the sequence given by @p [first2,last2),
4516 * using @p predicate to determine equality, and returns an iterator
4517 * to the first element of the sub-sequence, or @p last1 if no such
4518 * iterator exists.
4519 *
4520 * @see search(_ForwardIter1, _ForwardIter1, _ForwardIter2, _ForwardIter2)
4521 */
4523 typename _BinaryPredicate>
4524 _ForwardIterator1
4527 _BinaryPredicate __predicate)
4528 {
4529 // concept requirements
4538 // Test for empty ranges
4542 // Test for a pattern of length 1.
4545 {
4550 }
4552 // General case.
4553 _ForwardIterator2 __p;
4557 {
4570 {
4575 }
4577 }
4579 }
4582 /**
4583 * @brief Search a sequence for a number of consecutive values.
4584 * @ingroup non_mutating_algorithms
4585 * @param first A forward iterator.
4586 * @param last A forward iterator.
4587 * @param count The number of consecutive values.
4588 * @param val The value to find.
4589 * @return The first iterator @c i in the range @p [first,last-count)
4590 * such that @c *(i+N) == @p val for each @c N in the range @p [0,count),
4591 * or @p last if no such iterator exists.
4592 *
4593 * Searches the range @p [first,last) for @p count consecutive elements
4594 * equal to @p val.
4595 */
4597 _ForwardIterator
4600 {
4601 // concept requirements
4613 }
4616 /**
4617 * @brief Search a sequence for a number of consecutive values using a
4618 * predicate.
4619 * @ingroup non_mutating_algorithms
4620 * @param first A forward iterator.
4621 * @param last A forward iterator.
4622 * @param count The number of consecutive values.
4623 * @param val The value to find.
4624 * @param binary_pred A binary predicate.
4625 * @return The first iterator @c i in the range @p [first,last-count)
4626 * such that @p binary_pred(*(i+N),val) is true for each @c N in the
4627 * range @p [0,count), or @p last if no such iterator exists.
4628 *
4629 * Searches the range @p [first,last) for @p count consecutive elements
4630 * for which the predicate returns true.
4631 */
4633 typename _BinaryPredicate>
4634 _ForwardIterator
4637 _BinaryPredicate __binary_pred)
4638 {
4639 // concept requirements
4648 {
4652 }
4655 }
4658 /**
4659 * @brief Perform an operation on a sequence.
4660 * @ingroup mutating_algorithms
4661 * @param first An input iterator.
4662 * @param last An input iterator.
4663 * @param result An output iterator.
4664 * @param unary_op A unary operator.
4665 * @return An output iterator equal to @p result+(last-first).
4666 *
4667 * Applies the operator to each element in the input range and assigns
4668 * the results to successive elements of the output sequence.
4669 * Evaluates @p *(result+N)=unary_op(*(first+N)) for each @c N in the
4670 * range @p [0,last-first).
4671 *
4672 * @p unary_op must not alter its argument.
4673 */
4675 typename _UnaryOperation>
4676 _OutputIterator
4679 {
4680 // concept requirements
4683 // "the type returned by a _UnaryOperation"
4690 }
4692 /**
4693 * @brief Perform an operation on corresponding elements of two sequences.
4694 * @ingroup mutating_algorithms
4695 * @param first1 An input iterator.
4696 * @param last1 An input iterator.
4697 * @param first2 An input iterator.
4698 * @param result An output iterator.
4699 * @param binary_op A binary operator.
4700 * @return An output iterator equal to @p result+(last-first).
4701 *
4702 * Applies the operator to the corresponding elements in the two
4703 * input ranges and assigns the results to successive elements of the
4704 * output sequence.
4705 * Evaluates @p *(result+N)=binary_op(*(first1+N),*(first2+N)) for each
4706 * @c N in the range @p [0,last1-first1).
4707 *
4708 * @p binary_op must not alter either of its arguments.
4709 */
4712 _OutputIterator
4715 _BinaryOperation __binary_op)
4716 {
4717 // concept requirements
4721 // "the type returned by a _BinaryOperation"
4728 }
4730 /**
4731 * @brief Replace each occurrence of one value in a sequence with another
4732 * value.
4733 * @ingroup mutating_algorithms
4734 * @param first A forward iterator.
4735 * @param last A forward iterator.
4736 * @param old_value The value to be replaced.
4737 * @param new_value The replacement value.
4738 * @return replace() returns no value.
4739 *
4740 * For each iterator @c i in the range @p [first,last) if @c *i ==
4741 * @p old_value then the assignment @c *i = @p new_value is performed.
4742 */
4744 void
4747 {
4748 // concept requirements
4750 _ForwardIterator>)
4760 }
4762 /**
4763 * @brief Replace each value in a sequence for which a predicate returns
4764 * true with another value.
4765 * @ingroup mutating_algorithms
4766 * @param first A forward iterator.
4767 * @param last A forward iterator.
4768 * @param pred A predicate.
4769 * @param new_value The replacement value.
4770 * @return replace_if() returns no value.
4771 *
4772 * For each iterator @c i in the range @p [first,last) if @p pred(*i)
4773 * is true then the assignment @c *i = @p new_value is performed.
4774 */
4776 void
4779 {
4780 // concept requirements
4782 _ForwardIterator>)
4792 }
4794 /**
4795 * @brief Assign the result of a function object to each value in a
4796 * sequence.
4797 * @ingroup mutating_algorithms
4798 * @param first A forward iterator.
4799 * @param last A forward iterator.
4800 * @param gen A function object taking no arguments and returning
4801 * std::iterator_traits<_ForwardIterator>::value_type
4802 * @return generate() returns no value.
4803 *
4804 * Performs the assignment @c *i = @p gen() for each @c i in the range
4805 * @p [first,last).
4806 */
4808 void
4810 _Generator __gen)
4811 {
4812 // concept requirements
4820 }
4822 /**
4823 * @brief Assign the result of a function object to each value in a
4824 * sequence.
4825 * @ingroup mutating_algorithms
4826 * @param first A forward iterator.
4827 * @param n The length of the sequence.
4828 * @param gen A function object taking no arguments and returning
4829 * std::iterator_traits<_ForwardIterator>::value_type
4830 * @return The end of the sequence, @p first+n
4831 *
4832 * Performs the assignment @c *i = @p gen() for each @c i in the range
4833 * @p [first,first+n).
4834 *
4835 * _GLIBCXX_RESOLVE_LIB_DEFECTS
4836 * DR 865. More algorithms that throw away information
4837 */
4839 _OutputIterator
4841 {
4842 // concept requirements
4844 // "the type returned by a _Generator"
4850 }
4853 /**
4854 * @brief Copy a sequence, removing consecutive duplicate values.
4855 * @ingroup mutating_algorithms
4856 * @param first An input iterator.
4857 * @param last An input iterator.
4858 * @param result An output iterator.
4859 * @return An iterator designating the end of the resulting sequence.
4860 *
4861 * Copies each element in the range @p [first,last) to the range
4862 * beginning at @p result, except that only the first element is copied
4863 * from groups of consecutive elements that compare equal.
4864 * unique_copy() is stable, so the relative order of elements that are
4865 * copied is unchanged.
4866 *
4867 * _GLIBCXX_RESOLVE_LIB_DEFECTS
4868 * DR 241. Does unique_copy() require CopyConstructible and Assignable?
4869 *
4870 * _GLIBCXX_RESOLVE_LIB_DEFECTS
4871 * DR 538. 241 again: Does unique_copy() require CopyConstructible and
4872 * Assignable?
4873 */
4875 inline _OutputIterator
4877 _OutputIterator __result)
4878 {
4879 // concept requirements
4892 }
4894 /**
4895 * @brief Copy a sequence, removing consecutive values using a predicate.
4896 * @ingroup mutating_algorithms
4897 * @param first An input iterator.
4898 * @param last An input iterator.
4899 * @param result An output iterator.
4900 * @param binary_pred A binary predicate.
4901 * @return An iterator designating the end of the resulting sequence.
4902 *
4903 * Copies each element in the range @p [first,last) to the range
4904 * beginning at @p result, except that only the first element is copied
4905 * from groups of consecutive elements for which @p binary_pred returns
4906 * true.
4907 * unique_copy() is stable, so the relative order of elements that are
4908 * copied is unchanged.
4909 *
4910 * _GLIBCXX_RESOLVE_LIB_DEFECTS
4911 * DR 241. Does unique_copy() require CopyConstructible and Assignable?
4912 */
4914 typename _BinaryPredicate>
4915 inline _OutputIterator
4917 _OutputIterator __result,
4918 _BinaryPredicate __binary_pred)
4919 {
4920 // concept requirements -- predicates checked later
4931 }
4934 /**
4935 * @brief Randomly shuffle the elements of a sequence.
4936 * @ingroup mutating_algorithms
4937 * @param first A forward iterator.
4938 * @param last A forward iterator.
4939 * @return Nothing.
4940 *
4941 * Reorder the elements in the range @p [first,last) using a random
4942 * distribution, so that every possible ordering of the sequence is
4943 * equally likely.
4944 */
4948 {
4949 // concept requirements
4951 _RandomAccessIterator>)
4957 }
4959 /**
4960 * @brief Shuffle the elements of a sequence using a random number
4961 * generator.
4962 * @ingroup mutating_algorithms
4963 * @param first A forward iterator.
4964 * @param last A forward iterator.
4965 * @param rand The RNG functor or function.
4966 * @return Nothing.
4967 *
4968 * Reorders the elements in the range @p [first,last) using @p rand to
4969 * provide a random distribution. Calling @p rand(N) for a positive
4970 * integer @p N should return a randomly chosen integer from the
4971 * range [0,N).
4972 */
4974 void
4976 #ifdef __GXX_EXPERIMENTAL_CXX0X__
4978 #else
4980 #endif
4981 {
4982 // concept requirements
4984 _RandomAccessIterator>)
4991 }
4994 /**
4995 * @brief Move elements for which a predicate is true to the beginning
4996 * of a sequence.
4997 * @ingroup mutating_algorithms
4998 * @param first A forward iterator.
4999 * @param last A forward iterator.
5000 * @param pred A predicate functor.
5001 * @return An iterator @p middle such that @p pred(i) is true for each
5002 * iterator @p i in the range @p [first,middle) and false for each @p i
5003 * in the range @p [middle,last).
5004 *
5005 * @p pred must not modify its operand. @p partition() does not preserve
5006 * the relative ordering of elements in each group, use
5007 * @p stable_partition() if this is needed.
5008 */
5010 inline _ForwardIterator
5012 _Predicate __pred)
5013 {
5014 // concept requirements
5016 _ForwardIterator>)
5023 }
5027 /**
5028 * @brief Sort the smallest elements of a sequence.
5029 * @ingroup sorting_algorithms
5030 * @param first An iterator.
5031 * @param middle Another iterator.
5032 * @param last Another iterator.
5033 * @return Nothing.
5034 *
5035 * Sorts the smallest @p (middle-first) elements in the range
5036 * @p [first,last) and moves them to the range @p [first,middle). The
5037 * order of the remaining elements in the range @p [middle,last) is
5038 * undefined.
5039 * After the sort if @p i and @j are iterators in the range
5040 * @p [first,middle) such that @i precedes @j and @k is an iterator in
5041 * the range @p [middle,last) then @p *j<*i and @p *k<*i are both false.
5042 */
5046 _RandomAccessIterator __middle,
5047 _RandomAccessIterator __last)
5048 {
5050 _ValueType;
5052 // concept requirements
5054 _RandomAccessIterator>)
5061 }
5063 /**
5064 * @brief Sort the smallest elements of a sequence using a predicate
5065 * for comparison.
5066 * @ingroup sorting_algorithms
5067 * @param first An iterator.
5068 * @param middle Another iterator.
5069 * @param last Another iterator.
5070 * @param comp A comparison functor.
5071 * @return Nothing.
5072 *
5073 * Sorts the smallest @p (middle-first) elements in the range
5074 * @p [first,last) and moves them to the range @p [first,middle). The
5075 * order of the remaining elements in the range @p [middle,last) is
5076 * undefined.
5077 * After the sort if @p i and @j are iterators in the range
5078 * @p [first,middle) such that @i precedes @j and @k is an iterator in
5079 * the range @p [middle,last) then @p *comp(j,*i) and @p comp(*k,*i)
5080 * are both false.
5081 */
5085 _RandomAccessIterator __middle,
5086 _RandomAccessIterator __last,
5087 _Compare __comp)
5088 {
5090 _ValueType;
5092 // concept requirements
5094 _RandomAccessIterator>)
5102 }
5104 /**
5105 * @brief Sort a sequence just enough to find a particular position.
5106 * @ingroup sorting_algorithms
5107 * @param first An iterator.
5108 * @param nth Another iterator.
5109 * @param last Another iterator.
5110 * @return Nothing.
5111 *
5112 * Rearranges the elements in the range @p [first,last) so that @p *nth
5113 * is the same element that would have been in that position had the
5114 * whole sequence been sorted.
5115 * whole sequence been sorted. The elements either side of @p *nth are
5116 * not completely sorted, but for any iterator @i in the range
5117 * @p [first,nth) and any iterator @j in the range @p [nth,last) it
5118 * holds that @p *j<*i is false.
5119 */
5123 _RandomAccessIterator __last)
5124 {
5126 _ValueType;
5128 // concept requirements
5130 _RandomAccessIterator>)
5140 }
5142 /**
5143 * @brief Sort a sequence just enough to find a particular position
5144 * using a predicate for comparison.
5145 * @ingroup sorting_algorithms
5146 * @param first An iterator.
5147 * @param nth Another iterator.
5148 * @param last Another iterator.
5149 * @param comp A comparison functor.
5150 * @return Nothing.
5151 *
5152 * Rearranges the elements in the range @p [first,last) so that @p *nth
5153 * is the same element that would have been in that position had the
5154 * whole sequence been sorted. The elements either side of @p *nth are
5155 * not completely sorted, but for any iterator @i in the range
5156 * @p [first,nth) and any iterator @j in the range @p [nth,last) it
5157 * holds that @p comp(*j,*i) is false.
5158 */
5163 {
5165 _ValueType;
5167 // concept requirements
5169 _RandomAccessIterator>)
5180 }
5183 /**
5184 * @brief Sort the elements of a sequence.
5185 * @ingroup sorting_algorithms
5186 * @param first An iterator.
5187 * @param last Another iterator.
5188 * @return Nothing.
5189 *
5190 * Sorts the elements in the range @p [first,last) in ascending order,
5191 * such that @p *(i+1)<*i is false for each iterator @p i in the range
5192 * @p [first,last-1).
5193 *
5194 * The relative ordering of equivalent elements is not preserved, use
5195 * @p stable_sort() if this is needed.
5196 */
5200 {
5202 _ValueType;
5204 // concept requirements
5206 _RandomAccessIterator>)
5211 {
5215 }
5216 }
5218 /**
5219 * @brief Sort the elements of a sequence using a predicate for comparison.
5220 * @ingroup sorting_algorithms
5221 * @param first An iterator.
5222 * @param last Another iterator.
5223 * @param comp A comparison functor.
5224 * @return Nothing.
5225 *
5226 * Sorts the elements in the range @p [first,last) in ascending order,
5227 * such that @p comp(*(i+1),*i) is false for every iterator @p i in the
5228 * range @p [first,last-1).
5229 *
5230 * The relative ordering of equivalent elements is not preserved, use
5231 * @p stable_sort() if this is needed.
5232 */
5236 _Compare __comp)
5237 {
5239 _ValueType;
5241 // concept requirements
5243 _RandomAccessIterator>)
5245 _ValueType>)
5249 {
5253 }
5254 }
5256 /**
5257 * @brief Merges two sorted ranges.
5258 * @ingroup sorting_algorithms
5259 * @param first1 An iterator.
5260 * @param first2 Another iterator.
5261 * @param last1 Another iterator.
5262 * @param last2 Another iterator.
5263 * @param result An iterator pointing to the end of the merged range.
5264 * @return An iterator pointing to the first element <em>not less
5265 * than</em> @a val.
5266 *
5267 * Merges the ranges [first1,last1) and [first2,last2) into the sorted range
5268 * [result, result + (last1-first1) + (last2-first2)). Both input ranges
5269 * must be sorted, and the output range must not overlap with either of
5270 * the input ranges. The sort is @e stable, that is, for equivalent
5271 * elements in the two ranges, elements from the first range will always
5272 * come before elements from the second.
5273 */
5275 typename _OutputIterator>
5276 _OutputIterator
5279 _OutputIterator __result)
5280 {
5282 _ValueType1;
5284 _ValueType2;
5286 // concept requirements
5290 _ValueType1>)
5292 _ValueType2>)
5298 {
5300 {
5303 }
5304 else
5305 {
5308 }
5310 }
5312 __result));
5313 }
5315 /**
5316 * @brief Merges two sorted ranges.
5317 * @ingroup sorting_algorithms
5318 * @param first1 An iterator.
5319 * @param first2 Another iterator.
5320 * @param last1 Another iterator.
5321 * @param last2 Another iterator.
5322 * @param result An iterator pointing to the end of the merged range.
5323 * @param comp A functor to use for comparisons.
5324 * @return An iterator pointing to the first element "not less
5325 * than" @a val.
5326 *
5327 * Merges the ranges [first1,last1) and [first2,last2) into the sorted range
5328 * [result, result + (last1-first1) + (last2-first2)). Both input ranges
5329 * must be sorted, and the output range must not overlap with either of
5330 * the input ranges. The sort is @e stable, that is, for equivalent
5331 * elements in the two ranges, elements from the first range will always
5332 * come before elements from the second.
5333 *
5334 * The comparison function should have the same effects on ordering as
5335 * the function used for the initial sort.
5336 */
5339 _OutputIterator
5343 {
5345 _ValueType1;
5347 _ValueType2;
5349 // concept requirements
5353 _ValueType1>)
5355 _ValueType2>)
5362 {
5364 {
5367 }
5368 else
5369 {
5372 }
5374 }
5376 __result));
5377 }
5380 /**
5381 * @brief Sort the elements of a sequence, preserving the relative order
5382 * of equivalent elements.
5383 * @ingroup sorting_algorithms
5384 * @param first An iterator.
5385 * @param last Another iterator.
5386 * @return Nothing.
5387 *
5388 * Sorts the elements in the range @p [first,last) in ascending order,
5389 * such that @p *(i+1)<*i is false for each iterator @p i in the range
5390 * @p [first,last-1).
5391 *
5392 * The relative ordering of equivalent elements is preserved, so any two
5393 * elements @p x and @p y in the range @p [first,last) such that
5394 * @p x<y is false and @p y<x is false will have the same relative
5395 * ordering after calling @p stable_sort().
5396 */
5400 {
5402 _ValueType;
5404 _DistanceType;
5406 // concept requirements
5408 _RandomAccessIterator>)
5413 __last);
5416 else
5419 }
5421 /**
5422 * @brief Sort the elements of a sequence using a predicate for comparison,
5423 * preserving the relative order of equivalent elements.
5424 * @ingroup sorting_algorithms
5425 * @param first An iterator.
5426 * @param last Another iterator.
5427 * @param comp A comparison functor.
5428 * @return Nothing.
5429 *
5430 * Sorts the elements in the range @p [first,last) in ascending order,
5431 * such that @p comp(*(i+1),*i) is false for each iterator @p i in the
5432 * range @p [first,last-1).
5433 *
5434 * The relative ordering of equivalent elements is preserved, so any two
5435 * elements @p x and @p y in the range @p [first,last) such that
5436 * @p comp(x,y) is false and @p comp(y,x) is false will have the same
5437 * relative ordering after calling @p stable_sort().
5438 */
5442 _Compare __comp)
5443 {
5445 _ValueType;
5447 _DistanceType;
5449 // concept requirements
5451 _RandomAccessIterator>)
5453 _ValueType,
5454 _ValueType>)
5458 __last);
5461 else
5464 }
5467 /**
5468 * @brief Return the union of two sorted ranges.
5469 * @ingroup set_algorithms
5470 * @param first1 Start of first range.
5471 * @param last1 End of first range.
5472 * @param first2 Start of second range.
5473 * @param last2 End of second range.
5474 * @return End of the output range.
5475 * @ingroup set_algorithms
5476 *
5477 * This operation iterates over both ranges, copying elements present in
5478 * each range in order to the output range. Iterators increment for each
5479 * range. When the current element of one range is less than the other,
5480 * that element is copied and the iterator advanced. If an element is
5481 * contained in both ranges, the element from the first range is copied and
5482 * both ranges advance. The output range may not overlap either input
5483 * range.
5484 */
5486 typename _OutputIterator>
5487 _OutputIterator
5490 _OutputIterator __result)
5491 {
5493 _ValueType1;
5495 _ValueType2;
5497 // concept requirements
5501 _ValueType1>)
5503 _ValueType2>)
5510 {
5512 {
5515 }
5517 {
5520 }
5521 else
5522 {
5526 }
5528 }
5530 __result));
5531 }
5533 /**
5534 * @brief Return the union of two sorted ranges using a comparison functor.
5535 * @ingroup set_algorithms
5536 * @param first1 Start of first range.
5537 * @param last1 End of first range.
5538 * @param first2 Start of second range.
5539 * @param last2 End of second range.
5540 * @param comp The comparison functor.
5541 * @return End of the output range.
5542 * @ingroup set_algorithms
5543 *
5544 * This operation iterates over both ranges, copying elements present in
5545 * each range in order to the output range. Iterators increment for each
5546 * range. When the current element of one range is less than the other
5547 * according to @a comp, that element is copied and the iterator advanced.
5548 * If an equivalent element according to @a comp is contained in both
5549 * ranges, the element from the first range is copied and both ranges
5550 * advance. The output range may not overlap either input range.
5551 */
5554 _OutputIterator
5558 {
5560 _ValueType1;
5562 _ValueType2;
5564 // concept requirements
5568 _ValueType1>)
5570 _ValueType2>)
5579 {
5581 {
5584 }
5586 {
5589 }
5590 else
5591 {
5595 }
5597 }
5599 __result));
5600 }
5602 /**
5603 * @brief Return the intersection of two sorted ranges.
5604 * @ingroup set_algorithms
5605 * @param first1 Start of first range.
5606 * @param last1 End of first range.
5607 * @param first2 Start of second range.
5608 * @param last2 End of second range.
5609 * @return End of the output range.
5610 * @ingroup set_algorithms
5611 *
5612 * This operation iterates over both ranges, copying elements present in
5613 * both ranges in order to the output range. Iterators increment for each
5614 * range. When the current element of one range is less than the other,
5615 * that iterator advances. If an element is contained in both ranges, the
5616 * element from the first range is copied and both ranges advance. The
5617 * output range may not overlap either input range.
5618 */
5620 typename _OutputIterator>
5621 _OutputIterator
5624 _OutputIterator __result)
5625 {
5627 _ValueType1;
5629 _ValueType2;
5631 // concept requirements
5635 _ValueType1>)
5646 else
5647 {
5652 }
5654 }
5656 /**
5657 * @brief Return the intersection of two sorted ranges using comparison
5658 * functor.
5659 * @ingroup set_algorithms
5660 * @param first1 Start of first range.
5661 * @param last1 End of first range.
5662 * @param first2 Start of second range.
5663 * @param last2 End of second range.
5664 * @param comp The comparison functor.
5665 * @return End of the output range.
5666 * @ingroup set_algorithms
5667 *
5668 * This operation iterates over both ranges, copying elements present in
5669 * both ranges in order to the output range. Iterators increment for each
5670 * range. When the current element of one range is less than the other
5671 * according to @a comp, that iterator advances. If an element is
5672 * contained in both ranges according to @a comp, the element from the
5673 * first range is copied and both ranges advance. The output range may not
5674 * overlap either input range.
5675 */
5678 _OutputIterator
5682 {
5684 _ValueType1;
5686 _ValueType2;
5688 // concept requirements
5692 _ValueType1>)
5705 else
5706 {
5711 }
5713 }
5715 /**
5716 * @brief Return the difference of two sorted ranges.
5717 * @ingroup set_algorithms
5718 * @param first1 Start of first range.
5719 * @param last1 End of first range.
5720 * @param first2 Start of second range.
5721 * @param last2 End of second range.
5722 * @return End of the output range.
5723 * @ingroup set_algorithms
5724 *
5725 * This operation iterates over both ranges, copying elements present in
5726 * the first range but not the second in order to the output range.
5727 * Iterators increment for each range. When the current element of the
5728 * first range is less than the second, that element is copied and the
5729 * iterator advances. If the current element of the second range is less,
5730 * the iterator advances, but no element is copied. If an element is
5731 * contained in both ranges, no elements are copied and both ranges
5732 * advance. The output range may not overlap either input range.
5733 */
5735 typename _OutputIterator>
5736 _OutputIterator
5739 _OutputIterator __result)
5740 {
5742 _ValueType1;
5744 _ValueType2;
5746 // concept requirements
5750 _ValueType1>)
5758 {
5762 }
5765 else
5766 {
5769 }
5771 }
5773 /**
5774 * @brief Return the difference of two sorted ranges using comparison
5775 * functor.
5776 * @ingroup set_algorithms
5777 * @param first1 Start of first range.
5778 * @param last1 End of first range.
5779 * @param first2 Start of second range.
5780 * @param last2 End of second range.
5781 * @param comp The comparison functor.
5782 * @return End of the output range.
5783 * @ingroup set_algorithms
5784 *
5785 * This operation iterates over both ranges, copying elements present in
5786 * the first range but not the second in order to the output range.
5787 * Iterators increment for each range. When the current element of the
5788 * first range is less than the second according to @a comp, that element
5789 * is copied and the iterator advances. If the current element of the
5790 * second range is less, no element is copied and the iterator advances.
5791 * If an element is contained in both ranges according to @a comp, no
5792 * elements are copied and both ranges advance. The output range may not
5793 * overlap either input range.
5794 */
5797 _OutputIterator
5801 {
5803 _ValueType1;
5805 _ValueType2;
5807 // concept requirements
5811 _ValueType1>)
5821 {
5825 }
5828 else
5829 {
5832 }
5834 }
5836 /**
5837 * @brief Return the symmetric difference of two sorted ranges.
5838 * @ingroup set_algorithms
5839 * @param first1 Start of first range.
5840 * @param last1 End of first range.
5841 * @param first2 Start of second range.
5842 * @param last2 End of second range.
5843 * @return End of the output range.
5844 * @ingroup set_algorithms
5845 *
5846 * This operation iterates over both ranges, copying elements present in
5847 * one range but not the other in order to the output range. Iterators
5848 * increment for each range. When the current element of one range is less
5849 * than the other, that element is copied and the iterator advances. If an
5850 * element is contained in both ranges, no elements are copied and both
5851 * ranges advance. The output range may not overlap either input range.
5852 */
5854 typename _OutputIterator>
5855 _OutputIterator
5858 _OutputIterator __result)
5859 {
5861 _ValueType1;
5863 _ValueType2;
5865 // concept requirements
5869 _ValueType1>)
5871 _ValueType2>)
5879 {
5883 }
5885 {
5889 }
5890 else
5891 {
5894 }
5897 }
5899 /**
5900 * @brief Return the symmetric difference of two sorted ranges using
5901 * comparison functor.
5902 * @ingroup set_algorithms
5903 * @param first1 Start of first range.
5904 * @param last1 End of first range.
5905 * @param first2 Start of second range.
5906 * @param last2 End of second range.
5907 * @param comp The comparison functor.
5908 * @return End of the output range.
5909 * @ingroup set_algorithms
5910 *
5911 * This operation iterates over both ranges, copying elements present in
5912 * one range but not the other in order to the output range. Iterators
5913 * increment for each range. When the current element of one range is less
5914 * than the other according to @a comp, that element is copied and the
5915 * iterator advances. If an element is contained in both ranges according
5916 * to @a comp, no elements are copied and both ranges advance. The output
5917 * range may not overlap either input range.
5918 */
5921 _OutputIterator
5924 _OutputIterator __result,
5925 _Compare __comp)
5926 {
5928 _ValueType1;
5930 _ValueType2;
5932 // concept requirements
5936 _ValueType1>)
5938 _ValueType2>)
5948 {
5952 }
5954 {
5958 }
5959 else
5960 {
5963 }
5966 }
5969 /**
5970 * @brief Return the minimum element in a range.
5971 * @ingroup sorting_algorithms
5972 * @param first Start of range.
5973 * @param last End of range.
5974 * @return Iterator referencing the first instance of the smallest value.
5975 */
5977 _ForwardIterator
5979 {
5980 // concept requirements
5993 }
5995 /**
5996 * @brief Return the minimum element in a range using comparison functor.
5997 * @ingroup sorting_algorithms
5998 * @param first Start of range.
5999 * @param last End of range.
6000 * @param comp Comparison functor.
6001 * @return Iterator referencing the first instance of the smallest value
6002 * according to comp.
6003 */
6005 _ForwardIterator
6007 _Compare __comp)
6008 {
6009 // concept requirements
6023 }
6025 /**
6026 * @brief Return the maximum element in a range.
6027 * @ingroup sorting_algorithms
6028 * @param first Start of range.
6029 * @param last End of range.
6030 * @return Iterator referencing the first instance of the largest value.
6031 */
6033 _ForwardIterator
6035 {
6036 // concept requirements
6049 }
6051 /**
6052 * @brief Return the maximum element in a range using comparison functor.
6053 * @ingroup sorting_algorithms
6054 * @param first Start of range.
6055 * @param last End of range.
6056 * @param comp Comparison functor.
6057 * @return Iterator referencing the first instance of the largest value
6058 * according to comp.
6059 */
6061 _ForwardIterator
6063 _Compare __comp)
6064 {
6065 // concept requirements
6078 }
6080 _GLIBCXX_END_NESTED_NAMESPACE