Uses of Class java.util.AbstractQueue (Java 2 Platform SE 5.0) - JDK 5 Documentation v1.5.0, Java 2 SDK 英文文档

Overview

Package

Class

Use

Tree

Deprecated

Index

Help

Java^TM 2 Platform
Standard Ed. 5.0

PREV NEXT

FRAMES NO FRAMES

Uses of Class
java.util.AbstractQueue

Packages that use AbstractQueue
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 AbstractQueue in java.util

Subclasses of AbstractQueue in java.util

class PriorityQueue<E>
An unbounded priority queue based on a priority heap.

Subclasses of AbstractQueue in java.util
`class`	`PriorityQueue<E>` An unbounded priority queue based on a priority heap.

Uses of AbstractQueue in java.util.concurrent

Subclasses of AbstractQueue in java.util.concurrent

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 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 put must wait for a take, and vice versa.

Subclasses of AbstractQueue in java.util.concurrent
`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`	`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 `put` must wait for a `take`, and vice versa.