time complxity of this fsm

Question

time complxity of this fsm

Closed this issue 6 years ago · 4 comments

I aprreciate the code you shared. But it seems that every time this fsm handles an event, it needs to search the transition table. So the time complexity for each call of process_event is O(N) (N is the count of rows) , not O(1), which makes this fsm unpractical .

Answer 1 · 2018-09-06T15:11:17.000Z

For time complexity etc. see the references given in the README.

Answer 2 · 2018-09-06T15:16:16.000Z

sorry but i can't find the references in README. I only found a documentation of api. Could you please provide me a linkage?

Answer 3 · 2018-09-06T15:23:55.000Z

fsmlite is a lightweight finite state machine framework for C++11.
It is based on concepts first presented by David Abrahams and Aleksey
Gurtovoy in C++ Template Metaprogramming, with additional ideas
taken liberally from Boost's Meta State Machine (MSM).

Answer 4 · 2018-09-06T15:39:02.000Z

I look through the linkage of MSM but still not found anything explicitly about time complexity. By the way, is there anything wrong with my analysis of O(N) complexity about your code above?