E- element class.
public interface SmartDynamicPriorityQueue<E> extends SmartPriorityQueue<E>
A priority queue is a queue which supports removal of the element with the minimal key value (wrt. natural ordering
or an explicitly specified
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.
|Modifier and Type||Method and Description|
Notifies the implementation that the key of an element has changed.
addAll, addAll, choose, chooseRef, deepClear, find, get, quickClear, referencedAdd, referenceIterator, references, remove, remove, replace
add, addAll, clear, contains, containsAll, equals, hashCode, isEmpty, iterator, parallelStream, removeAll, removeIf, retainAll, size, spliterator, stream, toArray, toArray
void keyChanged(ElementReference reference)
reference- the reference for the element whose key has changed.
Copyright © 2020. All rights reserved.