Struct ExecutionPlan 

pub struct ExecutionPlan {
    pub order: Vec<NodeId>,
    pub alternatives: HashMap<NodeId, AlternativeSet>,
    pub generation: u64,
}

Per-realize execution plan. Built by compile_plan.

alternatives is sparse — view ops, Op::Const, and ops op_to_op_kind returns None for get no entry. The executor’s per-node dispatch reads alternatives.get(&id) and either takes the winner (top entry after rank) or, in the long-term shape, hands the full set to the runtime selector (Picker 2) for layer-3-telemetry-driven choice.

Fields

order: Vec<NodeId>

Topological order — same shape the executor walks.

alternatives: HashMap<NodeId, AlternativeSet>

One AlternativeSet per kernel-bearing node. Sparse.

generation: u64

SystemTopology generation counter snapshotted at compile_plan time. The executor (Phase 4.3) checks this against crate::dispatch::topology_generation() at every dispatch-chunk boundary; mismatch surfaces Error::TopologyChanged so the realize layer can rebuild the plan against the fresh topology.

0 for ExecutionPlan::empty() — empty plans by definition have no alternatives to invalidate, so the executor’s chunk- boundary check skips them.

Implementations

impl ExecutionPlan

pub fn empty() -> Self

Empty plan. Tests + future direct-call sites.

pub fn alternatives(&self, node: NodeId) -> Option<&AlternativeSet>

Read-only handle to a node’s alternative set. None for nodes outside the plan’s map.

pub fn alternatives_mut(&mut self, node: NodeId) -> Option<&mut AlternativeSet>

Mutable handle — used by post-plan refinement passes (Phase 3’s Judge integration may re-rank top-N after the plan is built).

Trait Implementations

impl Debug for ExecutionPlan

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

Formats the value using the given formatter.