Struct EvaluationSchedule 

pub struct EvaluationSchedule {
    pub layers: Vec<Vec<String>>,
}

A layered evaluation schedule derived from a RuleDependencyGraph.

Layer 0 contains all rules that have no dependencies. Layer k contains all rules whose dependencies are entirely contained in layers 0 … k-1.

Within each layer, rules can in principle be evaluated in parallel because they are independent of each other.

Fields

layers: Vec<Vec<String>>

Rules grouped by evaluation layer.

layers[0] holds rules with no dependencies; layers[k] holds rules whose latest dependency is in layer k-1.

Implementations

impl EvaluationSchedule

pub fn build(graph: &RuleDependencyGraph) -> Result<Self, DepError>

Build an EvaluationSchedule from a RuleDependencyGraph.

The implementation performs a BFS / Kahn-style traversal and assigns each rule to the layer immediately after its deepest dependency.

Errors

Propagates DepError::CycleDetected if the graph contains a cycle.

pub fn layer_count(&self) -> usize

Return the number of evaluation layers.

pub fn total_rules(&self) -> usize

Return the total number of rules across all layers.

Trait Implementations

impl Clone for EvaluationSchedule

fn clone(&self) -> EvaluationSchedule

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for EvaluationSchedule

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

Formats the value using the given formatter.