
T - public class SmallestN<T> extends Object implements Collector<T,MinMaxPriorityQueue<T>,MinMaxPriorityQueue<T>>
Collector that returns the desired number of the smallest
elements of a Stream into a Guava's MinMaxPriorityQueue.Collector.Characteristics| Modifier and Type | Field and Description |
|---|---|
private static Set<Collector.Characteristics> |
CHARACT |
private Comparator<T> |
comparator |
private int |
max |
| Constructor and Description |
|---|
SmallestN(int maxElements)
No comparator supplied: natural ordering is used.
|
SmallestN(int maxElements,
Comparator<T> comparator) |
| Modifier and Type | Method and Description |
|---|---|
BiConsumer<MinMaxPriorityQueue<T>,T> |
accumulator() |
Set<Collector.Characteristics> |
characteristics() |
BinaryOperator<MinMaxPriorityQueue<T>> |
combiner() |
Function<MinMaxPriorityQueue<T>,MinMaxPriorityQueue<T>> |
finisher() |
Supplier<MinMaxPriorityQueue<T>> |
supplier() |
private static final Set<Collector.Characteristics> CHARACT
private final int max
private final Comparator<T> comparator
public SmallestN(int maxElements)
maxElements - the maximum number of desired elementspublic SmallestN(int maxElements,
Comparator<T> comparator)
maxElements - the maximum number of desired elementscomparator - the comparator to be usedpublic Supplier<MinMaxPriorityQueue<T>> supplier()
supplier in interface Collector<T,MinMaxPriorityQueue<T>,MinMaxPriorityQueue<T>>public BiConsumer<MinMaxPriorityQueue<T>,T> accumulator()
accumulator in interface Collector<T,MinMaxPriorityQueue<T>,MinMaxPriorityQueue<T>>public BinaryOperator<MinMaxPriorityQueue<T>> combiner()
combiner in interface Collector<T,MinMaxPriorityQueue<T>,MinMaxPriorityQueue<T>>public Function<MinMaxPriorityQueue<T>,MinMaxPriorityQueue<T>> finisher()
finisher in interface Collector<T,MinMaxPriorityQueue<T>,MinMaxPriorityQueue<T>>public Set<Collector.Characteristics> characteristics()
characteristics in interface Collector<T,MinMaxPriorityQueue<T>,MinMaxPriorityQueue<T>>