libstdc++
|
Modules | |
Iterator Tags | |
Macros | |
#define | __cpp_lib_make_reverse_iterator |
Functions | |
template<bool _IsMove, typename _CharT > | |
__gnu_cxx::__enable_if< __is_char< _CharT >::__value, ostreambuf_iterator< _CharT > >::__type | std::__copy_move_a2 (_CharT *__first, _CharT *__last, ostreambuf_iterator< _CharT > __result) |
template<bool _IsMove, typename _CharT > | |
__gnu_cxx::__enable_if< __is_char< _CharT >::__value, ostreambuf_iterator< _CharT > >::__type | std::__copy_move_a2 (const _CharT *__first, const _CharT *__last, ostreambuf_iterator< _CharT > __result) |
template<bool _IsMove, typename _CharT > | |
__gnu_cxx::__enable_if< __is_char< _CharT >::__value, _CharT * >::__type | std::__copy_move_a2 (istreambuf_iterator< _CharT > __first, istreambuf_iterator< _CharT > __last, _CharT *__result) |
template<typename _Iter > | |
iterator_traits< _Iter >::iterator_category | std::__iterator_category (const _Iter &) |
template<typename _Iterator , typename _ReturnType = typename conditional<__move_if_noexcept_cond <typename iterator_traits<_Iterator>::value_type>::value, _Iterator, move_iterator<_Iterator>>::type> | |
_ReturnType | std::__make_move_if_noexcept_iterator (_Iterator __i) |
template<typename _Tp , typename _ReturnType = typename conditional<__move_if_noexcept_cond<_Tp>::value, const _Tp*, move_iterator<_Tp*>>::type> | |
_ReturnType | std::__make_move_if_noexcept_iterator (_Tp *__i) |
template<typename _Iterator > | |
reverse_iterator< _Iterator > | std::__make_reverse_iterator (_Iterator __i) |
template<typename _Iterator > | |
auto | std::__miter_base (reverse_iterator< _Iterator > __it) -> decltype(__make_reverse_iterator(__miter_base(__it.base()))) |
template<typename _Iterator > | |
auto | std::__niter_base (reverse_iterator< _Iterator > __it) -> decltype(__make_reverse_iterator(__niter_base(__it.base()))) |
template<typename _Container > | |
back_insert_iterator< _Container > | std::back_inserter (_Container &__x) |
template<typename _CharT > | |
__gnu_cxx::__enable_if< __is_char< _CharT >::__value, ostreambuf_iterator< _CharT > >::__type | std::copy (istreambuf_iterator< _CharT > __first, istreambuf_iterator< _CharT > __last, ostreambuf_iterator< _CharT > __result) |
template<typename _CharT > | |
__gnu_cxx::__enable_if< __is_char< _CharT >::__value, istreambuf_iterator< _CharT > >::__type | std::find (istreambuf_iterator< _CharT > __first, istreambuf_iterator< _CharT > __last, const _CharT &__val) |
template<typename _Container > | |
front_insert_iterator< _Container > | std::front_inserter (_Container &__x) |
template<typename _Container , typename _Iterator > | |
insert_iterator< _Container > | std::inserter (_Container &__x, _Iterator __i) |
template<typename _Iterator > | |
move_iterator< _Iterator > | std::make_move_iterator (_Iterator __i) |
template<typename _Iterator > | |
reverse_iterator< _Iterator > | std::make_reverse_iterator (_Iterator __i) |
template<class _Tp , class _CharT , class _Traits , class _Dist > | |
bool | std::operator!= (const istream_iterator< _Tp, _CharT, _Traits, _Dist > &__x, const istream_iterator< _Tp, _CharT, _Traits, _Dist > &__y) |
template<typename _CharT , typename _Traits > | |
bool | std::operator!= (const istreambuf_iterator< _CharT, _Traits > &__a, const istreambuf_iterator< _CharT, _Traits > &__b) |
template<typename _Iterator > | |
bool | std::operator!= (const reverse_iterator< _Iterator > &__x, const reverse_iterator< _Iterator > &__y) |
template<typename _IteratorL , typename _IteratorR > | |
bool | std::operator!= (const reverse_iterator< _IteratorL > &__x, const reverse_iterator< _IteratorR > &__y) |
template<typename _IteratorL , typename _IteratorR > | |
bool | std::operator!= (const move_iterator< _IteratorL > &__x, const move_iterator< _IteratorR > &__y) |
template<typename _Iterator > | |
bool | std::operator!= (const move_iterator< _Iterator > &__x, const move_iterator< _Iterator > &__y) |
template<typename _Iterator > | |
reverse_iterator< _Iterator > | std::operator+ (typename reverse_iterator< _Iterator >::difference_type __n, const reverse_iterator< _Iterator > &__x) |
template<typename _Iterator > | |
move_iterator< _Iterator > | std::operator+ (typename move_iterator< _Iterator >::difference_type __n, const move_iterator< _Iterator > &__x) |
template<typename _Iterator > | |
auto | std::operator- (const reverse_iterator< _Iterator > &__x, const reverse_iterator< _Iterator > &__y) -> decltype(__x.base()-__y.base()) |
template<typename _IteratorL , typename _IteratorR > | |
auto | std::operator- (const reverse_iterator< _IteratorL > &__x, const reverse_iterator< _IteratorR > &__y) -> decltype(__y.base()-__x.base()) |
template<typename _IteratorL , typename _IteratorR > | |
auto | std::operator- (const move_iterator< _IteratorL > &__x, const move_iterator< _IteratorR > &__y) -> decltype(__x.base()-__y.base()) |
template<typename _Iterator > | |
auto | std::operator- (const move_iterator< _Iterator > &__x, const move_iterator< _Iterator > &__y) -> decltype(__x.base()-__y.base()) |
template<typename _Iterator > | |
bool | std::operator< (const reverse_iterator< _Iterator > &__x, const reverse_iterator< _Iterator > &__y) |
template<typename _IteratorL , typename _IteratorR > | |
bool | std::operator< (const reverse_iterator< _IteratorL > &__x, const reverse_iterator< _IteratorR > &__y) |
template<typename _IteratorL , typename _IteratorR > | |
bool | std::operator< (const move_iterator< _IteratorL > &__x, const move_iterator< _IteratorR > &__y) |
template<typename _Iterator > | |
bool | std::operator< (const move_iterator< _Iterator > &__x, const move_iterator< _Iterator > &__y) |
template<typename _Iterator > | |
bool | std::operator<= (const reverse_iterator< _Iterator > &__x, const reverse_iterator< _Iterator > &__y) |
template<typename _IteratorL , typename _IteratorR > | |
bool | std::operator<= (const reverse_iterator< _IteratorL > &__x, const reverse_iterator< _IteratorR > &__y) |
template<typename _IteratorL , typename _IteratorR > | |
bool | std::operator<= (const move_iterator< _IteratorL > &__x, const move_iterator< _IteratorR > &__y) |
template<typename _Iterator > | |
bool | std::operator<= (const move_iterator< _Iterator > &__x, const move_iterator< _Iterator > &__y) |
template<typename _Tp , typename _CharT , typename _Traits , typename _Dist > | |
bool | std::operator== (const istream_iterator< _Tp, _CharT, _Traits, _Dist > &__x, const istream_iterator< _Tp, _CharT, _Traits, _Dist > &__y) |
template<typename _CharT , typename _Traits > | |
bool | std::operator== (const istreambuf_iterator< _CharT, _Traits > &__a, const istreambuf_iterator< _CharT, _Traits > &__b) |
template<typename _Iterator > | |
bool | std::operator== (const reverse_iterator< _Iterator > &__x, const reverse_iterator< _Iterator > &__y) |
template<typename _IteratorL , typename _IteratorR > | |
bool | std::operator== (const reverse_iterator< _IteratorL > &__x, const reverse_iterator< _IteratorR > &__y) |
template<typename _IteratorL , typename _IteratorR > | |
bool | std::operator== (const move_iterator< _IteratorL > &__x, const move_iterator< _IteratorR > &__y) |
template<typename _Iterator > | |
bool | std::operator== (const move_iterator< _Iterator > &__x, const move_iterator< _Iterator > &__y) |
template<typename _Iterator > | |
bool | std::operator> (const reverse_iterator< _Iterator > &__x, const reverse_iterator< _Iterator > &__y) |
template<typename _IteratorL , typename _IteratorR > | |
bool | std::operator> (const reverse_iterator< _IteratorL > &__x, const reverse_iterator< _IteratorR > &__y) |
template<typename _IteratorL , typename _IteratorR > | |
bool | std::operator> (const move_iterator< _IteratorL > &__x, const move_iterator< _IteratorR > &__y) |
template<typename _Iterator > | |
bool | std::operator> (const move_iterator< _Iterator > &__x, const move_iterator< _Iterator > &__y) |
template<typename _Iterator > | |
bool | std::operator>= (const reverse_iterator< _Iterator > &__x, const reverse_iterator< _Iterator > &__y) |
template<typename _IteratorL , typename _IteratorR > | |
bool | std::operator>= (const reverse_iterator< _IteratorL > &__x, const reverse_iterator< _IteratorR > &__y) |
template<typename _IteratorL , typename _IteratorR > | |
bool | std::operator>= (const move_iterator< _IteratorL > &__x, const move_iterator< _IteratorR > &__y) |
template<typename _Iterator > | |
bool | std::operator>= (const move_iterator< _Iterator > &__x, const move_iterator< _Iterator > &__y) |
Abstractions for uniform iterating through various underlying types.
|
inline |
This function is not a part of the C++ standard but is syntactic sugar for internal library use only.
Definition at line 204 of file stl_iterator_base_types.h.
Referenced by __gnu_debug::__check_string(), std::__find_if(), std::__find_if_not(), __gnu_debug::__get_distance(), std::__search_n_aux(), std::advance(), std::copy_n(), std::distance(), std::find_end(), std::includes(), std::next_permutation(), std::partition(), std::reverse(), std::_V2::rotate(), std::uninitialized_copy_n(), and std::unique_copy().
|
inline |
__x | A container of arbitrary type. |
__x
.This wrapper function helps in creating back_insert_iterator instances. Typing the name of the iterator requires knowing the precise full type of the container, which can be tedious and impedes generic programming. Using this function lets you take advantage of automatic template parameter deduction, making the compiler match the correct types for you.
Definition at line 527 of file bits/stl_iterator.h.
Referenced by std::match_results< _Bi_iter >::format(), std::operator>>(), and std::regex_replace().
|
inline |
__x | A container of arbitrary type. |
x
.This wrapper function helps in creating front_insert_iterator instances. Typing the name of the iterator requires knowing the precise full type of the container, which can be tedious and impedes generic programming. Using this function lets you take advantage of automatic template parameter deduction, making the compiler match the correct types for you.
Definition at line 618 of file bits/stl_iterator.h.
|
inline |
__x | A container of arbitrary type. |
__x
.This wrapper function helps in creating insert_iterator instances. Typing the name of the iterator requires knowing the precise full type of the container, which can be tedious and impedes generic programming. Using this function lets you take advantage of automatic template parameter deduction, making the compiler match the correct types for you.
Definition at line 732 of file bits/stl_iterator.h.
References std::reverse_iterator< _Iterator >::base(), std::reverse_iterator< _Iterator >::operator*(), std::reverse_iterator< _Iterator >::operator+(), std::reverse_iterator< _Iterator >::operator++(), std::reverse_iterator< _Iterator >::operator+=(), std::reverse_iterator< _Iterator >::operator-(), std::reverse_iterator< _Iterator >::operator--(), std::reverse_iterator< _Iterator >::operator-=(), std::reverse_iterator< _Iterator >::operator->(), and std::reverse_iterator< _Iterator >::operator[]().
Referenced by std::deque< _Tp, _Alloc >::_M_pop_front_aux().
|
inline |
Generator function for reverse_iterator.
Definition at line 413 of file bits/stl_iterator.h.
References std::reverse_iterator< _Iterator >::base().
|
inline |
Return false if x and y are both end or not end, or x and y are the same.
Definition at line 137 of file stream_iterator.h.
|
inline |
Return true if x and y are both end or not end, or x and y are the same.
Definition at line 130 of file stream_iterator.h.
|
inline |
__x | A reverse_iterator. |
__y | A reverse_iterator. |
Reverse iterators forward many operations to their underlying base() iterators. Others are implemented in terms of one another.
Definition at line 292 of file bits/stl_iterator.h.
References std::reverse_iterator< _Iterator >::base(), std::reverse_iterator< _Iterator >::operator+(), and std::reverse_iterator< _Iterator >::operator-().