#include <merkle_tree.hpp>
|
void | dump () const |
|
merkle_authentication_path_type | get_path (const std::size_t address) const |
|
merkle_authentication_path_type | get_path (const std::size_t address) const |
|
digest_type | get_root () const |
|
digest_type | get_root () const |
|
std::vector< bool > | get_value (const std::size_t address) const |
|
std::vector< bool > | get_value (const std::size_t address) const |
|
| merkle_tree (const std::size_t depth, const std::size_t value_size) |
|
| merkle_tree (const std::size_t depth, const std::size_t value_size) |
|
| merkle_tree (const std::size_t depth, const std::size_t value_size, const std::vector< std::vector< bool >> &contents_as_vector) |
|
| merkle_tree (const std::size_t depth, const std::size_t value_size, const std::vector< std::vector< bool >> &contents_as_vector) |
|
| merkle_tree (size_t depth, std::size_t value_size, const std::map< std::size_t, std::vector< bool >> &contents) |
|
| merkle_tree (size_t depth, std::size_t value_size, const std::map< std::size_t, std::vector< bool >> &contents) |
|
void | set_value (const std::size_t address, const std::vector< bool > &value) |
|
void | set_value (const std::size_t address, const std::vector< bool > &value) |
|
◆ digest_type [1/2]
template<typename Hash , std::size_t BaseArity = 0, std::size_t SubTreeArity = 0, std::size_t TopTreeArity = 0>
◆ digest_type [2/2]
template<typename Hash , std::size_t BaseArity = 0, std::size_t SubTreeArity = 0, std::size_t TopTreeArity = 0>
◆ merkle_authentication_path_type [1/2]
template<typename Hash , std::size_t BaseArity = 0, std::size_t SubTreeArity = 0, std::size_t TopTreeArity = 0>
◆ merkle_authentication_path_type [2/2]
template<typename Hash , std::size_t BaseArity = 0, std::size_t SubTreeArity = 0, std::size_t TopTreeArity = 0>
◆ merkle_tree() [1/6]
template<typename Hash , std::size_t BaseArity = 0, std::size_t SubTreeArity = 0, std::size_t TopTreeArity = 0>
◆ merkle_tree() [2/6]
template<typename Hash , std::size_t BaseArity = 0, std::size_t SubTreeArity = 0, std::size_t TopTreeArity = 0>
◆ merkle_tree() [3/6]
template<typename Hash , std::size_t BaseArity = 0, std::size_t SubTreeArity = 0, std::size_t TopTreeArity = 0>
◆ merkle_tree() [4/6]
template<typename Hash , std::size_t BaseArity = 0, std::size_t SubTreeArity = 0, std::size_t TopTreeArity = 0>
◆ merkle_tree() [5/6]
template<typename Hash , std::size_t BaseArity = 0, std::size_t SubTreeArity = 0, std::size_t TopTreeArity = 0>
◆ merkle_tree() [6/6]
template<typename Hash , std::size_t BaseArity = 0, std::size_t SubTreeArity = 0, std::size_t TopTreeArity = 0>
◆ dump()
template<typename Hash , std::size_t BaseArity = 0, std::size_t SubTreeArity = 0, std::size_t TopTreeArity = 0>
◆ get_path() [1/2]
template<typename Hash , std::size_t BaseArity = 0, std::size_t SubTreeArity = 0, std::size_t TopTreeArity = 0>
◆ get_path() [2/2]
template<typename Hash , std::size_t BaseArity = 0, std::size_t SubTreeArity = 0, std::size_t TopTreeArity = 0>
◆ get_root() [1/2]
template<typename Hash , std::size_t BaseArity = 0, std::size_t SubTreeArity = 0, std::size_t TopTreeArity = 0>
◆ get_root() [2/2]
template<typename Hash , std::size_t BaseArity = 0, std::size_t SubTreeArity = 0, std::size_t TopTreeArity = 0>
◆ get_value() [1/2]
template<typename Hash , std::size_t BaseArity = 0, std::size_t SubTreeArity = 0, std::size_t TopTreeArity = 0>
◆ get_value() [2/2]
template<typename Hash , std::size_t BaseArity = 0, std::size_t SubTreeArity = 0, std::size_t TopTreeArity = 0>
◆ set_value() [1/2]
template<typename Hash , std::size_t BaseArity = 0, std::size_t SubTreeArity = 0, std::size_t TopTreeArity = 0>
◆ set_value() [2/2]
template<typename Hash , std::size_t BaseArity = 0, std::size_t SubTreeArity = 0, std::size_t TopTreeArity = 0>
◆ base_arity
template<typename Hash , std::size_t BaseArity = 0, std::size_t SubTreeArity = 0, std::size_t TopTreeArity = 0>
◆ depth
template<typename Hash , std::size_t BaseArity = 0, std::size_t SubTreeArity = 0, std::size_t TopTreeArity = 0>
◆ digest_size
template<typename Hash , std::size_t BaseArity = 0, std::size_t SubTreeArity = 0, std::size_t TopTreeArity = 0>
◆ hash_defaults
template<typename Hash , std::size_t BaseArity = 0, std::size_t SubTreeArity = 0, std::size_t TopTreeArity = 0>
◆ hashes
template<typename Hash , std::size_t BaseArity = 0, std::size_t SubTreeArity = 0, std::size_t TopTreeArity = 0>
◆ sub_tree_arity
template<typename Hash , std::size_t BaseArity = 0, std::size_t SubTreeArity = 0, std::size_t TopTreeArity = 0>
◆ top_tree_arity
template<typename Hash , std::size_t BaseArity = 0, std::size_t SubTreeArity = 0, std::size_t TopTreeArity = 0>
◆ value_size
template<typename Hash , std::size_t BaseArity = 0, std::size_t SubTreeArity = 0, std::size_t TopTreeArity = 0>
◆ values
template<typename Hash , std::size_t BaseArity = 0, std::size_t SubTreeArity = 0, std::size_t TopTreeArity = 0>
The documentation for this struct was generated from the following file: