C++20 Ranges in Practice
summary
C++20 Ranges are shown in practical code: replacing iterator pairs with whole-range calls, automatic lifetime protection via ranges::dangling for rvalue ranges, and converting rvalue containers into views with views::all / owning views so piping a temporary into adapters works. The talk builds a range-based accumulate (with projections) to compute sum of squares in one pass and composes views::transform plus reverse/drop-while adapters into a reusable trim adapter, using a ranges-next polyfill for robust string construction — all examples compile and run.
AI-written summary · about
chapters (5)
- 0:00Introduction and welcome
- 1:51Problem one: minimum element
- 24:28Problem two: sum of squares
- 46:20Problem three: string trimming
- 1:01:30Q&A and closing
related talks
01h 06mC++20 Ranges in Practice
01h 01mFrom STL to Ranges: Using Ranges Effectively
01h 01mAn Overview of Standard Ranges
01h 15mHow to Rangify Your Code
01h 09mMissing (and future?) C++ Range Concepts
01h 34mAn Overview of Standard Ranges
57mRange Algorithms, Views and Actions: A Comprehensive Guide
01h 25mC++23 Ranges: Conceptual Changes and Useful Practicalities