1 // Algorithm implementation -*- C++ -*-
3 // Copyright (C) 2001, 2002 Free Software Foundation, Inc.
5 // This file is part of the GNU ISO C++ Library. This library is free
6 // software; you can redistribute it and/or modify it under the
7 // terms of the GNU General Public License as published by the
8 // Free Software Foundation; either version 2, or (at your option)
11 // This library is distributed in the hope that it will be useful,
12 // but WITHOUT ANY WARRANTY; without even the implied warranty of
13 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 // GNU General Public License for more details.
16 // You should have received a copy of the GNU General Public License along
17 // with this library; see the file COPYING. If not, write to the Free
18 // Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307,
21 // As a special exception, you may use this file as part of a free software
22 // library without restriction. Specifically, if other files instantiate
23 // templates or use macros or inline functions from this file, or you compile
24 // this file and link it with other files to produce an executable, this
25 // file does not by itself cause the resulting executable to be covered by
26 // the GNU General Public License. This exception does not however
27 // invalidate any other reasons why the executable file might be covered by
28 // the GNU General Public License.
33 * Hewlett-Packard Company
35 * Permission to use, copy, modify, distribute and sell this software
36 * and its documentation for any purpose is hereby granted without fee,
37 * provided that the above copyright notice appear in all copies and
38 * that both that copyright notice and this permission notice appear
39 * in supporting documentation. Hewlett-Packard Company makes no
40 * representations about the suitability of this software for any
41 * purpose. It is provided "as is" without express or implied warranty.
45 * Silicon Graphics Computer Systems, Inc.
47 * Permission to use, copy, modify, distribute and sell this software
48 * and its documentation for any purpose is hereby granted without fee,
49 * provided that the above copyright notice appear in all copies and
50 * that both that copyright notice and this permission notice appear
51 * in supporting documentation. Silicon Graphics makes no
52 * representations about the suitability of this software for any
53 * purpose. It is provided "as is" without express or implied warranty.
57 * This is an internal header file, included by other library headers.
58 * You should not attempt to use it directly.
61 #ifndef __GLIBCPP_INTERNAL_ALGO_H
62 #define __GLIBCPP_INTERNAL_ALGO_H
64 #include <bits/stl_heap.h>
65 #include <bits/stl_tempbuf.h> // for _Temporary_buffer
67 // See concept_check.h for the __glibcpp_*_requires macros.
73 * @brief Find the median of three values.
77 * @return One of @p a, @p b or @p c.
79 * If @c {l,m,n} is some convolution of @p {a,b,c} such that @c l<=m<=n
80 * then the value returned will be @c m.
81 * This is an SGI extension.
82 * @ingroup SGIextensions
84 template<typename _Tp>
86 __median(const _Tp& __a, const _Tp& __b, const _Tp& __c)
88 // concept requirements
89 __glibcpp_function_requires(_LessThanComparableConcept<_Tp>)
106 * @brief Find the median of three values using a predicate for comparison.
110 * @param comp A binary predicate.
111 * @return One of @p a, @p b or @p c.
113 * If @c {l,m,n} is some convolution of @p {a,b,c} such that @p comp(l,m)
114 * and @p comp(m,n) are both true then the value returned will be @c m.
115 * This is an SGI extension.
116 * @ingroup SGIextensions
118 template<typename _Tp, typename _Compare>
120 __median(const _Tp& __a, const _Tp& __b, const _Tp& __c, _Compare __comp)
122 // concept requirements
123 __glibcpp_function_requires(_BinaryFunctionConcept<_Compare,bool,_Tp,_Tp>)
124 if (__comp(__a, __b))
125 if (__comp(__b, __c))
127 else if (__comp(__a, __c))
131 else if (__comp(__a, __c))
133 else if (__comp(__b, __c))
140 * @brief Apply a function to every element of a sequence.
141 * @param first An input iterator.
142 * @param last An input iterator.
143 * @param f A unary function object.
146 * Applies the function object @p f to each element in the range
147 * @p [first,last). @p f must not modify the order of the sequence.
148 * If @p f has a return value it is ignored.
150 template<typename _InputIter, typename _Function>
152 for_each(_InputIter __first, _InputIter __last, _Function __f)
154 // concept requirements
155 __glibcpp_function_requires(_InputIteratorConcept<_InputIter>)
156 for ( ; __first != __last; ++__first)
163 * This is an overload used by find() for the Input Iterator case.
166 template<typename _InputIter, typename _Tp>
168 find(_InputIter __first, _InputIter __last,
172 while (__first != __last && !(*__first == __val))
179 * This is an overload used by find_if() for the Input Iterator case.
182 template<typename _InputIter, typename _Predicate>
184 find_if(_InputIter __first, _InputIter __last,
188 while (__first != __last && !__pred(*__first))
195 * This is an overload used by find() for the RAI case.
198 template<typename _RandomAccessIter, typename _Tp>
200 find(_RandomAccessIter __first, _RandomAccessIter __last,
202 random_access_iterator_tag)
204 typename iterator_traits<_RandomAccessIter>::difference_type __trip_count
205 = (__last - __first) >> 2;
207 for ( ; __trip_count > 0 ; --__trip_count) {
208 if (*__first == __val) return __first;
211 if (*__first == __val) return __first;
214 if (*__first == __val) return __first;
217 if (*__first == __val) return __first;
221 switch(__last - __first) {
223 if (*__first == __val) return __first;
226 if (*__first == __val) return __first;
229 if (*__first == __val) return __first;
239 * This is an overload used by find_if() for the RAI case.
242 template<typename _RandomAccessIter, typename _Predicate>
244 find_if(_RandomAccessIter __first, _RandomAccessIter __last,
246 random_access_iterator_tag)
248 typename iterator_traits<_RandomAccessIter>::difference_type __trip_count
249 = (__last - __first) >> 2;
251 for ( ; __trip_count > 0 ; --__trip_count) {
252 if (__pred(*__first)) return __first;
255 if (__pred(*__first)) return __first;
258 if (__pred(*__first)) return __first;
261 if (__pred(*__first)) return __first;
265 switch(__last - __first) {
267 if (__pred(*__first)) return __first;
270 if (__pred(*__first)) return __first;
273 if (__pred(*__first)) return __first;
282 * @brief Find the first occurrence of a value in a sequence.
283 * @param first An input iterator.
284 * @param last An input iterator.
285 * @param val The value to find.
286 * @return The first iterator @c i in the range @p [first,last)
287 * such that @c *i == @p val, or @p last if no such iterator exists.
289 template<typename _InputIter, typename _Tp>
291 find(_InputIter __first, _InputIter __last,
294 // concept requirements
295 __glibcpp_function_requires(_InputIteratorConcept<_InputIter>)
296 __glibcpp_function_requires(_EqualOpConcept<
297 typename iterator_traits<_InputIter>::value_type, _Tp>)
298 return find(__first, __last, __val, __iterator_category(__first));
302 * @brief Find the first element in a sequence for which a predicate is true.
303 * @param first An input iterator.
304 * @param last An input iterator.
305 * @param pred A predicate.
306 * @return The first iterator @c i in the range @p [first,last)
307 * such that @p pred(*i) is true, or @p last if no such iterator exists.
309 template<typename _InputIter, typename _Predicate>
311 find_if(_InputIter __first, _InputIter __last,
314 // concept requirements
315 __glibcpp_function_requires(_InputIteratorConcept<_InputIter>)
316 __glibcpp_function_requires(_UnaryPredicateConcept<_Predicate,
317 typename iterator_traits<_InputIter>::value_type>)
318 return find_if(__first, __last, __pred, __iterator_category(__first));
322 * @brief Find two adjacent values in a sequence that are equal.
323 * @param first A forward iterator.
324 * @param last A forward iterator.
325 * @return The first iterator @c i such that @c i and @c i+1 are both
326 * valid iterators in @p [first,last) and such that @c *i == @c *(i+1),
327 * or @p last if no such iterator exists.
329 template<typename _ForwardIter>
331 adjacent_find(_ForwardIter __first, _ForwardIter __last)
333 // concept requirements
334 __glibcpp_function_requires(_ForwardIteratorConcept<_ForwardIter>)
335 __glibcpp_function_requires(_EqualityComparableConcept<
336 typename iterator_traits<_ForwardIter>::value_type>)
337 if (__first == __last)
339 _ForwardIter __next = __first;
340 while(++__next != __last) {
341 if (*__first == *__next)
349 * @brief Find two adjacent values in a sequence using a predicate.
350 * @param first A forward iterator.
351 * @param last A forward iterator.
352 * @param binary_pred A binary predicate.
353 * @return The first iterator @c i such that @c i and @c i+1 are both
354 * valid iterators in @p [first,last) and such that
355 * @p binary_pred(*i,*(i+1)) is true, or @p last if no such iterator
358 template<typename _ForwardIter, typename _BinaryPredicate>
360 adjacent_find(_ForwardIter __first, _ForwardIter __last,
361 _BinaryPredicate __binary_pred)
363 // concept requirements
364 __glibcpp_function_requires(_ForwardIteratorConcept<_ForwardIter>)
365 __glibcpp_function_requires(_BinaryPredicateConcept<_BinaryPredicate,
366 typename iterator_traits<_ForwardIter>::value_type,
367 typename iterator_traits<_ForwardIter>::value_type>)
368 if (__first == __last)
370 _ForwardIter __next = __first;
371 while(++__next != __last) {
372 if (__binary_pred(*__first, *__next))
380 * @brief Count the number of copies of a value in a sequence.
381 * @param first An input iterator.
382 * @param last An input iterator.
383 * @param value The value to be counted.
384 * @return The number of iterators @c i in the range @p [first,last)
385 * for which @c *i == @p value
387 template<typename _InputIter, typename _Tp>
388 typename iterator_traits<_InputIter>::difference_type
389 count(_InputIter __first, _InputIter __last, const _Tp& __value)
391 // concept requirements
392 __glibcpp_function_requires(_InputIteratorConcept<_InputIter>)
393 __glibcpp_function_requires(_EqualityComparableConcept<
394 typename iterator_traits<_InputIter>::value_type >)
395 __glibcpp_function_requires(_EqualityComparableConcept<_Tp>)
396 typename iterator_traits<_InputIter>::difference_type __n = 0;
397 for ( ; __first != __last; ++__first)
398 if (*__first == __value)
404 * @brief Count the elements of a sequence for which a predicate is true.
405 * @param first An input iterator.
406 * @param last An input iterator.
407 * @param pred A predicate.
408 * @return The number of iterators @c i in the range @p [first,last)
409 * for which @p pred(*i) is true.
411 template<typename _InputIter, typename _Predicate>
412 typename iterator_traits<_InputIter>::difference_type
413 count_if(_InputIter __first, _InputIter __last, _Predicate __pred)
415 // concept requirements
416 __glibcpp_function_requires(_InputIteratorConcept<_InputIter>)
417 __glibcpp_function_requires(_UnaryPredicateConcept<_Predicate,
418 typename iterator_traits<_InputIter>::value_type>)
419 typename iterator_traits<_InputIter>::difference_type __n = 0;
420 for ( ; __first != __last; ++__first)
421 if (__pred(*__first))
428 * @brief Search a sequence for a matching sub-sequence.
429 * @param first1 A forward iterator.
430 * @param last1 A forward iterator.
431 * @param first2 A forward iterator.
432 * @param last2 A forward iterator.
433 * @return The first iterator @c i in the range
434 * @p [first1,last1-(last2-first2)) such that @c *(i+N) == @p *(first2+N)
435 * for each @c N in the range @p [0,last2-first2), or @p last1 if no
436 * such iterator exists.
438 * Searches the range @p [first1,last1) for a sub-sequence that compares
439 * equal value-by-value with the sequence given by @p [first2,last2) and
440 * returns an iterator to the first element of the sub-sequence, or
441 * @p last1 if the sub-sequence is not found.
443 * Because the sub-sequence must lie completely within the range
444 * @p [first1,last1) it must start at a position less than
445 * @p last1-(last2-first2) where @p last2-first2 is the length of the
447 * This means that the returned iterator @c i will be in the range
448 * @p [first1,last1-(last2-first2))
450 template<typename _ForwardIter1, typename _ForwardIter2>
452 search(_ForwardIter1 __first1, _ForwardIter1 __last1,
453 _ForwardIter2 __first2, _ForwardIter2 __last2)
455 // concept requirements
456 __glibcpp_function_requires(_ForwardIteratorConcept<_ForwardIter1>)
457 __glibcpp_function_requires(_ForwardIteratorConcept<_ForwardIter2>)
458 __glibcpp_function_requires(_EqualOpConcept<
459 typename iterator_traits<_ForwardIter1>::value_type,
460 typename iterator_traits<_ForwardIter2>::value_type>)
462 // Test for empty ranges
463 if (__first1 == __last1 || __first2 == __last2)
466 // Test for a pattern of length 1.
467 _ForwardIter2 __tmp(__first2);
469 if (__tmp == __last2)
470 return find(__first1, __last1, *__first2);
474 _ForwardIter2 __p1, __p;
476 __p1 = __first2; ++__p1;
478 _ForwardIter1 __current = __first1;
480 while (__first1 != __last1) {
481 __first1 = find(__first1, __last1, *__first2);
482 if (__first1 == __last1)
486 __current = __first1;
487 if (++__current == __last1)
490 while (*__current == *__p) {
491 if (++__p == __last2)
493 if (++__current == __last1)
503 * @brief Search a sequence for a matching sub-sequence using a predicate.
504 * @param first1 A forward iterator.
505 * @param last1 A forward iterator.
506 * @param first2 A forward iterator.
507 * @param last2 A forward iterator.
508 * @param predicate A binary predicate.
509 * @return The first iterator @c i in the range
510 * @p [first1,last1-(last2-first2)) such that
511 * @p predicate(*(i+N),*(first2+N)) is true for each @c N in the range
512 * @p [0,last2-first2), or @p last1 if no such iterator exists.
514 * Searches the range @p [first1,last1) for a sub-sequence that compares
515 * equal value-by-value with the sequence given by @p [first2,last2),
516 * using @p predicate to determine equality, and returns an iterator
517 * to the first element of the sub-sequence, or @p last1 if no such
520 * @see search(_ForwardIter1, _ForwardIter1, _ForwardIter2, _ForwardIter2)
522 template<typename _ForwardIter1, typename _ForwardIter2, typename _BinaryPred>
524 search(_ForwardIter1 __first1, _ForwardIter1 __last1,
525 _ForwardIter2 __first2, _ForwardIter2 __last2,
526 _BinaryPred __predicate)
528 // concept requirements
529 __glibcpp_function_requires(_ForwardIteratorConcept<_ForwardIter1>)
530 __glibcpp_function_requires(_ForwardIteratorConcept<_ForwardIter2>)
531 __glibcpp_function_requires(_BinaryPredicateConcept<_BinaryPred,
532 typename iterator_traits<_ForwardIter1>::value_type,
533 typename iterator_traits<_ForwardIter2>::value_type>)
535 // Test for empty ranges
536 if (__first1 == __last1 || __first2 == __last2)
539 // Test for a pattern of length 1.
540 _ForwardIter2 __tmp(__first2);
542 if (__tmp == __last2) {
543 while (__first1 != __last1 && !__predicate(*__first1, *__first2))
550 _ForwardIter2 __p1, __p;
552 __p1 = __first2; ++__p1;
554 _ForwardIter1 __current = __first1;
556 while (__first1 != __last1) {
557 while (__first1 != __last1) {
558 if (__predicate(*__first1, *__first2))
562 while (__first1 != __last1 && !__predicate(*__first1, *__first2))
564 if (__first1 == __last1)
568 __current = __first1;
569 if (++__current == __last1) return __last1;
571 while (__predicate(*__current, *__p)) {
572 if (++__p == __last2)
574 if (++__current == __last1)
584 * @brief Search a sequence for a number of consecutive values.
585 * @param first A forward iterator.
586 * @param last A forward iterator.
587 * @param count The number of consecutive values.
588 * @param val The value to find.
589 * @return The first iterator @c i in the range @p [first,last-count)
590 * such that @c *(i+N) == @p val for each @c N in the range @p [0,count),
591 * or @p last if no such iterator exists.
593 * Searches the range @p [first,last) for @p count consecutive elements
596 template<typename _ForwardIter, typename _Integer, typename _Tp>
598 search_n(_ForwardIter __first, _ForwardIter __last,
599 _Integer __count, const _Tp& __val)
601 // concept requirements
602 __glibcpp_function_requires(_ForwardIteratorConcept<_ForwardIter>)
603 __glibcpp_function_requires(_EqualityComparableConcept<
604 typename iterator_traits<_ForwardIter>::value_type>)
605 __glibcpp_function_requires(_EqualityComparableConcept<_Tp>)
610 __first = find(__first, __last, __val);
611 while (__first != __last) {
612 typename iterator_traits<_ForwardIter>::difference_type __n = __count;
614 _ForwardIter __i = __first;
616 while (__i != __last && __n != 0 && *__i == __val) {
623 __first = find(__i, __last, __val);
630 * @brief Search a sequence for a number of consecutive values using a
632 * @param first A forward iterator.
633 * @param last A forward iterator.
634 * @param count The number of consecutive values.
635 * @param val The value to find.
636 * @param binary_pred A binary predicate.
637 * @return The first iterator @c i in the range @p [first,last-count)
638 * such that @p binary_pred(*(i+N),val) is true for each @c N in the
639 * range @p [0,count), or @p last if no such iterator exists.
641 * Searches the range @p [first,last) for @p count consecutive elements
642 * for which the predicate returns true.
644 template<typename _ForwardIter, typename _Integer, typename _Tp,
645 typename _BinaryPred>
647 search_n(_ForwardIter __first, _ForwardIter __last,
648 _Integer __count, const _Tp& __val,
649 _BinaryPred __binary_pred)
651 // concept requirements
652 __glibcpp_function_requires(_ForwardIteratorConcept<_ForwardIter>)
653 __glibcpp_function_requires(_BinaryPredicateConcept<_BinaryPred,
654 typename iterator_traits<_ForwardIter>::value_type, _Tp>)
659 while (__first != __last) {
660 if (__binary_pred(*__first, __val))
664 while (__first != __last) {
665 typename iterator_traits<_ForwardIter>::difference_type __n = __count;
667 _ForwardIter __i = __first;
669 while (__i != __last && __n != 0 && __binary_pred(*__i, __val)) {
676 while (__i != __last) {
677 if (__binary_pred(*__i, __val))
689 * @brief Swap the elements of two sequences.
690 * @param first1 A forward iterator.
691 * @param last1 A forward iterator.
692 * @param first2 A forward iterator.
693 * @return An iterator equal to @p first2+(last1-first1).
695 * Swaps each element in the range @p [first1,last1) with the
696 * corresponding element in the range @p [first2,(last1-first1)).
697 * The ranges must not overlap.
699 template<typename _ForwardIter1, typename _ForwardIter2>
701 swap_ranges(_ForwardIter1 __first1, _ForwardIter1 __last1,
702 _ForwardIter2 __first2)
704 // concept requirements
705 __glibcpp_function_requires(_Mutable_ForwardIteratorConcept<_ForwardIter1>)
706 __glibcpp_function_requires(_Mutable_ForwardIteratorConcept<_ForwardIter2>)
707 __glibcpp_function_requires(_ConvertibleConcept<
708 typename iterator_traits<_ForwardIter1>::value_type,
709 typename iterator_traits<_ForwardIter2>::value_type>)
710 __glibcpp_function_requires(_ConvertibleConcept<
711 typename iterator_traits<_ForwardIter2>::value_type,
712 typename iterator_traits<_ForwardIter1>::value_type>)
714 for ( ; __first1 != __last1; ++__first1, ++__first2)
715 iter_swap(__first1, __first2);
720 * @brief Perform an operation on a sequence.
721 * @param first An input iterator.
722 * @param last An input iterator.
723 * @param result An output iterator.
724 * @param unary_op A unary operator.
725 * @return An output iterator equal to @p result+(last-first).
727 * Applies the operator to each element in the input range and assigns
728 * the results to successive elements of the output sequence.
729 * Evaluates @p *(result+N)=unary_op(*(first+N)) for each @c N in the
730 * range @p [0,last-first).
732 * @p unary_op must not alter its argument.
734 template<typename _InputIter, typename _OutputIter, typename _UnaryOperation>
736 transform(_InputIter __first, _InputIter __last,
737 _OutputIter __result, _UnaryOperation __unary_op)
739 // concept requirements
740 __glibcpp_function_requires(_InputIteratorConcept<_InputIter>)
741 __glibcpp_function_requires(_OutputIteratorConcept<_OutputIter,
742 // "the type returned by a _UnaryOperation"
743 __typeof__(__unary_op(*__first))>)
745 for ( ; __first != __last; ++__first, ++__result)
746 *__result = __unary_op(*__first);
751 * @brief Perform an operation on corresponding elements of two sequences.
752 * @param first1 An input iterator.
753 * @param last1 An input iterator.
754 * @param first2 An input iterator.
755 * @param result An output iterator.
756 * @param binary_op A binary operator.
757 * @return An output iterator equal to @p result+(last-first).
759 * Applies the operator to the corresponding elements in the two
760 * input ranges and assigns the results to successive elements of the
762 * Evaluates @p *(result+N)=binary_op(*(first1+N),*(first2+N)) for each
763 * @c N in the range @p [0,last1-first1).
765 * @p binary_op must not alter either of its arguments.
767 template<typename _InputIter1, typename _InputIter2, typename _OutputIter,
768 typename _BinaryOperation>
770 transform(_InputIter1 __first1, _InputIter1 __last1,
771 _InputIter2 __first2, _OutputIter __result,
772 _BinaryOperation __binary_op)
774 // concept requirements
775 __glibcpp_function_requires(_InputIteratorConcept<_InputIter1>)
776 __glibcpp_function_requires(_InputIteratorConcept<_InputIter2>)
777 __glibcpp_function_requires(_OutputIteratorConcept<_OutputIter,
778 // "the type returned by a _BinaryOperation"
779 __typeof__(__binary_op(*__first1,*__first2))>)
781 for ( ; __first1 != __last1; ++__first1, ++__first2, ++__result)
782 *__result = __binary_op(*__first1, *__first2);
787 * @brief Replace each occurrence of one value in a sequence with another
789 * @param first A forward iterator.
790 * @param last A forward iterator.
791 * @param old_value The value to be replaced.
792 * @param new_value The replacement value.
793 * @return replace() returns no value.
795 * For each iterator @c i in the range @p [first,last) if @c *i ==
796 * @p old_value then the assignment @c *i = @p new_value is performed.
798 template<typename _ForwardIter, typename _Tp>
800 replace(_ForwardIter __first, _ForwardIter __last,
801 const _Tp& __old_value, const _Tp& __new_value)
803 // concept requirements
804 __glibcpp_function_requires(_Mutable_ForwardIteratorConcept<_ForwardIter>)
805 __glibcpp_function_requires(_EqualOpConcept<
806 typename iterator_traits<_ForwardIter>::value_type, _Tp>)
807 __glibcpp_function_requires(_ConvertibleConcept<_Tp,
808 typename iterator_traits<_ForwardIter>::value_type>)
810 for ( ; __first != __last; ++__first)
811 if (*__first == __old_value)
812 *__first = __new_value;
816 * @brief Replace each value in a sequence for which a predicate returns
817 * true with another value.
818 * @param first A forward iterator.
819 * @param last A forward iterator.
820 * @param pred A predicate.
821 * @param new_value The replacement value.
822 * @return replace_if() returns no value.
824 * For each iterator @c i in the range @p [first,last) if @p pred(*i)
825 * is true then the assignment @c *i = @p new_value is performed.
827 template<typename _ForwardIter, typename _Predicate, typename _Tp>
829 replace_if(_ForwardIter __first, _ForwardIter __last,
830 _Predicate __pred, const _Tp& __new_value)
832 // concept requirements
833 __glibcpp_function_requires(_Mutable_ForwardIteratorConcept<_ForwardIter>)
834 __glibcpp_function_requires(_ConvertibleConcept<_Tp,
835 typename iterator_traits<_ForwardIter>::value_type>)
836 __glibcpp_function_requires(_UnaryPredicateConcept<_Predicate,
837 typename iterator_traits<_ForwardIter>::value_type>)
839 for ( ; __first != __last; ++__first)
840 if (__pred(*__first))
841 *__first = __new_value;
845 * @brief Copy a sequence, replacing each element of one value with another
847 * @param first An input iterator.
848 * @param last An input iterator.
849 * @param result An output iterator.
850 * @param old_value The value to be replaced.
851 * @param new_value The replacement value.
852 * @return The end of the output sequence, @p result+(last-first).
854 * Copies each element in the input range @p [first,last) to the
855 * output range @p [result,result+(last-first)) replacing elements
856 * equal to @p old_value with @p new_value.
858 template<typename _InputIter, typename _OutputIter, typename _Tp>
860 replace_copy(_InputIter __first, _InputIter __last,
861 _OutputIter __result,
862 const _Tp& __old_value, const _Tp& __new_value)
864 // concept requirements
865 __glibcpp_function_requires(_InputIteratorConcept<_InputIter>)
866 __glibcpp_function_requires(_OutputIteratorConcept<_OutputIter,
867 typename iterator_traits<_InputIter>::value_type>)
868 __glibcpp_function_requires(_EqualOpConcept<
869 typename iterator_traits<_InputIter>::value_type, _Tp>)
871 for ( ; __first != __last; ++__first, ++__result)
872 *__result = *__first == __old_value ? __new_value : *__first;
877 * @brief Copy a sequence, replacing each value for which a predicate
878 * returns true with another value.
879 * @param first An input iterator.
880 * @param last An input iterator.
881 * @param result An output iterator.
882 * @param pred A predicate.
883 * @param new_value The replacement value.
884 * @return The end of the output sequence, @p result+(last-first).
886 * Copies each element in the range @p [first,last) to the range
887 * @p [result,result+(last-first)) replacing elements for which
888 * @p pred returns true with @p new_value.
890 template<typename _InputIter, typename _OutputIter, typename _Predicate,
893 replace_copy_if(_InputIter __first, _InputIter __last,
894 _OutputIter __result,
895 _Predicate __pred, const _Tp& __new_value)
897 // concept requirements
898 __glibcpp_function_requires(_InputIteratorConcept<_InputIter>)
899 __glibcpp_function_requires(_OutputIteratorConcept<_OutputIter,
900 typename iterator_traits<_InputIter>::value_type>)
901 __glibcpp_function_requires(_UnaryPredicateConcept<_Predicate,
902 typename iterator_traits<_InputIter>::value_type>)
904 for ( ; __first != __last; ++__first, ++__result)
905 *__result = __pred(*__first) ? __new_value : *__first;
910 * @brief Assign the result of a function object to each value in a
912 * @param first A forward iterator.
913 * @param last A forward iterator.
914 * @param gen A function object taking no arguments.
915 * @return generate() returns no value.
917 * Performs the assignment @c *i = @p gen() for each @c i in the range
920 template<typename _ForwardIter, typename _Generator>
922 generate(_ForwardIter __first, _ForwardIter __last, _Generator __gen)
924 // concept requirements
925 __glibcpp_function_requires(_ForwardIteratorConcept<_ForwardIter>)
926 __glibcpp_function_requires(_GeneratorConcept<_Generator,
927 typename iterator_traits<_ForwardIter>::value_type>)
929 for ( ; __first != __last; ++__first)
934 * @brief Assign the result of a function object to each value in a
936 * @param first A forward iterator.
937 * @param n The length of the sequence.
938 * @param gen A function object taking no arguments.
939 * @return The end of the sequence, @p first+n
941 * Performs the assignment @c *i = @p gen() for each @c i in the range
942 * @p [first,first+n).
944 template<typename _OutputIter, typename _Size, typename _Generator>
946 generate_n(_OutputIter __first, _Size __n, _Generator __gen)
948 // concept requirements
949 __glibcpp_function_requires(_OutputIteratorConcept<_OutputIter,
950 // "the type returned by a _Generator"
953 for ( ; __n > 0; --__n, ++__first)
959 * @brief Copy a sequence, removing elements of a given value.
960 * @param first An input iterator.
961 * @param last An input iterator.
962 * @param result An output iterator.
963 * @param value The value to be removed.
964 * @return An iterator designating the end of the resulting sequence.
966 * Copies each element in the range @p [first,last) not equal to @p value
967 * to the range beginning at @p result.
968 * remove_copy() is stable, so the relative order of elements that are
969 * copied is unchanged.
971 template<typename _InputIter, typename _OutputIter, typename _Tp>
973 remove_copy(_InputIter __first, _InputIter __last,
974 _OutputIter __result, const _Tp& __value)
976 // concept requirements
977 __glibcpp_function_requires(_InputIteratorConcept<_InputIter>)
978 __glibcpp_function_requires(_OutputIteratorConcept<_OutputIter,
979 typename iterator_traits<_InputIter>::value_type>)
980 __glibcpp_function_requires(_EqualOpConcept<
981 typename iterator_traits<_InputIter>::value_type, _Tp>)
983 for ( ; __first != __last; ++__first)
984 if (!(*__first == __value)) {
985 *__result = *__first;
992 * @brief Copy a sequence, removing elements for which a predicate is true.
993 * @param first An input iterator.
994 * @param last An input iterator.
995 * @param result An output iterator.
996 * @param pred A predicate.
997 * @return An iterator designating the end of the resulting sequence.
999 * Copies each element in the range @p [first,last) for which
1000 * @p pred returns true to the range beginning at @p result.
1002 * remove_copy_if() is stable, so the relative order of elements that are
1003 * copied is unchanged.
1005 template<typename _InputIter, typename _OutputIter, typename _Predicate>
1007 remove_copy_if(_InputIter __first, _InputIter __last,
1008 _OutputIter __result, _Predicate __pred)
1010 // concept requirements
1011 __glibcpp_function_requires(_InputIteratorConcept<_InputIter>)
1012 __glibcpp_function_requires(_OutputIteratorConcept<_OutputIter,
1013 typename iterator_traits<_InputIter>::value_type>)
1014 __glibcpp_function_requires(_UnaryPredicateConcept<_Predicate,
1015 typename iterator_traits<_InputIter>::value_type>)
1017 for ( ; __first != __last; ++__first)
1018 if (!__pred(*__first)) {
1019 *__result = *__first;
1026 * @brief Remove elements from a sequence.
1027 * @param first An input iterator.
1028 * @param last An input iterator.
1029 * @param value The value to be removed.
1030 * @return An iterator designating the end of the resulting sequence.
1032 * All elements equal to @p value are removed from the range
1035 * remove() is stable, so the relative order of elements that are
1036 * not removed is unchanged.
1038 * Elements between the end of the resulting sequence and @p last
1039 * are still present, but their value is unspecified.
1041 template<typename _ForwardIter, typename _Tp>
1043 remove(_ForwardIter __first, _ForwardIter __last,
1046 // concept requirements
1047 __glibcpp_function_requires(_Mutable_ForwardIteratorConcept<_ForwardIter>)
1048 __glibcpp_function_requires(_ConvertibleConcept<_Tp,
1049 typename iterator_traits<_ForwardIter>::value_type>)
1050 __glibcpp_function_requires(_EqualOpConcept<
1051 typename iterator_traits<_ForwardIter>::value_type, _Tp>)
1053 __first = find(__first, __last, __value);
1054 _ForwardIter __i = __first;
1055 return __first == __last ? __first
1056 : remove_copy(++__i, __last, __first, __value);
1060 * @brief Remove elements from a sequence using a predicate.
1061 * @param first A forward iterator.
1062 * @param last A forward iterator.
1063 * @param pred A predicate.
1064 * @return An iterator designating the end of the resulting sequence.
1066 * All elements for which @p pred returns true are removed from the range
1069 * remove_if() is stable, so the relative order of elements that are
1070 * not removed is unchanged.
1072 * Elements between the end of the resulting sequence and @p last
1073 * are still present, but their value is unspecified.
1075 template<typename _ForwardIter, typename _Predicate>
1077 remove_if(_ForwardIter __first, _ForwardIter __last,
1080 // concept requirements
1081 __glibcpp_function_requires(_Mutable_ForwardIteratorConcept<_ForwardIter>)
1082 __glibcpp_function_requires(_UnaryPredicateConcept<_Predicate,
1083 typename iterator_traits<_ForwardIter>::value_type>)
1085 __first = find_if(__first, __last, __pred);
1086 _ForwardIter __i = __first;
1087 return __first == __last ? __first
1088 : remove_copy_if(++__i, __last, __first, __pred);
1093 * This is an uglified unique_copy(_InputIter, _InputIter, _OutputIter)
1094 * overloaded for output iterators.
1097 template<typename _InputIter, typename _OutputIter>
1099 __unique_copy(_InputIter __first, _InputIter __last,
1100 _OutputIter __result,
1101 output_iterator_tag)
1103 // concept requirements -- taken care of in dispatching function
1104 typename iterator_traits<_InputIter>::value_type __value = *__first;
1105 *__result = __value;
1106 while (++__first != __last)
1107 if (!(__value == *__first)) {
1109 *++__result = __value;
1116 * This is an uglified unique_copy(_InputIter, _InputIter, _OutputIter)
1117 * overloaded for forward iterators.
1120 template<typename _InputIter, typename _ForwardIter>
1122 __unique_copy(_InputIter __first, _InputIter __last,
1123 _ForwardIter __result,
1124 forward_iterator_tag)
1126 // concept requirements -- taken care of in dispatching function
1127 *__result = *__first;
1128 while (++__first != __last)
1129 if (!(*__result == *__first))
1130 *++__result = *__first;
1135 * @brief Copy a sequence, removing consecutive duplicate values.
1136 * @param first An input iterator.
1137 * @param last An input iterator.
1138 * @param result An output iterator.
1139 * @return An iterator designating the end of the resulting sequence.
1141 * Copies each element in the range @p [first,last) to the range
1142 * beginning at @p result, except that only the first element is copied
1143 * from groups of consecutive elements that compare equal.
1144 * unique_copy() is stable, so the relative order of elements that are
1145 * copied is unchanged.
1147 template<typename _InputIter, typename _OutputIter>
1149 unique_copy(_InputIter __first, _InputIter __last,
1150 _OutputIter __result)
1152 // concept requirements
1153 __glibcpp_function_requires(_InputIteratorConcept<_InputIter>)
1154 __glibcpp_function_requires(_OutputIteratorConcept<_OutputIter,
1155 typename iterator_traits<_InputIter>::value_type>)
1156 __glibcpp_function_requires(_EqualityComparableConcept<
1157 typename iterator_traits<_InputIter>::value_type>)
1159 typedef typename iterator_traits<_OutputIter>::iterator_category _IterType;
1161 if (__first == __last) return __result;
1162 return __unique_copy(__first, __last, __result, _IterType());
1167 * This is an uglified
1168 * unique_copy(_InputIter, _InputIter, _OutputIter, _BinaryPredicate)
1169 * overloaded for output iterators.
1172 template<typename _InputIter, typename _OutputIter, typename _BinaryPredicate>
1174 __unique_copy(_InputIter __first, _InputIter __last,
1175 _OutputIter __result,
1176 _BinaryPredicate __binary_pred,
1177 output_iterator_tag)
1179 // concept requirements -- iterators already checked
1180 __glibcpp_function_requires(_BinaryPredicateConcept<_BinaryPredicate,
1181 typename iterator_traits<_InputIter>::value_type,
1182 typename iterator_traits<_InputIter>::value_type>)
1184 typename iterator_traits<_InputIter>::value_type __value = *__first;
1185 *__result = __value;
1186 while (++__first != __last)
1187 if (!__binary_pred(__value, *__first)) {
1189 *++__result = __value;
1196 * This is an uglified
1197 * unique_copy(_InputIter, _InputIter, _OutputIter, _BinaryPredicate)
1198 * overloaded for forward iterators.
1201 template<typename _InputIter, typename _ForwardIter, typename _BinaryPredicate>
1203 __unique_copy(_InputIter __first, _InputIter __last,
1204 _ForwardIter __result,
1205 _BinaryPredicate __binary_pred,
1206 forward_iterator_tag)
1208 // concept requirements -- iterators already checked
1209 __glibcpp_function_requires(_BinaryPredicateConcept<_BinaryPredicate,
1210 typename iterator_traits<_ForwardIter>::value_type,
1211 typename iterator_traits<_InputIter>::value_type>)
1213 *__result = *__first;
1214 while (++__first != __last)
1215 if (!__binary_pred(*__result, *__first)) *++__result = *__first;
1220 * @brief Copy a sequence, removing consecutive values using a predicate.
1221 * @param first An input iterator.
1222 * @param last An input iterator.
1223 * @param result An output iterator.
1224 * @param binary_pred A binary predicate.
1225 * @return An iterator designating the end of the resulting sequence.
1227 * Copies each element in the range @p [first,last) to the range
1228 * beginning at @p result, except that only the first element is copied
1229 * from groups of consecutive elements for which @p binary_pred returns
1231 * unique_copy() is stable, so the relative order of elements that are
1232 * copied is unchanged.
1234 template<typename _InputIter, typename _OutputIter, typename _BinaryPredicate>
1236 unique_copy(_InputIter __first, _InputIter __last,
1237 _OutputIter __result,
1238 _BinaryPredicate __binary_pred)
1240 // concept requirements -- predicates checked later
1241 __glibcpp_function_requires(_InputIteratorConcept<_InputIter>)
1242 __glibcpp_function_requires(_OutputIteratorConcept<_OutputIter,
1243 typename iterator_traits<_InputIter>::value_type>)
1245 typedef typename iterator_traits<_OutputIter>::iterator_category _IterType;
1247 if (__first == __last) return __result;
1248 return __unique_copy(__first, __last,
1249 __result, __binary_pred, _IterType());
1253 * @brief Remove consecutive duplicate values from a sequence.
1254 * @param first A forward iterator.
1255 * @param last A forward iterator.
1256 * @return An iterator designating the end of the resulting sequence.
1258 * Removes all but the first element from each group of consecutive
1259 * values that compare equal.
1260 * unique() is stable, so the relative order of elements that are
1261 * not removed is unchanged.
1262 * Elements between the end of the resulting sequence and @p last
1263 * are still present, but their value is unspecified.
1265 template<typename _ForwardIter>
1267 unique(_ForwardIter __first, _ForwardIter __last)
1269 // concept requirements
1270 __glibcpp_function_requires(_Mutable_ForwardIteratorConcept<_ForwardIter>)
1271 __glibcpp_function_requires(_EqualityComparableConcept<
1272 typename iterator_traits<_ForwardIter>::value_type>)
1274 __first = adjacent_find(__first, __last);
1275 return unique_copy(__first, __last, __first);
1279 * @brief Remove consecutive values from a sequence using a predicate.
1280 * @param first A forward iterator.
1281 * @param last A forward iterator.
1282 * @param binary_pred A binary predicate.
1283 * @return An iterator designating the end of the resulting sequence.
1285 * Removes all but the first element from each group of consecutive
1286 * values for which @p binary_pred returns true.
1287 * unique() is stable, so the relative order of elements that are
1288 * not removed is unchanged.
1289 * Elements between the end of the resulting sequence and @p last
1290 * are still present, but their value is unspecified.
1292 template<typename _ForwardIter, typename _BinaryPredicate>
1294 unique(_ForwardIter __first, _ForwardIter __last,
1295 _BinaryPredicate __binary_pred)
1297 // concept requirements
1298 __glibcpp_function_requires(_Mutable_ForwardIteratorConcept<_ForwardIter>)
1299 __glibcpp_function_requires(_BinaryPredicateConcept<_BinaryPredicate,
1300 typename iterator_traits<_ForwardIter>::value_type,
1301 typename iterator_traits<_ForwardIter>::value_type>)
1303 __first = adjacent_find(__first, __last, __binary_pred);
1304 return unique_copy(__first, __last, __first, __binary_pred);
1309 * This is an uglified reverse(_BidirectionalIter, _BidirectionalIter)
1310 * overloaded for bidirectional iterators.
1313 template<typename _BidirectionalIter>
1315 __reverse(_BidirectionalIter __first, _BidirectionalIter __last,
1316 bidirectional_iterator_tag)
1319 if (__first == __last || __first == --__last)
1322 iter_swap(__first++, __last);
1327 * This is an uglified reverse(_BidirectionalIter, _BidirectionalIter)
1328 * overloaded for bidirectional iterators.
1331 template<typename _RandomAccessIter>
1333 __reverse(_RandomAccessIter __first, _RandomAccessIter __last,
1334 random_access_iterator_tag)
1336 while (__first < __last)
1337 iter_swap(__first++, --__last);
1341 * @brief Reverse a sequence.
1342 * @param first A bidirectional iterator.
1343 * @param last A bidirectional iterator.
1344 * @return reverse() returns no value.
1346 * Reverses the order of the elements in the range @p [first,last),
1347 * so that the first element becomes the last etc.
1348 * For every @c i such that @p 0<=i<=(last-first)/2), @p reverse()
1349 * swaps @p *(first+i) and @p *(last-(i+1))
1351 template<typename _BidirectionalIter>
1353 reverse(_BidirectionalIter __first, _BidirectionalIter __last)
1355 // concept requirements
1356 __glibcpp_function_requires(_Mutable_BidirectionalIteratorConcept<
1357 _BidirectionalIter>)
1358 __reverse(__first, __last, __iterator_category(__first));
1362 * @brief Copy a sequence, reversing its elements.
1363 * @param first A bidirectional iterator.
1364 * @param last A bidirectional iterator.
1365 * @param result An output iterator.
1366 * @return An iterator designating the end of the resulting sequence.
1368 * Copies the elements in the range @p [first,last) to the range
1369 * @p [result,result+(last-first)) such that the order of the
1370 * elements is reversed.
1371 * For every @c i such that @p 0<=i<=(last-first), @p reverse_copy()
1372 * performs the assignment @p *(result+(last-first)-i) = *(first+i).
1373 * The ranges @p [first,last) and @p [result,result+(last-first))
1376 template<typename _BidirectionalIter, typename _OutputIter>
1378 reverse_copy(_BidirectionalIter __first, _BidirectionalIter __last,
1379 _OutputIter __result)
1381 // concept requirements
1382 __glibcpp_function_requires(_BidirectionalIteratorConcept<_BidirectionalIter>)
1383 __glibcpp_function_requires(_OutputIteratorConcept<_OutputIter,
1384 typename iterator_traits<_BidirectionalIter>::value_type>)
1386 while (__first != __last) {
1388 *__result = *__last;
1397 * This is a helper function for the rotate algorithm specialized on RAIs.
1398 * It returns the greatest common divisor of two integer values.
1401 template<typename _EuclideanRingElement>
1402 _EuclideanRingElement
1403 __gcd(_EuclideanRingElement __m, _EuclideanRingElement __n)
1406 _EuclideanRingElement __t = __m % __n;
1415 * This is a helper function for the rotate algorithm.
1418 template<typename _ForwardIter>
1420 __rotate(_ForwardIter __first,
1421 _ForwardIter __middle,
1422 _ForwardIter __last,
1423 forward_iterator_tag)
1425 if ((__first == __middle) || (__last == __middle))
1428 _ForwardIter __first2 = __middle;
1430 swap(*__first++, *__first2++);
1431 if (__first == __middle)
1432 __middle = __first2;
1433 } while (__first2 != __last);
1435 __first2 = __middle;
1437 while (__first2 != __last) {
1438 swap(*__first++, *__first2++);
1439 if (__first == __middle)
1440 __middle = __first2;
1441 else if (__first2 == __last)
1442 __first2 = __middle;
1448 * This is a helper function for the rotate algorithm.
1451 template<typename _BidirectionalIter>
1453 __rotate(_BidirectionalIter __first,
1454 _BidirectionalIter __middle,
1455 _BidirectionalIter __last,
1456 bidirectional_iterator_tag)
1458 // concept requirements
1459 __glibcpp_function_requires(_Mutable_BidirectionalIteratorConcept<
1460 _BidirectionalIter>)
1462 if ((__first == __middle) || (__last == __middle))
1465 __reverse(__first, __middle, bidirectional_iterator_tag());
1466 __reverse(__middle, __last, bidirectional_iterator_tag());
1468 while (__first != __middle && __middle != __last)
1469 swap (*__first++, *--__last);
1471 if (__first == __middle) {
1472 __reverse(__middle, __last, bidirectional_iterator_tag());
1475 __reverse(__first, __middle, bidirectional_iterator_tag());
1481 * This is a helper function for the rotate algorithm.
1484 template<typename _RandomAccessIter>
1486 __rotate(_RandomAccessIter __first,
1487 _RandomAccessIter __middle,
1488 _RandomAccessIter __last,
1489 random_access_iterator_tag)
1491 // concept requirements
1492 __glibcpp_function_requires(_Mutable_RandomAccessIteratorConcept<
1495 if ((__first == __middle) || (__last == __middle))
1498 typedef typename iterator_traits<_RandomAccessIter>::difference_type _Distance;
1499 typedef typename iterator_traits<_RandomAccessIter>::value_type _ValueType;
1501 _Distance __n = __last - __first;
1502 _Distance __k = __middle - __first;
1503 _Distance __l = __n - __k;
1506 swap_ranges(__first, __middle, __middle);
1510 _Distance __d = __gcd(__n, __k);
1512 for (_Distance __i = 0; __i < __d; __i++) {
1513 _ValueType __tmp = *__first;
1514 _RandomAccessIter __p = __first;
1517 for (_Distance __j = 0; __j < __l/__d; __j++) {
1518 if (__p > __first + __l) {
1519 *__p = *(__p - __l);
1523 *__p = *(__p + __k);
1529 for (_Distance __j = 0; __j < __k/__d - 1; __j ++) {
1530 if (__p < __last - __k) {
1531 *__p = *(__p + __k);
1535 *__p = * (__p - __l);
1546 * @brief Rotate the elements of a sequence.
1547 * @param first A forward iterator.
1548 * @param middle A forward iterator.
1549 * @param last A forward iterator.
1552 * Rotates the elements of the range @p [first,last) by @p (middle-first)
1553 * positions so that the element at @p middle is moved to @p first, the
1554 * element at @p middle+1 is moved to @first+1 and so on for each element
1555 * in the range @p [first,last).
1557 * This effectively swaps the ranges @p [first,middle) and
1560 * Performs @p *(first+(n+(last-middle))%(last-first))=*(first+n) for
1561 * each @p n in the range @p [0,last-first).
1563 template<typename _ForwardIter>
1565 rotate(_ForwardIter __first, _ForwardIter __middle, _ForwardIter __last)
1567 // concept requirements
1568 __glibcpp_function_requires(_Mutable_ForwardIteratorConcept<_ForwardIter>)
1570 typedef typename iterator_traits<_ForwardIter>::iterator_category _IterType;
1571 __rotate(__first, __middle, __last, _IterType());
1575 * @brief Copy a sequence, rotating its elements.
1576 * @param first A forward iterator.
1577 * @param middle A forward iterator.
1578 * @param last A forward iterator.
1579 * @param result An output iterator.
1580 * @return An iterator designating the end of the resulting sequence.
1582 * Copies the elements of the range @p [first,last) to the range
1583 * beginning at @result, rotating the copied elements by @p (middle-first)
1584 * positions so that the element at @p middle is moved to @p result, the
1585 * element at @p middle+1 is moved to @result+1 and so on for each element
1586 * in the range @p [first,last).
1588 * Performs @p *(result+(n+(last-middle))%(last-first))=*(first+n) for
1589 * each @p n in the range @p [0,last-first).
1591 template<typename _ForwardIter, typename _OutputIter>
1593 rotate_copy(_ForwardIter __first, _ForwardIter __middle,
1594 _ForwardIter __last, _OutputIter __result)
1596 // concept requirements
1597 __glibcpp_function_requires(_ForwardIteratorConcept<_ForwardIter>)
1598 __glibcpp_function_requires(_OutputIteratorConcept<_OutputIter,
1599 typename iterator_traits<_ForwardIter>::value_type>)
1601 return copy(__first, __middle, copy(__middle, __last, __result));
1607 * Return a random number in the range [0, __n). This function encapsulates
1608 * whether we're using rand (part of the standard C library) or lrand48
1609 * (not standard, but a much better choice whenever it's available).
1611 * XXX There is no corresponding encapsulation fn to seed the generator.
1614 template<typename _Distance>
1616 __random_number(_Distance __n)
1618 #ifdef _GLIBCPP_HAVE_DRAND48
1619 return lrand48() % __n;
1621 return rand() % __n;
1627 * @brief Randomly shuffle the elements of a sequence.
1628 * @param first A forward iterator.
1629 * @param last A forward iterator.
1632 * Reorder the elements in the range @p [first,last) using a random
1633 * distribution, so that every possible ordering of the sequence is
1636 template<typename _RandomAccessIter>
1638 random_shuffle(_RandomAccessIter __first, _RandomAccessIter __last)
1640 // concept requirements
1641 __glibcpp_function_requires(_Mutable_RandomAccessIteratorConcept<
1644 if (__first == __last) return;
1645 for (_RandomAccessIter __i = __first + 1; __i != __last; ++__i)
1646 iter_swap(__i, __first + __random_number((__i - __first) + 1));
1650 * @brief Shuffle the elements of a sequence using a random number
1652 * @param first A forward iterator.
1653 * @param last A forward iterator.
1654 * @param rand The RNG functor or function.
1657 * Reorders the elements in the range @p [first,last) using @p rand to
1658 * provide a random distribution. Calling @p rand(N) for a positive
1659 * integer @p N should return a randomly chosen integer from the
1662 template<typename _RandomAccessIter, typename _RandomNumberGenerator>
1664 random_shuffle(_RandomAccessIter __first, _RandomAccessIter __last,
1665 _RandomNumberGenerator& __rand)
1667 // concept requirements
1668 __glibcpp_function_requires(_Mutable_RandomAccessIteratorConcept<
1671 if (__first == __last) return;
1672 for (_RandomAccessIter __i = __first + 1; __i != __last; ++__i)
1673 iter_swap(__i, __first + __rand((__i - __first) + 1));
1679 * This is a helper function...
1682 template<typename _ForwardIter, typename _Predicate>
1684 __partition(_ForwardIter __first, _ForwardIter __last,
1686 forward_iterator_tag)
1688 if (__first == __last) return __first;
1690 while (__pred(*__first))
1691 if (++__first == __last) return __first;
1693 _ForwardIter __next = __first;
1695 while (++__next != __last)
1696 if (__pred(*__next)) {
1697 swap(*__first, *__next);
1706 * This is a helper function...
1709 template<typename _BidirectionalIter, typename _Predicate>
1711 __partition(_BidirectionalIter __first, _BidirectionalIter __last,
1713 bidirectional_iterator_tag)
1717 if (__first == __last)
1719 else if (__pred(*__first))
1725 if (__first == __last)
1727 else if (!__pred(*__last))
1731 iter_swap(__first, __last);
1737 * @brief Move elements for which a predicate is true to the beginning
1739 * @param first A forward iterator.
1740 * @param last A forward iterator.
1741 * @param pred A predicate functor.
1742 * @return An iterator @p middle such that @p pred(i) is true for each
1743 * iterator @p i in the range @p [first,middle) and false for each @p i
1744 * in the range @p [middle,last).
1746 * @p pred must not modify its operand. @p partition() does not preserve
1747 * the relative ordering of elements in each group, use
1748 * @p stable_partition() if this is needed.
1750 template<typename _ForwardIter, typename _Predicate>
1752 partition(_ForwardIter __first, _ForwardIter __last,
1755 // concept requirements
1756 __glibcpp_function_requires(_Mutable_ForwardIteratorConcept<_ForwardIter>)
1757 __glibcpp_function_requires(_UnaryPredicateConcept<_Predicate,
1758 typename iterator_traits<_ForwardIter>::value_type>)
1760 return __partition(__first, __last, __pred, __iterator_category(__first));
1766 * This is a helper function...
1769 template<typename _ForwardIter, typename _Predicate, typename _Distance>
1771 __inplace_stable_partition(_ForwardIter __first, _ForwardIter __last,
1772 _Predicate __pred, _Distance __len)
1775 return __pred(*__first) ? __last : __first;
1776 _ForwardIter __middle = __first;
1777 advance(__middle, __len / 2);
1778 _ForwardIter __begin = __inplace_stable_partition(__first, __middle,
1781 _ForwardIter __end = __inplace_stable_partition(__middle, __last,
1784 rotate(__begin, __middle, __end);
1785 advance(__begin, distance(__middle, __end));
1791 * This is a helper function...
1794 template<typename _ForwardIter, typename _Pointer, typename _Predicate,
1797 __stable_partition_adaptive(_ForwardIter __first, _ForwardIter __last,
1798 _Predicate __pred, _Distance __len,
1800 _Distance __buffer_size)
1802 if (__len <= __buffer_size) {
1803 _ForwardIter __result1 = __first;
1804 _Pointer __result2 = __buffer;
1805 for ( ; __first != __last ; ++__first)
1806 if (__pred(*__first)) {
1807 *__result1 = *__first;
1811 *__result2 = *__first;
1814 copy(__buffer, __result2, __result1);
1818 _ForwardIter __middle = __first;
1819 advance(__middle, __len / 2);
1820 _ForwardIter __begin = __stable_partition_adaptive(__first, __middle,
1823 __buffer, __buffer_size);
1824 _ForwardIter __end = __stable_partition_adaptive( __middle, __last,
1827 __buffer, __buffer_size);
1828 rotate(__begin, __middle, __end);
1829 advance(__begin, distance(__middle, __end));
1835 * @brief Move elements for which a predicate is true to the beginning
1836 * of a sequence, preserving relative ordering.
1837 * @param first A forward iterator.
1838 * @param last A forward iterator.
1839 * @param pred A predicate functor.
1840 * @return An iterator @p middle such that @p pred(i) is true for each
1841 * iterator @p i in the range @p [first,middle) and false for each @p i
1842 * in the range @p [middle,last).
1844 * Performs the same function as @p partition() with the additional
1845 * guarantee that the relative ordering of elements in each group is
1846 * preserved, so any two elements @p x and @p y in the range
1847 * @p [first,last) such that @p pred(x)==pred(y) will have the same
1848 * relative ordering after calling @p stable_partition().
1850 template<typename _ForwardIter, typename _Predicate>
1852 stable_partition(_ForwardIter __first, _ForwardIter __last,
1855 // concept requirements
1856 __glibcpp_function_requires(_Mutable_ForwardIteratorConcept<_ForwardIter>)
1857 __glibcpp_function_requires(_UnaryPredicateConcept<_Predicate,
1858 typename iterator_traits<_ForwardIter>::value_type>)
1860 if (__first == __last)
1864 typedef typename iterator_traits<_ForwardIter>::value_type _ValueType;
1865 typedef typename iterator_traits<_ForwardIter>::difference_type _DistanceType;
1867 _Temporary_buffer<_ForwardIter, _ValueType> __buf(__first, __last);
1868 if (__buf.size() > 0)
1869 return __stable_partition_adaptive(__first, __last, __pred,
1870 _DistanceType(__buf.requested_size()),
1871 __buf.begin(), __buf.size());
1873 return __inplace_stable_partition(__first, __last, __pred,
1874 _DistanceType(__buf.requested_size()));
1880 * This is a helper function...
1883 template<typename _RandomAccessIter, typename _Tp>
1885 __unguarded_partition(_RandomAccessIter __first, _RandomAccessIter __last,
1889 while (*__first < __pivot)
1892 while (__pivot < *__last)
1894 if (!(__first < __last))
1896 iter_swap(__first, __last);
1903 * This is a helper function...
1906 template<typename _RandomAccessIter, typename _Tp, typename _Compare>
1908 __unguarded_partition(_RandomAccessIter __first, _RandomAccessIter __last,
1909 _Tp __pivot, _Compare __comp)
1912 while (__comp(*__first, __pivot))
1915 while (__comp(__pivot, *__last))
1917 if (!(__first < __last))
1919 iter_swap(__first, __last);
1928 * This controls some aspect of the sort routines.
1931 enum { _M_threshold = 16 };
1935 * This is a helper function for the sort routine.
1938 template<typename _RandomAccessIter, typename _Tp>
1940 __unguarded_linear_insert(_RandomAccessIter __last, _Tp __val)
1942 _RandomAccessIter __next = __last;
1944 while (__val < *__next) {
1954 * This is a helper function for the sort routine.
1957 template<typename _RandomAccessIter, typename _Tp, typename _Compare>
1959 __unguarded_linear_insert(_RandomAccessIter __last, _Tp __val, _Compare __comp)
1961 _RandomAccessIter __next = __last;
1963 while (__comp(__val, *__next)) {
1973 * This is a helper function for the sort routine.
1976 template<typename _RandomAccessIter>
1978 __insertion_sort(_RandomAccessIter __first, _RandomAccessIter __last)
1980 if (__first == __last) return;
1982 for (_RandomAccessIter __i = __first + 1; __i != __last; ++__i)
1984 typename iterator_traits<_RandomAccessIter>::value_type __val = *__i;
1985 if (__val < *__first) {
1986 copy_backward(__first, __i, __i + 1);
1990 __unguarded_linear_insert(__i, __val);
1996 * This is a helper function for the sort routine.
1999 template<typename _RandomAccessIter, typename _Compare>
2001 __insertion_sort(_RandomAccessIter __first, _RandomAccessIter __last,
2004 if (__first == __last) return;
2006 for (_RandomAccessIter __i = __first + 1; __i != __last; ++__i)
2008 typename iterator_traits<_RandomAccessIter>::value_type __val = *__i;
2009 if (__comp(__val, *__first)) {
2010 copy_backward(__first, __i, __i + 1);
2014 __unguarded_linear_insert(__i, __val, __comp);
2020 * This is a helper function for the sort routine.
2023 template<typename _RandomAccessIter>
2025 __unguarded_insertion_sort(_RandomAccessIter __first, _RandomAccessIter __last)
2027 typedef typename iterator_traits<_RandomAccessIter>::value_type _ValueType;
2029 for (_RandomAccessIter __i = __first; __i != __last; ++__i)
2030 __unguarded_linear_insert(__i, _ValueType(*__i));
2035 * This is a helper function for the sort routine.
2038 template<typename _RandomAccessIter, typename _Compare>
2040 __unguarded_insertion_sort(_RandomAccessIter __first, _RandomAccessIter __last,
2043 typedef typename iterator_traits<_RandomAccessIter>::value_type _ValueType;
2045 for (_RandomAccessIter __i = __first; __i != __last; ++__i)
2046 __unguarded_linear_insert(__i, _ValueType(*__i), __comp);
2051 * This is a helper function for the sort routine.
2054 template<typename _RandomAccessIter>
2056 __final_insertion_sort(_RandomAccessIter __first, _RandomAccessIter __last)
2058 if (__last - __first > _M_threshold) {
2059 __insertion_sort(__first, __first + _M_threshold);
2060 __unguarded_insertion_sort(__first + _M_threshold, __last);
2063 __insertion_sort(__first, __last);
2068 * This is a helper function for the sort routine.
2071 template<typename _RandomAccessIter, typename _Compare>
2073 __final_insertion_sort(_RandomAccessIter __first, _RandomAccessIter __last,
2076 if (__last - __first > _M_threshold) {
2077 __insertion_sort(__first, __first + _M_threshold, __comp);
2078 __unguarded_insertion_sort(__first + _M_threshold, __last, __comp);
2081 __insertion_sort(__first, __last, __comp);
2086 * This is a helper function for the sort routine.
2089 template<typename _Size>
2094 for (__k = 0; __n != 1; __n >>= 1) ++__k;
2100 * This is a helper function for the sort routine.
2103 template<typename _RandomAccessIter, typename _Size>
2105 __introsort_loop(_RandomAccessIter __first, _RandomAccessIter __last,
2106 _Size __depth_limit)
2108 typedef typename iterator_traits<_RandomAccessIter>::value_type _ValueType;
2110 while (__last - __first > _M_threshold) {
2111 if (__depth_limit == 0) {
2112 partial_sort(__first, __last, __last);
2116 _RandomAccessIter __cut =
2117 __unguarded_partition(__first, __last,
2118 _ValueType(__median(*__first,
2119 *(__first + (__last - __first)/2),
2121 __introsort_loop(__cut, __last, __depth_limit);
2128 * This is a helper function for the sort routine.
2131 template<typename _RandomAccessIter, typename _Size, typename _Compare>
2133 __introsort_loop(_RandomAccessIter __first, _RandomAccessIter __last,
2134 _Size __depth_limit, _Compare __comp)
2136 typedef typename iterator_traits<_RandomAccessIter>::value_type _ValueType;
2138 while (__last - __first > _M_threshold) {
2139 if (__depth_limit == 0) {
2140 partial_sort(__first, __last, __last, __comp);
2144 _RandomAccessIter __cut =
2145 __unguarded_partition(__first, __last,
2146 _ValueType(__median(*__first,
2147 *(__first + (__last - __first)/2),
2148 *(__last - 1), __comp)),
2150 __introsort_loop(__cut, __last, __depth_limit, __comp);
2156 * @brief Sort the elements of a sequence.
2157 * @param first An iterator.
2158 * @param last Another iterator.
2161 * Sorts the elements in the range @p [first,last) in ascending order,
2162 * such that @p *(i+1)<*i is false for each iterator @p i in the range
2163 * @p [first,last-1).
2165 * The relative ordering of equivalent elements is not preserved, use
2166 * @p stable_sort() if this is needed.
2168 template<typename _RandomAccessIter>
2170 sort(_RandomAccessIter __first, _RandomAccessIter __last)
2172 typedef typename iterator_traits<_RandomAccessIter>::value_type _ValueType;
2174 // concept requirements
2175 __glibcpp_function_requires(_Mutable_RandomAccessIteratorConcept<
2177 __glibcpp_function_requires(_LessThanComparableConcept<_ValueType>)
2179 if (__first != __last) {
2180 __introsort_loop(__first, __last, __lg(__last - __first) * 2);
2181 __final_insertion_sort(__first, __last);
2186 * @brief Sort the elements of a sequence using a predicate for comparison.
2187 * @param first An iterator.
2188 * @param last Another iterator.
2189 * @param comp A comparison functor.
2192 * Sorts the elements in the range @p [first,last) in ascending order,
2193 * such that @p comp(*(i+1),*i) is false for every iterator @p i in the
2194 * range @p [first,last-1).
2196 * The relative ordering of equivalent elements is not preserved, use
2197 * @p stable_sort() if this is needed.
2199 template<typename _RandomAccessIter, typename _Compare>
2201 sort(_RandomAccessIter __first, _RandomAccessIter __last, _Compare __comp)
2203 typedef typename iterator_traits<_RandomAccessIter>::value_type _ValueType;
2205 // concept requirements
2206 __glibcpp_function_requires(_Mutable_RandomAccessIteratorConcept<
2208 __glibcpp_function_requires(_BinaryPredicateConcept<_Compare, _ValueType, _ValueType>)
2210 if (__first != __last) {
2211 __introsort_loop(__first, __last, __lg(__last - __first) * 2, __comp);
2212 __final_insertion_sort(__first, __last, __comp);
2219 * This is a helper function for the stable sorting routines.
2222 template<typename _RandomAccessIter>
2224 __inplace_stable_sort(_RandomAccessIter __first, _RandomAccessIter __last)
2226 if (__last - __first < 15) {
2227 __insertion_sort(__first, __last);
2230 _RandomAccessIter __middle = __first + (__last - __first) / 2;
2231 __inplace_stable_sort(__first, __middle);
2232 __inplace_stable_sort(__middle, __last);
2233 __merge_without_buffer(__first, __middle, __last,
2240 * This is a helper function for the stable sorting routines.
2243 template<typename _RandomAccessIter, typename _Compare>
2245 __inplace_stable_sort(_RandomAccessIter __first, _RandomAccessIter __last,
2248 if (__last - __first < 15) {
2249 __insertion_sort(__first, __last, __comp);
2252 _RandomAccessIter __middle = __first + (__last - __first) / 2;
2253 __inplace_stable_sort(__first, __middle, __comp);
2254 __inplace_stable_sort(__middle, __last, __comp);
2255 __merge_without_buffer(__first, __middle, __last,
2261 template<typename _RandomAccessIter1, typename _RandomAccessIter2,
2264 __merge_sort_loop(_RandomAccessIter1 __first, _RandomAccessIter1 __last,
2265 _RandomAccessIter2 __result, _Distance __step_size)
2267 _Distance __two_step = 2 * __step_size;
2269 while (__last - __first >= __two_step) {
2270 __result = merge(__first, __first + __step_size,
2271 __first + __step_size, __first + __two_step,
2273 __first += __two_step;
2276 __step_size = min(_Distance(__last - __first), __step_size);
2277 merge(__first, __first + __step_size, __first + __step_size, __last,
2281 template<typename _RandomAccessIter1, typename _RandomAccessIter2,
2282 typename _Distance, typename _Compare>
2284 __merge_sort_loop(_RandomAccessIter1 __first, _RandomAccessIter1 __last,
2285 _RandomAccessIter2 __result, _Distance __step_size,
2288 _Distance __two_step = 2 * __step_size;
2290 while (__last - __first >= __two_step) {
2291 __result = merge(__first, __first + __step_size,
2292 __first + __step_size, __first + __two_step,
2295 __first += __two_step;
2297 __step_size = min(_Distance(__last - __first), __step_size);
2299 merge(__first, __first + __step_size,
2300 __first + __step_size, __last,
2305 enum { _M_chunk_size = 7 };
2307 template<typename _RandomAccessIter, typename _Distance>
2309 __chunk_insertion_sort(_RandomAccessIter __first, _RandomAccessIter __last,
2310 _Distance __chunk_size)
2312 while (__last - __first >= __chunk_size) {
2313 __insertion_sort(__first, __first + __chunk_size);
2314 __first += __chunk_size;
2316 __insertion_sort(__first, __last);
2319 template<typename _RandomAccessIter, typename _Distance, typename _Compare>
2321 __chunk_insertion_sort(_RandomAccessIter __first, _RandomAccessIter __last,
2322 _Distance __chunk_size, _Compare __comp)
2324 while (__last - __first >= __chunk_size) {
2325 __insertion_sort(__first, __first + __chunk_size, __comp);
2326 __first += __chunk_size;
2328 __insertion_sort(__first, __last, __comp);
2331 template<typename _RandomAccessIter, typename _Pointer>
2333 __merge_sort_with_buffer(_RandomAccessIter __first, _RandomAccessIter __last,
2336 typedef typename iterator_traits<_RandomAccessIter>::difference_type _Distance;
2338 _Distance __len = __last - __first;
2339 _Pointer __buffer_last = __buffer + __len;
2341 _Distance __step_size = _M_chunk_size;
2342 __chunk_insertion_sort(__first, __last, __step_size);
2344 while (__step_size < __len) {
2345 __merge_sort_loop(__first, __last, __buffer, __step_size);
2347 __merge_sort_loop(__buffer, __buffer_last, __first, __step_size);
2352 template<typename _RandomAccessIter, typename _Pointer, typename _Compare>
2354 __merge_sort_with_buffer(_RandomAccessIter __first, _RandomAccessIter __last,
2355 _Pointer __buffer, _Compare __comp)
2357 typedef typename iterator_traits<_RandomAccessIter>::difference_type _Distance;
2359 _Distance __len = __last - __first;
2360 _Pointer __buffer_last = __buffer + __len;
2362 _Distance __step_size = _M_chunk_size;
2363 __chunk_insertion_sort(__first, __last, __step_size, __comp);
2365 while (__step_size < __len) {
2366 __merge_sort_loop(__first, __last, __buffer, __step_size, __comp);
2368 __merge_sort_loop(__buffer, __buffer_last, __first, __step_size, __comp);
2373 template<typename _RandomAccessIter, typename _Pointer, typename _Distance>
2375 __stable_sort_adaptive(_RandomAccessIter __first, _RandomAccessIter __last,
2376 _Pointer __buffer, _Distance __buffer_size)
2378 _Distance __len = (__last - __first + 1) / 2;
2379 _RandomAccessIter __middle = __first + __len;
2380 if (__len > __buffer_size) {
2381 __stable_sort_adaptive(__first, __middle, __buffer, __buffer_size);
2382 __stable_sort_adaptive(__middle, __last, __buffer, __buffer_size);
2385 __merge_sort_with_buffer(__first, __middle, __buffer);
2386 __merge_sort_with_buffer(__middle, __last, __buffer);
2388 __merge_adaptive(__first, __middle, __last, _Distance(__middle - __first),
2389 _Distance(__last - __middle), __buffer, __buffer_size);
2392 template<typename _RandomAccessIter, typename _Pointer, typename _Distance,
2395 __stable_sort_adaptive(_RandomAccessIter __first, _RandomAccessIter __last,
2396 _Pointer __buffer, _Distance __buffer_size,
2399 _Distance __len = (__last - __first + 1) / 2;
2400 _RandomAccessIter __middle = __first + __len;
2401 if (__len > __buffer_size) {
2402 __stable_sort_adaptive(__first, __middle, __buffer, __buffer_size,
2404 __stable_sort_adaptive(__middle, __last, __buffer, __buffer_size,
2408 __merge_sort_with_buffer(__first, __middle, __buffer, __comp);
2409 __merge_sort_with_buffer(__middle, __last, __buffer, __comp);
2411 __merge_adaptive(__first, __middle, __last, _Distance(__middle - __first),
2412 _Distance(__last - __middle), __buffer, __buffer_size,
2417 * @brief Sort the elements of a sequence, preserving the relative order
2418 * of equivalent elements.
2419 * @param first An iterator.
2420 * @param last Another iterator.
2423 * Sorts the elements in the range @p [first,last) in ascending order,
2424 * such that @p *(i+1)<*i is false for each iterator @p i in the range
2425 * @p [first,last-1).
2427 * The relative ordering of equivalent elements is preserved, so any two
2428 * elements @p x and @p y in the range @p [first,last) such that
2429 * @p x<y is false and @p y<x is false will have the same relative
2430 * ordering after calling @p stable_sort().
2432 template<typename _RandomAccessIter>
2434 stable_sort(_RandomAccessIter __first, _RandomAccessIter __last)
2436 typedef typename iterator_traits<_RandomAccessIter>::value_type _ValueType;
2437 typedef typename iterator_traits<_RandomAccessIter>::difference_type _DistanceType;
2439 // concept requirements
2440 __glibcpp_function_requires(_Mutable_RandomAccessIteratorConcept<
2442 __glibcpp_function_requires(_LessThanComparableConcept<_ValueType>)
2444 _Temporary_buffer<_RandomAccessIter, _ValueType> buf(__first, __last);
2445 if (buf.begin() == 0)
2446 __inplace_stable_sort(__first, __last);
2448 __stable_sort_adaptive(__first, __last, buf.begin(), _DistanceType(buf.size()));
2452 * @brief Sort the elements of a sequence using a predicate for comparison,
2453 * preserving the relative order of equivalent elements.
2454 * @param first An iterator.
2455 * @param last Another iterator.
2456 * @param comp A comparison functor.
2459 * Sorts the elements in the range @p [first,last) in ascending order,
2460 * such that @p comp(*(i+1),*i) is false for each iterator @p i in the
2461 * range @p [first,last-1).
2463 * The relative ordering of equivalent elements is preserved, so any two
2464 * elements @p x and @p y in the range @p [first,last) such that
2465 * @p comp(x,y) is false and @p comp(y,x) is false will have the same
2466 * relative ordering after calling @p stable_sort().
2468 template<typename _RandomAccessIter, typename _Compare>
2470 stable_sort(_RandomAccessIter __first, _RandomAccessIter __last, _Compare __comp)
2472 typedef typename iterator_traits<_RandomAccessIter>::value_type _ValueType;
2473 typedef typename iterator_traits<_RandomAccessIter>::difference_type _DistanceType;
2475 // concept requirements
2476 __glibcpp_function_requires(_Mutable_RandomAccessIteratorConcept<
2478 __glibcpp_function_requires(_BinaryPredicateConcept<_Compare,
2479 _ValueType, _ValueType>)
2481 _Temporary_buffer<_RandomAccessIter, _ValueType> buf(__first, __last);
2482 if (buf.begin() == 0)
2483 __inplace_stable_sort(__first, __last, __comp);
2485 __stable_sort_adaptive(__first, __last, buf.begin(), _DistanceType(buf.size()),
2490 * @brief Sort the smallest elements of a sequence.
2491 * @param first An iterator.
2492 * @param middle Another iterator.
2493 * @param last Another iterator.
2496 * Sorts the smallest @p (middle-first) elements in the range
2497 * @p [first,last) and moves them to the range @p [first,middle). The
2498 * order of the remaining elements in the range @p [middle,last) is
2500 * After the sort if @p i and @j are iterators in the range
2501 * @p [first,middle) such that @i precedes @j and @k is an iterator in
2502 * the range @p [middle,last) then @p *j<*i and @p *k<*i are both false.
2504 template<typename _RandomAccessIter>
2506 partial_sort(_RandomAccessIter __first,
2507 _RandomAccessIter __middle,
2508 _RandomAccessIter __last)
2510 typedef typename iterator_traits<_RandomAccessIter>::value_type _ValueType;
2512 // concept requirements
2513 __glibcpp_function_requires(_Mutable_RandomAccessIteratorConcept<
2515 __glibcpp_function_requires(_LessThanComparableConcept<_ValueType>)
2517 make_heap(__first, __middle);
2518 for (_RandomAccessIter __i = __middle; __i < __last; ++__i)
2519 if (*__i < *__first)
2520 __pop_heap(__first, __middle, __i, _ValueType(*__i));
2521 sort_heap(__first, __middle);
2525 * @brief Sort the smallest elements of a sequence using a predicate
2527 * @param first An iterator.
2528 * @param middle Another iterator.
2529 * @param last Another iterator.
2530 * @param comp A comparison functor.
2533 * Sorts the smallest @p (middle-first) elements in the range
2534 * @p [first,last) and moves them to the range @p [first,middle). The
2535 * order of the remaining elements in the range @p [middle,last) is
2537 * After the sort if @p i and @j are iterators in the range
2538 * @p [first,middle) such that @i precedes @j and @k is an iterator in
2539 * the range @p [middle,last) then @p *comp(j,*i) and @p comp(*k,*i)
2542 template<typename _RandomAccessIter, typename _Compare>
2544 partial_sort(_RandomAccessIter __first,
2545 _RandomAccessIter __middle,
2546 _RandomAccessIter __last,
2549 typedef typename iterator_traits<_RandomAccessIter>::value_type _ValueType;
2551 // concept requirements
2552 __glibcpp_function_requires(_Mutable_RandomAccessIteratorConcept<
2554 __glibcpp_function_requires(_BinaryPredicateConcept<_Compare,
2555 _ValueType, _ValueType>)
2557 make_heap(__first, __middle, __comp);
2558 for (_RandomAccessIter __i = __middle; __i < __last; ++__i)
2559 if (__comp(*__i, *__first))
2560 __pop_heap(__first, __middle, __i, _ValueType(*__i), __comp);
2561 sort_heap(__first, __middle, __comp);
2565 * @brief Copy the smallest elements of a sequence.
2566 * @param first An iterator.
2567 * @param last Another iterator.
2568 * @param result_first A random-access iterator.
2569 * @param result_last Another random-access iterator.
2570 * @return An iterator indicating the end of the resulting sequence.
2572 * Copies and sorts the smallest N values from the range @p [first,last)
2573 * to the range beginning at @p result_first, where the number of
2574 * elements to be copied, @p N, is the smaller of @p (last-first) and
2575 * @p (result_last-result_first).
2576 * After the sort if @p i and @j are iterators in the range
2577 * @p [result_first,result_first+N) such that @i precedes @j then
2578 * @p *j<*i is false.
2579 * The value returned is @p result_first+N.
2581 template<typename _InputIter, typename _RandomAccessIter>
2583 partial_sort_copy(_InputIter __first, _InputIter __last,
2584 _RandomAccessIter __result_first,
2585 _RandomAccessIter __result_last)
2587 typedef typename iterator_traits<_InputIter>::value_type _InputValueType;
2588 typedef typename iterator_traits<_RandomAccessIter>::value_type _OutputValueType;
2589 typedef typename iterator_traits<_RandomAccessIter>::difference_type _DistanceType;
2591 // concept requirements
2592 __glibcpp_function_requires(_InputIteratorConcept<_InputIter>)
2593 __glibcpp_function_requires(_ConvertibleConcept<_InputValueType, _OutputValueType>)
2594 __glibcpp_function_requires(_LessThanComparableConcept<_OutputValueType>)
2595 __glibcpp_function_requires(_LessThanComparableConcept<_InputValueType>)
2597 if (__result_first == __result_last) return __result_last;
2598 _RandomAccessIter __result_real_last = __result_first;
2599 while(__first != __last && __result_real_last != __result_last) {
2600 *__result_real_last = *__first;
2601 ++__result_real_last;
2604 make_heap(__result_first, __result_real_last);
2605 while (__first != __last) {
2606 if (*__first < *__result_first)
2607 __adjust_heap(__result_first, _DistanceType(0),
2608 _DistanceType(__result_real_last - __result_first),
2609 _InputValueType(*__first));
2612 sort_heap(__result_first, __result_real_last);
2613 return __result_real_last;
2617 * @brief Copy the smallest elements of a sequence using a predicate for
2619 * @param first An input iterator.
2620 * @param last Another input iterator.
2621 * @param result_first A random-access iterator.
2622 * @param result_last Another random-access iterator.
2623 * @param comp A comparison functor.
2624 * @return An iterator indicating the end of the resulting sequence.
2626 * Copies and sorts the smallest N values from the range @p [first,last)
2627 * to the range beginning at @p result_first, where the number of
2628 * elements to be copied, @p N, is the smaller of @p (last-first) and
2629 * @p (result_last-result_first).
2630 * After the sort if @p i and @j are iterators in the range
2631 * @p [result_first,result_first+N) such that @i precedes @j then
2632 * @p comp(*j,*i) is false.
2633 * The value returned is @p result_first+N.
2635 template<typename _InputIter, typename _RandomAccessIter, typename _Compare>
2637 partial_sort_copy(_InputIter __first, _InputIter __last,
2638 _RandomAccessIter __result_first,
2639 _RandomAccessIter __result_last,
2642 typedef typename iterator_traits<_InputIter>::value_type _InputValueType;
2643 typedef typename iterator_traits<_RandomAccessIter>::value_type _OutputValueType;
2644 typedef typename iterator_traits<_RandomAccessIter>::difference_type _DistanceType;
2646 // concept requirements
2647 __glibcpp_function_requires(_InputIteratorConcept<_InputIter>)
2648 __glibcpp_function_requires(_Mutable_RandomAccessIteratorConcept<_RandomAccessIter>)
2649 __glibcpp_function_requires(_ConvertibleConcept<_InputValueType, _OutputValueType>)
2650 __glibcpp_function_requires(_BinaryPredicateConcept<_Compare,
2651 _OutputValueType, _OutputValueType>)
2653 if (__result_first == __result_last) return __result_last;
2654 _RandomAccessIter __result_real_last = __result_first;
2655 while(__first != __last && __result_real_last != __result_last) {
2656 *__result_real_last = *__first;
2657 ++__result_real_last;
2660 make_heap(__result_first, __result_real_last, __comp);
2661 while (__first != __last) {
2662 if (__comp(*__first, *__result_first))
2663 __adjust_heap(__result_first, _DistanceType(0),
2664 _DistanceType(__result_real_last - __result_first),
2665 _InputValueType(*__first),
2669 sort_heap(__result_first, __result_real_last, __comp);
2670 return __result_real_last;
2674 * @brief Sort a sequence just enough to find a particular position.
2675 * @param first An iterator.
2676 * @param nth Another iterator.
2677 * @param last Another iterator.
2680 * Rearranges the elements in the range @p [first,last) so that @p *nth
2681 * is the same element that would have been in that position had the
2682 * whole sequence been sorted.
2683 * whole sequence been sorted. The elements either side of @p *nth are
2684 * not completely sorted, but for any iterator @i in the range
2685 * @p [first,nth) and any iterator @j in the range @p [nth,last) it
2686 * holds that @p *j<*i is false.
2688 template<typename _RandomAccessIter>
2690 nth_element(_RandomAccessIter __first,
2691 _RandomAccessIter __nth,
2692 _RandomAccessIter __last)
2694 typedef typename iterator_traits<_RandomAccessIter>::value_type _ValueType;
2696 // concept requirements
2697 __glibcpp_function_requires(_Mutable_RandomAccessIteratorConcept<_RandomAccessIter>)
2698 __glibcpp_function_requires(_LessThanComparableConcept<_ValueType>)
2700 while (__last - __first > 3) {
2701 _RandomAccessIter __cut =
2702 __unguarded_partition(__first, __last,
2703 _ValueType(__median(*__first,
2704 *(__first + (__last - __first)/2),
2711 __insertion_sort(__first, __last);
2715 * @brief Sort a sequence just enough to find a particular position
2716 * using a predicate for comparison.
2717 * @param first An iterator.
2718 * @param nth Another iterator.
2719 * @param last Another iterator.
2720 * @param comp A comparison functor.
2723 * Rearranges the elements in the range @p [first,last) so that @p *nth
2724 * is the same element that would have been in that position had the
2725 * whole sequence been sorted. The elements either side of @p *nth are
2726 * not completely sorted, but for any iterator @i in the range
2727 * @p [first,nth) and any iterator @j in the range @p [nth,last) it
2728 * holds that @p comp(*j,*i) is false.
2730 template<typename _RandomAccessIter, typename _Compare>
2732 nth_element(_RandomAccessIter __first,
2733 _RandomAccessIter __nth,
2734 _RandomAccessIter __last,
2737 typedef typename iterator_traits<_RandomAccessIter>::value_type _ValueType;
2739 // concept requirements
2740 __glibcpp_function_requires(_Mutable_RandomAccessIteratorConcept<_RandomAccessIter>)
2741 __glibcpp_function_requires(_BinaryPredicateConcept<_Compare,
2742 _ValueType, _ValueType>)
2744 while (__last - __first > 3) {
2745 _RandomAccessIter __cut =
2746 __unguarded_partition(__first, __last,
2747 _ValueType(__median(*__first,
2748 *(__first + (__last - __first)/2),
2757 __insertion_sort(__first, __last, __comp);
2762 * @brief Finds the first position in which @a val could be inserted
2763 * without changing the ordering.
2764 * @param first An iterator.
2765 * @param last Another iterator.
2766 * @param val The search term.
2767 * @return An iterator pointing to the first element "not less than" @a val.
2768 * @ingroup binarysearch
2770 template<typename _ForwardIter, typename _Tp>
2772 lower_bound(_ForwardIter __first, _ForwardIter __last, const _Tp& __val)
2774 typedef typename iterator_traits<_ForwardIter>::value_type _ValueType;
2775 typedef typename iterator_traits<_ForwardIter>::difference_type _DistanceType;
2777 // concept requirements
2778 // Note that these are slightly stricter than those of the 4-argument
2779 // version, defined next. The difference is in the strictness of the
2780 // comparison operations... so for looser checking, define your own
2781 // comparison function, as was intended.
2782 __glibcpp_function_requires(_ForwardIteratorConcept<_ForwardIter>)
2783 __glibcpp_function_requires(_SameTypeConcept<_Tp, _ValueType>)
2784 __glibcpp_function_requires(_LessThanComparableConcept<_Tp>)
2786 _DistanceType __len = distance(__first, __last);
2787 _DistanceType __half;
2788 _ForwardIter __middle;
2791 __half = __len >> 1;
2793 advance(__middle, __half);
2794 if (*__middle < __val) {
2797 __len = __len - __half - 1;
2806 * @brief Finds the first position in which @a val could be inserted
2807 * without changing the ordering.
2808 * @param first An iterator.
2809 * @param last Another iterator.
2810 * @param val The search term.
2811 * @param comp A functor to use for comparisons.
2812 * @return An iterator pointing to the first element "not less than" @a val.
2813 * @ingroup binarysearch
2815 * The comparison function should have the same effects on ordering as
2816 * the function used for the initial sort.
2818 template<typename _ForwardIter, typename _Tp, typename _Compare>
2820 lower_bound(_ForwardIter __first, _ForwardIter __last,
2821 const _Tp& __val, _Compare __comp)
2823 typedef typename iterator_traits<_ForwardIter>::value_type _ValueType;
2824 typedef typename iterator_traits<_ForwardIter>::difference_type _DistanceType;
2826 // concept requirements
2827 __glibcpp_function_requires(_ForwardIteratorConcept<_ForwardIter>)
2828 __glibcpp_function_requires(_BinaryPredicateConcept<_Compare, _ValueType, _Tp>)
2830 _DistanceType __len = distance(__first, __last);
2831 _DistanceType __half;
2832 _ForwardIter __middle;
2835 __half = __len >> 1;
2837 advance(__middle, __half);
2838 if (__comp(*__middle, __val)) {
2841 __len = __len - __half - 1;
2850 * @brief Finds the last position in which @a val could be inserted
2851 * without changing the ordering.
2852 * @param first An iterator.
2853 * @param last Another iterator.
2854 * @param val The search term.
2855 * @return An iterator pointing to the first element greater than @a val.
2856 * @ingroup binarysearch
2858 template<typename _ForwardIter, typename _Tp>
2860 upper_bound(_ForwardIter __first, _ForwardIter __last, const _Tp& __val)
2862 typedef typename iterator_traits<_ForwardIter>::value_type _ValueType;
2863 typedef typename iterator_traits<_ForwardIter>::difference_type _DistanceType;
2865 // concept requirements
2866 // See comments on lower_bound.
2867 __glibcpp_function_requires(_ForwardIteratorConcept<_ForwardIter>)
2868 __glibcpp_function_requires(_SameTypeConcept<_Tp, _ValueType>)
2869 __glibcpp_function_requires(_LessThanComparableConcept<_Tp>)
2871 _DistanceType __len = distance(__first, __last);
2872 _DistanceType __half;
2873 _ForwardIter __middle;
2876 __half = __len >> 1;
2878 advance(__middle, __half);
2879 if (__val < *__middle)
2884 __len = __len - __half - 1;
2891 * @brief Finds the last position in which @a val could be inserted
2892 * without changing the ordering.
2893 * @param first An iterator.
2894 * @param last Another iterator.
2895 * @param val The search term.
2896 * @param comp A functor to use for comparisons.
2897 * @return An iterator pointing to the first element greater than @a val.
2898 * @ingroup binarysearch
2900 * The comparison function should have the same effects on ordering as
2901 * the function used for the initial sort.
2903 template<typename _ForwardIter, typename _Tp, typename _Compare>
2905 upper_bound(_ForwardIter __first, _ForwardIter __last,
2906 const _Tp& __val, _Compare __comp)
2908 typedef typename iterator_traits<_ForwardIter>::value_type _ValueType;
2909 typedef typename iterator_traits<_ForwardIter>::difference_type _DistanceType;
2911 // concept requirements
2912 __glibcpp_function_requires(_ForwardIteratorConcept<_ForwardIter>)
2913 __glibcpp_function_requires(_BinaryPredicateConcept<_Compare, _Tp, _ValueType>)
2915 _DistanceType __len = distance(__first, __last);
2916 _DistanceType __half;
2917 _ForwardIter __middle;
2920 __half = __len >> 1;
2922 advance(__middle, __half);
2923 if (__comp(__val, *__middle))
2928 __len = __len - __half - 1;
2935 * @brief Finds the largest subrange in which @a val could be inserted
2936 * at any place in it without changing the ordering.
2937 * @param first An iterator.
2938 * @param last Another iterator.
2939 * @param val The search term.
2940 * @return An pair of iterators defining the subrange.
2941 * @ingroup binarysearch
2943 * This is equivalent to
2945 * std::make_pair(lower_bound(first, last, val),
2946 * upper_bound(first, last, val))
2948 * but does not actually call those functions.
2950 template<typename _ForwardIter, typename _Tp>
2951 pair<_ForwardIter, _ForwardIter>
2952 equal_range(_ForwardIter __first, _ForwardIter __last, const _Tp& __val)
2954 typedef typename iterator_traits<_ForwardIter>::value_type _ValueType;
2955 typedef typename iterator_traits<_ForwardIter>::difference_type _DistanceType;
2957 // concept requirements
2958 // See comments on lower_bound.
2959 __glibcpp_function_requires(_ForwardIteratorConcept<_ForwardIter>)
2960 __glibcpp_function_requires(_SameTypeConcept<_Tp, _ValueType>)
2961 __glibcpp_function_requires(_LessThanComparableConcept<_Tp>)
2963 _DistanceType __len = distance(__first, __last);
2964 _DistanceType __half;
2965 _ForwardIter __middle, __left, __right;
2968 __half = __len >> 1;
2970 advance(__middle, __half);
2971 if (*__middle < __val) {
2974 __len = __len - __half - 1;
2976 else if (__val < *__middle)
2979 __left = lower_bound(__first, __middle, __val);
2980 advance(__first, __len);
2981 __right = upper_bound(++__middle, __first, __val);
2982 return pair<_ForwardIter, _ForwardIter>(__left, __right);
2985 return pair<_ForwardIter, _ForwardIter>(__first, __first);
2989 * @brief Finds the largest subrange in which @a val could be inserted
2990 * at any place in it without changing the ordering.
2991 * @param first An iterator.
2992 * @param last Another iterator.
2993 * @param val The search term.
2994 * @param comp A functor to use for comparisons.
2995 * @return An pair of iterators defining the subrange.
2996 * @ingroup binarysearch
2998 * This is equivalent to
3000 * std::make_pair(lower_bound(first, last, val, comp),
3001 * upper_bound(first, last, val, comp))
3003 * but does not actually call those functions.
3005 template<typename _ForwardIter, typename _Tp, typename _Compare>
3006 pair<_ForwardIter, _ForwardIter>
3007 equal_range(_ForwardIter __first, _ForwardIter __last, const _Tp& __val,
3010 typedef typename iterator_traits<_ForwardIter>::value_type _ValueType;
3011 typedef typename iterator_traits<_ForwardIter>::difference_type _DistanceType;
3013 // concept requirements
3014 __glibcpp_function_requires(_ForwardIteratorConcept<_ForwardIter>)
3015 __glibcpp_function_requires(_BinaryPredicateConcept<_Compare, _ValueType, _Tp>)
3016 __glibcpp_function_requires(_BinaryPredicateConcept<_Compare, _Tp, _ValueType>)
3018 _DistanceType __len = distance(__first, __last);
3019 _DistanceType __half;
3020 _ForwardIter __middle, __left, __right;
3023 __half = __len >> 1;
3025 advance(__middle, __half);
3026 if (__comp(*__middle, __val)) {
3029 __len = __len - __half - 1;
3031 else if (__comp(__val, *__middle))
3034 __left = lower_bound(__first, __middle, __val, __comp);
3035 advance(__first, __len);
3036 __right = upper_bound(++__middle, __first, __val, __comp);
3037 return pair<_ForwardIter, _ForwardIter>(__left, __right);
3040 return pair<_ForwardIter, _ForwardIter>(__first, __first);
3044 * @brief Determines whether an element exists in a range.
3045 * @param first An iterator.
3046 * @param last Another iterator.
3047 * @param val The search term.
3048 * @return True if @a val (or its equivelent) is in [@a first,@a last ].
3049 * @ingroup binarysearch
3051 * Note that this does not actually return an iterator to @a val. For
3052 * that, use std::find or a container's specialized find member functions.
3054 template<typename _ForwardIter, typename _Tp>
3056 binary_search(_ForwardIter __first, _ForwardIter __last,
3059 // concept requirements
3060 // See comments on lower_bound.
3061 __glibcpp_function_requires(_ForwardIteratorConcept<_ForwardIter>)
3062 __glibcpp_function_requires(_SameTypeConcept<_Tp,
3063 typename iterator_traits<_ForwardIter>::value_type>)
3064 __glibcpp_function_requires(_LessThanComparableConcept<_Tp>)
3066 _ForwardIter __i = lower_bound(__first, __last, __val);
3067 return __i != __last && !(__val < *__i);
3071 * @brief Determines whether an element exists in a range.
3072 * @param first An iterator.
3073 * @param last Another iterator.
3074 * @param val The search term.
3075 * @param comp A functor to use for comparisons.
3076 * @return True if @a val (or its equivelent) is in [@a first,@a last ].
3077 * @ingroup binarysearch
3079 * Note that this does not actually return an iterator to @a val. For
3080 * that, use std::find or a container's specialized find member functions.
3082 * The comparison function should have the same effects on ordering as
3083 * the function used for the initial sort.
3085 template<typename _ForwardIter, typename _Tp, typename _Compare>
3087 binary_search(_ForwardIter __first, _ForwardIter __last,
3088 const _Tp& __val, _Compare __comp)
3090 // concept requirements
3091 __glibcpp_function_requires(_ForwardIteratorConcept<_ForwardIter>)
3092 __glibcpp_function_requires(_BinaryPredicateConcept<_Compare,
3093 typename iterator_traits<_ForwardIter>::value_type, _Tp>)
3094 __glibcpp_function_requires(_BinaryPredicateConcept<_Compare, _Tp,
3095 typename iterator_traits<_ForwardIter>::value_type>)
3097 _ForwardIter __i = lower_bound(__first, __last, __val, __comp);
3098 return __i != __last && !__comp(__val, *__i);
3102 * @brief Merges two sorted ranges.
3103 * @param first1 An iterator.
3104 * @param first2 Another iterator.
3105 * @param last1 Another iterator.
3106 * @param last2 Another iterator.
3107 * @param result An iterator pointing to the end of the merged range.
3108 * @return An iterator pointing to the first element "not less than" @a val.
3110 * Merges the ranges [first1,last1) and [first2,last2) into the sorted range
3111 * [result, result + (last1-first1) + (last2-first2)). Both input ranges
3112 * must be sorted, and the output range must not overlap with either of
3113 * the input ranges. The sort is @e stable, that is, for equivalent
3114 * elements in the two ranges, elements from the first range will always
3115 * come before elements from the second.
3117 template<typename _InputIter1, typename _InputIter2, typename _OutputIter>
3119 merge(_InputIter1 __first1, _InputIter1 __last1,
3120 _InputIter2 __first2, _InputIter2 __last2,
3121 _OutputIter __result)
3123 // concept requirements
3124 __glibcpp_function_requires(_InputIteratorConcept<_InputIter1>)
3125 __glibcpp_function_requires(_InputIteratorConcept<_InputIter2>)
3126 __glibcpp_function_requires(_OutputIteratorConcept<_OutputIter,
3127 typename iterator_traits<_InputIter1>::value_type>)
3128 __glibcpp_function_requires(_SameTypeConcept<
3129 typename iterator_traits<_InputIter1>::value_type,
3130 typename iterator_traits<_InputIter2>::value_type>)
3131 __glibcpp_function_requires(_LessThanComparableConcept<
3132 typename iterator_traits<_InputIter1>::value_type>)
3134 while (__first1 != __last1 && __first2 != __last2) {
3135 if (*__first2 < *__first1) {
3136 *__result = *__first2;
3140 *__result = *__first1;
3145 return copy(__first2, __last2, copy(__first1, __last1, __result));
3149 * @brief Merges two sorted ranges.
3150 * @param first1 An iterator.
3151 * @param first2 Another iterator.
3152 * @param last1 Another iterator.
3153 * @param last2 Another iterator.
3154 * @param result An iterator pointing to the end of the merged range.
3155 * @param comp A functor to use for comparisons.
3156 * @return An iterator pointing to the first element "not less than" @a val.
3158 * Merges the ranges [first1,last1) and [first2,last2) into the sorted range
3159 * [result, result + (last1-first1) + (last2-first2)). Both input ranges
3160 * must be sorted, and the output range must not overlap with either of
3161 * the input ranges. The sort is @e stable, that is, for equivalent
3162 * elements in the two ranges, elements from the first range will always
3163 * come before elements from the second.
3165 * The comparison function should have the same effects on ordering as
3166 * the function used for the initial sort.
3168 template<typename _InputIter1, typename _InputIter2, typename _OutputIter,
3171 merge(_InputIter1 __first1, _InputIter1 __last1,
3172 _InputIter2 __first2, _InputIter2 __last2,
3173 _OutputIter __result, _Compare __comp)
3175 // concept requirements
3176 __glibcpp_function_requires(_InputIteratorConcept<_InputIter1>)
3177 __glibcpp_function_requires(_InputIteratorConcept<_InputIter2>)
3178 __glibcpp_function_requires(_SameTypeConcept<
3179 typename iterator_traits<_InputIter1>::value_type,
3180 typename iterator_traits<_InputIter2>::value_type>)
3181 __glibcpp_function_requires(_OutputIteratorConcept<_OutputIter,
3182 typename iterator_traits<_InputIter1>::value_type>)
3183 __glibcpp_function_requires(_BinaryPredicateConcept<_Compare,
3184 typename iterator_traits<_InputIter1>::value_type,
3185 typename iterator_traits<_InputIter2>::value_type>)
3187 while (__first1 != __last1 && __first2 != __last2) {
3188 if (__comp(*__first2, *__first1)) {
3189 *__result = *__first2;
3193 *__result = *__first1;
3198 return copy(__first2, __last2, copy(__first1, __last1, __result));
3203 * This is a helper function for the merge routines.
3206 template<typename _BidirectionalIter, typename _Distance>
3208 __merge_without_buffer(_BidirectionalIter __first,
3209 _BidirectionalIter __middle,
3210 _BidirectionalIter __last,
3211 _Distance __len1, _Distance __len2)
3213 if (__len1 == 0 || __len2 == 0)
3215 if (__len1 + __len2 == 2) {
3216 if (*__middle < *__first)
3217 iter_swap(__first, __middle);
3220 _BidirectionalIter __first_cut = __first;
3221 _BidirectionalIter __second_cut = __middle;
3222 _Distance __len11 = 0;
3223 _Distance __len22 = 0;
3224 if (__len1 > __len2) {
3225 __len11 = __len1 / 2;
3226 advance(__first_cut, __len11);
3227 __second_cut = lower_bound(__middle, __last, *__first_cut);
3228 __len22 = distance(__middle, __second_cut);
3231 __len22 = __len2 / 2;
3232 advance(__second_cut, __len22);
3233 __first_cut = upper_bound(__first, __middle, *__second_cut);
3234 __len11 = distance(__first, __first_cut);
3236 rotate(__first_cut, __middle, __second_cut);
3237 _BidirectionalIter __new_middle = __first_cut;
3238 advance(__new_middle, distance(__middle, __second_cut));
3239 __merge_without_buffer(__first, __first_cut, __new_middle,
3241 __merge_without_buffer(__new_middle, __second_cut, __last,
3242 __len1 - __len11, __len2 - __len22);
3247 * This is a helper function for the merge routines.
3250 template<typename _BidirectionalIter, typename _Distance, typename _Compare>
3252 __merge_without_buffer(_BidirectionalIter __first,
3253 _BidirectionalIter __middle,
3254 _BidirectionalIter __last,
3255 _Distance __len1, _Distance __len2,
3258 if (__len1 == 0 || __len2 == 0)
3260 if (__len1 + __len2 == 2) {
3261 if (__comp(*__middle, *__first))
3262 iter_swap(__first, __middle);
3265 _BidirectionalIter __first_cut = __first;
3266 _BidirectionalIter __second_cut = __middle;
3267 _Distance __len11 = 0;
3268 _Distance __len22 = 0;
3269 if (__len1 > __len2) {
3270 __len11 = __len1 / 2;
3271 advance(__first_cut, __len11);
3272 __second_cut = lower_bound(__middle, __last, *__first_cut, __comp);
3273 __len22 = distance(__middle, __second_cut);
3276 __len22 = __len2 / 2;
3277 advance(__second_cut, __len22);
3278 __first_cut = upper_bound(__first, __middle, *__second_cut, __comp);
3279 __len11 = distance(__first, __first_cut);
3281 rotate(__first_cut, __middle, __second_cut);
3282 _BidirectionalIter __new_middle = __first_cut;
3283 advance(__new_middle, distance(__middle, __second_cut));
3284 __merge_without_buffer(__first, __first_cut, __new_middle,
3285 __len11, __len22, __comp);
3286 __merge_without_buffer(__new_middle, __second_cut, __last,
3287 __len1 - __len11, __len2 - __len22, __comp);
3292 * This is a helper function for the merge routines.
3295 template<typename _BidirectionalIter1, typename _BidirectionalIter2,
3298 __rotate_adaptive(_BidirectionalIter1 __first,
3299 _BidirectionalIter1 __middle,
3300 _BidirectionalIter1 __last,
3301 _Distance __len1, _Distance __len2,
3302 _BidirectionalIter2 __buffer,
3303 _Distance __buffer_size)
3305 _BidirectionalIter2 __buffer_end;
3306 if (__len1 > __len2 && __len2 <= __buffer_size) {
3307 __buffer_end = copy(__middle, __last, __buffer);
3308 copy_backward(__first, __middle, __last);
3309 return copy(__buffer, __buffer_end, __first);
3311 else if (__len1 <= __buffer_size) {
3312 __buffer_end = copy(__first, __middle, __buffer);
3313 copy(__middle, __last, __first);
3314 return copy_backward(__buffer, __buffer_end, __last);
3317 rotate(__first, __middle, __last);
3318 advance(__first, distance(__middle, __last));
3325 * This is a helper function for the merge routines.
3328 template<typename _BidirectionalIter1, typename _BidirectionalIter2,
3329 typename _BidirectionalIter3>
3331 __merge_backward(_BidirectionalIter1 __first1, _BidirectionalIter1 __last1,
3332 _BidirectionalIter2 __first2, _BidirectionalIter2 __last2,
3333 _BidirectionalIter3 __result)
3335 if (__first1 == __last1)
3336 return copy_backward(__first2, __last2, __result);
3337 if (__first2 == __last2)
3338 return copy_backward(__first1, __last1, __result);
3342 if (*__last2 < *__last1) {
3343 *--__result = *__last1;
3344 if (__first1 == __last1)
3345 return copy_backward(__first2, ++__last2, __result);
3349 *--__result = *__last2;
3350 if (__first2 == __last2)
3351 return copy_backward(__first1, ++__last1, __result);
3359 * This is a helper function for the merge routines.
3362 template<typename _BidirectionalIter1, typename _BidirectionalIter2,
3363 typename _BidirectionalIter3, typename _Compare>
3365 __merge_backward(_BidirectionalIter1 __first1, _BidirectionalIter1 __last1,
3366 _BidirectionalIter2 __first2, _BidirectionalIter2 __last2,
3367 _BidirectionalIter3 __result,
3370 if (__first1 == __last1)
3371 return copy_backward(__first2, __last2, __result);
3372 if (__first2 == __last2)
3373 return copy_backward(__first1, __last1, __result);
3377 if (__comp(*__last2, *__last1)) {
3378 *--__result = *__last1;
3379 if (__first1 == __last1)
3380 return copy_backward(__first2, ++__last2, __result);
3384 *--__result = *__last2;
3385 if (__first2 == __last2)
3386 return copy_backward(__first1, ++__last1, __result);
3394 * This is a helper function for the merge routines.
3397 template<typename _BidirectionalIter, typename _Distance, typename _Pointer>
3399 __merge_adaptive(_BidirectionalIter __first,
3400 _BidirectionalIter __middle,
3401 _BidirectionalIter __last,
3402 _Distance __len1, _Distance __len2,
3403 _Pointer __buffer, _Distance __buffer_size)
3405 if (__len1 <= __len2 && __len1 <= __buffer_size) {
3406 _Pointer __buffer_end = copy(__first, __middle, __buffer);
3407 merge(__buffer, __buffer_end, __middle, __last, __first);
3409 else if (__len2 <= __buffer_size) {
3410 _Pointer __buffer_end = copy(__middle, __last, __buffer);
3411 __merge_backward(__first, __middle, __buffer, __buffer_end, __last);
3414 _BidirectionalIter __first_cut = __first;
3415 _BidirectionalIter __second_cut = __middle;
3416 _Distance __len11 = 0;
3417 _Distance __len22 = 0;
3418 if (__len1 > __len2) {
3419 __len11 = __len1 / 2;
3420 advance(__first_cut, __len11);
3421 __second_cut = lower_bound(__middle, __last, *__first_cut);
3422 __len22 = distance(__middle, __second_cut);
3425 __len22 = __len2 / 2;
3426 advance(__second_cut, __len22);
3427 __first_cut = upper_bound(__first, __middle, *__second_cut);
3428 __len11 = distance(__first, __first_cut);
3430 _BidirectionalIter __new_middle =
3431 __rotate_adaptive(__first_cut, __middle, __second_cut,
3432 __len1 - __len11, __len22, __buffer,
3434 __merge_adaptive(__first, __first_cut, __new_middle, __len11,
3435 __len22, __buffer, __buffer_size);
3436 __merge_adaptive(__new_middle, __second_cut, __last, __len1 - __len11,
3437 __len2 - __len22, __buffer, __buffer_size);
3443 * This is a helper function for the merge routines.
3446 template<typename _BidirectionalIter, typename _Distance, typename _Pointer,
3449 __merge_adaptive(_BidirectionalIter __first,
3450 _BidirectionalIter __middle,
3451 _BidirectionalIter __last,
3452 _Distance __len1, _Distance __len2,
3453 _Pointer __buffer, _Distance __buffer_size,
3456 if (__len1 <= __len2 && __len1 <= __buffer_size) {
3457 _Pointer __buffer_end = copy(__first, __middle, __buffer);
3458 merge(__buffer, __buffer_end, __middle, __last, __first, __comp);
3460 else if (__len2 <= __buffer_size) {
3461 _Pointer __buffer_end = copy(__middle, __last, __buffer);
3462 __merge_backward(__first, __middle, __buffer, __buffer_end, __last,
3466 _BidirectionalIter __first_cut = __first;
3467 _BidirectionalIter __second_cut = __middle;
3468 _Distance __len11 = 0;
3469 _Distance __len22 = 0;
3470 if (__len1 > __len2) {
3471 __len11 = __len1 / 2;
3472 advance(__first_cut, __len11);
3473 __second_cut = lower_bound(__middle, __last, *__first_cut, __comp);
3474 __len22 = distance(__middle, __second_cut);
3477 __len22 = __len2 / 2;
3478 advance(__second_cut, __len22);
3479 __first_cut = upper_bound(__first, __middle, *__second_cut, __comp);
3480 __len11 = distance(__first, __first_cut);
3482 _BidirectionalIter __new_middle =
3483 __rotate_adaptive(__first_cut, __middle, __second_cut,
3484 __len1 - __len11, __len22, __buffer,
3486 __merge_adaptive(__first, __first_cut, __new_middle, __len11,
3487 __len22, __buffer, __buffer_size, __comp);
3488 __merge_adaptive(__new_middle, __second_cut, __last, __len1 - __len11,
3489 __len2 - __len22, __buffer, __buffer_size, __comp);
3494 * @brief Merges two sorted ranges in place.
3495 * @param first An iterator.
3496 * @param middle Another iterator.
3497 * @param last Another iterator.
3500 * Merges two sorted and consecutive ranges, [first,middle) and
3501 * [middle,last), and puts the result in [first,last). The output will
3502 * be sorted. The sort is @e stable, that is, for equivalent
3503 * elements in the two ranges, elements from the first range will always
3504 * come before elements from the second.
3506 * If enough additional memory is available, this takes (last-first)-1
3507 * comparisons. Otherwise an NlogN algorithm is used, where N is
3508 * distance(first,last).
3510 template<typename _BidirectionalIter>
3512 inplace_merge(_BidirectionalIter __first,
3513 _BidirectionalIter __middle,
3514 _BidirectionalIter __last)
3516 typedef typename iterator_traits<_BidirectionalIter>::value_type
3518 typedef typename iterator_traits<_BidirectionalIter>::difference_type
3521 // concept requirements
3522 __glibcpp_function_requires(_Mutable_BidirectionalIteratorConcept<
3523 _BidirectionalIter>)
3524 __glibcpp_function_requires(_LessThanComparableConcept<_ValueType>)
3526 if (__first == __middle || __middle == __last)
3529 _DistanceType __len1 = distance(__first, __middle);
3530 _DistanceType __len2 = distance(__middle, __last);
3532 _Temporary_buffer<_BidirectionalIter, _ValueType> __buf(__first, __last);
3533 if (__buf.begin() == 0)
3534 __merge_without_buffer(__first, __middle, __last, __len1, __len2);
3536 __merge_adaptive(__first, __middle, __last, __len1, __len2,
3537 __buf.begin(), _DistanceType(__buf.size()));
3541 * @brief Merges two sorted ranges in place.
3542 * @param first An iterator.
3543 * @param middle Another iterator.
3544 * @param last Another iterator.
3545 * @param comp A functor to use for comparisons.
3548 * Merges two sorted and consecutive ranges, [first,middle) and
3549 * [middle,last), and puts the result in [first,last). The output will
3550 * be sorted. The sort is @e stable, that is, for equivalent
3551 * elements in the two ranges, elements from the first range will always
3552 * come before elements from the second.
3554 * If enough additional memory is available, this takes (last-first)-1
3555 * comparisons. Otherwise an NlogN algorithm is used, where N is
3556 * distance(first,last).
3558 * The comparison function should have the same effects on ordering as
3559 * the function used for the initial sort.
3561 template<typename _BidirectionalIter, typename _Compare>
3563 inplace_merge(_BidirectionalIter __first,
3564 _BidirectionalIter __middle,
3565 _BidirectionalIter __last,
3568 typedef typename iterator_traits<_BidirectionalIter>::value_type
3570 typedef typename iterator_traits<_BidirectionalIter>::difference_type
3573 // concept requirements
3574 __glibcpp_function_requires(_Mutable_BidirectionalIteratorConcept<
3575 _BidirectionalIter>)
3576 __glibcpp_function_requires(_BinaryPredicateConcept<_Compare,
3577 _ValueType, _ValueType>)
3579 if (__first == __middle || __middle == __last)
3582 _DistanceType __len1 = distance(__first, __middle);
3583 _DistanceType __len2 = distance(__middle, __last);
3585 _Temporary_buffer<_BidirectionalIter, _ValueType> __buf(__first, __last);
3586 if (__buf.begin() == 0)
3587 __merge_without_buffer(__first, __middle, __last, __len1, __len2, __comp);
3589 __merge_adaptive(__first, __middle, __last, __len1, __len2,
3590 __buf.begin(), _DistanceType(__buf.size()),
3594 // Set algorithms: includes, set_union, set_intersection, set_difference,
3595 // set_symmetric_difference. All of these algorithms have the precondition
3596 // that their input ranges are sorted and the postcondition that their output
3597 // ranges are sorted.
3599 template<typename _InputIter1, typename _InputIter2>
3601 includes(_InputIter1 __first1, _InputIter1 __last1,
3602 _InputIter2 __first2, _InputIter2 __last2)
3604 // concept requirements
3605 __glibcpp_function_requires(_InputIteratorConcept<_InputIter1>)
3606 __glibcpp_function_requires(_InputIteratorConcept<_InputIter2>)
3607 __glibcpp_function_requires(_SameTypeConcept<
3608 typename iterator_traits<_InputIter1>::value_type,
3609 typename iterator_traits<_InputIter2>::value_type>)
3610 __glibcpp_function_requires(_LessThanComparableConcept<
3611 typename iterator_traits<_InputIter1>::value_type>)
3613 while (__first1 != __last1 && __first2 != __last2)
3614 if (*__first2 < *__first1)
3616 else if(*__first1 < *__first2)
3619 ++__first1, ++__first2;
3621 return __first2 == __last2;
3624 template<typename _InputIter1, typename _InputIter2, typename _Compare>
3626 includes(_InputIter1 __first1, _InputIter1 __last1,
3627 _InputIter2 __first2, _InputIter2 __last2, _Compare __comp)
3629 // concept requirements
3630 __glibcpp_function_requires(_InputIteratorConcept<_InputIter1>)
3631 __glibcpp_function_requires(_InputIteratorConcept<_InputIter2>)
3632 __glibcpp_function_requires(_SameTypeConcept<
3633 typename iterator_traits<_InputIter1>::value_type,
3634 typename iterator_traits<_InputIter2>::value_type>)
3635 __glibcpp_function_requires(_BinaryPredicateConcept<_Compare,
3636 typename iterator_traits<_InputIter1>::value_type,
3637 typename iterator_traits<_InputIter2>::value_type>)
3639 while (__first1 != __last1 && __first2 != __last2)
3640 if (__comp(*__first2, *__first1))
3642 else if(__comp(*__first1, *__first2))
3645 ++__first1, ++__first2;
3647 return __first2 == __last2;
3650 template<typename _InputIter1, typename _InputIter2, typename _OutputIter>
3652 set_union(_InputIter1 __first1, _InputIter1 __last1,
3653 _InputIter2 __first2, _InputIter2 __last2,
3654 _OutputIter __result)
3656 // concept requirements
3657 __glibcpp_function_requires(_InputIteratorConcept<_InputIter1>)
3658 __glibcpp_function_requires(_InputIteratorConcept<_InputIter2>)
3659 __glibcpp_function_requires(_OutputIteratorConcept<_OutputIter,
3660 typename iterator_traits<_InputIter1>::value_type>)
3661 __glibcpp_function_requires(_SameTypeConcept<
3662 typename iterator_traits<_InputIter1>::value_type,
3663 typename iterator_traits<_InputIter2>::value_type>)
3664 __glibcpp_function_requires(_LessThanComparableConcept<
3665 typename iterator_traits<_InputIter1>::value_type>)
3667 while (__first1 != __last1 && __first2 != __last2) {
3668 if (*__first1 < *__first2) {
3669 *__result = *__first1;
3672 else if (*__first2 < *__first1) {
3673 *__result = *__first2;
3677 *__result = *__first1;
3683 return copy(__first2, __last2, copy(__first1, __last1, __result));
3686 template<typename _InputIter1, typename _InputIter2, typename _OutputIter,
3689 set_union(_InputIter1 __first1, _InputIter1 __last1,
3690 _InputIter2 __first2, _InputIter2 __last2,
3691 _OutputIter __result, _Compare __comp)
3693 // concept requirements
3694 __glibcpp_function_requires(_InputIteratorConcept<_InputIter1>)
3695 __glibcpp_function_requires(_InputIteratorConcept<_InputIter2>)
3696 __glibcpp_function_requires(_SameTypeConcept<
3697 typename iterator_traits<_InputIter1>::value_type,
3698 typename iterator_traits<_InputIter2>::value_type>)
3699 __glibcpp_function_requires(_OutputIteratorConcept<_OutputIter,
3700 typename iterator_traits<_InputIter1>::value_type>)
3701 __glibcpp_function_requires(_BinaryPredicateConcept<_Compare,
3702 typename iterator_traits<_InputIter1>::value_type,
3703 typename iterator_traits<_InputIter2>::value_type>)
3705 while (__first1 != __last1 && __first2 != __last2) {
3706 if (__comp(*__first1, *__first2)) {
3707 *__result = *__first1;
3710 else if (__comp(*__first2, *__first1)) {
3711 *__result = *__first2;
3715 *__result = *__first1;
3721 return copy(__first2, __last2, copy(__first1, __last1, __result));
3724 template<typename _InputIter1, typename _InputIter2, typename _OutputIter>
3726 set_intersection(_InputIter1 __first1, _InputIter1 __last1,
3727 _InputIter2 __first2, _InputIter2 __last2,
3728 _OutputIter __result)
3730 // concept requirements
3731 __glibcpp_function_requires(_InputIteratorConcept<_InputIter1>)
3732 __glibcpp_function_requires(_InputIteratorConcept<_InputIter2>)
3733 __glibcpp_function_requires(_OutputIteratorConcept<_OutputIter,
3734 typename iterator_traits<_InputIter1>::value_type>)
3735 __glibcpp_function_requires(_SameTypeConcept<
3736 typename iterator_traits<_InputIter1>::value_type,
3737 typename iterator_traits<_InputIter2>::value_type>)
3738 __glibcpp_function_requires(_LessThanComparableConcept<
3739 typename iterator_traits<_InputIter1>::value_type>)
3741 while (__first1 != __last1 && __first2 != __last2)
3742 if (*__first1 < *__first2)
3744 else if (*__first2 < *__first1)
3747 *__result = *__first1;
3755 template<typename _InputIter1, typename _InputIter2, typename _OutputIter,
3758 set_intersection(_InputIter1 __first1, _InputIter1 __last1,
3759 _InputIter2 __first2, _InputIter2 __last2,
3760 _OutputIter __result, _Compare __comp)
3762 // concept requirements
3763 __glibcpp_function_requires(_InputIteratorConcept<_InputIter1>)
3764 __glibcpp_function_requires(_InputIteratorConcept<_InputIter2>)
3765 __glibcpp_function_requires(_SameTypeConcept<
3766 typename iterator_traits<_InputIter1>::value_type,
3767 typename iterator_traits<_InputIter2>::value_type>)
3768 __glibcpp_function_requires(_OutputIteratorConcept<_OutputIter,
3769 typename iterator_traits<_InputIter1>::value_type>)
3770 __glibcpp_function_requires(_BinaryPredicateConcept<_Compare,
3771 typename iterator_traits<_InputIter1>::value_type,
3772 typename iterator_traits<_InputIter2>::value_type>)
3774 while (__first1 != __last1 && __first2 != __last2)
3775 if (__comp(*__first1, *__first2))
3777 else if (__comp(*__first2, *__first1))
3780 *__result = *__first1;
3788 template<typename _InputIter1, typename _InputIter2, typename _OutputIter>
3790 set_difference(_InputIter1 __first1, _InputIter1 __last1,
3791 _InputIter2 __first2, _InputIter2 __last2,
3792 _OutputIter __result)
3794 // concept requirements
3795 __glibcpp_function_requires(_InputIteratorConcept<_InputIter1>)
3796 __glibcpp_function_requires(_InputIteratorConcept<_InputIter2>)
3797 __glibcpp_function_requires(_OutputIteratorConcept<_OutputIter,
3798 typename iterator_traits<_InputIter1>::value_type>)
3799 __glibcpp_function_requires(_SameTypeConcept<
3800 typename iterator_traits<_InputIter1>::value_type,
3801 typename iterator_traits<_InputIter2>::value_type>)
3802 __glibcpp_function_requires(_LessThanComparableConcept<
3803 typename iterator_traits<_InputIter1>::value_type>)
3805 while (__first1 != __last1 && __first2 != __last2)
3806 if (*__first1 < *__first2) {
3807 *__result = *__first1;
3811 else if (*__first2 < *__first1)
3817 return copy(__first1, __last1, __result);
3820 template<typename _InputIter1, typename _InputIter2, typename _OutputIter,
3823 set_difference(_InputIter1 __first1, _InputIter1 __last1,
3824 _InputIter2 __first2, _InputIter2 __last2,
3825 _OutputIter __result, _Compare __comp)
3827 // concept requirements
3828 __glibcpp_function_requires(_InputIteratorConcept<_InputIter1>)
3829 __glibcpp_function_requires(_InputIteratorConcept<_InputIter2>)
3830 __glibcpp_function_requires(_SameTypeConcept<
3831 typename iterator_traits<_InputIter1>::value_type,
3832 typename iterator_traits<_InputIter2>::value_type>)
3833 __glibcpp_function_requires(_OutputIteratorConcept<_OutputIter,
3834 typename iterator_traits<_InputIter1>::value_type>)
3835 __glibcpp_function_requires(_BinaryPredicateConcept<_Compare,
3836 typename iterator_traits<_InputIter1>::value_type,
3837 typename iterator_traits<_InputIter2>::value_type>)
3839 while (__first1 != __last1 && __first2 != __last2)
3840 if (__comp(*__first1, *__first2)) {
3841 *__result = *__first1;
3845 else if (__comp(*__first2, *__first1))
3851 return copy(__first1, __last1, __result);
3854 template<typename _InputIter1, typename _InputIter2, typename _OutputIter>
3856 set_symmetric_difference(_InputIter1 __first1, _InputIter1 __last1,
3857 _InputIter2 __first2, _InputIter2 __last2,
3858 _OutputIter __result)
3860 // concept requirements
3861 __glibcpp_function_requires(_InputIteratorConcept<_InputIter1>)
3862 __glibcpp_function_requires(_InputIteratorConcept<_InputIter2>)
3863 __glibcpp_function_requires(_OutputIteratorConcept<_OutputIter,
3864 typename iterator_traits<_InputIter1>::value_type>)
3865 __glibcpp_function_requires(_SameTypeConcept<
3866 typename iterator_traits<_InputIter1>::value_type,
3867 typename iterator_traits<_InputIter2>::value_type>)
3868 __glibcpp_function_requires(_LessThanComparableConcept<
3869 typename iterator_traits<_InputIter1>::value_type>)
3871 while (__first1 != __last1 && __first2 != __last2)
3872 if (*__first1 < *__first2) {
3873 *__result = *__first1;
3877 else if (*__first2 < *__first1) {
3878 *__result = *__first2;
3886 return copy(__first2, __last2, copy(__first1, __last1, __result));
3889 template<typename _InputIter1, typename _InputIter2, typename _OutputIter,
3892 set_symmetric_difference(_InputIter1 __first1, _InputIter1 __last1,
3893 _InputIter2 __first2, _InputIter2 __last2,
3894 _OutputIter __result,
3897 // concept requirements
3898 __glibcpp_function_requires(_InputIteratorConcept<_InputIter1>)
3899 __glibcpp_function_requires(_InputIteratorConcept<_InputIter2>)
3900 __glibcpp_function_requires(_SameTypeConcept<
3901 typename iterator_traits<_InputIter1>::value_type,
3902 typename iterator_traits<_InputIter2>::value_type>)
3903 __glibcpp_function_requires(_OutputIteratorConcept<_OutputIter,
3904 typename iterator_traits<_InputIter1>::value_type>)
3905 __glibcpp_function_requires(_BinaryPredicateConcept<_Compare,
3906 typename iterator_traits<_InputIter1>::value_type,
3907 typename iterator_traits<_InputIter2>::value_type>)
3909 while (__first1 != __last1 && __first2 != __last2)
3910 if (__comp(*__first1, *__first2)) {
3911 *__result = *__first1;
3915 else if (__comp(*__first2, *__first1)) {
3916 *__result = *__first2;
3924 return copy(__first2, __last2, copy(__first1, __last1, __result));
3927 // min_element and max_element, with and without an explicitly supplied
3928 // comparison function.
3930 template<typename _ForwardIter>
3932 max_element(_ForwardIter __first, _ForwardIter __last)
3934 // concept requirements
3935 __glibcpp_function_requires(_ForwardIteratorConcept<_ForwardIter>)
3936 __glibcpp_function_requires(_LessThanComparableConcept<
3937 typename iterator_traits<_ForwardIter>::value_type>)
3939 if (__first == __last) return __first;
3940 _ForwardIter __result = __first;
3941 while (++__first != __last)
3942 if (*__result < *__first)
3947 template<typename _ForwardIter, typename _Compare>
3949 max_element(_ForwardIter __first, _ForwardIter __last,
3952 // concept requirements
3953 __glibcpp_function_requires(_ForwardIteratorConcept<_ForwardIter>)
3954 __glibcpp_function_requires(_BinaryPredicateConcept<_Compare,
3955 typename iterator_traits<_ForwardIter>::value_type,
3956 typename iterator_traits<_ForwardIter>::value_type>)
3958 if (__first == __last) return __first;
3959 _ForwardIter __result = __first;
3960 while (++__first != __last)
3961 if (__comp(*__result, *__first)) __result = __first;
3965 template<typename _ForwardIter>
3967 min_element(_ForwardIter __first, _ForwardIter __last)
3969 // concept requirements
3970 __glibcpp_function_requires(_ForwardIteratorConcept<_ForwardIter>)
3971 __glibcpp_function_requires(_LessThanComparableConcept<
3972 typename iterator_traits<_ForwardIter>::value_type>)
3974 if (__first == __last) return __first;
3975 _ForwardIter __result = __first;
3976 while (++__first != __last)
3977 if (*__first < *__result)
3982 template<typename _ForwardIter, typename _Compare>
3984 min_element(_ForwardIter __first, _ForwardIter __last,
3987 // concept requirements
3988 __glibcpp_function_requires(_ForwardIteratorConcept<_ForwardIter>)
3989 __glibcpp_function_requires(_BinaryPredicateConcept<_Compare,
3990 typename iterator_traits<_ForwardIter>::value_type,
3991 typename iterator_traits<_ForwardIter>::value_type>)
3993 if (__first == __last) return __first;
3994 _ForwardIter __result = __first;
3995 while (++__first != __last)
3996 if (__comp(*__first, *__result))
4001 // next_permutation and prev_permutation, with and without an explicitly
4002 // supplied comparison function.
4004 template<typename _BidirectionalIter>
4006 next_permutation(_BidirectionalIter __first, _BidirectionalIter __last)
4008 // concept requirements
4009 __glibcpp_function_requires(_BidirectionalIteratorConcept<_BidirectionalIter>)
4010 __glibcpp_function_requires(_LessThanComparableConcept<
4011 typename iterator_traits<_BidirectionalIter>::value_type>)
4013 if (__first == __last)
4015 _BidirectionalIter __i = __first;
4023 _BidirectionalIter __ii = __i;
4026 _BidirectionalIter __j = __last;
4027 while (!(*__i < *--__j))
4029 iter_swap(__i, __j);
4030 reverse(__ii, __last);
4033 if (__i == __first) {
4034 reverse(__first, __last);
4040 template<typename _BidirectionalIter, typename _Compare>
4042 next_permutation(_BidirectionalIter __first, _BidirectionalIter __last,
4045 // concept requirements
4046 __glibcpp_function_requires(_BidirectionalIteratorConcept<_BidirectionalIter>)
4047 __glibcpp_function_requires(_BinaryPredicateConcept<_Compare,
4048 typename iterator_traits<_BidirectionalIter>::value_type,
4049 typename iterator_traits<_BidirectionalIter>::value_type>)
4051 if (__first == __last)
4053 _BidirectionalIter __i = __first;
4061 _BidirectionalIter __ii = __i;
4063 if (__comp(*__i, *__ii)) {
4064 _BidirectionalIter __j = __last;
4065 while (!__comp(*__i, *--__j))
4067 iter_swap(__i, __j);
4068 reverse(__ii, __last);
4071 if (__i == __first) {
4072 reverse(__first, __last);
4078 template<typename _BidirectionalIter>
4080 prev_permutation(_BidirectionalIter __first, _BidirectionalIter __last)
4082 // concept requirements
4083 __glibcpp_function_requires(_BidirectionalIteratorConcept<_BidirectionalIter>)
4084 __glibcpp_function_requires(_LessThanComparableConcept<
4085 typename iterator_traits<_BidirectionalIter>::value_type>)
4087 if (__first == __last)
4089 _BidirectionalIter __i = __first;
4097 _BidirectionalIter __ii = __i;
4100 _BidirectionalIter __j = __last;
4101 while (!(*--__j < *__i))
4103 iter_swap(__i, __j);
4104 reverse(__ii, __last);
4107 if (__i == __first) {
4108 reverse(__first, __last);
4114 template<typename _BidirectionalIter, typename _Compare>
4116 prev_permutation(_BidirectionalIter __first, _BidirectionalIter __last,
4119 // concept requirements
4120 __glibcpp_function_requires(_BidirectionalIteratorConcept<_BidirectionalIter>)
4121 __glibcpp_function_requires(_BinaryPredicateConcept<_Compare,
4122 typename iterator_traits<_BidirectionalIter>::value_type,
4123 typename iterator_traits<_BidirectionalIter>::value_type>)
4125 if (__first == __last)
4127 _BidirectionalIter __i = __first;
4135 _BidirectionalIter __ii = __i;
4137 if (__comp(*__ii, *__i)) {
4138 _BidirectionalIter __j = __last;
4139 while (!__comp(*--__j, *__i))
4141 iter_swap(__i, __j);
4142 reverse(__ii, __last);
4145 if (__i == __first) {
4146 reverse(__first, __last);
4152 // find_first_of, with and without an explicitly supplied comparison function.
4154 template<typename _InputIter, typename _ForwardIter>
4156 find_first_of(_InputIter __first1, _InputIter __last1,
4157 _ForwardIter __first2, _ForwardIter __last2)
4159 // concept requirements
4160 __glibcpp_function_requires(_InputIteratorConcept<_InputIter>)
4161 __glibcpp_function_requires(_ForwardIteratorConcept<_ForwardIter>)
4162 __glibcpp_function_requires(_EqualOpConcept<
4163 typename iterator_traits<_InputIter>::value_type,
4164 typename iterator_traits<_ForwardIter>::value_type>)
4166 for ( ; __first1 != __last1; ++__first1)
4167 for (_ForwardIter __iter = __first2; __iter != __last2; ++__iter)
4168 if (*__first1 == *__iter)
4173 template<typename _InputIter, typename _ForwardIter, typename _BinaryPredicate>
4175 find_first_of(_InputIter __first1, _InputIter __last1,
4176 _ForwardIter __first2, _ForwardIter __last2,
4177 _BinaryPredicate __comp)
4179 // concept requirements
4180 __glibcpp_function_requires(_InputIteratorConcept<_InputIter>)
4181 __glibcpp_function_requires(_ForwardIteratorConcept<_ForwardIter>)
4182 __glibcpp_function_requires(_EqualOpConcept<
4183 typename iterator_traits<_InputIter>::value_type,
4184 typename iterator_traits<_ForwardIter>::value_type>)
4185 __glibcpp_function_requires(_BinaryPredicateConcept<_BinaryPredicate,
4186 typename iterator_traits<_InputIter>::value_type,
4187 typename iterator_traits<_ForwardIter>::value_type>)
4189 for ( ; __first1 != __last1; ++__first1)
4190 for (_ForwardIter __iter = __first2; __iter != __last2; ++__iter)
4191 if (__comp(*__first1, *__iter))
4197 // find_end, with and without an explicitly supplied comparison function.
4198 // Search [first2, last2) as a subsequence in [first1, last1), and return
4199 // the *last* possible match. Note that find_end for bidirectional iterators
4200 // is much faster than for forward iterators.
4202 // find_end for forward iterators.
4203 template<typename _ForwardIter1, typename _ForwardIter2>
4205 __find_end(_ForwardIter1 __first1, _ForwardIter1 __last1,
4206 _ForwardIter2 __first2, _ForwardIter2 __last2,
4207 forward_iterator_tag, forward_iterator_tag)
4209 if (__first2 == __last2)
4212 _ForwardIter1 __result = __last1;
4214 _ForwardIter1 __new_result
4215 = search(__first1, __last1, __first2, __last2);
4216 if (__new_result == __last1)
4219 __result = __new_result;
4220 __first1 = __new_result;
4227 template<typename _ForwardIter1, typename _ForwardIter2,
4228 typename _BinaryPredicate>
4230 __find_end(_ForwardIter1 __first1, _ForwardIter1 __last1,
4231 _ForwardIter2 __first2, _ForwardIter2 __last2,
4232 forward_iterator_tag, forward_iterator_tag,
4233 _BinaryPredicate __comp)
4235 if (__first2 == __last2)
4238 _ForwardIter1 __result = __last1;
4240 _ForwardIter1 __new_result
4241 = search(__first1, __last1, __first2, __last2, __comp);
4242 if (__new_result == __last1)
4245 __result = __new_result;
4246 __first1 = __new_result;
4253 // find_end for bidirectional iterators. Requires partial specialization.
4254 template<typename _BidirectionalIter1, typename _BidirectionalIter2>
4256 __find_end(_BidirectionalIter1 __first1, _BidirectionalIter1 __last1,
4257 _BidirectionalIter2 __first2, _BidirectionalIter2 __last2,
4258 bidirectional_iterator_tag, bidirectional_iterator_tag)
4260 // concept requirements
4261 __glibcpp_function_requires(_BidirectionalIteratorConcept<_BidirectionalIter1>)
4262 __glibcpp_function_requires(_BidirectionalIteratorConcept<_BidirectionalIter2>)
4264 typedef reverse_iterator<_BidirectionalIter1> _RevIter1;
4265 typedef reverse_iterator<_BidirectionalIter2> _RevIter2;
4267 _RevIter1 __rlast1(__first1);
4268 _RevIter2 __rlast2(__first2);
4269 _RevIter1 __rresult = search(_RevIter1(__last1), __rlast1,
4270 _RevIter2(__last2), __rlast2);
4272 if (__rresult == __rlast1)
4275 _BidirectionalIter1 __result = __rresult.base();
4276 advance(__result, -distance(__first2, __last2));
4281 template<typename _BidirectionalIter1, typename _BidirectionalIter2,
4282 typename _BinaryPredicate>
4284 __find_end(_BidirectionalIter1 __first1, _BidirectionalIter1 __last1,
4285 _BidirectionalIter2 __first2, _BidirectionalIter2 __last2,
4286 bidirectional_iterator_tag, bidirectional_iterator_tag,
4287 _BinaryPredicate __comp)
4289 // concept requirements
4290 __glibcpp_function_requires(_BidirectionalIteratorConcept<_BidirectionalIter1>)
4291 __glibcpp_function_requires(_BidirectionalIteratorConcept<_BidirectionalIter2>)
4293 typedef reverse_iterator<_BidirectionalIter1> _RevIter1;
4294 typedef reverse_iterator<_BidirectionalIter2> _RevIter2;
4296 _RevIter1 __rlast1(__first1);
4297 _RevIter2 __rlast2(__first2);
4298 _RevIter1 __rresult = search(_RevIter1(__last1), __rlast1,
4299 _RevIter2(__last2), __rlast2,
4302 if (__rresult == __rlast1)
4305 _BidirectionalIter1 __result = __rresult.base();
4306 advance(__result, -distance(__first2, __last2));
4311 // Dispatching functions for find_end.
4313 template<typename _ForwardIter1, typename _ForwardIter2>
4314 inline _ForwardIter1
4315 find_end(_ForwardIter1 __first1, _ForwardIter1 __last1,
4316 _ForwardIter2 __first2, _ForwardIter2 __last2)
4318 // concept requirements
4319 __glibcpp_function_requires(_ForwardIteratorConcept<_ForwardIter1>)
4320 __glibcpp_function_requires(_ForwardIteratorConcept<_ForwardIter2>)
4321 __glibcpp_function_requires(_EqualOpConcept<
4322 typename iterator_traits<_ForwardIter1>::value_type,
4323 typename iterator_traits<_ForwardIter2>::value_type>)
4325 return __find_end(__first1, __last1, __first2, __last2,
4326 __iterator_category(__first1),
4327 __iterator_category(__first2));
4330 template<typename _ForwardIter1, typename _ForwardIter2,
4331 typename _BinaryPredicate>
4332 inline _ForwardIter1
4333 find_end(_ForwardIter1 __first1, _ForwardIter1 __last1,
4334 _ForwardIter2 __first2, _ForwardIter2 __last2,
4335 _BinaryPredicate __comp)
4337 // concept requirements
4338 __glibcpp_function_requires(_ForwardIteratorConcept<_ForwardIter1>)
4339 __glibcpp_function_requires(_ForwardIteratorConcept<_ForwardIter2>)
4340 __glibcpp_function_requires(_BinaryPredicateConcept<_BinaryPredicate,
4341 typename iterator_traits<_ForwardIter1>::value_type,
4342 typename iterator_traits<_ForwardIter2>::value_type>)
4344 return __find_end(__first1, __last1, __first2, __last2,
4345 __iterator_category(__first1),
4346 __iterator_category(__first2),
4352 #endif /* __GLIBCPP_INTERNAL_ALGO_H */