IndirectDoublePriorityQueues.SynchronizedIndirectDoublePriorityQueue (fastutil 6.5.7)

java.lang.Object
- it.unimi.dsi.fastutil.IndirectDoublePriorityQueues.SynchronizedIndirectDoublePriorityQueue<K>

All Implemented Interfaces:

IndirectDoublePriorityQueue<K>, IndirectPriorityQueue<K>

Enclosing class:

IndirectDoublePriorityQueues
```
public static class IndirectDoublePriorityQueues.SynchronizedIndirectDoublePriorityQueue<K>
extends Object
implements IndirectDoublePriorityQueue<K>
```
A synchronized wrapper class for indirect double priority queues.

Field Summary

Fields
Modifier and Type Field and Description

static long serialVersionUID

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

Method Summary

Methods
Modifier and Type	Method and Description
`void`	`allChanged()` Notifies this queue that the all elements have changed (optional operation).
`void`	`changed()` Notifies this queue that the first element has changed (optional operation).
`void`	`changed(int i)` Notifies this queue that the specified 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.
`boolean`	`contains(int index)` Checks whether a given index belongs to this queue (optional operation).
`int`	`dequeue()` Dequeues the first element from this queue.
`void`	`enqueue(int index)` Enqueues a new element.
`int`	`first()` Returns the first element of this queue.
`int`	`front(int[] a)` Retrieves the front of this queue in a given array (optional operation).
`boolean`	`isEmpty()` Checks whether this queue is empty.
`int`	`last()` Returns the last element of this queue, that is, the element the would be dequeued last (optional operation).
`boolean`	`remove(int i)` Removes the specified element from this queue (optional operation).
`Comparator<? super K>`	`secondaryComparator()` Returns the secondary comparator of this queue.
`int`	`secondaryFirst()` Returns the first element of this queue with respect to the secondary comparator.
`int`	`secondaryFront(int[] a)` Retrieves the secondary front of the queue in a given array (optional operation).
`int`	`secondaryLast()` Returns the last element of this queue with respect to the secondary comparator (optional operation).
`int`	`size()` Returns the number of elements in this queue.

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

- Field Detail
  - serialVersionUID
```
public static final long serialVersionUID
```
    See Also:
    Constant Field Values
- Method Detail
  - enqueue
```
public void enqueue(int index)
```
    Description copied from interface: IndirectPriorityQueue
    
    Enqueues a new element.
    
    Specified by:
    
    enqueue in interface IndirectPriorityQueue<K>
    
    Parameters:
    index - the element to enqueue..
  - dequeue
```
public int dequeue()
```
    Description copied from interface: IndirectPriorityQueue
    
    Dequeues the first element from this queue.
    
    Specified by:
    
    dequeue in interface IndirectPriorityQueue<K>
    
    Returns:
    the dequeued element.
  - first
```
public int first()
```
    Description copied from interface: IndirectPriorityQueue
    
    Returns the first element of this queue.
    
    Specified by:
    
    first in interface IndirectPriorityQueue<K>
    
    Returns:
    the first element.
  - last
```
public int last()
```
    Description copied from interface: IndirectPriorityQueue
    
    Returns the last element of this queue, that is, the element the would be dequeued last (optional operation).
    
    Specified by:
    
    last in interface IndirectPriorityQueue<K>
    
    Returns:
    the last element.
  - contains
```
public boolean contains(int index)
```
    Description copied from interface: IndirectPriorityQueue
    
    Checks whether a given index belongs to this queue (optional operation).
    
    Specified by:
    
    contains in interface IndirectPriorityQueue<K>
    
    Returns:
    true if the specified index belongs to this queue.
  - secondaryFirst
```
public int secondaryFirst()
```
    Description copied from interface: IndirectDoublePriorityQueue
    
    Returns the first element of this queue with respect to the secondary comparator.
    
    Specified by:
    
    secondaryFirst in interface IndirectDoublePriorityQueue<K>
    
    Returns:
    the first element of this queue w.r.t. the secondary comparator.
  - secondaryLast
```
public int secondaryLast()
```
    Description copied from interface: IndirectDoublePriorityQueue
    
    Returns the last element of this queue with respect to the secondary comparator (optional operation).
    
    Specified by:
    
    secondaryLast in interface IndirectDoublePriorityQueue<K>
    
    Returns:
    the last element of this queue w.r.t. the secondary comparator.
  - isEmpty
