Neoclassical C++: segmented iterators revisited
Summary
The article revisits segmented iterators and Austern's hierarchical algorithms for C++, explaining the segmented_iterator_traits abstraction and how a three-level approach can optimize algorithms like fill. It provides benchmark results across multiple compilers and data types, showing potential speedups from segmentation and highlighting compiler-dependent behavior and unroll-hint effects.