#include <TNodeList.h>

Classes
class	Iterator

class	TNode

Public Member Functions
	TNodeList ()

	~TNodeList ()

void	InsertAfter (T insertAfter, T newNode)

void	InsertBefore (T insertBefore, T newNode)

T *	Remove (T *pNode)

void	RemoveAll ()

Iterator	RemoveHead ()

Iterator	RemoveTail ()

void	DeleteHead ()

void	DeleteTail ()

void	DeleteAll ()

void	Delete (T *pNode)

void	InsertHead (T *a_pNode)

void	InsertTail (T *a_pNode)

TBOOL	IsEmpty () const

TBOOL	IsValid (const T *a_pNode) const

TSIZE	Count () const

Iterator	Head () const

Iterator	Tail () const

Iterator	Begin () const

Iterator	End () const

Iterator	RBegin () const

Iterator	REnd () const

Protected Attributes
TNode	m_oRoot

TINT	m_iCount

Detailed Description

template<class T>
class TNodeList< T >

Definition at line 6 of file TNodeList.h.

Constructor & Destructor Documentation

◆ TNodeList()

template<class T>

TNodeList< T >::TNodeList ( )

inline

Definition at line 129 of file TNodeList.h.

    {
        m_iCount = 0;
    }

◆ ~TNodeList()

template<class T>

TNodeList< T >::~TNodeList ( )

inline

Definition at line 134 of file TNodeList.h.

    {
        DeleteAll();
    }

Member Function Documentation

◆ Begin()

template<class T>

Iterator TNodeList< T >::Begin ( ) const

inline

Definition at line 230 of file TNodeList.h.

230{ return m_oRoot.m_pNext; }

TNodeList::m_oRoot

TNode m_oRoot

Definition TNodeList.h:237

◆ Count()

template<class T>

TSIZE TNodeList< T >::Count ( ) const

inline

Definition at line 225 of file TNodeList.h.

225{ return m_iCount; }

◆ Delete()

template<class T>

void TNodeList< T >::Delete ( T * pNode )

inline

Definition at line 213 of file TNodeList.h.

    {
        Remove( pNode );
        delete pNode;
    }

◆ DeleteAll()

template<class T>

void TNodeList< T >::DeleteAll ( )

inline

Definition at line 205 of file TNodeList.h.

    {
        while ( !IsEmpty() )
        {
            DeleteHead();
        }
    }

◆ DeleteHead()

template<class T>

void TNodeList< T >::DeleteHead ( )

inline

Definition at line 202 of file TNodeList.h.

202{ Delete( Head() ); }

TNodeList::Delete

void Delete(T *pNode)

Definition TNodeList.h:213

TNodeList::Head

Iterator Head() const

Definition TNodeList.h:227

◆ DeleteTail()

template<class T>

void TNodeList< T >::DeleteTail ( )

inline

Definition at line 203 of file TNodeList.h.

203{ Delete( Tail() ); }

TNodeList::Tail

Iterator Tail() const

Definition TNodeList.h:228

◆ End()

template<class T>

Iterator TNodeList< T >::End ( ) const

inline

Definition at line 231 of file TNodeList.h.

231{ return TSTATICCAST( T, &m_oRoot ); }

TSTATICCAST

#define TSTATICCAST(POINTERTYPE, VALUE)

Definition Defines.h:69

◆ Head()

template<class T>

Iterator TNodeList< T >::Head ( ) const

inline

Definition at line 227 of file TNodeList.h.

227{ return m_oRoot.m_pNext; }

◆ InsertAfter()

template<class T>

void TNodeList< T >::InsertAfter	(	T *	insertAfter,
		T *	newNode )

inline

Definition at line 139 of file TNodeList.h.

    {
        TASSERT( !newNode->IsLinked() );
        newNode->SetList( this );
        newNode->m_pNext              = insertAfter->m_pNext;
        newNode->m_pPrev              = insertAfter;
        insertAfter->m_pNext->m_pPrev = newNode;
        insertAfter->m_pNext          = newNode;
        m_iCount++;
    }

◆ InsertBefore()

template<class T>

void TNodeList< T >::InsertBefore	(	T *	insertBefore,
		T *	newNode )

inline

Definition at line 150 of file TNodeList.h.

    {
        TASSERT( !newNode->IsLinked() );
        newNode->SetList( this );
        newNode->m_pNext               = insertBefore;
        newNode->m_pPrev               = insertBefore->m_pPrev;
        insertBefore->m_pPrev->m_pNext = newNode;
        insertBefore->m_pPrev          = newNode;
        m_iCount++;
    }

◆ InsertHead()

template<class T>

void TNodeList< T >::InsertHead ( T * a_pNode )

inline

Definition at line 219 of file TNodeList.h.

219{ InsertAfter( End(), a_pNode ); }

TNodeList::End

Iterator End() const

Definition TNodeList.h:231

TNodeList::InsertAfter

void InsertAfter(T *insertAfter, T *newNode)

Definition TNodeList.h:139

◆ InsertTail()

template<class T>

void TNodeList< T >::InsertTail ( T * a_pNode )

inline

Definition at line 220 of file TNodeList.h.

220{ InsertBefore( End(), a_pNode ); }

TNodeList::InsertBefore

void InsertBefore(T *insertBefore, T *newNode)

Definition TNodeList.h:150

◆ IsEmpty()

template<class T>

TBOOL TNodeList< T >::IsEmpty ( ) const

inline

Definition at line 222 of file TNodeList.h.

222{ return Begin() == End(); }

TNodeList::Begin

Iterator Begin() const

Definition TNodeList.h:230

◆ IsValid()

template<class T>

TBOOL TNodeList< T >::IsValid ( const T * a_pNode ) const

inline

Definition at line 223 of file TNodeList.h.

223{ return a_pNode != TNULL && a_pNode->m_pList == this; }

◆ RBegin()

template<class T>

Iterator TNodeList< T >::RBegin ( ) const

inline

Definition at line 233 of file TNodeList.h.

233{ return m_oRoot.m_pPrev; }

◆ Remove()

template<class T>

T * TNodeList< T >::Remove ( T * pNode )

inline

Definition at line 161 of file TNodeList.h.

    {
        TASSERT( pNode->GetList() == this );
        pNode->SetList( TNULL );
        pNode->m_pPrev->m_pNext = pNode->m_pNext;
        pNode->m_pNext->m_pPrev = pNode->m_pPrev;
        pNode->m_pNext          = pNode;
        pNode->m_pPrev          = pNode;
        m_iCount--;
        TASSERT( pNode->IsLinked() == TFALSE );
        return pNode;
    }

◆ RemoveAll()

template<class T>

void TNodeList< T >::RemoveAll ( )

inline

Definition at line 174 of file TNodeList.h.

    {
        while ( !IsEmpty() )
        {
            Remove( m_oRoot.Next() );
        }
    }

◆ RemoveHead()

template<class T>

Iterator TNodeList< T >::RemoveHead ( )

inline

Definition at line 182 of file TNodeList.h.

    {
        if ( !IsEmpty() )
        {
            return Remove( m_oRoot.Next() );
        }
 
        return TNULL;
    }

◆ RemoveTail()

template<class T>

Iterator TNodeList< T >::RemoveTail ( )

inline

Definition at line 192 of file TNodeList.h.

    {
        if ( !IsEmpty() )
        {
            return Remove( m_oRoot.Prev() );
        }
 
        return TNULL;
    }

◆ REnd()

template<class T>

Iterator TNodeList< T >::REnd ( ) const

inline

Definition at line 234 of file TNodeList.h.

234{ return TSTATICCAST( T, &m_oRoot ); }

◆ Tail()

template<class T>

Iterator TNodeList< T >::Tail ( ) const

inline

Definition at line 228 of file TNodeList.h.

228{ return m_oRoot.m_pPrev; }

Member Data Documentation

◆ m_iCount

template<class T>

TINT TNodeList< T >::m_iCount

protected

Definition at line 238 of file TNodeList.h.

◆ m_oRoot

template<class T>

TNode TNodeList< T >::m_oRoot

mutableprotected

Definition at line 237 of file TNodeList.h.

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

D:/_dev/OpenBarnyard/Source/Toshi/Source/Toshi/TNodeList.h

Classes

Public Member Functions

Protected Attributes

Detailed Description

Constructor & Destructor Documentation

◆ TNodeList()

◆ ~TNodeList()

Member Function Documentation

◆ Begin()

◆ Count()

◆ Delete()

◆ DeleteAll()

◆ DeleteHead()

◆ DeleteTail()

◆ End()

◆ Head()

◆ InsertAfter()

◆ InsertBefore()

◆ InsertHead()

◆ InsertTail()

◆ IsEmpty()

◆ IsValid()

◆ RBegin()

◆ Remove()

◆ RemoveAll()

◆ RemoveHead()

◆ RemoveTail()

◆ REnd()

◆ Tail()

Member Data Documentation

◆ m_iCount

◆ m_oRoot