public class FloatArrayFIFOQueue extends Object implements FloatPriorityQueue, Serializable
Instances of this class represent a FIFO queue using a backing
array in a circular way. The array is enlarged and shrunk as needed. You can use the trim() method
to reduce its memory usage, if necessary.
This class provides additional methods that implement a deque (double-ended queue).
| Modifier and Type | Field and Description |
|---|---|
protected float[] |
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 and Description |
|---|
FloatArrayFIFOQueue()
Creates a new empty queue with standard initial capacity.
|
FloatArrayFIFOQueue(int capacity)
Creates a new empty queue with given capacity.
|
| Modifier and Type | Method and Description |
|---|---|
void |
clear()
Removes all elements from this queue.
|
FloatComparator |
comparator()
Returns the comparator associated with this priority queue, or null if it uses its elements' natural ordering.
|
float |
dequeueFloat()
Dequeues the first element from the queue.
|
float |
dequeueLastFloat()
Dequeues the last element from the queue.
|
void |
enqueue(float x)
Enqueues a new element.
|
void |
enqueueFirst(float x)
Enqueues a new element as the first element (in dequeuing order) of the queue.
|
float |
firstFloat()
Returns the first element of the queue.
|
float |
lastFloat()
Returns the last element of the queue, that is, the element the would be dequeued last (optional operation).
|
int |
size()
Returns the number of elements in this queue.
|
void |
trim()
Trims the queue to the smallest possible size.
|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, waitdequeue, enqueue, first, lastchanged, isEmptypublic static final int INITIAL_CAPACITY
protected transient float[] array
protected transient int length
array.protected transient int start
protected transient int end
public FloatArrayFIFOQueue(int capacity)
capacity - the initial capacity of this queue.public FloatArrayFIFOQueue()
public FloatComparator comparator()
Note that this specification strengthens the one given in PriorityQueue.comparator().
This implementation returns null (FIFO queues have no comparator).
comparator in interface FloatPriorityQueuecomparator in interface PriorityQueue<Float>PriorityQueue.comparator()public float dequeueFloat()
FloatPriorityQueuedequeueFloat in interface FloatPriorityQueueFloatPriorityQueue.dequeue()public float dequeueLastFloat()
NoSuchElementException - if the queue is empty.public void enqueue(float x)
FloatPriorityQueueenqueue in interface FloatPriorityQueuex - the element to enqueue.PriorityQueue.enqueue(Object)public void enqueueFirst(float x)
x - the element to enqueue.public float firstFloat()
FloatPriorityQueuefirstFloat in interface FloatPriorityQueueFloatPriorityQueue.first()public float lastFloat()
FloatPriorityQueueThis default implementation just throws an UnsupportedOperationException.
lastFloat in interface FloatPriorityQueueFloatPriorityQueue.last()public void clear()
PriorityQueueclear in interface PriorityQueue<Float>public void trim()
public int size()
PriorityQueuesize in interface PriorityQueue<Float>Copyright © 2020. All rights reserved.