#include <TNodeTree.h>

Classes
class	TNode

Public Member Functions
	TNodeTree ()

	~TNodeTree ()

void	Insert (T parentNode, T sourceNode)
	Inserts node as a child of another node.

void	InsertAtRoot (T *sourceNode)
	Inserts node to the default tree.

void	ReInsert (T parentNode, T sourceNode)
	Tries to remove sourceNode from the tree and inserts it to the parentNode or to the root.

T *	Remove (T &node, TBOOL flag=false)

T *	Remove (T *node, TBOOL flag=false)

void	DeleteRecurse (T *node)

void	DeleteAll ()

T *	GetRoot ()

T *	ChildOfRoot ()

size_t	Count () const

TBOOL	IsLinked () const

Protected Attributes
TNode	m_Root

size_t	m_Count

Detailed Description

template<class T>
class TNodeTree< T >

Definition at line 7 of file TNodeTree.h.

Constructor & Destructor Documentation

◆ TNodeTree()

template<class T>

TNodeTree< T >::TNodeTree ( )

inline

Definition at line 48 of file TNodeTree.h.

    {
        m_Count = 0;
    }

◆ ~TNodeTree()

template<class T>

TNodeTree< T >::~TNodeTree ( )

inline

Definition at line 53 of file TNodeTree.h.

    {
        DeleteAll();
        TASSERT( IsLinked() == TFALSE );
    }

Member Function Documentation

◆ ChildOfRoot()

template<class T>

T * TNodeTree< T >::ChildOfRoot ( )

inline

Definition at line 246 of file TNodeTree.h.

    {
        return m_Root.Child();
    }

◆ Count()

template<class T>

size_t TNodeTree< T >::Count ( ) const

inline

Definition at line 251 of file TNodeTree.h.

    {
        return m_Count;
    }

◆ DeleteAll()

template<class T>

void TNodeTree< T >::DeleteAll ( )

inline

Definition at line 227 of file TNodeTree.h.

    {
        T* node = GetRoot()->Child();
 
        while ( node != TNULL )
        {
            Remove( node, TFALSE );
            DeleteRecurse( node );
            node = GetRoot()->Child();
        }
 
        TASSERT( Count() == 0 );
    }

◆ DeleteRecurse()

template<class T>

void TNodeTree< T >::DeleteRecurse ( T * node )

inline

Definition at line 184 of file TNodeTree.h.

    {
        while ( node != TNULL )
        {
            T* next = ( node->Next() != node ) ? node->Next() : TNULL;
 
            if ( node->Child() != TNULL )
            {
                DeleteRecurse( node->Child() );
            }
 
            if ( node->Tree() == this )
            {
                m_Count -= 1;
            }
 
            if ( node->Tree() == TNULL || node->Tree() == this )
            {
                T* nodeParent = node->Parent();
 
                if ( nodeParent != TNULL )
                {
                    // If it's the first attached to the root node, set it to next or just remove
                    if ( nodeParent->Child() == node )
                    {
                        nodeParent->m_Child = ( node->Next() != node ) ? node->Next() : TNULL;
                    }
 
                    node->m_Parent = TNULL;
                }
 
                node->m_Prev->m_Parent = node->m_Next;
                node->m_Next->m_Child  = node->m_Prev;
                node->m_Next           = node;
                node->m_Prev           = node;
                node->m_Tree           = TNULL;
            }
 
            delete node;
            node = next;
        }
    }

◆ GetRoot()

template<class T>

T * TNodeTree< T >::GetRoot ( )

inline

Definition at line 241 of file TNodeTree.h.

    {
        return TSTATICCAST( T, &m_Root );
    }

◆ Insert()

template<class T>

void TNodeTree< T >::Insert	(	T *	parentNode,
		T *	sourceNode )

inline

Inserts node as a child of another node.

Parameters

parentNode	Pointer to the parent node.
sourceNode	Pointer to the node you want to insert.

