| Package | Description |
|---|---|
| java.util |
| Modifier and Type | Interface and Description |
|---|---|
interface |
Deque<E>
A kind of collection that can insert or remove element at both ends("double
ended queue").
|
| Modifier and Type | Class and Description |
|---|---|
class |
AbstractQueue<E>
AbstractQueue is an abstract class which implements some of the methods in
Queue. |
class |
ArrayDeque<E>
An implementation of Deque, backed by an array.
|
class |
LinkedList<E>
LinkedList is an implementation of List, backed by a linked list.
|
class |
PriorityQueue<E>
A PriorityQueue holds elements on a priority heap, which orders the elements
according to their natural order or according to the comparator specified at
construction time.
|
| Modifier and Type | Method and Description |
|---|---|
static <T> Queue<T> |
Collections.asLifoQueue(Deque<T> deque)
Answers a LIFO Queue as a view of a Deque.
|
Copyright © 2026. All rights reserved.