PriorityQueues.SynchronizedPriorityQueue (fastutil 8.1.0)

java.lang.Object
- it.unimi.dsi.fastutil.PriorityQueues.SynchronizedPriorityQueue<K>

All Implemented Interfaces:

PriorityQueue<K>, Serializable

Enclosing class:

PriorityQueues
```
public static class PriorityQueues.SynchronizedPriorityQueue<K>
extends Object
implements PriorityQueue<K>, Serializable
```
A synchronized wrapper class for priority queues.

See Also:

Serialized Form

Field Summary

Fields
Modifier and Type Field and Description

static long serialVersionUID

Fields
Modifier and Type	Field and Description
`static long`	`serialVersionUID`

Method Summary

All Methods Instance Methods Concrete 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.
`boolean`	`equals(Object o)` Indicates whether some other object is "equal to" this one.
`K`	`first()` 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.
`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.
`String`	`toString()` Returns a string representation of the object.

Methods inherited from class java.lang.Object
getClass, notify, notifyAll, wait, wait, wait

- Field Detail
  - serialVersionUID
```
public static final long serialVersionUID
```
    See Also:
    
    Constant Field Values
- 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).
    This default implementation just throws an UnsupportedOperationException.
    
    Specified by:
    
    last in interface PriorityQueue<K>
    
    Returns:
    
    the last element.
  - isEmpty
```
public boolean isEmpty()
```
    Description copied from interface: PriorityQueue
    
    Checks whether this queue is empty.
    This default implementation checks whether PriorityQueue.size() is zero.
    
    Specified by:
    
    isEmpty in interface PriorityQueue<K>
    
    Returns:
    
    true if this 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).
    This default implementation just throws an UnsupportedOperationException.
    
    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.
  - toString
```
public String toString()
```
    Description copied from class: java.lang.Object
    Returns a string representation of the object. In general, the toString method returns a string that "textually represents" this object. The result should be a concise but informative representation that is easy for a person to read. It is recommended that all subclasses override this method.
    The toString method for class Object returns a string consisting of the name of the class of which the object is an instance, the at-sign character `@', and the unsigned hexadecimal representation of the hash code of the object. In other words, this method returns a string equal to the value of:
    getClass().getName() + '@' + Integer.toHexString(hashCode())
    Overrides:
    
    toString in class Object
    
    Returns:
    
    a string representation of the object.
  - hashCode
```
public int hashCode()
```
    Description copied from class: java.lang.Object
    Returns a hash code value for the object. This method is supported for the benefit of hash tables such as those provided by HashMap.
    The general contract of hashCode is:
    - Whenever it is invoked on the same object more than once during an execution of a Java application, the 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.
    - If two objects are equal according to the equals(Object) method, then calling the hashCode method on each of the two objects must produce the same integer result.
    - It is not required that if two objects are unequal according to the 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.)
    Overrides:
    
    hashCode in class Object
    
    Returns:
    
    a hash code value for this object.
    
    See Also:
    
    Object.equals(java.lang.Object), System.identityHashCode(java.lang.Object)
  - equals
```
public boolean equals(Object o)
```
    Description copied from class: java.lang.Object
    Indicates whether some other object is "equal to" this one.
    The equals method implements an equivalence relation on non-null object references:
    - It is reflexive: for any non-null reference value x, x.equals(x) should return true.
    - It is symmetric: for any non-null reference values x and y, x.equals(y) should return true if and only if y.equals(x) returns true.
    - It is transitive: for any non-null reference values x, y, and z, if x.equals(y) returns true and y.equals(z) returns true, then x.equals(z) should return true.
    - It is consistent: for any non-null reference values 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.
    - For any non-null reference value 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.
    Overrides:
    
    equals in class Object
    
    Parameters:
    
    o - the reference object with which to compare.
    
    Returns:
    
    true if this object is the same as the obj argument; false otherwise.
    
    See Also:
    
    Object.hashCode(), HashMap

Class PriorityQueues.SynchronizedPriorityQueue<K>

Field Summary

Method Summary

Methods inherited from class java.lang.Object

Field Detail

serialVersionUID

Method Detail

enqueue

dequeue

first

last

isEmpty

size

clear

changed

comparator

toString

hashCode

equals