Linear Data Structures

  • David R. Musser
  • Alexander A. Stepanov
Part of the Springer Compass International book series (COMPASS)


The first phase of the Ada Generic Library, Linear Data Structures, can be described in terms of the different data structures that are implemented or planned, most of which are relatively simple and familiar structures such as linked lists, vectors (one dimensional arrays), stacks, queues, deques, etc. However, a highly unifying way to organize one’s understanding of these structures and the algorithms associated with them is in terms of the mathematical notion of (finite) sequences. A future version may include a Sequences package of generic algorithms, but for now we discuss sequences just as a way of understanding many aspects of linked-list and vector representations.


Mutative Operation Access Type Linked List Package Body Package Description 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag New York Inc. 1989

Authors and Affiliations

  • David R. Musser
    • 1
  • Alexander A. Stepanov
    • 2
  1. 1.Computer Science DepartmentRensselaer Polytechnic InstituteTroyUSA
  2. 2.Software Technology LaboratoryHewlett-Packard LaboratoriesPalo AltoUSA

Personalised recommendations