Package it.unimi.dsi.fastutil.shorts
Class ShortArrayFIFOQueue
java.lang.Object
it.unimi.dsi.fastutil.shorts.ShortArrayFIFOQueue
- All Implemented Interfaces:
PriorityQueue<Short>
,ShortPriorityQueue
,Serializable
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 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).
- See Also:
-
Field Summary
Modifier and TypeFieldDescriptionstatic final int
The standard initial capacity of a queue. -
Constructor Summary
ConstructorDescriptionCreates a new empty queue with standard initial capacity.ShortArrayFIFOQueue
(int capacity) Creates a new empty queue with given capacity. -
Method Summary
Modifier and TypeMethodDescriptionvoid
clear()
Removes all elements from this queue.Returns the comparator associated with this priority queue, or null if it uses its elements' natural ordering.short
Dequeues the last element from the queue.short
Dequeues the first element from the queue.void
enqueue
(short x) Enqueues a new element.void
enqueueFirst
(short x) Enqueues a new element as the first element (in dequeuing order) of the queue.short
Returns the first element of the queue.short
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.Methods inherited from class java.lang.Object
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
Methods inherited from interface it.unimi.dsi.fastutil.PriorityQueue
changed, isEmpty
Methods inherited from interface it.unimi.dsi.fastutil.shorts.ShortPriorityQueue
dequeue, enqueue, first, last
-
Field Details
-
INITIAL_CAPACITY
public static final int INITIAL_CAPACITYThe standard initial capacity of a queue.- See Also:
-
-
Constructor Details
-
ShortArrayFIFOQueue
public ShortArrayFIFOQueue(int capacity) Creates a new empty queue with given capacity.- Parameters:
capacity
- the initial capacity of this queue.- Implementation Notes:
- Because of inner limitations of the JVM, the initial capacity cannot exceed
Arrays.MAX_ARRAY_SIZE
− 1.
-
ShortArrayFIFOQueue
public ShortArrayFIFOQueue()Creates a new empty queue with standard initial capacity.
-
-
Method Details
-
comparator
Returns the comparator associated with this priority queue, or null if it uses its elements' natural ordering.- Specified by:
comparator
in interfacePriorityQueue<Short>
- Specified by:
comparator
in interfaceShortPriorityQueue
- Returns:
- the comparator associated with this priority queue.
- See Also:
- Implementation Specification:
- This implementation returns
null
(FIFO queues have no comparator).
-
dequeueShort
public short dequeueShort()Description copied from interface:ShortPriorityQueue
Dequeues the first element from the queue.- Specified by:
dequeueShort
in interfaceShortPriorityQueue
- Returns:
- the dequeued element.
- See Also:
-
dequeueLastShort
public short dequeueLastShort()Dequeues the last element from the queue.- Returns:
- the dequeued element.
- Throws:
NoSuchElementException
- if the queue is empty.
-
enqueue
public void enqueue(short x) Description copied from interface:ShortPriorityQueue
Enqueues a new element.- Specified by:
enqueue
in interfaceShortPriorityQueue
- Parameters:
x
- the element to enqueue.- See Also:
-
enqueueFirst
public void enqueueFirst(short x) Enqueues a new element as the first element (in dequeuing order) of the queue.- Parameters:
x
- the element to enqueue.
-
firstShort
public short firstShort()Description copied from interface:ShortPriorityQueue
Returns the first element of the queue.- Specified by:
firstShort
in interfaceShortPriorityQueue
- Returns:
- the first element.
- See Also:
-
lastShort
public short lastShort()Description copied from interface:ShortPriorityQueue
Returns the last element of the queue, that is, the element the would be dequeued last (optional operation).This default implementation just throws an
UnsupportedOperationException
.- Specified by:
lastShort
in interfaceShortPriorityQueue
- Returns:
- the last element.
- See Also:
-
clear
public void clear()Description copied from interface:PriorityQueue
Removes all elements from this queue.- Specified by:
clear
in interfacePriorityQueue<Short>
-
trim
public void trim()Trims the queue to the smallest possible size. -
size
public int size()Description copied from interface:PriorityQueue
Returns the number of elements in this queue.- Specified by:
size
in interfacePriorityQueue<Short>
- Returns:
- the number of elements in this queue.
-