Struct Node 

pub struct Node<T: AsRef<[u8]>> {
    pub hash: Hash,
    pub left: Rc<NodeType<T>>,
    pub right: Rc<NodeType<T>>,
}

A middle-layer node, containing two nodes underneith that is of some NodeType variation

Fields

hash: Hash

left: Rc<NodeType<T>>

right: Rc<NodeType<T>>

Implementations

impl<T: AsRef<[u8]>> Node<T>

pub fn new<N: Into<NodeType<T>>>(left: N, right: N) -> Self

Creates a new Node from nodes below

Trait Implementations

impl<T: Clone + AsRef<[u8]>> Clone for Node<T>

fn clone(&self) -> Node<T>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Debug + AsRef<[u8]>> Debug for Node<T>

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

Formats the value using the given formatter.

impl<T: AsRef<[u8]>> From<Node<T>> for NodeType<T>

fn from(node: Node<T>) -> Self

Converts to this type from the input type.

impl<T: AsRef<[u8]>> NodeMethod<T> for Node<T>

fn get_hash(&self) -> Hash

Gets the blake3-based [Hash] for trait implementation, just call on any Node, Data or NodeType like so: item.get_hash(). Typically all this method will do is get the self.hash but this can be used to adapt a broader NodeType

fn verify(&self) -> Result<(), (Hash, Hash)>

Verifies the node down through recursion, providing a high-level checking/verification method

impl<T: PartialEq + AsRef<[u8]>> PartialEq for Node<T>

fn eq(&self, other: &Node<T>) -> 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<T: AsRef<[u8]>> StructuralPartialEq for Node<T>