[#BloombergLP-bslh-hashTuple_Util-02-visit]
= xref:BloombergLP.adoc[BloombergLP]::xref:BloombergLP/bslh.adoc[bslh]::xref:BloombergLP/bslh/hashTuple_Util-02.adoc[hashTuple&lowbar;Util]::visit
:relfileprefix: ../../../
:mrdocs:

Invoke the (appropriate) `hashAppend` function using the specified `algorithm` and the &quot;current&quot; element of the specified `input` tuple and then visit the next element&period; The index of the current element is the size of (template parameter) `TUPLE&lowbar;TYPE` minus (template parameter) `BACK&lowbar;INDEX`&period; `BACK&lowbar;INDEX` is reduced on each recursion and eventually, when `BACK&lowbar;INDEX` is 0, a &quot;do nothing&quot; function is called to stop the recursion&period;

== Synopsis

Declared in `&lt;bslh&lowbar;hashtuple&period;h&gt;`

[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
static
void
visit(
    HASH&lowbar;ALGORITHM& algorithm,
    TUPLE&lowbar;TYPE const& input);
----


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