Struct NormalizedGraph 

pub struct NormalizedGraph<'a> { /* private fields */ }

Reverse-dependency graph over discovered packages.

NormalizedGraph borrows string slices from the input PackageRecord and DependencyEdge slices. It must be consumed (queried and dropped) before the input data goes out of scope. If you need to store the graph across async boundaries or function returns, clone the relevant data first.

Implementations

impl<'a> NormalizedGraph<'a>

pub fn new( packages: &'a [PackageRecord], dependency_edges: &'a [DependencyEdge], ) -> Self

Build a reverse-dependency graph from discovered packages and edges.

pub fn direct_dependents(&self, package_id: &str) -> Vec<&'a str>

Return the packages that directly depend on package_id.

pub fn transitive_dependents(&self, package_id: &str) -> BTreeSet<&'a str>

Return the transitive dependent closure for package_id.

pub fn contains(&self, package_id: &str) -> bool

Return true when the graph contains package_id.

Trait Implementations

impl<'a> Clone for NormalizedGraph<'a>

fn clone(&self) -> NormalizedGraph<'a>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<'a> Debug for NormalizedGraph<'a>

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

Formats the value using the given formatter.