|
libhatchet
|
#include <hxhash_table.hpp>
Public Types | |
| using | key_t = key_t_ |
Public Member Functions | |
| template<typename ref_t_> | |
| hxhash_table_set_node (ref_t_ &&key_) | |
| hxhash_table_set_node (const hxhash_table_set_node &src_) | |
| hxhash_table_set_node * | hash_next (void) const |
| void | set_hash_next (hxhash_table_set_node *next_) |
| const key_t_ & | hash_key (void) const |
| hxhash_t | hash_value (void) const |
Static Public Member Functions | |
| static hxhash_t | hash_value (const key_t_ &key_) |
hxhash_table_set_node - Optional base class for unordered set entries.
Caches the hash value. See hxhash_table_map_node if you need a map node. Copy and move construction produce an unlinked node with the same key and hash. Copy and move assignment leave the linkage of either node unchanged. The hash table uses duck typing, so only the interface is required.
| using hxhash_table_set_node< key_t_ >::key_t = key_t_ |
|
inline |
Constructs a node from the key and caches its hash for reuse.
|
inline |
Constructs an unlinked node with the same key.
|
inline |
The key and hash identify the node_t and should not change once added.
|
inline |
Returns the next node in the table's embedded linked list.
|
inlinestatic |
Returns the hash value computed for key.
Hash values are not required to be unique.
|
inline |
Returns the cached hash value for the stored key.
Hash values are not required to be unique.
|
inline |
Sets the next node in the table's embedded linked list.