#include <T2Map.h>

Public Types
using	Pair = T2Pair<KeyType, ValueType, Comparator>

using	Iterator = T2RedBlackTree<Pair>::Iterator

using	CIterator = T2RedBlackTree<Pair>::CIterator

using	Node = T2RedBlackTree<Pair>::Node

Public Member Functions
	T2Map (T2Allocator *a_pAllocator=GetGlobalAllocator())

	~T2Map ()

void	Clear ()

TSIZE	Size () const

template<class... Args>
ValueType *	Emplace (const KeyType &key, Args &&... args)

ValueType *	Insert (const KeyType &key, const ValueType &value)

ValueType *	Insert (const KeyType &key, ValueType &&value)

void	Remove (const KeyType &key)

void	Remove (Iterator &it)

Iterator	FindByValue (const ValueType &value)

Iterator	Find (const KeyType &key)

Iterator	FindNext (Iterator a_oIterator, const KeyType &a_rKey)

TBOOL	IsValid (Iterator a_oIterator) const

Iterator	Begin ()

Iterator	End ()

const CIterator	Begin () const

const CIterator	End () const

TBOOL	IsEmpty () const

Iterator	operator[] (const KeyType &key)

T2Allocator *	GetAllocator () const

Detailed Description

template<class KeyType, class ValueType, class Comparator = TComparator<KeyType>>
class T2Map< KeyType, ValueType, Comparator >

Definition at line 9 of file T2Map.h.

Member Typedef Documentation

◆ CIterator

template<class KeyType, class ValueType, class Comparator = TComparator<KeyType>>

using T2Map< KeyType, ValueType, Comparator >::CIterator = T2RedBlackTree<Pair>::CIterator

Definition at line 14 of file T2Map.h.

◆ Iterator

template<class KeyType, class ValueType, class Comparator = TComparator<KeyType>>

using T2Map< KeyType, ValueType, Comparator >::Iterator = T2RedBlackTree<Pair>::Iterator

Definition at line 13 of file T2Map.h.

◆ Node

template<class KeyType, class ValueType, class Comparator = TComparator<KeyType>>

using T2Map< KeyType, ValueType, Comparator >::Node = T2RedBlackTree<Pair>::Node

Definition at line 15 of file T2Map.h.

◆ Pair

template<class KeyType, class ValueType, class Comparator = TComparator<KeyType>>

using T2Map< KeyType, ValueType, Comparator >::Pair = T2Pair<KeyType, ValueType, Comparator>

Definition at line 12 of file T2Map.h.

Constructor & Destructor Documentation

◆ T2Map()

template<class KeyType, class ValueType, class Comparator = TComparator<KeyType>>

T2Map< KeyType, ValueType, Comparator >::T2Map ( T2Allocator * a_pAllocator = GetGlobalAllocator() )

inline

Definition at line 18 of file T2Map.h.

        : m_RedBlackTree( a_pAllocator )
    {
    }

◆ ~T2Map()

template<class KeyType, class ValueType, class Comparator = TComparator<KeyType>>

T2Map< KeyType, ValueType, Comparator >::~T2Map ( )

inline

Definition at line 23 of file T2Map.h.

    {
        Clear();
    }

Member Function Documentation

◆ Begin() [1/2]

template<class KeyType, class ValueType, class Comparator = TComparator<KeyType>>

Iterator T2Map< KeyType, ValueType, Comparator >::Begin ( )

inline

Definition at line 102 of file T2Map.h.

    {
        return m_RedBlackTree.Begin();
    }

◆ Begin() [2/2]

template<class KeyType, class ValueType, class Comparator = TComparator<KeyType>>

const CIterator T2Map< KeyType, ValueType, Comparator >::Begin ( ) const

inline

Definition at line 112 of file T2Map.h.

    {
        return m_RedBlackTree.Begin();
    }

◆ Clear()

template<class KeyType, class ValueType, class Comparator = TComparator<KeyType>>

void T2Map< KeyType, ValueType, Comparator >::Clear ( )

inline

Definition at line 28 of file T2Map.h.

    {
        m_RedBlackTree.DeleteAll();
    }

◆ Emplace()

template<class KeyType, class ValueType, class Comparator = TComparator<KeyType>>

template<class... Args>

ValueType * T2Map< KeyType, ValueType, Comparator >::Emplace	(	const KeyType &	key,
		Args &&...	args )

inline

Definition at line 39 of file T2Map.h.

    {
        Pair     pair{ key, ValueType( std::forward<Args>( args )... ) };
        Iterator result = m_RedBlackTree.Insert( std::move( pair ) );
        return &result.GetValue()->GetSecond();
    }

◆ End() [1/2]

template<class KeyType, class ValueType, class Comparator = TComparator<KeyType>>

Iterator T2Map< KeyType, ValueType, Comparator >::End ( )

inline

Definition at line 107 of file T2Map.h.

    {
        return m_RedBlackTree.End();
    }

◆ End() [2/2]

template<class KeyType, class ValueType, class Comparator = TComparator<KeyType>>

const CIterator T2Map< KeyType, ValueType, Comparator >::End ( ) const

inline

Definition at line 117 of file T2Map.h.

    {
        return m_RedBlackTree.End();
    }

◆ Find()

template<class KeyType, class ValueType, class Comparator = TComparator<KeyType>>

Iterator T2Map< KeyType, ValueType, Comparator >::Find ( const KeyType & key )

inline

Definition at line 87 of file T2Map.h.

    {
        return m_RedBlackTree.Find( { key } );
    }

◆ FindByValue()

template<class KeyType, class ValueType, class Comparator = TComparator<KeyType>>

Iterator T2Map< KeyType, ValueType, Comparator >::FindByValue ( const ValueType & value )

inline

Definition at line 74 of file T2Map.h.

    {
        for ( auto it = Begin(); it != End(); it++ )
        {
            if ( it.GetValue()->GetSecond() == value )
            {
                return it;
            }
        }
 
        return End();
    }

◆ FindNext()

template<class KeyType, class ValueType, class Comparator = TComparator<KeyType>>

Iterator T2Map< KeyType, ValueType, Comparator >::FindNext	(	Iterator	a_oIterator,
		const KeyType &	a_rKey )

inline

Definition at line 92 of file T2Map.h.

    {
        return m_RedBlackTree.FindNext( a_oIterator.GetNode(), { a_rKey } );
    }

◆ GetAllocator()

template<class KeyType, class ValueType, class Comparator = TComparator<KeyType>>

T2Allocator * T2Map< KeyType, ValueType, Comparator >::GetAllocator ( ) const

inline

Definition at line 132 of file T2Map.h.

    {
        return m_RedBlackTree.GetAllocator();
    }

◆ Insert() [1/2]

template<class KeyType, class ValueType, class Comparator = TComparator<KeyType>>

ValueType * T2Map< KeyType, ValueType, Comparator >::Insert	(	const KeyType &	key,
		const ValueType &	value )

inline

Definition at line 46 of file T2Map.h.

    {
        Pair     pair{ key, value };
        Iterator result = m_RedBlackTree.Insert( std::move( pair ) );
        return &result.GetValue()->GetSecond();
    }

◆ Insert() [2/2]

template<class KeyType, class ValueType, class Comparator = TComparator<KeyType>>

ValueType * T2Map< KeyType, ValueType, Comparator >::Insert	(	const KeyType &	key,
		ValueType &&	value )

inline

Definition at line 53 of file T2Map.h.

    {
        Pair     pair{ key, std::move( value ) };
        Iterator result = m_RedBlackTree.Insert( std::move( pair ) );
        return &result.GetValue()->GetSecond();
    }

◆ IsEmpty()

template<class KeyType, class ValueType, class Comparator = TComparator<KeyType>>

TBOOL T2Map< KeyType, ValueType, Comparator >::IsEmpty ( ) const

inline

Definition at line 122 of file T2Map.h.

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

◆ IsValid()

template<class KeyType, class ValueType, class Comparator = TComparator<KeyType>>

TBOOL T2Map< KeyType, ValueType, Comparator >::IsValid ( Iterator a_oIterator ) const

inline

Definition at line 97 of file T2Map.h.

    {
        return a_oIterator != End();
    }

◆ operator[]()

template<class KeyType, class ValueType, class Comparator = TComparator<KeyType>>

Iterator T2Map< KeyType, ValueType, Comparator >::operator[] ( const KeyType & key )

inline

Definition at line 127 of file T2Map.h.

    {
        return m_RedBlackTree.Find( { key } );
    }

◆ Remove() [1/2]

template<class KeyType, class ValueType, class Comparator = TComparator<KeyType>>

void T2Map< KeyType, ValueType, Comparator >::Remove ( const KeyType & key )

inline

Definition at line 60 of file T2Map.h.

    {
        Iterator result = m_RedBlackTree.Find( { key } );
 
        TASSERT( result != End() );
        m_RedBlackTree.Delete( result.GetNode() );
    }

◆ Remove() [2/2]

template<class KeyType, class ValueType, class Comparator = TComparator<KeyType>>

void T2Map< KeyType, ValueType, Comparator >::Remove ( Iterator & it )

inline

Definition at line 68 of file T2Map.h.

    {
        TASSERT( it != End() );
        m_RedBlackTree.Delete( it.GetNode() );
    }

◆ Size()

template<class KeyType, class ValueType, class Comparator = TComparator<KeyType>>

TSIZE T2Map< KeyType, ValueType, Comparator >::Size ( ) const

inline

Definition at line 33 of file T2Map.h.

    {
        return m_RedBlackTree.Size();
    }

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

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

Public Types

Public Member Functions

Detailed Description

Member Typedef Documentation

◆ CIterator

◆ Iterator

◆ Node

◆ Pair

Constructor & Destructor Documentation

◆ T2Map()

◆ ~T2Map()

Member Function Documentation

◆ Begin() [1/2]

◆ Begin() [2/2]

◆ Clear()

◆ Emplace()

◆ End() [1/2]

◆ End() [2/2]

◆ Find()

◆ FindByValue()

◆ FindNext()

◆ GetAllocator()

◆ Insert() [1/2]

◆ Insert() [2/2]

◆ IsEmpty()

◆ IsValid()

◆ operator[]()

◆ Remove() [1/2]

◆ Remove() [2/2]

◆ Size()