Struct ContinuousNodeDriver 

pub struct ContinuousNodeDriver {
    pub graph_id: String,
    pub index: NodeFeatureIndex,
    pub subscriptions: SubscriptionRegistry,
    pub active_invocations: BTreeMap<String, String>,
    pub scope_barrier_active: bool,
    pub durable_cursor: u64,
    /* private fields */
}

Continuous driver orchestrating node facades, feature indexing, queues, and result re-entry.

Fields

graph_id: String

index: NodeFeatureIndex

subscriptions: SubscriptionRegistry

active_invocations: BTreeMap<String, String>

scope_barrier_active: bool

durable_cursor: u64

Implementations

impl ContinuousNodeDriver

pub fn new( graph_id: impl Into<String>, queue: FairDispatchQueue, subscriptions: SubscriptionRegistry, ) -> ContinuousNodeDriver

pub fn register_node(&mut self, facade: NodeFacade)

Register a new node facade into the driver and feature index.

pub fn drive_step(&mut self) -> Result<DriverStepOutcome, DriverError>

Perform a single drive step:

1. Pull next queue item.
2. Validate live recipient states and generations.
3. Dispatch to node facades.
4. Poll and re-enter settled invocations.

pub fn reenter_result( &mut self, reentry: ResultReentry, ) -> Result<NodeExecutionReceipt, DriverError>

Re-enter an execution result carrying full source identity. Stale generations are rejected and cannot satisfy new dependencies.

pub fn pause_graph(&mut self) -> Result<GraphPauseReport, DriverError>

Graceful graph pause: establishes scope admission barrier and requests pause on all active nodes. Collects per-node outcomes without fabricating success for unavailable backends.

pub fn stop_graph( &mut self, reason: &str, ) -> Result<GraphStopReport, DriverError>

Graceful graph stop: establishes scope admission barrier and cooperatively cancels all active nodes. Collects per-node outcomes and preserves requested, acknowledged, and effect-unknown facts.