Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1989 Springer-Verlag New York Inc.
About this chapter
Cite this chapter
Musser, D.R., Stepanov, A.A. (1989). Linear Data Structures. In: The Ada® Generic Library. Springer Compass International. Springer, New York, NY. https://doi.org/10.1007/978-1-4684-7089-5_2
Download citation
DOI: https://doi.org/10.1007/978-1-4684-7089-5_2
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4684-7091-8
Online ISBN: 978-1-4684-7089-5
eBook Packages: Springer Book Archive