LList< T > Class Template Reference

#include <linkedList.h>

Public Member Functions
	LList ()
void	reset (void)
int	size (void) const
T *	first (void) const
T *	last (void) const
T *	next (T *current)
T *	prev (T *current)
T *	link (T *entry, T *next=NULL)
T *	link (T &entry, T *next=NULL)
void	unlink (T *entry)
T *	alloc (T *next=NULL)
void	free (T *entry)
void	free (void)
LListNode< T > *	findNode (T *entry)
LListNode< T > *	iterate (LListNode< T > *entry=NULL)

Protected Attributes
LListNode< T > *	first_entry
LListNode< T > *	last_entry
int	cnt

Constructor & Destructor Documentation

LList()

template<class T >

LList ( )

inline

Member Function Documentation

alloc()

template<class T >

T * alloc ( T *  next = NULL )

inline

findNode()

template<class T >

LListNode< T > * findNode ( T *  entry )

inline

first()

template<class T >

T * first ( void  ) const

inline

free() [1/2]

template<class T >

void free ( T *  entry )

inline

free() [2/2]

template<class T >

void free ( void  )

inline

iterate()

template<class T >

LListNode< T > * iterate ( LListNode< T > *  entry = NULL )

inline

last()

template<class T >

T * last ( void  ) const

inline

link() [1/2]

template<class T >

T * link ( T &  entry, T *  next = NULL  )

inline

link() [2/2]

template<class T >

T * link ( T *  entry, T *  next = NULL  )

inline

next()

template<class T >

T * next ( T *  current )

inline

prev()

template<class T >

T * prev ( T *  current )

inline

reset()

template<class T >

void reset ( void  )

inline

size()

template<class T >

int size ( void  ) const

inline

unlink()

template<class T >

void unlink ( T *  entry )

inline

Member Data Documentation

cnt

template<class T >

int cnt

protected

first_entry

template<class T >

LListNode< T >* first_entry

protected

last_entry

template<class T >

LListNode< T >* last_entry

protected

---

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

• collection/linkedList.h