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

Synopsis

Declared in <bslh_hashtuple.h>

template<
    std::size_t BACK_INDEX,
    class HASH_ALGORITHM,
    class TUPLE_TYPE>
struct hashTuple_Util;

Static Member Functions

Name

Description

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

Name

hashTuple_Util<0, HASH_ALGORITHM, TUPLE_TYPE>

Created with MrDocs