Uses of Interface
java.util.Queue
Packages that useQueue
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 ofQueue injava.util
Modifier and TypeInterfaceDescriptioninterfaceDeque<E>A linear collection that supports element insertion and removal at both ends.Modifier and TypeClassDescriptionclassThis class provides skeletal implementations of someQueueoperations.classArrayDeque<E>Resizable-array implementation of theDequeinterface.classLinkedList<E>Doubly-linked list implementation of theListandDequeinterfaces.classAn unbounded priorityqueue 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 ofQueue injava.util.concurrent
Subinterfaces ofQueue injava.util.concurrentModifier and TypeInterfaceDescriptioninterfaceADequethat 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.interfaceAQueuethat 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.interfaceABlockingQueuein which producers may wait for consumers to receive elements.Classes injava.util.concurrent that implementQueueModifier and TypeClassDescriptionclassA boundedblocking queue backed by an array.classAn unbounded concurrentdeque based on linked nodes.classAn unbounded thread-safequeue based on linked nodes.classDelayQueue<E extendsDelayed>An unboundedblocking queue ofDelayedelements, in which an element generally becomes eligible for removal when its delay has expired.classAn optionally-boundedblocking deque based on linked nodes.classAn optionally-boundedblocking queue based on linked nodes.classAn unboundedTransferQueuebased on linked nodes.classAn unboundedblocking queue that uses the same ordering rules as classPriorityQueueand supplies blocking retrieval operations.classAblocking queue in which each insert operation must wait for a corresponding remove operation by another thread, and vice versa.