```
public boolean isEmpty()
```
    Description copied from interface: IndirectPriorityQueue
    
    Checks whether this queue is empty.
    
    Specified by:
    
    isEmpty in interface IndirectPriorityQueue<K>
    
    Returns:
    true if this queue is empty.
  - size
```
public int size()
```
    Description copied from interface: IndirectPriorityQueue
    
    Returns the number of elements in this queue.
    
    Specified by:
    
    size in interface IndirectPriorityQueue<K>
    
    Returns:
    the number of elements in this queue.
  - clear
```
public void clear()
```
    Description copied from interface: IndirectPriorityQueue
    
    Removes all elements from this queue.
    
    Specified by:
    
    clear in interface IndirectPriorityQueue<K>
  - changed
```
public void changed()
```
    Description copied from interface: IndirectPriorityQueue
    
    Notifies this queue that the first element has changed (optional operation).
    
    Specified by:
    
    changed in interface IndirectPriorityQueue<K>
  - allChanged
```
public void allChanged()
```
    Description copied from interface: IndirectPriorityQueue
    
    Notifies this queue that the all elements have changed (optional operation).
    
    Specified by:
    
    allChanged in interface IndirectPriorityQueue<K>
  - changed
```
public void changed(int i)
```
    Description copied from interface: IndirectPriorityQueue
    
    Notifies this queue that the specified element has changed (optional operation).
    Note that the specified element must belong to this queue.
    
    Specified by:
    
    changed in interface IndirectPriorityQueue<K>
    
    Parameters:
    i - the element that has changed.
  - remove
```
public boolean remove(int i)
```
    Description copied from interface: IndirectPriorityQueue
    
    Removes the specified element from this queue (optional operation).
    
    Specified by:
    
    remove in interface IndirectPriorityQueue<K>
    
    Parameters:
    i - the element to be removed.
    
    Returns:
    true if the index was in the queue.
  - comparator
```
public Comparator<? super K> comparator()
```
    Description copied from interface: IndirectPriorityQueue
    
    Returns the comparator associated with this queue, or null if it uses its elements' natural ordering.
    
    Specified by:
    
    comparator in interface IndirectPriorityQueue<K>
    
    Returns:
    the comparator associated with this sorted set, or null if it uses its elements' natural ordering.
  - secondaryComparator
```
public Comparator<? super K> secondaryComparator()
```
    Description copied from interface: IndirectDoublePriorityQueue
    
    Returns the secondary comparator of this queue.
    
    Specified by:
    
    secondaryComparator in interface IndirectDoublePriorityQueue<K>
    
    Returns:
    the secondary comparator of this queue.
    See Also:
    IndirectDoublePriorityQueue.secondaryFirst()
  - secondaryFront
```
public int secondaryFront(int[] a)
```
    Description copied from interface: IndirectDoublePriorityQueue
    
    Retrieves the secondary front of the queue in a given array (optional operation).
    
    Specified by:
    
    secondaryFront in interface IndirectDoublePriorityQueue<K>
    
    Parameters:
    a - an array large enough to hold the secondary front (e.g., at least long as the reference array).
    
    Returns:
    the number of elements actually written (starting from the first position of a).
    See Also:
    IndirectPriorityQueue.front(int[])
  - front
```
public int front(int[] a)
```
    Description copied from interface: IndirectPriorityQueue
    
    Retrieves the front of this queue in a given array (optional operation).
    The front of an indirect queue is the set of indices whose associated elements in the reference array are equal to the element associated to the first index. These indices can be always obtain by dequeueing, but this method should retrieve efficiently such indices in the given array without modifying the state of this queue.
    
    Specified by:
    
    front in interface IndirectPriorityQueue<K>
    
    Parameters:
    a - an array large enough to hold the front (e.g., at least long as the reference array).
    
    Returns:
    the number of elements actually written (starting from the first position of a).

Class IndirectDoublePriorityQueues.SynchronizedIndirectDoublePriorityQueue<K>

Field Summary

Method Summary

Methods inherited from class java.lang.Object

Field Detail

serialVersionUID

Method Detail

enqueue

dequeue

first

last

contains

secondaryFirst

secondaryLast

isEmpty

size

clear

changed

allChanged

changed

remove

comparator

secondaryComparator

secondaryFront

front