#include <manifest.hpp>
|
| | RoundManifest (std::vector< ManifestEntry > element_names, const std::string challenge_name, const size_t num_challenges_in, bool map_challenges_in=false) |
| |
| bool | includes_element (const std::string &element_name) |
| |
|
|
std::vector< ManifestEntry > | elements |
| |
|
std::string | challenge |
| |
|
size_t | num_challenges |
| |
|
bool | map_challenges |
| |
The RoundManifest describes the data used in one round of the protocol and the challenge(s) created from that data.
◆ RoundManifest()
| transcript::Manifest::RoundManifest::RoundManifest |
( |
std::vector< ManifestEntry > |
element_names, |
|
|
const std::string |
challenge_name, |
|
|
const size_t |
num_challenges_in, |
|
|
bool |
map_challenges_in = false |
|
) |
| |
|
inline |
- Parameters
-
| element_names | Data used in the round. |
| challenge_name | The name of the challenge (alpha, beta, etc..) |
| num_challenges_in | The number of challenges to generate (sometimes we need more than one, e.g in permutation_widget) |
| map_challenges_in | Whether to put elements in a challenge_map in the transcript. |
◆ includes_element()
| bool transcript::Manifest::RoundManifest::includes_element |
( |
const std::string & |
element_name | ) |
|
|
inline |
Checks if there is an element in the list with such name.
- Parameters
-
| element_name | The name to search for. |
- Returns
- true if found, false if not.
The documentation for this struct was generated from the following file:
