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

Component‐private utility for hashing tuple elements in reverse order.

== Synopsis

Declared in `<bslh_hashtuple.h>`

[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
template<
    std::size_t BACK_INDEX,
    class HASH_ALGORITHM,
    class TUPLE_TYPE>
struct hashTuple_Util;
----

== Static Member Functions

[cols="1,4"]
|===
| Name| Description
| xref:BloombergLP/bslh/hashTuple_Util-02/visit.adoc[`visit`] 
| Invoke the (appropriate) `hashAppend` function using the specified `algorithm` and the "current" element of the specified `input` tuple and then visit the next element. The index of the current element is the size of (template parameter) `TUPLE_TYPE` minus (template parameter) `BACK_INDEX`. `BACK_INDEX` is reduced on each recursion and eventually, when `BACK_INDEX` is 0, a "do nothing" function is called to stop the recursion.
|===


== Specializations

[cols="1"]
|===
| Name
| xref:BloombergLP/bslh/hashTuple_Util-07.adoc[`hashTuple_Util<0, HASH_ALGORITHM, TUPLE_TYPE>`] 
|===



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