Struct FSM 

pub struct FSM<State, Effect>
where
    State: Eq + PartialEq + Copy + Hash,
    Effect: Copy,
{ /* private fields */ }

Finite state machine with side effects (Mealy automata)

Implementations

impl<State, Effect> FSM<State, Effect>

where State: Eq + PartialEq + Copy + Hash + Debug, Effect: Copy,

pub fn new<'a>( initial_state: State, transition_table: HashMap<State, Vec<Transition<State, Effect>>>, post_effect: Option<Effect>, ) -> Result<Self, FSMError<'a, State>>

Creates new instance of FSM

• initial_state: starting state,
• transition_table: transition graph
• post_effect: post-effect

pub fn merge_effects<'a>( &mut self, effects_map: &HashMap<StatesConnection<State>, Vec<Effect>>, ) -> Result<(), FSMError<'a, State>>

Merges effects into existing fsm for its states aligned to order of transitions for each state

• effects_map: map from pair of states (“from”, “to”) to ordered list of effects (This method is created mainly for testing, reusing the same states and transition rules (i.e. partial fsm) for different effects configurations. For typical cases, it’s recommended to build fsm from its initialization (i.e. using “new” method))

pub fn proceed<'a>( &self, string: &'a String, effector: Option<&'a mut dyn Effector<Effect>>, ) -> Result<(), FSMError<'a, State>>

Runs some string through FSM to validate it (and apply some effects)

• string: runnable string,
• effector: module that mutates some data by effects