Barretenberg
The ZK-SNARK library at the core of Aztec
Loading...
Searching...
No Matches
bb::avm2::simulation::IndexedMemoryTree< LeafType, HashingPolicy > Class Template Reference

#include <indexed_memory_tree.hpp>

Public Member Functions

 IndexedMemoryTree (size_t depth, size_t num_default_values)
 
GetLowIndexedLeafResponse get_low_indexed_leaf (const FF &key) const
 
IndexedLeaf< LeafType > get_leaf_preimage (size_t leaf_index) const
 
SiblingPath get_sibling_path (size_t leaf_index) const
 
AppendOnlyTreeSnapshot get_snapshot () const
 
SequentialInsertionResult< LeafType > insert_indexed_leaves (std::span< const LeafType > leaves)
 

Private Member Functions

void append_leaf (const IndexedLeaf< LeafType > &leaf)
 

Private Attributes

MemoryTree< HashingPolicy > tree
 
size_t depth
 
size_t max_leaves
 
std::vector< IndexedLeaf< LeafType > > leaves
 

Detailed Description

template<typename LeafType, typename HashingPolicy>
class bb::avm2::simulation::IndexedMemoryTree< LeafType, HashingPolicy >

Definition at line 10 of file indexed_memory_tree.hpp.

Constructor & Destructor Documentation

◆ IndexedMemoryTree()

template<typename LeafType , typename HashingPolicy >
bb::avm2::simulation::IndexedMemoryTree< LeafType, HashingPolicy >::IndexedMemoryTree ( size_t  depth,
size_t  num_default_values 
)

Definition at line 34 of file indexed_memory_tree.hpp.

Member Function Documentation

◆ append_leaf()

template<typename LeafType , typename HashingPolicy >
void bb::avm2::simulation::IndexedMemoryTree< LeafType, HashingPolicy >::append_leaf ( const IndexedLeaf< LeafType > &  leaf)
private

Definition at line 162 of file indexed_memory_tree.hpp.

◆ get_leaf_preimage()

template<typename LeafType , typename HashingPolicy >
IndexedLeaf< LeafType > bb::avm2::simulation::IndexedMemoryTree< LeafType, HashingPolicy >::get_leaf_preimage ( size_t  leaf_index) const

Definition at line 91 of file indexed_memory_tree.hpp.

◆ get_low_indexed_leaf()

template<typename LeafType , typename HashingPolicy >
GetLowIndexedLeafResponse bb::avm2::simulation::IndexedMemoryTree< LeafType, HashingPolicy >::get_low_indexed_leaf ( const FF key) const

Definition at line 70 of file indexed_memory_tree.hpp.

◆ get_sibling_path()

template<typename LeafType , typename HashingPolicy >
SiblingPath bb::avm2::simulation::IndexedMemoryTree< LeafType, HashingPolicy >::get_sibling_path ( size_t  leaf_index) const

Definition at line 97 of file indexed_memory_tree.hpp.

◆ get_snapshot()

template<typename LeafType , typename HashingPolicy >
AppendOnlyTreeSnapshot bb::avm2::simulation::IndexedMemoryTree< LeafType, HashingPolicy >::get_snapshot ( ) const

Definition at line 103 of file indexed_memory_tree.hpp.

◆ insert_indexed_leaves()

template<typename LeafType , typename HashingPolicy >
SequentialInsertionResult< LeafType > bb::avm2::simulation::IndexedMemoryTree< LeafType, HashingPolicy >::insert_indexed_leaves ( std::span< const LeafType >  leaves)

Definition at line 112 of file indexed_memory_tree.hpp.

Member Data Documentation

◆ depth

template<typename LeafType , typename HashingPolicy >
size_t bb::avm2::simulation::IndexedMemoryTree< LeafType, HashingPolicy >::depth
private

Definition at line 28 of file indexed_memory_tree.hpp.

◆ leaves

template<typename LeafType , typename HashingPolicy >
std::vector<IndexedLeaf<LeafType> > bb::avm2::simulation::IndexedMemoryTree< LeafType, HashingPolicy >::leaves
private

Definition at line 30 of file indexed_memory_tree.hpp.

◆ max_leaves

template<typename LeafType , typename HashingPolicy >
size_t bb::avm2::simulation::IndexedMemoryTree< LeafType, HashingPolicy >::max_leaves
private

Definition at line 29 of file indexed_memory_tree.hpp.

◆ tree

template<typename LeafType , typename HashingPolicy >
MemoryTree<HashingPolicy> bb::avm2::simulation::IndexedMemoryTree< LeafType, HashingPolicy >::tree
private

Definition at line 27 of file indexed_memory_tree.hpp.


The documentation for this class was generated from the following file: