libstdc++
|
Go to the source code of this file.
Namespaces | |
std | |
Functions | |
template<typename _FIter > | |
_FIter | std::adjacent_find (_FIter, _FIter) |
template<typename _FIter , typename _BinaryPredicate > | |
_FIter | std::adjacent_find (_FIter, _FIter, _BinaryPredicate) |
template<typename _IIter , typename _Predicate > | |
bool | std::all_of (_IIter, _IIter, _Predicate) |
template<typename _IIter , typename _Predicate > | |
bool | std::any_of (_IIter, _IIter, _Predicate) |
template<typename _FIter , typename _Tp > | |
bool | std::binary_search (_FIter, _FIter, const _Tp &) |
template<typename _FIter , typename _Tp , typename _Compare > | |
bool | std::binary_search (_FIter, _FIter, const _Tp &, _Compare) |
template<typename _IIter , typename _OIter > | |
_OIter | std::copy (_IIter, _IIter, _OIter) |
template<typename _BIter1 , typename _BIter2 > | |
_BIter2 | std::copy_backward (_BIter1, _BIter1, _BIter2) |
template<typename _IIter , typename _OIter , typename _Predicate > | |
_OIter | std::copy_if (_IIter, _IIter, _OIter, _Predicate) |
template<typename _IIter , typename _Size , typename _OIter > | |
_OIter | std::copy_n (_IIter, _Size, _OIter) |
template<typename _IIter , typename _Tp > | |
iterator_traits< _IIter > ::difference_type | std::count (_IIter, _IIter, const _Tp &) |
template<typename _IIter , typename _Predicate > | |
iterator_traits< _IIter > ::difference_type | std::count_if (_IIter, _IIter, _Predicate) |
template<typename _IIter1 , typename _IIter2 > | |
bool | std::equal (_IIter1, _IIter1, _IIter2) |
template<typename _IIter1 , typename _IIter2 , typename _BinaryPredicate > | |
bool | std::equal (_IIter1 __first1, _IIter1 __last1, _IIter2 __first2, _BinaryPredicate __binary_pred) |
template<typename _FIter , typename _Tp > | |
pair< _FIter, _FIter > | std::equal_range (_FIter, _FIter, const _Tp &) |
template<typename _FIter , typename _Tp , typename _Compare > | |
pair< _FIter, _FIter > | std::equal_range (_FIter, _FIter, const _Tp &, _Compare) |
template<typename _FIter , typename _Tp > | |
void | std::fill (_FIter, _FIter, const _Tp &) |
template<typename _OIter , typename _Size , typename _Tp > | |
_OIter | std::fill_n (_OIter, _Size, const _Tp &) |
template<typename _IIter , typename _Tp > | |
_IIter | std::find (_IIter, _IIter, const _Tp &) |
template<typename _FIter1 , typename _FIter2 > | |
_FIter1 | std::find_end (_FIter1, _FIter1, _FIter2, _FIter2) |
template<typename _FIter1 , typename _FIter2 , typename _BinaryPredicate > | |
_FIter1 | std::find_end (_FIter1, _FIter1, _FIter2, _FIter2, _BinaryPredicate) |
template<typename _FIter1 , typename _FIter2 > | |
_FIter1 | std::find_first_of (_FIter1, _FIter1, _FIter2, _FIter2) |
template<typename _FIter1 , typename _FIter2 , typename _BinaryPredicate > | |
_FIter1 | std::find_first_of (_FIter1, _FIter1, _FIter2, _FIter2, _BinaryPredicate) |
template<typename _IIter , typename _Predicate > | |
_IIter | std::find_if (_IIter, _IIter, _Predicate) |
template<typename _IIter , typename _Predicate > | |
_IIter | std::find_if_not (_IIter, _IIter, _Predicate) |
template<typename _IIter , typename _Funct > | |
_Funct | std::for_each (_IIter, _IIter, _Funct) |
template<typename _FIter , typename _Generator > | |
void | std::generate (_FIter, _FIter, _Generator) |
template<typename _OIter , typename _Size , typename _Generator > | |
_OIter | std::generate_n (_OIter, _Size, _Generator) |
template<typename _IIter1 , typename _IIter2 > | |
bool | std::includes (_IIter1, _IIter1, _IIter2, _IIter2) |
template<typename _IIter1 , typename _IIter2 , typename _Compare > | |
bool | std::includes (_IIter1, _IIter1, _IIter2, _IIter2, _Compare) |
template<typename _BIter > | |
void | std::inplace_merge (_BIter, _BIter, _BIter) |
template<typename _BIter , typename _Compare > | |
void | std::inplace_merge (_BIter, _BIter, _BIter, _Compare) |
template<typename _RAIter > | |
bool | std::is_heap (_RAIter, _RAIter) |
template<typename _RAIter , typename _Compare > | |
bool | std::is_heap (_RAIter, _RAIter, _Compare) |
template<typename _RAIter > | |
_RAIter | std::is_heap_until (_RAIter, _RAIter) |
template<typename _RAIter , typename _Compare > | |
_RAIter | std::is_heap_until (_RAIter, _RAIter, _Compare) |
template<typename _IIter , typename _Predicate > | |
bool | std::is_partitioned (_IIter, _IIter, _Predicate) |
template<typename _FIter1 , typename _FIter2 > | |
bool | std::is_permutation (_FIter1, _FIter1, _FIter2) |
template<typename _FIter1 , typename _FIter2 , typename _BinaryPredicate > | |
bool | std::is_permutation (_FIter1, _FIter1, _FIter2, _BinaryPredicate) |
template<typename _FIter > | |
bool | std::is_sorted (_FIter, _FIter) |
template<typename _FIter , typename _Compare > | |
bool | std::is_sorted (_FIter, _FIter, _Compare) |
template<typename _FIter > | |
_FIter | std::is_sorted_until (_FIter, _FIter) |
template<typename _FIter , typename _Compare > | |
_FIter | std::is_sorted_until (_FIter, _FIter, _Compare) |
template<typename _FIter1 , typename _FIter2 > | |
void | std::iter_swap (_FIter1, _FIter2) |
template<typename _IIter1 , typename _IIter2 > | |
bool | std::lexicographical_compare (_IIter1, _IIter1, _IIter2, _IIter2) |
template<typename _IIter1 , typename _IIter2 , typename _Compare > | |
bool | std::lexicographical_compare (_IIter1, _IIter1, _IIter2, _IIter2, _Compare) |
template<typename _FIter , typename _Tp > | |
_FIter | std::lower_bound (_FIter, _FIter, const _Tp &) |
template<typename _FIter , typename _Tp , typename _Compare > | |
_FIter | std::lower_bound (_FIter, _FIter, const _Tp &, _Compare) |
template<typename _RAIter > | |
void | std::make_heap (_RAIter, _RAIter) |
template<typename _RAIter , typename _Compare > | |
void | std::make_heap (_RAIter, _RAIter, _Compare) |
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 _Tp > | |
_Tp | std::max (initializer_list< _Tp >) |
template<typename _Tp , typename _Compare > | |
_Tp | std::max (initializer_list< _Tp >, _Compare) |
template<typename _FIter > | |
_FIter | std::max_element (_FIter, _FIter) |
template<typename _FIter , typename _Compare > | |
_FIter | std::max_element (_FIter, _FIter, _Compare) |
template<typename _IIter1 , typename _IIter2 , typename _OIter > | |
_OIter | std::merge (_IIter1, _IIter1, _IIter2, _IIter2, _OIter) |
template<typename _IIter1 , typename _IIter2 , typename _OIter , typename _Compare > | |
_OIter | std::merge (_IIter1, _IIter1, _IIter2, _IIter2, _OIter, _Compare) |
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 _Tp > | |
_Tp | std::min (initializer_list< _Tp >) |
template<typename _Tp , typename _Compare > | |
_Tp | std::min (initializer_list< _Tp >, _Compare) |
template<typename _FIter > | |
_FIter | std::min_element (_FIter, _FIter) |
template<typename _FIter , typename _Compare > | |
_FIter | std::min_element (_FIter, _FIter, _Compare) |
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 _Tp > | |
pair< _Tp, _Tp > | std::minmax (initializer_list< _Tp >) |
template<typename _Tp , typename _Compare > | |
pair< _Tp, _Tp > | std::minmax (initializer_list< _Tp >, _Compare) |
template<typename _FIter > | |
pair< _FIter, _FIter > | std::minmax_element (_FIter, _FIter) |
template<typename _FIter , typename _Compare > | |
pair< _FIter, _FIter > | std::minmax_element (_FIter, _FIter, _Compare) |
template<typename _IIter1 , typename _IIter2 > | |
pair< _IIter1, _IIter2 > | std::mismatch (_IIter1, _IIter1, _IIter2) |
template<typename _IIter1 , typename _IIter2 , typename _BinaryPredicate > | |
pair< _IIter1, _IIter2 > | std::mismatch (_IIter1, _IIter1, _IIter2, _BinaryPredicate) |
template<typename _BIter > | |
bool | std::next_permutation (_BIter, _BIter) |
template<typename _BIter , typename _Compare > | |
bool | std::next_permutation (_BIter, _BIter, _Compare) |
template<typename _IIter , typename _Predicate > | |
bool | std::none_of (_IIter, _IIter, _Predicate) |
template<typename _RAIter > | |
void | std::nth_element (_RAIter, _RAIter, _RAIter) |
template<typename _RAIter , typename _Compare > | |
void | std::nth_element (_RAIter, _RAIter, _RAIter, _Compare) |
template<typename _RAIter > | |
void | std::partial_sort (_RAIter, _RAIter, _RAIter) |
template<typename _RAIter , typename _Compare > | |
void | std::partial_sort (_RAIter, _RAIter, _RAIter, _Compare) |
template<typename _IIter , typename _RAIter > | |
_RAIter | std::partial_sort_copy (_IIter, _IIter, _RAIter, _RAIter) |
template<typename _IIter , typename _RAIter , typename _Compare > | |
_RAIter | std::partial_sort_copy (_IIter, _IIter, _RAIter, _RAIter, _Compare) |
template<typename _BIter , typename _Predicate > | |
_BIter | std::partition (_BIter, _BIter, _Predicate) |
template<typename _IIter , typename _OIter1 , typename _OIter2 , typename _Predicate > | |
pair< _OIter1, _OIter2 > | std::partition_copy (_IIter, _IIter, _OIter1, _OIter2, _Predicate) |
template<typename _FIter , typename _Predicate > | |
_FIter | std::partition_point (_FIter, _FIter, _Predicate) |
template<typename _RAIter > | |
void | std::pop_heap (_RAIter, _RAIter) |
template<typename _RAIter , typename _Compare > | |
void | std::pop_heap (_RAIter, _RAIter, _Compare) |
template<typename _BIter > | |
bool | std::prev_permutation (_BIter, _BIter) |
template<typename _BIter , typename _Compare > | |
bool | std::prev_permutation (_BIter, _BIter, _Compare) |
template<typename _RAIter > | |
void | std::push_heap (_RAIter, _RAIter) |
template<typename _RAIter , typename _Compare > | |
void | std::push_heap (_RAIter, _RAIter, _Compare) |
template<typename _RAIter > | |
void | std::random_shuffle (_RAIter, _RAIter) |
template<typename _RAIter , typename _Generator > | |
void | std::random_shuffle (_RAIter, _RAIter, _Generator &&) |
template<typename _FIter , typename _Tp > | |
_FIter | std::remove (_FIter, _FIter, const _Tp &) |
template<typename _IIter , typename _OIter , typename _Tp > | |
_OIter | std::remove_copy (_IIter, _IIter, _OIter, const _Tp &) |
template<typename _IIter , typename _OIter , typename _Predicate > | |
_OIter | std::remove_copy_if (_IIter, _IIter, _OIter, _Predicate) |
template<typename _FIter , typename _Predicate > | |
_FIter | std::remove_if (_FIter, _FIter, _Predicate) |
template<typename _FIter , typename _Tp > | |
void | std::replace (_FIter, _FIter, const _Tp &, const _Tp &) |
template<typename _IIter , typename _OIter , typename _Tp > | |
_OIter | std::replace_copy (_IIter, _IIter, _OIter, const _Tp &, const _Tp &) |
template<typename _Iter , typename _OIter , typename _Predicate , typename _Tp > | |
_OIter | std::replace_copy_if (_Iter, _Iter, _OIter, _Predicate, const _Tp &) |
template<typename _FIter , typename _Predicate , typename _Tp > | |
void | std::replace_if (_FIter, _FIter, _Predicate, const _Tp &) |
template<typename _BIter > | |
void | std::reverse (_BIter, _BIter) |
template<typename _BIter , typename _OIter > | |
_OIter | std::reverse_copy (_BIter, _BIter, _OIter) |
template<typename _FIter > | |
void | std::rotate (_FIter, _FIter, _FIter) |
template<typename _FIter , typename _OIter > | |
_OIter | std::rotate_copy (_FIter, _FIter, _FIter, _OIter) |
template<typename _FIter1 , typename _FIter2 > | |
_FIter1 | std::search (_FIter1, _FIter1, _FIter2, _FIter2) |
template<typename _FIter1 , typename _FIter2 , typename _BinaryPredicate > | |
_FIter1 | std::search (_FIter1, _FIter1, _FIter2, _FIter2, _BinaryPredicate) |
template<typename _FIter , typename _Size , typename _Tp > | |
_FIter | std::search_n (_FIter, _FIter, _Size, const _Tp &) |
template<typename _FIter , typename _Size , typename _Tp , typename _BinaryPredicate > | |
_FIter | std::search_n (_FIter, _FIter, _Size, const _Tp &, _BinaryPredicate) |
template<typename _IIter1 , typename _IIter2 , typename _OIter > | |
_OIter | std::set_difference (_IIter1, _IIter1, _IIter2, _IIter2, _OIter) |
template<typename _IIter1 , typename _IIter2 , typename _OIter , typename _Compare > | |
_OIter | std::set_difference (_IIter1, _IIter1, _IIter2, _IIter2, _OIter, _Compare) |
template<typename _IIter1 , typename _IIter2 , typename _OIter > | |
_OIter | std::set_intersection (_IIter1, _IIter1, _IIter2, _IIter2, _OIter) |
template<typename _IIter1 , typename _IIter2 , typename _OIter , typename _Compare > | |
_OIter | std::set_intersection (_IIter1, _IIter1, _IIter2, _IIter2, _OIter, _Compare) |
template<typename _IIter1 , typename _IIter2 , typename _OIter > | |
_OIter | std::set_symmetric_difference (_IIter1, _IIter1, _IIter2, _IIter2, _OIter) |
template<typename _IIter1 , typename _IIter2 , typename _OIter , typename _Compare > | |
_OIter | std::set_symmetric_difference (_IIter1, _IIter1, _IIter2, _IIter2, _OIter, _Compare) |
template<typename _IIter1 , typename _IIter2 , typename _OIter > | |
_OIter | std::set_union (_IIter1, _IIter1, _IIter2, _IIter2, _OIter) |
template<typename _IIter1 , typename _IIter2 , typename _OIter , typename _Compare > | |
_OIter | std::set_union (_IIter1, _IIter1, _IIter2, _IIter2, _OIter, _Compare) |
template<typename _RAIter , typename _UGenerator > | |
void | std::shuffle (_RAIter, _RAIter, _UGenerator &&) |
template<typename _RAIter > | |
void | std::sort (_RAIter, _RAIter) |
template<typename _RAIter , typename _Compare > | |
void | std::sort (_RAIter, _RAIter, _Compare) |
template<typename _RAIter > | |
void | std::sort_heap (_RAIter, _RAIter) |
template<typename _RAIter , typename _Compare > | |
void | std::sort_heap (_RAIter, _RAIter, _Compare) |
template<typename _BIter , typename _Predicate > | |
_BIter | std::stable_partition (_BIter, _BIter, _Predicate) |
template<typename _RAIter > | |
void | std::stable_sort (_RAIter, _RAIter) |
template<typename _RAIter , typename _Compare > | |
void | std::stable_sort (_RAIter, _RAIter, _Compare) |
template<typename _Tp > | |
void | std::swap (_Tp &__a, _Tp &__b) noexcept(__and_< is_nothrow_move_constructible< _Tp >,is_nothrow_move_assignable< _Tp >>::value) |
template<typename _Tp , size_t _Nm> | |
void | std::swap (_Tp(&__a)[_Nm], _Tp(&__b)[_Nm]) noexcept(noexcept(swap(*__a,*__b))) |
template<typename _FIter1 , typename _FIter2 > | |
_FIter2 | std::swap_ranges (_FIter1, _FIter1, _FIter2) |
template<typename _IIter , typename _OIter , typename _UnaryOperation > | |
_OIter | std::transform (_IIter, _IIter, _OIter, _UnaryOperation) |
template<typename _IIter1 , typename _IIter2 , typename _OIter , typename _BinaryOperation > | |
_OIter | std::transform (_IIter1, _IIter1, _IIter2, _OIter, _BinaryOperation) |
template<typename _FIter > | |
_FIter | std::unique (_FIter, _FIter) |
template<typename _FIter , typename _BinaryPredicate > | |
_FIter | std::unique (_FIter, _FIter, _BinaryPredicate) |
template<typename _IIter , typename _OIter > | |
_OIter | std::unique_copy (_IIter, _IIter, _OIter) |
template<typename _IIter , typename _OIter , typename _BinaryPredicate > | |
_OIter | std::unique_copy (_IIter, _IIter, _OIter, _BinaryPredicate) |
template<typename _FIter , typename _Tp > | |
_FIter | std::upper_bound (_FIter, _FIter, const _Tp &) |
template<typename _FIter , typename _Tp , typename _Compare > | |
_FIter | std::upper_bound (_FIter, _FIter, const _Tp &, _Compare) |
This is an internal header file, included by other library headers. Do not attempt to use it directly. Instead, include <algorithm>.
Definition in file algorithmfwd.h.