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 priority queue, or null if it
uses its elements' natural ordering.
|
Long |
dequeue()
Deprecated.
|
long |
dequeueLong()
Dequeues the first element from the queue.
|
void |
enqueue(long x)
Enqueues a new element.
|
void |
enqueue(Long x)
Deprecated.
|
boolean |
equals(Object o)
Indicates whether some other object is "equal to" this one.
|
Long |
first()
Deprecated.
|
long |
firstLong()
Returns the first element of the queue.
|
int |
hashCode()
Returns a hash code value for the object.
|
boolean |
isEmpty()
Checks whether this queue is empty.
|
Long |
last()
Deprecated.
|
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.PriorityQueue.enqueue(Object)public long dequeueLong()
LongPriorityQueuedequeueLong in interface LongPriorityQueueLongPriorityQueue.dequeue()public long firstLong()
LongPriorityQueuefirstLong in interface LongPriorityQueueLongPriorityQueue.first()public long lastLong()
LongPriorityQueue
This default implementation just throws an
UnsupportedOperationException.
lastLong in interface LongPriorityQueueLongPriorityQueue.last()public boolean isEmpty()
PriorityQueueThis default implementation checks whether PriorityQueue.size() is zero.
isEmpty in interface PriorityQueue<Long>public int size()
PriorityQueuesize in interface PriorityQueue<Long>public void clear()
PriorityQueueclear in interface PriorityQueue<Long>public void changed()
PriorityQueueThis default implementation just throws an UnsupportedOperationException.
changed in interface PriorityQueue<Long>public LongComparator comparator()
LongPriorityQueue
Note that this specification strengthens the one given in
PriorityQueue.comparator().
comparator in interface LongPriorityQueuecomparator in interface PriorityQueue<Long>PriorityQueue.comparator()@Deprecated public void enqueue(Long x)
LongPriorityQueueThis default implementation delegates to the corresponding type-specific method.
enqueue in interface LongPriorityQueueenqueue in interface PriorityQueue<Long>x - the element to enqueue.@Deprecated public Long dequeue()
LongPriorityQueueThis default implementation delegates to the corresponding type-specific method.
dequeue in interface LongPriorityQueuedequeue in interface PriorityQueue<Long>@Deprecated public Long first()
LongPriorityQueueThis default implementation delegates to the corresponding type-specific method.
first in interface LongPriorityQueuefirst in interface PriorityQueue<Long>@Deprecated public Long last()
LongPriorityQueueThis default implementation just throws an UnsupportedOperationException.
This default implementation delegates to the corresponding type-specific method.
last in interface LongPriorityQueuelast in interface PriorityQueue<Long>public int hashCode()
java.lang.ObjectHashMap.
The general contract of hashCode is:
hashCode method
must consistently return the same integer, provided no information
used in equals comparisons on the object is modified.
This integer need not remain consistent from one execution of an
application to another execution of the same application.
equals(Object)
method, then calling the hashCode method on each of
the two objects must produce the same integer result.
Object.equals(java.lang.Object)
method, then calling the hashCode method on each of the
two objects must produce distinct integer results. However, the
programmer should be aware that producing distinct integer results
for unequal objects may improve the performance of hash tables.
As much as is reasonably practical, the hashCode method defined by
class Object does return distinct integers for distinct
objects. (This is typically implemented by converting the internal
address of the object into an integer, but this implementation
technique is not required by the
Java™ programming language.)
hashCode in class ObjectObject.equals(java.lang.Object),
System.identityHashCode(java.lang.Object)public boolean equals(Object o)
java.lang.Object
The equals method implements an equivalence relation
on non-null object references:
x, x.equals(x) should return
true.
x and y, x.equals(y)
should return true if and only if
y.equals(x) returns true.
x, y, and z, if
x.equals(y) returns true and
y.equals(z) returns true, then
x.equals(z) should return true.
x and y, multiple invocations of
x.equals(y) consistently return true
or consistently return false, provided no
information used in equals comparisons on the
objects is modified.
x,
x.equals(null) should return false.
The equals method for class Object implements
the most discriminating possible equivalence relation on objects;
that is, for any non-null reference values x and
y, this method returns true if and only
if x and y refer to the same object
(x == y has the value true).
Note that it is generally necessary to override the hashCode
method whenever this method is overridden, so as to maintain the
general contract for the hashCode method, which states
that equal objects must have equal hash codes.
equals in class Objecto - the reference object with which to compare.true if this object is the same as the obj
argument; false otherwise.Object.hashCode(),
HashMap