Struct NodeSummary 

#[non_exhaustive]
pub struct NodeSummary { /* private fields */ }

A minimal summary of a node for scheduling decisions.

• index: the node identifier in the graph.
• earliest_deadline: minimum absolute deadline among ready inputs, or synthesized now + default_deadline_ns if policy provides a default and inputs lack deadlines; otherwise None.
• readiness: derived from input availability and output pressure (see Readiness contract above).
• backpressure: the maximum watermark state across all outputs.

Implementations

impl NodeSummary

pub const fn new( index: NodeIndex, earliest_deadline: Option<DeadlineNs>, readiness: Readiness, backpressure: WatermarkState, ) -> Self

Constructs a new NodeSummary from the provided fields.

pub const fn index(&self) -> &NodeIndex

Index of the node in the graph.

pub const fn earliest_deadline(&self) -> &Option<DeadlineNs>

Earliest absolute deadline (if any) among its ready inputs.

pub const fn readiness(&self) -> &Readiness

Readiness level.

pub const fn backpressure(&self) -> &WatermarkState

Current backpressure state from outputs.

Trait Implementations

impl Clone for NodeSummary

fn clone(&self) -> NodeSummary

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for NodeSummary

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

Formats the value using the given formatter.

impl PartialEq for NodeSummary

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

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Copy for NodeSummary

impl Eq for NodeSummary

impl StructuralPartialEq for NodeSummary