double-ended queue


Also found in: Acronyms, Wikipedia.

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.

This article is provided by FOLDOC - Free Online Dictionary of Computing (foldoc.org)
Mentioned in ?
References in periodicals archive ?
An optimal RAM implementation of catenable min double-ended queues. In Proceedings of the 5th ACM.
Catenable double-ended queues. In Proceedings of the ACM SIGPLAN International Conference on Functional Programming.