Struct Fork 

pub struct Fork<E: NodeEntry = ChunkAddress> { /* private fields */ }

A fork in the mantaray trie, consisting of a prefix and a child node.

Implementations

impl<E: NodeEntry> Fork<E>

pub fn prefix(&self) -> &[u8]

The prefix bytes for this fork edge.

pub const fn node(&self) -> &Node<E>

The child node.

pub const fn node_mut(&mut self) -> &mut Node<E>

Mutable access to the child node.

Trait Implementations

impl<E: Clone + NodeEntry> Clone for Fork<E>

fn clone(&self) -> Fork<E>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<E: Debug + NodeEntry> Debug for Fork<E>

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

Formats the value using the given formatter.

impl<E: NodeEntry> Default for Fork<E>

fn default() -> Self

Returns the “default value” for a type.

impl<E: Eq + NodeEntry> Eq for Fork<E>

impl<E: PartialEq + NodeEntry> PartialEq for Fork<E>

fn eq(&self, other: &Fork<E>) -> 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<E: NodeEntry> StructuralPartialEq for Fork<E>