Struct Entry 

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

TreeEntry object

Fields

prefix_len: usize

count of bytes shared with previous TreeEntry in this Node (if any)

keysuffix: Vec<u8>

remainder of key for this TreeEntry, after “prefixlen” have been removed

value: Cid

link to the record data (CBOR) for this entry

tree: Option<Cid>

link to a sub-tree Node at a lower level

the lower level must have keys sorting after this TreeEntry’s key (to the “right”), but before the next TreeEntry’s key in this Node (if any)

Trait Implementations

impl Debug for Entry

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for Entry

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

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 StructuralPartialEq for Entry