Abstract
This package provides one of the simplest of linear data structures, in which insertions and deletions of data are restricted to one end. Its name suggests the most appropriate model for understanding its behavior: a stack of papers on a desk, which can only be changed by placing a sheet of paper on top or by removing one from the top, and the one on top is the only one whose information can be examined. Another frequently used term for a stack discipline is “Last-In First-Out” (LIFO).
This is a preview of subscription content, log in via an institution to check access.
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). Stacks Package. In: The Ada® Generic Library. Springer Compass International. Springer, New York, NY. https://doi.org/10.1007/978-1-4684-7089-5_11
Download citation
DOI: https://doi.org/10.1007/978-1-4684-7089-5_11
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