T extends MergeablePriorityQueueDouble<E, T>>
- Type Parameters:
E- The type of object contained in the PriorityQueueDouble.
T- The type of MergeablePriorityQueueDouble supported by the merge
- All Superinterfaces:
- All Known Implementing Classes:
public interface MergeablePriorityQueueDouble<E,
T extends MergeablePriorityQueueDouble<E,
extends PriorityQueueDouble<E> T>>
A MergeablePriorityQueueDouble is a PriorityQueueDouble that includes a merge method.
Methods inherited from interface java.util.Collection
equals, hashCode, parallelStream, removeIf, spliterator, stream, toArray
Methods inherited from interface org.cicirello.ds.PriorityQueueDouble
add, add, addAll, change, clear, contains, containsAll, demote, element, isEmpty, iterator, offer, offer, peek, peekElement, peekPriority, peekPriority, poll, pollElement, pollThenAdd, pollThenAdd, promote, remove, remove, removeAll, removeElement, retainAll, size, toArray, toArray
(T other)Merges another priority queue into this one, adding all of its (element, priority) pairs. This is a destructive operation with no guarantees to the state of the other priority queue upon completion. Additionally, some implementations of this method may assume that
thisdo not share any elements, and the priority queue may become unstable if they do. The priority order of both priority queues must be the same (e.g., both minheaps or both maxheaps).
other- The priority queue that you want to merge into
this. Implementations need not make any guarantees as to the state of
- true if and only if this priority queue changed as a result of the merge