Struct MissingNodePlan 

pub struct MissingNodePlan {
    pub required_cids: Vec<Cid>,
    pub required_nodes: usize,
    pub required_bytes: usize,
    pub missing_cids: Vec<Cid>,
    pub missing_nodes: usize,
    pub missing_bytes: usize,
}

Dry-run plan for making a destination store able to read one source tree.

required_cids are all node CIDs reachable from the tree root. missing_cids are the subset not currently present in the destination store. All CIDs are sorted by raw CID bytes for deterministic transport planning.

Fields

required_cids: Vec<Cid>

All reachable node CIDs required by the tree.

required_nodes: usize

Number of reachable nodes required by the tree.

required_bytes: usize

Serialized bytes for all reachable nodes in the source tree.

missing_cids: Vec<Cid>

Required node CIDs not present in the destination store.

missing_nodes: usize

Number of missing destination nodes.

missing_bytes: usize

Serialized bytes for missing nodes as read from the source store.

Implementations

impl MissingNodePlan

pub fn is_empty(&self) -> bool

Whether the destination already has every required node.

pub fn required_cids(&self) -> &[Cid]

Return all required CIDs in deterministic byte order.

pub fn missing_cids(&self) -> &[Cid]

Return missing CIDs in deterministic byte order.

Trait Implementations

impl Clone for MissingNodePlan

fn clone(&self) -> MissingNodePlan

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for MissingNodePlan

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

Formats the value using the given formatter.

impl Default for MissingNodePlan

fn default() -> MissingNodePlan

Returns the “default value” for a type.

impl Eq for MissingNodePlan

impl PartialEq for MissingNodePlan

fn eq(&self, other: &MissingNodePlan) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl StructuralPartialEq for MissingNodePlan