Segmented Iterators and Hierarchical Algorithms

  • Authors:

  • Matthew H. Austern

  • Affiliations:

  • -

  • Venue:
  • Selected Papers from the International Seminar on Generic Programming
  • Year:
  • 1998

Quantified Score

Hi-index 0.00

Visualization

Abstract

Many data structures are naturally segmented. Generic algorithms that ignore that feature, and that treat every data structure as a uniform range of elements, are unnecessarily inefficient. A new kind of iterator abstraction, in which segmentation is explicit, makes it possible to write hierarchical algorithms that exploit segmentation.