QUEUE

A collection designed for holding elements before processing.
Besides basic Collection operations, queues provide additional insertion,
extraction, and inspection operations.

A Queue with operations that wait for the queue to become nonempty
when retrieving an element and that wait for space to become available
in the queue when storing an element.

A double ended queue, supporting element insertion and removal at both ends.
Extends the Queue interface.

A Deque with operations that wait for the deque to become nonempty
when retrieving an element and wait for space to become available
in the deque when storing an element.
Extends both the Deque and BlockingQueue interfaces.

Skeletal Queue implementation.

An optionally bounded FIFO blocking deque backed by linked nodes.

A bounded FIFO blocking queue backed by an array.

A time-based scheduling queue backed by a priority heap.

An optionally bounded FIFO blocking queue backed by linked nodes.

An unbounded blocking priority queue backed by a priority heap.

Heap implementation of an unbounded priority queue.

A simple rendezvous mechanism
that uses the BlockingQueue interface.

Efficient, resizable array implementation of the Deque interface.

An unbounded first in, first out (FIFO) queue based on linked nodes.

A BlockingQueue in which producers can
wait for consumers to receive elements.

An unbounded TransferQueue backed by linked nodes.

Implementing this interface allows an object
to be the target of the "foreach" statement.

A group of objects.
No assumptions are made about the order of the collection (if any)
or whether it can contain duplicate elements.

Skeletal Collection implementation that is
neither a set nor a list (such as a "bag" or multiset).

Concurrent

extends

extends

implements

extends

extends

extends

extends

implements

extends

implements

extends

extends

implements

extends

implements

extends

implements

extends

implements

extends

implements

implements

extends

extends

extends

implements