Struct OrderingEdges 

pub struct OrderingEdges(pub HashMap<NodeId, Vec<NodeId>>);

Derived ordering edges beyond the data-flow graph. Each entry (nid, deps) means nid must run after every node in deps.

Produced by derive_ordering from destructive-op metadata (Op::destructive_input). Consumed by execution_plan.

Tuple Fields

0: HashMap<NodeId, Vec<NodeId>>

Implementations

impl OrderingEdges

pub fn new() -> Self

pub fn is_empty(&self) -> bool

True if the map is empty — no destructive ops in the analyzed subgraph, so the execution plan is just the plain topo order.

pub fn deps_of(&self, nid: NodeId) -> &[NodeId]

Get the set of must-run-before nodes for nid, if any.

Trait Implementations

impl Clone for OrderingEdges

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for OrderingEdges

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

Formats the value using the given formatter.

impl Default for OrderingEdges

fn default() -> Self

Returns the “default value” for a type.