New Algorithms in C++23
summary
C++23 adds concrete range factories and adapters like chunk_by and adjacent_transform and the talk demonstrates solving the competitive “Sushi for Two” problem by composing those adapters instead of manual loops, producing a single‑pass, constant memory solution. Examples port Q and Haskell pipelines into C++23 and into Circle’s pipeline placeholder syntax so variadic adapters and reusing intermediate ranges become linear and readable. Code runs on GCC 13 and recent MSVC, the Circle experiments work interactively on Godbolt, and the examples validate the approach.
AI-written summary · about
chapters (14)
- 0:00Introduction
- 1:48Podcasts
- 3:05Overview
- 13:45adjacent
- 15:50enumerate
- 23:40Parallel block the late sequences
- 26:45Warmup
- 29:23For Loops
- 30:25Sushi for Two
- 35:26Q Array Language
- 42:34What is Circle
- 48:11What is Chunk
- 52:40Transform
- 55:01Convenience Functions
related talks
38mWhat's New In C++23
01h 02mC++20 Ranges in Practice
57mRange Algorithms, Views and Actions: A Comprehensive Guide
01h 06mC++20 Ranges in Practice
01h 15mHow to Rangify Your Code
01h 02mC++20 - My Favourite Code Examples
01h 09mRe-Release: Missing (and future?) C++ Range Concepts
01h 09mMissing (and future?) C++ Range Concepts