Blender V4.3
btHashMap< Key, Value > Class Template Reference

#include <btHashMap.h>

Inherited by btTriangleInfoMap.

Public Member Functions

void insert (const Key &key, const Value &value)
 
void remove (const Key &key)
 
int size () const
 
const Value * getAtIndex (int index) const
 
Value * getAtIndex (int index)
 
Key getKeyAtIndex (int index)
 
const Key getKeyAtIndex (int index) const
 
Value * operator[] (const Key &key)
 
const Value * operator[] (const Key &key) const
 
const Value * find (const Key &key) const
 
Value * find (const Key &key)
 
int findIndex (const Key &key) const
 
void clear ()
 

Protected Member Functions

void growTables (const Key &)
 

Protected Attributes

btAlignedObjectArray< intm_hashTable
 
btAlignedObjectArray< intm_next
 
btAlignedObjectArray< Value > m_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()

◆ find() [1/2]

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

◆ find() [2/2]

◆ findIndex()

◆ 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()

◆ insert()

◆ 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()

◆ size()

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

Member Data Documentation

◆ m_hashTable

◆ m_keyArray

◆ m_next

◆ m_valueArray


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