Distinctions and Sub-types
This differs from the queue abstract data type or First-In-First-Out List (FIFO), where elements can only be added to one end and removed from the other. This general data class has some possible sub-types:
- An input-restricted deque is one where deletion can be made from both ends, but insertion can be made at one end only.
- An output-restricted deque is one where insertion can be made at both ends, but deletion can be made from one end only.
Both the basic and most common list types in computing, queues and stacks can be considered specializations of deques, and can be implemented using deques.
Read more about this topic: Double-ended Queue
Famous quotes containing the word distinctions:
“Television ... helps blur the distinction between framed and unframed reality. Whereas going to the movies necessarily entails leaving one’s ordinary surroundings, soap operas are in fact spatially inseparable from the rest of one’s life. In homes where television is on most of the time, they are also temporally integrated into one’s “real” life and, unlike the experience of going out in the evening to see a show, may not even interrupt its regular flow.”
—Eviatar Zerubavel, U.S. sociologist, educator. The Fine Line: Making Distinctions in Everyday Life, ch. 5, University of Chicago Press (1991)