Struct Subgraph 

pub struct Subgraph<P, C>
where
    P: GraphState,
    C: GraphState + Clone,
    <C as GraphState>::Update: Clone,
{ /* private fields */ }

Adapter Node that runs a child graph and projects its state into a parent update.

Implementations

impl<P, C> Subgraph<P, C>

where P: GraphState, C: GraphState + Clone + Send + 'static, <C as GraphState>::Update: Clone,

pub fn new( name: impl Into<String>, child: CompiledGraph<C>, project_in: impl Fn(&P) -> C + Send + Sync + 'static, project_out: impl Fn(&C) -> P::Update + Send + Sync + 'static, next: Goto, ) -> Self

Build a subgraph adapter.

• project_in: parent state → fresh child state seed.
• project_out: final child state → parent update.
• next: where the parent goes after the subgraph returns.

Trait Implementations

impl<P, C> Node<P> for Subgraph<P, C>

where P: GraphState + Send + Sync + 'static, C: GraphState + Clone + Send + Sync + 'static, <C as GraphState>::Update: Clone, <P as GraphState>::Update: Send + 'static,

fn execute<'life0, 'life1, 'life2, 'life3, 'async_trait>( &'life0 self, parent: &'life1 P, ctx: &'life2 NodeCtx<'life3>, ) -> Pin<Box<dyn Future<Output = Result<NodeOut<P>>> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait, 'life1: 'async_trait, 'life2: 'async_trait, 'life3: 'async_trait,

Execute one superstep of this node.

fn name(&self) -> &str

Friendly name for telemetry / logging. Default uses the type name.

fn retry_policy(&self) -> Option<NodeRetryPolicy>

Per-task retry policy. Default None means “no retry — propagate the error”. When Some, the engine retries execute on retryable errors with exponential backoff.