Struct Scheduler 

pub struct Scheduler { /* private fields */ }

State machine over a parsed pipe. Construct once per run; thread ready() / mark() calls through the dispatcher loop.

Implementations

impl Scheduler

pub fn new(pipe: &Pipe) -> Self

Build a scheduler from a parsed pipe. Every node starts Pending.

pub fn state(&self, id: &str) -> Option<NodeState>

Current state of id, or None if unknown.

pub fn all_ids(&self) -> &[String]

All node ids in the DAG (insertion order from the pipe).

pub fn ready(&mut self) -> Vec<String>

Ids currently dispatchable: Pending nodes whose predecessors satisfy their trigger_rule. Idempotent — promotes to Running and returns the freshly-promoted set. Sorted for determinism.

pub fn mark( &mut self, id: &str, outcome: NodeOutcome, ) -> Result<Vec<String>, SchedulerError>

Record the outcome of a Running node and return the ids that just became unblocked (whether ready-to-dispatch or permanently blocked is a follow-up ready() / state() inspection).

Returns Err if id is unknown or not currently Running.

pub fn is_terminal(&self) -> bool

True when no more progress is possible: every node is Completed, Failed, or Blocked.