From Iterators to Ranges - The Upcoming Evolution of the Standard Library

This talk explores the design and implementation of C++20 ranges, from iterator safety and adaptors to generator ranges. It also covers efficient formatting into containers and reserving capacity.

Syllabus

Intro
Ranges in C++20
Why do I think I know something about ranges? think-cell
What are Ranges?
Transform Adaptor (2)
Transform Adaptor Implementation
Filter Adaptor Implementation
More Efficient Range Adaptors: Iterator Safety think-cell
Again: How does iterator look like of
Index-Iterator Compatibility
Super-Efficient Range Adaptors With Indices
More Flexible Algorithm Returns (3)
External iteration (2)
Coroutines (2)
Internal Iteration often good enough
Interruptable Generator Ranges (2)
concat implementation with indices (2)
concat implementation as generator range
Format Strings
Formatting Into Containers (1)
Fast Formatting Into Containers
Better reserve