Lumiera
0.pre.03
»edit your freedom«
|
Hash implementations usable for the HashIndexed mixin as well as key within std::unordered_map.
Classes | |
class | LuidH |
Hash implementation based on a lumiera unique object id (LUID) When invoking the default ctor, a new LUID is generated. More... | |
class | Plain |
simple Hash implementation directly incorporating the hash value. More... | |
Functions | |
void | combine (size_t &combinedHash, size_t additionalHash) |
meld the additional hash value into the given base hash value. More... | |
HashVal | hash_value (Plain const &plainHash) |
HashVal | hash_value (LuidH const &luid_Hash) |
|
inline |
meld the additional hash value into the given base hash value.
This is the standard formula used by Lib-Boost to combine the hash values of parts into a composite, and is based on the Murmur-2.64A hash algorithm.
see: Boost 1.67 /boost/container_hash/hash.hpp
Definition at line 60 of file hash-combine.hpp.
Referenced by steam::engine::test::manipulateFrame(), steam::engine::test::manipulateMultichan(), NodeDevel_test::processing_manipulateFrame(), NodeDevel_test::processing_manipulateMultichan(), and JobTicket::timeHash().