Class MinMaxPriorityQueue.Builder<B>

java.lang.Object
com.google.common.collect.MinMaxPriorityQueue.Builder<B>
Type Parameters:
B - the upper bound on the eventual type that can be produced by this builder (for example, a Builder<Number> can produce a Queue<Number> or Queue<Integer> but not a Queue<Object>).
Enclosing class:
MinMaxPriorityQueue<E>
public static final class MinMaxPriorityQueue.Builder<B> extends Object
The builder class used in creation of min-max priority queues. Instead of constructing one directly, use MinMaxPriorityQueue.orderedBy(Comparator), MinMaxPriorityQueue.expectedSize(int) or MinMaxPriorityQueue.maximumSize(int).
Since:
8.0
Author:
Sverre Sundsdal, Torbjorn Gannholm

  • Method Details

    • expectedSize

      @CanIgnoreReturnValue public MinMaxPriorityQueue.Builder<B> expectedSize(int expectedSize)
      Configures this builder to build min-max priority queues with an initial expected size of expectedSize.

    • maximumSize

      @CanIgnoreReturnValue public MinMaxPriorityQueue.Builder<B> maximumSize(int maximumSize)
      Configures this builder to build MinMaxPriorityQueue instances that are limited to maximumSize 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.

    • create

      public <T extends B> MinMaxPriorityQueue<T> create()
      Builds a new min-max priority queue using the previously specified options, and having no initial contents.

    • create

      public <T extends B> MinMaxPriorityQueue<T> create(Iterable<? extends T> initialContents)
      Builds a new min-max priority queue using the previously specified options, and having the given initial elements.