Struct DefaultTurnReducer 

pub struct DefaultTurnReducer { /* private fields */ }

The deterministic whole-turn reducer of §13. Build one per turn.

Implementations

impl DefaultTurnReducer

pub fn new( workflows: impl Into<WorkflowDefinitions>, resolver: TargetResolver, policy: PolicyEngine, config: &OrchestratorConfig, ) -> Self

Builds a reducer for one turn: resolver carries the tokens and the card on screen, policy the mode and the card copy, config the execution and narration sections.

pub fn with_state(self, case: CaseKey, state: Value) -> Self

Adds the loaded state of one case. A case with no entry compiles against None, which is what a case that does not exist yet looks like.

pub fn with_states( self, states: impl IntoIterator<Item = (CaseKey, Value)>, ) -> Self

Adds several loaded states.

pub fn with_confirmed_origin(self, origin: CommandOrigin, act: ActId) -> Self

Declares the origin a card answer minted, for the one act the card itself put into the plan. No other act receives it (I12).

pub fn with_copy(self, copy: NoticeCopy) -> Self

Replaces the notices the reducer writes itself. The shipped copy is English.

pub const fn resolver(&self) -> &TargetResolver

The resolver this reducer was built with.

impl DefaultTurnReducer

pub fn reduce_turn( &self, input: &TurnInput, understanding: &Understanding, context: &ReductionContext, ) -> Result<ReducedTurn, ReductionError>

Reduces one turn, keeping the envelopes its confirmation cards will authorize.

Errors

Whatever TurnReducer::reduce returns.

Trait Implementations

impl Clone for DefaultTurnReducer

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 DefaultTurnReducer

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

Formats the value using the given formatter.

impl TurnReducer for DefaultTurnReducer

fn reduce( &self, input: &TurnInput, understanding: &Understanding, context: &ReductionContext, ) -> Result<ReductionPlan, ReductionError>

Reduces one understood turn into an execution plan. Must be deterministic for the same inputs and must not perform I/O.