smlang 0.8.0

A no-std state machine language DSL
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42

//! Linear state machine
//!
//! A simple example of a state machine which will get stuck in the final state.
//! A picture depicting the state machine can be found in the README.

#![deny(missing_docs)]

use smlang::statemachine;

statemachine! {
    name: Linear,
    derive_states: [Debug],
    transitions: {
        *State1 + Event1 = State2,
        State2 + Event2 = State3,
    },
}

/// Context
pub struct Context;

impl LinearStateMachineContext for Context {}

fn main() {
    let mut sm = LinearStateMachine::new(Context);
    assert!(matches!(sm.state(), &LinearStates::State1));

    let r = sm.process_event(LinearEvents::Event1);
    assert!(matches!(r, Ok(&LinearStates::State2)));

    let r = sm.process_event(LinearEvents::Event2);
    assert!(matches!(r, Ok(&LinearStates::State3)));

    // Now all events will not give any change of state
    let r = sm.process_event(LinearEvents::Event1);
    assert!(matches!(r, Err(LinearError::InvalidEvent)));
    assert!(matches!(sm.state(), &LinearStates::State3));

    let r = sm.process_event(LinearEvents::Event2);
    assert!(matches!(r, Err(LinearError::InvalidEvent)));
    assert!(matches!(sm.state(), &LinearStates::State3));
}