hardglitch VS cppcoro

I made it with only HTML5/JS, drawing directly in the etc. The whole code is there: https://github.com/gamkedo-la/hardglitch/ You can take inspiration from it if you want.

I reproduced a similar system in C++ and C# as experiments, but I did that for a real roguelike game (Hard Glitch, on itch which was in JavaScript (the code is open source, here is the specific turn-scheduling function you play in the current release, here is the old version that was replaced, you can see that the evolution wasnt too brutal through the commit history).

The whole project's code is there if you want to take a look: https://github.com/gamkedo-la/hardglitch

Not C++ but I'm working on a turn-by-turn game with animations etc. which relies a lot on coroutines (in JavaScript for this one). The code is there if you want to take a look: https://github.com/gamkedo-la/hardglitch (the game is playable there in the deployments, or in it's released version on itch: https://klaim.itch.io)

PS: Take a look at cppcoro; this might help as well, especially generator<>, if you're looking to generate numbers, and stuff;

This is the only viable implementation.

Kind of sounds like whatever library you were using provided leaky abstractions. Something like cppcoro provides really good abstractions for coroutines, the user really doesn't need to understand why any of it works.

Is there a usecase for copying/serializing such coroutines? If not, I would use the normal C++20 coroutines (cppcoro?).

C++ has the popular CppCoro library. Async_mutex is its equivalent of Tokio::sync::Mutex, providing exclusive access to data shared between tasks.

Because the whole application is running under a single thread there is no need for atomic operations in synchronization primitives(which most of the time requires seq_cst memory order and CMPXCHG which is an expensive instruction in CPU). for example what async_mutex would look like if it knows it's running in a single-threaded scheduler (a non-atomic state variable and waiters queue).

Maybe not old, but I wish cppcoro was still updated. It was such a nice start!

You can get generator<> from https://github.com/lewissbaker/cppcoro

It is possible to compose them more easily than described in the article; Lewis Baker's cppcoro library for example provides a recursive_generator<> type[0] that allows this without using any macros. It's up to the library part of coroutines to make things easy, end users are not expected to write low-level coroutine code themselves.

I wonder about the allocation elision. Return value optimization became mandatory, and some compilers can already elide calls to new/delete and malloc()/free() in normal code, so perhaps it will be possible to guarantee allocation elision in the future in the most used cases.

[0]: https://github.com/lewissbaker/cppcoro#recursive_generatort