|
libhatchet
|
#include <hxhash_table_nodes.hpp>
Public Types | |
| using | key_t = key_t_ |
Public Member Functions | |
| hxhash_table_node_integer (const key_t_ &key_) | |
| hxhash_table_node_integer (const hxhash_table_node_integer &src_) | |
| hxhash_table_node_integer & | operator= (const hxhash_table_node_integer &other_) |
| hxhash_table_node_integer * | hash_next (void) const |
| void | set_hash_next (hxhash_table_node_integer *next_) |
| const key_t_ & | hash_key (void) const |
| hxhash_t | hash_value (void) const |
Static Public Member Functions | |
| static hxhash_t | hash_value (key_t_ key_) |
hxhash_table_node_integer - node_t for use with hxhash_table for integer types.
See the documentation of hxhash_table for the required interface. 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. This serves as an example of a node_t that does not use a base class.
| using hxhash_table_node_integer< key_t_ >::key_t = key_t_ |
|
inline |
Constructs a node wrapping the key and caches its hash.
|
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 of a key without constructing a node.
|
inline |
Returns the cached hash value for the stored key.
|
inline |
Assigns nothing. Hash table linkage of either node is not affected.
|
inline |
Sets the next node in the table's embedded linked list.