Abstract
A deque is a linear data structure consisting of finite sequences in which insertions and deletions are permitted only at the ends. Thus stacks and queues can be viewed as special cases of deques that have further restrictions on accesses: a stack prohibits both insertions and deletions at one end, while a queue can only have insertions at one end and only deletions at the other. One of the least restricted cases of a deque is that in which both insertions and deletions are permitted at one end (called the front), but at the other end (the rear) only insertions are allowed; hence it is called output-restricted. This package provides such a data structure, as a representational abstraction.
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). Output Restricted Deques Package. In: The Ada® Generic Library. Springer Compass International. Springer, New York, NY. https://doi.org/10.1007/978-1-4684-7089-5_12
Download citation
DOI: https://doi.org/10.1007/978-1-4684-7089-5_12
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