Many data structures are naturally segmented; generic algorithms that ignore this feature, and that treat segmented data structures as a flat one-dimensional range of elements, are unnecessarily inefficient. Segmented iterators make it possible to write generic algorithms that explicitly make use of segmentation.