{"id":6109,"date":"2021-03-07T11:14:20","date_gmt":"2021-03-07T11:14:20","guid":{"rendered":"https:\/\/www.modernescpp.com\/index.php\/a-generic-data-stream-with-coroutines-in-c-20\/"},"modified":"2023-09-28T06:58:05","modified_gmt":"2023-09-28T06:58:05","slug":"a-generic-data-stream-with-coroutines-in-c-20","status":"publish","type":"post","link":"https:\/\/www.modernescpp.com\/index.php\/a-generic-data-stream-with-coroutines-in-c-20\/","title":{"rendered":"A Generic Data Stream with Coroutines in C++20"},"content":{"rendered":"

In my last post in this mini-series on coroutines from the practical perspective, I presented the workflow of “An Infinite Data Stream with Coroutines in C++20<\/a>“. In this post, I use the generic potential of the data stream.<\/p>\n

<\/p>\n

\"\"<\/p>\n

This post assumes that you know the previous post, “An Infinite Data Stream with Coroutines in C++20<\/a>“, in which I explained very detailed the workflow of an infinite generator based on the new keyword co_yield<\/code> So far, I have written about the new keywords co_return<\/code>, and co_yield, <\/code>which makes out of a function a coroutine. In the next post, I will have a closer look at the most challenging new keyword co_await<\/code>.<\/p>\n

co_return<\/code>:<\/p>\n