Struct merkle_search_tree::Node

pub struct Node<const N: usize, K> { /* private fields */ }

Storage of a single key/value pair.

Keys are stored immutably in the Node, alongside the hash of a value (and not the value itself).

Implementations

impl<const N: usize, K> Node<N, K>

pub fn key(&self) -> &K

Return the key of this node.

pub fn value_hash(&self) -> &ValueDigest<N>

Return the hash of the value for this node.

Trait Implementations

impl<const N: usize, K: Clone> Clone for Node<N, K>

fn clone(&self) -> Node<N, K>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<const N: usize, K: Debug> Debug for Node<N, K>

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

Formats the value using the given formatter.

impl<const N: usize, K: PartialEq> PartialEq<Node<N, K>> for Node<N, K>

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

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

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

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<const N: usize, K: Eq> Eq for Node<N, K>

impl<const N: usize, K> StructuralEq for Node<N, K>

impl<const N: usize, K> StructuralPartialEq for Node<N, K>