(no title)
wangii | 7 months ago
there are about 1 million c++ state machines, and sml happens to be the best, or one of them. how does yours differentiate?
wangii | 7 months ago
there are about 1 million c++ state machines, and sml happens to be the best, or one of them. how does yours differentiate?
canyp|7 months ago
What exactly happened there? It looks like make_transition_table() is doing some serious magic. Or are the state transitions evaluated at compile-time given that there is no input in the example, and then the transition table gets compiled out?
Anyway, I think it would help OP's library to have some assembly output in the readme as well.
aw1621107|7 months ago
[0]: https://en.cppreference.com/w/cpp/language/user_literal.html
[1]: https://github.com/boost-ext/sml/blob/f232328b49adf708737bef...