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 > | |
_GLIBCXX14_CONSTEXPR const _Tp & | std::max (const _Tp &__a, const _Tp &__b) |
template<typename _Tp , typename _Compare > | |
_GLIBCXX14_CONSTEXPR const _Tp & | std::max (const _Tp &__a, const _Tp &__b, _Compare __comp) |
template<typename _ForwardIterator > | |
_GLIBCXX14_CONSTEXPR _ForwardIterator | std::max_element (_ForwardIterator __first, _ForwardIterator __last) |
template<typename _ForwardIterator , typename _Compare > | |
_GLIBCXX14_CONSTEXPR _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 > | |
_GLIBCXX14_CONSTEXPR const _Tp & | std::min (const _Tp &__a, const _Tp &__b) |
template<typename _Tp , typename _Compare > | |
_GLIBCXX14_CONSTEXPR const _Tp & | std::min (const _Tp &__a, const _Tp &__b, _Compare __comp) |
template<typename _ForwardIterator > | |
_GLIBCXX14_CONSTEXPR _ForwardIterator | std::min_element (_ForwardIterator __first, _ForwardIterator __last) |
template<typename _ForwardIterator , typename _Compare > | |
_GLIBCXX14_CONSTEXPR _ForwardIterator | std::min_element (_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) |
template<typename _Tp > | |
_GLIBCXX14_CONSTEXPR pair< const _Tp &, const _Tp & > | std::minmax (const _Tp &__a, const _Tp &__b) |
template<typename _Tp , typename _Compare > | |
_GLIBCXX14_CONSTEXPR pair< const _Tp &, const _Tp & > | std::minmax (const _Tp &__a, const _Tp &__b, _Compare __comp) |
template<typename _ForwardIterator > | |
_GLIBCXX14_CONSTEXPR pair< _ForwardIterator, _ForwardIterator > | std::minmax_element (_ForwardIterator __first, _ForwardIterator __last) |
template<typename _ForwardIterator , typename _Compare > | |
_GLIBCXX14_CONSTEXPR 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) |
|
inline |
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 2574 of file stl_algo.h.
|
inline |
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 2615 of file stl_algo.h.
|
inline |
Determines whether the elements of a sequence are sorted.
__first | An iterator. |
__last | Another iterator. |
Definition at line 3209 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 3223 of file stl_algo.h.
References std::is_sorted_until().
|
inline |
Determines the end of a sorted sequence.
__first | An iterator. |
__last | Another iterator. |
Definition at line 3252 of file stl_algo.h.
|
inline |
Determines the end of a sorted sequence using comparison functor.
__first | An iterator. |
__last | Another iterator. |
__comp | A comparison functor. |
Definition at line 3276 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 1203 of file stl_algobase.h.
|
inline |
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 1239 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 219 of file stl_algobase.h.
Referenced by __gnu_parallel::__parallel_nth_element(), std::vector< sub_match< _Bi_iter >, allocator< sub_match< _Bi_iter > > >::_M_allocate_and_copy(), 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(), std::minmax_element(), __gnu_parallel::multiseq_partition(), __gnu_parallel::multiseq_selection(), std::operator>>(), 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 265 of file stl_algobase.h.
|
inline |
Return the maximum element in a range.
__first | Start of range. |
__last | End of range. |
Definition at line 5654 of file stl_algo.h.
|
inline |
Return the maximum element in a range using comparison functor.
__first | Start of range. |
__last | End of range. |
__comp | Comparison functor. |
Definition at line 5679 of file stl_algo.h.
Referenced by std::minmax_element().
|
inline |
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 4904 of file stl_algo.h.
|
inline |
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 4954 of file stl_algo.h.
References std::__inplace_stable_sort().
|
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 195 of file stl_algobase.h.
Referenced by std::__move_merge(), __gnu_parallel::__parallel_random_shuffle_drs(), __gnu_parallel::__parallel_sort_qs_divide(), __gnu_profile::__report(), std::__sample(), __gnu_parallel::__search_template(), __gnu_parallel::__sequential_random_shuffle(), std::deque< _Tp, _Alloc >::_M_reallocate_map(), __gnu_cxx::__versa_string< _CharT, _Traits, _Alloc, _Base >::compare(), std::basic_string< char >::compare(), std::basic_string< _CharT, _Traits, _Alloc >::compare(), std::time_get< _CharT, _InIter >::do_date_order(), std::codecvt< _InternT, _ExternT, encoding_state >::do_out(), std::fill_n(), std::generate_canonical(), std::discard_block_engine< _RandomNumberEngine, __p, __r >::min(), std::shuffle_order_engine< _RandomNumberEngine, __k >::min(), std::minmax_element(), __gnu_parallel::multiseq_partition(), __gnu_parallel::multiseq_selection(), std::negative_binomial_distribution< _IntType >::operator()(), std::basic_stringbuf< _CharT, _Traits, _Alloc >::overflow(), 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::wbuffer_convert< _Codecvt, _Elem, _Tr >::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 243 of file stl_algobase.h.
|
inline |
Return the minimum element in a range.
__first | Start of range. |
__last | End of range. |
Definition at line 5590 of file stl_algo.h.
|
inline |
Return the minimum element in a range using comparison functor.
__first | Start of range. |
__last | End of range. |
__comp | Comparison functor. |
Definition at line 5615 of file stl_algo.h.
Referenced by std::minmax_element().
|
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 3302 of file stl_algo.h.
Referenced by std::minmax_element().
|
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 3323 of file stl_algo.h.
References std::make_pair().
|
inline |
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 3403 of file stl_algo.h.
|
inline |
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 3431 of file stl_algo.h.
References std::__find_if(), std::advance(), std::distance(), std::pair< _T1, _T2 >::first, std::make_pair(), std::max(), std::max_element(), std::min(), std::min_element(), std::minmax(), std::minmax_element(), and std::pair< _T1, _T2 >::second.
Referenced by std::minmax_element().
|
inline |
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 2954 of file stl_algo.h.
|
inline |
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 2986 of file stl_algo.h.
References std::__iterator_category(), std::__reverse(), and std::iter_swap().
|
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. The elements either side of *__nth
are not completely sorted, but for any iterator i in the range [__first,__nth) and any iterator j in the range
[__nth,__last) it holds that *j < *i is false.
Definition at line 4736 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 i in the range [__first,__nth) and any iterator j in the range
[__nth,__last) it holds that
__comp(*j,*i)
is false.
Definition at line 4775 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 j are iterators in the range
[__first,__middle) such that i precedes j and k is an iterator in the range
[__middle,__last) then *j<*i and *k<*i are both false.
Definition at line 4662 of file stl_algo.h.
|
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 j are iterators in the range
[__first,__middle) such that i precedes j and k is an iterator in the range
[__middle,__last) then
*__comp
(j,*i) and __comp(*k,*i)
are both false.
Definition at line 4700 of file stl_algo.h.
|
inline |
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 j are iterators in the range
[__result_first,__result_first+N) such that i precedes j then *j<*i is false. The value returned is
__result_first+N
.
Definition at line 1737 of file stl_algo.h.
|
inline |
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 j are iterators in the range
[__result_first,__result_first+N) such that i precedes j then
__comp(*j,*i)
is false. The value returned is __result_first+N
.
Definition at line 1787 of file stl_algo.h.
|
inline |
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 3054 of file stl_algo.h.
|
inline |
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 3086 of file stl_algo.h.
|
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 for each iterator i in the range
[__first,__last-1), *(i+1)<*i is false.
The relative ordering of equivalent elements is not preserved, use stable_sort()
if this is needed.
Definition at line 4812 of file stl_algo.h.
|
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 4842 of file stl_algo.h.
|
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 for each iterator
i
in the range [__first,__last-1),
*
(i+1)<*i is false.
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 5017 of file stl_algo.h.
|
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 for each iterator
i
in the range [__first,__last-1),
__comp
(*(i+1),*i) is false.
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 5051 of file stl_algo.h.