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:
“Again we have here two distinctions that are no distinctions, but made to seem so by terms invented by I know not whom to cover ignorance, and blind the understanding of the reader: for it cannot be conceived that there is any liberty greater, than for a man to do what he will.”
—Thomas Hobbes (1579–1688)