Class PriorityQueue<T>

java.lang.Object
org.carrot2.util.PriorityQueue<T>

public abstract class PriorityQueue<T> extends Object
A PriorityQueue maintains a partial ordering of its elements such that the least element can always be found in constant time. Put()'s and pop()'s require log(size) time.

NOTE: This class pre-allocates a full array of length maxSize+1, in initialize(int).