#include <sspt_hashvector.h>
Classes | |
| class | RemovePredicate |
Public Member Functions | |
| sspt_HashVector (const T &defaultValue, size_t sizeHint=1024) | |
| ~sspt_HashVector () | |
| T & | operator[] (const K &key) |
| T | operator[] (const K &key) const |
| size_t | size () |
| bool | isKey (const K &key) |
| void | insert (const K &key, T item) |
| T | remove (const K &key) |
| void | clear () |
| size_t | collisions () |
| sspt_HashIterator< K, T > | begin () const |
| sspt_HashVector< K, T, HashOp, EqualityOp >::sspt_HashVector | ( | const T & | defaultValue, | |
| size_t | sizeHint = 1024 | |||
| ) | [inline] |
| sspt_HashVector< K, T, HashOp, EqualityOp >::~sspt_HashVector | ( | ) | [inline] |
| sspt_HashIterator< K, T > sspt_HashVector< K, T, HashOp, EqualityOp >::begin | ( | ) | const [inline] |
| void sspt_HashVector< K, T, HashOp, EqualityOp >::clear | ( | ) | [inline] |
| size_t sspt_HashVector< K, T, HashOp, EqualityOp >::collisions | ( | ) | [inline] |
| void sspt_HashVector< K, T, HashOp, EqualityOp >::insert | ( | const K & | key, | |
| T | item | |||
| ) |
| bool sspt_HashVector< K, T, HashOp, EqualityOp >::isKey | ( | const K & | key | ) | [inline] |
| T sspt_HashVector< K, T, HashOp, EqualityOp >::operator[] | ( | const K & | key | ) | const |
| T & sspt_HashVector< K, T, HashOp, EqualityOp >::operator[] | ( | const K & | key | ) | [inline] |
| T sspt_HashVector< K, T, HashOp, EqualityOp >::remove | ( | const K & | key | ) | [inline] |
| size_t sspt_HashVector< K, T, HashOp, EqualityOp >::size | ( | ) | [inline] |