libstdc++
|
![]() |
Modules | |
Binary Search | |
Heap | |
Set Operation | |
Functions | |
template<typename _BidirectionalIterator > | |
void | std::inplace_merge (_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last) |
template<typename _BidirectionalIterator , typename _Compare > | |
void | std::inplace_merge (_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, _Compare __comp) |
template<typename _ForwardIterator > | |
bool | std::is_sorted (_ForwardIterator __first, _ForwardIterator __last) |
template<typename _ForwardIterator , typename _Compare > | |
bool | std::is_sorted (_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) |
template<typename _ForwardIterator > | |
_ForwardIterator | std::is_sorted_until (_ForwardIterator __first, _ForwardIterator __last) |
template<typename _ForwardIterator , typename _Compare > | |
_ForwardIterator | std::is_sorted_until (_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) |
template<typename _II1 , typename _II2 > | |
bool | std::lexicographical_compare (_II1 __first1, _II1 __last1, _II2 __first2, _II2 __last2) |
template<typename _II1 , typename _II2 , typename _Compare > | |
bool | std::lexicographical_compare (_II1 __first1, _II1 __last1, _II2 __first2, _II2 __last2, _Compare __comp) |
template<typename _Tp > | |
const _Tp & | std::max (const _Tp &__a, const _Tp &__b) |
template<typename _Tp , typename _Compare > | |
const _Tp & | std::max (const _Tp &__a, const _Tp &__b, _Compare __comp) |
template<typename _ForwardIterator > | |
_ForwardIterator | std::max_element (_ForwardIterator __first, _ForwardIterator __last) |
template<typename _ForwardIterator , typename _Compare > | |
_ForwardIterator | std::max_element (_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) |
template<typename _InputIterator1 , typename _InputIterator2 , typename _OutputIterator > | |
_OutputIterator | std::merge (_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) |
template<typename _InputIterator1 , typename _InputIterator2 , typename _OutputIterator , typename _Compare > | |
_OutputIterator | std::merge (_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) |
template<typename _Tp > | |
const _Tp & | std::min (const _Tp &__a, const _Tp &__b) |
template<typename _Tp , typename _Compare > | |
const _Tp & | std::min (const _Tp &__a, const _Tp &__b, _Compare __comp) |
template<typename _ForwardIterator > | |
_ForwardIterator | std::min_element (_ForwardIterator __first, _ForwardIterator __last) |
template<typename _ForwardIterator , typename _Compare > | |
_ForwardIterator | std::min_element (_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) |
template<typename _Tp > | |
pair< const _Tp &, const _Tp & > | std::minmax (const _Tp &__a, const _Tp &__b) |
template<typename _Tp , typename _Compare > | |
pair< const _Tp &, const _Tp & > | std::minmax (const _Tp &__a, const _Tp &__b, _Compare __comp) |
template<typename _ForwardIterator > | |
pair< _ForwardIterator, _ForwardIterator > | std::minmax_element (_ForwardIterator __first, _ForwardIterator __last) |
template<typename _ForwardIterator , typename _Compare > | |
pair< _ForwardIterator, _ForwardIterator > | std::minmax_element (_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) |
template<typename _BidirectionalIterator > | |
bool | std::next_permutation (_BidirectionalIterator __first, _BidirectionalIterator __last) |
template<typename _BidirectionalIterator , typename _Compare > | |
bool | std::next_permutation (_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) |
template<typename _RandomAccessIterator > | |
void | std::nth_element (_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last) |
template<typename _RandomAccessIterator , typename _Compare > | |
void | std::nth_element (_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp) |
template<typename _RandomAccessIterator > | |
void | std::partial_sort (_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last) |
template<typename _RandomAccessIterator , typename _Compare > | |
void | std::partial_sort (_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, _Compare __comp) |
template<typename _InputIterator , typename _RandomAccessIterator > | |
_RandomAccessIterator | std::partial_sort_copy (_InputIterator __first, _InputIterator __last, _RandomAccessIterator __result_first, _RandomAccessIterator __result_last) |
template<typename _InputIterator , typename _RandomAccessIterator , typename _Compare > | |
_RandomAccessIterator | std::partial_sort_copy (_InputIterator __first, _InputIterator __last, _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp) |
template<typename _BidirectionalIterator > | |
bool | std::prev_permutation (_BidirectionalIterator __first, _BidirectionalIterator __last) |
template<typename _BidirectionalIterator , typename _Compare > | |
bool | std::prev_permutation (_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) |
template<typename _RandomAccessIterator > | |
void | std::sort (_RandomAccessIterator __first, _RandomAccessIterator __last) |
template<typename _RandomAccessIterator , typename _Compare > | |
void | std::sort (_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) |
template<typename _RandomAccessIterator > | |
void | std::stable_sort (_RandomAccessIterator __first, _RandomAccessIterator __last) |
template<typename _RandomAccessIterator , typename _Compare > | |
void | std::stable_sort (_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) |
void std::inplace_merge | ( | _BidirectionalIterator | __first, |
_BidirectionalIterator | __middle, | ||
_BidirectionalIterator | __last | ||
) |
Merges two sorted ranges in place.
first | An iterator. |
middle | Another iterator. |
last | Another iterator. |
Merges two sorted and consecutive ranges, [first,middle) and [middle,last), and puts the result in [first,last). The output will be sorted. The sort is stable, that is, for equivalent elements in the two ranges, elements from the first range will always come before elements from the second.
If enough additional memory is available, this takes (last-first)-1 comparisons. Otherwise an NlogN algorithm is used, where N is distance(first,last).
Definition at line 3123 of file stl_algo.h.
References std::__merge_adaptive(), std::__merge_without_buffer(), std::_Temporary_buffer< _ForwardIterator, _Tp >::begin(), std::distance(), and std::_Temporary_buffer< _ForwardIterator, _Tp >::size().
void std::inplace_merge | ( | _BidirectionalIterator | __first, |
_BidirectionalIterator | __middle, | ||
_BidirectionalIterator | __last, | ||
_Compare | __comp | ||
) |
Merges two sorted ranges in place.
first | An iterator. |
middle | Another iterator. |
last | Another iterator. |
comp | A functor to use for comparisons. |
Merges two sorted and consecutive ranges, [first,middle) and [middle,last), and puts the result in [first,last). The output will be sorted. The sort is stable, that is, for equivalent elements in the two ranges, elements from the first range will always come before elements from the second.
If enough additional memory is available, this takes (last-first)-1 comparisons. Otherwise an NlogN algorithm is used, where N is distance(first,last).
The comparison function should have the same effects on ordering as the function used for the initial sort.
Definition at line 3178 of file stl_algo.h.
References std::__merge_adaptive(), std::__merge_without_buffer(), std::_Temporary_buffer< _ForwardIterator, _Tp >::begin(), std::distance(), and std::_Temporary_buffer< _ForwardIterator, _Tp >::size().
|
inline |
Determines whether the elements of a sequence are sorted.
first | An iterator. |
last | Another iterator. |
Definition at line 3918 of file stl_algo.h.
References std::is_sorted_until().
|
inline |
Determines whether the elements of a sequence are sorted according to a comparison functor.
first | An iterator. |
last | Another iterator. |
comp | A comparison functor. |
Definition at line 3932 of file stl_algo.h.
References std::is_sorted_until().
_ForwardIterator std::is_sorted_until | ( | _ForwardIterator | __first, |
_ForwardIterator | __last | ||
) |
Determines the end of a sorted sequence.
first | An iterator. |
last | Another iterator. |
Definition at line 3946 of file stl_algo.h.
_ForwardIterator std::is_sorted_until | ( | _ForwardIterator | __first, |
_ForwardIterator | __last, | ||
_Compare | __comp | ||
) |
Determines the end of a sorted sequence using comparison functor.
first | An iterator. |
last | Another iterator. |
comp | A comparison functor. |
Definition at line 3975 of file stl_algo.h.
Referenced by std::is_sorted().
|
inline |
Performs dictionary comparison on ranges.
first1 | An input iterator. |
last1 | An input iterator. |
first2 | An input iterator. |
last2 | An input iterator. |
Returns true if the sequence of elements defined by the range [first1,last1) is lexicographically less than the sequence of elements defined by the range [first2,last2). Returns false otherwise. (Quoted from [25.3.8]/1.) If the iterators are all character pointers, then this is an inline call to memcmp
.
Definition at line 1073 of file stl_algobase.h.
bool std::lexicographical_compare | ( | _II1 | __first1, |
_II1 | __last1, | ||
_II2 | __first2, | ||
_II2 | __last2, | ||
_Compare | __comp | ||
) |
Performs dictionary comparison on ranges.
first1 | An input iterator. |
last1 | An input iterator. |
first2 | An input iterator. |
last2 | An input iterator. |
comp | A comparison functor. |
The same as the four-parameter lexicographical_compare
, but uses the comp parameter instead of <
.
Definition at line 1107 of file stl_algobase.h.
Referenced by std::operator<().
|
inline |
This does what you think it does.
a | A thing of arbitrary type. |
b | Another thing of arbitrary type. |
This is the simple classic generic implementation. It will work on temporary expressions, since they are only evaluated once, unlike a preprocessor macro.
Definition at line 210 of file stl_algobase.h.
Referenced by __gnu_parallel::__parallel_nth_element(), std::_Deque_base< _Tp, _Alloc >::_M_initialize_map(), std::deque< _Tp, _Alloc >::_M_reallocate_map(), std::discard_block_engine< _RandomNumberEngine, __p, __r >::max(), std::shuffle_order_engine< _RandomNumberEngine, __k >::max(), __gnu_parallel::multiseq_partition(), __gnu_parallel::multiseq_selection(), and std::basic_stringbuf< _CharT, _Traits, _Alloc >::overflow().
|
inline |
This does what you think it does.
a | A thing of arbitrary type. |
b | Another thing of arbitrary type. |
comp | A comparison functor. |
This will work on temporary expressions, since they are only evaluated once, unlike a preprocessor macro.
Definition at line 254 of file stl_algobase.h.
_ForwardIterator std::max_element | ( | _ForwardIterator | __first, |
_ForwardIterator | __last | ||
) |
Return the maximum element in a range.
first | Start of range. |
last | End of range. |
Definition at line 6230 of file stl_algo.h.
_ForwardIterator std::max_element | ( | _ForwardIterator | __first, |
_ForwardIterator | __last, | ||
_Compare | __comp | ||
) |
Return the maximum element in a range using comparison functor.
first | Start of range. |
last | End of range. |
comp | Comparison functor. |
Definition at line 6258 of file stl_algo.h.
Referenced by std::valarray< _Tp >::max().
_OutputIterator std::merge | ( | _InputIterator1 | __first1, |
_InputIterator1 | __last1, | ||
_InputIterator2 | __first2, | ||
_InputIterator2 | __last2, | ||
_OutputIterator | __result | ||
) |
Merges two sorted ranges.
first1 | An iterator. |
first2 | Another iterator. |
last1 | Another iterator. |
last2 | Another iterator. |
result | An iterator pointing to the end of the merged range. |
Merges the ranges [first1,last1) and [first2,last2) into the sorted range [result, result + (last1-first1) + (last2-first2)). Both input ranges must be sorted, and the output range must not overlap with either of the input ranges. The sort is stable, that is, for equivalent elements in the two ranges, elements from the first range will always come before elements from the second.
Definition at line 5473 of file stl_algo.h.
_OutputIterator std::merge | ( | _InputIterator1 | __first1, |
_InputIterator1 | __last1, | ||
_InputIterator2 | __first2, | ||
_InputIterator2 | __last2, | ||
_OutputIterator | __result, | ||
_Compare | __comp | ||
) |
Merges two sorted ranges.
first1 | An iterator. |
first2 | Another iterator. |
last1 | Another iterator. |
last2 | Another iterator. |
result | An iterator pointing to the end of the merged range. |
comp | A functor to use for comparisons. |
Merges the ranges [first1,last1) and [first2,last2) into the sorted range [result, result + (last1-first1) + (last2-first2)). Both input ranges must be sorted, and the output range must not overlap with either of the input ranges. The sort is stable, that is, for equivalent elements in the two ranges, elements from the first range will always come before elements from the second.
The comparison function should have the same effects on ordering as the function used for the initial sort.
Definition at line 5536 of file stl_algo.h.
|
inline |
This does what you think it does.
a | A thing of arbitrary type. |
b | Another thing of arbitrary type. |
This is the simple classic generic implementation. It will work on temporary expressions, since they are only evaluated once, unlike a preprocessor macro.
Definition at line 187 of file stl_algobase.h.
Referenced by __gnu_parallel::__parallel_random_shuffle_drs(), __gnu_parallel::__parallel_sort_qs_divide(), __gnu_profile::__report(), __gnu_parallel::__search_template(), __gnu_parallel::__sequential_random_shuffle(), __gnu_cxx::__versa_string< _CharT, _Traits, _Alloc, _Base >::compare(), std::basic_string< char >::compare(), std::basic_string< _CharT, _Traits, _Alloc >::compare(), std::generate_canonical(), std::discard_block_engine< _RandomNumberEngine, __p, __r >::min(), std::shuffle_order_engine< _RandomNumberEngine, __k >::min(), __gnu_parallel::multiseq_partition(), __gnu_parallel::multiseq_selection(), std::basic_stringbuf< _CharT, _Traits, _Alloc >::overflow(), __gnu_cxx::random_sample_n(), std::basic_istream< _CharT, _Traits >::readsome(), __gnu_cxx::__versa_string< _CharT, _Traits, _Alloc, _Base >::rfind(), std::basic_string< _CharT, _Traits, _Alloc >::rfind(), std::basic_filebuf< _CharT, _Traits >::underflow(), std::basic_streambuf< _CharT, _Traits >::xsgetn(), std::basic_filebuf< _CharT, _Traits >::xsputn(), and std::basic_streambuf< _CharT, _Traits >::xsputn().
|
inline |
This does what you think it does.
a | A thing of arbitrary type. |
b | Another thing of arbitrary type. |
comp | A comparison functor. |
This will work on temporary expressions, since they are only evaluated once, unlike a preprocessor macro.
Definition at line 233 of file stl_algobase.h.
_ForwardIterator std::min_element | ( | _ForwardIterator | __first, |
_ForwardIterator | __last | ||
) |
Return the minimum element in a range.
first | Start of range. |
last | End of range. |
Definition at line 6174 of file stl_algo.h.
_ForwardIterator std::min_element | ( | _ForwardIterator | __first, |
_ForwardIterator | __last, | ||
_Compare | __comp | ||
) |
Return the minimum element in a range using comparison functor.
first | Start of range. |
last | End of range. |
comp | Comparison functor. |
Definition at line 6202 of file stl_algo.h.
Referenced by std::valarray< _Tp >::min().
|
inline |
Determines min and max at once as an ordered pair.
a | A thing of arbitrary type. |
b | Another thing of arbitrary type. |
Definition at line 4004 of file stl_algo.h.
|
inline |
Determines min and max at once as an ordered pair.
a | A thing of arbitrary type. |
b | Another thing of arbitrary type. |
comp | A comparison functor. |
Definition at line 4023 of file stl_algo.h.
pair<_ForwardIterator, _ForwardIterator> std::minmax_element | ( | _ForwardIterator | __first, |
_ForwardIterator | __last | ||
) |
Return a pair of iterators pointing to the minimum and maximum elements in a range.
first | Start of range. |
last | End of range. |
Definition at line 4042 of file stl_algo.h.
References std::make_pair().
pair<_ForwardIterator, _ForwardIterator> std::minmax_element | ( | _ForwardIterator | __first, |
_ForwardIterator | __last, | ||
_Compare | __comp | ||
) |
Return a pair of iterators pointing to the minimum and maximum elements in a range.
first | Start of range. |
last | End of range. |
comp | Comparison functor. |
Definition at line 4118 of file stl_algo.h.
References std::make_pair().
bool std::next_permutation | ( | _BidirectionalIterator | __first, |
_BidirectionalIterator | __last | ||
) |
Permute range into the next dictionary ordering.
first | Start of range. |
last | End of range. |
Treats all permutations of the range as a set of dictionary sorted sequences. Permutes the current sequence into the next one of this set. Returns true if there are more sequences to generate. If the sequence is the largest of the set, the smallest is generated and false returned.
Definition at line 3620 of file stl_algo.h.
References std::iter_swap(), and std::reverse().
bool std::next_permutation | ( | _BidirectionalIterator | __first, |
_BidirectionalIterator | __last, | ||
_Compare | __comp | ||
) |
Permute range into the next dictionary ordering using comparison functor.
first | Start of range. |
last | End of range. |
comp | A comparison functor. |
Treats all permutations of the range [first,last) as a set of dictionary sorted sequences ordered by comp. Permutes the current sequence into the next one of this set. Returns true if there are more sequences to generate. If the sequence is the largest of the set, the smallest is generated and false returned.
Definition at line 3677 of file stl_algo.h.
References std::iter_swap(), and std::reverse().
|
inline |
Sort a sequence just enough to find a particular position.
first | An iterator. |
nth | Another iterator. |
last | Another iterator. |
Rearranges the elements in the range [first,last) so that
*nth
is the same element that would have been in that position had the whole sequence been sorted. whole sequence been sorted. The elements either side of *nth
are not completely sorted, but for any iterator in the range [first,nth) and any iterator in the range
[nth,last) it holds that
*j<*i
is false.
Definition at line 5318 of file stl_algo.h.
References std::__lg().
|
inline |
Sort a sequence just enough to find a particular position using a predicate for comparison.
first | An iterator. |
nth | Another iterator. |
last | Another iterator. |
comp | A comparison functor. |
Rearranges the elements in the range [first,last) so that
*nth
is the same element that would have been in that position had the whole sequence been sorted. The elements either side of *nth
are not completely sorted, but for any iterator in the range [first,nth) and any iterator in the range
[nth,last) it holds that
comp(*j,*i)
is false.
Definition at line 5357 of file stl_algo.h.
References std::__lg().
|
inline |
Sort the smallest elements of a sequence.
first | An iterator. |
middle | Another iterator. |
last | Another iterator. |
Sorts the smallest (middle-first) elements in the range
[first,last) and moves them to the range
[first,middle). The order of the remaining elements in the range
[middle,last) is undefined. After the sort if
i
and are iterators in the range [first,middle) such that precedes and is an iterator in the range
[middle,last) then
*j<*i
and *k<*i
are both false.
Definition at line 5241 of file stl_algo.h.
References std::__heap_select(), and std::sort_heap().
|
inline |
Sort the smallest elements of a sequence using a predicate for comparison.
first | An iterator. |
middle | Another iterator. |
last | Another iterator. |
comp | A comparison functor. |
Sorts the smallest (middle-first) elements in the range
[first,last) and moves them to the range
[first,middle). The order of the remaining elements in the range
[middle,last) is undefined. After the sort if
i
and are iterators in the range [first,middle) such that precedes and is an iterator in the range
[middle,last) then
*comp
(j,*i) and comp(*k,*i)
are both false.
Definition at line 5280 of file stl_algo.h.
References std::__heap_select(), and std::sort_heap().
_RandomAccessIterator std::partial_sort_copy | ( | _InputIterator | __first, |
_InputIterator | __last, | ||
_RandomAccessIterator | __result_first, | ||
_RandomAccessIterator | __result_last | ||
) |
Copy the smallest elements of a sequence.
first | An iterator. |
last | Another iterator. |
result_first | A random-access iterator. |
result_last | Another random-access iterator. |
Copies and sorts the smallest N values from the range [first,last) to the range beginning at
result_first
, where the number of elements to be copied, N
, is the smaller of (last-first) and
(result_last-result_first). After the sort if
i
and are iterators in the range [result_first,result_first+N) such that precedes then
*j<*i
is false. The value returned is result_first+N
.
Definition at line 1945 of file stl_algo.h.
References std::make_heap(), and std::sort_heap().
_RandomAccessIterator std::partial_sort_copy | ( | _InputIterator | __first, |
_InputIterator | __last, | ||
_RandomAccessIterator | __result_first, | ||
_RandomAccessIterator | __result_last, | ||
_Compare | __comp | ||
) |
Copy the smallest elements of a sequence using a predicate for comparison.
first | An input iterator. |
last | Another input iterator. |
result_first | A random-access iterator. |
result_last | Another random-access iterator. |
comp | A comparison functor. |
Copies and sorts the smallest N values from the range [first,last) to the range beginning at
result_first
, where the number of elements to be copied, N
, is the smaller of (last-first) and
(result_last-result_first). After the sort if
i
and are iterators in the range [result_first,result_first+N) such that precedes then
comp(*j,*i)
is false. The value returned is result_first+N
.
Definition at line 2011 of file stl_algo.h.
References std::make_heap(), and std::sort_heap().
bool std::prev_permutation | ( | _BidirectionalIterator | __first, |
_BidirectionalIterator | __last | ||
) |
Permute range into the previous dictionary ordering.
first | Start of range. |
last | End of range. |
Treats all permutations of the range as a set of dictionary sorted sequences. Permutes the current sequence into the previous one of this set. Returns true if there are more sequences to generate. If the sequence is the smallest of the set, the largest is generated and false returned.
Definition at line 3733 of file stl_algo.h.
References std::iter_swap(), and std::reverse().
bool std::prev_permutation | ( | _BidirectionalIterator | __first, |
_BidirectionalIterator | __last, | ||
_Compare | __comp | ||
) |
Permute range into the previous dictionary ordering using comparison functor.
first | Start of range. |
last | End of range. |
comp | A comparison functor. |
Treats all permutations of the range [first,last) as a set of dictionary sorted sequences ordered by comp. Permutes the current sequence into the previous one of this set. Returns true if there are more sequences to generate. If the sequence is the smallest of the set, the largest is generated and false returned.
Definition at line 3790 of file stl_algo.h.
References std::iter_swap(), and std::reverse().
|
inline |
Sort the elements of a sequence.
first | An iterator. |
last | Another iterator. |
Sorts the elements in the range [first,last) in ascending order, such that
*
(i+1)<*i is false for each iterator i
in the range [first,last-1).
The relative ordering of equivalent elements is not preserved, use stable_sort()
if this is needed.
Definition at line 5395 of file stl_algo.h.
References std::__final_insertion_sort(), std::__introsort_loop(), and std::__lg().
|
inline |
Sort the elements of a sequence using a predicate for comparison.
first | An iterator. |
last | Another iterator. |
comp | A comparison functor. |
Sorts the elements in the range [first,last) in ascending order, such that
comp
(*(i+1),*i) is false for every iterator i
in the range [first,last-1).
The relative ordering of equivalent elements is not preserved, use stable_sort()
if this is needed.
Definition at line 5431 of file stl_algo.h.
References std::__final_insertion_sort(), std::__introsort_loop(), and std::__lg().
|
inline |
Sort the elements of a sequence, preserving the relative order of equivalent elements.
first | An iterator. |
last | Another iterator. |
Sorts the elements in the range [first,last) in ascending order, such that
*
(i+1)<*i is false for each iterator i
in the range [first,last-1).
The relative ordering of equivalent elements is preserved, so any two elements x
and y
in the range [first,last) such that
x<y
is false and y<x
is false will have the same relative ordering after calling stable_sort()
.
Definition at line 5595 of file stl_algo.h.
References std::__inplace_stable_sort(), std::_Temporary_buffer< _ForwardIterator, _Tp >::begin(), and std::_Temporary_buffer< _ForwardIterator, _Tp >::size().
|
inline |
Sort the elements of a sequence using a predicate for comparison, preserving the relative order of equivalent elements.
first | An iterator. |
last | Another iterator. |
comp | A comparison functor. |
Sorts the elements in the range [first,last) in ascending order, such that
comp
(*(i+1),*i) is false for each iterator i
in the range [first,last-1).
The relative ordering of equivalent elements is preserved, so any two elements x
and y
in the range [first,last) such that
comp(x,y)
is false and comp(y,x)
is false will have the same relative ordering after calling stable_sort()
.
Definition at line 5637 of file stl_algo.h.
References std::__inplace_stable_sort(), std::_Temporary_buffer< _ForwardIterator, _Tp >::begin(), and std::_Temporary_buffer< _ForwardIterator, _Tp >::size().