src.it.unimi.dsi.fastutil.doubles.DoubleHeapIndirectPriorityQueue Maven / Gradle / Ivy
/* Generic definitions */
/* Assertions (useful to generate conditional code) */
/* Current type and class (and size, if applicable) */
/* Value methods */
/* Interfaces (keys) */
/* Interfaces (values) */
/* Abstract implementations (keys) */
/* Abstract implementations (values) */
/* Static containers (keys) */
/* Static containers (values) */
/* Implementations */
/* Synchronized wrappers */
/* Unmodifiable wrappers */
/* Other wrappers */
/* Methods (keys) */
/* Methods (values) */
/* Methods (keys/values) */
/* Methods that have special names depending on keys (but the special names depend on values) */
/* Equality */
/* Object/Reference-only definitions (keys) */
/* Primitive-type-only definitions (keys) */
/* Object/Reference-only definitions (values) */
/*
* Copyright (C) 2003-2013 Paolo Boldi and Sebastiano Vigna
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package it.unimi.dsi.fastutil.doubles;
import it.unimi.dsi.fastutil.ints.IntArrays;
import java.util.NoSuchElementException;
/** A type-specific heap-based indirect priority queue.
*
* Instances of this class use an additional inversion array, of the same length of the reference array,
* to keep track of the heap position containing a given element of the reference array. The priority queue is
* represented using a heap. The heap is enlarged as needed, but it is never
* shrunk. Use the {@link #trim()} method to reduce its size, if necessary.
*
*
This implementation does not allow one to enqueue several times the same index.
*/
public class DoubleHeapIndirectPriorityQueue extends DoubleHeapSemiIndirectPriorityQueue {
/** The inversion array. */
protected int inv[];
/** Creates a new empty queue with a given capacity and comparator.
*
* @param refArray the reference array.
* @param capacity the initial capacity of this queue.
* @param c the comparator used in this queue, or null for the natural order.
*/
public DoubleHeapIndirectPriorityQueue( double[] refArray, int capacity, DoubleComparator c ) {
super( refArray, capacity, c );
if ( capacity > 0 ) this.heap = new int[ capacity ];
this.refArray = refArray;
this.c = c;
this.inv = new int[ refArray.length ];
IntArrays.fill( inv, -1 );
}
/** Creates a new empty queue with a given capacity and using the natural order.
*
* @param refArray the reference array.
* @param capacity the initial capacity of this queue.
*/
public DoubleHeapIndirectPriorityQueue( double[] refArray, int capacity ) {
this( refArray, capacity, null );
}
/** Creates a new empty queue with capacity equal to the length of the reference array and a given comparator.
*
* @param refArray the reference array.
* @param c the comparator used in this queue, or null for the natural order.
*/
public DoubleHeapIndirectPriorityQueue( double[] refArray, DoubleComparator c ) {
this( refArray, refArray.length, c );
}
/** Creates a new empty queue with capacity equal to the length of the reference array and using the natural order.
* @param refArray the reference array.
*/
public DoubleHeapIndirectPriorityQueue( double[] refArray ) {
this( refArray, refArray.length, null );
}
/** Wraps a given array in a queue using a given comparator.
*
*
The queue returned by this method will be backed by the given array.
* The first size element of the array will be rearranged so to form a heap (this is
* more efficient than enqueing the elements of a one by one).
*
* @param refArray the reference array.
* @param a an array of indices into refArray.
* @param size the number of elements to be included in the queue.
* @param c the comparator used in this queue, or null for the natural order.
*/
public DoubleHeapIndirectPriorityQueue( final double[] refArray, final int[] a, final int size, final DoubleComparator c ) {
this( refArray, 0, c );
this.heap = a;
this.size = size;
int i = size;
while( i-- != 0 ) {
if ( inv[ a[ i ] ] != -1 ) throw new IllegalArgumentException( "Index " + a[ i ] + " appears twice in the heap" );
inv[ a[ i ] ] = i;
}
DoubleIndirectHeaps.makeHeap( refArray, a, inv, size, c );
}
/** Wraps a given array in a queue using a given comparator.
*
*
The queue returned by this method will be backed by the given array.
* The elements of the array will be rearranged so to form a heap (this is
* more efficient than enqueing the elements of a one by one).
*
* @param refArray the reference array.
* @param a an array of indices into refArray.
* @param c the comparator used in this queue, or null for the natural order.
*/
public DoubleHeapIndirectPriorityQueue( final double[] refArray, final int[] a, final DoubleComparator c ) {
this( refArray, a, a.length, c );
}
/** Wraps a given array in a queue using the natural order.
*
*
The queue returned by this method will be backed by the given array.
* The first size element of the array will be rearranged so to form a heap (this is
* more efficient than enqueing the elements of a one by one).
*
* @param refArray the reference array.
* @param a an array of indices into refArray.
* @param size the number of elements to be included in the queue.
*/
public DoubleHeapIndirectPriorityQueue( final double[] refArray, final int[] a, int size ) {
this( refArray, a, size, null );
}
/** Wraps a given array in a queue using the natural order.
*
*
The queue returned by this method will be backed by the given array.
* The elements of the array will be rearranged so to form a heap (this is
* more efficient than enqueing the elements of a one by one).
*
* @param refArray the reference array.
* @param a an array of indices into refArray.
*/
public DoubleHeapIndirectPriorityQueue( final double[] refArray, final int[] a ) {
this( refArray, a, a.length );
}
@SuppressWarnings("unchecked")
public void enqueue( final int x ) {
if ( inv[ x ] >= 0 ) throw new IllegalArgumentException( "Index " + x + " belongs to the queue" );
if ( size == heap.length ) heap = IntArrays.grow( heap, size + 1 );
inv[ heap[ size ] = x ] = size++;
DoubleIndirectHeaps.upHeap( refArray, heap, inv, size, size - 1, c );
}
public boolean contains( final int index ) {
return inv[ index ] >= 0;
}
public int dequeue() {
if ( size == 0 ) throw new NoSuchElementException();
final int result = heap[ 0 ];
if ( --size != 0 ) inv[ heap[ 0 ] = heap[ size ] ] = 0;
inv[ result ] = -1;
if ( size != 0 ) DoubleIndirectHeaps.downHeap( refArray, heap, inv, size, 0, c );
return result;
}
public void changed() {
DoubleIndirectHeaps.downHeap( refArray, heap, inv, size, 0, c );
}
public void changed( final int index ) {
final int pos = inv[ index ];
if ( pos < 0 ) throw new IllegalArgumentException( "Index " + index + " does not belong to the queue" );
final int newPos = DoubleIndirectHeaps.upHeap( refArray, heap, inv, size, pos, c );
DoubleIndirectHeaps.downHeap( refArray, heap, inv, size, newPos, c );
}
/** Rebuilds this heap in a bottom-up fashion.
*/
public void allChanged() {
DoubleIndirectHeaps.makeHeap( refArray, heap, inv, size, c );
}
public boolean remove( final int index ) {
final int result = inv[ index ];
if ( result < 0 ) return false;
inv[ index ] = -1;
if ( result < --size ) {
inv[ heap[ result ] = heap[ size ] ] = result;
final int newPos = DoubleIndirectHeaps.upHeap( refArray, heap, inv, size, result, c );
DoubleIndirectHeaps.downHeap( refArray, heap, inv, size, newPos, c );
}
return true;
}
public void clear() {
size = 0;
IntArrays.fill( inv, -1 );
}
}