Package it.unimi.dsi.fastutil.shorts

Class ShortHeapPriorityQueue

java.lang.Object

it.unimi.dsi.fastutil.shorts.ShortHeapPriorityQueue

All Implemented Interfaces:

PriorityQueue<Short>, ShortPriorityQueue, Serializable

public class ShortHeapPriorityQueue
extends Object
implements ShortPriorityQueue, Serializable

A type-specific heap-based priority queue.

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:

• Serialized Form

Constructor Summary

Constructors

Constructor	Description
ShortHeapPriorityQueue()	Creates a new empty queue using the natural order.
ShortHeapPriorityQueue(int capacity)	Creates a new empty queue with a given capacity and using the natural order.
ShortHeapPriorityQueue(int capacity, ShortComparator c)	Creates a new empty queue with a given capacity and comparator.
ShortHeapPriorityQueue(short[] a)	Wraps a given array in a queue using the natural order.
ShortHeapPriorityQueue(short[] a, int size)	Wraps a given array in a queue using the natural order.
ShortHeapPriorityQueue(short[] a, int size, ShortComparator c)	Wraps a given array in a queue using a given comparator.
ShortHeapPriorityQueue(short[] a, ShortComparator c)	Wraps a given array in a queue using a given comparator.
ShortHeapPriorityQueue(ShortCollection collection)	Creates a queue using the elements in a type-specific collection using the natural order.
ShortHeapPriorityQueue(ShortCollection collection, ShortComparator c)	Creates a queue using the elements in a type-specific collection using a given comparator.
ShortHeapPriorityQueue(ShortComparator c)	Creates a new empty queue with a given comparator.
ShortHeapPriorityQueue(Collection<? extends Short> collection)	Creates a queue using the elements in a collection using the natural order.
ShortHeapPriorityQueue(Collection<? extends Short> collection, ShortComparator c)	Creates a queue using the elements in a collection using a given comparator.

Method Summary

Modifier and Type	Method	Description
void	changed()	Notifies the queue that the first element has changed (optional operation).
void	clear()	Removes all elements from this queue.
ShortComparator	comparator()	Returns the comparator associated with this priority queue, or null if it uses its elements' natural ordering.
short	dequeueShort()	Dequeues the first element from the queue.
void	enqueue(short x)	Enqueues a new element.
short	firstShort()	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 exactly size() 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.PriorityQueue

isEmpty

Methods inherited from interface it.unimi.dsi.fastutil.shorts.ShortPriorityQueue

dequeue, enqueue, first, last, lastShort

Constructor Details

ShortHeapPriorityQueue

public ShortHeapPriorityQueue(int capacity,
 ShortComparator c)

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, or null for the natural order.

ShortHeapPriorityQueue

public ShortHeapPriorityQueue(int capacity)

Creates a new empty queue with a given capacity and using the natural order.

Parameters:

capacity - the initial capacity of this queue.

ShortHeapPriorityQueue

public ShortHeapPriorityQueue(ShortComparator c)

Creates a new empty queue with a given comparator.

Parameters:

c - the comparator used in this queue, or null for the natural order.

ShortHeapPriorityQueue

public ShortHeapPriorityQueue()

Creates a new empty queue using the natural order.

ShortHeapPriorityQueue

public ShortHeapPriorityQueue(short[] a,
 int size,
 ShortComparator c)

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 of a 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, or null for the natural order.

ShortHeapPriorityQueue

public ShortHeapPriorityQueue(short[] a,
 ShortComparator c)

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, or null for the natural order.

ShortHeapPriorityQueue

public ShortHeapPriorityQueue(short[] 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 of a one by one).

Parameters:

a - an array.

size - the number of elements to be included in the queue.

ShortHeapPriorityQueue

public ShortHeapPriorityQueue(short[] 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.

ShortHeapPriorityQueue

public ShortHeapPriorityQueue(ShortCollection collection,
 ShortComparator c)

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, or null for the natural order.

ShortHeapPriorityQueue

public ShortHeapPriorityQueue(ShortCollection collection)

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.

ShortHeapPriorityQueue

public ShortHeapPriorityQueue(Collection<? extends Short> collection,
 ShortComparator c)

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, or null for the natural order.

ShortHeapPriorityQueue

public ShortHeapPriorityQueue(Collection<? extends Short> collection)

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(short x)

Description copied from interface: ShortPriorityQueue

Enqueues a new element.

Specified by:

enqueue in interface ShortPriorityQueue

Parameters:

x - the element to enqueue.

See Also:

• PriorityQueue.enqueue(Object)

dequeueShort

public short dequeueShort()

Description copied from interface: ShortPriorityQueue

Dequeues the first element from the queue.

Specified by:

dequeueShort in interface ShortPriorityQueue

Returns:

the dequeued element.

See Also:

• ShortPriorityQueue.dequeue()

firstShort

public short firstShort()

Description copied from interface: ShortPriorityQueue

Returns the first element of the queue.

Specified by:

firstShort in interface ShortPriorityQueue

Returns:

the first element.

See Also:

• ShortPriorityQueue.first()

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 interface PriorityQueue<Short>

size

public int size()

Description copied from interface: PriorityQueue

Returns the number of elements in this queue.

Specified by:

size in interface PriorityQueue<Short>

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 interface PriorityQueue<Short>

trim

public void trim()

Trims the underlying heap array so that it has exactly size() elements.

comparator

public ShortComparator comparator()

Description copied from interface: ShortPriorityQueue

Returns the comparator associated with this priority queue, or null if it uses its elements' natural ordering.

Specified by:

comparator in interface PriorityQueue<Short>

Specified by:

comparator in interface ShortPriorityQueue

Returns:

the comparator associated with this priority queue.

See Also:

• PriorityQueue.comparator()