|
|
Whole document tree
stl_iterator_base.h File Reference
Main Page Namespace List Class Hierarchy Alphabetical List Compound List File List Namespace Members Compound Members File Members
stl_iterator_base.h File Reference#include <bits/concept_checks.h>
Include dependency graph for stl_iterator_base.h:
Go to the source code of this file.
Compounds |
struct | bidirectional_iterator |
struct | bidirectional_iterator_tag |
struct | forward_iterator |
struct | forward_iterator_tag |
struct | input_iterator |
struct | input_iterator_tag |
struct | output_iterator |
struct | output_iterator_tag |
struct | random_access_iterator |
struct | random_access_iterator_tag |
Defines |
#define | __ITERATOR_CATEGORY(__i) iterator_category(__i) |
#define | __DISTANCE_TYPE(__i) distance_type(__i) |
#define | __VALUE_TYPE(__i) value_type(__i) |
Functions |
template<class _Tp, class _Distance> input_iterator_tag | iterator_category (const input_iterator< _Tp, _Distance > &) |
output_iterator_tag | iterator_category (const output_iterator &) |
template<class _Tp, class _Distance> forward_iterator_tag | iterator_category (const forward_iterator< _Tp, _Distance > &) |
template<class _Tp, class _Distance> bidirectional_iterator_tag | iterator_category (const bidirectional_iterator< _Tp, _Distance > &) |
template<class _Tp, class _Distance> random_access_iterator_tag | iterator_category (const random_access_iterator< _Tp, _Distance > &) |
template<class _Tp> random_access_iterator_tag | iterator_category (const _Tp *) |
template<class _Tp, class _Distance> _Tp * | value_type (const input_iterator< _Tp, _Distance > &) |
template<class _Tp, class _Distance> _Tp * | value_type (const forward_iterator< _Tp, _Distance > &) |
template<class _Tp, class _Distance> _Tp * | value_type (const bidirectional_iterator< _Tp, _Distance > &) |
template<class _Tp, class _Distance> _Tp * | value_type (const random_access_iterator< _Tp, _Distance > &) |
template<class _Tp> _Tp * | value_type (const _Tp *) |
template<class _Tp, class _Distance> _Distance * | distance_type (const input_iterator< _Tp, _Distance > &) |
template<class _Tp, class _Distance> _Distance * | distance_type (const forward_iterator< _Tp, _Distance > &) |
template<class _Tp, class _Distance> _Distance * | distance_type (const bidirectional_iterator< _Tp, _Distance > &) |
template<class _Tp, class _Distance> _Distance * | distance_type (const random_access_iterator< _Tp, _Distance > &) |
template<class _Tp> ptrdiff_t * | distance_type (const _Tp *) |
template<class _InputIterator, class _Distance> void | __distance (_InputIterator __first, _InputIterator __last, _Distance &__n, input_iterator_tag) |
template<class _RandomAccessIterator, class _Distance> void | __distance (_RandomAccessIterator __first, _RandomAccessIterator __last, _Distance &__n, random_access_iterator_tag) |
template<class _InputIterator, class _Distance> void | distance (_InputIterator __first, _InputIterator __last, _Distance &__n) |
template<class _InputIter, class _Distance> void | __advance (_InputIter &__i, _Distance __n, input_iterator_tag) |
template<class _BidirectionalIterator, class _Distance> void | __advance (_BidirectionalIterator &__i, _Distance __n, bidirectional_iterator_tag) |
template<class _RandomAccessIterator, class _Distance> void | __advance (_RandomAccessIterator &__i, _Distance __n, random_access_iterator_tag) |
template<class _InputIterator, class _Distance> void | advance (_InputIterator &__i, _Distance __n) |
Define Documentation
#define __DISTANCE_TYPE |
( |
__i |
|
) |
distance_type(__i)
|
|
#define __ITERATOR_CATEGORY |
( |
__i |
|
) |
iterator_category(__i)
|
|
#define __VALUE_TYPE |
( |
__i |
|
) |
value_type(__i)
|
|
Function Documentation
template<class _RandomAccessIterator, class _Distance> |
void __advance |
( |
_RandomAccessIterator & |
__i, |
|
|
_Distance |
__n, |
|
|
random_access_iterator_tag |
|
|
) |
[inline] |
|
template<class _BidirectionalIterator, class _Distance> |
void __advance |
( |
_BidirectionalIterator & |
__i, |
|
|
_Distance |
__n, |
|
|
bidirectional_iterator_tag |
|
|
) |
[inline] |
|
template<class _InputIter, class _Distance> |
void __advance |
( |
_InputIter & |
__i, |
|
|
_Distance |
__n, |
|
|
input_iterator_tag |
|
|
) |
[inline] |
|
template<class _RandomAccessIterator, class _Distance> |
void __distance |
( |
_RandomAccessIterator |
__first, |
|
|
_RandomAccessIterator |
__last, |
|
|
_Distance & |
__n, |
|
|
random_access_iterator_tag |
|
|
) |
[inline] |
|
template<class _InputIterator, class _Distance> |
void __distance |
( |
_InputIterator |
__first, |
|
|
_InputIterator |
__last, |
|
|
_Distance & |
__n, |
|
|
input_iterator_tag |
|
|
) |
[inline] |
|
template<class _InputIterator, class _Distance> |
void advance |
( |
_InputIterator & |
__i, |
|
|
_Distance |
__n |
|
) |
[inline] |
|
|
Definition at line 354 of file stl_iterator_base.h.
References __advance(), __STL_REQUIRES, and iterator_category().
Referenced by std::vector< _Tp, _Alloc >::_M_assign_aux(), std::deque< _Tp, _Alloc >::_M_assign_aux(), std::vector< bool, _Alloc >::_M_assign_aux(), std::deque< _Tp, _Alloc >::_M_insert_aux(), std::deque< _Tp, _Alloc >::_M_range_initialize(), and std::vector< _Tp, _Alloc >::_M_range_insert(). |
template<class _InputIterator, class _Distance> |
void distance |
( |
_InputIterator |
__first, |
|
|
_InputIterator |
__last, |
|
|
_Distance & |
__n |
|
) |
[inline] |
|
|
Definition at line 284 of file stl_iterator_base.h.
References __distance(), __STL_REQUIRES, and iterator_category().
Referenced by __BVECTOR::__VECTOR(), std::vector< _Tp, _Alloc >::_M_assign_aux(), std::deque< _Tp, _Alloc >::_M_assign_aux(), std::vector< bool, _Alloc >::_M_assign_aux(), std::vector< bool, _Alloc >::_M_initialize_range(), std::vector< bool, _Alloc >::_M_insert_range(), std::vector< _Node *, _Alloc >::_M_range_initialize(), std::deque< _Tp, _Alloc >::_M_range_initialize(), std::vector< _Tp, _Alloc >::_M_range_insert(), std::basic_string< _CharT, _Traits, _Alloc >::_M_replace(), std::basic_string< _CharT, _Traits, _Alloc >::_S_construct(), std::_Temporary_buffer< _ForwardIterator, _Tp >::_Temporary_buffer(), std::deque< _Tp, _Alloc >::insert(), __BVECTOR::insert(), std::hashtable< _Value, _Value, _HashFcn, _Identity< _Value >, _EqualKey, _Alloc >::insert_equal(), std::hashtable< _Value, _Value, _HashFcn, _Identity< _Value >, _EqualKey, _Alloc >::insert_unique(), and std::list< _Tp, _Alloc >::size(). |
template<class _Tp> |
ptrdiff_t* distance_type |
( |
const _Tp * |
|
) |
[inline] |
|
template<class _Tp, class _Distance> |
_Distance* distance_type |
( |
const random_access_iterator< _Tp, _Distance > & |
|
) |
[inline] |
|
template<class _Tp, class _Distance> |
_Distance* distance_type |
( |
const bidirectional_iterator< _Tp, _Distance > & |
|
) |
[inline] |
|
template<class _Tp, class _Distance> |
_Distance* distance_type |
( |
const forward_iterator< _Tp, _Distance > & |
|
) |
[inline] |
|
template<class _Tp, class _Distance> |
_Distance* distance_type |
( |
const input_iterator< _Tp, _Distance > & |
|
) |
[inline] |
|
template<class _Tp> |
_Tp* value_type |
( |
const _Tp * |
|
) |
[inline] |
|
template<class _Tp, class _Distance> |
_Tp* value_type |
( |
const random_access_iterator< _Tp, _Distance > & |
|
) |
[inline] |
|
template<class _Tp, class _Distance> |
_Tp* value_type |
( |
const bidirectional_iterator< _Tp, _Distance > & |
|
) |
[inline] |
|
template<class _Tp, class _Distance> |
_Tp* value_type |
( |
const forward_iterator< _Tp, _Distance > & |
|
) |
[inline] |
|
template<class _Tp, class _Distance> |
_Tp* value_type |
( |
const input_iterator< _Tp, _Distance > & |
|
) |
[inline] |
|
Generated on Mon Apr 8 03:15:50 2002 for libstdc++-v3 Source by
1.2.15
|