Movatterモバイル変換

Uses of Interface
java.util.Queue

• Packages that useQueue 

  Package	Description
  java.util	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.
  java.util.concurrent	Utility classes commonly useful in concurrent programming.

• • Uses ofQueue injava.util

    Subinterfaces ofQueue injava.util 

    Modifier and Type	Interface	Description
    interface	Deque<E>	A linear collection that supports element insertion and removal at both ends.

    Classes injava.util that implementQueue 

    Modifier and Type	Class	Description
    class	AbstractQueue<E>	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	PriorityQueue<E>	An unbounded priorityqueue based on a priority heap.

    Methods injava.util that returnQueue 

    Modifier and Type	Method	Description
    static <T> Queue<T>	Collections.asLifoQueue​(Deque<T> deque)	Returns a view of aDeque as a Last-in-first-out (Lifo)Queue.
    static <E> Queue<E>	Collections.checkedQueue​(Queue<E> queue,Class<E> type)	Returns a dynamically typesafe view of the specified queue.

    Methods injava.util with parameters of typeQueue 

    Modifier and Type	Method	Description
    static <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.concurrent 

    Modifier and Type	Interface	Description
    interface	BlockingDeque<E>	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	BlockingQueue<E>	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	TransferQueue<E>	ABlockingQueue in which producers may wait for consumers to receive elements.

    Classes injava.util.concurrent that implementQueue 

    Modifier and Type	Class	Description
    class	ArrayBlockingQueue<E>	A boundedblocking queue backed by an array.
    class	ConcurrentLinkedDeque<E>	An unbounded concurrentdeque based on linked nodes.
    class	ConcurrentLinkedQueue<E>	An unbounded thread-safequeue based on linked nodes.
    class	DelayQueue<E extendsDelayed>	An unboundedblocking queue ofDelayed elements, in which an element can only be taken when its delay has expired.
    class	LinkedBlockingDeque<E>	An optionally-boundedblocking deque based on linked nodes.
    class	LinkedBlockingQueue<E>	An optionally-boundedblocking queue based on linked nodes.
    class	LinkedTransferQueue<E>	An unboundedTransferQueue based on linked nodes.
    class	PriorityBlockingQueue<E>	An unboundedblocking queue that uses the same ordering rules as classPriorityQueue and supplies blocking retrieval operations.
    class	SynchronousQueue<E>	Ablocking queue in which each insert operation must wait for a corresponding remove operation by another thread, and vice versa.