Struct Plan 

pub struct Plan { /* private fields */ }

A logical execution plan — a directed acyclic graph (DAG) of steps.

Steps are stored in topological order: a step’s dependencies always have a smaller StepId than the step itself.

Implementations

impl Plan

pub fn root(&self) -> StepId

Returns the root step ID.

pub fn steps(&self) -> &[Step]

Returns a reference to all steps.

pub fn get(&self, id: StepId) -> Option<&Step>

Looks up a step by its ID.

pub fn len(&self) -> usize

Number of steps in the plan.

pub fn is_empty(&self) -> bool

Whether the plan has zero steps.

pub fn to_mermaid(&self) -> String

Render the plan as a Mermaid flowchart.

pub fn to_dot(&self) -> String

Render the plan as a DOT (Graphviz) digraph.

Trait Implementations

impl Clone for Plan

fn clone(&self) -> Plan

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Plan

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

Formats the value using the given formatter.

impl Display for Plan

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

Formats the value using the given formatter.