Struct ImportPathTrace 

pub struct ImportPathTrace {
    pub schema_version: ImportPathTraceSchemaVersion,
    pub from: String,
    pub to: String,
    pub reachable: bool,
    pub hops: usize,
    pub path: Vec<ImportPathHop>,
    pub reason: String,
}

Result of asking how one module reaches another: the shortest import path.

reachable is the only field that separates “no route exists” from “the route is empty because both ends are the same module”. Both report hops: 0, so a consumer must read reachable, never the hop count.

Fields

schema_version: ImportPathTraceSchemaVersion

Wire-shape version of this payload.

from: String

The module the walk started from, root-relative.

to: String

The module the walk was looking for, root-relative.

reachable: bool

Whether to is reachable from from by following import edges.

hops: usize

Number of import edges on the reported route. 0 both when the two ends are the same module and when there is no route at all.

path: Vec<ImportPathHop>

The route, in import order. Empty whenever hops is 0.

reason: String

Human-readable summary of the outcome.

Trait Implementations

impl Debug for ImportPathTrace

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

Formats the value using the given formatter.

impl Serialize for ImportPathTrace

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.