The btHashMap template class implements a generic and lightweight hashmap. More...
#include <btHashMap.h>

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) |
| Value * | operator[] (const Key &key) |
| const Value * | find (const Key &key) const |
| Value * | find (const Key &key) |
| int | findIndex (const Key &key) const |
| void | clear () |
Private Member Functions | |
| void | growTables (const Key &key) |
Private Attributes | |
| btAlignedObjectArray< int > | m_hashTable |
| btAlignedObjectArray< int > | m_next |
| btAlignedObjectArray< Value > | m_valueArray |
| btAlignedObjectArray< Key > | m_keyArray |
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 199 of file btHashMap.h.
| void btHashMap< Key, Value >::clear | ( | ) | [inline] |
Definition at line 418 of file btHashMap.h.
| Value* btHashMap< Key, Value >::find | ( | const Key & | key | ) | [inline] |
Definition at line 390 of file btHashMap.h.
| const Value* btHashMap< Key, Value >::find | ( | const Key & | key | ) | const [inline] |
Definition at line 380 of file btHashMap.h.
| int btHashMap< Key, Value >::findIndex | ( | const Key & | key | ) | const [inline] |
Definition at line 401 of file btHashMap.h.
| Value* btHashMap< Key, Value >::getAtIndex | ( | int | index | ) | [inline] |
Definition at line 369 of file btHashMap.h.
| const Value* btHashMap< Key, Value >::getAtIndex | ( | int | index | ) | const [inline] |
Definition at line 362 of file btHashMap.h.
| void btHashMap< Key, Value >::growTables | ( | const Key & | key | ) | [inline, private] |
Definition at line 208 of file btHashMap.h.
| void btHashMap< Key, Value >::insert | ( | const Key & | key, | |
| const Value & | value | |||
| ) | [inline] |
Definition at line 247 of file btHashMap.h.
| Value* btHashMap< Key, Value >::operator[] | ( | const Key & | key | ) | [inline] |
Definition at line 376 of file btHashMap.h.
| void btHashMap< Key, Value >::remove | ( | const Key & | key | ) | [inline] |
Definition at line 274 of file btHashMap.h.
| int btHashMap< Key, Value >::size | ( | ) | const [inline] |
Definition at line 357 of file btHashMap.h.
btAlignedObjectArray<int> btHashMap< Key, Value >::m_hashTable [private] |
Definition at line 202 of file btHashMap.h.
btAlignedObjectArray<Key> btHashMap< Key, Value >::m_keyArray [private] |
Definition at line 206 of file btHashMap.h.
btAlignedObjectArray<int> btHashMap< Key, Value >::m_next [private] |
Definition at line 203 of file btHashMap.h.
btAlignedObjectArray<Value> btHashMap< Key, Value >::m_valueArray [private] |
Definition at line 205 of file btHashMap.h.
1.6.1