Struct LinearStateMachine 

pub struct LinearStateMachine<L: LabelId> { /* private fields */ }

A simple state machine implementation for testing.

This implementation uses a linear sequence of expected operations.

Implementations

impl<L: LabelId> LinearStateMachine<L>

pub fn new( protocol: impl Into<String>, role: RoleName, states: Vec<BlockedOn<L>>, ) -> Self

Create a new linear state machine.

Trait Implementations

impl<L: Debug + LabelId> Debug for LinearStateMachine<L>

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

Formats the value using the given formatter.

impl<L: LabelId> ProtocolStateMachine for LinearStateMachine<L>

type Label = L

fn protocol_name(&self) -> &str

Get the protocol name.

fn role(&self) -> &RoleName

Get the current role.

fn blocked_on(&self) -> BlockedOn<Self::Label>

Get what the state machine is currently blocked on.

fn step( &mut self, input: StepInput<Self::Label>, ) -> Result<StepOutput<Self::Label>, ChoreographyError>

Attempt to advance the state machine with the given input.

fn checkpoint(&self) -> Result<Checkpoint, CheckpointError>

Create a checkpoint of the current state.

fn restore(&mut self, checkpoint: &Checkpoint) -> Result<(), CheckpointError>

Restore state from a checkpoint.

fn sequence(&self) -> u64

Get the current sequence number.

fn is_complete(&self) -> bool

Check if the protocol has completed.