Struct PackGraph 

pub struct PackGraph { /* private fields */ }

Fully-walked pack graph. Immutable post-construction.

Nodes are owned; callers borrow via PackGraph::nodes or the dedicated lookup helpers.

Implementations

impl PackGraph

pub fn validate(&self) -> Result<(), Vec<PackValidationError>>

Run the default graph-validator set over self.

Mirrors PackManifest::validate_plan at the graph surface. Kept here (rather than in tree::graph) so the tree module does not depend on pack::validate; the dependency direction stays validate -> tree only.

Errors

Returns the aggregated error list when any graph validator flags a problem.

impl PackGraph

pub fn root(&self) -> &PackNode

The root node (id == 0).

pub fn nodes(&self) -> &[PackNode]

All nodes in insertion order.

pub fn edges(&self) -> &[PackEdge]

All edges in insertion order.

pub fn children_of(&self, id: usize) -> impl Iterator<Item = &PackNode>

Iterate the Child-kind neighbours of id (in insertion order).

pub fn depends_on_of(&self, id: usize) -> impl Iterator<Item = &PackNode>

Iterate the DependsOn-kind neighbours of id.

pub fn find_by_name(&self, name: &str) -> Option<&PackNode>

Find a node by its manifest name. Returns the first match in insertion order; names are not guaranteed unique across a graph, though per-pack validators may reject duplicates in future slices.

pub fn node(&self, id: usize) -> Option<&PackNode>

Borrow a node by id.

Trait Implementations

impl Debug for PackGraph

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

Formats the value using the given formatter.