Skip to main content
SpringerLink
Log in

Segmented Iterators and Hierarchical Algorithms

  • Conference paper
  • First Online:
Generic Programming

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1766))

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. A. Stepanov and M. Lee, “The Standard Template Library.” Hewlett-Packard technical report HPL-95-11(R.1), 1995.

    Google Scholar 

  2. D. R. Musser and A. Saini, STL Tutorial and Reference Guide: C++ Programming with the Standard Template Library. Addison-Wesley, 1996.

    Google Scholar 

  3. M. H. Austern, Generic Programming and the STL: Using and Extending the C++ Standard Template Library. Addison-Wesley, 1998.

    Google Scholar 

  4. B. Stroustrup, The C++ Programming Language, Third Edition. Addison-Wesley, 1997.

    Google Scholar 

  5. International Organization for Standardization (ISO), 1 rue de Varembé, Case postale 56, CH-1211 Genève 20, Switzerland, ISO/IEC Final Draft International Standard 14882: Programming Language C++, 1998.

    Google Scholar 

  6. J. Barreiro, R. Fraley, and D. R. Musser, “Hash tables for the Standard Template Library.” Technical Report X3J16/94-0218 and WG21/N0605, International Organization for Standardization, February 1995.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Silicon Graphics Computer Systems, USA

    Matthew H. Austern

Authors
  1. Matthew H. Austern
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Information Systems Institute, Distributed Systems Group, Technical University of Vienna, Argentinierstr. 8/184-1, 1040, Vienna, Austria

    Mehdi Jazayeri

  2. Wilhelm-Schickard-Institut für Informatik, Universität Tübingen, Sand 13, 72076, Tübingen, Germany

    Rüdiger G. K. Loos

  3. Computer Science Department, Rensellaer Polytechnic Institute, Troy, NY, 12180-3590, USA

    David R. Musser

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Austern, M.H. (2000). Segmented Iterators and Hierarchical Algorithms. In: Jazayeri, M., Loos, R.G.K., Musser, D.R. (eds) Generic Programming. Lecture Notes in Computer Science, vol 1766. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39953-4_7

Download citation

  • DOI: https://doi.org/10.1007/3-540-39953-4_7

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41090-4

  • Online ISBN: 978-3-540-39953-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation