[BOOST].SML STATE MACHINE LANGUAGE
summary
A header-only state-machine DSL implemented with lambdas and template deduction compiles to a static transition table and runs at compile time, targeting C++14 with no Boost or FTL dependencies. Benchmarks use 50 states, hundreds of transitions and show comparable compilation time to enums/switch and Boost MSM while often beating a switch at execution due to no bounds checks. Example usage is ~50 lines to express UML-style transitions and it works as a drop-in single header.
AI-written summary · about
chapters (5)
related talks
01h 00m“State Machines Battlefield - Naive vs STL vs Boost”
01h 13mModernizing Finite State Machines in C++ - Empower Simplicity & Boost Performance With std::variant
05mLightning Talk: Powered by C++20 Meta-Programming (MP)
01h 08mTemplate Meta-State Machines, Madness and Shannon
01h 26mLow-Latency Trading Systems in C++: Templated Meta-State Machines in HFT
29mEffective replacement of dynamic polymorphism with std::variant
01h 34mMetaprogramming in C++14
22mEffective replacement of dynamic polymorphism with std::variant