Concepts
Table of Contents
Hash Concept
A Hash is a function object for which the output depends only on the input and has a very low probability of yielding the same output given different input values.
Requirements
The type X satisfies Hash if:
Given
WordType, the type named byX::word_typeBlockType, the type named byX::block_typeDigestType, the type named byX::digest_typeStreamProcessor, the type template named byX::stream_processor
The following type members must be valid and have their specified effects
| Expression | Type | Requirements and Notes |
|---|---|---|
X::block_type | BlockType | BlockType type is a SequenceContainer of type T or std::array<T> |
X::word_type | WordType | WordType type satisfies Integral concept |
X::digest_type | DigestType | DigestType type is a SequenceContainer of type T or std::array<T> |
The following static data member definitions must be valid and have their specified effects
| Expression | Type | Requirements and Notes |
|---|---|---|
X::word_bits | std::size_t | Integral bits amount in WordType |
X::block_bits | std::size_t | Integral bits amount in BlockType |
X::digest_bits | std::size_t | Integral bits amount in DigestType |
X::block_words | std::size_t | Integral amount of WordType values in BlockType |