Enum multiproof_rs::binary_tree::BinaryTree

pub enum BinaryTree {
    Hash(Vec<u8>),
    Leaf(BinaryKey, Vec<u8>),
    Branch(Box<BinaryTree>, Box<BinaryTree>),
    EmptyChild,
}

Variants

Hash(Vec<u8>)

Leaf(BinaryKey, Vec<u8>)

Branch(Box<BinaryTree>, Box<BinaryTree>)

EmptyChild

Trait Implementations

impl Clone for BinaryTree

fn clone(&self) -> BinaryTree

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for BinaryTree

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

Formats the value using the given formatter.

impl Default for BinaryTree

fn default() -> Self

Returns the "default value" for a type.

impl NodeType for BinaryTree

type Key = BinaryKey

The tree's key type. Must be specified when implementing this trait.

type Value = Vec<u8>

The tree's value type. Must be specified when implementing this trait.

impl PartialEq<BinaryTree> for BinaryTree

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

This method tests for self and other values to be equal, and is used by ==.

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

This method tests for !=.

impl StructuralPartialEq for BinaryTree

impl Tree<BinaryTree> for BinaryTree

fn is_leaf(&self) -> bool

Specifies if the current tree is a simple leaf.

fn is_empty(&self) -> bool

Specifies if the current tree is empty.

fn num_children(&self) -> usize

Returns the tree root's maximal number of children.

fn ith_child(&self, index: usize) -> Option<&Self>

Returns a pointer to child #i, or None if no such child exists.

fn set_ith_child(&mut self, index: usize, child: &Self)

Set child node #i of the current node.

fn insert(&mut self, key: &BinaryKey, value: Vec<u8>) -> Result<(), String>

Insert a (key,value) pair into a (sub-)tree represented by root.

fn has_key(&self, key: &BinaryKey) -> bool

Returns true if the current tree contains key as a key.

fn value(&self) -> Option<&Vec<u8>>

fn value_length(&self) -> Option<usize>

fn from_hash(h: Vec<u8>) -> Self

fn new_extension(_ext: Vec<u8>, _child: Self) -> Self

fn new_branch() -> Self

fn new_leaf(key: Vec<u8>, value: Vec<u8>) -> Self

fn new_empty() -> Self

Important traits for NodeChildIterator<'a, N, T>

impl<'a, N: NodeType, T: Tree<N>> Iterator for NodeChildIterator<'a, N, T> type Item = &'a T;

fn children(&self) -> NodeChildIterator<N, Self>

Returns an iterator to the node's children. Some of these nodes can be empty.