net.automatalib.commons.smartcollections.BinaryHeap Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of automata-commons-smartcollections Show documentation
Show all versions of automata-commons-smartcollections Show documentation
This artifact provides efficient implementations for various collection data structures
(esp. linked lists and priority queues), which have very insufficient implementation in
the Java Collections Framework that makes it hard or even impossible to exploit their
efficiencies.
/* Copyright (C) 2013-2018 TU Dortmund
* This file is part of AutomataLib, http://www.automatalib.net/.
*
* 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 net.automatalib.commons.smartcollections;
import java.util.Collection;
import java.util.Comparator;
import java.util.Iterator;
import java.util.NoSuchElementException;
import java.util.PriorityQueue;
import java.util.Queue;
import net.automatalib.commons.util.array.ResizingObjectArray;
import net.automatalib.commons.util.comparison.CmpUtil;
/**
* A {@link PriorityQueue} implementation using a binary heap.
*
* @param
* element class.
*
* @author Malte Isberner
*/
public class BinaryHeap extends AbstractSmartCollection
implements SmartDynamicPriorityQueue, CapacityManagement, Queue {
private static final int DEFAULT_INITIAL_CAPACITY = 10;
private final Comparator comparator;
// Entry storage.
private final ResizingObjectArray entries;
// Number of entries in the queue.
private int size;
protected BinaryHeap(int initCapacity, Collection initValues, Comparator comparator) {
this(initCapacity < initValues.size() ? initValues.size() : initCapacity, comparator);
int i = 0;
for (E e : initValues) {
entries.array[i++] = new Reference<>(0, e);
}
buildHeap(initValues.size());
}
protected BinaryHeap(int initialCapacity, Comparator comparator) {
this.entries = new ResizingObjectArray(initialCapacity);
this.comparator = comparator;
}
private void buildHeap(int numElements) {
size = numElements;
for (int i = numElements / 2; i >= 0; i--) {
downHeap(i);
}
}
/**
* Move an element downwards inside the heap, until all of its children have a key greater or equal to its own.
*/
@SuppressWarnings("unchecked")
private void downHeap(int idx) {
Reference e = (Reference) entries.array[idx];
int iter = idx;
while (hasChildren(iter)) {
int cidx = leftChild(iter);
Reference c = (Reference) entries.array[cidx];
if (hasRightChild(iter)) {
int rcidx = rightChild(iter);
Reference rc = (Reference) entries.array[rcidx];
if (compare(rc, c) < 0) {
cidx = rcidx;
c = rc;
}
}
if (compare(e, c) <= 0) {
break;
}
entries.array[cidx] = e;
entries.array[iter] = c;
c.index = iter;
iter = cidx;
}
e.index = iter;
}
/**
* Checks whether the entry at the specified index has at least one child.
*/
private boolean hasChildren(int idx) {
return idx * 2 < size;
}
/**
* Retrieves the index of the left child of a given parent index.
*/
private static int leftChild(int parent) {
return 2 * parent;
}
/**
* Checks whether the entry at the specified index has two children.
*/
private boolean hasRightChild(int idx) {
return idx * 2 + 1 < size;
}
/**
* Retrieves the index of the right child of a given parent index.
*/
private static int rightChild(int parent) {
return 2 * parent + 1;
}
/**
* Compares the referenced elements.
*/
private int compare(Reference e1, Reference e2) {
return comparator.compare(e1.element, e2.element);
}
public static > BinaryHeap create() {
return new BinaryHeap<>(DEFAULT_INITIAL_CAPACITY, CmpUtil.naturalOrderingComparator());
}
public static > BinaryHeap create(int initialCapacity) {
return new BinaryHeap<>(initialCapacity, CmpUtil.naturalOrderingComparator());
}
public static > BinaryHeap create(Collection initValues) {
return new BinaryHeap<>(0, initValues, CmpUtil.naturalOrderingComparator());
}
public static > BinaryHeap create(int initialCapacity,
Collection initValues) {
return new BinaryHeap<>(initialCapacity, initValues, CmpUtil.naturalOrderingComparator());
}
public static BinaryHeap createCmp(Comparator comparator) {
return new BinaryHeap<>(DEFAULT_INITIAL_CAPACITY, comparator);
}
public static BinaryHeap createCmp(Comparator comparator, int initialCapacity) {
return new BinaryHeap<>(initialCapacity, comparator);
}
public static BinaryHeap createCmp(Comparator comparator, Collection initValues) {
return new BinaryHeap<>(0, initValues, comparator);
}
public static BinaryHeap createCmp(Comparator comparator,
int initialCapacity,
Collection initValues) {
return new BinaryHeap<>(initialCapacity, initValues, comparator);
}
@Override
public int size() {
return size;
}
@Override
public E get(ElementReference ref) {
return BinaryHeap.asHeapRef(ref).element;
}
@SuppressWarnings("unchecked")
private static Reference asHeapRef(ElementReference ref) {
if (ref.getClass() != Reference.class) {
throw new InvalidReferenceException(
"Reference is of wrong class '" + ref.getClass().getName() + "', should be " +
Reference.class.getName() + ".");
}
return (Reference) ref;
}
@Override
public Reference referencedAdd(E elem) {
ensureCapacity(size + 1);
Reference entry = new Reference<>(size, elem);
entries.array[size] = entry;
upHeap(size++);
return entry;
}
@Override
public void remove(ElementReference ref) {
remove(asHeapRef(ref).index);
}
/**
* Removes the element at the specified index from the heap. This is done by simulating a key decrease to -infinity
* and then performing extractMin.
*/
private void remove(int index) {
forceToTop(index);
extractMin();
}
@Override
public E remove() {
return extractMin();
}
@SuppressWarnings("unchecked")
private void forceToTop(int idx) {
Reference e = (Reference) entries.array[idx];
int iter = idx;
while (hasParent(iter)) {
int pidx = parent(iter);
Reference p = (Reference) entries.array[pidx];
entries.array[pidx] = e;
entries.array[iter] = p;
p.index = iter;
iter = parent(iter);
}
e.index = iter;
}
@Override
public Iterator referenceIterator() {
return new ReferenceIterator();
}
@Override
public void replace(ElementReference ref, E newElement) {
Reference heapRef = asHeapRef(ref);
heapRef.element = newElement;
keyChanged(ref);
}
@Override
public void keyChanged(ElementReference ref) {
keyChanged(asHeapRef(ref).index);
}
public void keyChanged(int index) {
upHeap(index);
downHeap(index);
}
@Override
public boolean ensureCapacity(int minCapacity) {
return entries.ensureCapacity(minCapacity);
}
/**
* Move an element upwards inside the heap, until it has a parent with a key less or equal to its own.
*/
@SuppressWarnings("unchecked")
private void upHeap(int idx) {
Reference e = (Reference) entries.array[idx];
int iter = idx;
while (hasParent(iter)) {
int pidx = parent(iter);
Reference p = (Reference) entries.array[pidx];
if (compare(e, p) < 0) {
entries.array[pidx] = e;
entries.array[iter] = p;
p.index = iter;
iter = parent(iter);
} else {
break;
}
}
e.index = iter;
}
/**
* Checks if the specified index has a parent.
*/
private static boolean hasParent(int idx) {
return idx > 0;
}
/**
* Retrieves, for a given child index, its parent index.
*/
private static int parent(int child) {
return child / 2;
}
@Override
public boolean ensureAdditionalCapacity(int additionalCapacity) {
return ensureCapacity(size + additionalCapacity);
}
@Override
public void hintNextCapacity(int nextCapacityHint) {
entries.hintNextCapacity(nextCapacityHint);
}
@Override
public void quickClear() {
size = 0;
}
@Override
public void deepClear() {
entries.setAll(null);
}
@Override
public boolean offer(E e) {
add(e);
return true;
}
@Override
public E poll() {
if (size > 0) {
return extractMin();
}
return null;
}
@Override
public E element() {
return peekMin();
}
@Override
@SuppressWarnings("unchecked")
public E peekMin() {
if (size <= 0) {
throw new NoSuchElementException();
}
return ((Reference) entries.array[0]).element;
}
@Override
@SuppressWarnings("unchecked")
public E extractMin() {
if (size <= 0) {
throw new NoSuchElementException();
}
E min = ((Reference) entries.array[0]).element;
entries.array[0] = entries.array[--size];
entries.array[size] = null;
if (size > 0) {
downHeap(0);
}
return min;
}
@Override
public E peek() {
if (size > 0) {
return peekMin();
}
return null;
}
/**
* Class for entries in a priority queue. Entry objects are returned by the {@link
* SmartDynamicPriorityQueue#insert(Comparable)} method and are passed to the {@link
* SmartDynamicPriorityQueue#keyChanged(Reference)} method. The usage of entry objects eliminates the necessity of
* an extra element to index mapping.
*
* @param
* element class.
*
* @author Malte Isberner
*/
private static final class Reference implements ElementReference {
private int index;
private E element;
/**
* Constructor.
*
* @param index
* the index of the entry inside the queue.
* @param element
* the element stored in this entry.
*/
protected Reference(int index, E element) {
this.element = element;
this.index = index;
}
}
private class ReferenceIterator implements Iterator {
private int current;
@Override
public boolean hasNext() {
return (current < size);
}
@Override
public ElementReference next() {
if (current >= size) {
throw new NoSuchElementException();
}
return (ElementReference) entries.array[current++];
}
@Override
public void remove() {
BinaryHeap.this.remove(--current);
}
}
}