Struct Parts 

pub struct Parts {
    pub keys: Vec<String>,
    pub values: Vec<Cid>,
    pub subtrees: Vec<Option<Cid>>,
}

A node’s contents in the form the tree algorithms want them.

The encoding stores each key against the previous one, which is compact and useless to walk over. This is the same node with the keys rebuilt and the subtrees interleaved the way the protocol describes them:

keys:          (0,    1,    2,    3)
values:        (0,    1,    2,    3)
subtrees:   (0,    1,    2,    3,    4)

There is always exactly one more subtree than there are keys: the one before the first key is the node’s l, and each entry’s t is the one after it.

Fields

keys: Vec<String>

The full keys, ascending.

values: Vec<Cid>

The record each key names.

subtrees: Vec<Option<Cid>>

The subtrees between and around the keys; always keys.len() + 1.

Trait Implementations

impl Clone for Parts

fn clone(&self) -> Parts

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Parts

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

Formats the value using the given formatter.

impl PartialEq for Parts

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

impl StructuralPartialEq for Parts