Is std::ranges the best way to compose operations on ranges?
What if instead of basing composition on a generalization of ＜iterator＞, we instead based composition on a generalization of ＜algorithm＞?
What if there was a library that was open source and constexpr, and based on the experience of using this approach for years in production?
Come and learn about SPL - a new open source library that allows you to compose algorithms.
We will look at some of the issues C++ developers have noticed with std::ranges when used for algorithm composition.
Next, we will examine engineering tradeoffs where we can trade the flexibility of std::ranges for improved memory safety and composability.
This talk will focus on practical uses of this composability such as zipping multiple streams of data, aggregations, and monadic error handling.
Finally, we will delve into the implementation of SPL and discuss how it can be extended.
View Slides
Loves working with C++. T-Rex Trainer