Package | Description |
---|---|
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.
|
Modifier and Type | Interface | Description |
---|---|---|
interface |
Deque
A linear collection that supports element insertion and removal at
both ends.
|
Modifier and Type | Class | Description |
---|---|---|
class |
AbstractQueue
This class provides skeletal implementations of some
Queue
operations. |
|
class |
ArrayDeque
Resizable-array implementation of the
Deque interface. |
|
class |
LinkedList
Doubly-linked list implementation of the
List and Deque
interfaces. |
|
class |
PriorityQueue
An unbounded priority queue based on a priority heap.
|
Modifier and Type | Method | Description |
---|---|---|
static |
Collections.asLifoQueue(Deque
|
|
static |
Collections.checkedQueue(Queue
Returns a dynamically typesafe view of the specified queue.
|
Modifier and Type | Method | Description |
---|---|---|
static |
Collections.checkedQueue(Queue
Returns a dynamically typesafe view of the specified queue.
|
Modifier and Type | Interface | Description |
---|---|---|
interface |
BlockingDeque
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
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. |
|
interface |
TransferQueue
A
BlockingQueue in which producers may wait for consumers
to receive elements. |
Modifier and Type | Class | Description |
---|---|---|
class |
ArrayBlockingQueue
A bounded blocking queue backed by an
array.
|
|
class |
ConcurrentLinkedDeque
An unbounded concurrent deque based on linked nodes.
|
|
class |
ConcurrentLinkedQueue
An unbounded thread-safe queue based on linked nodes.
|
|
class |
DelayQueue
An unbounded blocking queue of
Delayed elements, in which an element can only be taken
when its delay has expired. |
|
class |
LinkedBlockingDeque
An optionally-bounded blocking deque based on
linked nodes.
|
|
class |
LinkedBlockingQueue
An optionally-bounded blocking queue based on
linked nodes.
|
|
class |
LinkedTransferQueue
An unbounded
TransferQueue based on linked nodes. |
|
class |
PriorityBlockingQueue
An unbounded blocking queue that uses
the same ordering rules as class
PriorityQueue and supplies
blocking retrieval operations. |
|
class |
SynchronousQueue
A blocking queue in which each insert
operation must wait for a corresponding remove operation by another
thread, and vice versa.
|
Submit a bug or feature
For further API reference and developer documentation, see Java SE Documentation. That documentation contains more detailed, developer-targeted descriptions, with conceptual overviews, definitions of terms, workarounds, and working code examples.
Copyright © 1993, 2025, Oracle and/or its affiliates. All rights reserved. Use is subject to license terms. Also see the documentation redistribution policy.