List of usage examples for java.util SortedSet interface-usage
From source file de.dhke.projects.cutil.collections.immutable.GenericImmutableSortedSet.java
/**
*
* @param <T>
* @param <S>
* @author Peter Wullinger <java@dhke.de>
*/
From source file ShortPriorityQueue.java
/**
* A {@code ShortPriorityQueue<E>} is a length-bounded priority queue
* optimized for short lengths. Rather than maintaining tree or heap
* data structures, it keeps elements in an array and uses a simple
* bubble sort.
*
From source file BoundedPriorityQueue.java
/**
* A <code>BoundedPriorityQueue</code> implements a priority queue
* with an upper bound on the number of elements. If the queue is not
* full, added elements are always added. If the queue is full and
* the added element is greater than the smallest element in the
* queue, the smallest element is removed and the new element is