|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectit.unimi.dsi.fastutil.AbstractPriorityQueue<Integer>
it.unimi.dsi.fastutil.ints.AbstractIntPriorityQueue
it.unimi.dsi.fastutil.ints.IntArrayFIFOQueue
public class IntArrayFIFOQueue
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 | |
---|---|
protected int[] |
array
The backing array. |
protected int |
end
The end position in array . |
static int |
INITIAL_CAPACITY
The standard initial capacity of a queue. |
protected int |
length
The current (cached) length of array . |
protected int |
start
The start position in array . |
Constructor Summary | |
---|---|
IntArrayFIFOQueue()
Creates a new empty queue with standard initial capacity. |
|
IntArrayFIFOQueue(int capacity)
Creates a new empty queue with given capacity. |
Method Summary | |
---|---|
void |
clear()
Removes all elements from this queue. |
IntComparator |
comparator()
Returns null (FIFO queues have no comparator). |
int |
dequeueInt()
Dequeues the first element from the queue. |
int |
dequeueLastInt()
Dequeues the last element from the queue. |
void |
enqueue(int x)
Enqueues a new element. |
void |
enqueueFirst(int x)
Enqueues a new element as the first element (in dequeuing order) of the queue. |
int |
firstInt()
Returns the first element of the queue. |
int |
lastInt()
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.ints.AbstractIntPriorityQueue |
---|
dequeue, enqueue, first, last |
Methods inherited from class it.unimi.dsi.fastutil.AbstractPriorityQueue |
---|
changed, isEmpty |
Methods inherited from class java.lang.Object |
---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Methods inherited from interface it.unimi.dsi.fastutil.PriorityQueue |
---|
changed, isEmpty |
Field Detail |
---|
public static final int INITIAL_CAPACITY
protected int[] array
protected int length
array
.
protected int start
array
. It is always strictly smaller than length
.
protected int end
array
. It is always strictly smaller than length
.
Might be actually smaller than start
because array
is used cyclically.
Constructor Detail |
---|
public IntArrayFIFOQueue(int capacity)
capacity
- the initial capacity of this queue.public IntArrayFIFOQueue()
Method Detail |
---|
public IntComparator comparator()
null
(FIFO queues have no comparator).
null
.PriorityQueue.comparator()
public int dequeueInt()
IntPriorityQueue
public int dequeueLastInt()
NoSuchElementException
- if the queue is empty.public void enqueue(int x)
IntPriorityQueue
x
- the element to enqueue.public void enqueueFirst(int x)
public int firstInt()
public int lastInt()
lastInt
in interface IntPriorityQueue
lastInt
in class AbstractIntPriorityQueue
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 |