Neoclassical C++ (2): Exploring input-output segmented algorithms

From one segmented range to two In the first installment of this series we revisited Matt Austern s Segmented Iterators and Hierarchical Algorithms paper and measured what a modern compiler can do when a single-range, single-pass algorithm (find, fill, count, for_each, ) is decomposed into per-segment flat loops. The results were encouraging: once the per-element block-boundary [ ]