Hash the current element of input and visit the next.

Synopsis

Declared in <bslh_hashtuple.h>

static
void
visit(
    HASH_ALGORITHM& algorithm,
    TUPLE_TYPE const& input);

Description

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.

Parameters

Name

Description

algorithm

hashing algorithm that combines the current element

input

tuple whose elements are visited from the current index

Created with MrDocs