Struct ReverseDepIndex 

pub struct ReverseDepIndex { /* private fields */ }

v0.49.3: reverse-dependency index built from a Project’s forward links graph. Maps finding_id → [dependent_finding_id, …] so a “what depends on X?” lookup is O(1) instead of O(N×L).

Construct via Project::build_reverse_dep_index. The index is a snapshot — it does not auto-update if the Project mutates after. For long-lived consumers that mutate state, rebuild after each reduce step.

Implementations

impl ReverseDepIndex

pub fn dependents_of(&self, finding_id: &str) -> &[String]

Findings whose forward links list a target with this id. Empty slice if nothing depends on this finding (or if the id isn’t in the index at all).

pub fn edge_count(&self) -> usize

Total number of dependent edges in the index. Useful for quick sanity checks and metric reporting.

pub fn target_count(&self) -> usize

Number of distinct findings that have at least one dependent.

pub fn iter(&self) -> impl Iterator<Item = (&String, &Vec<String>)>

Iterate (target_finding_id, dependents) pairs. Order is HashMap-iteration-order, not stable across runs; sort if a consumer needs determinism.

Trait Implementations

impl Clone for ReverseDepIndex

fn clone(&self) -> ReverseDepIndex

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for ReverseDepIndex

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

Formats the value using the given formatter.

impl Default for ReverseDepIndex

fn default() -> ReverseDepIndex

Returns the “default value” for a type.