net.automatalib.commons.smartcollections

Interface SmartDynamicPriorityQueue<E>

Type Parameters:

E - element class.

All Superinterfaces:

Collection<E>, Iterable<E>, SmartCollection<E>, SmartPriorityQueue<E>

All Known Implementing Classes:

BinaryHeap

public interface SmartDynamicPriorityQueue<E>
extends SmartPriorityQueue<E>

A priority queue interface. A priority queue is a queue which supports removal of the element with the minimal key value (wrt. natural ordering or an explicitly specified Comparator). This interface extends the functionality of the standard PriorityQueue in the way that it allows dynamic behavior: The ordering of the elements in the queue is allowed to change. The only restriction is that whenever the key which is used for comparison changes, the method keyChanged(ElementReference) has to be called with the reference of the respective element.

Author:

Malte Isberner

Method Summary

Methods

Modifier and Type	Method and Description
void	keyChanged(ElementReference reference) Notifies the implementation that the key of an element has changed.

Methods inherited from interface net.automatalib.commons.smartcollections.SmartPriorityQueue

extractMin, peekMin

Methods inherited from interface net.automatalib.commons.smartcollections.SmartCollection

addAll, addAll, choose, chooseRef, deepClear, find, get, quickClear, referencedAdd, referenceIterator, references, remove, remove, replace

Methods inherited from interface java.util.Collection

add, addAll, clear, contains, containsAll, equals, hashCode, isEmpty, iterator, removeAll, retainAll, size, toArray, toArray

Method Detail

keyChanged

void keyChanged(ElementReference reference)

Notifies the implementation that the key of an element has changed.

Parameters:

reference - the reference for the element whose key has changed.