BytePriorityQueue
, PriorityQueue<java.lang.Byte>
, java.io.Serializable
public class ByteArrayFIFOQueue extends java.lang.Object implements BytePriorityQueue, java.io.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 | Description |
---|---|---|
static int |
INITIAL_CAPACITY |
The standard initial capacity of a queue.
|
Constructor | Description |
---|---|
ByteArrayFIFOQueue() |
Creates a new empty queue with standard initial
capacity.
|
ByteArrayFIFOQueue(int capacity) |
Creates a new empty queue with given capacity.
|
Modifier and Type | Method | Description |
---|---|---|
void |
clear() |
Removes all elements from this queue.
|
ByteComparator |
comparator() |
Returns the comparator associated with this priority queue, or null if it
uses its elements' natural ordering.
|
byte |
dequeueByte() |
Dequeues the first element from the queue.
|
byte |
dequeueLastByte() |
Dequeues the last element from the queue.
|
void |
enqueue(byte x) |
Enqueues a new element.
|
void |
enqueueFirst(byte x) |
Enqueues a new element as the first element (in dequeuing order) of the
queue.
|
byte |
firstByte() |
Returns the first element of the queue.
|
byte |
lastByte() |
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.
|
dequeue, enqueue, first, last
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
changed, isEmpty
public static final int INITIAL_CAPACITY
public ByteArrayFIFOQueue(int capacity)
capacity
- the initial capacity of this queue.public ByteArrayFIFOQueue()
public ByteComparator comparator()
Note that this specification strengthens the one given in
PriorityQueue.comparator()
.
This implementation returns null
(FIFO queues have no comparator).
comparator
in interface BytePriorityQueue
comparator
in interface PriorityQueue<java.lang.Byte>
PriorityQueue.comparator()
public byte dequeueByte()
BytePriorityQueue
dequeueByte
in interface BytePriorityQueue
BytePriorityQueue.dequeue()
public byte dequeueLastByte()
java.util.NoSuchElementException
- if the queue is empty.public void enqueue(byte x)
BytePriorityQueue
enqueue
in interface BytePriorityQueue
x
- the element to enqueue.PriorityQueue.enqueue(Object)
public void enqueueFirst(byte x)
x
- the element to enqueue.public byte firstByte()
BytePriorityQueue
firstByte
in interface BytePriorityQueue
BytePriorityQueue.first()
public byte lastByte()
BytePriorityQueue
This default implementation just throws an
UnsupportedOperationException
.
lastByte
in interface BytePriorityQueue
BytePriorityQueue.last()
public void clear()
PriorityQueue
clear
in interface PriorityQueue<java.lang.Byte>
public void trim()
public int size()
PriorityQueue
size
in interface PriorityQueue<java.lang.Byte>