[#BloombergLP-bslh-DefaultSeededHashAlgorithm]
= xref:BloombergLP.adoc[BloombergLP]::xref:BloombergLP/bslh.adoc[bslh]::DefaultSeededHashAlgorithm
:relfileprefix: ../../
:mrdocs:

This class wraps an unspecified default hashing algorithm, which takes a seed, that is appropriate for general purpose use such as generating hashes for a hash table.

== Synopsis

Declared in `<bslh_defaultseededhashalgorithm.h>`

[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
class DefaultSeededHashAlgorithm;
----

== Type Aliases

[cols="1,4"]
|===
| Name| Description
| xref:BloombergLP/bslh/DefaultSeededHashAlgorithm/result_type.adoc[`result_type`] 
| Typedef indicating the value type returned by this algorithm.
|===


== Enums

[cols="1,4"]
|===
| Name| Description
| xref:BloombergLP/bslh/DefaultSeededHashAlgorithm/_04enum.adoc[`Unnamed enum`] 
| Compile‐time constants for this seeded hash algorithm.
|===


== Member Functions

[cols="1,4"]
|===
| Name| Description
| xref:BloombergLP/bslh/DefaultSeededHashAlgorithm/2constructor.adoc[`DefaultSeededHashAlgorithm`]         [.small]#[constructor]#
| Create a `bslh::DefaultSeededHashAlgorithm`, seeded with the (`k_SEED_LENGTH` bytes) seed pointed to by the specified `seed`. Each bit of the supplied seed will contribute to the final hash produced by `computeHash()`. The behaviour is undefined unless `seed` points to at least `k_SEED_LENGTH` bytes of initialized memory.
| xref:BloombergLP/bslh/DefaultSeededHashAlgorithm/computeHash.adoc[`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()`.
| xref:BloombergLP/bslh/DefaultSeededHashAlgorithm/operator_call.adoc[`operator()`] 
| 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 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.
|===



[.small]#Created with https://www.mrdocs.com[MrDocs]#