double-ended queue

In computer science, a deque (short for double-ended queue) is an abstract data structure for which elements can be added to or removed from the front or back. This differs from a normal queue, where elements can only be added to one end and removed from the other. Both queues and stacks can be considered specializations of deques, and can be implemented using deques.
See more at Wikipedia.org...

A queue in which the contents may be changed by adding or removing items at either end.

<algorithm> /dek/ (deque) A queue which can have items added or removed from either end[?].
The Knuth reference below reports that the name was coined by E. J. Schweppe.
[D. E. Knuth, "The Art of Computer Programming. Volume 1: Fundamental Algorithms", second edition, Sections 2.2.1, 2.6, Addison-Wesley, 1973].
Silicon Graphics.
[Correct definition? Example use?]
(2003-12-17)