Struct LeafNode 

pub struct LeafNode {
    pub key: Nibbles,
    pub value: Vec<u8>,
}

Re-export A leaf node represents the endpoint or terminal node in the trie. In other words, a leaf node is where actual values are stored.

A leaf node consists of two parts: the key (or path) and the value. The key is typically the remaining portion of the key after following the path through the trie, and the value is the data associated with the full key. When searching the trie for a specific key, reaching a leaf node means that the search has successfully found the value associated with that key.

Fields

key: Nibbles

The key for this leaf node.

value: Vec<u8>

The node value.

Implementations

impl LeafNode

pub const EVEN_FLAG: u8 = 0x20

The flag representing the even number of nibbles in the leaf key.

pub const ODD_FLAG: u8 = 0x30

The flag representing the odd number of nibbles in the leaf key.

pub const fn new(key: Nibbles, value: Vec<u8>) -> LeafNode

Creates a new leaf node with the given key and value.

pub fn as_ref(&self) -> LeafNodeRef<'_>

Return leaf node as LeafNodeRef.

Trait Implementations

impl Clone for LeafNode

fn clone(&self) -> LeafNode

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for LeafNode

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

Formats the value using the given formatter.

impl Decodable for LeafNode

fn decode(buf: &mut &[u8]) -> Result<LeafNode, Error>

Decodes the blob into the appropriate type. buf must be advanced past the decoded object.

impl<'de> Deserialize<'de> for LeafNode

fn deserialize<__D>( __deserializer: __D, ) -> Result<LeafNode, <__D as Deserializer<'de>>::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Encodable for LeafNode

fn encode(&self, out: &mut dyn BufMut)

Encodes the type into the out buffer.

fn length(&self) -> usize

Returns the length of the encoding of this type in bytes.

impl Eq for LeafNode

impl PartialEq for LeafNode

fn eq(&self, other: &LeafNode) -> bool

Equality operator ==.

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

Inequality operator !=.

impl Serialize for LeafNode

fn serialize<__S>( &self, __serializer: __S, ) -> Result<<__S as Serializer>::Ok, <__S as Serializer>::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for LeafNode

Layout

Note: Most layout information is completely unstable and may even differ between compilations. The only exception is types with certain repr(...) attributes. Please see the Rust Reference's “Type Layout” chapter for details on type layout guarantees.

Size: 64 bytes