Struct Run 

pub struct Run {
    pub entry: NodeId,
    pub exit: NodeId,
    pub members: Vec<NodeId>,
    pub device: Option<BackendId>,
}

A maximal straight-line, single-device op-sequence between two decision points — the dispatch / command-buffer-capture unit.

members are in topological order; entry == members[0] and exit == *members.last(). device is the resolved BackendId shared by every member (via Graph::target_backend); None means “inherit the executor default” (no member carries an explicit backend) — a run is single-device, so every member agrees on this value by construction (a residency change is itself a run boundary).

Fields

entry: NodeId

First node of the run (a decision-point boundary).

exit: NodeId

Last node of the run (the node the next decision point reads, or a root output).

members: Vec<NodeId>

Every node of the run, in topological order, entry first.

device: Option<BackendId>

The single resolved backend shared by all members, or None when no member carries an explicit target_backend (executor default).

Trait Implementations

impl Clone for Run

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 Run

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

Formats the value using the given formatter.

impl Eq for Run

impl PartialEq for Run

fn eq(&self, other: &Self) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl StructuralPartialEq for Run