Struct Found 

pub struct Found {
    pub value: Option<Cid>,
    pub proof: BTreeSet<Cid>,
}

What a walk to one path found, and what proves it.

Fields

value: Option<Cid>

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

proof: BTreeSet<Cid>

The nodes walked, which are the proof of either answer.

A set rather than a list: it is combined with other proofs far more often than it is followed, and the order is recoverable from the blocks themselves.

Trait Implementations

impl Clone for Found

fn clone(&self) -> Found

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Found

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

Formats the value using the given formatter.

impl PartialEq for Found

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

impl StructuralPartialEq for Found