#include <bslh_wyhashincrementalalgorithm.h>
This class wraps an implementation of the "WyHash" hash algorithm in an interface that is usable in the modular hashing system in bslh
.
See bslh_wyhashincrementalalgorithm
◆ result_type
◆ anonymous enum
◆ WyHashIncrementalAlgorithm() [1/3]
bslh::WyHashIncrementalAlgorithm::WyHashIncrementalAlgorithm |
( |
| ) |
|
|
inline |
◆ WyHashIncrementalAlgorithm() [2/3]
bslh::WyHashIncrementalAlgorithm::WyHashIncrementalAlgorithm |
( |
uint64_t |
seed | ) |
|
|
inlineexplicit |
◆ WyHashIncrementalAlgorithm() [3/3]
bslh::WyHashIncrementalAlgorithm::WyHashIncrementalAlgorithm |
( |
const char * |
seed | ) |
|
|
inlineexplicit |
◆ ~WyHashIncrementalAlgorithm()
bslh::WyHashIncrementalAlgorithm::~WyHashIncrementalAlgorithm |
( |
| ) |
|
|
default |
◆ computeHash()
Return the finalized version of the hash that has been accumulated. Note that this changes the internal state of the object, so calling computeHash()
multiple times in a row will return different results, and only the first result returned will match the expected result of the algorithm. Also note that a value will be returned, even if data has not been passed into operator()
◆ operator()()
void bslh::WyHashIncrementalAlgorithm::operator() |
( |
const void * |
data, |
|
|
size_t |
numBytes |
|
) |
| |
|
inline |
Incorporate the specified data
, of at least the specified numBytes
, into the internal state of the hashing algorithm. Every bit of data incorporated into the internal state of the algorithm will contribute to the final hash produced by computeHash()
. The same hash value will be produced regardless of whether a sequence of bytes is passed in all at once or through multiple calls to this member function. Input where numBytes
is 0 will have no effect on the internal state of the algorithm. The behaviour is undefined unless data
points to a valid memory location with at least numBytes
bytes of initialized memory or numBytes
is zero.
The documentation for this class was generated from the following file: