Class ByteArrayPriorityQueue
- All Implemented Interfaces:
BytePriorityQueue,PriorityQueue<Byte>,Serializable
public class ByteArrayPriorityQueue extends Object implements BytePriorityQueue, Serializable
Instances of this class represent a priority queue using a backing
array—all operations are performed directly on the array. The array is
enlarged as needed, but it is never shrunk. Use the trim() method to
reduce its size, if necessary.
This implementation is extremely inefficient, but it is difficult to beat when the size of the queue is very small.
- See Also:
- Serialized Form
-
Constructor Summary
Constructors Constructor Description ByteArrayPriorityQueue()Creates a new empty queue using the natural order.ByteArrayPriorityQueue(byte[] a)Wraps a given array in a queue using the natural order.ByteArrayPriorityQueue(byte[] a, int size)Wraps a given array in a queue using the natural order.ByteArrayPriorityQueue(byte[] a, int size, ByteComparator c)Wraps a given array in a queue using a given comparator.ByteArrayPriorityQueue(byte[] a, ByteComparator c)Wraps a given array in a queue using a given comparator.ByteArrayPriorityQueue(int capacity)Creates a new empty queue with a given capacity and using the natural order.ByteArrayPriorityQueue(int capacity, ByteComparator c)Creates a new empty queue with a given capacity and comparator.ByteArrayPriorityQueue(ByteComparator c)Creates a new empty queue with a given comparator. -
Method Summary
Modifier and Type Method Description voidchanged()Notifies the queue that the first element has changed (optional operation).voidclear()Removes all elements from this queue.ByteComparatorcomparator()Returns the comparator associated with this priority queue, or null if it uses its elements' natural ordering.bytedequeueByte()Dequeues the first element from the queue.voidenqueue(byte x)Enqueues a new element.bytefirstByte()Returns the first element of the queue.intsize()Returns the number of elements in this queue.voidtrim()Trims the underlying array so that it has exactlysize()elements.Methods inherited from class java.lang.Object
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
-
Constructor Details
-
ByteArrayPriorityQueue
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, ornullfor the natural order.
-
ByteArrayPriorityQueue
public ByteArrayPriorityQueue(int capacity)Creates a new empty queue with a given capacity and using the natural order.- Parameters:
capacity- the initial capacity of this queue.
-
ByteArrayPriorityQueue
Creates a new empty queue with a given comparator.- Parameters:
c- the comparator used in this queue, ornullfor the natural order.
-
ByteArrayPriorityQueue
public ByteArrayPriorityQueue()Creates a new empty queue using the natural order. -
ByteArrayPriorityQueue
Wraps a given array in a queue using a given comparator.The queue returned by this method will be backed by the given array.
- Parameters:
a- an array.size- the number of elements to be included in the queue.c- the comparator used in this queue, ornullfor the natural order.
-
ByteArrayPriorityQueue
Wraps a given array in a queue using a given comparator.The queue returned by this method will be backed by the given array.
- Parameters:
a- an array.c- the comparator used in this queue, ornullfor the natural order.
-
ByteArrayPriorityQueue
public ByteArrayPriorityQueue(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.
- Parameters:
a- an array.size- the number of elements to be included in the queue.
-
ByteArrayPriorityQueue
public ByteArrayPriorityQueue(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.
- Parameters:
a- an array.
-
-
Method Details
-
enqueue
public void enqueue(byte x)Description copied from interface:BytePriorityQueueEnqueues a new element.- Specified by:
enqueuein interfaceBytePriorityQueue- Parameters:
x- the element to enqueue.- See Also:
PriorityQueue.enqueue(Object)
-
dequeueByte
public byte dequeueByte()Description copied from interface:BytePriorityQueueDequeues the first element from the queue.- Specified by:
dequeueBytein interfaceBytePriorityQueue- Returns:
- the dequeued element.
- See Also:
BytePriorityQueue.dequeue()
-
firstByte
public byte firstByte()Description copied from interface:BytePriorityQueueReturns the first element of the queue.- Specified by:
firstBytein interfaceBytePriorityQueue- Returns:
- the first element.
- See Also:
BytePriorityQueue.first()
-
changed
public void changed()Description copied from interface:PriorityQueueNotifies the queue that the first element has changed (optional operation).This default implementation just throws an
UnsupportedOperationException.- Specified by:
changedin interfacePriorityQueue<Byte>
-
size
public int size()Description copied from interface:PriorityQueueReturns the number of elements in this queue.- Specified by:
sizein interfacePriorityQueue<Byte>- Returns:
- the number of elements in this queue.
-
clear
public void clear()Description copied from interface:PriorityQueueRemoves all elements from this queue.- Specified by:
clearin interfacePriorityQueue<Byte>
-
trim
public void trim()Trims the underlying array so that it has exactlysize()elements. -
comparator
Description copied from interface:BytePriorityQueueReturns the comparator associated with this priority queue, or null if it uses its elements' natural ordering.Note that this specification strengthens the one given in
PriorityQueue.comparator().- Specified by:
comparatorin interfaceBytePriorityQueue- Specified by:
comparatorin interfacePriorityQueue<Byte>- Returns:
- the comparator associated with this priority queue.
- See Also:
PriorityQueue.comparator()
-