Package it.unimi.dsi.fastutil.longs

Class LongHeapPriorityQueue

java.lang.Object

it.unimi.dsi.fastutil.longs.LongHeapPriorityQueue

All Implemented Interfaces:

LongPriorityQueue, PriorityQueue<Long>, Serializable

public class LongHeapPriorityQueue
extends Object
implements LongPriorityQueue, 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
LongHeapPriorityQueue()	Creates a new empty queue using the natural order.
LongHeapPriorityQueue(int capacity)	Creates a new empty queue with a given capacity and using the natural order.
LongHeapPriorityQueue(int capacity, LongComparator c)	Creates a new empty queue with a given capacity and comparator.
LongHeapPriorityQueue(long[] a)	Wraps a given array in a queue using the natural order.
LongHeapPriorityQueue(long[] a, int size)	Wraps a given array in a queue using the natural order.
LongHeapPriorityQueue(long[] a, int size, LongComparator c)	Wraps a given array in a queue using a given comparator.
LongHeapPriorityQueue(long[] a, LongComparator c)	Wraps a given array in a queue using a given comparator.
LongHeapPriorityQueue(LongCollection collection)	Creates a queue using the elements in a type-specific collection using the natural order.
LongHeapPriorityQueue(LongCollection collection, LongComparator c)	Creates a queue using the elements in a type-specific collection using a given comparator.
LongHeapPriorityQueue(LongComparator c)	Creates a new empty queue with a given comparator.
LongHeapPriorityQueue(Collection<? extends Long> collection)	Creates a queue using the elements in a collection using the natural order.
LongHeapPriorityQueue(Collection<? extends Long> collection, LongComparator 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.
LongComparator	comparator()	Returns the comparator associated with this priority queue, or null if it uses its elements' natural ordering.
long	dequeueLong()	Dequeues the first element from the queue.
void	enqueue(long x)	Enqueues a new element.
long	firstLong()	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.longs.LongPriorityQueue

dequeue, enqueue, first, last, lastLong

Methods inherited from interface it.unimi.dsi.fastutil.PriorityQueue

isEmpty

Constructor Details

LongHeapPriorityQueue

public LongHeapPriorityQueue(int capacity,
 LongComparator 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.

LongHeapPriorityQueue

public LongHeapPriorityQueue(int capacity)

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

Parameters:

capacity - the initial capacity of this queue.

LongHeapPriorityQueue

public LongHeapPriorityQueue(LongComparator c)

Creates a new empty queue with a given comparator.

Parameters:

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

LongHeapPriorityQueue

public LongHeapPriorityQueue()

Creates a new empty queue using the natural order.

LongHeapPriorityQueue

public LongHeapPriorityQueue(long[] a,
 int size,
 LongComparator 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.

LongHeapPriorityQueue

public LongHeapPriorityQueue(long[] a,
 LongComparator 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.

LongHeapPriorityQueue

public LongHeapPriorityQueue(long[] 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.

LongHeapPriorityQueue

public LongHeapPriorityQueue(long[] 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.

LongHeapPriorityQueue

public LongHeapPriorityQueue(LongCollection collection,
 LongComparator 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.

LongHeapPriorityQueue

public LongHeapPriorityQueue(LongCollection 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.

LongHeapPriorityQueue

public LongHeapPriorityQueue(Collection<? extends Long> collection,
 LongComparator 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.

LongHeapPriorityQueue

public LongHeapPriorityQueue(Collection<? extends Long> 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(long x)

Description copied from interface: LongPriorityQueue

Enqueues a new element.

Specified by:

enqueue in interface LongPriorityQueue

Parameters:

x - the element to enqueue.

See Also:

• PriorityQueue.enqueue(Object)

dequeueLong

public long dequeueLong()

Description copied from interface: LongPriorityQueue

Dequeues the first element from the queue.

Specified by:

dequeueLong in interface LongPriorityQueue

Returns:

the dequeued element.

See Also:

• LongPriorityQueue.dequeue()

firstLong

public long firstLong()

Description copied from interface: LongPriorityQueue

Returns the first element of the queue.

Specified by:

firstLong in interface LongPriorityQueue

Returns:

the first element.

See Also:

• LongPriorityQueue.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<Long>

size

public int size()

Description copied from interface: PriorityQueue

Returns the number of elements in this queue.

Specified by:

size in interface PriorityQueue<Long>

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<Long>

trim

public void trim()

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

comparator

public LongComparator comparator()

Description copied from interface: LongPriorityQueue

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

Specified by:

comparator in interface LongPriorityQueue

Specified by:

comparator in interface PriorityQueue<Long>

Returns:

the comparator associated with this priority queue.

See Also:

• PriorityQueue.comparator()