1 // Algorithm implementation -*- C++ -*-
3 // Copyright (C) 2001-2015 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 3, 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 // Under Section 7 of GPL version 3, you are granted additional
17 // permissions described in the GCC Runtime Library Exception, version
18 // 3.1, as published by the Free Software Foundation.
20 // You should have received a copy of the GNU General Public License and
21 // a copy of the GCC Runtime Library Exception along with this program;
22 // see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
23 // <http://www.gnu.org/licenses/>.
28 * Hewlett-Packard Company
30 * Permission to use, copy, modify, distribute and sell this software
31 * and its documentation for any purpose is hereby granted without fee,
32 * provided that the above copyright notice appear in all copies and
33 * that both that copyright notice and this permission notice appear
34 * in supporting documentation. Hewlett-Packard Company makes no
35 * representations about the suitability of this software for any
36 * purpose. It is provided "as is" without express or implied warranty.
40 * Silicon Graphics Computer Systems, Inc.
42 * Permission to use, copy, modify, distribute and sell this software
43 * and its documentation for any purpose is hereby granted without fee,
44 * provided that the above copyright notice appear in all copies and
45 * that both that copyright notice and this permission notice appear
46 * in supporting documentation. Silicon Graphics makes no
47 * representations about the suitability of this software for any
48 * purpose. It is provided "as is" without express or implied warranty.
51 /** @file bits/stl_algo.h
52 * This is an internal header file, included by other library headers.
53 * Do not attempt to use it directly. @headername{algorithm}
59 #include <cstdlib> // for rand
60 #include <bits/algorithmfwd.h>
61 #include <bits/stl_heap.h>
62 #include <bits/stl_tempbuf.h> // for _Temporary_buffer
63 #include <bits/predefined_ops.h>
65 #if __cplusplus >= 201103L
66 #include <random> // for std::uniform_int_distribution
69 // See concept_check.h for the __glibcxx_*_requires macros.
71 namespace std
_GLIBCXX_VISIBILITY(default)
73 _GLIBCXX_BEGIN_NAMESPACE_VERSION
75 /// Swaps the median value of *__a, *__b and *__c under __comp to *__result
76 template<typename _Iterator
, typename _Compare
>
78 __move_median_to_first(_Iterator __result
,_Iterator __a
, _Iterator __b
,
79 _Iterator __c
, _Compare __comp
)
84 std::iter_swap(__result
, __b
);
85 else if (__comp(__a
, __c
))
86 std::iter_swap(__result
, __c
);
88 std::iter_swap(__result
, __a
);
90 else if (__comp(__a
, __c
))
91 std::iter_swap(__result
, __a
);
92 else if (__comp(__b
, __c
))
93 std::iter_swap(__result
, __c
);
95 std::iter_swap(__result
, __b
);
98 /// This is an overload used by find algos for the Input Iterator case.
99 template<typename _InputIterator
, typename _Predicate
>
100 inline _InputIterator
101 __find_if(_InputIterator __first
, _InputIterator __last
,
102 _Predicate __pred
, input_iterator_tag
)
104 while (__first
!= __last
&& !__pred(__first
))
109 /// This is an overload used by find algos for the RAI case.
110 template<typename _RandomAccessIterator
, typename _Predicate
>
111 _RandomAccessIterator
112 __find_if(_RandomAccessIterator __first
, _RandomAccessIterator __last
,
113 _Predicate __pred
, random_access_iterator_tag
)
115 typename iterator_traits
<_RandomAccessIterator
>::difference_type
116 __trip_count
= (__last
- __first
) >> 2;
118 for (; __trip_count
> 0; --__trip_count
)
137 switch (__last
- __first
)
157 template<typename _Iterator
, typename _Predicate
>
159 __find_if(_Iterator __first
, _Iterator __last
, _Predicate __pred
)
161 return __find_if(__first
, __last
, __pred
,
162 std::__iterator_category(__first
));
165 /// Provided for stable_partition to use.
166 template<typename _InputIterator
, typename _Predicate
>
167 inline _InputIterator
168 __find_if_not(_InputIterator __first
, _InputIterator __last
,
171 return std::__find_if(__first
, __last
,
172 __gnu_cxx::__ops::__negate(__pred
),
173 std::__iterator_category(__first
));
176 /// Like find_if_not(), but uses and updates a count of the
177 /// remaining range length instead of comparing against an end
179 template<typename _InputIterator
, typename _Predicate
, typename _Distance
>
181 __find_if_not_n(_InputIterator __first
, _Distance
& __len
, _Predicate __pred
)
183 for (; __len
; --__len
, ++__first
)
184 if (!__pred(__first
))
191 // set_symmetric_difference
202 template<typename _ForwardIterator1
, typename _ForwardIterator2
,
203 typename _BinaryPredicate
>
205 __search(_ForwardIterator1 __first1
, _ForwardIterator1 __last1
,
206 _ForwardIterator2 __first2
, _ForwardIterator2 __last2
,
207 _BinaryPredicate __predicate
)
209 // Test for empty ranges
210 if (__first1
== __last1
|| __first2
== __last2
)
213 // Test for a pattern of length 1.
214 _ForwardIterator2
__p1(__first2
);
215 if (++__p1
== __last2
)
216 return std::__find_if(__first1
, __last1
,
217 __gnu_cxx::__ops::__iter_comp_iter(__predicate
, __first2
));
220 _ForwardIterator2 __p
;
221 _ForwardIterator1 __current
= __first1
;
226 std::__find_if(__first1
, __last1
,
227 __gnu_cxx::__ops::__iter_comp_iter(__predicate
, __first2
));
229 if (__first1
== __last1
)
233 __current
= __first1
;
234 if (++__current
== __last1
)
237 while (__predicate(__current
, __p
))
239 if (++__p
== __last2
)
241 if (++__current
== __last1
)
252 * This is an helper function for search_n overloaded for forward iterators.
254 template<typename _ForwardIterator
, typename _Integer
,
255 typename _UnaryPredicate
>
257 __search_n_aux(_ForwardIterator __first
, _ForwardIterator __last
,
258 _Integer __count
, _UnaryPredicate __unary_pred
,
259 std::forward_iterator_tag
)
261 __first
= std::__find_if(__first
, __last
, __unary_pred
);
262 while (__first
!= __last
)
264 typename iterator_traits
<_ForwardIterator
>::difference_type
266 _ForwardIterator __i
= __first
;
268 while (__i
!= __last
&& __n
!= 1 && __unary_pred(__i
))
277 __first
= std::__find_if(++__i
, __last
, __unary_pred
);
283 * This is an helper function for search_n overloaded for random access
286 template<typename _RandomAccessIter
, typename _Integer
,
287 typename _UnaryPredicate
>
289 __search_n_aux(_RandomAccessIter __first
, _RandomAccessIter __last
,
290 _Integer __count
, _UnaryPredicate __unary_pred
,
291 std::random_access_iterator_tag
)
293 typedef typename
std::iterator_traits
<_RandomAccessIter
>::difference_type
296 _DistanceType __tailSize
= __last
- __first
;
297 _DistanceType __remainder
= __count
;
299 while (__remainder
<= __tailSize
) // the main loop...
301 __first
+= __remainder
;
302 __tailSize
-= __remainder
;
303 // __first here is always pointing to one past the last element of
304 // next possible match.
305 _RandomAccessIter __backTrack
= __first
;
306 while (__unary_pred(--__backTrack
))
308 if (--__remainder
== 0)
309 return (__first
- __count
); // Success
311 __remainder
= __count
+ 1 - (__first
- __backTrack
);
313 return __last
; // Failure
316 template<typename _ForwardIterator
, typename _Integer
,
317 typename _UnaryPredicate
>
319 __search_n(_ForwardIterator __first
, _ForwardIterator __last
,
321 _UnaryPredicate __unary_pred
)
327 return std::__find_if(__first
, __last
, __unary_pred
);
329 return std::__search_n_aux(__first
, __last
, __count
, __unary_pred
,
330 std::__iterator_category(__first
));
333 // find_end for forward iterators.
334 template<typename _ForwardIterator1
, typename _ForwardIterator2
,
335 typename _BinaryPredicate
>
337 __find_end(_ForwardIterator1 __first1
, _ForwardIterator1 __last1
,
338 _ForwardIterator2 __first2
, _ForwardIterator2 __last2
,
339 forward_iterator_tag
, forward_iterator_tag
,
340 _BinaryPredicate __comp
)
342 if (__first2
== __last2
)
345 _ForwardIterator1 __result
= __last1
;
348 _ForwardIterator1 __new_result
349 = std::__search(__first1
, __last1
, __first2
, __last2
, __comp
);
350 if (__new_result
== __last1
)
354 __result
= __new_result
;
355 __first1
= __new_result
;
361 // find_end for bidirectional iterators (much faster).
362 template<typename _BidirectionalIterator1
, typename _BidirectionalIterator2
,
363 typename _BinaryPredicate
>
364 _BidirectionalIterator1
365 __find_end(_BidirectionalIterator1 __first1
,
366 _BidirectionalIterator1 __last1
,
367 _BidirectionalIterator2 __first2
,
368 _BidirectionalIterator2 __last2
,
369 bidirectional_iterator_tag
, bidirectional_iterator_tag
,
370 _BinaryPredicate __comp
)
372 // concept requirements
373 __glibcxx_function_requires(_BidirectionalIteratorConcept
<
374 _BidirectionalIterator1
>)
375 __glibcxx_function_requires(_BidirectionalIteratorConcept
<
376 _BidirectionalIterator2
>)
378 typedef reverse_iterator
<_BidirectionalIterator1
> _RevIterator1
;
379 typedef reverse_iterator
<_BidirectionalIterator2
> _RevIterator2
;
381 _RevIterator1
__rlast1(__first1
);
382 _RevIterator2
__rlast2(__first2
);
383 _RevIterator1 __rresult
= std::__search(_RevIterator1(__last1
), __rlast1
,
384 _RevIterator2(__last2
), __rlast2
,
387 if (__rresult
== __rlast1
)
391 _BidirectionalIterator1 __result
= __rresult
.base();
392 std::advance(__result
, -std::distance(__first2
, __last2
));
398 * @brief Find last matching subsequence in a sequence.
399 * @ingroup non_mutating_algorithms
400 * @param __first1 Start of range to search.
401 * @param __last1 End of range to search.
402 * @param __first2 Start of sequence to match.
403 * @param __last2 End of sequence to match.
404 * @return The last iterator @c i in the range
405 * @p [__first1,__last1-(__last2-__first2)) such that @c *(i+N) ==
406 * @p *(__first2+N) for each @c N in the range @p
407 * [0,__last2-__first2), or @p __last1 if no such iterator exists.
409 * Searches the range @p [__first1,__last1) for a sub-sequence that
410 * compares equal value-by-value with the sequence given by @p
411 * [__first2,__last2) and returns an iterator to the __first
412 * element of the sub-sequence, or @p __last1 if the sub-sequence
413 * is not found. The sub-sequence will be the last such
414 * subsequence contained in [__first1,__last1).
416 * Because the sub-sequence must lie completely within the range @p
417 * [__first1,__last1) it must start at a position less than @p
418 * __last1-(__last2-__first2) where @p __last2-__first2 is the
419 * length of the sub-sequence. This means that the returned
420 * iterator @c i will be in the range @p
421 * [__first1,__last1-(__last2-__first2))
423 template<typename _ForwardIterator1
, typename _ForwardIterator2
>
424 inline _ForwardIterator1
425 find_end(_ForwardIterator1 __first1
, _ForwardIterator1 __last1
,
426 _ForwardIterator2 __first2
, _ForwardIterator2 __last2
)
428 // concept requirements
429 __glibcxx_function_requires(_ForwardIteratorConcept
<_ForwardIterator1
>)
430 __glibcxx_function_requires(_ForwardIteratorConcept
<_ForwardIterator2
>)
431 __glibcxx_function_requires(_EqualOpConcept
<
432 typename iterator_traits
<_ForwardIterator1
>::value_type
,
433 typename iterator_traits
<_ForwardIterator2
>::value_type
>)
434 __glibcxx_requires_valid_range(__first1
, __last1
);
435 __glibcxx_requires_valid_range(__first2
, __last2
);
437 return std::__find_end(__first1
, __last1
, __first2
, __last2
,
438 std::__iterator_category(__first1
),
439 std::__iterator_category(__first2
),
440 __gnu_cxx::__ops::__iter_equal_to_iter());
444 * @brief Find last matching subsequence in a sequence using a predicate.
445 * @ingroup non_mutating_algorithms
446 * @param __first1 Start of range to search.
447 * @param __last1 End of range to search.
448 * @param __first2 Start of sequence to match.
449 * @param __last2 End of sequence to match.
450 * @param __comp The predicate to use.
451 * @return The last iterator @c i in the range @p
452 * [__first1,__last1-(__last2-__first2)) such that @c
453 * predicate(*(i+N), @p (__first2+N)) is true for each @c N in the
454 * range @p [0,__last2-__first2), or @p __last1 if no such iterator
457 * Searches the range @p [__first1,__last1) for a sub-sequence that
458 * compares equal value-by-value with the sequence given by @p
459 * [__first2,__last2) using comp as a predicate and returns an
460 * iterator to the first element of the sub-sequence, or @p __last1
461 * if the sub-sequence is not found. The sub-sequence will be the
462 * last such subsequence contained in [__first,__last1).
464 * Because the sub-sequence must lie completely within the range @p
465 * [__first1,__last1) it must start at a position less than @p
466 * __last1-(__last2-__first2) where @p __last2-__first2 is the
467 * length of the sub-sequence. This means that the returned
468 * iterator @c i will be in the range @p
469 * [__first1,__last1-(__last2-__first2))
471 template<typename _ForwardIterator1
, typename _ForwardIterator2
,
472 typename _BinaryPredicate
>
473 inline _ForwardIterator1
474 find_end(_ForwardIterator1 __first1
, _ForwardIterator1 __last1
,
475 _ForwardIterator2 __first2
, _ForwardIterator2 __last2
,
476 _BinaryPredicate __comp
)
478 // concept requirements
479 __glibcxx_function_requires(_ForwardIteratorConcept
<_ForwardIterator1
>)
480 __glibcxx_function_requires(_ForwardIteratorConcept
<_ForwardIterator2
>)
481 __glibcxx_function_requires(_BinaryPredicateConcept
<_BinaryPredicate
,
482 typename iterator_traits
<_ForwardIterator1
>::value_type
,
483 typename iterator_traits
<_ForwardIterator2
>::value_type
>)
484 __glibcxx_requires_valid_range(__first1
, __last1
);
485 __glibcxx_requires_valid_range(__first2
, __last2
);
487 return std::__find_end(__first1
, __last1
, __first2
, __last2
,
488 std::__iterator_category(__first1
),
489 std::__iterator_category(__first2
),
490 __gnu_cxx::__ops::__iter_comp_iter(__comp
));
493 #if __cplusplus >= 201103L
495 * @brief Checks that a predicate is true for all the elements
497 * @ingroup non_mutating_algorithms
498 * @param __first An input iterator.
499 * @param __last An input iterator.
500 * @param __pred A predicate.
501 * @return True if the check is true, false otherwise.
503 * Returns true if @p __pred is true for each element in the range
504 * @p [__first,__last), and false otherwise.
506 template<typename _InputIterator
, typename _Predicate
>
508 all_of(_InputIterator __first
, _InputIterator __last
, _Predicate __pred
)
509 { return __last
== std::find_if_not(__first
, __last
, __pred
); }
512 * @brief Checks that a predicate is false for all the elements
514 * @ingroup non_mutating_algorithms
515 * @param __first An input iterator.
516 * @param __last An input iterator.
517 * @param __pred A predicate.
518 * @return True if the check is true, false otherwise.
520 * Returns true if @p __pred is false for each element in the range
521 * @p [__first,__last), and false otherwise.
523 template<typename _InputIterator
, typename _Predicate
>
525 none_of(_InputIterator __first
, _InputIterator __last
, _Predicate __pred
)
526 { return __last
== _GLIBCXX_STD_A::find_if(__first
, __last
, __pred
); }
529 * @brief Checks that a predicate is false for at least an element
531 * @ingroup non_mutating_algorithms
532 * @param __first An input iterator.
533 * @param __last An input iterator.
534 * @param __pred A predicate.
535 * @return True if the check is true, false otherwise.
537 * Returns true if an element exists in the range @p
538 * [__first,__last) such that @p __pred is true, and false
541 template<typename _InputIterator
, typename _Predicate
>
543 any_of(_InputIterator __first
, _InputIterator __last
, _Predicate __pred
)
544 { return !std::none_of(__first
, __last
, __pred
); }
547 * @brief Find the first element in a sequence for which a
548 * predicate is false.
549 * @ingroup non_mutating_algorithms
550 * @param __first An input iterator.
551 * @param __last An input iterator.
552 * @param __pred A predicate.
553 * @return The first iterator @c i in the range @p [__first,__last)
554 * such that @p __pred(*i) is false, or @p __last if no such iterator exists.
556 template<typename _InputIterator
, typename _Predicate
>
557 inline _InputIterator
558 find_if_not(_InputIterator __first
, _InputIterator __last
,
561 // concept requirements
562 __glibcxx_function_requires(_InputIteratorConcept
<_InputIterator
>)
563 __glibcxx_function_requires(_UnaryPredicateConcept
<_Predicate
,
564 typename iterator_traits
<_InputIterator
>::value_type
>)
565 __glibcxx_requires_valid_range(__first
, __last
);
566 return std::__find_if_not(__first
, __last
,
567 __gnu_cxx::__ops::__pred_iter(__pred
));
571 * @brief Checks whether the sequence is partitioned.
572 * @ingroup mutating_algorithms
573 * @param __first An input iterator.
574 * @param __last An input iterator.
575 * @param __pred A predicate.
576 * @return True if the range @p [__first,__last) is partioned by @p __pred,
577 * i.e. if all elements that satisfy @p __pred appear before those that
580 template<typename _InputIterator
, typename _Predicate
>
582 is_partitioned(_InputIterator __first
, _InputIterator __last
,
585 __first
= std::find_if_not(__first
, __last
, __pred
);
586 return std::none_of(__first
, __last
, __pred
);
590 * @brief Find the partition point of a partitioned range.
591 * @ingroup mutating_algorithms
592 * @param __first An iterator.
593 * @param __last Another iterator.
594 * @param __pred A predicate.
595 * @return An iterator @p mid such that @p all_of(__first, mid, __pred)
596 * and @p none_of(mid, __last, __pred) are both true.
598 template<typename _ForwardIterator
, typename _Predicate
>
600 partition_point(_ForwardIterator __first
, _ForwardIterator __last
,
603 // concept requirements
604 __glibcxx_function_requires(_ForwardIteratorConcept
<_ForwardIterator
>)
605 __glibcxx_function_requires(_UnaryPredicateConcept
<_Predicate
,
606 typename iterator_traits
<_ForwardIterator
>::value_type
>)
608 // A specific debug-mode test will be necessary...
609 __glibcxx_requires_valid_range(__first
, __last
);
611 typedef typename iterator_traits
<_ForwardIterator
>::difference_type
614 _DistanceType __len
= std::distance(__first
, __last
);
615 _DistanceType __half
;
616 _ForwardIterator __middle
;
622 std::advance(__middle
, __half
);
623 if (__pred(*__middle
))
627 __len
= __len
- __half
- 1;
636 template<typename _InputIterator
, typename _OutputIterator
,
639 __remove_copy_if(_InputIterator __first
, _InputIterator __last
,
640 _OutputIterator __result
, _Predicate __pred
)
642 for (; __first
!= __last
; ++__first
)
643 if (!__pred(__first
))
645 *__result
= *__first
;
652 * @brief Copy a sequence, removing elements of a given value.
653 * @ingroup mutating_algorithms
654 * @param __first An input iterator.
655 * @param __last An input iterator.
656 * @param __result An output iterator.
657 * @param __value The value to be removed.
658 * @return An iterator designating the end of the resulting sequence.
660 * Copies each element in the range @p [__first,__last) not equal
661 * to @p __value to the range beginning at @p __result.
662 * remove_copy() is stable, so the relative order of elements that
663 * are copied is unchanged.
665 template<typename _InputIterator
, typename _OutputIterator
, typename _Tp
>
666 inline _OutputIterator
667 remove_copy(_InputIterator __first
, _InputIterator __last
,
668 _OutputIterator __result
, const _Tp
& __value
)
670 // concept requirements
671 __glibcxx_function_requires(_InputIteratorConcept
<_InputIterator
>)
672 __glibcxx_function_requires(_OutputIteratorConcept
<_OutputIterator
,
673 typename iterator_traits
<_InputIterator
>::value_type
>)
674 __glibcxx_function_requires(_EqualOpConcept
<
675 typename iterator_traits
<_InputIterator
>::value_type
, _Tp
>)
676 __glibcxx_requires_valid_range(__first
, __last
);
678 return std::__remove_copy_if(__first
, __last
, __result
,
679 __gnu_cxx::__ops::__iter_equals_val(__value
));
683 * @brief Copy a sequence, removing elements for which a predicate is true.
684 * @ingroup mutating_algorithms
685 * @param __first An input iterator.
686 * @param __last An input iterator.
687 * @param __result An output iterator.
688 * @param __pred A predicate.
689 * @return An iterator designating the end of the resulting sequence.
691 * Copies each element in the range @p [__first,__last) for which
692 * @p __pred returns false to the range beginning at @p __result.
694 * remove_copy_if() is stable, so the relative order of elements that are
695 * copied is unchanged.
697 template<typename _InputIterator
, typename _OutputIterator
,
699 inline _OutputIterator
700 remove_copy_if(_InputIterator __first
, _InputIterator __last
,
701 _OutputIterator __result
, _Predicate __pred
)
703 // concept requirements
704 __glibcxx_function_requires(_InputIteratorConcept
<_InputIterator
>)
705 __glibcxx_function_requires(_OutputIteratorConcept
<_OutputIterator
,
706 typename iterator_traits
<_InputIterator
>::value_type
>)
707 __glibcxx_function_requires(_UnaryPredicateConcept
<_Predicate
,
708 typename iterator_traits
<_InputIterator
>::value_type
>)
709 __glibcxx_requires_valid_range(__first
, __last
);
711 return std::__remove_copy_if(__first
, __last
, __result
,
712 __gnu_cxx::__ops::__pred_iter(__pred
));
715 #if __cplusplus >= 201103L
717 * @brief Copy the elements of a sequence for which a predicate is true.
718 * @ingroup mutating_algorithms
719 * @param __first An input iterator.
720 * @param __last An input iterator.
721 * @param __result An output iterator.
722 * @param __pred A predicate.
723 * @return An iterator designating the end of the resulting sequence.
725 * Copies each element in the range @p [__first,__last) for which
726 * @p __pred returns true to the range beginning at @p __result.
728 * copy_if() is stable, so the relative order of elements that are
729 * copied is unchanged.
731 template<typename _InputIterator
, typename _OutputIterator
,
734 copy_if(_InputIterator __first
, _InputIterator __last
,
735 _OutputIterator __result
, _Predicate __pred
)
737 // concept requirements
738 __glibcxx_function_requires(_InputIteratorConcept
<_InputIterator
>)
739 __glibcxx_function_requires(_OutputIteratorConcept
<_OutputIterator
,
740 typename iterator_traits
<_InputIterator
>::value_type
>)
741 __glibcxx_function_requires(_UnaryPredicateConcept
<_Predicate
,
742 typename iterator_traits
<_InputIterator
>::value_type
>)
743 __glibcxx_requires_valid_range(__first
, __last
);
745 for (; __first
!= __last
; ++__first
)
746 if (__pred(*__first
))
748 *__result
= *__first
;
754 template<typename _InputIterator
, typename _Size
, typename _OutputIterator
>
756 __copy_n(_InputIterator __first
, _Size __n
,
757 _OutputIterator __result
, input_iterator_tag
)
763 *__result
= *__first
;
774 template<typename _RandomAccessIterator
, typename _Size
,
775 typename _OutputIterator
>
776 inline _OutputIterator
777 __copy_n(_RandomAccessIterator __first
, _Size __n
,
778 _OutputIterator __result
, random_access_iterator_tag
)
779 { return std::copy(__first
, __first
+ __n
, __result
); }
782 * @brief Copies the range [first,first+n) into [result,result+n).
783 * @ingroup mutating_algorithms
784 * @param __first An input iterator.
785 * @param __n The number of elements to copy.
786 * @param __result An output iterator.
789 * This inline function will boil down to a call to @c memmove whenever
790 * possible. Failing that, if random access iterators are passed, then the
791 * loop count will be known (and therefore a candidate for compiler
792 * optimizations such as unrolling).
794 template<typename _InputIterator
, typename _Size
, typename _OutputIterator
>
795 inline _OutputIterator
796 copy_n(_InputIterator __first
, _Size __n
, _OutputIterator __result
)
798 // concept requirements
799 __glibcxx_function_requires(_InputIteratorConcept
<_InputIterator
>)
800 __glibcxx_function_requires(_OutputIteratorConcept
<_OutputIterator
,
801 typename iterator_traits
<_InputIterator
>::value_type
>)
803 return std::__copy_n(__first
, __n
, __result
,
804 std::__iterator_category(__first
));
808 * @brief Copy the elements of a sequence to separate output sequences
809 * depending on the truth value of a predicate.
810 * @ingroup mutating_algorithms
811 * @param __first An input iterator.
812 * @param __last An input iterator.
813 * @param __out_true An output iterator.
814 * @param __out_false An output iterator.
815 * @param __pred A predicate.
816 * @return A pair designating the ends of the resulting sequences.
818 * Copies each element in the range @p [__first,__last) for which
819 * @p __pred returns true to the range beginning at @p out_true
820 * and each element for which @p __pred returns false to @p __out_false.
822 template<typename _InputIterator
, typename _OutputIterator1
,
823 typename _OutputIterator2
, typename _Predicate
>
824 pair
<_OutputIterator1
, _OutputIterator2
>
825 partition_copy(_InputIterator __first
, _InputIterator __last
,
826 _OutputIterator1 __out_true
, _OutputIterator2 __out_false
,
829 // concept requirements
830 __glibcxx_function_requires(_InputIteratorConcept
<_InputIterator
>)
831 __glibcxx_function_requires(_OutputIteratorConcept
<_OutputIterator1
,
832 typename iterator_traits
<_InputIterator
>::value_type
>)
833 __glibcxx_function_requires(_OutputIteratorConcept
<_OutputIterator2
,
834 typename iterator_traits
<_InputIterator
>::value_type
>)
835 __glibcxx_function_requires(_UnaryPredicateConcept
<_Predicate
,
836 typename iterator_traits
<_InputIterator
>::value_type
>)
837 __glibcxx_requires_valid_range(__first
, __last
);
839 for (; __first
!= __last
; ++__first
)
840 if (__pred(*__first
))
842 *__out_true
= *__first
;
847 *__out_false
= *__first
;
851 return pair
<_OutputIterator1
, _OutputIterator2
>(__out_true
, __out_false
);
855 template<typename _ForwardIterator
, typename _Predicate
>
857 __remove_if(_ForwardIterator __first
, _ForwardIterator __last
,
860 __first
= std::__find_if(__first
, __last
, __pred
);
861 if (__first
== __last
)
863 _ForwardIterator __result
= __first
;
865 for (; __first
!= __last
; ++__first
)
866 if (!__pred(__first
))
868 *__result
= _GLIBCXX_MOVE(*__first
);
875 * @brief Remove elements from a sequence.
876 * @ingroup mutating_algorithms
877 * @param __first An input iterator.
878 * @param __last An input iterator.
879 * @param __value The value to be removed.
880 * @return An iterator designating the end of the resulting sequence.
882 * All elements equal to @p __value are removed from the range
883 * @p [__first,__last).
885 * remove() is stable, so the relative order of elements that are
886 * not removed is unchanged.
888 * Elements between the end of the resulting sequence and @p __last
889 * are still present, but their value is unspecified.
891 template<typename _ForwardIterator
, typename _Tp
>
892 inline _ForwardIterator
893 remove(_ForwardIterator __first
, _ForwardIterator __last
,
896 // concept requirements
897 __glibcxx_function_requires(_Mutable_ForwardIteratorConcept
<
899 __glibcxx_function_requires(_EqualOpConcept
<
900 typename iterator_traits
<_ForwardIterator
>::value_type
, _Tp
>)
901 __glibcxx_requires_valid_range(__first
, __last
);
903 return std::__remove_if(__first
, __last
,
904 __gnu_cxx::__ops::__iter_equals_val(__value
));
908 * @brief Remove elements from a sequence using a predicate.
909 * @ingroup mutating_algorithms
910 * @param __first A forward iterator.
911 * @param __last A forward iterator.
912 * @param __pred A predicate.
913 * @return An iterator designating the end of the resulting sequence.
915 * All elements for which @p __pred returns true are removed from the range
916 * @p [__first,__last).
918 * remove_if() is stable, so the relative order of elements that are
919 * not removed is unchanged.
921 * Elements between the end of the resulting sequence and @p __last
922 * are still present, but their value is unspecified.
924 template<typename _ForwardIterator
, typename _Predicate
>
925 inline _ForwardIterator
926 remove_if(_ForwardIterator __first
, _ForwardIterator __last
,
929 // concept requirements
930 __glibcxx_function_requires(_Mutable_ForwardIteratorConcept
<
932 __glibcxx_function_requires(_UnaryPredicateConcept
<_Predicate
,
933 typename iterator_traits
<_ForwardIterator
>::value_type
>)
934 __glibcxx_requires_valid_range(__first
, __last
);
936 return std::__remove_if(__first
, __last
,
937 __gnu_cxx::__ops::__pred_iter(__pred
));
940 template<typename _ForwardIterator
, typename _BinaryPredicate
>
942 __adjacent_find(_ForwardIterator __first
, _ForwardIterator __last
,
943 _BinaryPredicate __binary_pred
)
945 if (__first
== __last
)
947 _ForwardIterator __next
= __first
;
948 while (++__next
!= __last
)
950 if (__binary_pred(__first
, __next
))
957 template<typename _ForwardIterator
, typename _BinaryPredicate
>
959 __unique(_ForwardIterator __first
, _ForwardIterator __last
,
960 _BinaryPredicate __binary_pred
)
962 // Skip the beginning, if already unique.
963 __first
= std::__adjacent_find(__first
, __last
, __binary_pred
);
964 if (__first
== __last
)
967 // Do the real copy work.
968 _ForwardIterator __dest
= __first
;
970 while (++__first
!= __last
)
971 if (!__binary_pred(__dest
, __first
))
972 *++__dest
= _GLIBCXX_MOVE(*__first
);
977 * @brief Remove consecutive duplicate values from a sequence.
978 * @ingroup mutating_algorithms
979 * @param __first A forward iterator.
980 * @param __last A forward iterator.
981 * @return An iterator designating the end of the resulting sequence.
983 * Removes all but the first element from each group of consecutive
984 * values that compare equal.
985 * unique() is stable, so the relative order of elements that are
986 * not removed is unchanged.
987 * Elements between the end of the resulting sequence and @p __last
988 * are still present, but their value is unspecified.
990 template<typename _ForwardIterator
>
991 inline _ForwardIterator
992 unique(_ForwardIterator __first
, _ForwardIterator __last
)
994 // concept requirements
995 __glibcxx_function_requires(_Mutable_ForwardIteratorConcept
<
997 __glibcxx_function_requires(_EqualityComparableConcept
<
998 typename iterator_traits
<_ForwardIterator
>::value_type
>)
999 __glibcxx_requires_valid_range(__first
, __last
);
1001 return std::__unique(__first
, __last
,
1002 __gnu_cxx::__ops::__iter_equal_to_iter());
1006 * @brief Remove consecutive values from a sequence using a predicate.
1007 * @ingroup mutating_algorithms
1008 * @param __first A forward iterator.
1009 * @param __last A forward iterator.
1010 * @param __binary_pred A binary predicate.
1011 * @return An iterator designating the end of the resulting sequence.
1013 * Removes all but the first element from each group of consecutive
1014 * values for which @p __binary_pred returns true.
1015 * unique() is stable, so the relative order of elements that are
1016 * not removed is unchanged.
1017 * Elements between the end of the resulting sequence and @p __last
1018 * are still present, but their value is unspecified.
1020 template<typename _ForwardIterator
, typename _BinaryPredicate
>
1021 inline _ForwardIterator
1022 unique(_ForwardIterator __first
, _ForwardIterator __last
,
1023 _BinaryPredicate __binary_pred
)
1025 // concept requirements
1026 __glibcxx_function_requires(_Mutable_ForwardIteratorConcept
<
1028 __glibcxx_function_requires(_BinaryPredicateConcept
<_BinaryPredicate
,
1029 typename iterator_traits
<_ForwardIterator
>::value_type
,
1030 typename iterator_traits
<_ForwardIterator
>::value_type
>)
1031 __glibcxx_requires_valid_range(__first
, __last
);
1033 return std::__unique(__first
, __last
,
1034 __gnu_cxx::__ops::__iter_comp_iter(__binary_pred
));
1038 * This is an uglified
1039 * unique_copy(_InputIterator, _InputIterator, _OutputIterator,
1041 * overloaded for forward iterators and output iterator as result.
1043 template<typename _ForwardIterator
, typename _OutputIterator
,
1044 typename _BinaryPredicate
>
1046 __unique_copy(_ForwardIterator __first
, _ForwardIterator __last
,
1047 _OutputIterator __result
, _BinaryPredicate __binary_pred
,
1048 forward_iterator_tag
, output_iterator_tag
)
1050 // concept requirements -- iterators already checked
1051 __glibcxx_function_requires(_BinaryPredicateConcept
<_BinaryPredicate
,
1052 typename iterator_traits
<_ForwardIterator
>::value_type
,
1053 typename iterator_traits
<_ForwardIterator
>::value_type
>)
1055 _ForwardIterator __next
= __first
;
1056 *__result
= *__first
;
1057 while (++__next
!= __last
)
1058 if (!__binary_pred(__first
, __next
))
1061 *++__result
= *__first
;
1067 * This is an uglified
1068 * unique_copy(_InputIterator, _InputIterator, _OutputIterator,
1070 * overloaded for input iterators and output iterator as result.
1072 template<typename _InputIterator
, typename _OutputIterator
,
1073 typename _BinaryPredicate
>
1075 __unique_copy(_InputIterator __first
, _InputIterator __last
,
1076 _OutputIterator __result
, _BinaryPredicate __binary_pred
,
1077 input_iterator_tag
, output_iterator_tag
)
1079 // concept requirements -- iterators already checked
1080 __glibcxx_function_requires(_BinaryPredicateConcept
<_BinaryPredicate
,
1081 typename iterator_traits
<_InputIterator
>::value_type
,
1082 typename iterator_traits
<_InputIterator
>::value_type
>)
1084 typename iterator_traits
<_InputIterator
>::value_type __value
= *__first
;
1085 __decltype(__gnu_cxx::__ops::__iter_comp_val(__binary_pred
))
1087 = __gnu_cxx::__ops::__iter_comp_val(__binary_pred
);
1088 *__result
= __value
;
1089 while (++__first
!= __last
)
1090 if (!__rebound_pred(__first
, __value
))
1093 *++__result
= __value
;
1099 * This is an uglified
1100 * unique_copy(_InputIterator, _InputIterator, _OutputIterator,
1102 * overloaded for input iterators and forward iterator as result.
1104 template<typename _InputIterator
, typename _ForwardIterator
,
1105 typename _BinaryPredicate
>
1107 __unique_copy(_InputIterator __first
, _InputIterator __last
,
1108 _ForwardIterator __result
, _BinaryPredicate __binary_pred
,
1109 input_iterator_tag
, forward_iterator_tag
)
1111 // concept requirements -- iterators already checked
1112 __glibcxx_function_requires(_BinaryPredicateConcept
<_BinaryPredicate
,
1113 typename iterator_traits
<_ForwardIterator
>::value_type
,
1114 typename iterator_traits
<_InputIterator
>::value_type
>)
1115 *__result
= *__first
;
1116 while (++__first
!= __last
)
1117 if (!__binary_pred(__result
, __first
))
1118 *++__result
= *__first
;
1123 * This is an uglified reverse(_BidirectionalIterator,
1124 * _BidirectionalIterator)
1125 * overloaded for bidirectional iterators.
1127 template<typename _BidirectionalIterator
>
1129 __reverse(_BidirectionalIterator __first
, _BidirectionalIterator __last
,
1130 bidirectional_iterator_tag
)
1133 if (__first
== __last
|| __first
== --__last
)
1137 std::iter_swap(__first
, __last
);
1143 * This is an uglified reverse(_BidirectionalIterator,
1144 * _BidirectionalIterator)
1145 * overloaded for random access iterators.
1147 template<typename _RandomAccessIterator
>
1149 __reverse(_RandomAccessIterator __first
, _RandomAccessIterator __last
,
1150 random_access_iterator_tag
)
1152 if (__first
== __last
)
1155 while (__first
< __last
)
1157 std::iter_swap(__first
, __last
);
1164 * @brief Reverse a sequence.
1165 * @ingroup mutating_algorithms
1166 * @param __first A bidirectional iterator.
1167 * @param __last A bidirectional iterator.
1168 * @return reverse() returns no value.
1170 * Reverses the order of the elements in the range @p [__first,__last),
1171 * so that the first element becomes the last etc.
1172 * For every @c i such that @p 0<=i<=(__last-__first)/2), @p reverse()
1173 * swaps @p *(__first+i) and @p *(__last-(i+1))
1175 template<typename _BidirectionalIterator
>
1177 reverse(_BidirectionalIterator __first
, _BidirectionalIterator __last
)
1179 // concept requirements
1180 __glibcxx_function_requires(_Mutable_BidirectionalIteratorConcept
<
1181 _BidirectionalIterator
>)
1182 __glibcxx_requires_valid_range(__first
, __last
);
1183 std::__reverse(__first
, __last
, std::__iterator_category(__first
));
1187 * @brief Copy a sequence, reversing its elements.
1188 * @ingroup mutating_algorithms
1189 * @param __first A bidirectional iterator.
1190 * @param __last A bidirectional iterator.
1191 * @param __result An output iterator.
1192 * @return An iterator designating the end of the resulting sequence.
1194 * Copies the elements in the range @p [__first,__last) to the
1195 * range @p [__result,__result+(__last-__first)) such that the
1196 * order of the elements is reversed. For every @c i such that @p
1197 * 0<=i<=(__last-__first), @p reverse_copy() performs the
1198 * assignment @p *(__result+(__last-__first)-1-i) = *(__first+i).
1199 * The ranges @p [__first,__last) and @p
1200 * [__result,__result+(__last-__first)) must not overlap.
1202 template<typename _BidirectionalIterator
, typename _OutputIterator
>
1204 reverse_copy(_BidirectionalIterator __first
, _BidirectionalIterator __last
,
1205 _OutputIterator __result
)
1207 // concept requirements
1208 __glibcxx_function_requires(_BidirectionalIteratorConcept
<
1209 _BidirectionalIterator
>)
1210 __glibcxx_function_requires(_OutputIteratorConcept
<_OutputIterator
,
1211 typename iterator_traits
<_BidirectionalIterator
>::value_type
>)
1212 __glibcxx_requires_valid_range(__first
, __last
);
1214 while (__first
!= __last
)
1217 *__result
= *__last
;
1224 * This is a helper function for the rotate algorithm specialized on RAIs.
1225 * It returns the greatest common divisor of two integer values.
1227 template<typename _EuclideanRingElement
>
1228 _EuclideanRingElement
1229 __gcd(_EuclideanRingElement __m
, _EuclideanRingElement __n
)
1233 _EuclideanRingElement __t
= __m
% __n
;
1240 inline namespace _V2
1243 /// This is a helper function for the rotate algorithm.
1244 template<typename _ForwardIterator
>
1246 __rotate(_ForwardIterator __first
,
1247 _ForwardIterator __middle
,
1248 _ForwardIterator __last
,
1249 forward_iterator_tag
)
1251 if (__first
== __middle
)
1253 else if (__last
== __middle
)
1256 _ForwardIterator __first2
= __middle
;
1259 std::iter_swap(__first
, __first2
);
1262 if (__first
== __middle
)
1263 __middle
= __first2
;
1265 while (__first2
!= __last
);
1267 _ForwardIterator __ret
= __first
;
1269 __first2
= __middle
;
1271 while (__first2
!= __last
)
1273 std::iter_swap(__first
, __first2
);
1276 if (__first
== __middle
)
1277 __middle
= __first2
;
1278 else if (__first2
== __last
)
1279 __first2
= __middle
;
1284 /// This is a helper function for the rotate algorithm.
1285 template<typename _BidirectionalIterator
>
1286 _BidirectionalIterator
1287 __rotate(_BidirectionalIterator __first
,
1288 _BidirectionalIterator __middle
,
1289 _BidirectionalIterator __last
,
1290 bidirectional_iterator_tag
)
1292 // concept requirements
1293 __glibcxx_function_requires(_Mutable_BidirectionalIteratorConcept
<
1294 _BidirectionalIterator
>)
1296 if (__first
== __middle
)
1298 else if (__last
== __middle
)
1301 std::__reverse(__first
, __middle
, bidirectional_iterator_tag());
1302 std::__reverse(__middle
, __last
, bidirectional_iterator_tag());
1304 while (__first
!= __middle
&& __middle
!= __last
)
1306 std::iter_swap(__first
, --__last
);
1310 if (__first
== __middle
)
1312 std::__reverse(__middle
, __last
, bidirectional_iterator_tag());
1317 std::__reverse(__first
, __middle
, bidirectional_iterator_tag());
1322 /// This is a helper function for the rotate algorithm.
1323 template<typename _RandomAccessIterator
>
1324 _RandomAccessIterator
1325 __rotate(_RandomAccessIterator __first
,
1326 _RandomAccessIterator __middle
,
1327 _RandomAccessIterator __last
,
1328 random_access_iterator_tag
)
1330 // concept requirements
1331 __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept
<
1332 _RandomAccessIterator
>)
1334 if (__first
== __middle
)
1336 else if (__last
== __middle
)
1339 typedef typename iterator_traits
<_RandomAccessIterator
>::difference_type
1341 typedef typename iterator_traits
<_RandomAccessIterator
>::value_type
1344 _Distance __n
= __last
- __first
;
1345 _Distance __k
= __middle
- __first
;
1347 if (__k
== __n
- __k
)
1349 std::swap_ranges(__first
, __middle
, __middle
);
1353 _RandomAccessIterator __p
= __first
;
1354 _RandomAccessIterator __ret
= __first
+ (__last
- __middle
);
1358 if (__k
< __n
- __k
)
1360 if (__is_pod(_ValueType
) && __k
== 1)
1362 _ValueType __t
= _GLIBCXX_MOVE(*__p
);
1363 _GLIBCXX_MOVE3(__p
+ 1, __p
+ __n
, __p
);
1364 *(__p
+ __n
- 1) = _GLIBCXX_MOVE(__t
);
1367 _RandomAccessIterator __q
= __p
+ __k
;
1368 for (_Distance __i
= 0; __i
< __n
- __k
; ++ __i
)
1370 std::iter_swap(__p
, __q
);
1377 std::swap(__n
, __k
);
1383 if (__is_pod(_ValueType
) && __k
== 1)
1385 _ValueType __t
= _GLIBCXX_MOVE(*(__p
+ __n
- 1));
1386 _GLIBCXX_MOVE_BACKWARD3(__p
, __p
+ __n
- 1, __p
+ __n
);
1387 *__p
= _GLIBCXX_MOVE(__t
);
1390 _RandomAccessIterator __q
= __p
+ __n
;
1392 for (_Distance __i
= 0; __i
< __n
- __k
; ++ __i
)
1396 std::iter_swap(__p
, __q
);
1401 std::swap(__n
, __k
);
1406 // _GLIBCXX_RESOLVE_LIB_DEFECTS
1407 // DR 488. rotate throws away useful information
1409 * @brief Rotate the elements of a sequence.
1410 * @ingroup mutating_algorithms
1411 * @param __first A forward iterator.
1412 * @param __middle A forward iterator.
1413 * @param __last A forward iterator.
1414 * @return first + (last - middle).
1416 * Rotates the elements of the range @p [__first,__last) by
1417 * @p (__middle - __first) positions so that the element at @p __middle
1418 * is moved to @p __first, the element at @p __middle+1 is moved to
1419 * @p __first+1 and so on for each element in the range
1420 * @p [__first,__last).
1422 * This effectively swaps the ranges @p [__first,__middle) and
1423 * @p [__middle,__last).
1426 * @p *(__first+(n+(__last-__middle))%(__last-__first))=*(__first+n)
1427 * for each @p n in the range @p [0,__last-__first).
1429 template<typename _ForwardIterator
>
1430 inline _ForwardIterator
1431 rotate(_ForwardIterator __first
, _ForwardIterator __middle
,
1432 _ForwardIterator __last
)
1434 // concept requirements
1435 __glibcxx_function_requires(_Mutable_ForwardIteratorConcept
<
1437 __glibcxx_requires_valid_range(__first
, __middle
);
1438 __glibcxx_requires_valid_range(__middle
, __last
);
1440 return std::__rotate(__first
, __middle
, __last
,
1441 std::__iterator_category(__first
));
1447 * @brief Copy a sequence, rotating its elements.
1448 * @ingroup mutating_algorithms
1449 * @param __first A forward iterator.
1450 * @param __middle A forward iterator.
1451 * @param __last A forward iterator.
1452 * @param __result An output iterator.
1453 * @return An iterator designating the end of the resulting sequence.
1455 * Copies the elements of the range @p [__first,__last) to the
1456 * range beginning at @result, rotating the copied elements by
1457 * @p (__middle-__first) positions so that the element at @p __middle
1458 * is moved to @p __result, the element at @p __middle+1 is moved
1459 * to @p __result+1 and so on for each element in the range @p
1463 * @p *(__result+(n+(__last-__middle))%(__last-__first))=*(__first+n)
1464 * for each @p n in the range @p [0,__last-__first).
1466 template<typename _ForwardIterator
, typename _OutputIterator
>
1467 inline _OutputIterator
1468 rotate_copy(_ForwardIterator __first
, _ForwardIterator __middle
,
1469 _ForwardIterator __last
, _OutputIterator __result
)
1471 // concept requirements
1472 __glibcxx_function_requires(_ForwardIteratorConcept
<_ForwardIterator
>)
1473 __glibcxx_function_requires(_OutputIteratorConcept
<_OutputIterator
,
1474 typename iterator_traits
<_ForwardIterator
>::value_type
>)
1475 __glibcxx_requires_valid_range(__first
, __middle
);
1476 __glibcxx_requires_valid_range(__middle
, __last
);
1478 return std::copy(__first
, __middle
,
1479 std::copy(__middle
, __last
, __result
));
1482 /// This is a helper function...
1483 template<typename _ForwardIterator
, typename _Predicate
>
1485 __partition(_ForwardIterator __first
, _ForwardIterator __last
,
1486 _Predicate __pred
, forward_iterator_tag
)
1488 if (__first
== __last
)
1491 while (__pred(*__first
))
1492 if (++__first
== __last
)
1495 _ForwardIterator __next
= __first
;
1497 while (++__next
!= __last
)
1498 if (__pred(*__next
))
1500 std::iter_swap(__first
, __next
);
1507 /// This is a helper function...
1508 template<typename _BidirectionalIterator
, typename _Predicate
>
1509 _BidirectionalIterator
1510 __partition(_BidirectionalIterator __first
, _BidirectionalIterator __last
,
1511 _Predicate __pred
, bidirectional_iterator_tag
)
1516 if (__first
== __last
)
1518 else if (__pred(*__first
))
1524 if (__first
== __last
)
1526 else if (!bool(__pred(*__last
)))
1530 std::iter_swap(__first
, __last
);
1537 /// This is a helper function...
1538 /// Requires __first != __last and !__pred(__first)
1539 /// and __len == distance(__first, __last).
1541 /// !__pred(__first) allows us to guarantee that we don't
1542 /// move-assign an element onto itself.
1543 template<typename _ForwardIterator
, typename _Pointer
, typename _Predicate
,
1546 __stable_partition_adaptive(_ForwardIterator __first
,
1547 _ForwardIterator __last
,
1548 _Predicate __pred
, _Distance __len
,
1550 _Distance __buffer_size
)
1555 if (__len
<= __buffer_size
)
1557 _ForwardIterator __result1
= __first
;
1558 _Pointer __result2
= __buffer
;
1560 // The precondition guarantees that !__pred(__first), so
1561 // move that element to the buffer before starting the loop.
1562 // This ensures that we only call __pred once per element.
1563 *__result2
= _GLIBCXX_MOVE(*__first
);
1566 for (; __first
!= __last
; ++__first
)
1567 if (__pred(__first
))
1569 *__result1
= _GLIBCXX_MOVE(*__first
);
1574 *__result2
= _GLIBCXX_MOVE(*__first
);
1578 _GLIBCXX_MOVE3(__buffer
, __result2
, __result1
);
1582 _ForwardIterator __middle
= __first
;
1583 std::advance(__middle
, __len
/ 2);
1584 _ForwardIterator __left_split
=
1585 std::__stable_partition_adaptive(__first
, __middle
, __pred
,
1586 __len
/ 2, __buffer
,
1589 // Advance past true-predicate values to satisfy this
1590 // function's preconditions.
1591 _Distance __right_len
= __len
- __len
/ 2;
1592 _ForwardIterator __right_split
=
1593 std::__find_if_not_n(__middle
, __right_len
, __pred
);
1597 std::__stable_partition_adaptive(__right_split
, __last
, __pred
,
1599 __buffer
, __buffer_size
);
1601 std::rotate(__left_split
, __middle
, __right_split
);
1602 std::advance(__left_split
, std::distance(__middle
, __right_split
));
1603 return __left_split
;
1606 template<typename _ForwardIterator
, typename _Predicate
>
1608 __stable_partition(_ForwardIterator __first
, _ForwardIterator __last
,
1611 __first
= std::__find_if_not(__first
, __last
, __pred
);
1613 if (__first
== __last
)
1616 typedef typename iterator_traits
<_ForwardIterator
>::value_type
1618 typedef typename iterator_traits
<_ForwardIterator
>::difference_type
1621 _Temporary_buffer
<_ForwardIterator
, _ValueType
> __buf(__first
, __last
);
1623 std::__stable_partition_adaptive(__first
, __last
, __pred
,
1624 _DistanceType(__buf
.requested_size()),
1626 _DistanceType(__buf
.size()));
1630 * @brief Move elements for which a predicate is true to the beginning
1631 * of a sequence, preserving relative ordering.
1632 * @ingroup mutating_algorithms
1633 * @param __first A forward iterator.
1634 * @param __last A forward iterator.
1635 * @param __pred A predicate functor.
1636 * @return An iterator @p middle such that @p __pred(i) is true for each
1637 * iterator @p i in the range @p [first,middle) and false for each @p i
1638 * in the range @p [middle,last).
1640 * Performs the same function as @p partition() with the additional
1641 * guarantee that the relative ordering of elements in each group is
1642 * preserved, so any two elements @p x and @p y in the range
1643 * @p [__first,__last) such that @p __pred(x)==__pred(y) will have the same
1644 * relative ordering after calling @p stable_partition().
1646 template<typename _ForwardIterator
, typename _Predicate
>
1647 inline _ForwardIterator
1648 stable_partition(_ForwardIterator __first
, _ForwardIterator __last
,
1651 // concept requirements
1652 __glibcxx_function_requires(_Mutable_ForwardIteratorConcept
<
1654 __glibcxx_function_requires(_UnaryPredicateConcept
<_Predicate
,
1655 typename iterator_traits
<_ForwardIterator
>::value_type
>)
1656 __glibcxx_requires_valid_range(__first
, __last
);
1658 return std::__stable_partition(__first
, __last
,
1659 __gnu_cxx::__ops::__pred_iter(__pred
));
1662 /// This is a helper function for the sort routines.
1663 template<typename _RandomAccessIterator
, typename _Compare
>
1665 __heap_select(_RandomAccessIterator __first
,
1666 _RandomAccessIterator __middle
,
1667 _RandomAccessIterator __last
, _Compare __comp
)
1669 std::__make_heap(__first
, __middle
, __comp
);
1670 for (_RandomAccessIterator __i
= __middle
; __i
< __last
; ++__i
)
1671 if (__comp(__i
, __first
))
1672 std::__pop_heap(__first
, __middle
, __i
, __comp
);
1677 template<typename _InputIterator
, typename _RandomAccessIterator
,
1679 _RandomAccessIterator
1680 __partial_sort_copy(_InputIterator __first
, _InputIterator __last
,
1681 _RandomAccessIterator __result_first
,
1682 _RandomAccessIterator __result_last
,
1685 typedef typename iterator_traits
<_InputIterator
>::value_type
1687 typedef iterator_traits
<_RandomAccessIterator
> _RItTraits
;
1688 typedef typename
_RItTraits::difference_type _DistanceType
;
1690 if (__result_first
== __result_last
)
1691 return __result_last
;
1692 _RandomAccessIterator __result_real_last
= __result_first
;
1693 while (__first
!= __last
&& __result_real_last
!= __result_last
)
1695 *__result_real_last
= *__first
;
1696 ++__result_real_last
;
1700 std::__make_heap(__result_first
, __result_real_last
, __comp
);
1701 while (__first
!= __last
)
1703 if (__comp(__first
, __result_first
))
1704 std::__adjust_heap(__result_first
, _DistanceType(0),
1705 _DistanceType(__result_real_last
1707 _InputValueType(*__first
), __comp
);
1710 std::__sort_heap(__result_first
, __result_real_last
, __comp
);
1711 return __result_real_last
;
1715 * @brief Copy the smallest elements of a sequence.
1716 * @ingroup sorting_algorithms
1717 * @param __first An iterator.
1718 * @param __last Another iterator.
1719 * @param __result_first A random-access iterator.
1720 * @param __result_last Another random-access iterator.
1721 * @return An iterator indicating the end of the resulting sequence.
1723 * Copies and sorts the smallest N values from the range @p [__first,__last)
1724 * to the range beginning at @p __result_first, where the number of
1725 * elements to be copied, @p N, is the smaller of @p (__last-__first) and
1726 * @p (__result_last-__result_first).
1727 * After the sort if @e i and @e j are iterators in the range
1728 * @p [__result_first,__result_first+N) such that i precedes j then
1730 * The value returned is @p __result_first+N.
1732 template<typename _InputIterator
, typename _RandomAccessIterator
>
1733 inline _RandomAccessIterator
1734 partial_sort_copy(_InputIterator __first
, _InputIterator __last
,
1735 _RandomAccessIterator __result_first
,
1736 _RandomAccessIterator __result_last
)
1738 typedef typename iterator_traits
<_InputIterator
>::value_type
1740 typedef typename iterator_traits
<_RandomAccessIterator
>::value_type
1742 typedef typename iterator_traits
<_RandomAccessIterator
>::difference_type
1745 // concept requirements
1746 __glibcxx_function_requires(_InputIteratorConcept
<_InputIterator
>)
1747 __glibcxx_function_requires(_ConvertibleConcept
<_InputValueType
,
1749 __glibcxx_function_requires(_LessThanOpConcept
<_InputValueType
,
1751 __glibcxx_function_requires(_LessThanComparableConcept
<_OutputValueType
>)
1752 __glibcxx_requires_valid_range(__first
, __last
);
1753 __glibcxx_requires_valid_range(__result_first
, __result_last
);
1755 return std::__partial_sort_copy(__first
, __last
,
1756 __result_first
, __result_last
,
1757 __gnu_cxx::__ops::__iter_less_iter());
1761 * @brief Copy the smallest elements of a sequence using a predicate for
1763 * @ingroup sorting_algorithms
1764 * @param __first An input iterator.
1765 * @param __last Another input iterator.
1766 * @param __result_first A random-access iterator.
1767 * @param __result_last Another random-access iterator.
1768 * @param __comp A comparison functor.
1769 * @return An iterator indicating the end of the resulting sequence.
1771 * Copies and sorts the smallest N values from the range @p [__first,__last)
1772 * to the range beginning at @p result_first, where the number of
1773 * elements to be copied, @p N, is the smaller of @p (__last-__first) and
1774 * @p (__result_last-__result_first).
1775 * After the sort if @e i and @e j are iterators in the range
1776 * @p [__result_first,__result_first+N) such that i precedes j then
1777 * @p __comp(*j,*i) is false.
1778 * The value returned is @p __result_first+N.
1780 template<typename _InputIterator
, typename _RandomAccessIterator
,
1782 inline _RandomAccessIterator
1783 partial_sort_copy(_InputIterator __first
, _InputIterator __last
,
1784 _RandomAccessIterator __result_first
,
1785 _RandomAccessIterator __result_last
,
1788 typedef typename iterator_traits
<_InputIterator
>::value_type
1790 typedef typename iterator_traits
<_RandomAccessIterator
>::value_type
1792 typedef typename iterator_traits
<_RandomAccessIterator
>::difference_type
1795 // concept requirements
1796 __glibcxx_function_requires(_InputIteratorConcept
<_InputIterator
>)
1797 __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept
<
1798 _RandomAccessIterator
>)
1799 __glibcxx_function_requires(_ConvertibleConcept
<_InputValueType
,
1801 __glibcxx_function_requires(_BinaryPredicateConcept
<_Compare
,
1802 _InputValueType
, _OutputValueType
>)
1803 __glibcxx_function_requires(_BinaryPredicateConcept
<_Compare
,
1804 _OutputValueType
, _OutputValueType
>)
1805 __glibcxx_requires_valid_range(__first
, __last
);
1806 __glibcxx_requires_valid_range(__result_first
, __result_last
);
1808 return std::__partial_sort_copy(__first
, __last
,
1809 __result_first
, __result_last
,
1810 __gnu_cxx::__ops::__iter_comp_iter(__comp
));
1813 /// This is a helper function for the sort routine.
1814 template<typename _RandomAccessIterator
, typename _Compare
>
1816 __unguarded_linear_insert(_RandomAccessIterator __last
,
1819 typename iterator_traits
<_RandomAccessIterator
>::value_type
1820 __val
= _GLIBCXX_MOVE(*__last
);
1821 _RandomAccessIterator __next
= __last
;
1823 while (__comp(__val
, __next
))
1825 *__last
= _GLIBCXX_MOVE(*__next
);
1829 *__last
= _GLIBCXX_MOVE(__val
);
1832 /// This is a helper function for the sort routine.
1833 template<typename _RandomAccessIterator
, typename _Compare
>
1835 __insertion_sort(_RandomAccessIterator __first
,
1836 _RandomAccessIterator __last
, _Compare __comp
)
1838 if (__first
== __last
) return;
1840 for (_RandomAccessIterator __i
= __first
+ 1; __i
!= __last
; ++__i
)
1842 if (__comp(__i
, __first
))
1844 typename iterator_traits
<_RandomAccessIterator
>::value_type
1845 __val
= _GLIBCXX_MOVE(*__i
);
1846 _GLIBCXX_MOVE_BACKWARD3(__first
, __i
, __i
+ 1);
1847 *__first
= _GLIBCXX_MOVE(__val
);
1850 std::__unguarded_linear_insert(__i
,
1851 __gnu_cxx::__ops::__val_comp_iter(__comp
));
1855 /// This is a helper function for the sort routine.
1856 template<typename _RandomAccessIterator
, typename _Compare
>
1858 __unguarded_insertion_sort(_RandomAccessIterator __first
,
1859 _RandomAccessIterator __last
, _Compare __comp
)
1861 for (_RandomAccessIterator __i
= __first
; __i
!= __last
; ++__i
)
1862 std::__unguarded_linear_insert(__i
,
1863 __gnu_cxx::__ops::__val_comp_iter(__comp
));
1868 * This controls some aspect of the sort routines.
1870 enum { _S_threshold
= 16 };
1872 /// This is a helper function for the sort routine.
1873 template<typename _RandomAccessIterator
, typename _Compare
>
1875 __final_insertion_sort(_RandomAccessIterator __first
,
1876 _RandomAccessIterator __last
, _Compare __comp
)
1878 if (__last
- __first
> int(_S_threshold
))
1880 std::__insertion_sort(__first
, __first
+ int(_S_threshold
), __comp
);
1881 std::__unguarded_insertion_sort(__first
+ int(_S_threshold
), __last
,
1885 std::__insertion_sort(__first
, __last
, __comp
);
1888 /// This is a helper function...
1889 template<typename _RandomAccessIterator
, typename _Compare
>
1890 _RandomAccessIterator
1891 __unguarded_partition(_RandomAccessIterator __first
,
1892 _RandomAccessIterator __last
,
1893 _RandomAccessIterator __pivot
, _Compare __comp
)
1897 while (__comp(__first
, __pivot
))
1900 while (__comp(__pivot
, __last
))
1902 if (!(__first
< __last
))
1904 std::iter_swap(__first
, __last
);
1909 /// This is a helper function...
1910 template<typename _RandomAccessIterator
, typename _Compare
>
1911 inline _RandomAccessIterator
1912 __unguarded_partition_pivot(_RandomAccessIterator __first
,
1913 _RandomAccessIterator __last
, _Compare __comp
)
1915 _RandomAccessIterator __mid
= __first
+ (__last
- __first
) / 2;
1916 std::__move_median_to_first(__first
, __first
+ 1, __mid
, __last
- 1,
1918 return std::__unguarded_partition(__first
+ 1, __last
, __first
, __comp
);
1921 template<typename _RandomAccessIterator
, typename _Compare
>
1923 __partial_sort(_RandomAccessIterator __first
,
1924 _RandomAccessIterator __middle
,
1925 _RandomAccessIterator __last
,
1928 std::__heap_select(__first
, __middle
, __last
, __comp
);
1929 std::__sort_heap(__first
, __middle
, __comp
);
1932 /// This is a helper function for the sort routine.
1933 template<typename _RandomAccessIterator
, typename _Size
, typename _Compare
>
1935 __introsort_loop(_RandomAccessIterator __first
,
1936 _RandomAccessIterator __last
,
1937 _Size __depth_limit
, _Compare __comp
)
1939 while (__last
- __first
> int(_S_threshold
))
1941 if (__depth_limit
== 0)
1943 std::__partial_sort(__first
, __last
, __last
, __comp
);
1947 _RandomAccessIterator __cut
=
1948 std::__unguarded_partition_pivot(__first
, __last
, __comp
);
1949 std::__introsort_loop(__cut
, __last
, __depth_limit
, __comp
);
1956 template<typename _RandomAccessIterator
, typename _Compare
>
1958 __sort(_RandomAccessIterator __first
, _RandomAccessIterator __last
,
1961 if (__first
!= __last
)
1963 std::__introsort_loop(__first
, __last
,
1964 std::__lg(__last
- __first
) * 2,
1966 std::__final_insertion_sort(__first
, __last
, __comp
);
1970 template<typename _RandomAccessIterator
, typename _Size
, typename _Compare
>
1972 __introselect(_RandomAccessIterator __first
, _RandomAccessIterator __nth
,
1973 _RandomAccessIterator __last
, _Size __depth_limit
,
1976 while (__last
- __first
> 3)
1978 if (__depth_limit
== 0)
1980 std::__heap_select(__first
, __nth
+ 1, __last
, __comp
);
1981 // Place the nth largest element in its final position.
1982 std::iter_swap(__first
, __nth
);
1986 _RandomAccessIterator __cut
=
1987 std::__unguarded_partition_pivot(__first
, __last
, __comp
);
1993 std::__insertion_sort(__first
, __last
, __comp
);
1998 // lower_bound moved to stl_algobase.h
2001 * @brief Finds the first position in which @p __val could be inserted
2002 * without changing the ordering.
2003 * @ingroup binary_search_algorithms
2004 * @param __first An iterator.
2005 * @param __last Another iterator.
2006 * @param __val The search term.
2007 * @param __comp A functor to use for comparisons.
2008 * @return An iterator pointing to the first element <em>not less
2009 * than</em> @p __val, or end() if every element is less
2011 * @ingroup binary_search_algorithms
2013 * The comparison function should have the same effects on ordering as
2014 * the function used for the initial sort.
2016 template<typename _ForwardIterator
, typename _Tp
, typename _Compare
>
2017 inline _ForwardIterator
2018 lower_bound(_ForwardIterator __first
, _ForwardIterator __last
,
2019 const _Tp
& __val
, _Compare __comp
)
2021 typedef typename iterator_traits
<_ForwardIterator
>::value_type
2024 // concept requirements
2025 __glibcxx_function_requires(_ForwardIteratorConcept
<_ForwardIterator
>)
2026 __glibcxx_function_requires(_BinaryPredicateConcept
<_Compare
,
2028 __glibcxx_requires_partitioned_lower_pred(__first
, __last
,
2031 return std::__lower_bound(__first
, __last
, __val
,
2032 __gnu_cxx::__ops::__iter_comp_val(__comp
));
2035 template<typename _ForwardIterator
, typename _Tp
, typename _Compare
>
2037 __upper_bound(_ForwardIterator __first
, _ForwardIterator __last
,
2038 const _Tp
& __val
, _Compare __comp
)
2040 typedef typename iterator_traits
<_ForwardIterator
>::difference_type
2043 _DistanceType __len
= std::distance(__first
, __last
);
2047 _DistanceType __half
= __len
>> 1;
2048 _ForwardIterator __middle
= __first
;
2049 std::advance(__middle
, __half
);
2050 if (__comp(__val
, __middle
))
2056 __len
= __len
- __half
- 1;
2063 * @brief Finds the last position in which @p __val could be inserted
2064 * without changing the ordering.
2065 * @ingroup binary_search_algorithms
2066 * @param __first An iterator.
2067 * @param __last Another iterator.
2068 * @param __val The search term.
2069 * @return An iterator pointing to the first element greater than @p __val,
2070 * or end() if no elements are greater than @p __val.
2071 * @ingroup binary_search_algorithms
2073 template<typename _ForwardIterator
, typename _Tp
>
2074 inline _ForwardIterator
2075 upper_bound(_ForwardIterator __first
, _ForwardIterator __last
,
2078 typedef typename iterator_traits
<_ForwardIterator
>::value_type
2081 // concept requirements
2082 __glibcxx_function_requires(_ForwardIteratorConcept
<_ForwardIterator
>)
2083 __glibcxx_function_requires(_LessThanOpConcept
<_Tp
, _ValueType
>)
2084 __glibcxx_requires_partitioned_upper(__first
, __last
, __val
);
2086 return std::__upper_bound(__first
, __last
, __val
,
2087 __gnu_cxx::__ops::__val_less_iter());
2091 * @brief Finds the last position in which @p __val could be inserted
2092 * without changing the ordering.
2093 * @ingroup binary_search_algorithms
2094 * @param __first An iterator.
2095 * @param __last Another iterator.
2096 * @param __val The search term.
2097 * @param __comp A functor to use for comparisons.
2098 * @return An iterator pointing to the first element greater than @p __val,
2099 * or end() if no elements are greater than @p __val.
2100 * @ingroup binary_search_algorithms
2102 * The comparison function should have the same effects on ordering as
2103 * the function used for the initial sort.
2105 template<typename _ForwardIterator
, typename _Tp
, typename _Compare
>
2106 inline _ForwardIterator
2107 upper_bound(_ForwardIterator __first
, _ForwardIterator __last
,
2108 const _Tp
& __val
, _Compare __comp
)
2110 typedef typename iterator_traits
<_ForwardIterator
>::value_type
2113 // concept requirements
2114 __glibcxx_function_requires(_ForwardIteratorConcept
<_ForwardIterator
>)
2115 __glibcxx_function_requires(_BinaryPredicateConcept
<_Compare
,
2117 __glibcxx_requires_partitioned_upper_pred(__first
, __last
,
2120 return std::__upper_bound(__first
, __last
, __val
,
2121 __gnu_cxx::__ops::__val_comp_iter(__comp
));
2124 template<typename _ForwardIterator
, typename _Tp
,
2125 typename _CompareItTp
, typename _CompareTpIt
>
2126 pair
<_ForwardIterator
, _ForwardIterator
>
2127 __equal_range(_ForwardIterator __first
, _ForwardIterator __last
,
2129 _CompareItTp __comp_it_val
, _CompareTpIt __comp_val_it
)
2131 typedef typename iterator_traits
<_ForwardIterator
>::difference_type
2134 _DistanceType __len
= std::distance(__first
, __last
);
2138 _DistanceType __half
= __len
>> 1;
2139 _ForwardIterator __middle
= __first
;
2140 std::advance(__middle
, __half
);
2141 if (__comp_it_val(__middle
, __val
))
2145 __len
= __len
- __half
- 1;
2147 else if (__comp_val_it(__val
, __middle
))
2151 _ForwardIterator __left
2152 = std::__lower_bound(__first
, __middle
, __val
, __comp_it_val
);
2153 std::advance(__first
, __len
);
2154 _ForwardIterator __right
2155 = std::__upper_bound(++__middle
, __first
, __val
, __comp_val_it
);
2156 return pair
<_ForwardIterator
, _ForwardIterator
>(__left
, __right
);
2159 return pair
<_ForwardIterator
, _ForwardIterator
>(__first
, __first
);
2163 * @brief Finds the largest subrange in which @p __val could be inserted
2164 * at any place in it without changing the ordering.
2165 * @ingroup binary_search_algorithms
2166 * @param __first An iterator.
2167 * @param __last Another iterator.
2168 * @param __val The search term.
2169 * @return An pair of iterators defining the subrange.
2170 * @ingroup binary_search_algorithms
2172 * This is equivalent to
2174 * std::make_pair(lower_bound(__first, __last, __val),
2175 * upper_bound(__first, __last, __val))
2177 * but does not actually call those functions.
2179 template<typename _ForwardIterator
, typename _Tp
>
2180 inline pair
<_ForwardIterator
, _ForwardIterator
>
2181 equal_range(_ForwardIterator __first
, _ForwardIterator __last
,
2184 typedef typename iterator_traits
<_ForwardIterator
>::value_type
2187 // concept requirements
2188 __glibcxx_function_requires(_ForwardIteratorConcept
<_ForwardIterator
>)
2189 __glibcxx_function_requires(_LessThanOpConcept
<_ValueType
, _Tp
>)
2190 __glibcxx_function_requires(_LessThanOpConcept
<_Tp
, _ValueType
>)
2191 __glibcxx_requires_partitioned_lower(__first
, __last
, __val
);
2192 __glibcxx_requires_partitioned_upper(__first
, __last
, __val
);
2194 return std::__equal_range(__first
, __last
, __val
,
2195 __gnu_cxx::__ops::__iter_less_val(),
2196 __gnu_cxx::__ops::__val_less_iter());
2200 * @brief Finds the largest subrange in which @p __val could be inserted
2201 * at any place in it without changing the ordering.
2202 * @param __first An iterator.
2203 * @param __last Another iterator.
2204 * @param __val The search term.
2205 * @param __comp A functor to use for comparisons.
2206 * @return An pair of iterators defining the subrange.
2207 * @ingroup binary_search_algorithms
2209 * This is equivalent to
2211 * std::make_pair(lower_bound(__first, __last, __val, __comp),
2212 * upper_bound(__first, __last, __val, __comp))
2214 * but does not actually call those functions.
2216 template<typename _ForwardIterator
, typename _Tp
, typename _Compare
>
2217 inline pair
<_ForwardIterator
, _ForwardIterator
>
2218 equal_range(_ForwardIterator __first
, _ForwardIterator __last
,
2219 const _Tp
& __val
, _Compare __comp
)
2221 typedef typename iterator_traits
<_ForwardIterator
>::value_type
2224 // concept requirements
2225 __glibcxx_function_requires(_ForwardIteratorConcept
<_ForwardIterator
>)
2226 __glibcxx_function_requires(_BinaryPredicateConcept
<_Compare
,
2228 __glibcxx_function_requires(_BinaryPredicateConcept
<_Compare
,
2230 __glibcxx_requires_partitioned_lower_pred(__first
, __last
,
2232 __glibcxx_requires_partitioned_upper_pred(__first
, __last
,
2235 return std::__equal_range(__first
, __last
, __val
,
2236 __gnu_cxx::__ops::__iter_comp_val(__comp
),
2237 __gnu_cxx::__ops::__val_comp_iter(__comp
));
2241 * @brief Determines whether an element exists in a range.
2242 * @ingroup binary_search_algorithms
2243 * @param __first An iterator.
2244 * @param __last Another iterator.
2245 * @param __val The search term.
2246 * @return True if @p __val (or its equivalent) is in [@p
2247 * __first,@p __last ].
2249 * Note that this does not actually return an iterator to @p __val. For
2250 * that, use std::find or a container's specialized find member functions.
2252 template<typename _ForwardIterator
, typename _Tp
>
2254 binary_search(_ForwardIterator __first
, _ForwardIterator __last
,
2257 typedef typename iterator_traits
<_ForwardIterator
>::value_type
2260 // concept requirements
2261 __glibcxx_function_requires(_ForwardIteratorConcept
<_ForwardIterator
>)
2262 __glibcxx_function_requires(_LessThanOpConcept
<_Tp
, _ValueType
>)
2263 __glibcxx_requires_partitioned_lower(__first
, __last
, __val
);
2264 __glibcxx_requires_partitioned_upper(__first
, __last
, __val
);
2266 _ForwardIterator __i
2267 = std::__lower_bound(__first
, __last
, __val
,
2268 __gnu_cxx::__ops::__iter_less_val());
2269 return __i
!= __last
&& !(__val
< *__i
);
2273 * @brief Determines whether an element exists in a range.
2274 * @ingroup binary_search_algorithms
2275 * @param __first An iterator.
2276 * @param __last Another iterator.
2277 * @param __val The search term.
2278 * @param __comp A functor to use for comparisons.
2279 * @return True if @p __val (or its equivalent) is in @p [__first,__last].
2281 * Note that this does not actually return an iterator to @p __val. For
2282 * that, use std::find or a container's specialized find member functions.
2284 * The comparison function should have the same effects on ordering as
2285 * the function used for the initial sort.
2287 template<typename _ForwardIterator
, typename _Tp
, typename _Compare
>
2289 binary_search(_ForwardIterator __first
, _ForwardIterator __last
,
2290 const _Tp
& __val
, _Compare __comp
)
2292 typedef typename iterator_traits
<_ForwardIterator
>::value_type
2295 // concept requirements
2296 __glibcxx_function_requires(_ForwardIteratorConcept
<_ForwardIterator
>)
2297 __glibcxx_function_requires(_BinaryPredicateConcept
<_Compare
,
2299 __glibcxx_requires_partitioned_lower_pred(__first
, __last
,
2301 __glibcxx_requires_partitioned_upper_pred(__first
, __last
,
2304 _ForwardIterator __i
2305 = std::__lower_bound(__first
, __last
, __val
,
2306 __gnu_cxx::__ops::__iter_comp_val(__comp
));
2307 return __i
!= __last
&& !bool(__comp(__val
, *__i
));
2312 /// This is a helper function for the __merge_adaptive routines.
2313 template<typename _InputIterator1
, typename _InputIterator2
,
2314 typename _OutputIterator
, typename _Compare
>
2316 __move_merge_adaptive(_InputIterator1 __first1
, _InputIterator1 __last1
,
2317 _InputIterator2 __first2
, _InputIterator2 __last2
,
2318 _OutputIterator __result
, _Compare __comp
)
2320 while (__first1
!= __last1
&& __first2
!= __last2
)
2322 if (__comp(__first2
, __first1
))
2324 *__result
= _GLIBCXX_MOVE(*__first2
);
2329 *__result
= _GLIBCXX_MOVE(*__first1
);
2334 if (__first1
!= __last1
)
2335 _GLIBCXX_MOVE3(__first1
, __last1
, __result
);
2338 /// This is a helper function for the __merge_adaptive routines.
2339 template<typename _BidirectionalIterator1
, typename _BidirectionalIterator2
,
2340 typename _BidirectionalIterator3
, typename _Compare
>
2342 __move_merge_adaptive_backward(_BidirectionalIterator1 __first1
,
2343 _BidirectionalIterator1 __last1
,
2344 _BidirectionalIterator2 __first2
,
2345 _BidirectionalIterator2 __last2
,
2346 _BidirectionalIterator3 __result
,
2349 if (__first1
== __last1
)
2351 _GLIBCXX_MOVE_BACKWARD3(__first2
, __last2
, __result
);
2354 else if (__first2
== __last2
)
2361 if (__comp(__last2
, __last1
))
2363 *--__result
= _GLIBCXX_MOVE(*__last1
);
2364 if (__first1
== __last1
)
2366 _GLIBCXX_MOVE_BACKWARD3(__first2
, ++__last2
, __result
);
2373 *--__result
= _GLIBCXX_MOVE(*__last2
);
2374 if (__first2
== __last2
)
2381 /// This is a helper function for the merge routines.
2382 template<typename _BidirectionalIterator1
, typename _BidirectionalIterator2
,
2384 _BidirectionalIterator1
2385 __rotate_adaptive(_BidirectionalIterator1 __first
,
2386 _BidirectionalIterator1 __middle
,
2387 _BidirectionalIterator1 __last
,
2388 _Distance __len1
, _Distance __len2
,
2389 _BidirectionalIterator2 __buffer
,
2390 _Distance __buffer_size
)
2392 _BidirectionalIterator2 __buffer_end
;
2393 if (__len1
> __len2
&& __len2
<= __buffer_size
)
2397 __buffer_end
= _GLIBCXX_MOVE3(__middle
, __last
, __buffer
);
2398 _GLIBCXX_MOVE_BACKWARD3(__first
, __middle
, __last
);
2399 return _GLIBCXX_MOVE3(__buffer
, __buffer_end
, __first
);
2404 else if (__len1
<= __buffer_size
)
2408 __buffer_end
= _GLIBCXX_MOVE3(__first
, __middle
, __buffer
);
2409 _GLIBCXX_MOVE3(__middle
, __last
, __first
);
2410 return _GLIBCXX_MOVE_BACKWARD3(__buffer
, __buffer_end
, __last
);
2417 std::rotate(__first
, __middle
, __last
);
2418 std::advance(__first
, std::distance(__middle
, __last
));
2423 /// This is a helper function for the merge routines.
2424 template<typename _BidirectionalIterator
, typename _Distance
,
2425 typename _Pointer
, typename _Compare
>
2427 __merge_adaptive(_BidirectionalIterator __first
,
2428 _BidirectionalIterator __middle
,
2429 _BidirectionalIterator __last
,
2430 _Distance __len1
, _Distance __len2
,
2431 _Pointer __buffer
, _Distance __buffer_size
,
2434 if (__len1
<= __len2
&& __len1
<= __buffer_size
)
2436 _Pointer __buffer_end
= _GLIBCXX_MOVE3(__first
, __middle
, __buffer
);
2437 std::__move_merge_adaptive(__buffer
, __buffer_end
, __middle
, __last
,
2440 else if (__len2
<= __buffer_size
)
2442 _Pointer __buffer_end
= _GLIBCXX_MOVE3(__middle
, __last
, __buffer
);
2443 std::__move_merge_adaptive_backward(__first
, __middle
, __buffer
,
2444 __buffer_end
, __last
, __comp
);
2448 _BidirectionalIterator __first_cut
= __first
;
2449 _BidirectionalIterator __second_cut
= __middle
;
2450 _Distance __len11
= 0;
2451 _Distance __len22
= 0;
2452 if (__len1
> __len2
)
2454 __len11
= __len1
/ 2;
2455 std::advance(__first_cut
, __len11
);
2457 = std::__lower_bound(__middle
, __last
, *__first_cut
,
2458 __gnu_cxx::__ops::__iter_comp_val(__comp
));
2459 __len22
= std::distance(__middle
, __second_cut
);
2463 __len22
= __len2
/ 2;
2464 std::advance(__second_cut
, __len22
);
2466 = std::__upper_bound(__first
, __middle
, *__second_cut
,
2467 __gnu_cxx::__ops::__val_comp_iter(__comp
));
2468 __len11
= std::distance(__first
, __first_cut
);
2471 _BidirectionalIterator __new_middle
2472 = std::__rotate_adaptive(__first_cut
, __middle
, __second_cut
,
2473 __len1
- __len11
, __len22
, __buffer
,
2475 std::__merge_adaptive(__first
, __first_cut
, __new_middle
, __len11
,
2476 __len22
, __buffer
, __buffer_size
, __comp
);
2477 std::__merge_adaptive(__new_middle
, __second_cut
, __last
,
2479 __len2
- __len22
, __buffer
,
2480 __buffer_size
, __comp
);
2484 /// This is a helper function for the merge routines.
2485 template<typename _BidirectionalIterator
, typename _Distance
,
2488 __merge_without_buffer(_BidirectionalIterator __first
,
2489 _BidirectionalIterator __middle
,
2490 _BidirectionalIterator __last
,
2491 _Distance __len1
, _Distance __len2
,
2494 if (__len1
== 0 || __len2
== 0)
2497 if (__len1
+ __len2
== 2)
2499 if (__comp(__middle
, __first
))
2500 std::iter_swap(__first
, __middle
);
2504 _BidirectionalIterator __first_cut
= __first
;
2505 _BidirectionalIterator __second_cut
= __middle
;
2506 _Distance __len11
= 0;
2507 _Distance __len22
= 0;
2508 if (__len1
> __len2
)
2510 __len11
= __len1
/ 2;
2511 std::advance(__first_cut
, __len11
);
2513 = std::__lower_bound(__middle
, __last
, *__first_cut
,
2514 __gnu_cxx::__ops::__iter_comp_val(__comp
));
2515 __len22
= std::distance(__middle
, __second_cut
);
2519 __len22
= __len2
/ 2;
2520 std::advance(__second_cut
, __len22
);
2522 = std::__upper_bound(__first
, __middle
, *__second_cut
,
2523 __gnu_cxx::__ops::__val_comp_iter(__comp
));
2524 __len11
= std::distance(__first
, __first_cut
);
2527 std::rotate(__first_cut
, __middle
, __second_cut
);
2528 _BidirectionalIterator __new_middle
= __first_cut
;
2529 std::advance(__new_middle
, std::distance(__middle
, __second_cut
));
2530 std::__merge_without_buffer(__first
, __first_cut
, __new_middle
,
2531 __len11
, __len22
, __comp
);
2532 std::__merge_without_buffer(__new_middle
, __second_cut
, __last
,
2533 __len1
- __len11
, __len2
- __len22
, __comp
);
2536 template<typename _BidirectionalIterator
, typename _Compare
>
2538 __inplace_merge(_BidirectionalIterator __first
,
2539 _BidirectionalIterator __middle
,
2540 _BidirectionalIterator __last
,
2543 typedef typename iterator_traits
<_BidirectionalIterator
>::value_type
2545 typedef typename iterator_traits
<_BidirectionalIterator
>::difference_type
2548 if (__first
== __middle
|| __middle
== __last
)
2551 const _DistanceType __len1
= std::distance(__first
, __middle
);
2552 const _DistanceType __len2
= std::distance(__middle
, __last
);
2554 typedef _Temporary_buffer
<_BidirectionalIterator
, _ValueType
> _TmpBuf
;
2555 _TmpBuf
__buf(__first
, __last
);
2557 if (__buf
.begin() == 0)
2558 std::__merge_without_buffer
2559 (__first
, __middle
, __last
, __len1
, __len2
, __comp
);
2561 std::__merge_adaptive
2562 (__first
, __middle
, __last
, __len1
, __len2
, __buf
.begin(),
2563 _DistanceType(__buf
.size()), __comp
);
2567 * @brief Merges two sorted ranges in place.
2568 * @ingroup sorting_algorithms
2569 * @param __first An iterator.
2570 * @param __middle Another iterator.
2571 * @param __last Another iterator.
2574 * Merges two sorted and consecutive ranges, [__first,__middle) and
2575 * [__middle,__last), and puts the result in [__first,__last). The
2576 * output will be sorted. The sort is @e stable, that is, for
2577 * equivalent elements in the two ranges, elements from the first
2578 * range will always come before elements from the second.
2580 * If enough additional memory is available, this takes (__last-__first)-1
2581 * comparisons. Otherwise an NlogN algorithm is used, where N is
2582 * distance(__first,__last).
2584 template<typename _BidirectionalIterator
>
2586 inplace_merge(_BidirectionalIterator __first
,
2587 _BidirectionalIterator __middle
,
2588 _BidirectionalIterator __last
)
2590 // concept requirements
2591 __glibcxx_function_requires(_Mutable_BidirectionalIteratorConcept
<
2592 _BidirectionalIterator
>)
2593 __glibcxx_function_requires(_LessThanComparableConcept
<
2594 typename iterator_traits
<_BidirectionalIterator
>::value_type
>)
2595 __glibcxx_requires_sorted(__first
, __middle
);
2596 __glibcxx_requires_sorted(__middle
, __last
);
2598 std::__inplace_merge(__first
, __middle
, __last
,
2599 __gnu_cxx::__ops::__iter_less_iter());
2603 * @brief Merges two sorted ranges in place.
2604 * @ingroup sorting_algorithms
2605 * @param __first An iterator.
2606 * @param __middle Another iterator.
2607 * @param __last Another iterator.
2608 * @param __comp A functor to use for comparisons.
2611 * Merges two sorted and consecutive ranges, [__first,__middle) and
2612 * [middle,last), and puts the result in [__first,__last). The output will
2613 * be sorted. The sort is @e stable, that is, for equivalent
2614 * elements in the two ranges, elements from the first range will always
2615 * come before elements from the second.
2617 * If enough additional memory is available, this takes (__last-__first)-1
2618 * comparisons. Otherwise an NlogN algorithm is used, where N is
2619 * distance(__first,__last).
2621 * The comparison function should have the same effects on ordering as
2622 * the function used for the initial sort.
2624 template<typename _BidirectionalIterator
, typename _Compare
>
2626 inplace_merge(_BidirectionalIterator __first
,
2627 _BidirectionalIterator __middle
,
2628 _BidirectionalIterator __last
,
2631 // concept requirements
2632 __glibcxx_function_requires(_Mutable_BidirectionalIteratorConcept
<
2633 _BidirectionalIterator
>)
2634 __glibcxx_function_requires(_BinaryPredicateConcept
<_Compare
,
2635 typename iterator_traits
<_BidirectionalIterator
>::value_type
,
2636 typename iterator_traits
<_BidirectionalIterator
>::value_type
>)
2637 __glibcxx_requires_sorted_pred(__first
, __middle
, __comp
);
2638 __glibcxx_requires_sorted_pred(__middle
, __last
, __comp
);
2640 std::__inplace_merge(__first
, __middle
, __last
,
2641 __gnu_cxx::__ops::__iter_comp_iter(__comp
));
2645 /// This is a helper function for the __merge_sort_loop routines.
2646 template<typename _InputIterator
, typename _OutputIterator
,
2649 __move_merge(_InputIterator __first1
, _InputIterator __last1
,
2650 _InputIterator __first2
, _InputIterator __last2
,
2651 _OutputIterator __result
, _Compare __comp
)
2653 while (__first1
!= __last1
&& __first2
!= __last2
)
2655 if (__comp(__first2
, __first1
))
2657 *__result
= _GLIBCXX_MOVE(*__first2
);
2662 *__result
= _GLIBCXX_MOVE(*__first1
);
2667 return _GLIBCXX_MOVE3(__first2
, __last2
,
2668 _GLIBCXX_MOVE3(__first1
, __last1
,
2672 template<typename _RandomAccessIterator1
, typename _RandomAccessIterator2
,
2673 typename _Distance
, typename _Compare
>
2675 __merge_sort_loop(_RandomAccessIterator1 __first
,
2676 _RandomAccessIterator1 __last
,
2677 _RandomAccessIterator2 __result
, _Distance __step_size
,
2680 const _Distance __two_step
= 2 * __step_size
;
2682 while (__last
- __first
>= __two_step
)
2684 __result
= std::__move_merge(__first
, __first
+ __step_size
,
2685 __first
+ __step_size
,
2686 __first
+ __two_step
,
2688 __first
+= __two_step
;
2690 __step_size
= std::min(_Distance(__last
- __first
), __step_size
);
2692 std::__move_merge(__first
, __first
+ __step_size
,
2693 __first
+ __step_size
, __last
, __result
, __comp
);
2696 template<typename _RandomAccessIterator
, typename _Distance
,
2699 __chunk_insertion_sort(_RandomAccessIterator __first
,
2700 _RandomAccessIterator __last
,
2701 _Distance __chunk_size
, _Compare __comp
)
2703 while (__last
- __first
>= __chunk_size
)
2705 std::__insertion_sort(__first
, __first
+ __chunk_size
, __comp
);
2706 __first
+= __chunk_size
;
2708 std::__insertion_sort(__first
, __last
, __comp
);
2711 enum { _S_chunk_size
= 7 };
2713 template<typename _RandomAccessIterator
, typename _Pointer
, typename _Compare
>
2715 __merge_sort_with_buffer(_RandomAccessIterator __first
,
2716 _RandomAccessIterator __last
,
2717 _Pointer __buffer
, _Compare __comp
)
2719 typedef typename iterator_traits
<_RandomAccessIterator
>::difference_type
2722 const _Distance __len
= __last
- __first
;
2723 const _Pointer __buffer_last
= __buffer
+ __len
;
2725 _Distance __step_size
= _S_chunk_size
;
2726 std::__chunk_insertion_sort(__first
, __last
, __step_size
, __comp
);
2728 while (__step_size
< __len
)
2730 std::__merge_sort_loop(__first
, __last
, __buffer
,
2731 __step_size
, __comp
);
2733 std::__merge_sort_loop(__buffer
, __buffer_last
, __first
,
2734 __step_size
, __comp
);
2739 template<typename _RandomAccessIterator
, typename _Pointer
,
2740 typename _Distance
, typename _Compare
>
2742 __stable_sort_adaptive(_RandomAccessIterator __first
,
2743 _RandomAccessIterator __last
,
2744 _Pointer __buffer
, _Distance __buffer_size
,
2747 const _Distance __len
= (__last
- __first
+ 1) / 2;
2748 const _RandomAccessIterator __middle
= __first
+ __len
;
2749 if (__len
> __buffer_size
)
2751 std::__stable_sort_adaptive(__first
, __middle
, __buffer
,
2752 __buffer_size
, __comp
);
2753 std::__stable_sort_adaptive(__middle
, __last
, __buffer
,
2754 __buffer_size
, __comp
);
2758 std::__merge_sort_with_buffer(__first
, __middle
, __buffer
, __comp
);
2759 std::__merge_sort_with_buffer(__middle
, __last
, __buffer
, __comp
);
2761 std::__merge_adaptive(__first
, __middle
, __last
,
2762 _Distance(__middle
- __first
),
2763 _Distance(__last
- __middle
),
2764 __buffer
, __buffer_size
,
2768 /// This is a helper function for the stable sorting routines.
2769 template<typename _RandomAccessIterator
, typename _Compare
>
2771 __inplace_stable_sort(_RandomAccessIterator __first
,
2772 _RandomAccessIterator __last
, _Compare __comp
)
2774 if (__last
- __first
< 15)
2776 std::__insertion_sort(__first
, __last
, __comp
);
2779 _RandomAccessIterator __middle
= __first
+ (__last
- __first
) / 2;
2780 std::__inplace_stable_sort(__first
, __middle
, __comp
);
2781 std::__inplace_stable_sort(__middle
, __last
, __comp
);
2782 std::__merge_without_buffer(__first
, __middle
, __last
,
2790 // Set algorithms: includes, set_union, set_intersection, set_difference,
2791 // set_symmetric_difference. All of these algorithms have the precondition
2792 // that their input ranges are sorted and the postcondition that their output
2793 // ranges are sorted.
2795 template<typename _InputIterator1
, typename _InputIterator2
,
2798 __includes(_InputIterator1 __first1
, _InputIterator1 __last1
,
2799 _InputIterator2 __first2
, _InputIterator2 __last2
,
2802 while (__first1
!= __last1
&& __first2
!= __last2
)
2803 if (__comp(__first2
, __first1
))
2805 else if (__comp(__first1
, __first2
))
2808 ++__first1
, ++__first2
;
2810 return __first2
== __last2
;
2814 * @brief Determines whether all elements of a sequence exists in a range.
2815 * @param __first1 Start of search range.
2816 * @param __last1 End of search range.
2817 * @param __first2 Start of sequence
2818 * @param __last2 End of sequence.
2819 * @return True if each element in [__first2,__last2) is contained in order
2820 * within [__first1,__last1). False otherwise.
2821 * @ingroup set_algorithms
2823 * This operation expects both [__first1,__last1) and
2824 * [__first2,__last2) to be sorted. Searches for the presence of
2825 * each element in [__first2,__last2) within [__first1,__last1).
2826 * The iterators over each range only move forward, so this is a
2827 * linear algorithm. If an element in [__first2,__last2) is not
2828 * found before the search iterator reaches @p __last2, false is
2831 template<typename _InputIterator1
, typename _InputIterator2
>
2833 includes(_InputIterator1 __first1
, _InputIterator1 __last1
,
2834 _InputIterator2 __first2
, _InputIterator2 __last2
)
2836 // concept requirements
2837 __glibcxx_function_requires(_InputIteratorConcept
<_InputIterator1
>)
2838 __glibcxx_function_requires(_InputIteratorConcept
<_InputIterator2
>)
2839 __glibcxx_function_requires(_LessThanOpConcept
<
2840 typename iterator_traits
<_InputIterator1
>::value_type
,
2841 typename iterator_traits
<_InputIterator2
>::value_type
>)
2842 __glibcxx_function_requires(_LessThanOpConcept
<
2843 typename iterator_traits
<_InputIterator2
>::value_type
,
2844 typename iterator_traits
<_InputIterator1
>::value_type
>)
2845 __glibcxx_requires_sorted_set(__first1
, __last1
, __first2
);
2846 __glibcxx_requires_sorted_set(__first2
, __last2
, __first1
);
2848 return std::__includes(__first1
, __last1
, __first2
, __last2
,
2849 __gnu_cxx::__ops::__iter_less_iter());
2853 * @brief Determines whether all elements of a sequence exists in a range
2855 * @ingroup set_algorithms
2856 * @param __first1 Start of search range.
2857 * @param __last1 End of search range.
2858 * @param __first2 Start of sequence
2859 * @param __last2 End of sequence.
2860 * @param __comp Comparison function to use.
2861 * @return True if each element in [__first2,__last2) is contained
2862 * in order within [__first1,__last1) according to comp. False
2863 * otherwise. @ingroup set_algorithms
2865 * This operation expects both [__first1,__last1) and
2866 * [__first2,__last2) to be sorted. Searches for the presence of
2867 * each element in [__first2,__last2) within [__first1,__last1),
2868 * using comp to decide. The iterators over each range only move
2869 * forward, so this is a linear algorithm. If an element in
2870 * [__first2,__last2) is not found before the search iterator
2871 * reaches @p __last2, false is returned.
2873 template<typename _InputIterator1
, typename _InputIterator2
,
2876 includes(_InputIterator1 __first1
, _InputIterator1 __last1
,
2877 _InputIterator2 __first2
, _InputIterator2 __last2
,
2880 // concept requirements
2881 __glibcxx_function_requires(_InputIteratorConcept
<_InputIterator1
>)
2882 __glibcxx_function_requires(_InputIteratorConcept
<_InputIterator2
>)
2883 __glibcxx_function_requires(_BinaryPredicateConcept
<_Compare
,
2884 typename iterator_traits
<_InputIterator1
>::value_type
,
2885 typename iterator_traits
<_InputIterator2
>::value_type
>)
2886 __glibcxx_function_requires(_BinaryPredicateConcept
<_Compare
,
2887 typename iterator_traits
<_InputIterator2
>::value_type
,
2888 typename iterator_traits
<_InputIterator1
>::value_type
>)
2889 __glibcxx_requires_sorted_set_pred(__first1
, __last1
, __first2
, __comp
);
2890 __glibcxx_requires_sorted_set_pred(__first2
, __last2
, __first1
, __comp
);
2892 return std::__includes(__first1
, __last1
, __first2
, __last2
,
2893 __gnu_cxx::__ops::__iter_comp_iter(__comp
));
2902 // set_symmetric_difference
2906 template<typename _BidirectionalIterator
, typename _Compare
>
2908 __next_permutation(_BidirectionalIterator __first
,
2909 _BidirectionalIterator __last
, _Compare __comp
)
2911 if (__first
== __last
)
2913 _BidirectionalIterator __i
= __first
;
2922 _BidirectionalIterator __ii
= __i
;
2924 if (__comp(__i
, __ii
))
2926 _BidirectionalIterator __j
= __last
;
2927 while (!__comp(__i
, --__j
))
2929 std::iter_swap(__i
, __j
);
2930 std::__reverse(__ii
, __last
,
2931 std::__iterator_category(__first
));
2936 std::__reverse(__first
, __last
,
2937 std::__iterator_category(__first
));
2944 * @brief Permute range into the next @e dictionary ordering.
2945 * @ingroup sorting_algorithms
2946 * @param __first Start of range.
2947 * @param __last End of range.
2948 * @return False if wrapped to first permutation, true otherwise.
2950 * Treats all permutations of the range as a set of @e dictionary sorted
2951 * sequences. Permutes the current sequence into the next one of this set.
2952 * Returns true if there are more sequences to generate. If the sequence
2953 * is the largest of the set, the smallest is generated and false returned.
2955 template<typename _BidirectionalIterator
>
2957 next_permutation(_BidirectionalIterator __first
,
2958 _BidirectionalIterator __last
)
2960 // concept requirements
2961 __glibcxx_function_requires(_BidirectionalIteratorConcept
<
2962 _BidirectionalIterator
>)
2963 __glibcxx_function_requires(_LessThanComparableConcept
<
2964 typename iterator_traits
<_BidirectionalIterator
>::value_type
>)
2965 __glibcxx_requires_valid_range(__first
, __last
);
2967 return std::__next_permutation
2968 (__first
, __last
, __gnu_cxx::__ops::__iter_less_iter());
2972 * @brief Permute range into the next @e dictionary ordering using
2973 * comparison functor.
2974 * @ingroup sorting_algorithms
2975 * @param __first Start of range.
2976 * @param __last End of range.
2977 * @param __comp A comparison functor.
2978 * @return False if wrapped to first permutation, true otherwise.
2980 * Treats all permutations of the range [__first,__last) as a set of
2981 * @e dictionary sorted sequences ordered by @p __comp. Permutes the current
2982 * sequence into the next one of this set. Returns true if there are more
2983 * sequences to generate. If the sequence is the largest of the set, the
2984 * smallest is generated and false returned.
2986 template<typename _BidirectionalIterator
, typename _Compare
>
2988 next_permutation(_BidirectionalIterator __first
,
2989 _BidirectionalIterator __last
, _Compare __comp
)
2991 // concept requirements
2992 __glibcxx_function_requires(_BidirectionalIteratorConcept
<
2993 _BidirectionalIterator
>)
2994 __glibcxx_function_requires(_BinaryPredicateConcept
<_Compare
,
2995 typename iterator_traits
<_BidirectionalIterator
>::value_type
,
2996 typename iterator_traits
<_BidirectionalIterator
>::value_type
>)
2997 __glibcxx_requires_valid_range(__first
, __last
);
2999 return std::__next_permutation
3000 (__first
, __last
, __gnu_cxx::__ops::__iter_comp_iter(__comp
));
3003 template<typename _BidirectionalIterator
, typename _Compare
>
3005 __prev_permutation(_BidirectionalIterator __first
,
3006 _BidirectionalIterator __last
, _Compare __comp
)
3008 if (__first
== __last
)
3010 _BidirectionalIterator __i
= __first
;
3019 _BidirectionalIterator __ii
= __i
;
3021 if (__comp(__ii
, __i
))
3023 _BidirectionalIterator __j
= __last
;
3024 while (!__comp(--__j
, __i
))
3026 std::iter_swap(__i
, __j
);
3027 std::__reverse(__ii
, __last
,
3028 std::__iterator_category(__first
));
3033 std::__reverse(__first
, __last
,
3034 std::__iterator_category(__first
));
3041 * @brief Permute range into the previous @e dictionary ordering.
3042 * @ingroup sorting_algorithms
3043 * @param __first Start of range.
3044 * @param __last End of range.
3045 * @return False if wrapped to last permutation, true otherwise.
3047 * Treats all permutations of the range as a set of @e dictionary sorted
3048 * sequences. Permutes the current sequence into the previous one of this
3049 * set. Returns true if there are more sequences to generate. If the
3050 * sequence is the smallest of the set, the largest is generated and false
3053 template<typename _BidirectionalIterator
>
3055 prev_permutation(_BidirectionalIterator __first
,
3056 _BidirectionalIterator __last
)
3058 // concept requirements
3059 __glibcxx_function_requires(_BidirectionalIteratorConcept
<
3060 _BidirectionalIterator
>)
3061 __glibcxx_function_requires(_LessThanComparableConcept
<
3062 typename iterator_traits
<_BidirectionalIterator
>::value_type
>)
3063 __glibcxx_requires_valid_range(__first
, __last
);
3065 return std::__prev_permutation(__first
, __last
,
3066 __gnu_cxx::__ops::__iter_less_iter());
3070 * @brief Permute range into the previous @e dictionary ordering using
3071 * comparison functor.
3072 * @ingroup sorting_algorithms
3073 * @param __first Start of range.
3074 * @param __last End of range.
3075 * @param __comp A comparison functor.
3076 * @return False if wrapped to last permutation, true otherwise.
3078 * Treats all permutations of the range [__first,__last) as a set of
3079 * @e dictionary sorted sequences ordered by @p __comp. Permutes the current
3080 * sequence into the previous one of this set. Returns true if there are
3081 * more sequences to generate. If the sequence is the smallest of the set,
3082 * the largest is generated and false returned.
3084 template<typename _BidirectionalIterator
, typename _Compare
>
3086 prev_permutation(_BidirectionalIterator __first
,
3087 _BidirectionalIterator __last
, _Compare __comp
)
3089 // concept requirements
3090 __glibcxx_function_requires(_BidirectionalIteratorConcept
<
3091 _BidirectionalIterator
>)
3092 __glibcxx_function_requires(_BinaryPredicateConcept
<_Compare
,
3093 typename iterator_traits
<_BidirectionalIterator
>::value_type
,
3094 typename iterator_traits
<_BidirectionalIterator
>::value_type
>)
3095 __glibcxx_requires_valid_range(__first
, __last
);
3097 return std::__prev_permutation(__first
, __last
,
3098 __gnu_cxx::__ops::__iter_comp_iter(__comp
));
3104 template<typename _InputIterator
, typename _OutputIterator
,
3105 typename _Predicate
, typename _Tp
>
3107 __replace_copy_if(_InputIterator __first
, _InputIterator __last
,
3108 _OutputIterator __result
,
3109 _Predicate __pred
, const _Tp
& __new_value
)
3111 for (; __first
!= __last
; ++__first
, ++__result
)
3112 if (__pred(__first
))
3113 *__result
= __new_value
;
3115 *__result
= *__first
;
3120 * @brief Copy a sequence, replacing each element of one value with another
3122 * @param __first An input iterator.
3123 * @param __last An input iterator.
3124 * @param __result An output iterator.
3125 * @param __old_value The value to be replaced.
3126 * @param __new_value The replacement value.
3127 * @return The end of the output sequence, @p result+(last-first).
3129 * Copies each element in the input range @p [__first,__last) to the
3130 * output range @p [__result,__result+(__last-__first)) replacing elements
3131 * equal to @p __old_value with @p __new_value.
3133 template<typename _InputIterator
, typename _OutputIterator
, typename _Tp
>
3134 inline _OutputIterator
3135 replace_copy(_InputIterator __first
, _InputIterator __last
,
3136 _OutputIterator __result
,
3137 const _Tp
& __old_value
, const _Tp
& __new_value
)
3139 // concept requirements
3140 __glibcxx_function_requires(_InputIteratorConcept
<_InputIterator
>)
3141 __glibcxx_function_requires(_OutputIteratorConcept
<_OutputIterator
,
3142 typename iterator_traits
<_InputIterator
>::value_type
>)
3143 __glibcxx_function_requires(_EqualOpConcept
<
3144 typename iterator_traits
<_InputIterator
>::value_type
, _Tp
>)
3145 __glibcxx_requires_valid_range(__first
, __last
);
3147 return std::__replace_copy_if(__first
, __last
, __result
,
3148 __gnu_cxx::__ops::__iter_equals_val(__old_value
),
3153 * @brief Copy a sequence, replacing each value for which a predicate
3154 * returns true with another value.
3155 * @ingroup mutating_algorithms
3156 * @param __first An input iterator.
3157 * @param __last An input iterator.
3158 * @param __result An output iterator.
3159 * @param __pred A predicate.
3160 * @param __new_value The replacement value.
3161 * @return The end of the output sequence, @p __result+(__last-__first).
3163 * Copies each element in the range @p [__first,__last) to the range
3164 * @p [__result,__result+(__last-__first)) replacing elements for which
3165 * @p __pred returns true with @p __new_value.
3167 template<typename _InputIterator
, typename _OutputIterator
,
3168 typename _Predicate
, typename _Tp
>
3169 inline _OutputIterator
3170 replace_copy_if(_InputIterator __first
, _InputIterator __last
,
3171 _OutputIterator __result
,
3172 _Predicate __pred
, const _Tp
& __new_value
)
3174 // concept requirements
3175 __glibcxx_function_requires(_InputIteratorConcept
<_InputIterator
>)
3176 __glibcxx_function_requires(_OutputIteratorConcept
<_OutputIterator
,
3177 typename iterator_traits
<_InputIterator
>::value_type
>)
3178 __glibcxx_function_requires(_UnaryPredicateConcept
<_Predicate
,
3179 typename iterator_traits
<_InputIterator
>::value_type
>)
3180 __glibcxx_requires_valid_range(__first
, __last
);
3182 return std::__replace_copy_if(__first
, __last
, __result
,
3183 __gnu_cxx::__ops::__pred_iter(__pred
),
3187 template<typename _InputIterator
, typename _Predicate
>
3188 typename iterator_traits
<_InputIterator
>::difference_type
3189 __count_if(_InputIterator __first
, _InputIterator __last
, _Predicate __pred
)
3191 typename iterator_traits
<_InputIterator
>::difference_type __n
= 0;
3192 for (; __first
!= __last
; ++__first
)
3193 if (__pred(__first
))
3198 #if __cplusplus >= 201103L
3200 * @brief Determines whether the elements of a sequence are sorted.
3201 * @ingroup sorting_algorithms
3202 * @param __first An iterator.
3203 * @param __last Another iterator.
3204 * @return True if the elements are sorted, false otherwise.
3206 template<typename _ForwardIterator
>
3208 is_sorted(_ForwardIterator __first
, _ForwardIterator __last
)
3209 { return std::is_sorted_until(__first
, __last
) == __last
; }
3212 * @brief Determines whether the elements of a sequence are sorted
3213 * according to a comparison functor.
3214 * @ingroup sorting_algorithms
3215 * @param __first An iterator.
3216 * @param __last Another iterator.
3217 * @param __comp A comparison functor.
3218 * @return True if the elements are sorted, false otherwise.
3220 template<typename _ForwardIterator
, typename _Compare
>
3222 is_sorted(_ForwardIterator __first
, _ForwardIterator __last
,
3224 { return std::is_sorted_until(__first
, __last
, __comp
) == __last
; }
3226 template<typename _ForwardIterator
, typename _Compare
>
3228 __is_sorted_until(_ForwardIterator __first
, _ForwardIterator __last
,
3231 if (__first
== __last
)
3234 _ForwardIterator __next
= __first
;
3235 for (++__next
; __next
!= __last
; __first
= __next
, ++__next
)
3236 if (__comp(__next
, __first
))
3242 * @brief Determines the end of a sorted sequence.
3243 * @ingroup sorting_algorithms
3244 * @param __first An iterator.
3245 * @param __last Another iterator.
3246 * @return An iterator pointing to the last iterator i in [__first, __last)
3247 * for which the range [__first, i) is sorted.
3249 template<typename _ForwardIterator
>
3250 inline _ForwardIterator
3251 is_sorted_until(_ForwardIterator __first
, _ForwardIterator __last
)
3253 // concept requirements
3254 __glibcxx_function_requires(_ForwardIteratorConcept
<_ForwardIterator
>)
3255 __glibcxx_function_requires(_LessThanComparableConcept
<
3256 typename iterator_traits
<_ForwardIterator
>::value_type
>)
3257 __glibcxx_requires_valid_range(__first
, __last
);
3259 return std::__is_sorted_until(__first
, __last
,
3260 __gnu_cxx::__ops::__iter_less_iter());
3264 * @brief Determines the end of a sorted sequence using comparison functor.
3265 * @ingroup sorting_algorithms
3266 * @param __first An iterator.
3267 * @param __last Another iterator.
3268 * @param __comp A comparison functor.
3269 * @return An iterator pointing to the last iterator i in [__first, __last)
3270 * for which the range [__first, i) is sorted.
3272 template<typename _ForwardIterator
, typename _Compare
>
3273 inline _ForwardIterator
3274 is_sorted_until(_ForwardIterator __first
, _ForwardIterator __last
,
3277 // concept requirements
3278 __glibcxx_function_requires(_ForwardIteratorConcept
<_ForwardIterator
>)
3279 __glibcxx_function_requires(_BinaryPredicateConcept
<_Compare
,
3280 typename iterator_traits
<_ForwardIterator
>::value_type
,
3281 typename iterator_traits
<_ForwardIterator
>::value_type
>)
3282 __glibcxx_requires_valid_range(__first
, __last
);
3284 return std::__is_sorted_until(__first
, __last
,
3285 __gnu_cxx::__ops::__iter_comp_iter(__comp
));
3289 * @brief Determines min and max at once as an ordered pair.
3290 * @ingroup sorting_algorithms
3291 * @param __a A thing of arbitrary type.
3292 * @param __b Another thing of arbitrary type.
3293 * @return A pair(__b, __a) if __b is smaller than __a, pair(__a,
3296 template<typename _Tp
>
3297 _GLIBCXX14_CONSTEXPR
3298 inline pair
<const _Tp
&, const _Tp
&>
3299 minmax(const _Tp
& __a
, const _Tp
& __b
)
3301 // concept requirements
3302 __glibcxx_function_requires(_LessThanComparableConcept
<_Tp
>)
3304 return __b
< __a
? pair
<const _Tp
&, const _Tp
&>(__b
, __a
)
3305 : pair
<const _Tp
&, const _Tp
&>(__a
, __b
);
3309 * @brief Determines min and max at once as an ordered pair.
3310 * @ingroup sorting_algorithms
3311 * @param __a A thing of arbitrary type.
3312 * @param __b Another thing of arbitrary type.
3313 * @param __comp A @link comparison_functors comparison functor @endlink.
3314 * @return A pair(__b, __a) if __b is smaller than __a, pair(__a,
3317 template<typename _Tp
, typename _Compare
>
3318 _GLIBCXX14_CONSTEXPR
3319 inline pair
<const _Tp
&, const _Tp
&>
3320 minmax(const _Tp
& __a
, const _Tp
& __b
, _Compare __comp
)
3322 return __comp(__b
, __a
) ? pair
<const _Tp
&, const _Tp
&>(__b
, __a
)
3323 : pair
<const _Tp
&, const _Tp
&>(__a
, __b
);
3326 template<typename _ForwardIterator
, typename _Compare
>
3327 _GLIBCXX14_CONSTEXPR
3328 pair
<_ForwardIterator
, _ForwardIterator
>
3329 __minmax_element(_ForwardIterator __first
, _ForwardIterator __last
,
3332 _ForwardIterator __next
= __first
;
3333 if (__first
== __last
3334 || ++__next
== __last
)
3335 return std::make_pair(__first
, __first
);
3337 _ForwardIterator __min
{}, __max
{};
3338 if (__comp(__next
, __first
))
3352 while (__first
!= __last
)
3355 if (++__next
== __last
)
3357 if (__comp(__first
, __min
))
3359 else if (!__comp(__first
, __max
))
3364 if (__comp(__next
, __first
))
3366 if (__comp(__next
, __min
))
3368 if (!__comp(__first
, __max
))
3373 if (__comp(__first
, __min
))
3375 if (!__comp(__next
, __max
))
3383 return std::make_pair(__min
, __max
);
3387 * @brief Return a pair of iterators pointing to the minimum and maximum
3388 * elements in a range.
3389 * @ingroup sorting_algorithms
3390 * @param __first Start of range.
3391 * @param __last End of range.
3392 * @return make_pair(m, M), where m is the first iterator i in
3393 * [__first, __last) such that no other element in the range is
3394 * smaller, and where M is the last iterator i in [__first, __last)
3395 * such that no other element in the range is larger.
3397 template<typename _ForwardIterator
>
3398 _GLIBCXX14_CONSTEXPR
3399 inline pair
<_ForwardIterator
, _ForwardIterator
>
3400 minmax_element(_ForwardIterator __first
, _ForwardIterator __last
)
3402 // concept requirements
3403 __glibcxx_function_requires(_ForwardIteratorConcept
<_ForwardIterator
>)
3404 __glibcxx_function_requires(_LessThanComparableConcept
<
3405 typename iterator_traits
<_ForwardIterator
>::value_type
>)
3406 __glibcxx_requires_valid_range(__first
, __last
);
3408 return std::__minmax_element(__first
, __last
,
3409 __gnu_cxx::__ops::__iter_less_iter());
3413 * @brief Return a pair of iterators pointing to the minimum and maximum
3414 * elements in a range.
3415 * @ingroup sorting_algorithms
3416 * @param __first Start of range.
3417 * @param __last End of range.
3418 * @param __comp Comparison functor.
3419 * @return make_pair(m, M), where m is the first iterator i in
3420 * [__first, __last) such that no other element in the range is
3421 * smaller, and where M is the last iterator i in [__first, __last)
3422 * such that no other element in the range is larger.
3424 template<typename _ForwardIterator
, typename _Compare
>
3425 _GLIBCXX14_CONSTEXPR
3426 inline pair
<_ForwardIterator
, _ForwardIterator
>
3427 minmax_element(_ForwardIterator __first
, _ForwardIterator __last
,
3430 // concept requirements
3431 __glibcxx_function_requires(_ForwardIteratorConcept
<_ForwardIterator
>)
3432 __glibcxx_function_requires(_BinaryPredicateConcept
<_Compare
,
3433 typename iterator_traits
<_ForwardIterator
>::value_type
,
3434 typename iterator_traits
<_ForwardIterator
>::value_type
>)
3435 __glibcxx_requires_valid_range(__first
, __last
);
3437 return std::__minmax_element(__first
, __last
,
3438 __gnu_cxx::__ops::__iter_comp_iter(__comp
));
3442 template<typename _Tp
>
3443 _GLIBCXX14_CONSTEXPR
3445 min(initializer_list
<_Tp
> __l
)
3446 { return *std::min_element(__l
.begin(), __l
.end()); }
3448 template<typename _Tp
, typename _Compare
>
3449 _GLIBCXX14_CONSTEXPR
3451 min(initializer_list
<_Tp
> __l
, _Compare __comp
)
3452 { return *std::min_element(__l
.begin(), __l
.end(), __comp
); }
3454 template<typename _Tp
>
3455 _GLIBCXX14_CONSTEXPR
3457 max(initializer_list
<_Tp
> __l
)
3458 { return *std::max_element(__l
.begin(), __l
.end()); }
3460 template<typename _Tp
, typename _Compare
>
3461 _GLIBCXX14_CONSTEXPR
3463 max(initializer_list
<_Tp
> __l
, _Compare __comp
)
3464 { return *std::max_element(__l
.begin(), __l
.end(), __comp
); }
3466 template<typename _Tp
>
3467 _GLIBCXX14_CONSTEXPR
3468 inline pair
<_Tp
, _Tp
>
3469 minmax(initializer_list
<_Tp
> __l
)
3471 pair
<const _Tp
*, const _Tp
*> __p
=
3472 std::minmax_element(__l
.begin(), __l
.end());
3473 return std::make_pair(*__p
.first
, *__p
.second
);
3476 template<typename _Tp
, typename _Compare
>
3477 _GLIBCXX14_CONSTEXPR
3478 inline pair
<_Tp
, _Tp
>
3479 minmax(initializer_list
<_Tp
> __l
, _Compare __comp
)
3481 pair
<const _Tp
*, const _Tp
*> __p
=
3482 std::minmax_element(__l
.begin(), __l
.end(), __comp
);
3483 return std::make_pair(*__p
.first
, *__p
.second
);
3486 template<typename _ForwardIterator1
, typename _ForwardIterator2
,
3487 typename _BinaryPredicate
>
3489 __is_permutation(_ForwardIterator1 __first1
, _ForwardIterator1 __last1
,
3490 _ForwardIterator2 __first2
, _BinaryPredicate __pred
)
3492 // Efficiently compare identical prefixes: O(N) if sequences
3493 // have the same elements in the same order.
3494 for (; __first1
!= __last1
; ++__first1
, ++__first2
)
3495 if (!__pred(__first1
, __first2
))
3498 if (__first1
== __last1
)
3501 // Establish __last2 assuming equal ranges by iterating over the
3502 // rest of the list.
3503 _ForwardIterator2 __last2
= __first2
;
3504 std::advance(__last2
, std::distance(__first1
, __last1
));
3505 for (_ForwardIterator1 __scan
= __first1
; __scan
!= __last1
; ++__scan
)
3507 if (__scan
!= std::__find_if(__first1
, __scan
,
3508 __gnu_cxx::__ops::__iter_comp_iter(__pred
, __scan
)))
3509 continue; // We've seen this one before.
3512 = std::__count_if(__first2
, __last2
,
3513 __gnu_cxx::__ops::__iter_comp_iter(__pred
, __scan
));
3514 if (0 == __matches
||
3515 std::__count_if(__scan
, __last1
,
3516 __gnu_cxx::__ops::__iter_comp_iter(__pred
, __scan
))
3524 * @brief Checks whether a permutation of the second sequence is equal
3525 * to the first sequence.
3526 * @ingroup non_mutating_algorithms
3527 * @param __first1 Start of first range.
3528 * @param __last1 End of first range.
3529 * @param __first2 Start of second range.
3530 * @return true if there exists a permutation of the elements in the range
3531 * [__first2, __first2 + (__last1 - __first1)), beginning with
3532 * ForwardIterator2 begin, such that equal(__first1, __last1, begin)
3533 * returns true; otherwise, returns false.
3535 template<typename _ForwardIterator1
, typename _ForwardIterator2
>
3537 is_permutation(_ForwardIterator1 __first1
, _ForwardIterator1 __last1
,
3538 _ForwardIterator2 __first2
)
3540 // concept requirements
3541 __glibcxx_function_requires(_ForwardIteratorConcept
<_ForwardIterator1
>)
3542 __glibcxx_function_requires(_ForwardIteratorConcept
<_ForwardIterator2
>)
3543 __glibcxx_function_requires(_EqualOpConcept
<
3544 typename iterator_traits
<_ForwardIterator1
>::value_type
,
3545 typename iterator_traits
<_ForwardIterator2
>::value_type
>)
3546 __glibcxx_requires_valid_range(__first1
, __last1
);
3548 return std::__is_permutation(__first1
, __last1
, __first2
,
3549 __gnu_cxx::__ops::__iter_equal_to_iter());
3553 * @brief Checks whether a permutation of the second sequence is equal
3554 * to the first sequence.
3555 * @ingroup non_mutating_algorithms
3556 * @param __first1 Start of first range.
3557 * @param __last1 End of first range.
3558 * @param __first2 Start of second range.
3559 * @param __pred A binary predicate.
3560 * @return true if there exists a permutation of the elements in
3561 * the range [__first2, __first2 + (__last1 - __first1)),
3562 * beginning with ForwardIterator2 begin, such that
3563 * equal(__first1, __last1, __begin, __pred) returns true;
3564 * otherwise, returns false.
3566 template<typename _ForwardIterator1
, typename _ForwardIterator2
,
3567 typename _BinaryPredicate
>
3569 is_permutation(_ForwardIterator1 __first1
, _ForwardIterator1 __last1
,
3570 _ForwardIterator2 __first2
, _BinaryPredicate __pred
)
3572 // concept requirements
3573 __glibcxx_function_requires(_ForwardIteratorConcept
<_ForwardIterator1
>)
3574 __glibcxx_function_requires(_ForwardIteratorConcept
<_ForwardIterator2
>)
3575 __glibcxx_function_requires(_BinaryPredicateConcept
<_BinaryPredicate
,
3576 typename iterator_traits
<_ForwardIterator1
>::value_type
,
3577 typename iterator_traits
<_ForwardIterator2
>::value_type
>)
3578 __glibcxx_requires_valid_range(__first1
, __last1
);
3580 return std::__is_permutation(__first1
, __last1
, __first2
,
3581 __gnu_cxx::__ops::__iter_comp_iter(__pred
));
3584 #if __cplusplus > 201103L
3585 template<typename _ForwardIterator1
, typename _ForwardIterator2
,
3586 typename _BinaryPredicate
>
3588 __is_permutation(_ForwardIterator1 __first1
, _ForwardIterator1 __last1
,
3589 _ForwardIterator2 __first2
, _ForwardIterator2 __last2
,
3590 _BinaryPredicate __pred
)
3593 = typename iterator_traits
<_ForwardIterator1
>::iterator_category
;
3595 = typename iterator_traits
<_ForwardIterator2
>::iterator_category
;
3596 using _It1_is_RA
= is_same
<_Cat1
, random_access_iterator_tag
>;
3597 using _It2_is_RA
= is_same
<_Cat2
, random_access_iterator_tag
>;
3598 constexpr bool __ra_iters
= _It1_is_RA() && _It2_is_RA();
3601 auto __d1
= std::distance(__first1
, __last1
);
3602 auto __d2
= std::distance(__first2
, __last2
);
3607 // Efficiently compare identical prefixes: O(N) if sequences
3608 // have the same elements in the same order.
3609 for (; __first1
!= __last1
&& __first2
!= __last2
;
3610 ++__first1
, ++__first2
)
3611 if (!__pred(__first1
, __first2
))
3616 if (__first1
== __last1
)
3621 auto __d1
= std::distance(__first1
, __last1
);
3622 auto __d2
= std::distance(__first2
, __last2
);
3623 if (__d1
== 0 && __d2
== 0)
3629 for (_ForwardIterator1 __scan
= __first1
; __scan
!= __last1
; ++__scan
)
3631 if (__scan
!= std::__find_if(__first1
, __scan
,
3632 __gnu_cxx::__ops::__iter_comp_iter(__pred
, __scan
)))
3633 continue; // We've seen this one before.
3635 auto __matches
= std::__count_if(__first2
, __last2
,
3636 __gnu_cxx::__ops::__iter_comp_iter(__pred
, __scan
));
3638 || std::__count_if(__scan
, __last1
,
3639 __gnu_cxx::__ops::__iter_comp_iter(__pred
, __scan
))
3647 * @brief Checks whether a permutaion of the second sequence is equal
3648 * to the first sequence.
3649 * @ingroup non_mutating_algorithms
3650 * @param __first1 Start of first range.
3651 * @param __last1 End of first range.
3652 * @param __first2 Start of second range.
3653 * @param __last2 End of first range.
3654 * @return true if there exists a permutation of the elements in the range
3655 * [__first2, __last2), beginning with ForwardIterator2 begin,
3656 * such that equal(__first1, __last1, begin) returns true;
3657 * otherwise, returns false.
3659 template<typename _ForwardIterator1
, typename _ForwardIterator2
>
3661 is_permutation(_ForwardIterator1 __first1
, _ForwardIterator1 __last1
,
3662 _ForwardIterator2 __first2
, _ForwardIterator2 __last2
)
3664 __glibcxx_requires_valid_range(__first1
, __last1
);
3665 __glibcxx_requires_valid_range(__first2
, __last2
);
3668 std::__is_permutation(__first1
, __last1
, __first2
, __last2
,
3669 __gnu_cxx::__ops::__iter_equal_to_iter());
3673 * @brief Checks whether a permutation of the second sequence is equal
3674 * to the first sequence.
3675 * @ingroup non_mutating_algorithms
3676 * @param __first1 Start of first range.
3677 * @param __last1 End of first range.
3678 * @param __first2 Start of second range.
3679 * @param __last2 End of first range.
3680 * @param __pred A binary predicate.
3681 * @return true if there exists a permutation of the elements in the range
3682 * [__first2, __last2), beginning with ForwardIterator2 begin,
3683 * such that equal(__first1, __last1, __begin, __pred) returns true;
3684 * otherwise, returns false.
3686 template<typename _ForwardIterator1
, typename _ForwardIterator2
,
3687 typename _BinaryPredicate
>
3689 is_permutation(_ForwardIterator1 __first1
, _ForwardIterator1 __last1
,
3690 _ForwardIterator2 __first2
, _ForwardIterator2 __last2
,
3691 _BinaryPredicate __pred
)
3693 __glibcxx_requires_valid_range(__first1
, __last1
);
3694 __glibcxx_requires_valid_range(__first2
, __last2
);
3696 return std::__is_permutation(__first1
, __last1
, __first2
, __last2
,
3697 __gnu_cxx::__ops::__iter_comp_iter(__pred
));
3701 #ifdef _GLIBCXX_USE_C99_STDINT_TR1
3703 * @brief Shuffle the elements of a sequence using a uniform random
3705 * @ingroup mutating_algorithms
3706 * @param __first A forward iterator.
3707 * @param __last A forward iterator.
3708 * @param __g A UniformRandomNumberGenerator (26.5.1.3).
3711 * Reorders the elements in the range @p [__first,__last) using @p __g to
3712 * provide random numbers.
3714 template<typename _RandomAccessIterator
,
3715 typename _UniformRandomNumberGenerator
>
3717 shuffle(_RandomAccessIterator __first
, _RandomAccessIterator __last
,
3718 _UniformRandomNumberGenerator
&& __g
)
3720 // concept requirements
3721 __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept
<
3722 _RandomAccessIterator
>)
3723 __glibcxx_requires_valid_range(__first
, __last
);
3725 if (__first
== __last
)
3728 typedef typename iterator_traits
<_RandomAccessIterator
>::difference_type
3731 typedef typename
std::make_unsigned
<_DistanceType
>::type __ud_type
;
3732 typedef typename
std::uniform_int_distribution
<__ud_type
> __distr_type
;
3733 typedef typename
__distr_type::param_type __p_type
;
3736 for (_RandomAccessIterator __i
= __first
+ 1; __i
!= __last
; ++__i
)
3737 std::iter_swap(__i
, __first
+ __d(__g
, __p_type(0, __i
- __first
)));
3743 _GLIBCXX_END_NAMESPACE_VERSION
3745 _GLIBCXX_BEGIN_NAMESPACE_ALGO
3748 * @brief Apply a function to every element of a sequence.
3749 * @ingroup non_mutating_algorithms
3750 * @param __first An input iterator.
3751 * @param __last An input iterator.
3752 * @param __f A unary function object.
3753 * @return @p __f (std::move(@p __f) in C++0x).
3755 * Applies the function object @p __f to each element in the range
3756 * @p [first,last). @p __f must not modify the order of the sequence.
3757 * If @p __f has a return value it is ignored.
3759 template<typename _InputIterator
, typename _Function
>
3761 for_each(_InputIterator __first
, _InputIterator __last
, _Function __f
)
3763 // concept requirements
3764 __glibcxx_function_requires(_InputIteratorConcept
<_InputIterator
>)
3765 __glibcxx_requires_valid_range(__first
, __last
);
3766 for (; __first
!= __last
; ++__first
)
3768 return _GLIBCXX_MOVE(__f
);
3772 * @brief Find the first occurrence of a value in a sequence.
3773 * @ingroup non_mutating_algorithms
3774 * @param __first An input iterator.
3775 * @param __last An input iterator.
3776 * @param __val The value to find.
3777 * @return The first iterator @c i in the range @p [__first,__last)
3778 * such that @c *i == @p __val, or @p __last if no such iterator exists.
3780 template<typename _InputIterator
, typename _Tp
>
3781 inline _InputIterator
3782 find(_InputIterator __first
, _InputIterator __last
,
3785 // concept requirements
3786 __glibcxx_function_requires(_InputIteratorConcept
<_InputIterator
>)
3787 __glibcxx_function_requires(_EqualOpConcept
<
3788 typename iterator_traits
<_InputIterator
>::value_type
, _Tp
>)
3789 __glibcxx_requires_valid_range(__first
, __last
);
3790 return std::__find_if(__first
, __last
,
3791 __gnu_cxx::__ops::__iter_equals_val(__val
));
3795 * @brief Find the first element in a sequence for which a
3796 * predicate is true.
3797 * @ingroup non_mutating_algorithms
3798 * @param __first An input iterator.
3799 * @param __last An input iterator.
3800 * @param __pred A predicate.
3801 * @return The first iterator @c i in the range @p [__first,__last)
3802 * such that @p __pred(*i) is true, or @p __last if no such iterator exists.
3804 template<typename _InputIterator
, typename _Predicate
>
3805 inline _InputIterator
3806 find_if(_InputIterator __first
, _InputIterator __last
,
3809 // concept requirements
3810 __glibcxx_function_requires(_InputIteratorConcept
<_InputIterator
>)
3811 __glibcxx_function_requires(_UnaryPredicateConcept
<_Predicate
,
3812 typename iterator_traits
<_InputIterator
>::value_type
>)
3813 __glibcxx_requires_valid_range(__first
, __last
);
3815 return std::__find_if(__first
, __last
,
3816 __gnu_cxx::__ops::__pred_iter(__pred
));
3820 * @brief Find element from a set in a sequence.
3821 * @ingroup non_mutating_algorithms
3822 * @param __first1 Start of range to search.
3823 * @param __last1 End of range to search.
3824 * @param __first2 Start of match candidates.
3825 * @param __last2 End of match candidates.
3826 * @return The first iterator @c i in the range
3827 * @p [__first1,__last1) such that @c *i == @p *(i2) such that i2 is an
3828 * iterator in [__first2,__last2), or @p __last1 if no such iterator exists.
3830 * Searches the range @p [__first1,__last1) for an element that is
3831 * equal to some element in the range [__first2,__last2). If
3832 * found, returns an iterator in the range [__first1,__last1),
3833 * otherwise returns @p __last1.
3835 template<typename _InputIterator
, typename _ForwardIterator
>
3837 find_first_of(_InputIterator __first1
, _InputIterator __last1
,
3838 _ForwardIterator __first2
, _ForwardIterator __last2
)
3840 // concept requirements
3841 __glibcxx_function_requires(_InputIteratorConcept
<_InputIterator
>)
3842 __glibcxx_function_requires(_ForwardIteratorConcept
<_ForwardIterator
>)
3843 __glibcxx_function_requires(_EqualOpConcept
<
3844 typename iterator_traits
<_InputIterator
>::value_type
,
3845 typename iterator_traits
<_ForwardIterator
>::value_type
>)
3846 __glibcxx_requires_valid_range(__first1
, __last1
);
3847 __glibcxx_requires_valid_range(__first2
, __last2
);
3849 for (; __first1
!= __last1
; ++__first1
)
3850 for (_ForwardIterator __iter
= __first2
; __iter
!= __last2
; ++__iter
)
3851 if (*__first1
== *__iter
)
3857 * @brief Find element from a set in a sequence using a predicate.
3858 * @ingroup non_mutating_algorithms
3859 * @param __first1 Start of range to search.
3860 * @param __last1 End of range to search.
3861 * @param __first2 Start of match candidates.
3862 * @param __last2 End of match candidates.
3863 * @param __comp Predicate to use.
3864 * @return The first iterator @c i in the range
3865 * @p [__first1,__last1) such that @c comp(*i, @p *(i2)) is true
3866 * and i2 is an iterator in [__first2,__last2), or @p __last1 if no
3867 * such iterator exists.
3870 * Searches the range @p [__first1,__last1) for an element that is
3871 * equal to some element in the range [__first2,__last2). If
3872 * found, returns an iterator in the range [__first1,__last1),
3873 * otherwise returns @p __last1.
3875 template<typename _InputIterator
, typename _ForwardIterator
,
3876 typename _BinaryPredicate
>
3878 find_first_of(_InputIterator __first1
, _InputIterator __last1
,
3879 _ForwardIterator __first2
, _ForwardIterator __last2
,
3880 _BinaryPredicate __comp
)
3882 // concept requirements
3883 __glibcxx_function_requires(_InputIteratorConcept
<_InputIterator
>)
3884 __glibcxx_function_requires(_ForwardIteratorConcept
<_ForwardIterator
>)
3885 __glibcxx_function_requires(_BinaryPredicateConcept
<_BinaryPredicate
,
3886 typename iterator_traits
<_InputIterator
>::value_type
,
3887 typename iterator_traits
<_ForwardIterator
>::value_type
>)
3888 __glibcxx_requires_valid_range(__first1
, __last1
);
3889 __glibcxx_requires_valid_range(__first2
, __last2
);
3891 for (; __first1
!= __last1
; ++__first1
)
3892 for (_ForwardIterator __iter
= __first2
; __iter
!= __last2
; ++__iter
)
3893 if (__comp(*__first1
, *__iter
))
3899 * @brief Find two adjacent values in a sequence that are equal.
3900 * @ingroup non_mutating_algorithms
3901 * @param __first A forward iterator.
3902 * @param __last A forward iterator.
3903 * @return The first iterator @c i such that @c i and @c i+1 are both
3904 * valid iterators in @p [__first,__last) and such that @c *i == @c *(i+1),
3905 * or @p __last if no such iterator exists.
3907 template<typename _ForwardIterator
>
3908 inline _ForwardIterator
3909 adjacent_find(_ForwardIterator __first
, _ForwardIterator __last
)
3911 // concept requirements
3912 __glibcxx_function_requires(_ForwardIteratorConcept
<_ForwardIterator
>)
3913 __glibcxx_function_requires(_EqualityComparableConcept
<
3914 typename iterator_traits
<_ForwardIterator
>::value_type
>)
3915 __glibcxx_requires_valid_range(__first
, __last
);
3917 return std::__adjacent_find(__first
, __last
,
3918 __gnu_cxx::__ops::__iter_equal_to_iter());
3922 * @brief Find two adjacent values in a sequence using a predicate.
3923 * @ingroup non_mutating_algorithms
3924 * @param __first A forward iterator.
3925 * @param __last A forward iterator.
3926 * @param __binary_pred A binary predicate.
3927 * @return The first iterator @c i such that @c i and @c i+1 are both
3928 * valid iterators in @p [__first,__last) and such that
3929 * @p __binary_pred(*i,*(i+1)) is true, or @p __last if no such iterator
3932 template<typename _ForwardIterator
, typename _BinaryPredicate
>
3933 inline _ForwardIterator
3934 adjacent_find(_ForwardIterator __first
, _ForwardIterator __last
,
3935 _BinaryPredicate __binary_pred
)
3937 // concept requirements
3938 __glibcxx_function_requires(_ForwardIteratorConcept
<_ForwardIterator
>)
3939 __glibcxx_function_requires(_BinaryPredicateConcept
<_BinaryPredicate
,
3940 typename iterator_traits
<_ForwardIterator
>::value_type
,
3941 typename iterator_traits
<_ForwardIterator
>::value_type
>)
3942 __glibcxx_requires_valid_range(__first
, __last
);
3944 return std::__adjacent_find(__first
, __last
,
3945 __gnu_cxx::__ops::__iter_comp_iter(__binary_pred
));
3949 * @brief Count the number of copies of a value in a sequence.
3950 * @ingroup non_mutating_algorithms
3951 * @param __first An input iterator.
3952 * @param __last An input iterator.
3953 * @param __value The value to be counted.
3954 * @return The number of iterators @c i in the range @p [__first,__last)
3955 * for which @c *i == @p __value
3957 template<typename _InputIterator
, typename _Tp
>
3958 inline typename iterator_traits
<_InputIterator
>::difference_type
3959 count(_InputIterator __first
, _InputIterator __last
, const _Tp
& __value
)
3961 // concept requirements
3962 __glibcxx_function_requires(_InputIteratorConcept
<_InputIterator
>)
3963 __glibcxx_function_requires(_EqualOpConcept
<
3964 typename iterator_traits
<_InputIterator
>::value_type
, _Tp
>)
3965 __glibcxx_requires_valid_range(__first
, __last
);
3967 return std::__count_if(__first
, __last
,
3968 __gnu_cxx::__ops::__iter_equals_val(__value
));
3972 * @brief Count the elements of a sequence for which a predicate is true.
3973 * @ingroup non_mutating_algorithms
3974 * @param __first An input iterator.
3975 * @param __last An input iterator.
3976 * @param __pred A predicate.
3977 * @return The number of iterators @c i in the range @p [__first,__last)
3978 * for which @p __pred(*i) is true.
3980 template<typename _InputIterator
, typename _Predicate
>
3981 inline typename iterator_traits
<_InputIterator
>::difference_type
3982 count_if(_InputIterator __first
, _InputIterator __last
, _Predicate __pred
)
3984 // concept requirements
3985 __glibcxx_function_requires(_InputIteratorConcept
<_InputIterator
>)
3986 __glibcxx_function_requires(_UnaryPredicateConcept
<_Predicate
,
3987 typename iterator_traits
<_InputIterator
>::value_type
>)
3988 __glibcxx_requires_valid_range(__first
, __last
);
3990 return std::__count_if(__first
, __last
,
3991 __gnu_cxx::__ops::__pred_iter(__pred
));
3995 * @brief Search a sequence for a matching sub-sequence.
3996 * @ingroup non_mutating_algorithms
3997 * @param __first1 A forward iterator.
3998 * @param __last1 A forward iterator.
3999 * @param __first2 A forward iterator.
4000 * @param __last2 A forward iterator.
4001 * @return The first iterator @c i in the range @p
4002 * [__first1,__last1-(__last2-__first2)) such that @c *(i+N) == @p
4003 * *(__first2+N) for each @c N in the range @p
4004 * [0,__last2-__first2), or @p __last1 if no such iterator exists.
4006 * Searches the range @p [__first1,__last1) for a sub-sequence that
4007 * compares equal value-by-value with the sequence given by @p
4008 * [__first2,__last2) and returns an iterator to the first element
4009 * of the sub-sequence, or @p __last1 if the sub-sequence is not
4012 * Because the sub-sequence must lie completely within the range @p
4013 * [__first1,__last1) it must start at a position less than @p
4014 * __last1-(__last2-__first2) where @p __last2-__first2 is the
4015 * length of the sub-sequence.
4017 * This means that the returned iterator @c i will be in the range
4018 * @p [__first1,__last1-(__last2-__first2))
4020 template<typename _ForwardIterator1
, typename _ForwardIterator2
>
4021 inline _ForwardIterator1
4022 search(_ForwardIterator1 __first1
, _ForwardIterator1 __last1
,
4023 _ForwardIterator2 __first2
, _ForwardIterator2 __last2
)
4025 // concept requirements
4026 __glibcxx_function_requires(_ForwardIteratorConcept
<_ForwardIterator1
>)
4027 __glibcxx_function_requires(_ForwardIteratorConcept
<_ForwardIterator2
>)
4028 __glibcxx_function_requires(_EqualOpConcept
<
4029 typename iterator_traits
<_ForwardIterator1
>::value_type
,
4030 typename iterator_traits
<_ForwardIterator2
>::value_type
>)
4031 __glibcxx_requires_valid_range(__first1
, __last1
);
4032 __glibcxx_requires_valid_range(__first2
, __last2
);
4034 return std::__search(__first1
, __last1
, __first2
, __last2
,
4035 __gnu_cxx::__ops::__iter_equal_to_iter());
4039 * @brief Search a sequence for a matching sub-sequence using a predicate.
4040 * @ingroup non_mutating_algorithms
4041 * @param __first1 A forward iterator.
4042 * @param __last1 A forward iterator.
4043 * @param __first2 A forward iterator.
4044 * @param __last2 A forward iterator.
4045 * @param __predicate A binary predicate.
4046 * @return The first iterator @c i in the range
4047 * @p [__first1,__last1-(__last2-__first2)) such that
4048 * @p __predicate(*(i+N),*(__first2+N)) is true for each @c N in the range
4049 * @p [0,__last2-__first2), or @p __last1 if no such iterator exists.
4051 * Searches the range @p [__first1,__last1) for a sub-sequence that
4052 * compares equal value-by-value with the sequence given by @p
4053 * [__first2,__last2), using @p __predicate to determine equality,
4054 * and returns an iterator to the first element of the
4055 * sub-sequence, or @p __last1 if no such iterator exists.
4057 * @see search(_ForwardIter1, _ForwardIter1, _ForwardIter2, _ForwardIter2)
4059 template<typename _ForwardIterator1
, typename _ForwardIterator2
,
4060 typename _BinaryPredicate
>
4061 inline _ForwardIterator1
4062 search(_ForwardIterator1 __first1
, _ForwardIterator1 __last1
,
4063 _ForwardIterator2 __first2
, _ForwardIterator2 __last2
,
4064 _BinaryPredicate __predicate
)
4066 // concept requirements
4067 __glibcxx_function_requires(_ForwardIteratorConcept
<_ForwardIterator1
>)
4068 __glibcxx_function_requires(_ForwardIteratorConcept
<_ForwardIterator2
>)
4069 __glibcxx_function_requires(_BinaryPredicateConcept
<_BinaryPredicate
,
4070 typename iterator_traits
<_ForwardIterator1
>::value_type
,
4071 typename iterator_traits
<_ForwardIterator2
>::value_type
>)
4072 __glibcxx_requires_valid_range(__first1
, __last1
);
4073 __glibcxx_requires_valid_range(__first2
, __last2
);
4075 return std::__search(__first1
, __last1
, __first2
, __last2
,
4076 __gnu_cxx::__ops::__iter_comp_iter(__predicate
));
4080 * @brief Search a sequence for a number of consecutive values.
4081 * @ingroup non_mutating_algorithms
4082 * @param __first A forward iterator.
4083 * @param __last A forward iterator.
4084 * @param __count The number of consecutive values.
4085 * @param __val The value to find.
4086 * @return The first iterator @c i in the range @p
4087 * [__first,__last-__count) such that @c *(i+N) == @p __val for
4088 * each @c N in the range @p [0,__count), or @p __last if no such
4091 * Searches the range @p [__first,__last) for @p count consecutive elements
4092 * equal to @p __val.
4094 template<typename _ForwardIterator
, typename _Integer
, typename _Tp
>
4095 inline _ForwardIterator
4096 search_n(_ForwardIterator __first
, _ForwardIterator __last
,
4097 _Integer __count
, const _Tp
& __val
)
4099 // concept requirements
4100 __glibcxx_function_requires(_ForwardIteratorConcept
<_ForwardIterator
>)
4101 __glibcxx_function_requires(_EqualOpConcept
<
4102 typename iterator_traits
<_ForwardIterator
>::value_type
, _Tp
>)
4103 __glibcxx_requires_valid_range(__first
, __last
);
4105 return std::__search_n(__first
, __last
, __count
,
4106 __gnu_cxx::__ops::__iter_equals_val(__val
));
4111 * @brief Search a sequence for a number of consecutive values using a
4113 * @ingroup non_mutating_algorithms
4114 * @param __first A forward iterator.
4115 * @param __last A forward iterator.
4116 * @param __count The number of consecutive values.
4117 * @param __val The value to find.
4118 * @param __binary_pred A binary predicate.
4119 * @return The first iterator @c i in the range @p
4120 * [__first,__last-__count) such that @p
4121 * __binary_pred(*(i+N),__val) is true for each @c N in the range
4122 * @p [0,__count), or @p __last if no such iterator exists.
4124 * Searches the range @p [__first,__last) for @p __count
4125 * consecutive elements for which the predicate returns true.
4127 template<typename _ForwardIterator
, typename _Integer
, typename _Tp
,
4128 typename _BinaryPredicate
>
4129 inline _ForwardIterator
4130 search_n(_ForwardIterator __first
, _ForwardIterator __last
,
4131 _Integer __count
, const _Tp
& __val
,
4132 _BinaryPredicate __binary_pred
)
4134 // concept requirements
4135 __glibcxx_function_requires(_ForwardIteratorConcept
<_ForwardIterator
>)
4136 __glibcxx_function_requires(_BinaryPredicateConcept
<_BinaryPredicate
,
4137 typename iterator_traits
<_ForwardIterator
>::value_type
, _Tp
>)
4138 __glibcxx_requires_valid_range(__first
, __last
);
4140 return std::__search_n(__first
, __last
, __count
,
4141 __gnu_cxx::__ops::__iter_comp_val(__binary_pred
, __val
));
4146 * @brief Perform an operation on a sequence.
4147 * @ingroup mutating_algorithms
4148 * @param __first An input iterator.
4149 * @param __last An input iterator.
4150 * @param __result An output iterator.
4151 * @param __unary_op A unary operator.
4152 * @return An output iterator equal to @p __result+(__last-__first).
4154 * Applies the operator to each element in the input range and assigns
4155 * the results to successive elements of the output sequence.
4156 * Evaluates @p *(__result+N)=unary_op(*(__first+N)) for each @c N in the
4157 * range @p [0,__last-__first).
4159 * @p unary_op must not alter its argument.
4161 template<typename _InputIterator
, typename _OutputIterator
,
4162 typename _UnaryOperation
>
4164 transform(_InputIterator __first
, _InputIterator __last
,
4165 _OutputIterator __result
, _UnaryOperation __unary_op
)
4167 // concept requirements
4168 __glibcxx_function_requires(_InputIteratorConcept
<_InputIterator
>)
4169 __glibcxx_function_requires(_OutputIteratorConcept
<_OutputIterator
,
4170 // "the type returned by a _UnaryOperation"
4171 __typeof__(__unary_op(*__first
))>)
4172 __glibcxx_requires_valid_range(__first
, __last
);
4174 for (; __first
!= __last
; ++__first
, ++__result
)
4175 *__result
= __unary_op(*__first
);
4180 * @brief Perform an operation on corresponding elements of two sequences.
4181 * @ingroup mutating_algorithms
4182 * @param __first1 An input iterator.
4183 * @param __last1 An input iterator.
4184 * @param __first2 An input iterator.
4185 * @param __result An output iterator.
4186 * @param __binary_op A binary operator.
4187 * @return An output iterator equal to @p result+(last-first).
4189 * Applies the operator to the corresponding elements in the two
4190 * input ranges and assigns the results to successive elements of the
4193 * *(__result+N)=__binary_op(*(__first1+N),*(__first2+N)) for each
4194 * @c N in the range @p [0,__last1-__first1).
4196 * @p binary_op must not alter either of its arguments.
4198 template<typename _InputIterator1
, typename _InputIterator2
,
4199 typename _OutputIterator
, typename _BinaryOperation
>
4201 transform(_InputIterator1 __first1
, _InputIterator1 __last1
,
4202 _InputIterator2 __first2
, _OutputIterator __result
,
4203 _BinaryOperation __binary_op
)
4205 // concept requirements
4206 __glibcxx_function_requires(_InputIteratorConcept
<_InputIterator1
>)
4207 __glibcxx_function_requires(_InputIteratorConcept
<_InputIterator2
>)
4208 __glibcxx_function_requires(_OutputIteratorConcept
<_OutputIterator
,
4209 // "the type returned by a _BinaryOperation"
4210 __typeof__(__binary_op(*__first1
,*__first2
))>)
4211 __glibcxx_requires_valid_range(__first1
, __last1
);
4213 for (; __first1
!= __last1
; ++__first1
, ++__first2
, ++__result
)
4214 *__result
= __binary_op(*__first1
, *__first2
);
4219 * @brief Replace each occurrence of one value in a sequence with another
4221 * @ingroup mutating_algorithms
4222 * @param __first A forward iterator.
4223 * @param __last A forward iterator.
4224 * @param __old_value The value to be replaced.
4225 * @param __new_value The replacement value.
4226 * @return replace() returns no value.
4228 * For each iterator @c i in the range @p [__first,__last) if @c *i ==
4229 * @p __old_value then the assignment @c *i = @p __new_value is performed.
4231 template<typename _ForwardIterator
, typename _Tp
>
4233 replace(_ForwardIterator __first
, _ForwardIterator __last
,
4234 const _Tp
& __old_value
, const _Tp
& __new_value
)
4236 // concept requirements
4237 __glibcxx_function_requires(_Mutable_ForwardIteratorConcept
<
4239 __glibcxx_function_requires(_EqualOpConcept
<
4240 typename iterator_traits
<_ForwardIterator
>::value_type
, _Tp
>)
4241 __glibcxx_function_requires(_ConvertibleConcept
<_Tp
,
4242 typename iterator_traits
<_ForwardIterator
>::value_type
>)
4243 __glibcxx_requires_valid_range(__first
, __last
);
4245 for (; __first
!= __last
; ++__first
)
4246 if (*__first
== __old_value
)
4247 *__first
= __new_value
;
4251 * @brief Replace each value in a sequence for which a predicate returns
4252 * true with another value.
4253 * @ingroup mutating_algorithms
4254 * @param __first A forward iterator.
4255 * @param __last A forward iterator.
4256 * @param __pred A predicate.
4257 * @param __new_value The replacement value.
4258 * @return replace_if() returns no value.
4260 * For each iterator @c i in the range @p [__first,__last) if @p __pred(*i)
4261 * is true then the assignment @c *i = @p __new_value is performed.
4263 template<typename _ForwardIterator
, typename _Predicate
, typename _Tp
>
4265 replace_if(_ForwardIterator __first
, _ForwardIterator __last
,
4266 _Predicate __pred
, const _Tp
& __new_value
)
4268 // concept requirements
4269 __glibcxx_function_requires(_Mutable_ForwardIteratorConcept
<
4271 __glibcxx_function_requires(_ConvertibleConcept
<_Tp
,
4272 typename iterator_traits
<_ForwardIterator
>::value_type
>)
4273 __glibcxx_function_requires(_UnaryPredicateConcept
<_Predicate
,
4274 typename iterator_traits
<_ForwardIterator
>::value_type
>)
4275 __glibcxx_requires_valid_range(__first
, __last
);
4277 for (; __first
!= __last
; ++__first
)
4278 if (__pred(*__first
))
4279 *__first
= __new_value
;
4283 * @brief Assign the result of a function object to each value in a
4285 * @ingroup mutating_algorithms
4286 * @param __first A forward iterator.
4287 * @param __last A forward iterator.
4288 * @param __gen A function object taking no arguments and returning
4289 * std::iterator_traits<_ForwardIterator>::value_type
4290 * @return generate() returns no value.
4292 * Performs the assignment @c *i = @p __gen() for each @c i in the range
4293 * @p [__first,__last).
4295 template<typename _ForwardIterator
, typename _Generator
>
4297 generate(_ForwardIterator __first
, _ForwardIterator __last
,
4300 // concept requirements
4301 __glibcxx_function_requires(_ForwardIteratorConcept
<_ForwardIterator
>)
4302 __glibcxx_function_requires(_GeneratorConcept
<_Generator
,
4303 typename iterator_traits
<_ForwardIterator
>::value_type
>)
4304 __glibcxx_requires_valid_range(__first
, __last
);
4306 for (; __first
!= __last
; ++__first
)
4311 * @brief Assign the result of a function object to each value in a
4313 * @ingroup mutating_algorithms
4314 * @param __first A forward iterator.
4315 * @param __n The length of the sequence.
4316 * @param __gen A function object taking no arguments and returning
4317 * std::iterator_traits<_ForwardIterator>::value_type
4318 * @return The end of the sequence, @p __first+__n
4320 * Performs the assignment @c *i = @p __gen() for each @c i in the range
4321 * @p [__first,__first+__n).
4323 * _GLIBCXX_RESOLVE_LIB_DEFECTS
4324 * DR 865. More algorithms that throw away information
4326 template<typename _OutputIterator
, typename _Size
, typename _Generator
>
4328 generate_n(_OutputIterator __first
, _Size __n
, _Generator __gen
)
4330 // concept requirements
4331 __glibcxx_function_requires(_OutputIteratorConcept
<_OutputIterator
,
4332 // "the type returned by a _Generator"
4333 __typeof__(__gen())>)
4335 for (__decltype(__n
+ 0) __niter
= __n
;
4336 __niter
> 0; --__niter
, ++__first
)
4342 * @brief Copy a sequence, removing consecutive duplicate values.
4343 * @ingroup mutating_algorithms
4344 * @param __first An input iterator.
4345 * @param __last An input iterator.
4346 * @param __result An output iterator.
4347 * @return An iterator designating the end of the resulting sequence.
4349 * Copies each element in the range @p [__first,__last) to the range
4350 * beginning at @p __result, except that only the first element is copied
4351 * from groups of consecutive elements that compare equal.
4352 * unique_copy() is stable, so the relative order of elements that are
4353 * copied is unchanged.
4355 * _GLIBCXX_RESOLVE_LIB_DEFECTS
4356 * DR 241. Does unique_copy() require CopyConstructible and Assignable?
4358 * _GLIBCXX_RESOLVE_LIB_DEFECTS
4359 * DR 538. 241 again: Does unique_copy() require CopyConstructible and
4362 template<typename _InputIterator
, typename _OutputIterator
>
4363 inline _OutputIterator
4364 unique_copy(_InputIterator __first
, _InputIterator __last
,
4365 _OutputIterator __result
)
4367 // concept requirements
4368 __glibcxx_function_requires(_InputIteratorConcept
<_InputIterator
>)
4369 __glibcxx_function_requires(_OutputIteratorConcept
<_OutputIterator
,
4370 typename iterator_traits
<_InputIterator
>::value_type
>)
4371 __glibcxx_function_requires(_EqualityComparableConcept
<
4372 typename iterator_traits
<_InputIterator
>::value_type
>)
4373 __glibcxx_requires_valid_range(__first
, __last
);
4375 if (__first
== __last
)
4377 return std::__unique_copy(__first
, __last
, __result
,
4378 __gnu_cxx::__ops::__iter_equal_to_iter(),
4379 std::__iterator_category(__first
),
4380 std::__iterator_category(__result
));
4384 * @brief Copy a sequence, removing consecutive values using a predicate.
4385 * @ingroup mutating_algorithms
4386 * @param __first An input iterator.
4387 * @param __last An input iterator.
4388 * @param __result An output iterator.
4389 * @param __binary_pred A binary predicate.
4390 * @return An iterator designating the end of the resulting sequence.
4392 * Copies each element in the range @p [__first,__last) to the range
4393 * beginning at @p __result, except that only the first element is copied
4394 * from groups of consecutive elements for which @p __binary_pred returns
4396 * unique_copy() is stable, so the relative order of elements that are
4397 * copied is unchanged.
4399 * _GLIBCXX_RESOLVE_LIB_DEFECTS
4400 * DR 241. Does unique_copy() require CopyConstructible and Assignable?
4402 template<typename _InputIterator
, typename _OutputIterator
,
4403 typename _BinaryPredicate
>
4404 inline _OutputIterator
4405 unique_copy(_InputIterator __first
, _InputIterator __last
,
4406 _OutputIterator __result
,
4407 _BinaryPredicate __binary_pred
)
4409 // concept requirements -- predicates checked later
4410 __glibcxx_function_requires(_InputIteratorConcept
<_InputIterator
>)
4411 __glibcxx_function_requires(_OutputIteratorConcept
<_OutputIterator
,
4412 typename iterator_traits
<_InputIterator
>::value_type
>)
4413 __glibcxx_requires_valid_range(__first
, __last
);
4415 if (__first
== __last
)
4417 return std::__unique_copy(__first
, __last
, __result
,
4418 __gnu_cxx::__ops::__iter_comp_iter(__binary_pred
),
4419 std::__iterator_category(__first
),
4420 std::__iterator_category(__result
));
4425 * @brief Randomly shuffle the elements of a sequence.
4426 * @ingroup mutating_algorithms
4427 * @param __first A forward iterator.
4428 * @param __last A forward iterator.
4431 * Reorder the elements in the range @p [__first,__last) using a random
4432 * distribution, so that every possible ordering of the sequence is
4435 template<typename _RandomAccessIterator
>
4437 random_shuffle(_RandomAccessIterator __first
, _RandomAccessIterator __last
)
4439 // concept requirements
4440 __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept
<
4441 _RandomAccessIterator
>)
4442 __glibcxx_requires_valid_range(__first
, __last
);
4444 if (__first
!= __last
)
4445 for (_RandomAccessIterator __i
= __first
+ 1; __i
!= __last
; ++__i
)
4447 // XXX rand() % N is not uniformly distributed
4448 _RandomAccessIterator __j
= __first
4449 + std::rand() % ((__i
- __first
) + 1);
4451 std::iter_swap(__i
, __j
);
4457 * @brief Shuffle the elements of a sequence using a random number
4459 * @ingroup mutating_algorithms
4460 * @param __first A forward iterator.
4461 * @param __last A forward iterator.
4462 * @param __rand The RNG functor or function.
4465 * Reorders the elements in the range @p [__first,__last) using @p __rand to
4466 * provide a random distribution. Calling @p __rand(N) for a positive
4467 * integer @p N should return a randomly chosen integer from the
4470 template<typename _RandomAccessIterator
, typename _RandomNumberGenerator
>
4472 random_shuffle(_RandomAccessIterator __first
, _RandomAccessIterator __last
,
4473 #if __cplusplus >= 201103L
4474 _RandomNumberGenerator
&& __rand
)
4476 _RandomNumberGenerator
& __rand
)
4479 // concept requirements
4480 __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept
<
4481 _RandomAccessIterator
>)
4482 __glibcxx_requires_valid_range(__first
, __last
);
4484 if (__first
== __last
)
4486 for (_RandomAccessIterator __i
= __first
+ 1; __i
!= __last
; ++__i
)
4488 _RandomAccessIterator __j
= __first
+ __rand((__i
- __first
) + 1);
4490 std::iter_swap(__i
, __j
);
4496 * @brief Move elements for which a predicate is true to the beginning
4498 * @ingroup mutating_algorithms
4499 * @param __first A forward iterator.
4500 * @param __last A forward iterator.
4501 * @param __pred A predicate functor.
4502 * @return An iterator @p middle such that @p __pred(i) is true for each
4503 * iterator @p i in the range @p [__first,middle) and false for each @p i
4504 * in the range @p [middle,__last).
4506 * @p __pred must not modify its operand. @p partition() does not preserve
4507 * the relative ordering of elements in each group, use
4508 * @p stable_partition() if this is needed.
4510 template<typename _ForwardIterator
, typename _Predicate
>
4511 inline _ForwardIterator
4512 partition(_ForwardIterator __first
, _ForwardIterator __last
,
4515 // concept requirements
4516 __glibcxx_function_requires(_Mutable_ForwardIteratorConcept
<
4518 __glibcxx_function_requires(_UnaryPredicateConcept
<_Predicate
,
4519 typename iterator_traits
<_ForwardIterator
>::value_type
>)
4520 __glibcxx_requires_valid_range(__first
, __last
);
4522 return std::__partition(__first
, __last
, __pred
,
4523 std::__iterator_category(__first
));
4528 * @brief Sort the smallest elements of a sequence.
4529 * @ingroup sorting_algorithms
4530 * @param __first An iterator.
4531 * @param __middle Another iterator.
4532 * @param __last Another iterator.
4535 * Sorts the smallest @p (__middle-__first) elements in the range
4536 * @p [first,last) and moves them to the range @p [__first,__middle). The
4537 * order of the remaining elements in the range @p [__middle,__last) is
4539 * After the sort if @e i and @e j are iterators in the range
4540 * @p [__first,__middle) such that i precedes j and @e k is an iterator in
4541 * the range @p [__middle,__last) then *j<*i and *k<*i are both false.
4543 template<typename _RandomAccessIterator
>
4545 partial_sort(_RandomAccessIterator __first
,
4546 _RandomAccessIterator __middle
,
4547 _RandomAccessIterator __last
)
4549 // concept requirements
4550 __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept
<
4551 _RandomAccessIterator
>)
4552 __glibcxx_function_requires(_LessThanComparableConcept
<
4553 typename iterator_traits
<_RandomAccessIterator
>::value_type
>)
4554 __glibcxx_requires_valid_range(__first
, __middle
);
4555 __glibcxx_requires_valid_range(__middle
, __last
);
4557 std::__partial_sort(__first
, __middle
, __last
,
4558 __gnu_cxx::__ops::__iter_less_iter());
4562 * @brief Sort the smallest elements of a sequence using a predicate
4564 * @ingroup sorting_algorithms
4565 * @param __first An iterator.
4566 * @param __middle Another iterator.
4567 * @param __last Another iterator.
4568 * @param __comp A comparison functor.
4571 * Sorts the smallest @p (__middle-__first) elements in the range
4572 * @p [__first,__last) and moves them to the range @p [__first,__middle). The
4573 * order of the remaining elements in the range @p [__middle,__last) is
4575 * After the sort if @e i and @e j are iterators in the range
4576 * @p [__first,__middle) such that i precedes j and @e k is an iterator in
4577 * the range @p [__middle,__last) then @p *__comp(j,*i) and @p __comp(*k,*i)
4580 template<typename _RandomAccessIterator
, typename _Compare
>
4582 partial_sort(_RandomAccessIterator __first
,
4583 _RandomAccessIterator __middle
,
4584 _RandomAccessIterator __last
,
4587 // concept requirements
4588 __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept
<
4589 _RandomAccessIterator
>)
4590 __glibcxx_function_requires(_BinaryPredicateConcept
<_Compare
,
4591 typename iterator_traits
<_RandomAccessIterator
>::value_type
,
4592 typename iterator_traits
<_RandomAccessIterator
>::value_type
>)
4593 __glibcxx_requires_valid_range(__first
, __middle
);
4594 __glibcxx_requires_valid_range(__middle
, __last
);
4596 std::__partial_sort(__first
, __middle
, __last
,
4597 __gnu_cxx::__ops::__iter_comp_iter(__comp
));
4601 * @brief Sort a sequence just enough to find a particular position.
4602 * @ingroup sorting_algorithms
4603 * @param __first An iterator.
4604 * @param __nth Another iterator.
4605 * @param __last Another iterator.
4608 * Rearranges the elements in the range @p [__first,__last) so that @p *__nth
4609 * is the same element that would have been in that position had the
4610 * whole sequence been sorted. The elements either side of @p *__nth are
4611 * not completely sorted, but for any iterator @e i in the range
4612 * @p [__first,__nth) and any iterator @e j in the range @p [__nth,__last) it
4613 * holds that *j < *i is false.
4615 template<typename _RandomAccessIterator
>
4617 nth_element(_RandomAccessIterator __first
, _RandomAccessIterator __nth
,
4618 _RandomAccessIterator __last
)
4620 // concept requirements
4621 __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept
<
4622 _RandomAccessIterator
>)
4623 __glibcxx_function_requires(_LessThanComparableConcept
<
4624 typename iterator_traits
<_RandomAccessIterator
>::value_type
>)
4625 __glibcxx_requires_valid_range(__first
, __nth
);
4626 __glibcxx_requires_valid_range(__nth
, __last
);
4628 if (__first
== __last
|| __nth
== __last
)
4631 std::__introselect(__first
, __nth
, __last
,
4632 std::__lg(__last
- __first
) * 2,
4633 __gnu_cxx::__ops::__iter_less_iter());
4637 * @brief Sort a sequence just enough to find a particular position
4638 * using a predicate for comparison.
4639 * @ingroup sorting_algorithms
4640 * @param __first An iterator.
4641 * @param __nth Another iterator.
4642 * @param __last Another iterator.
4643 * @param __comp A comparison functor.
4646 * Rearranges the elements in the range @p [__first,__last) so that @p *__nth
4647 * is the same element that would have been in that position had the
4648 * whole sequence been sorted. The elements either side of @p *__nth are
4649 * not completely sorted, but for any iterator @e i in the range
4650 * @p [__first,__nth) and any iterator @e j in the range @p [__nth,__last) it
4651 * holds that @p __comp(*j,*i) is false.
4653 template<typename _RandomAccessIterator
, typename _Compare
>
4655 nth_element(_RandomAccessIterator __first
, _RandomAccessIterator __nth
,
4656 _RandomAccessIterator __last
, _Compare __comp
)
4658 // concept requirements
4659 __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept
<
4660 _RandomAccessIterator
>)
4661 __glibcxx_function_requires(_BinaryPredicateConcept
<_Compare
,
4662 typename iterator_traits
<_RandomAccessIterator
>::value_type
,
4663 typename iterator_traits
<_RandomAccessIterator
>::value_type
>)
4664 __glibcxx_requires_valid_range(__first
, __nth
);
4665 __glibcxx_requires_valid_range(__nth
, __last
);
4667 if (__first
== __last
|| __nth
== __last
)
4670 std::__introselect(__first
, __nth
, __last
,
4671 std::__lg(__last
- __first
) * 2,
4672 __gnu_cxx::__ops::__iter_comp_iter(__comp
));
4676 * @brief Sort the elements of a sequence.
4677 * @ingroup sorting_algorithms
4678 * @param __first An iterator.
4679 * @param __last Another iterator.
4682 * Sorts the elements in the range @p [__first,__last) in ascending order,
4683 * such that for each iterator @e i in the range @p [__first,__last-1),
4684 * *(i+1)<*i is false.
4686 * The relative ordering of equivalent elements is not preserved, use
4687 * @p stable_sort() if this is needed.
4689 template<typename _RandomAccessIterator
>
4691 sort(_RandomAccessIterator __first
, _RandomAccessIterator __last
)
4693 // concept requirements
4694 __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept
<
4695 _RandomAccessIterator
>)
4696 __glibcxx_function_requires(_LessThanComparableConcept
<
4697 typename iterator_traits
<_RandomAccessIterator
>::value_type
>)
4698 __glibcxx_requires_valid_range(__first
, __last
);
4700 std::__sort(__first
, __last
, __gnu_cxx::__ops::__iter_less_iter());
4704 * @brief Sort the elements of a sequence using a predicate for comparison.
4705 * @ingroup sorting_algorithms
4706 * @param __first An iterator.
4707 * @param __last Another iterator.
4708 * @param __comp A comparison functor.
4711 * Sorts the elements in the range @p [__first,__last) in ascending order,
4712 * such that @p __comp(*(i+1),*i) is false for every iterator @e i in the
4713 * range @p [__first,__last-1).
4715 * The relative ordering of equivalent elements is not preserved, use
4716 * @p stable_sort() if this is needed.
4718 template<typename _RandomAccessIterator
, typename _Compare
>
4720 sort(_RandomAccessIterator __first
, _RandomAccessIterator __last
,
4723 // concept requirements
4724 __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept
<
4725 _RandomAccessIterator
>)
4726 __glibcxx_function_requires(_BinaryPredicateConcept
<_Compare
,
4727 typename iterator_traits
<_RandomAccessIterator
>::value_type
,
4728 typename iterator_traits
<_RandomAccessIterator
>::value_type
>)
4729 __glibcxx_requires_valid_range(__first
, __last
);
4731 std::__sort(__first
, __last
, __gnu_cxx::__ops::__iter_comp_iter(__comp
));
4734 template<typename _InputIterator1
, typename _InputIterator2
,
4735 typename _OutputIterator
, typename _Compare
>
4737 __merge(_InputIterator1 __first1
, _InputIterator1 __last1
,
4738 _InputIterator2 __first2
, _InputIterator2 __last2
,
4739 _OutputIterator __result
, _Compare __comp
)
4741 while (__first1
!= __last1
&& __first2
!= __last2
)
4743 if (__comp(__first2
, __first1
))
4745 *__result
= *__first2
;
4750 *__result
= *__first1
;
4755 return std::copy(__first2
, __last2
,
4756 std::copy(__first1
, __last1
, __result
));
4760 * @brief Merges two sorted ranges.
4761 * @ingroup sorting_algorithms
4762 * @param __first1 An iterator.
4763 * @param __first2 Another iterator.
4764 * @param __last1 Another iterator.
4765 * @param __last2 Another iterator.
4766 * @param __result An iterator pointing to the end of the merged range.
4767 * @return An iterator pointing to the first element <em>not less
4770 * Merges the ranges @p [__first1,__last1) and @p [__first2,__last2) into
4771 * the sorted range @p [__result, __result + (__last1-__first1) +
4772 * (__last2-__first2)). Both input ranges must be sorted, and the
4773 * output range must not overlap with either of the input ranges.
4774 * The sort is @e stable, that is, for equivalent elements in the
4775 * two ranges, elements from the first range will always come
4776 * before elements from the second.
4778 template<typename _InputIterator1
, typename _InputIterator2
,
4779 typename _OutputIterator
>
4780 inline _OutputIterator
4781 merge(_InputIterator1 __first1
, _InputIterator1 __last1
,
4782 _InputIterator2 __first2
, _InputIterator2 __last2
,
4783 _OutputIterator __result
)
4785 // concept requirements
4786 __glibcxx_function_requires(_InputIteratorConcept
<_InputIterator1
>)
4787 __glibcxx_function_requires(_InputIteratorConcept
<_InputIterator2
>)
4788 __glibcxx_function_requires(_OutputIteratorConcept
<_OutputIterator
,
4789 typename iterator_traits
<_InputIterator1
>::value_type
>)
4790 __glibcxx_function_requires(_OutputIteratorConcept
<_OutputIterator
,
4791 typename iterator_traits
<_InputIterator2
>::value_type
>)
4792 __glibcxx_function_requires(_LessThanOpConcept
<
4793 typename iterator_traits
<_InputIterator2
>::value_type
,
4794 typename iterator_traits
<_InputIterator1
>::value_type
>)
4795 __glibcxx_requires_sorted_set(__first1
, __last1
, __first2
);
4796 __glibcxx_requires_sorted_set(__first2
, __last2
, __first1
);
4798 return _GLIBCXX_STD_A::__merge(__first1
, __last1
,
4799 __first2
, __last2
, __result
,
4800 __gnu_cxx::__ops::__iter_less_iter());
4804 * @brief Merges two sorted ranges.
4805 * @ingroup sorting_algorithms
4806 * @param __first1 An iterator.
4807 * @param __first2 Another iterator.
4808 * @param __last1 Another iterator.
4809 * @param __last2 Another iterator.
4810 * @param __result An iterator pointing to the end of the merged range.
4811 * @param __comp A functor to use for comparisons.
4812 * @return An iterator pointing to the first element "not less
4815 * Merges the ranges @p [__first1,__last1) and @p [__first2,__last2) into
4816 * the sorted range @p [__result, __result + (__last1-__first1) +
4817 * (__last2-__first2)). Both input ranges must be sorted, and the
4818 * output range must not overlap with either of the input ranges.
4819 * The sort is @e stable, that is, for equivalent elements in the
4820 * two ranges, elements from the first range will always come
4821 * before elements from the second.
4823 * The comparison function should have the same effects on ordering as
4824 * the function used for the initial sort.
4826 template<typename _InputIterator1
, typename _InputIterator2
,
4827 typename _OutputIterator
, typename _Compare
>
4828 inline _OutputIterator
4829 merge(_InputIterator1 __first1
, _InputIterator1 __last1
,
4830 _InputIterator2 __first2
, _InputIterator2 __last2
,
4831 _OutputIterator __result
, _Compare __comp
)
4833 // concept requirements
4834 __glibcxx_function_requires(_InputIteratorConcept
<_InputIterator1
>)
4835 __glibcxx_function_requires(_InputIteratorConcept
<_InputIterator2
>)
4836 __glibcxx_function_requires(_OutputIteratorConcept
<_OutputIterator
,
4837 typename iterator_traits
<_InputIterator1
>::value_type
>)
4838 __glibcxx_function_requires(_OutputIteratorConcept
<_OutputIterator
,
4839 typename iterator_traits
<_InputIterator2
>::value_type
>)
4840 __glibcxx_function_requires(_BinaryPredicateConcept
<_Compare
,
4841 typename iterator_traits
<_InputIterator2
>::value_type
,
4842 typename iterator_traits
<_InputIterator1
>::value_type
>)
4843 __glibcxx_requires_sorted_set_pred(__first1
, __last1
, __first2
, __comp
);
4844 __glibcxx_requires_sorted_set_pred(__first2
, __last2
, __first1
, __comp
);
4846 return _GLIBCXX_STD_A::__merge(__first1
, __last1
,
4847 __first2
, __last2
, __result
,
4848 __gnu_cxx::__ops::__iter_comp_iter(__comp
));
4851 template<typename _RandomAccessIterator
, typename _Compare
>
4853 __stable_sort(_RandomAccessIterator __first
, _RandomAccessIterator __last
,
4856 typedef typename iterator_traits
<_RandomAccessIterator
>::value_type
4858 typedef typename iterator_traits
<_RandomAccessIterator
>::difference_type
4861 typedef _Temporary_buffer
<_RandomAccessIterator
, _ValueType
> _TmpBuf
;
4862 _TmpBuf
__buf(__first
, __last
);
4864 if (__buf
.begin() == 0)
4865 std::__inplace_stable_sort(__first
, __last
, __comp
);
4867 std::__stable_sort_adaptive(__first
, __last
, __buf
.begin(),
4868 _DistanceType(__buf
.size()), __comp
);
4872 * @brief Sort the elements of a sequence, preserving the relative order
4873 * of equivalent elements.
4874 * @ingroup sorting_algorithms
4875 * @param __first An iterator.
4876 * @param __last Another iterator.
4879 * Sorts the elements in the range @p [__first,__last) in ascending order,
4880 * such that for each iterator @p i in the range @p [__first,__last-1),
4881 * @p *(i+1)<*i is false.
4883 * The relative ordering of equivalent elements is preserved, so any two
4884 * elements @p x and @p y in the range @p [__first,__last) such that
4885 * @p x<y is false and @p y<x is false will have the same relative
4886 * ordering after calling @p stable_sort().
4888 template<typename _RandomAccessIterator
>
4890 stable_sort(_RandomAccessIterator __first
, _RandomAccessIterator __last
)
4892 // concept requirements
4893 __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept
<
4894 _RandomAccessIterator
>)
4895 __glibcxx_function_requires(_LessThanComparableConcept
<
4896 typename iterator_traits
<_RandomAccessIterator
>::value_type
>)
4897 __glibcxx_requires_valid_range(__first
, __last
);
4899 _GLIBCXX_STD_A::__stable_sort(__first
, __last
,
4900 __gnu_cxx::__ops::__iter_less_iter());
4904 * @brief Sort the elements of a sequence using a predicate for comparison,
4905 * preserving the relative order of equivalent elements.
4906 * @ingroup sorting_algorithms
4907 * @param __first An iterator.
4908 * @param __last Another iterator.
4909 * @param __comp A comparison functor.
4912 * Sorts the elements in the range @p [__first,__last) in ascending order,
4913 * such that for each iterator @p i in the range @p [__first,__last-1),
4914 * @p __comp(*(i+1),*i) is false.
4916 * The relative ordering of equivalent elements is preserved, so any two
4917 * elements @p x and @p y in the range @p [__first,__last) such that
4918 * @p __comp(x,y) is false and @p __comp(y,x) is false will have the same
4919 * relative ordering after calling @p stable_sort().
4921 template<typename _RandomAccessIterator
, typename _Compare
>
4923 stable_sort(_RandomAccessIterator __first
, _RandomAccessIterator __last
,
4926 // concept requirements
4927 __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept
<
4928 _RandomAccessIterator
>)
4929 __glibcxx_function_requires(_BinaryPredicateConcept
<_Compare
,
4930 typename iterator_traits
<_RandomAccessIterator
>::value_type
,
4931 typename iterator_traits
<_RandomAccessIterator
>::value_type
>)
4932 __glibcxx_requires_valid_range(__first
, __last
);
4934 _GLIBCXX_STD_A::__stable_sort(__first
, __last
,
4935 __gnu_cxx::__ops::__iter_comp_iter(__comp
));
4938 template<typename _InputIterator1
, typename _InputIterator2
,
4939 typename _OutputIterator
,
4942 __set_union(_InputIterator1 __first1
, _InputIterator1 __last1
,
4943 _InputIterator2 __first2
, _InputIterator2 __last2
,
4944 _OutputIterator __result
, _Compare __comp
)
4946 while (__first1
!= __last1
&& __first2
!= __last2
)
4948 if (__comp(__first1
, __first2
))
4950 *__result
= *__first1
;
4953 else if (__comp(__first2
, __first1
))
4955 *__result
= *__first2
;
4960 *__result
= *__first1
;
4966 return std::copy(__first2
, __last2
,
4967 std::copy(__first1
, __last1
, __result
));
4971 * @brief Return the union of two sorted ranges.
4972 * @ingroup set_algorithms
4973 * @param __first1 Start of first range.
4974 * @param __last1 End of first range.
4975 * @param __first2 Start of second range.
4976 * @param __last2 End of second range.
4977 * @return End of the output range.
4978 * @ingroup set_algorithms
4980 * This operation iterates over both ranges, copying elements present in
4981 * each range in order to the output range. Iterators increment for each
4982 * range. When the current element of one range is less than the other,
4983 * that element is copied and the iterator advanced. If an element is
4984 * contained in both ranges, the element from the first range is copied and
4985 * both ranges advance. The output range may not overlap either input
4988 template<typename _InputIterator1
, typename _InputIterator2
,
4989 typename _OutputIterator
>
4990 inline _OutputIterator
4991 set_union(_InputIterator1 __first1
, _InputIterator1 __last1
,
4992 _InputIterator2 __first2
, _InputIterator2 __last2
,
4993 _OutputIterator __result
)
4995 // concept requirements
4996 __glibcxx_function_requires(_InputIteratorConcept
<_InputIterator1
>)
4997 __glibcxx_function_requires(_InputIteratorConcept
<_InputIterator2
>)
4998 __glibcxx_function_requires(_OutputIteratorConcept
<_OutputIterator
,
4999 typename iterator_traits
<_InputIterator1
>::value_type
>)
5000 __glibcxx_function_requires(_OutputIteratorConcept
<_OutputIterator
,
5001 typename iterator_traits
<_InputIterator2
>::value_type
>)
5002 __glibcxx_function_requires(_LessThanOpConcept
<
5003 typename iterator_traits
<_InputIterator1
>::value_type
,
5004 typename iterator_traits
<_InputIterator2
>::value_type
>)
5005 __glibcxx_function_requires(_LessThanOpConcept
<
5006 typename iterator_traits
<_InputIterator2
>::value_type
,
5007 typename iterator_traits
<_InputIterator1
>::value_type
>)
5008 __glibcxx_requires_sorted_set(__first1
, __last1
, __first2
);
5009 __glibcxx_requires_sorted_set(__first2
, __last2
, __first1
);
5011 return _GLIBCXX_STD_A::__set_union(__first1
, __last1
,
5012 __first2
, __last2
, __result
,
5013 __gnu_cxx::__ops::__iter_less_iter());
5017 * @brief Return the union of two sorted ranges using a comparison functor.
5018 * @ingroup set_algorithms
5019 * @param __first1 Start of first range.
5020 * @param __last1 End of first range.
5021 * @param __first2 Start of second range.
5022 * @param __last2 End of second range.
5023 * @param __comp The comparison functor.
5024 * @return End of the output range.
5025 * @ingroup set_algorithms
5027 * This operation iterates over both ranges, copying elements present in
5028 * each range in order to the output range. Iterators increment for each
5029 * range. When the current element of one range is less than the other
5030 * according to @p __comp, that element is copied and the iterator advanced.
5031 * If an equivalent element according to @p __comp is contained in both
5032 * ranges, the element from the first range is copied and both ranges
5033 * advance. The output range may not overlap either input range.
5035 template<typename _InputIterator1
, typename _InputIterator2
,
5036 typename _OutputIterator
, typename _Compare
>
5037 inline _OutputIterator
5038 set_union(_InputIterator1 __first1
, _InputIterator1 __last1
,
5039 _InputIterator2 __first2
, _InputIterator2 __last2
,
5040 _OutputIterator __result
, _Compare __comp
)
5042 // concept requirements
5043 __glibcxx_function_requires(_InputIteratorConcept
<_InputIterator1
>)
5044 __glibcxx_function_requires(_InputIteratorConcept
<_InputIterator2
>)
5045 __glibcxx_function_requires(_OutputIteratorConcept
<_OutputIterator
,
5046 typename iterator_traits
<_InputIterator1
>::value_type
>)
5047 __glibcxx_function_requires(_OutputIteratorConcept
<_OutputIterator
,
5048 typename iterator_traits
<_InputIterator2
>::value_type
>)
5049 __glibcxx_function_requires(_BinaryPredicateConcept
<_Compare
,
5050 typename iterator_traits
<_InputIterator1
>::value_type
,
5051 typename iterator_traits
<_InputIterator2
>::value_type
>)
5052 __glibcxx_function_requires(_BinaryPredicateConcept
<_Compare
,
5053 typename iterator_traits
<_InputIterator2
>::value_type
,
5054 typename iterator_traits
<_InputIterator1
>::value_type
>)
5055 __glibcxx_requires_sorted_set_pred(__first1
, __last1
, __first2
, __comp
);
5056 __glibcxx_requires_sorted_set_pred(__first2
, __last2
, __first1
, __comp
);
5058 return _GLIBCXX_STD_A::__set_union(__first1
, __last1
,
5059 __first2
, __last2
, __result
,
5060 __gnu_cxx::__ops::__iter_comp_iter(__comp
));
5063 template<typename _InputIterator1
, typename _InputIterator2
,
5064 typename _OutputIterator
,
5067 __set_intersection(_InputIterator1 __first1
, _InputIterator1 __last1
,
5068 _InputIterator2 __first2
, _InputIterator2 __last2
,
5069 _OutputIterator __result
, _Compare __comp
)
5071 while (__first1
!= __last1
&& __first2
!= __last2
)
5072 if (__comp(__first1
, __first2
))
5074 else if (__comp(__first2
, __first1
))
5078 *__result
= *__first1
;
5087 * @brief Return the intersection of two sorted ranges.
5088 * @ingroup set_algorithms
5089 * @param __first1 Start of first range.
5090 * @param __last1 End of first range.
5091 * @param __first2 Start of second range.
5092 * @param __last2 End of second range.
5093 * @return End of the output range.
5094 * @ingroup set_algorithms
5096 * This operation iterates over both ranges, copying elements present in
5097 * both ranges in order to the output range. Iterators increment for each
5098 * range. When the current element of one range is less than the other,
5099 * that iterator advances. If an element is contained in both ranges, the
5100 * element from the first range is copied and both ranges advance. The
5101 * output range may not overlap either input range.
5103 template<typename _InputIterator1
, typename _InputIterator2
,
5104 typename _OutputIterator
>
5105 inline _OutputIterator
5106 set_intersection(_InputIterator1 __first1
, _InputIterator1 __last1
,
5107 _InputIterator2 __first2
, _InputIterator2 __last2
,
5108 _OutputIterator __result
)
5110 // concept requirements
5111 __glibcxx_function_requires(_InputIteratorConcept
<_InputIterator1
>)
5112 __glibcxx_function_requires(_InputIteratorConcept
<_InputIterator2
>)
5113 __glibcxx_function_requires(_OutputIteratorConcept
<_OutputIterator
,
5114 typename iterator_traits
<_InputIterator1
>::value_type
>)
5115 __glibcxx_function_requires(_LessThanOpConcept
<
5116 typename iterator_traits
<_InputIterator1
>::value_type
,
5117 typename iterator_traits
<_InputIterator2
>::value_type
>)
5118 __glibcxx_function_requires(_LessThanOpConcept
<
5119 typename iterator_traits
<_InputIterator2
>::value_type
,
5120 typename iterator_traits
<_InputIterator1
>::value_type
>)
5121 __glibcxx_requires_sorted_set(__first1
, __last1
, __first2
);
5122 __glibcxx_requires_sorted_set(__first2
, __last2
, __first1
);
5124 return _GLIBCXX_STD_A::__set_intersection(__first1
, __last1
,
5125 __first2
, __last2
, __result
,
5126 __gnu_cxx::__ops::__iter_less_iter());
5130 * @brief Return the intersection of two sorted ranges using comparison
5132 * @ingroup set_algorithms
5133 * @param __first1 Start of first range.
5134 * @param __last1 End of first range.
5135 * @param __first2 Start of second range.
5136 * @param __last2 End of second range.
5137 * @param __comp The comparison functor.
5138 * @return End of the output range.
5139 * @ingroup set_algorithms
5141 * This operation iterates over both ranges, copying elements present in
5142 * both ranges in order to the output range. Iterators increment for each
5143 * range. When the current element of one range is less than the other
5144 * according to @p __comp, that iterator advances. If an element is
5145 * contained in both ranges according to @p __comp, the element from the
5146 * first range is copied and both ranges advance. The output range may not
5147 * overlap either input range.
5149 template<typename _InputIterator1
, typename _InputIterator2
,
5150 typename _OutputIterator
, typename _Compare
>
5151 inline _OutputIterator
5152 set_intersection(_InputIterator1 __first1
, _InputIterator1 __last1
,
5153 _InputIterator2 __first2
, _InputIterator2 __last2
,
5154 _OutputIterator __result
, _Compare __comp
)
5156 // concept requirements
5157 __glibcxx_function_requires(_InputIteratorConcept
<_InputIterator1
>)
5158 __glibcxx_function_requires(_InputIteratorConcept
<_InputIterator2
>)
5159 __glibcxx_function_requires(_OutputIteratorConcept
<_OutputIterator
,
5160 typename iterator_traits
<_InputIterator1
>::value_type
>)
5161 __glibcxx_function_requires(_BinaryPredicateConcept
<_Compare
,
5162 typename iterator_traits
<_InputIterator1
>::value_type
,
5163 typename iterator_traits
<_InputIterator2
>::value_type
>)
5164 __glibcxx_function_requires(_BinaryPredicateConcept
<_Compare
,
5165 typename iterator_traits
<_InputIterator2
>::value_type
,
5166 typename iterator_traits
<_InputIterator1
>::value_type
>)
5167 __glibcxx_requires_sorted_set_pred(__first1
, __last1
, __first2
, __comp
);
5168 __glibcxx_requires_sorted_set_pred(__first2
, __last2
, __first1
, __comp
);
5170 return _GLIBCXX_STD_A::__set_intersection(__first1
, __last1
,
5171 __first2
, __last2
, __result
,
5172 __gnu_cxx::__ops::__iter_comp_iter(__comp
));
5175 template<typename _InputIterator1
, typename _InputIterator2
,
5176 typename _OutputIterator
,
5179 __set_difference(_InputIterator1 __first1
, _InputIterator1 __last1
,
5180 _InputIterator2 __first2
, _InputIterator2 __last2
,
5181 _OutputIterator __result
, _Compare __comp
)
5183 while (__first1
!= __last1
&& __first2
!= __last2
)
5184 if (__comp(__first1
, __first2
))
5186 *__result
= *__first1
;
5190 else if (__comp(__first2
, __first1
))
5197 return std::copy(__first1
, __last1
, __result
);
5201 * @brief Return the difference of two sorted ranges.
5202 * @ingroup set_algorithms
5203 * @param __first1 Start of first range.
5204 * @param __last1 End of first range.
5205 * @param __first2 Start of second range.
5206 * @param __last2 End of second range.
5207 * @return End of the output range.
5208 * @ingroup set_algorithms
5210 * This operation iterates over both ranges, copying elements present in
5211 * the first range but not the second in order to the output range.
5212 * Iterators increment for each range. When the current element of the
5213 * first range is less than the second, that element is copied and the
5214 * iterator advances. If the current element of the second range is less,
5215 * the iterator advances, but no element is copied. If an element is
5216 * contained in both ranges, no elements are copied and both ranges
5217 * advance. The output range may not overlap either input range.
5219 template<typename _InputIterator1
, typename _InputIterator2
,
5220 typename _OutputIterator
>
5221 inline _OutputIterator
5222 set_difference(_InputIterator1 __first1
, _InputIterator1 __last1
,
5223 _InputIterator2 __first2
, _InputIterator2 __last2
,
5224 _OutputIterator __result
)
5226 // concept requirements
5227 __glibcxx_function_requires(_InputIteratorConcept
<_InputIterator1
>)
5228 __glibcxx_function_requires(_InputIteratorConcept
<_InputIterator2
>)
5229 __glibcxx_function_requires(_OutputIteratorConcept
<_OutputIterator
,
5230 typename iterator_traits
<_InputIterator1
>::value_type
>)
5231 __glibcxx_function_requires(_LessThanOpConcept
<
5232 typename iterator_traits
<_InputIterator1
>::value_type
,
5233 typename iterator_traits
<_InputIterator2
>::value_type
>)
5234 __glibcxx_function_requires(_LessThanOpConcept
<
5235 typename iterator_traits
<_InputIterator2
>::value_type
,
5236 typename iterator_traits
<_InputIterator1
>::value_type
>)
5237 __glibcxx_requires_sorted_set(__first1
, __last1
, __first2
);
5238 __glibcxx_requires_sorted_set(__first2
, __last2
, __first1
);
5240 return _GLIBCXX_STD_A::__set_difference(__first1
, __last1
,
5241 __first2
, __last2
, __result
,
5242 __gnu_cxx::__ops::__iter_less_iter());
5246 * @brief Return the difference of two sorted ranges using comparison
5248 * @ingroup set_algorithms
5249 * @param __first1 Start of first range.
5250 * @param __last1 End of first range.
5251 * @param __first2 Start of second range.
5252 * @param __last2 End of second range.
5253 * @param __comp The comparison functor.
5254 * @return End of the output range.
5255 * @ingroup set_algorithms
5257 * This operation iterates over both ranges, copying elements present in
5258 * the first range but not the second in order to the output range.
5259 * Iterators increment for each range. When the current element of the
5260 * first range is less than the second according to @p __comp, that element
5261 * is copied and the iterator advances. If the current element of the
5262 * second range is less, no element is copied and the iterator advances.
5263 * If an element is contained in both ranges according to @p __comp, no
5264 * elements are copied and both ranges advance. The output range may not
5265 * overlap either input range.
5267 template<typename _InputIterator1
, typename _InputIterator2
,
5268 typename _OutputIterator
, typename _Compare
>
5269 inline _OutputIterator
5270 set_difference(_InputIterator1 __first1
, _InputIterator1 __last1
,
5271 _InputIterator2 __first2
, _InputIterator2 __last2
,
5272 _OutputIterator __result
, _Compare __comp
)
5274 // concept requirements
5275 __glibcxx_function_requires(_InputIteratorConcept
<_InputIterator1
>)
5276 __glibcxx_function_requires(_InputIteratorConcept
<_InputIterator2
>)
5277 __glibcxx_function_requires(_OutputIteratorConcept
<_OutputIterator
,
5278 typename iterator_traits
<_InputIterator1
>::value_type
>)
5279 __glibcxx_function_requires(_BinaryPredicateConcept
<_Compare
,
5280 typename iterator_traits
<_InputIterator1
>::value_type
,
5281 typename iterator_traits
<_InputIterator2
>::value_type
>)
5282 __glibcxx_function_requires(_BinaryPredicateConcept
<_Compare
,
5283 typename iterator_traits
<_InputIterator2
>::value_type
,
5284 typename iterator_traits
<_InputIterator1
>::value_type
>)
5285 __glibcxx_requires_sorted_set_pred(__first1
, __last1
, __first2
, __comp
);
5286 __glibcxx_requires_sorted_set_pred(__first2
, __last2
, __first1
, __comp
);
5288 return _GLIBCXX_STD_A::__set_difference(__first1
, __last1
,
5289 __first2
, __last2
, __result
,
5290 __gnu_cxx::__ops::__iter_comp_iter(__comp
));
5293 template<typename _InputIterator1
, typename _InputIterator2
,
5294 typename _OutputIterator
,
5297 __set_symmetric_difference(_InputIterator1 __first1
,
5298 _InputIterator1 __last1
,
5299 _InputIterator2 __first2
,
5300 _InputIterator2 __last2
,
5301 _OutputIterator __result
,
5304 while (__first1
!= __last1
&& __first2
!= __last2
)
5305 if (__comp(__first1
, __first2
))
5307 *__result
= *__first1
;
5311 else if (__comp(__first2
, __first1
))
5313 *__result
= *__first2
;
5322 return std::copy(__first2
, __last2
,
5323 std::copy(__first1
, __last1
, __result
));
5327 * @brief Return the symmetric difference of two sorted ranges.
5328 * @ingroup set_algorithms
5329 * @param __first1 Start of first range.
5330 * @param __last1 End of first range.
5331 * @param __first2 Start of second range.
5332 * @param __last2 End of second range.
5333 * @return End of the output range.
5334 * @ingroup set_algorithms
5336 * This operation iterates over both ranges, copying elements present in
5337 * one range but not the other in order to the output range. Iterators
5338 * increment for each range. When the current element of one range is less
5339 * than the other, that element is copied and the iterator advances. If an
5340 * element is contained in both ranges, no elements are copied and both
5341 * ranges advance. The output range may not overlap either input range.
5343 template<typename _InputIterator1
, typename _InputIterator2
,
5344 typename _OutputIterator
>
5345 inline _OutputIterator
5346 set_symmetric_difference(_InputIterator1 __first1
, _InputIterator1 __last1
,
5347 _InputIterator2 __first2
, _InputIterator2 __last2
,
5348 _OutputIterator __result
)
5350 // concept requirements
5351 __glibcxx_function_requires(_InputIteratorConcept
<_InputIterator1
>)
5352 __glibcxx_function_requires(_InputIteratorConcept
<_InputIterator2
>)
5353 __glibcxx_function_requires(_OutputIteratorConcept
<_OutputIterator
,
5354 typename iterator_traits
<_InputIterator1
>::value_type
>)
5355 __glibcxx_function_requires(_OutputIteratorConcept
<_OutputIterator
,
5356 typename iterator_traits
<_InputIterator2
>::value_type
>)
5357 __glibcxx_function_requires(_LessThanOpConcept
<
5358 typename iterator_traits
<_InputIterator1
>::value_type
,
5359 typename iterator_traits
<_InputIterator2
>::value_type
>)
5360 __glibcxx_function_requires(_LessThanOpConcept
<
5361 typename iterator_traits
<_InputIterator2
>::value_type
,
5362 typename iterator_traits
<_InputIterator1
>::value_type
>)
5363 __glibcxx_requires_sorted_set(__first1
, __last1
, __first2
);
5364 __glibcxx_requires_sorted_set(__first2
, __last2
, __first1
);
5366 return _GLIBCXX_STD_A::__set_symmetric_difference(__first1
, __last1
,
5367 __first2
, __last2
, __result
,
5368 __gnu_cxx::__ops::__iter_less_iter());
5372 * @brief Return the symmetric difference of two sorted ranges using
5373 * comparison functor.
5374 * @ingroup set_algorithms
5375 * @param __first1 Start of first range.
5376 * @param __last1 End of first range.
5377 * @param __first2 Start of second range.
5378 * @param __last2 End of second range.
5379 * @param __comp The comparison functor.
5380 * @return End of the output range.
5381 * @ingroup set_algorithms
5383 * This operation iterates over both ranges, copying elements present in
5384 * one range but not the other in order to the output range. Iterators
5385 * increment for each range. When the current element of one range is less
5386 * than the other according to @p comp, that element is copied and the
5387 * iterator advances. If an element is contained in both ranges according
5388 * to @p __comp, no elements are copied and both ranges advance. The output
5389 * range may not overlap either input range.
5391 template<typename _InputIterator1
, typename _InputIterator2
,
5392 typename _OutputIterator
, typename _Compare
>
5393 inline _OutputIterator
5394 set_symmetric_difference(_InputIterator1 __first1
, _InputIterator1 __last1
,
5395 _InputIterator2 __first2
, _InputIterator2 __last2
,
5396 _OutputIterator __result
,
5399 // concept requirements
5400 __glibcxx_function_requires(_InputIteratorConcept
<_InputIterator1
>)
5401 __glibcxx_function_requires(_InputIteratorConcept
<_InputIterator2
>)
5402 __glibcxx_function_requires(_OutputIteratorConcept
<_OutputIterator
,
5403 typename iterator_traits
<_InputIterator1
>::value_type
>)
5404 __glibcxx_function_requires(_OutputIteratorConcept
<_OutputIterator
,
5405 typename iterator_traits
<_InputIterator2
>::value_type
>)
5406 __glibcxx_function_requires(_BinaryPredicateConcept
<_Compare
,
5407 typename iterator_traits
<_InputIterator1
>::value_type
,
5408 typename iterator_traits
<_InputIterator2
>::value_type
>)
5409 __glibcxx_function_requires(_BinaryPredicateConcept
<_Compare
,
5410 typename iterator_traits
<_InputIterator2
>::value_type
,
5411 typename iterator_traits
<_InputIterator1
>::value_type
>)
5412 __glibcxx_requires_sorted_set_pred(__first1
, __last1
, __first2
, __comp
);
5413 __glibcxx_requires_sorted_set_pred(__first2
, __last2
, __first1
, __comp
);
5415 return _GLIBCXX_STD_A::__set_symmetric_difference(__first1
, __last1
,
5416 __first2
, __last2
, __result
,
5417 __gnu_cxx::__ops::__iter_comp_iter(__comp
));
5420 template<typename _ForwardIterator
, typename _Compare
>
5421 _GLIBCXX14_CONSTEXPR
5423 __min_element(_ForwardIterator __first
, _ForwardIterator __last
,
5426 if (__first
== __last
)
5428 _ForwardIterator __result
= __first
;
5429 while (++__first
!= __last
)
5430 if (__comp(__first
, __result
))
5436 * @brief Return the minimum element in a range.
5437 * @ingroup sorting_algorithms
5438 * @param __first Start of range.
5439 * @param __last End of range.
5440 * @return Iterator referencing the first instance of the smallest value.
5442 template<typename _ForwardIterator
>
5443 _GLIBCXX14_CONSTEXPR
5445 inline min_element(_ForwardIterator __first
, _ForwardIterator __last
)
5447 // concept requirements
5448 __glibcxx_function_requires(_ForwardIteratorConcept
<_ForwardIterator
>)
5449 __glibcxx_function_requires(_LessThanComparableConcept
<
5450 typename iterator_traits
<_ForwardIterator
>::value_type
>)
5451 __glibcxx_requires_valid_range(__first
, __last
);
5453 return _GLIBCXX_STD_A::__min_element(__first
, __last
,
5454 __gnu_cxx::__ops::__iter_less_iter());
5458 * @brief Return the minimum element in a range using comparison functor.
5459 * @ingroup sorting_algorithms
5460 * @param __first Start of range.
5461 * @param __last End of range.
5462 * @param __comp Comparison functor.
5463 * @return Iterator referencing the first instance of the smallest value
5464 * according to __comp.
5466 template<typename _ForwardIterator
, typename _Compare
>
5467 _GLIBCXX14_CONSTEXPR
5468 inline _ForwardIterator
5469 min_element(_ForwardIterator __first
, _ForwardIterator __last
,
5472 // concept requirements
5473 __glibcxx_function_requires(_ForwardIteratorConcept
<_ForwardIterator
>)
5474 __glibcxx_function_requires(_BinaryPredicateConcept
<_Compare
,
5475 typename iterator_traits
<_ForwardIterator
>::value_type
,
5476 typename iterator_traits
<_ForwardIterator
>::value_type
>)
5477 __glibcxx_requires_valid_range(__first
, __last
);
5479 return _GLIBCXX_STD_A::__min_element(__first
, __last
,
5480 __gnu_cxx::__ops::__iter_comp_iter(__comp
));
5483 template<typename _ForwardIterator
, typename _Compare
>
5484 _GLIBCXX14_CONSTEXPR
5486 __max_element(_ForwardIterator __first
, _ForwardIterator __last
,
5489 if (__first
== __last
) return __first
;
5490 _ForwardIterator __result
= __first
;
5491 while (++__first
!= __last
)
5492 if (__comp(__result
, __first
))
5498 * @brief Return the maximum element in a range.
5499 * @ingroup sorting_algorithms
5500 * @param __first Start of range.
5501 * @param __last End of range.
5502 * @return Iterator referencing the first instance of the largest value.
5504 template<typename _ForwardIterator
>
5505 _GLIBCXX14_CONSTEXPR
5506 inline _ForwardIterator
5507 max_element(_ForwardIterator __first
, _ForwardIterator __last
)
5509 // concept requirements
5510 __glibcxx_function_requires(_ForwardIteratorConcept
<_ForwardIterator
>)
5511 __glibcxx_function_requires(_LessThanComparableConcept
<
5512 typename iterator_traits
<_ForwardIterator
>::value_type
>)
5513 __glibcxx_requires_valid_range(__first
, __last
);
5515 return _GLIBCXX_STD_A::__max_element(__first
, __last
,
5516 __gnu_cxx::__ops::__iter_less_iter());
5520 * @brief Return the maximum element in a range using comparison functor.
5521 * @ingroup sorting_algorithms
5522 * @param __first Start of range.
5523 * @param __last End of range.
5524 * @param __comp Comparison functor.
5525 * @return Iterator referencing the first instance of the largest value
5526 * according to __comp.
5528 template<typename _ForwardIterator
, typename _Compare
>
5529 _GLIBCXX14_CONSTEXPR
5530 inline _ForwardIterator
5531 max_element(_ForwardIterator __first
, _ForwardIterator __last
,
5534 // concept requirements
5535 __glibcxx_function_requires(_ForwardIteratorConcept
<_ForwardIterator
>)
5536 __glibcxx_function_requires(_BinaryPredicateConcept
<_Compare
,
5537 typename iterator_traits
<_ForwardIterator
>::value_type
,
5538 typename iterator_traits
<_ForwardIterator
>::value_type
>)
5539 __glibcxx_requires_valid_range(__first
, __last
);
5541 return _GLIBCXX_STD_A::__max_element(__first
, __last
,
5542 __gnu_cxx::__ops::__iter_comp_iter(__comp
));
5545 _GLIBCXX_END_NAMESPACE_ALGO
5548 #endif /* _STL_ALGO_H */