Enum RadixTerminal 

pub enum RadixTerminal<V, const KEY_BYTES: usize> {
    Leaf {
        value: MissingOr<V>,
    },
    Empty,
    DivergingLeaf {
        other_key: [u8; KEY_BYTES],
        other_value_root: [u8; 32],
    },
}

The node q’s walk terminates on.

Variants

Leaf

Membership: a leaf whose key is the queried key, carrying its value.

Fields

value: MissingOr<V>

Empty

Non-membership: q’s path reaches an empty subtree.

DivergingLeaf

Non-membership: q’s path reaches a leaf for a different key that shares q’s consumed prefix.

Fields

other_key: [u8; KEY_BYTES]

other_value_root: [u8; 32]

Trait Implementations

impl<V: Clone, const KEY_BYTES: usize> Clone for RadixTerminal<V, KEY_BYTES>

fn clone(&self) -> RadixTerminal<V, KEY_BYTES>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<V: Debug, const KEY_BYTES: usize> Debug for RadixTerminal<V, KEY_BYTES>

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

Formats the value using the given formatter.

impl<V: PartialEq, const KEY_BYTES: usize> PartialEq for RadixTerminal<V, KEY_BYTES>

fn eq(&self, other: &RadixTerminal<V, KEY_BYTES>) -> 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<V: Eq, const KEY_BYTES: usize> Eq for RadixTerminal<V, KEY_BYTES>

impl<V, const KEY_BYTES: usize> StructuralPartialEq for RadixTerminal<V, KEY_BYTES>