More Ranges Please

on YouTube ↗01h 03m

" summary

Argues that C++20/23 ranges need concrete, lazy algorithms: implements ideas for a merge view and variadic/multiway merges (O(s log p) with a heap) instead of eagerly sorting sp cells, shows nth_element cuts work vs full sort, and proposes a histogram built by chunk+transform and an permutation concept* (order) that computes indices instead of swapping to avoid expensive moves and enable lazy, thread‑friendly reordering; prototypes live in ranges‑v3 and an attempted Boost implementation and map to C++26 roadmap and D language precedents.

AI-written summary · about

" chapters (14)

1. 0:00Introduction and speaker background
2. 1:57Ranges library as a breakthrough
3. 8:55Evolution of ranges in C++20 and C++23
4. 10:41Factories and rank-preserving adapters
5. 15:39Rank-preserving adapters with conversions
6. 19:31Rank-decreasing adapters
7. 23:24Lazy evaluation in ranges
8. 24:50What makes a good library
9. 33:01Writing your own libraries
10. 39:23How to write libraries effectively
11. 44:02Catching rabbits: Hunt method example
12. 51:08Proposal for merge and sorted range adapters
13. 57:55Breaking apart sort and permutations
14. 1:00:29Summary and call to action