Struct Path 

pub struct Path {
    pub nodes: Vec<Cid>,
    pub value: Option<Cid>,
}

Which blocks prove what a tree says about one key.

The nodes are the walk from the root down, in that order, and each one names the next: a verifier hashes each block to check it is the node it was told to expect, reads the entry range it lands in, and follows the link. value is the record’s CID when the key is in the tree and None when it is not — and the absence is proved by the same nodes, because the last one on the path is where the key would have to be if it existed.

Fields

nodes: Vec<Cid>

The nodes walked, root first.

value: Option<Cid>

The record the key names, if the tree holds it.

Trait Implementations

impl Clone for Path

fn clone(&self) -> Path

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Path

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

Formats the value using the given formatter.

impl PartialEq for Path

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

impl StructuralPartialEq for Path