Best of think-cell's Range Library
summary
Range objects measure 16 bytes for a simple transform and still keep 16‑byte iterators even after adding a filter while the range grows to 24 bytes; chaining more views does not inflate iterator size. The library detects rvalue temporaries and stores temporaries inside the range instead of leaving dangling references, so a returned view can own the original vector. It also provides generator ranges that push values into a sink and a single inplace sort+unique algorithm born from 20 uses, 18 buggy.
AI-written summary · about
related talks
01h 09mMissing (and future?) C++ Range Concepts
01h 13mFrom Iterators to Ranges — the Upcoming Evolution of the Standard Library
01h 02mC++20 Ranges in Practice
01h 01mAn Overview of Standard Ranges
01h 09mRe-Release: Missing (and future?) C++ Range Concepts
01h 06mC++20 Ranges in Practice
01h 36mC++ Standard Views
57mRange Algorithms, Views and Actions: A Comprehensive Guide