libstdc++
|
Go to the source code of this file.
Classes | |
struct | std::char_traits< _CharT > |
class | std::istreambuf_iterator< _CharT, _Traits > |
class | std::ostreambuf_iterator< _CharT, _Traits > |
Namespaces | |
namespace | std |
Macros | |
#define | _GLIBCXX_MOVE3(_Tp, _Up, _Vp) |
#define | _GLIBCXX_MOVE_BACKWARD3(_Tp, _Up, _Vp) |
Functions | |
template<bool _IsMove, typename _II , typename _OI > | |
_OI | std::__copy_move_a (_II __first, _II __last, _OI __result) |
template<bool _IsMove, typename _CharT > | |
__gnu_cxx::__enable_if < __is_char< _CharT >::__value, ostreambuf_iterator< _CharT, char_traits< _CharT > > >::__type | std::__copy_move_a2 (_CharT *, _CharT *, ostreambuf_iterator< _CharT, char_traits< _CharT > >) |
template<bool _IsMove, typename _CharT > | |
__gnu_cxx::__enable_if < __is_char< _CharT >::__value, ostreambuf_iterator< _CharT, char_traits< _CharT > > >::__type | std::__copy_move_a2 (const _CharT *, const _CharT *, ostreambuf_iterator< _CharT, char_traits< _CharT > >) |
template<bool _IsMove, typename _CharT > | |
__gnu_cxx::__enable_if < __is_char< _CharT >::__value, _CharT * >::__type | std::__copy_move_a2 (istreambuf_iterator< _CharT, char_traits< _CharT > >, istreambuf_iterator< _CharT, char_traits< _CharT > >, _CharT *) |
template<bool _IsMove, typename _II , typename _OI > | |
_OI | std::__copy_move_a2 (_II __first, _II __last, _OI __result) |
template<bool _IsMove, typename _BI1 , typename _BI2 > | |
_BI2 | std::__copy_move_backward_a (_BI1 __first, _BI1 __last, _BI2 __result) |
template<bool _IsMove, typename _BI1 , typename _BI2 > | |
_BI2 | std::__copy_move_backward_a2 (_BI1 __first, _BI1 __last, _BI2 __result) |
template<typename _II1 , typename _II2 > | |
bool | std::__equal_aux (_II1 __first1, _II1 __last1, _II2 __first2) |
template<typename _ForwardIterator , typename _Tp > | |
__gnu_cxx::__enable_if <!__is_scalar< _Tp >::__value, void >::__type | std::__fill_a (_ForwardIterator __first, _ForwardIterator __last, const _Tp &__value) |
template<typename _ForwardIterator , typename _Tp > | |
__gnu_cxx::__enable_if < __is_scalar< _Tp >::__value, void >::__type | std::__fill_a (_ForwardIterator __first, _ForwardIterator __last, const _Tp &__value) |
template<typename _Tp > | |
__gnu_cxx::__enable_if < __is_byte< _Tp >::__value, void >::__type | std::__fill_a (_Tp *__first, _Tp *__last, const _Tp &__c) |
template<typename _OutputIterator , typename _Size , typename _Tp > | |
__gnu_cxx::__enable_if <!__is_scalar< _Tp >::__value, _OutputIterator >::__type | std::__fill_n_a (_OutputIterator __first, _Size __n, const _Tp &__value) |
template<typename _OutputIterator , typename _Size , typename _Tp > | |
__gnu_cxx::__enable_if < __is_scalar< _Tp >::__value, _OutputIterator >::__type | std::__fill_n_a (_OutputIterator __first, _Size __n, const _Tp &__value) |
template<typename _Size , typename _Tp > | |
__gnu_cxx::__enable_if < __is_byte< _Tp >::__value, _Tp * >::__type | std::__fill_n_a (_Tp *__first, _Size __n, const _Tp &__c) |
template<typename _II1 , typename _II2 > | |
bool | std::__lexicographical_compare_aux (_II1 __first1, _II1 __last1, _II2 __first2, _II2 __last2) |
template<typename _Size > | |
_Size | std::__lg (_Size __n) |
int | std::__lg (int __n) |
long | std::__lg (long __n) |
long long | std::__lg (long long __n) |
template<typename _Iterator > | |
_Miter_base< _Iterator > ::iterator_type | std::__miter_base (_Iterator __it) |
template<typename _Iterator > | |
_Niter_base< _Iterator > ::iterator_type | std::__niter_base (_Iterator __it) |
template<typename _II , typename _OI > | |
_OI | std::copy (_II __first, _II __last, _OI __result) |
template<typename _BI1 , typename _BI2 > | |
_BI2 | std::copy_backward (_BI1 __first, _BI1 __last, _BI2 __result) |
template<typename _IIter1 , typename _IIter2 , typename _BinaryPredicate > | |
bool | std::equal (_IIter1 __first1, _IIter1 __last1, _IIter2 __first2, _BinaryPredicate __binary_pred) |
template<typename _II1 , typename _II2 > | |
bool | std::equal (_II1 __first1, _II1 __last1, _II2 __first2) |
template<typename _ForwardIterator , typename _Tp > | |
void | std::fill (_ForwardIterator __first, _ForwardIterator __last, const _Tp &__value) |
template<typename _OI , typename _Size , typename _Tp > | |
_OI | std::fill_n (_OI __first, _Size __n, const _Tp &__value) |
template<typename _ForwardIterator1 , typename _ForwardIterator2 > | |
void | std::iter_swap (_ForwardIterator1 __a, _ForwardIterator2 __b) |
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 _ForwardIterator , typename _Tp > | |
_ForwardIterator | std::lower_bound (_ForwardIterator __first, _ForwardIterator __last, const _Tp &__val) |
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 > | |
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 _InputIterator1 , typename _InputIterator2 > | |
pair< _InputIterator1, _InputIterator2 > | std::mismatch (_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2) |
template<typename _InputIterator1 , typename _InputIterator2 , typename _BinaryPredicate > | |
pair< _InputIterator1, _InputIterator2 > | std::mismatch (_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _BinaryPredicate __binary_pred) |
template<typename _II , typename _OI > | |
_OI | std::move (_II __first, _II __last, _OI __result) |
template<typename _BI1 , typename _BI2 > | |
_BI2 | std::move_backward (_BI1 __first, _BI1 __last, _BI2 __result) |
template<typename _ForwardIterator1 , typename _ForwardIterator2 > | |
_ForwardIterator2 | std::swap_ranges (_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2) |
This is an internal header file, included by other library headers. Do not attempt to use it directly. Instead, include <algorithm>.
Definition in file stl_algobase.h.