You are here: irt.org | FOLDOC | double-ended queue
<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://sgi.com/tech/stl/Deque.html).
[Correct definition? Example use?]
(2003-12-17)
Nearby terms: double density « doubled sig « double-duplex « double-ended queue » double quote » doubly linked list » DOUGLAS
FOLDOC, Topics, A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, ?, ALL