com.github.davidmoten.rtree.internal.util

Class BoundedPriorityQueue<T>

java.lang.Object

com.github.davidmoten.rtree.internal.util.BoundedPriorityQueue<T>

public final class BoundedPriorityQueue<T>
extends Object

Constructor Summary

Constructors

Constructor and Description
BoundedPriorityQueue(int maxSize, Comparator<? super T> comparator) Constructs a BoundedPriorityQueue with the specified maxSize and comparator.

Method Summary

Modifier and Type	Method and Description
void	add(T t) Adds an element to the queue.
List<T>	asList()
List<T>	asOrderedList()
static <T> BoundedPriorityQueue<T>	create(int maxSize, Comparator<? super T> comparator)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

BoundedPriorityQueue

public BoundedPriorityQueue(int maxSize,
                            Comparator<? super T> comparator)

Constructs a BoundedPriorityQueue with the specified maxSize and comparator.

Parameters:

maxSize - - The maximum size the queue can reach, must be a positive integer.

comparator - - The comparator to be used to compare the elements in the queue, must be non-null.

Method Detail

create

public static <T> BoundedPriorityQueue<T> create(int maxSize,
                                                 Comparator<? super T> comparator)

add

public void add(T t)

Adds an element to the queue. If the queue contains maxSize elements, e will be compared to the lowest element in the queue using comparator. If e is greater than or equal to the lowest element, that element will be removed and e will be added instead. Otherwise, the queue will not be modified and e will not be added.

Parameters:

t - - Element to be added, must be non-null.

asList

public List<T> asList()

Returns:

Returns a view of the queue as a Collections.unmodifiableList(java.util.List) unmodifiableList sorted in reverse order.

asOrderedList

public List<T> asOrderedList()