Struct RefIndex 

pub struct RefIndex {
    pub references: BTreeMap<PathBuf, BTreeSet<PathBuf>>,
    pub referrers: BTreeMap<PathBuf, BTreeSet<PathBuf>>,
}

Precomputed referrer/referee mapping over a store inventory. Used by graft + redact transforms that need “which paths point at this one?” answers in O(1).

Fields

references: BTreeMap<PathBuf, BTreeSet<PathBuf>>

For each path, the set of paths it references (closure edges originating at the key).

referrers: BTreeMap<PathBuf, BTreeSet<PathBuf>>

For each path, the set of paths that reference it (reverse edges — the “referrers”).

Implementations

impl RefIndex

pub fn build(inv: &StoreInventory, store_root: &str) -> Result<Self, SpecError>

Build the reference graph over the inventory. Walks each entry, computes its 1-hop references (no transitive closure), populates both directions.

Errors

Propagates Closure::walk errors.

pub fn refs_from(&self, path: &Path) -> &BTreeSet<PathBuf>

1-hop references from path. Empty set if path isn’t in the index.

pub fn referrers_of(&self, path: &Path) -> &BTreeSet<PathBuf>

1-hop referrers — paths that reference path.

Trait Implementations

impl Clone for RefIndex

fn clone(&self) -> RefIndex

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for RefIndex

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

Formats the value using the given formatter.

impl Default for RefIndex

fn default() -> RefIndex

Returns the “default value” for a type.