Class MinMaxPriorityQueue<E>
-
- <E>
-
- <E>
-
- com.google.common.collect.MinMaxPriorityQueue<E>
-
- All Implemented Interfaces:
<E>
,<E>
,<E>
@Beta @GwtCompatible public final class MinMaxPriorityQueue<E> extends <E>
A double-ended priority queue, which provides constant-time access to both its least element and its greatest element, as determined by the queue's specified comparator. If no comparator is given at creation time, the natural order of elements is used. If no maximum size is given at creation time, the queue is unbounded.Usage example:
MinMaxPriorityQueue<User> users = MinMaxPriorityQueue.orderedBy(userComparator) .maximumSize(1000) .create();
As a it functions exactly as a : its head element -- the implicit target of the methods -- is defined as the least element in the queue according to the queue's comparator. But unlike a regular priority queue, the methods
peekLast()
,pollLast()
andremoveLast()
are also provided, to act on the greatest element in the queue instead.A min-max priority queue can be configured with a maximum size. If so, each time the size of the queue exceeds that value, the queue automatically removes its greatest element according to its comparator (which might be the element that was just added). This is different from conventional bounded queues, which either block or reject new elements when full.
This implementation is based on the developed by Atkinson, et al. Unlike many other double-ended priority queues, it stores elements in a single array, as compact as the traditional heap data structure used in .
This class is not thread-safe, and does not accept null elements.
Performance notes:
- If you only access one end of the queue, and do use a maximum size, this class will perform
significantly worse than a
PriorityQueue
with manual eviction above the maximum size. In many casesOrdering.leastOf(java.lang.Iterable<E>, int)
may work for your use case with significantly improved (and asymptotically superior) performance. - The retrieval operations , and
size
are constant-time. - The enqueuing and dequeuing operations (
offer(E)
,add(E)
, and all the forms of ) run inO(log n) time
. - The and operations require linear (
O(n)
) time. - If you only access one end of the queue, and don't use a maximum size, this class is functionally equivalent to , but significantly slower.
- Since:
- 8.0
- Author:
- Sverre Sundsdal, Torbjorn Gannholm
-
-
Nested Class Summary
Nested Classes Modifier and Type Class Description static class
MinMaxPriorityQueue.Builder<B>
The builder class used in creation of min-max priority queues.
-
Method Summary
All Methods Static Methods Instance Methods Concrete Methods Modifier and Type Method Description boolean
add(E element)
Adds the given element to this queue.boolean
<? extends E> newElements)
Adds all of the elements in the specified collection to this queue.void
clear()
Removes all of the elements from this queue.<? super E>
comparator()
Returns the comparator used to order the elements in this queue.static <E extends <E>>
MinMaxPriorityQueue<E>create()
Creates a new min-max priority queue with default settings: natural order, no maximum size, no initial contents, and an initial expected size of 11.static <E extends <E>>
MinMaxPriorityQueue<E><? extends E> initialContents)
Creates a new min-max priority queue using natural order, no maximum size, and initially containing the given elements.static >
expectedSize(int expectedSize)
Creates and returns a new builder, configured to buildMinMaxPriorityQueue
instances sized appropriately to holdexpectedSize
elements.<E>
iterator()
Returns an iterator over the elements contained in this collection, in no particular order.static >
maximumSize(int maximumSize)
Creates and returns a new builder, configured to buildMinMaxPriorityQueue
instances that are limited tomaximumSize
elements.boolean
offer(E element)
Adds the given element to this queue.static <B> MinMaxPriorityQueue.Builder<B>
<B> comparator)
Creates and returns a new builder, configured to buildMinMaxPriorityQueue
instances that usecomparator
to determine the least and greatest elements.E
peek()
Retrieves, but does not remove, the head of this queue, or returnsnull
if this queue is empty.E
peekFirst()
Retrieves, but does not remove, the least element of this queue, or returnsnull
if the queue is empty.E
peekLast()
Retrieves, but does not remove, the greatest element of this queue, or returnsnull
if the queue is empty.E
poll()
Retrieves and removes the head of this queue, or returnsnull
if this queue is empty.E
pollFirst()
Removes and returns the least element of this queue, or returnsnull
if the queue is empty.E
pollLast()
Removes and returns the greatest element of this queue, or returnsnull
if the queue is empty.E
removeFirst()
Removes and returns the least element of this queue.E
removeLast()
Removes and returns the greatest element of this queue.int
size()
Returns the number of elements in this collection.[]
toArray()
Returns an array containing all of the elements in this collection.
-
-
-
Method Detail
-
create
public static <E extends <E>> MinMaxPriorityQueue<E> create()
Creates a new min-max priority queue with default settings: natural order, no maximum size, no initial contents, and an initial expected size of 11.
-
create
public static <E extends <E>> <? extends E> initialContents)
Creates a new min-max priority queue using natural order, no maximum size, and initially containing the given elements.
-
orderedBy
public static <B> <B> comparator)
Creates and returns a new builder, configured to buildMinMaxPriorityQueue
instances that usecomparator
to determine the least and greatest elements.
-
expectedSize
public static > expectedSize(int expectedSize)
Creates and returns a new builder, configured to buildMinMaxPriorityQueue
instances sized appropriately to holdexpectedSize
elements.
-
maximumSize
public static > maximumSize(int maximumSize)
Creates and returns a new builder, configured to buildMinMaxPriorityQueue
instances that are limited tomaximumSize
elements. Each time a queue grows beyond this bound, it immediately removes its greatest element (according to its comparator), which might be the element that was just added.
-
size
public int size()
Description copied from interface:Returns the number of elements in this collection. If this collection contains more thanInteger.MAX_VALUE
elements, returnsInteger.MAX_VALUE
.
-
add
public boolean add(E element)
Adds the given element to this queue. If this queue has a maximum size, after addingelement
the queue will automatically evict its greatest element (according to its comparator), which may beelement
itself.
-
addAll
public boolean <? extends E> newElements)
Description copied from class:Adds all of the elements in the specified collection to this queue. Attempts to addAll of a queue to itself result inIllegalArgumentException
. Further, the behavior of this operation is undefined if the specified collection is modified while the operation is in progress.This implementation iterates over the specified collection, and adds each element returned by the iterator to this queue, in turn. A runtime exception encountered while trying to add an element (including, in particular, a
null
element) may result in only some of the elements having been successfully added when the associated exception is thrown.
-
offer
public boolean offer(E element)
Adds the given element to this queue. If this queue has a maximum size, after addingelement
the queue will automatically evict its greatest element (according to its comparator), which may beelement
itself.- Parameters:
element
- the element to add- Returns:
true
if the element was added to this queue, elsefalse
-
poll
public E poll()
Description copied from interface:Retrieves and removes the head of this queue, or returnsnull
if this queue is empty.- Returns:
- the head of this queue, or
null
if this queue is empty
-
peek
public E peek()
Description copied from interface:Retrieves, but does not remove, the head of this queue, or returnsnull
if this queue is empty.- Returns:
- the head of this queue, or
null
if this queue is empty
-
pollFirst
public E pollFirst()
Removes and returns the least element of this queue, or returnsnull
if the queue is empty.
-
removeFirst
public E removeFirst()
Removes and returns the least element of this queue.- Throws:
- if the queue is empty
-
peekFirst
public E peekFirst()
Retrieves, but does not remove, the least element of this queue, or returnsnull
if the queue is empty.
-
pollLast
public E pollLast()
Removes and returns the greatest element of this queue, or returnsnull
if the queue is empty.
-
removeLast
public E removeLast()
Removes and returns the greatest element of this queue.- Throws:
- if the queue is empty
-
peekLast
public E peekLast()
Retrieves, but does not remove, the greatest element of this queue, or returnsnull
if the queue is empty.
-
iterator
public <E> iterator()
Returns an iterator over the elements contained in this collection, in no particular order.The iterator is fail-fast: If the MinMaxPriorityQueue is modified at any time after the iterator is created, in any way except through the iterator's own remove method, the iterator will generally throw a . Thus, in the face of concurrent modification, the iterator fails quickly and cleanly, rather than risking arbitrary, non-deterministic behavior at an undetermined time in the future.
Note that the fail-fast behavior of an iterator cannot be guaranteed as it is, generally speaking, impossible to make any hard guarantees in the presence of unsynchronized concurrent modification. Fail-fast iterators throw
ConcurrentModificationException
on a best-effort basis. Therefore, it would be wrong to write a program that depended on this exception for its correctness: the fail-fast behavior of iterators should be used only to detect bugs.
-
clear
public void clear()
Description copied from class:Removes all of the elements from this queue. The queue will be empty after this call returns.This implementation repeatedly invokes until it returns
null
.
-
toArray
public [] toArray()
Description copied from class:Returns an array containing all of the elements in this collection. If this collection makes any guarantees as to what order its elements are returned by its iterator, this method must return the elements in the same order. The returned array's isObject
.The returned array will be "safe" in that no references to it are maintained by this collection. (In other words, this method must allocate a new array even if this collection is backed by an array). The caller is thus free to modify the returned array.
-
comparator
public <? super E> comparator()
Returns the comparator used to order the elements in this queue. Obeys the general contract of , but returnsOrdering.natural()
instead ofnull
to indicate natural ordering.
-
-