|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectit.unimi.dsi.fastutil.AbstractPriorityQueue<K>
it.unimi.dsi.fastutil.objects.ObjectArrayFIFOQueue<K>
public class ObjectArrayFIFOQueue<K>
A type-specific array-based FIFO queue, supporting also deque operations.
Instances of this class represent a FIFO queue using a backing
array in a circular way. The array is enlarged as needed, but it is never shrunk. Use the trim()
method
to reduce its size, if necessary.
This class provides additional methods that implement a deque (double-ended queue).
Field Summary | |
---|---|
static int |
INITIAL_CAPACITY
The standard initial capacity of a queue. |
Constructor Summary | |
---|---|
ObjectArrayFIFOQueue()
Creates a new empty queue with standard initial capacity. |
|
ObjectArrayFIFOQueue(int capacity)
Creates a new empty queue with given capacity. |
Method Summary | |
---|---|
void |
clear()
Removes all elements from this queue. |
Comparator<? super K> |
comparator()
Returns null (FIFO queues have no comparator). |
K |
dequeue()
Dequeues the first element from the queue. |
K |
dequeueLast()
Dequeues the last element from the queue. |
void |
enqueue(K x)
Enqueues a new element. |
void |
enqueueFirst(K x)
Enqueues a new element as the first element (in dequeuing order) of the queue. |
K |
first()
Returns the first element of the queue. |
K |
last()
Returns the last element of the queue. |
int |
size()
Returns the number of elements in this queue. |
void |
trim()
Trims the queue to the smallest possible size. |
Methods inherited from class it.unimi.dsi.fastutil.AbstractPriorityQueue |
---|
changed, isEmpty |
Methods inherited from class java.lang.Object |
---|
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Field Detail |
---|
public static final int INITIAL_CAPACITY
Constructor Detail |
---|
public ObjectArrayFIFOQueue(int capacity)
capacity
- the initial capacity of this queue.public ObjectArrayFIFOQueue()
Method Detail |
---|
public Comparator<? super K> comparator()
null
(FIFO queues have no comparator).
null
.public K dequeue()
PriorityQueue
public K dequeueLast()
NoSuchElementException
- if the queue is empty.public void enqueue(K x)
PriorityQueue
x
- the element to enqueue..public void enqueueFirst(K x)
public K first()
public K last()
last
in interface PriorityQueue<K>
last
in class AbstractPriorityQueue<K>
public void clear()
PriorityQueue
public void trim()
public int size()
PriorityQueue
|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |