Blender  V3.3
Public Member Functions | Protected Member Functions | Protected Attributes | List of all members
btHashMap< Key, Value > Class Template Reference

#include <btHashMap.h>

Inheritance diagram for btHashMap< Key, Value >:
btTriangleInfoMap

Public Member Functions

void insert (const Key &key, const Value &value)
 
void remove (const Key &key)
 
int size () const
 
const ValuegetAtIndex (int index) const
 
ValuegetAtIndex (int index)
 
Key getKeyAtIndex (int index)
 
const Key getKeyAtIndex (int index) const
 
Valueoperator[] (const Key &key)
 
const Valueoperator[] (const Key &key) const
 
const Valuefind (const Key &key) const
 
Valuefind (const Key &key)
 
int findIndex (const Key &key) const
 
void clear ()
 

Protected Member Functions

void growTables (const Key &)
 

Protected Attributes

btAlignedObjectArray< int > m_hashTable
 
btAlignedObjectArray< int > m_next
 
btAlignedObjectArray< Valuem_valueArray
 
btAlignedObjectArray< Keym_keyArray
 

Detailed Description

template<class Key, class Value>
class btHashMap< Key, Value >

The btHashMap template class implements a generic and lightweight hashmap. A basic sample of how to use btHashMap is located in Demos\BasicDemo\main.cpp

Definition at line 219 of file btHashMap.h.

Member Function Documentation

◆ clear()

template<class Key , class Value >
void btHashMap< Key, Value >::clear ( )
inline

◆ find() [1/2]

template<class Key , class Value >
Value* btHashMap< Key, Value >::find ( const Key key)
inline

◆ find() [2/2]

template<class Key , class Value >
const Value* btHashMap< Key, Value >::find ( const Key key) const
inline

◆ findIndex()

template<class Key , class Value >
int btHashMap< Key, Value >::findIndex ( const Key key) const
inline

◆ getAtIndex() [1/2]

template<class Key , class Value >
Value* btHashMap< Key, Value >::getAtIndex ( int  index)
inline

◆ getAtIndex() [2/2]

template<class Key , class Value >
const Value* btHashMap< Key, Value >::getAtIndex ( int  index) const
inline

◆ getKeyAtIndex() [1/2]

template<class Key , class Value >
Key btHashMap< Key, Value >::getKeyAtIndex ( int  index)
inline

◆ getKeyAtIndex() [2/2]

template<class Key , class Value >
const Key btHashMap< Key, Value >::getKeyAtIndex ( int  index) const
inline

◆ growTables()

template<class Key , class Value >
void btHashMap< Key, Value >::growTables ( const Key )
inlineprotected

◆ insert()

template<class Key , class Value >
void btHashMap< Key, Value >::insert ( const Key key,
const Value value 
)
inline

◆ operator[]() [1/2]

template<class Key , class Value >
Value* btHashMap< Key, Value >::operator[] ( const Key key)
inline

Definition at line 414 of file btHashMap.h.

References btHashMap< Key, Value >::find().

◆ operator[]() [2/2]

template<class Key , class Value >
const Value* btHashMap< Key, Value >::operator[] ( const Key key) const
inline

Definition at line 419 of file btHashMap.h.

References btHashMap< Key, Value >::find().

◆ remove()

template<class Key , class Value >
void btHashMap< Key, Value >::remove ( const Key key)
inline

◆ size()

template<class Key , class Value >
int btHashMap< Key, Value >::size ( ) const
inline

Member Data Documentation

◆ m_hashTable

template<class Key , class Value >
btAlignedObjectArray<int> btHashMap< Key, Value >::m_hashTable
protected

◆ m_keyArray

template<class Key , class Value >
btAlignedObjectArray<Key> btHashMap< Key, Value >::m_keyArray
protected

◆ m_next

template<class Key , class Value >
btAlignedObjectArray<int> btHashMap< Key, Value >::m_next
protected

◆ m_valueArray

template<class Key , class Value >
btAlignedObjectArray<Value> btHashMap< Key, Value >::m_valueArray
protected

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