Struct WhyReport 

pub struct WhyReport {
    pub a: String,
    pub b: String,
    pub links: Vec<WhyLink>,
    pub path: Vec<(String, String)>,
    pub shared: Option<SharedCommits>,
    pub unknown: Vec<String>,
}

How a and b are linked, if they are.

Fields

a: String

b: String

links: Vec<WhyLink>

Every rule-written edge between them, in either direction.

path: Vec<(String, String)>

(edge type, node reached) hops, filled only when no rule links them directly, they share too few commits to say anything, and a walk of at most MAX_HOPS edges connects them.

shared: Option<SharedCommits>

Commits both were touched by, filled only when no CO_CHANGED edge already carries them.

The co_changed rule writes an edge on jaccard similarity, so two files that change together often and also change apart carry no edge at all and would otherwise be reported as unrelated — or as related only by whatever else happens to link them. See MIN_SHARED_COMMITS.

unknown: Vec<String>

Whichever of a and b the store has never heard of.

Trait Implementations

impl Clone for WhyReport

fn clone(&self) -> WhyReport

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for WhyReport

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

Formats the value using the given formatter.

impl PartialEq for WhyReport

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

Equality operator ==.

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

Inequality operator !=.

impl Serialize for WhyReport

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

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for WhyReport