libstdc++
|
Go to the source code of this file.
Namespaces | |
namespace | __gnu_cxx |
Macros | |
#define | _EXT_ALGORITHM |
Functions | |
template<typename _InputIterator , typename _Size , typename _OutputIterator > | |
std::pair< _InputIterator, _OutputIterator > | __gnu_cxx::__copy_n (_InputIterator __first, _Size __count, _OutputIterator __result, std::input_iterator_tag) |
template<typename _RAIterator , typename _Size , typename _OutputIterator > | |
std::pair< _RAIterator, _OutputIterator > | __gnu_cxx::__copy_n (_RAIterator __first, _Size __count, _OutputIterator __result, std::random_access_iterator_tag) |
template<typename _InputIterator1 , typename _InputIterator2 > | |
int | __gnu_cxx::__lexicographical_compare_3way (_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2) |
int | __gnu_cxx::__lexicographical_compare_3way (const char *__first1, const char *__last1, const char *__first2, const char *__last2) |
int | __gnu_cxx::__lexicographical_compare_3way (const unsigned char *__first1, const unsigned char *__last1, const unsigned char *__first2, const unsigned char *__last2) |
template<typename _Tp > | |
const _Tp & | __gnu_cxx::__median (const _Tp &__a, const _Tp &__b, const _Tp &__c) |
template<typename _Tp , typename _Compare > | |
const _Tp & | __gnu_cxx::__median (const _Tp &__a, const _Tp &__b, const _Tp &__c, _Compare __comp) |
template<typename _InputIterator , typename _RandomAccessIterator , typename _RandomNumberGenerator , typename _Distance > | |
_RandomAccessIterator | __gnu_cxx::__random_sample (_InputIterator __first, _InputIterator __last, _RandomAccessIterator __out, _RandomNumberGenerator &__rand, const _Distance __n) |
template<typename _InputIterator , typename _RandomAccessIterator , typename _Distance > | |
_RandomAccessIterator | __gnu_cxx::__random_sample (_InputIterator __first, _InputIterator __last, _RandomAccessIterator __out, const _Distance __n) |
template<typename _InputIterator , typename _Size , typename _OutputIterator > | |
std::pair< _InputIterator, _OutputIterator > | __gnu_cxx::copy_n (_InputIterator __first, _Size __count, _OutputIterator __result) |
template<typename _InputIterator , typename _Tp , typename _Size > | |
void | __gnu_cxx::count (_InputIterator __first, _InputIterator __last, const _Tp &__value, _Size &__n) |
template<typename _InputIterator , typename _Predicate , typename _Size > | |
void | __gnu_cxx::count_if (_InputIterator __first, _InputIterator __last, _Predicate __pred, _Size &__n) |
template<typename _InputIterator1 , typename _InputIterator2 > | |
int | __gnu_cxx::lexicographical_compare_3way (_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2) |
template<typename _InputIterator , typename _RandomAccessIterator > | |
_RandomAccessIterator | __gnu_cxx::random_sample (_InputIterator __first, _InputIterator __last, _RandomAccessIterator __out_first, _RandomAccessIterator __out_last) |
template<typename _InputIterator , typename _RandomAccessIterator , typename _RandomNumberGenerator > | |
_RandomAccessIterator | __gnu_cxx::random_sample (_InputIterator __first, _InputIterator __last, _RandomAccessIterator __out_first, _RandomAccessIterator __out_last, _RandomNumberGenerator &__rand) |
template<typename _ForwardIterator , typename _OutputIterator , typename _Distance > | |
_OutputIterator | __gnu_cxx::random_sample_n (_ForwardIterator __first, _ForwardIterator __last, _OutputIterator __out, const _Distance __n) |
template<typename _ForwardIterator , typename _OutputIterator , typename _Distance , typename _RandomNumberGenerator > | |
_OutputIterator | __gnu_cxx::random_sample_n (_ForwardIterator __first, _ForwardIterator __last, _OutputIterator __out, const _Distance __n, _RandomNumberGenerator &__rand) |
This file is a GNU extension to the Standard C++ Library (possibly containing extensions from the HP/SGI STL subset).
Definition in file ext/algorithm.
#define _EXT_ALGORITHM |
Definition at line 57 of file ext/algorithm.