LinkedListElement Class Reference

#include <LinkedList.h>

Public Member Functions
	LinkedListElement ()
virtual	~LinkedListElement ()
bool	hasNext () const
bool	hasPrev () const
bool	isInList () const
LinkedListElement *	next ()
LinkedListElement const *	next () const
LinkedListElement *	prev ()
LinkedListElement const *	prev () const
LinkedListElement *	nocheck_next ()
LinkedListElement const *	nocheck_next () const
LinkedListElement *	nocheck_prev ()
LinkedListElement const *	nocheck_prev () const
void	delink ()
void	insertBefore (LinkedListElement *pElem)
void	insertAfter (LinkedListElement *pElem)

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

Private Attributes
LinkedListElement *	iNext
LinkedListElement *	iPrev

Friends
class	LinkedListHead

Constructor & Destructor Documentation

LinkedListElement::LinkedListElement ( )

inline

: iNext(NULL), iPrev(NULL) { }

virtual LinkedListElement::~LinkedListElement ( )

inlinevirtual

{ delink(); }

Here is the call graph for this function:

LinkedListElement::LinkedListElement ( LinkedListElement const &  )

private

Member Function Documentation

void LinkedListElement::delink ( )

inline

 {
 if (isInList())
 {
 iNext->iPrev = iPrev; iPrev->iNext = iNext; iNext = NULL; iPrev = NULL;
 }
 }

Here is the call graph for this function:

Here is the caller graph for this function:

bool LinkedListElement::hasNext ( ) const

inline

{ return(iNext && iNext->iNext != NULL); }

Here is the caller graph for this function:

bool LinkedListElement::hasPrev ( ) const

inline

{ return(iPrev && iPrev->iPrev != NULL); }

Here is the caller graph for this function:

void LinkedListElement::insertAfter ( LinkedListElement *  pElem )

inline

 {
 pElem->iPrev = this;
 pElem->iNext = iNext;
 iNext->iPrev = pElem;
 iNext = pElem;
 }

Here is the caller graph for this function:

void LinkedListElement::insertBefore ( LinkedListElement *  pElem )

inline

 {
 pElem->iNext = this;
 pElem->iPrev = iPrev;
 iPrev->iNext = pElem;
 iPrev = pElem;
 }

Here is the caller graph for this function:

bool LinkedListElement::isInList ( ) const

inline

{ return(iNext != NULL && iPrev != NULL); }

Here is the caller graph for this function:

LinkedListElement* LinkedListElement::next ( )

inline

{ return hasNext() ? iNext : NULL; }

Here is the call graph for this function:

Here is the caller graph for this function:

LinkedListElement const* LinkedListElement::next ( ) const

inline

{ return hasNext() ? iNext : NULL; }

Here is the call graph for this function:

LinkedListElement* LinkedListElement::nocheck_next ( )

inline

{ return iNext; }

Here is the caller graph for this function:

LinkedListElement const* LinkedListElement::nocheck_next ( ) const

inline

{ return iNext; }

LinkedListElement* LinkedListElement::nocheck_prev ( )

inline

{ return iPrev; }

Here is the caller graph for this function:

LinkedListElement const* LinkedListElement::nocheck_prev ( ) const

inline

{ return iPrev; }

LinkedListElement& LinkedListElement::operator= ( LinkedListElement const &  )

private

LinkedListElement* LinkedListElement::prev ( )

inline

{ return hasPrev() ? iPrev : NULL; }

Here is the call graph for this function:

Here is the caller graph for this function:

LinkedListElement const* LinkedListElement::prev ( ) const

inline

{ return hasPrev() ? iPrev : NULL; }

Here is the call graph for this function:

Friends And Related Function Documentation

friend class LinkedListHead

friend

Member Data Documentation

LinkedListElement* LinkedListElement::iNext

private

LinkedListElement* LinkedListElement::iPrev

private

---

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

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