Class ByteHeapPriorityQueue
- All Implemented Interfaces:
BytePriorityQueue
,PriorityQueue<Byte>
,Serializable
Instances of this class represent a priority queue using a heap. The heap is enlarged as needed,
but it is never shrunk. Use the trim()
method to reduce its size, if necessary.
- See Also:
-
Constructor Summary
ConstructorDescriptionCreates a new empty queue using the natural order.ByteHeapPriorityQueue
(byte[] a) Wraps a given array in a queue using the natural order.ByteHeapPriorityQueue
(byte[] a, int size) Wraps a given array in a queue using the natural order.ByteHeapPriorityQueue
(byte[] a, int size, ByteComparator c) Wraps a given array in a queue using a given comparator.ByteHeapPriorityQueue
(byte[] a, ByteComparator c) Wraps a given array in a queue using a given comparator.ByteHeapPriorityQueue
(int capacity) Creates a new empty queue with a given capacity and using the natural order.ByteHeapPriorityQueue
(int capacity, ByteComparator c) Creates a new empty queue with a given capacity and comparator.ByteHeapPriorityQueue
(ByteCollection collection) Creates a queue using the elements in a type-specific collection using the natural order.ByteHeapPriorityQueue
(ByteCollection collection, ByteComparator c) Creates a queue using the elements in a type-specific collection using a given comparator.Creates a new empty queue with a given comparator.ByteHeapPriorityQueue
(Collection<? extends Byte> collection) Creates a queue using the elements in a collection using the natural order.ByteHeapPriorityQueue
(Collection<? extends Byte> collection, ByteComparator c) Creates a queue using the elements in a collection using a given comparator. -
Method Summary
Modifier and TypeMethodDescriptionvoid
changed()
Notifies the queue that the first element has changed (optional operation).void
clear()
Removes all elements from this queue.Returns the comparator associated with this priority queue, or null if it uses its elements' natural ordering.byte
Dequeues the first element from the queue.void
enqueue
(byte x) Enqueues a new element.byte
Returns the first element of the queue.int
size()
Returns the number of elements in this queue.void
trim()
Trims the underlying heap array so that it has exactlysize()
elements.Methods inherited from class java.lang.Object
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
Methods inherited from interface it.unimi.dsi.fastutil.bytes.BytePriorityQueue
dequeue, enqueue, first, last, lastByte
Methods inherited from interface it.unimi.dsi.fastutil.PriorityQueue
isEmpty
-
Constructor Details
-
ByteHeapPriorityQueue
Creates a new empty queue with a given capacity and comparator.- Parameters:
capacity
- the initial capacity of this queue.c
- the comparator used in this queue, ornull
for the natural order.
-
ByteHeapPriorityQueue
public ByteHeapPriorityQueue(int capacity) Creates a new empty queue with a given capacity and using the natural order.- Parameters:
capacity
- the initial capacity of this queue.
-
ByteHeapPriorityQueue
Creates a new empty queue with a given comparator.- Parameters:
c
- the comparator used in this queue, ornull
for the natural order.
-
ByteHeapPriorityQueue
public ByteHeapPriorityQueue()Creates a new empty queue using the natural order. -
ByteHeapPriorityQueue
Wraps a given array in a queue using a given comparator.The queue returned by this method will be backed by the given array. The first
size
element of the array will be rearranged so to form a heap (this is more efficient than enqueing the elements ofa
one by one).- Parameters:
a
- an array.size
- the number of elements to be included in the queue.c
- the comparator used in this queue, ornull
for the natural order.
-
ByteHeapPriorityQueue
Wraps a given array in a queue using a given comparator.The queue returned by this method will be backed by the given array. The elements of the array will be rearranged so to form a heap (this is more efficient than enqueing the elements of
a
one by one).- Parameters:
a
- an array.c
- the comparator used in this queue, ornull
for the natural order.
-
ByteHeapPriorityQueue
public ByteHeapPriorityQueue(byte[] a, int size) Wraps a given array in a queue using the natural order.The queue returned by this method will be backed by the given array. The first
size
element of the array will be rearranged so to form a heap (this is more efficient than enqueing the elements ofa
one by one).- Parameters:
a
- an array.size
- the number of elements to be included in the queue.
-
ByteHeapPriorityQueue
public ByteHeapPriorityQueue(byte[] a) Wraps a given array in a queue using the natural order.The queue returned by this method will be backed by the given array. The elements of the array will be rearranged so to form a heap (this is more efficient than enqueing the elements of
a
one by one).- Parameters:
a
- an array.
-
ByteHeapPriorityQueue
Creates a queue using the elements in a type-specific collection using a given comparator.This constructor is more efficient than enqueing the elements of
collection
one by one.- Parameters:
collection
- a collection; its elements will be used to initialize the queue.c
- the comparator used in this queue, ornull
for the natural order.
-
ByteHeapPriorityQueue
Creates a queue using the elements in a type-specific collection using the natural order.This constructor is more efficient than enqueing the elements of
collection
one by one.- Parameters:
collection
- a collection; its elements will be used to initialize the queue.
-
ByteHeapPriorityQueue
Creates a queue using the elements in a collection using a given comparator.This constructor is more efficient than enqueing the elements of
collection
one by one.- Parameters:
collection
- a collection; its elements will be used to initialize the queue.c
- the comparator used in this queue, ornull
for the natural order.
-
ByteHeapPriorityQueue
Creates a queue using the elements in a collection using the natural order.This constructor is more efficient than enqueing the elements of
collection
one by one.- Parameters:
collection
- a collection; its elements will be used to initialize the queue.
-
-
Method Details
-
enqueue
public void enqueue(byte x) Description copied from interface:BytePriorityQueue
Enqueues a new element.- Specified by:
enqueue
in interfaceBytePriorityQueue
- Parameters:
x
- the element to enqueue.- See Also:
-
dequeueByte
public byte dequeueByte()Description copied from interface:BytePriorityQueue
Dequeues the first element from the queue.- Specified by:
dequeueByte
in interfaceBytePriorityQueue
- Returns:
- the dequeued element.
- See Also:
-
firstByte
public byte firstByte()Description copied from interface:BytePriorityQueue
Returns the first element of the queue.- Specified by:
firstByte
in interfaceBytePriorityQueue
- Returns:
- the first element.
- See Also:
-
changed
public void changed()Description copied from interface:PriorityQueue
Notifies the queue that the first element has changed (optional operation).This default implementation just throws an
UnsupportedOperationException
.- Specified by:
changed
in interfacePriorityQueue<Byte>
-
size
public int size()Description copied from interface:PriorityQueue
Returns the number of elements in this queue.- Specified by:
size
in interfacePriorityQueue<Byte>
- Returns:
- the number of elements in this queue.
-
clear
public void clear()Description copied from interface:PriorityQueue
Removes all elements from this queue.- Specified by:
clear
in interfacePriorityQueue<Byte>
-
trim
public void trim()Trims the underlying heap array so that it has exactlysize()
elements. -
comparator
Description copied from interface:BytePriorityQueue
Returns the comparator associated with this priority queue, or null if it uses its elements' natural ordering.- Specified by:
comparator
in interfaceBytePriorityQueue
- Specified by:
comparator
in interfacePriorityQueue<Byte>
- Returns:
- the comparator associated with this priority queue.
- See Also:
-