Spec-Zone .ru спецификации, руководства, описания, API

Uses of Interface
java.util.Queue

Packages that use Queue

java.util	Contains the collections framework, legacy collection classes, event model, date and time facilities, internationalization, and miscellaneous utility classes (a string tokenizer, a random-number generator, and a bit array).
java.util.concurrent	Utility classes commonly useful in concurrent programming.

Uses of Queue in java.util

Subinterfaces of Queue in java.util

interface

Deque<E> A linear collection that supports element insertion and removal at both ends.

Classes in java.util that implement Queue

class	AbstractQueue<E> This class provides skeletal implementations of some Queue operations.
class	ArrayDeque<E> Resizable-array implementation of the Deque interface.
class	LinkedList<E> Linked list implementation of the List interface.
class	PriorityQueue<E> An unbounded priority queue based on a priority heap.

Methods in java.util that return Queue

static <T> Queue<T>

Collections.asLifoQueue(Deque<T> deque) Returns a view of a Deque as a Last-in-first-out (Lifo) Queue.

Uses of Queue in java.util.concurrent

Subinterfaces of Queue in java.util.concurrent

interface	BlockingDeque<E> A Deque 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	BlockingQueue<E> A Queue 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.

Classes in java.util.concurrent that implement Queue

class	ArrayBlockingQueue<E> A bounded blocking queue backed by an array.
class	ConcurrentLinkedQueue<E> An unbounded thread-safe queue based on linked nodes.
class	DelayQueue<E extends Delayed> An unbounded blocking queue of Delayed elements, in which an element can only be taken when its delay has expired.
class	LinkedBlockingDeque<E> An optionally-bounded blocking deque based on linked nodes.
class	LinkedBlockingQueue<E> An optionally-bounded blocking queue based on linked nodes.
class	PriorityBlockingQueue<E> An unbounded blocking queue that uses the same ordering rules as class PriorityQueue and supplies blocking retrieval operations.
class	SynchronousQueue<E> A blocking queue in which each insert operation must wait for a corresponding remove operation by another thread, and vice versa.