public static class LongPriorityQueues.SynchronizedPriorityQueue extends Object implements LongPriorityQueue
| 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.
|
LongComparator |
comparator()
Returns the comparator associated with this sorted set, or null if it uses its elements' natural ordering.
|
Long |
dequeue()
Dequeues the first element from the queue.
|
long |
dequeueLong()
Dequeues the first element from the queue.
|
void |
enqueue(long x)
Enqueues a new element.
|
void |
enqueue(Long x)
Enqueues a new element.
|
Long |
first()
Returns the first element of the queue.
|
long |
firstLong()
Returns the first element of the queue.
|
boolean |
isEmpty()
Checks whether the queue is empty.
|
Long |
last()
Returns the last element of the queue, that is, the element the would be dequeued last (optional operation).
|
long |
lastLong()
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.
|
public void enqueue(long x)
LongPriorityQueueenqueue in interface LongPriorityQueuex - the element to enqueue.public long dequeueLong()
LongPriorityQueuedequeueLong in interface LongPriorityQueuepublic long firstLong()
LongPriorityQueuefirstLong in interface LongPriorityQueuepublic long lastLong()
LongPriorityQueuelastLong in interface LongPriorityQueuepublic boolean isEmpty()
PriorityQueueisEmpty in interface PriorityQueue<Long>public int size()
PriorityQueuesize in interface PriorityQueue<Long>public void clear()
PriorityQueueclear in interface PriorityQueue<Long>public void changed()
PriorityQueuechanged in interface PriorityQueue<Long>public LongComparator comparator()
LongPriorityQueueNote that this specification strengthens the one given in PriorityQueue.comparator().
comparator in interface LongPriorityQueuecomparator in interface PriorityQueue<Long>null if it uses its elements' natural ordering.PriorityQueue.comparator()public void enqueue(Long x)
PriorityQueueenqueue in interface PriorityQueue<Long>x - the element to enqueue..public Long dequeue()
PriorityQueuedequeue in interface PriorityQueue<Long>public Long first()
PriorityQueuefirst in interface PriorityQueue<Long>public Long last()
PriorityQueuelast in interface PriorityQueue<Long>