Struct Outcome 

pub struct Outcome {
    pub violations: Vec<Violation>,
    pub files_discovered: usize,
    pub files_parsed: usize,
    pub timings: Option<BTreeMap<RuleId, RuleTiming>>,
    pub dependencies: BTreeMap<FilePath, Vec<TrackedRead>>,
}

What a run produced.

Fields

violations: Vec<Violation>

Violations, in canonical order.

files_discovered: usize

How many files discovery selected.

files_parsed: usize

How many were actually parsed, after gates.

timings: Option<BTreeMap<RuleId, RuleTiming>>

Where the run spent its time, per rule, when --profile asked.

Absent otherwise: timing every match costs a clock read per invocation, which is exactly the kind of thing that should not be on the path a warm run takes.

dependencies: BTreeMap<FilePath, Vec<TrackedRead>>

What each checked file’s rules read beyond that file, in path order.

Exactly the shape a cache entry needs: dependencies belong to the file whose result they affect, not to the run. A file with no tracked reads has no entry here rather than an empty one, so the common case costs nothing.

Trait Implementations

impl Clone for Outcome

fn clone(&self) -> Outcome

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Outcome

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

Formats the value using the given formatter.

impl Default for Outcome

fn default() -> Outcome

Returns the “default value” for a type.

impl Eq for Outcome

impl PartialEq for Outcome

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for Outcome