Overview
This package creates a data type called Del and provides 47 subprograms for manipulating values of this type. Basically Dels are finite sequences and the operations provided are similar to to those of Singly Linked Lists (Chapter 6), but some operations such as concatenation are more efficient (constant time rather than linear in the length of the arguments). In addition, more security against certain kinds of semantic errors is provided, since the package user does not have direct access to pointer values. For example, with Singly Linked Lists it is possible using the Set Next operation to create a circular list, causing other operations to loop indefinitely, but this is not possible with Dels.
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). Double Ended Lists Package. In: The Ada® Generic Library. Springer Compass International. Springer, New York, NY. https://doi.org/10.1007/978-1-4684-7089-5_10
Download citation
DOI: https://doi.org/10.1007/978-1-4684-7089-5_10
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