LinkedListHead Class Reference

#include <LinkedList.h>

Classes
class	Iterator

Public Types
typedef Iterator < LinkedListElement >	iterator

Public Member Functions
	LinkedListHead ()
virtual	~LinkedListHead ()
bool	isEmpty () const
LinkedListElement *	getFirst ()
LinkedListElement const *	getFirst () const
LinkedListElement *	getLast ()
LinkedListElement const *	getLast () const
void	insertFirst (LinkedListElement *pElem)
void	insertLast (LinkedListElement *pElem)
uint32	getSize () const
void	incSize ()
void	decSize ()

Private Member Functions
	LinkedListHead (LinkedListHead const &)
LinkedListHead &	operator= (LinkedListHead const &)

Private Attributes
LinkedListElement	iFirst
LinkedListElement	iLast
uint32	iSize

Member Typedef Documentation

typedef Iterator<LinkedListElement> LinkedListHead::iterator

Constructor & Destructor Documentation

LinkedListHead::LinkedListHead ( )

inline

 : iSize(0)
 {
 // create empty list

 iFirst.iNext = &iLast;
 iLast.iPrev = &iFirst;
 }

virtual LinkedListHead::~LinkedListHead ( )

inlinevirtual

{ }

LinkedListHead::LinkedListHead ( LinkedListHead const &  )

private

Member Function Documentation

void LinkedListHead::decSize ( )

inline

{ --iSize; }

Here is the caller graph for this function:

LinkedListElement* LinkedListHead::getFirst ( )

inline

{ return(isEmpty() ? NULL : iFirst.iNext); }

Here is the call graph for this function:

Here is the caller graph for this function:

LinkedListElement const* LinkedListHead::getFirst ( ) const

inline

{ return(isEmpty() ? NULL : iFirst.iNext); }

Here is the call graph for this function:

LinkedListElement* LinkedListHead::getLast ( )

inline

{ return(isEmpty() ? NULL : iLast.iPrev); }

Here is the call graph for this function:

Here is the caller graph for this function:

LinkedListElement const* LinkedListHead::getLast ( ) const

inline

{ return(isEmpty() ? NULL : iLast.iPrev); }

Here is the call graph for this function:

uint32 LinkedListHead::getSize ( ) const

inline

 {
 if (!iSize)
 {
 uint32 result = 0;
 LinkedListElement const* e = getFirst();
 while (e)
 {
 ++result;
 e = e->next();
 }
 return result;
 }
 else
 return iSize;
 }

Here is the call graph for this function:

Here is the caller graph for this function:

void LinkedListHead::incSize ( )

inline

{ ++iSize; }

Here is the caller graph for this function:

void LinkedListHead::insertFirst ( LinkedListElement *  pElem )

inline

 {
 iFirst.insertAfter(pElem);
 }

Here is the call graph for this function:

Here is the caller graph for this function:

void LinkedListHead::insertLast ( LinkedListElement *  pElem )

inline

 {
 iLast.insertBefore(pElem);
 }

Here is the call graph for this function:

bool LinkedListHead::isEmpty ( ) const

inline

{ return(!iFirst.iNext->isInList()); }

Here is the call graph for this function:

LinkedListHead& LinkedListHead::operator= ( LinkedListHead const &  )

private

Member Data Documentation

LinkedListElement LinkedListHead::iFirst

private

LinkedListElement LinkedListHead::iLast

private

uint32 LinkedListHead::iSize

private

---

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

• src/server/shared/Dynamic/LinkedList.h