Hash function for strings.
More...
#include <agrum/tools/core/hashFunc.h>
|
virtual Size | operator() (const std::string &key) const override final |
| Computes the hashed value of a key. More...
|
|
void | resize (const Size new_size) |
| Update the hash function to take into account a resize of the hash table. More...
|
|
Size | size () const |
| Returns the hash table size as known by the hash function. More...
|
|
template<>
class gum::HashFunc< std::string >
Hash function for strings.
Definition at line 581 of file hashFunc.h.
◆ castToSize()
Returns the value of a key as a Size.
- Parameters
-
key | The value to return as a Size. |
- Returns
- Returns the value of a key as a Size.
◆ operator()()
virtual Size gum::HashFunc< std::string >::operator() |
( |
const std::string & |
key | ) |
const |
|
finaloverridevirtual |
Computes the hashed value of a key.
- Parameters
-
key | The key to compute the hashed value. |
- Returns
- Returns the hashed value of a key.
Implements gum::HashFuncBase< std::string >.
◆ resize()
Update the hash function to take into account a resize of the hash table.
When the user wishes to resize the gum::HashTable so that the array is of size s, the gum::HashTable resizes itself to the smallest power of 2 greater than or equal to s. This new size is computed by function gum::HashFuncBase::resize(gum::Size). Hence, s should be the size of the array of lists, not the number of elements stored into the gum::HashTable.
- Parameters
-
new_size | The hashtable's size wished by the user. Actually, a hashtable of size n is an array of n lists. |
- Exceptions
-
◆ size()
Returns the hash table size as known by the hash function.
- Returns
- Returns the size of the hash table, i.e., the number of slots (lists) it contains.
◆ hash_log2_size_
Log of the number of slots of the hash table in base 2.
Definition at line 203 of file hashFunc.h.
◆ hash_mask_
performing y = x & hash_mask_ guarantees that y is a slot index of the hash table
To transform a Size x into a slot index of the hash table, you can either use x & hash_mask_ or x >> right_shift_ depending on whether you want to exploit the least significant bits of x (&) or the most significant one (>>).
Definition at line 214 of file hashFunc.h.
◆ hash_size_
The size of the hash table.
Definition at line 200 of file hashFunc.h.
◆ right_shift_
performing y = x >> right_shift_ guarantees that y is a slot index of the hash table
To transform a Size x into a slot index of the hash table, you can either use x & hash_mask_ or x >> right_shift_ depending on whether you want to exploit the least significant bits of x (&) or the most significant one (>>).
Definition at line 225 of file hashFunc.h.
The documentation for this class was generated from the following file: