Awaiting for the ranges: C++17
summary
C++17 ranges claim to turn pipeline code into composable, lazy evaluation views that avoid intermediate allocations and let you express operations like zip + transform instead of manual loops and temporary vectors. Range V3 examples show infinite ranges, filter/transform/take semantics, and that sorting requires eager materialization. Coroutines and futures map to the same monadic idea so reactive stream demos glue mouse move events into streamed transformations that actually run and update rectangles in real time.
AI-written summary · about
chapters (17)
- 0:00Start
- 1:22Disclaimer
- 5:28Haskell
- 6:59Consider using ranges
- 15:39Consider using lambdas, but not at all cost
- 16:38Consider writing functions manually
- 18:09Item 5: Not really an item
- 22:26Don't wait, await
- 25:16Don't abuse await
- 26:06Optionally abuse await
- 27:16Abuse await to look as cool as Gor
- 28:41Two sides of the same coin?
- 29:26Remember monads?
- 31:53Optional, or anything else
- 38:23Stream transformation
- 40:26Comparison, again
- 40:41Answers? Questions! Questions? Answers!
