util.queue

Interface PriorityQueue<T>

Type Parameters:

T - the type of the elements to be stored in the priority queue

All Superinterfaces:

SoftPriorityQueue<T>

All Known Subinterfaces:

ExtendedPriorityQueue<T>

All Known Implementing Classes:

BinaryHeap, FibonacciHeap, KAryHeap

public interface PriorityQueue<T>
extends SoftPriorityQueue<T>

In contrast to soft priority queues, "standard" priority queues have to be exact. That means, that at any given point the number of corrupted elements has to be zero.

Method Summary

Modifier and Type	Method and Description
default java.util.Collection<T>	corrupted() Returns a Collection of corrupted elements -- that is, elements which are associated with the wrong key.

Methods inherited from interface util.queue.SoftPriorityQueue

empty, insert, peek, pop, size

Method Detail

corrupted

default java.util.Collection<T> corrupted()

Description copied from interface: SoftPriorityQueue

Returns a Collection of corrupted elements -- that is, elements which are associated with the wrong key.

Specified by:

corrupted in interface SoftPriorityQueue<T>

Returns:

a Collection of corrupted elements