Async sequences and algorithms to compose them
summary
Argues that values arriving over time need the same algorithm set as STL ranges and shows a concrete C++ implementation using RX CPP, adapters for openFrameworks and a JS-compiled demo that follows the mouse, plus an image-download demo that groups work across eight threads with 200 ms intervals and different scheduling policies. Explains schedulers, coordinators, subscribe/on_next/on_error/on_completed semantics, and fast unit testing via virtual time tests that record marble-style messages so time-dependent algorithms run instantly.
AI-written summary · about
chapters (12)
- 0:00Start
- 0:19ASYNC SEQUENCES AND ALGORITHMS
- 5:26DESCRIBING SEQUENCES IN TIME
- 6:38VALUE SEQUENCE DIAGRAM
- 7:07VALUE GENERATOR DIAGRAM
- 11:21COMBINE TIME AND MOVEMENT
- 21:13FACTORY OBSERVABLE
- 23:26INSTANCE OBSERVABLE
- 28:33TIMEINPERIODFROMMILLISECONDS TEST
- 31:08CATCH LIBRARY TEST CASE
- 33:55THREADED HTTP GET REQUESTS
- 36:22CREATE CANCELLABLE REQUEST WITH RETRY
related talks
01h 04mA Pattern Language for Expressing Concurrency in Cpp
27mDeep diving on Concurrent React
25mAsynchrony: Under the Hood
01h 00mMissing (and future?) C++ range concepts
55mC++ Concurrency TS 2 Use Cases and Future Direction
01h 00mBack to Basics: (Range) Algorithms in C++
30mCracking the Concurrent Mode
35mThe Multi-Threaded Asynchronous Parallel World of Swift