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

#include <list.H>

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

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

Public Member Functions
	Iterator ()
	Iterator (const SLList< T > &l)
	Iterator (const SLList< T > &l, Node *c)
	Iterator (const Iterator &it)
	Iterator (Iterator &&it)
Iterator &	operator= (const Iterator &it)
Iterator &	operator= (Iterator &&it)
void	swap (Iterator &it)
lint_t	get_position () const
bool	has_current () const
T &	get_current ()
const T &	get_current () const
void	next ()
void	reset ()
T	del ()
Public Member Functions inherited from Designar::ForwardIterator< Iterator, T >
Iterator &	operator++ ()
Iterator	operator++ (int)
Public Member Functions inherited from Designar::BasicIterator< Iterator, T, false >
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
Node *	get_location () const
Protected Member Functions inherited from Designar::BasicIterator< Iterator, T, false >
Iterator &	me ()
const Iterator &	const_me () const

Friends
class	BasicIterator< Iterator, T >

Constructor & Destructor Documentation

template<typename T>

Designar::SLList< T >::Iterator::Iterator ( )

inline

template<typename T>

Designar::SLList< T >::Iterator::Iterator ( const SLList< T > &  l )

inline

template<typename T>

Designar::SLList< T >::Iterator::Iterator ( const SLList< T > &  l, Node *  c  )

inline

template<typename T>

Designar::SLList< T >::Iterator::Iterator ( const Iterator &  it )

inline

template<typename T>

Designar::SLList< T >::Iterator::Iterator ( Iterator &&  it )

inline

Member Function Documentation

template<typename T>

T Designar::SLList< T >::Iterator::del ( )

inline

template<typename T>

T& Designar::SLList< T >::Iterator::get_current ( )

inline

template<typename T>

const T& Designar::SLList< T >::Iterator::get_current ( ) const

inline

template<typename T>

Node* Designar::SLList< T >::Iterator::get_location ( ) const

inlineprotected

template<typename T>

lint_t Designar::SLList< T >::Iterator::get_position ( ) const

inline

template<typename T>

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

inline

template<typename T>

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

inline

template<typename T>

Iterator& Designar::SLList< T >::Iterator::operator= ( const Iterator &  it )

inline

template<typename T>

Iterator& Designar::SLList< T >::Iterator::operator= ( Iterator &&  it )

inline

template<typename T>

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

inline

template<typename T>

void Designar::SLList< T >::Iterator::swap ( Iterator &  it )

inline

Friends And Related Function Documentation

template<typename T>

friend class BasicIterator< Iterator, T >

friend

---

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

• include/list.H