Internal hash map with guaranteed memory requirements. More...
#include <tpie/array.h>#include <tpie/unused.h>#include <cmath>#include <algorithm>#include <iostream>#include <tpie/prime.h>Go to the source code of this file.
Classes | |
| struct | tpie::hash< T > |
| Default hashing function for integral (size_t-castable) types. More... | |
| struct | tpie::hash< std::pair< T1, T2 > > |
| Default hashing function for std::pair. More... | |
| struct | tpie::hash< const char * > |
| Default hashing function for C-style strings. More... | |
| struct | tpie::hash< std::string > |
| Default hashing function for std::string. More... | |
| class | tpie::chaining_hash_table< value_t, hash_t, equal_t, index_t > |
| Hash table handling hash collisions by chaining. More... | |
| class | tpie::linear_probing_hash_table< value_t, hash_t, equal_t, index_t > |
| Hash table handling hash collisions by linear probing. More... | |
| class | tpie::hash_map< key_t, data_t, hash_t, equal_t, index_t, table_t > |
| Hash map implementation backed by a template parameterized hash table. More... | |
| class | tpie::hash_map< key_t, data_t, hash_t, equal_t, index_t, table_t >::iterator |
| Non-const iterator type. More... | |
| class | tpie::hash_set< key_t, hash_t, equal_t, index_t, table_t > |
| Hash set implementation backed by a template parameterized hash table. More... | |
| class | tpie::hash_set< key_t, hash_t, equal_t, index_t, table_t >::iterator |
| Non-const iterator type. More... | |
Namespaces | |
| tpie | |
| TPIE's namespace. | |
Internal hash map with guaranteed memory requirements.
Definition in file hash_map.h.