Struct Entry 

pub struct Entry {
    pub prefix: usize,
    pub suffix: Vec<u8>,
    pub value: Cid,
    pub tree: Option<Cid>,
}

One entry in a node: a key, the record it names, and what hangs to its right.

The key is stored split, because that is how it is encoded. A node’s entries are sorted, so each one records how many leading bytes it shares with its predecessor and then only the rest — p and k in the node encoding. The first entry in a node shares nothing, because it has no predecessor in that node; the key of the last entry in the subtree to its left is not what the prefix is counted against.

Fields

prefix: usize

How many leading bytes this key shares with the previous entry’s.

suffix: Vec<u8>

The rest of the key, from prefix onwards, as bytes.

value: Cid

The record this key names.

tree: Option<Cid>

The subtree of keys that sort after this one and before the next.

Trait Implementations

impl Clone for Entry

fn clone(&self) -> Entry

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Entry

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

Formats the value using the given formatter.

impl PartialEq for Entry

fn eq(&self, other: &Entry) -> 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 Eq for Entry

impl StructuralPartialEq for Entry