Up Next
Go up to Programming Methodology
Go forward to Generic Programming in C++: Matrix Case Study
Krzysztof Czarnecki

Hierarchical Iterators and Algorithms
Matt Austern

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.


Up Next