Generic hash functions for keys castable as Size and whose size is strictly smaller than that of Size.
More...
#include <agrum/core/hashFunc.h>
|
static constexpr Size | _small_key_mask |
| An additional mask to ensure that keys with fewer bits than Size are cast correctly. More...
|
|
template<typename Key>
class gum::HashFuncSmallCastKey< Key >
Generic hash functions for keys castable as Size and whose size is strictly smaller than that of Size.
- Template Parameters
-
Key | The type hashed by this hash function. |
Definition at line 274 of file hashFunc.h.
◆ HashFuncSmallCastKey()
◆ 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()()
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< Key >.
◆ 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 204 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 215 of file hashFunc.h.
◆ _hash_size
The size of the hash table.
Definition at line 201 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 226 of file hashFunc.h.
◆ _small_key_mask
Initial value:{(
Size(1) << (8 *
sizeof(Key)))
An additional mask to ensure that keys with fewer bits than Size are cast correctly.
Definition at line 300 of file hashFunc.h.
The documentation for this class was generated from the following file: