|
Jive reference manual
|
#include <jem/util/HashTable.h>
Public Types | |
| typedef T | Traits |
| typedef T::ValueType | ValueType |
| typedef T::KeyType | KeyType |
| typedef T::Reference | Reference |
| typedef T::ConstReference | ConstReference |
| typedef T::Pointer | Pointer |
| typedef T::ConstPointer | ConstPointer |
| typedef T::Allocator | Allocator |
| typedef HashTableNode< ValueType > | Node |
| typedef HashTableIterator< ValueType, Reference, Pointer > | Iterator |
| typedef HashTableIterator< ValueType, ConstReference, ConstPointer > | ConstIterator |
Public Member Functions | |
| HashTable () | |
| HashTable (idx_t cap) | |
| HashTable (const HashTable &rhs) | |
| template<class InputIterator > | |
| HashTable (InputIterator first, InputIterator last) | |
| ~HashTable () | |
| Iterator | begin () |
| ConstIterator | begin () const |
| Iterator | end () |
| ConstIterator | end () const |
| HashTable & | operator= (const HashTable &rhs) |
| void | swap (HashTable &rhs) |
| bool | contains (const KeyType &key) const |
| Iterator | find (const KeyType &key) |
| ConstIterator | find (const KeyType &key) const |
| Iterator | insert (const ValueType &item) |
| template<class InputIterator > | |
| void | insert (InputIterator first, InputIterator last) |
| void | erase (const KeyType &key) |
| void | erase (Iterator pos) |
| void | clear () |
| void | reserve (idx_t cap) |
| void | trimToSize () |
| idx_t | capacity () const |
| idx_t | size () const |
| template<class Output > | |
| void | printStats (Output &out) const |
| typedef T jem::util::HashTable< T >::Traits |
| typedef T::ValueType jem::util::HashTable< T >::ValueType |
| typedef T::KeyType jem::util::HashTable< T >::KeyType |
| typedef T::Reference jem::util::HashTable< T >::Reference |
| typedef T::ConstReference jem::util::HashTable< T >::ConstReference |
| typedef T::Pointer jem::util::HashTable< T >::Pointer |
| typedef T::ConstPointer jem::util::HashTable< T >::ConstPointer |
| typedef T::Allocator jem::util::HashTable< T >::Allocator |
| typedef HashTableNode<ValueType> jem::util::HashTable< T >::Node |
| typedef HashTableIterator< ValueType, Reference, Pointer > jem::util::HashTable< T >::Iterator |
| typedef HashTableIterator< ValueType, ConstReference, ConstPointer > jem::util::HashTable< T >::ConstIterator |
| jem::util::HashTable< T >::HashTable | ( | ) |
|
explicit |
| jem::util::HashTable< T >::HashTable | ( | const HashTable< T > & | rhs | ) |
| jem::util::HashTable< T >::HashTable | ( | InputIterator | first, |
| InputIterator | last | ||
| ) |
| jem::util::HashTable< T >::~HashTable | ( | ) |
| Iterator jem::util::HashTable< T >::begin | ( | ) |
| ConstIterator jem::util::HashTable< T >::begin | ( | ) | const |
| Iterator jem::util::HashTable< T >::end | ( | ) |
| ConstIterator jem::util::HashTable< T >::end | ( | ) | const |
| HashTable& jem::util::HashTable< T >::operator= | ( | const HashTable< T > & | rhs | ) |
| void jem::util::HashTable< T >::swap | ( | HashTable< T > & | rhs | ) |
| bool jem::util::HashTable< T >::contains | ( | const KeyType & | key | ) | const |
| Iterator jem::util::HashTable< T >::find | ( | const KeyType & | key | ) |
| ConstIterator jem::util::HashTable< T >::find | ( | const KeyType & | key | ) | const |
| Iterator jem::util::HashTable< T >::insert | ( | const ValueType & | item | ) |
| void jem::util::HashTable< T >::insert | ( | InputIterator | first, |
| InputIterator | last | ||
| ) |
| void jem::util::HashTable< T >::erase | ( | const KeyType & | key | ) |
| void jem::util::HashTable< T >::erase | ( | Iterator | pos | ) |
| void jem::util::HashTable< T >::clear | ( | ) |
| void jem::util::HashTable< T >::reserve | ( | idx_t | cap | ) |
| void jem::util::HashTable< T >::trimToSize | ( | ) |
| idx_t jem::util::HashTable< T >::capacity | ( | ) | const |
| idx_t jem::util::HashTable< T >::size | ( | ) | const |
| void jem::util::HashTable< T >::printStats | ( | Output & | out | ) | const |