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:
“...I have come to make distinctions between what I call the academy and literature, the moral equivalents of church and God. The academy may lie, but literature tries to tell the truth.”
—Dorothy Allison (b. 1949)