Designar::Range< T >::Iterator Class Reference

#include <range.H>

Inheritance diagram for Designar::Range< T >::Iterator:

Collaboration diagram for Designar::Range< T >::Iterator:

Public Member Functions
	Iterator (const Range &_r)
	Iterator (const Range &_r, T current_position)
bool	has_current () const
T	get_current () const
void	next ()
void	next_n (nat_t n)
void	prev ()
void	prev_n (nat_t n)
void	reset ()
Public Member Functions inherited from Designar::RandomAccessIterator< Iterator, T, true >
RetType< RET_CPY, T, T & >	operator[] (nat_t i)
Iterator &	operator+= (nat_t p)
Iterator	operator+ (nat_t p)
Iterator &	operator-= (nat_t p)
Iterator	operator- (nat_t p)
bool	operator< (const Iterator &it) const
bool	operator<= (const Iterator &it) const
bool	operator> (const Iterator &it) const
bool	operator>= (const Iterator &it) const
Public Member Functions inherited from Designar::BidirectionalIterator< Iterator, T, RET_CPY >
Iterator &	operator-- ()
Iterator	operator-- (int)
Public Member Functions inherited from Designar::ForwardIterator< Iterator, T, RET_CPY >
Iterator &	operator++ ()
Iterator	operator++ (int)
Public Member Functions inherited from Designar::BasicIterator< Iterator, T, RET_CPY >
bool	has_curr () const
RetType< RET_CPY, T, T & >	get_curr ()
RetType< RET_CPY, T, const T & >	get_curr () const
RetType< RET_CPY, T, T & >	operator* ()
RetType< RET_CPY, T, const T & >	operator* () const
T *	operator-> ()
bool	operator== (const Iterator &it) const
bool	operator!= (const Iterator &it) const

Protected Member Functions
nat_t	get_location () const
Protected Member Functions inherited from Designar::BasicIterator< Iterator, T, RET_CPY >
Iterator &	me ()
const Iterator &	const_me () const

Friends
class	BasicIterator< Iterator, T, true >

Constructor & Destructor Documentation

template<typename T>

Designar::Range< T >::Iterator::Iterator ( const Range &  _r )

inline

template<typename T>

Designar::Range< T >::Iterator::Iterator ( const Range &  _r, T  current_position  )

inline

Member Function Documentation

template<typename T>

T Designar::Range< T >::Iterator::get_current ( ) const

inline

template<typename T>

nat_t Designar::Range< T >::Iterator::get_location ( ) const

inlineprotected

template<typename T>

bool Designar::Range< T >::Iterator::has_current ( ) const

inline

template<typename T>

void Designar::Range< T >::Iterator::next ( )

inline

template<typename T>

void Designar::Range< T >::Iterator::next_n ( nat_t  n )

inline

template<typename T>

void Designar::Range< T >::Iterator::prev ( )

inline

template<typename T>

void Designar::Range< T >::Iterator::prev_n ( nat_t  n )

inline

template<typename T>

void Designar::Range< T >::Iterator::reset ( )

inline

Friends And Related Function Documentation

template<typename T>

friend class BasicIterator< Iterator, T, true >

friend

---

The documentation for this class was generated from the following file:

• include/range.H