it.unimi.dsi.fastutil

Class PriorityQueues.SynchronizedPriorityQueue<K>

java.lang.Object

it.unimi.dsi.fastutil.PriorityQueues.SynchronizedPriorityQueue<K>

All Implemented Interfaces:

PriorityQueue<K>

Enclosing class:

PriorityQueues

public static class PriorityQueues.SynchronizedPriorityQueue<K>
extends Object
implements PriorityQueue<K>

A synchronized wrapper class for priority queues.

Field Summary

Fields

Modifier and Type	Field and Description
protected PriorityQueue<K>	q
static long	serialVersionUID
protected Object	sync

Constructor Summary

Constructors

Modifier	Constructor and Description
protected	PriorityQueues.SynchronizedPriorityQueue(PriorityQueue<K> q)
protected	PriorityQueues.SynchronizedPriorityQueue(PriorityQueue<K> q, Object sync)

Method Summary

Methods

Modifier and Type	Method and Description
void	changed() Notifies the queue that the first element has changed (optional operation).
void	clear() Removes all elements from this queue.
Comparator<? super K>	comparator() Returns the comparator associated with this queue, or null if it uses its elements' natural ordering.
K	dequeue() Dequeues the first element from the queue.
void	enqueue(K x) Enqueues a new element.
K	first() Returns the first element of the queue.
boolean	isEmpty() Checks whether the queue is empty.
K	last() 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.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Detail

serialVersionUID

public static final long serialVersionUID

See Also:

Constant Field Values

q

protected final PriorityQueue<K> q

sync

protected final Object sync

Constructor Detail

PriorityQueues.SynchronizedPriorityQueue

protected PriorityQueues.SynchronizedPriorityQueue(PriorityQueue<K> q,
                                        Object sync)

PriorityQueues.SynchronizedPriorityQueue

protected PriorityQueues.SynchronizedPriorityQueue(PriorityQueue<K> q)

Method Detail

enqueue

public void enqueue(K x)

Description copied from interface: PriorityQueue

Enqueues a new element.

Specified by:

enqueue in interface PriorityQueue<K>

Parameters:

x - the element to enqueue..

dequeue

public K dequeue()

Description copied from interface: PriorityQueue

Dequeues the first element from the queue.

Specified by:

dequeue in interface PriorityQueue<K>

Returns:

the dequeued element.

first

public K first()

Description copied from interface: PriorityQueue

Returns the first element of the queue.

Specified by:

first in interface PriorityQueue<K>

Returns:

the first element.

last

public K last()

Description copied from interface: PriorityQueue

Returns the last element of the queue, that is, the element the would be dequeued last (optional operation).

Specified by:

last in interface PriorityQueue<K>

Returns:

the last element.

isEmpty

public boolean isEmpty()

Description copied from interface: PriorityQueue

Checks whether the queue is empty.

Specified by:

isEmpty in interface PriorityQueue<K>

Returns:

true if the queue is empty.

size

public int size()

Description copied from interface: PriorityQueue

Returns the number of elements in this queue.

Specified by:

size in interface PriorityQueue<K>

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

changed

public void changed()

Description copied from interface: PriorityQueue

Notifies the queue that the first element has changed (optional operation).

Specified by:

changed in interface PriorityQueue<K>

comparator

public Comparator<? super K> comparator()

Description copied from interface: PriorityQueue

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

Specified by:

comparator in interface PriorityQueue<K>

Returns:

the comparator associated with this sorted set, or null if it uses its elements' natural ordering.