Struct SubTree 

pub struct SubTree<H: NodeHasher> {
    pub root: SubTreeNode,
    pub _marker: PhantomData<H>,
}

Fields

root: SubTreeNode

_marker: PhantomData<H>

Implementations

impl<H: NodeHasher> SubTree<H>

pub fn empty() -> Self

pub fn to_vec(&self) -> Result<Vec<u8>>

pub fn from_slice(buf: &[u8]) -> Result<Self>

pub fn compute_root(&self) -> Result<Hash>

pub fn hash(&self, value: &[u8]) -> Hash

pub fn is_empty(&self) -> bool

pub fn insert(&mut self, key: Hash, value_or_hash: ValueOrHash) -> Result<()>

Inserts a key-value pair. Returns error if key already exists.

pub fn update( &mut self, key: Hash, value_or_hash: ValueOrHash, ) -> Result<Option<ValueOrHash>>

Sets a key-value pair, replacing any existing value. Returns the previous value if the key existed.

pub fn contains(&self, key: &Hash) -> Result<bool>

pub fn delete(self, key: &Hash) -> Result<SubTree<H>>

pub fn iter(&self) -> SubtreeIter<'_>

pub fn iter_mut(&mut self) -> SubtreeIterMut<'_>

impl<H: NodeHasher> SubTree<H>

pub fn prove(&self, keys: &[Hash], proof_type: ProofType) -> Result<SubTree<H>>

Creates a new proof (SubTree) containing only the nodes necessary to prove the specified keys. This mirrors the prove() method on the main tree.

pub fn bucket_hashes(&self, bits: usize) -> Vec<Option<Hash>>

Returns hashes for 2^bits buckets based on key prefix. Bucket i contains all keys where the first bits bits equal i. Returns None for empty buckets or buckets that can’t be computed (hash nodes).

pub fn bucket_hashes_at_prefix( &self, prefix: &[bool], bits: usize, ) -> Vec<Option<Hash>>

Returns hashes for 2^bits buckets starting from a given prefix. First navigates to the subtree at prefix, then returns bucket hashes for bits additional levels. Returns None for empty buckets or buckets that can’t be computed (hash nodes).

pub fn get_prefix(&self, prefix: &[bool]) -> Result<SubTree<H>>

Get a subtree containing all keys that start with the given bit prefix. Returns a proper subtree with paths from the root - siblings not on the path are replaced with their hashes. The prefix is specified as a slice of bools (true = 1, false = 0).

pub fn merge(self, other: SubTree<H>) -> Result<SubTree<H>>

Merges two subtrees into one. Both subtrees must have the same root hash. This is useful for combining proofs that cover different keys.

pub fn entries_at_prefix(&self, prefix: &[bool]) -> Vec<(Hash, Hash)>

Returns all (key, value_hash) entries under the given prefix. This is bandwidth-efficient for sync - just the leaf data, no merkle paths.

Trait Implementations

impl<H: NodeHasher> BorshDeserialize for SubTree<H>

fn deserialize_reader<R: Read>(reader: &mut R) -> Result<Self>

fn deserialize(buf: &mut &[u8]) -> Result<Self, Error>

Deserializes this instance from a given slice of bytes. Updates the buffer to point at the remaining bytes.

fn try_from_slice(v: &[u8]) -> Result<Self, Error>

Deserialize this instance from a slice of bytes.

fn try_from_reader<R>(reader: &mut R) -> Result<Self, Error>

where R: Read,

impl<H: NodeHasher> BorshSerialize for SubTree<H>

fn serialize<W: Write>(&self, writer: &mut W) -> Result<()>

impl<H: Clone + NodeHasher> Clone for SubTree<H>

fn clone(&self) -> SubTree<H>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<H: Debug + NodeHasher> Debug for SubTree<H>

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

Formats the value using the given formatter.