Definition at line 65 of file TNodeTree.h.

    {
        // Toshi::TNodeTree<Toshi::TResource>::Insert - 00691aa0
        TASSERT( sourceNode->IsLinked() == TFALSE, "The source node shouldn't be linked" );
 
        // Remove the source node from the tree
        Remove( *sourceNode, TFALSE );
 
        // Get the first attached to parent node
        T* firstAttached = parentNode->Child();
 
        if ( firstAttached != TNULL )
        {
            // Attach node to other attached nodes
            T* lastAttached = firstAttached->Prev();
 
            lastAttached->m_Next  = sourceNode;
            firstAttached->m_Prev = sourceNode;
 
            sourceNode->m_Next = firstAttached;
            sourceNode->m_Prev = lastAttached;
        }
        else
        {
            // Attach node as the first one
            parentNode->m_Child = sourceNode;
        }
 
        sourceNode->m_Tree   = this;
        sourceNode->m_Parent = parentNode;
        m_Count += 1;
    }

◆ InsertAtRoot()

template<class T>

void TNodeTree< T >::InsertAtRoot ( T * sourceNode )

inline

Inserts node to the default tree.

Parameters

sourceNode Pointer to the node you want to insert.

Definition at line 103 of file TNodeTree.h.

    {
        Insert( GetRoot(), sourceNode );
    }

◆ IsLinked()

template<class T>

TBOOL TNodeTree< T >::IsLinked ( ) const

inline

Definition at line 256 of file TNodeTree.h.

    {
        return m_Root.IsLinked();
    }

◆ ReInsert()

template<class T>

void TNodeTree< T >::ReInsert	(	T *	parentNode,
		T *	sourceNode )

inline

Tries to remove sourceNode from the tree and inserts it to the parentNode or to the root.

Definition at line 111 of file TNodeTree.h.

    {
        Remove( sourceNode, TFALSE );
 
        if ( parentNode == TNULL )
        {
            if ( this != TNULL )
            {
                InsertAtRoot( sourceNode );
                return;
            }
        }
 
        Insert( parentNode, sourceNode );
    }

◆ Remove() [1/2]

template<class T>

T * TNodeTree< T >::Remove	(	T &	node,
		TBOOL	flag = false )

inline

Definition at line 127 of file TNodeTree.h.

    {
        // Toshi::TNodeTree<Toshi::TResource>::Remove - 00691e70
        TNodeTree<T>* nodeRoot   = node.Tree();
        T*            nodeParent = node.Parent();
 
        if ( nodeRoot != TNULL )
        {
            // Check if the node belongs to the current tree
            if ( nodeRoot != this )
            {
                return &node;
            }
 
            m_Count -= 1;
        }
 
        if ( flag )
        {
            T* attachedNode = node.Child();
 
            while ( attachedNode != TNULL )
            {
                TNodeTree<T>* nodeRoot = node.Tree();
 
                Remove( *attachedNode, TFALSE );
                Insert( node.Parent(), attachedNode );
 
                attachedNode = node.Child();
                TIMPLEMENT_D( "It seems to be unused and I hope it is. I don't know if it works and what it should do" );
            }
        }
 
        if ( nodeParent != TNULL )
        {
            // If it's the first attached to the root node, set it to next or just remove
            if ( nodeParent->Child() == &node )
            {
                nodeParent->m_Child = ( node.Next() != &node ) ? node.Next() : TNULL;
            }
 
            node.m_Parent = TNULL;
        }
 
        node.m_Prev->m_Next = node.m_Next;
        node.m_Next->m_Prev = node.m_Prev;
        node.m_Next         = &node;
        node.m_Prev         = &node;
        node.m_Tree         = TNULL;
        return &node;
    }

◆ Remove() [2/2]

template<class T>

T * TNodeTree< T >::Remove	(	T *	node,
		TBOOL	flag = false )

inline

Definition at line 179 of file TNodeTree.h.

    {
        return Remove( *node, flag );
    }

Member Data Documentation

◆ m_Count

template<class T>

size_t TNodeTree< T >::m_Count

protected

Definition at line 263 of file TNodeTree.h.

◆ m_Root

template<class T>

TNode TNodeTree< T >::m_Root

protected

Definition at line 262 of file TNodeTree.h.

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

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

Classes

Public Member Functions

Protected Attributes

Detailed Description

Constructor & Destructor Documentation

◆ TNodeTree()

◆ ~TNodeTree()

Member Function Documentation

◆ ChildOfRoot()

◆ Count()

◆ DeleteAll()

◆ DeleteRecurse()

◆ GetRoot()

◆ Insert()

◆ InsertAtRoot()

◆ IsLinked()

◆ ReInsert()

◆ Remove() [1/2]

◆ Remove() [2/2]

Member Data Documentation

◆ m_Count

◆ m_Root