Uses of Interface
java.util.Queue
Package
Description
Contains the collections framework, some internationalization support classes,
a service loader, properties, random number generation, string parsing
and scanning classes, base64 encoding and decoding, a bit array, and
several miscellaneous utility classes.
Utility classes commonly useful in concurrent programming.
-
Uses of Queue in java.util
Modifier and TypeInterfaceDescriptioninterface
Deque<E>
A linear collection that supports element insertion and removal at both ends.Modifier and TypeClassDescriptionclass
This class provides skeletal implementations of someQueue
operations.class
ArrayDeque<E>
Resizable-array implementation of theDeque
interface.class
LinkedList<E>
Doubly-linked list implementation of theList
andDeque
interfaces.class
An unbounded priority queue based on a priority heap.Modifier and TypeMethodDescriptionstatic <T> Queue<T>
Collections.asLifoQueue
(Deque<T> deque) static <E> Queue<E>
Collections.checkedQueue
(Queue<E> queue, Class<E> type) Returns a dynamically typesafe view of the specified queue.Modifier and TypeMethodDescriptionstatic <E> Queue<E>
Collections.checkedQueue
(Queue<E> queue, Class<E> type) Returns a dynamically typesafe view of the specified queue. -
Uses of Queue in java.util.concurrent
Modifier and TypeInterfaceDescriptioninterface
ADeque
that additionally supports blocking operations that wait for the deque to become non-empty when retrieving an element, and wait for space to become available in the deque when storing an element.interface
AQueue
that additionally supports operations that wait for the queue to become non-empty when retrieving an element, and wait for space to become available in the queue when storing an element.interface
ABlockingQueue
in which producers may wait for consumers to receive elements.Modifier and TypeClassDescriptionclass
A bounded blocking queue backed by an array.class
An unbounded concurrent deque based on linked nodes.class
An unbounded thread-safe queue based on linked nodes.class
DelayQueue<E extends Delayed>
An unbounded blocking queue ofDelayed
elements, in which an element can only be taken when its delay has expired.class
An optionally-bounded blocking deque based on linked nodes.class
An optionally-bounded blocking queue based on linked nodes.class
An unboundedTransferQueue
based on linked nodes.class
An unbounded blocking queue that uses the same ordering rules as classPriorityQueue
and supplies blocking retrieval operations.class
A blocking queue in which each insert operation must wait for a corresponding remove operation by another thread, and vice versa.