Enum multiproof_rs::node::Node

pub enum Node {
    Hash(Vec<u8>),
    Leaf(NibbleKey, Vec<u8>),
    Extension(NibbleKey, Box<Node>),
    Branch(Vec<Node>),
    EmptySlot,
}

Variants

Hash(Vec<u8>)

Leaf(NibbleKey, Vec<u8>)

Extension(NibbleKey, Box<Node>)

Branch(Vec<Node>)

EmptySlot

Methods

impl Node

pub fn graphviz(&self) -> String

pub fn hash(&self) -> Vec<u8>

pub fn composition(&self) -> Vec<u8>

Trait Implementations

impl Clone for Node

fn clone(&self) -> Node

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for Node

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

Formats the value using the given formatter.

impl Decodable for Node

fn decode(rlp: &Rlp) -> Result<Self, DecoderError>

Decode a value from RLP bytes

impl Default for Node

fn default() -> Self

Returns the "default value" for a type.

impl Encodable for Node

fn rlp_append(&self, s: &mut RlpStream)

Append a value to the stream

fn rlp_bytes(&self) -> Vec<u8>

Get rlp-encoded bytes for this instance

impl<'_> Index<&'_ NibbleKey> for Node

type Output = Node

The returned type after indexing.

fn index(&self, k: &NibbleKey) -> &Node

Performs the indexing (container[index]) operation.

impl NodeType for Node

type Key = NibbleKey

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<Node> for Node

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

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

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

This method tests for !=.

impl StructuralPartialEq for Node

impl Tree<Node> for Node

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 maximum child count of the tree's root.

Branch nodes will always report 16, as empty slots are counted as children.

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

Return the tree root's ith child.

The function will return EmptySlot instead of None if a branch node has no ith child.

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

Set child node #i of the current node.

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<Self, Self>

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

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

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

fn has_key(&self, key: &NibbleKey) -> 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