finny 0.2.0

Finite State Machines with a procedural builder-style API and compile time transition checks.
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
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64

//! A minimal, internal FSM for unit tests, manually written.

use crate::{AllVariants, FsmBackend, FsmCurrentState, FsmStates};
use derive_more::From;

#[derive(Default)]
pub struct StateA;
#[derive(Copy, Clone, Debug, PartialEq)]
pub struct EventA { pub n: usize }

#[derive(Debug)]
pub struct TestFsm;

#[derive(Default)]
pub struct States {
    state_a: StateA
}

#[derive(Copy, Clone, Debug, PartialEq)]
pub enum StateKind {
    StateA
}

impl FsmStates<TestFsm> for States {
    type StateKind = StateKind;
    type CurrentState = [FsmCurrentState<StateKind>; 1];
}

#[derive(Debug, Copy, Clone, PartialEq, From)]
pub enum Events {
    EventA(EventA)
}

impl AsRef<str> for Events {
    fn as_ref(&self) -> &'static str {
        todo!()
    }
}
#[derive(Debug, Clone, PartialEq)]
pub enum FsmBackendTimers {

}

impl AllVariants for FsmBackendTimers {
    type Iter = core::iter::Once<FsmBackendTimers>;

    fn iter() -> Self::Iter {
        todo!()
    }
}

impl FsmBackend for TestFsm {
    type Context = ();
    type States = States;
    type Events = Events;
    type Timers = FsmBackendTimers;

    fn dispatch_event<Q, I, T>(_ctx: crate::DispatchContext<Self, Q, I, T>, _event: crate::FsmEvent<Self::Events, Self::Timers>) -> crate::FsmDispatchResult
        where Q: crate::FsmEventQueue<Self>,
            I: crate::Inspect, T: crate::FsmTimers<Self>
     {
        todo!()
    }
}