<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 (http://www.sgi.com/tech/stl/Deque.html).
|< Previous Terms||Terms Containing double-ended queue||Next Terms >|
|Double Data Rate Synchronous Random Access Memory
doubly linked list