double-ended queue , także: deque

Constructs a double-ended queue with n elements, each initialized to a.

A dequeue or double-ended queue allows items to be entered and served at either end.

Constructs a double-ended queue by copying all elements of deq.

Mentions that the sequential implementation of a double-ended queue is a first year undergraduate programming problem.

Provides the container class template , a double-ended queue.

Each of the processors has a double-ended queue (deque) of threads.

Deque creates a double-ended queue.

An abbreviation for double-ended queue (more commonly, deque)

Therefore, when implementing these techniques, Q is no longer a first-in, first-out queue, but rather a normal doubly linked list or double-ended queue.

Deque Conjecture: Let be a sequence of double-ended queue operations (push, pop, inject, eject).

Queues may be implemented as a separate data type, or may be considered a special case of a double-ended queue (deque) and not implemented separately.

Double-ended queue (deque)

Constructs a double-ended queue by copying elements from the array of Ts pointed to by first, up to, but not including, the element pointed to by last.

To store a dynamic set of elements, this structure consists of a series of Red-black trees, or other Self-balancing binary search trees , and a series of deques (Double-ended queues) , where .

He reported that it could double the number of cache misses, but that its performance with double-ended queues was significantly better and should be retained for template libraries, in part because the gain in other cases from doing the sorts immediately was not great.