-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
1 parent
50a6bd2
commit 0b0ffa4
Showing
1 changed file
with
16 additions
and
0 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,16 @@ | ||
# C++ Siberia 2021 | ||
|
||
## Making state machines with templates and coroutines | ||
|
||
Finite state machine, or simply *state machine* is a simple and very expressive way of describing logic. | ||
Very often logic that needs to be coded is either already presented in state machine form, or *asks* to be coded in that form. | ||
|
||
There are no standard means to represent state machines in C++, so (in addition to many existing ways) we will discuss how to implement it in modern C++ in two more ways: | ||
* with help of template magic, | ||
* and using coroutines. | ||
|
||
Along the way we'll examine several techniques that may be helpful in different situations not connected to state machines. | ||
|
||
Slides: | ||
* [PDF](Making%20state%20machines%20with%20templates%20and%20coroutines.pdf) | ||
* [PPTX](Making%20state%20machines%20with%20templates%20and%20coroutines.pptx) |