Enum NodeType 

pub enum NodeType<T: AsRef<[u8]>> {
    Node(Node<T>),
    Data(Data<T>),
}

Types of node that may be children

Variants

Node(Node<T>)

Data(Data<T>)

Trait Implementations

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

fn clone(&self) -> NodeType<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 NodeType<T>

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

Formats the value using the given formatter.

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

fn from(data: Data<T>) -> Self

Converts to this type from the input type.

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]>> From<T> for NodeType<T>

fn from(data: T) -> Self

Similar to the impl<T: AsRef<[u8]>> From<Data<T>> for NodeType<T> impl for NodeType but assumes raw input can also be a Data

impl<T: AsRef<[u8]>> NodeMethod<T> for NodeType<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 NodeType<T>

fn eq(&self, other: &NodeType<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 NodeType<T>