Struct AddressQueueData 

pub struct AddressQueueData {

    pub addresses: Vec<[u8; 32]>,
    pub low_element_values: Vec<[u8; 32]>,
    pub low_element_next_values: Vec<[u8; 32]>,
    pub low_element_indices: Vec<u64>,
    pub low_element_next_indices: Vec<u64>,
    pub nodes: Vec<u64>,
    pub node_hashes: Vec<[u8; 32]>,
    pub initial_root: [u8; 32],
    pub leaves_hash_chains: Vec<[u8; 32]>,
    pub subtrees: Vec<[u8; 32]>,
    pub start_index: u64,
    pub tree_next_insertion_index: u64,
    pub root_seq: u64,
}

V2 Address Queue Data with deduplicated nodes Proofs are reconstructed from nodes/node_hashes using low_element_indices

Fields

addresses: Vec<[u8; 32]>

low_element_values: Vec<[u8; 32]>

low_element_next_values: Vec<[u8; 32]>

low_element_indices: Vec<u64>

low_element_next_indices: Vec<u64>

nodes: Vec<u64>

Deduplicated node indices - encoding: (level << 56) | position

node_hashes: Vec<[u8; 32]>

Hashes corresponding to each node index

initial_root: [u8; 32]

leaves_hash_chains: Vec<[u8; 32]>

subtrees: Vec<[u8; 32]>

start_index: u64

Pagination offset for the returned queue slice.

tree_next_insertion_index: u64

Sparse tree insertion point / next index used to initialize staging trees.

root_seq: u64

Implementations

impl AddressQueueData

pub const ADDRESS_TREE_HEIGHT: usize

pub fn reconstruct_proofs<const HEIGHT: usize>( &self, address_range: Range<usize>, ) -> Result<Vec<[[u8; 32]; HEIGHT]>, IndexerError>

Reconstruct a contiguous batch of proofs while reusing a single node lookup table.

pub fn reconstruct_all_proofs<const HEIGHT: usize>( &self, ) -> Result<Vec<[[u8; 32]; HEIGHT]>, IndexerError>

Reconstruct all proofs for all addresses

Trait Implementations

impl Clone for AddressQueueData

fn clone(&self) -> AddressQueueData

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for AddressQueueData

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for AddressQueueData

fn default() -> AddressQueueData

Returns the “default value” for a type.

impl PartialEq for AddressQueueData

fn eq(&self, other: &AddressQueueData) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl StructuralPartialEq for AddressQueueData