public final class ToSet<E> extends Object
| 限定符和类型 | 方法和说明 |
|---|---|
ToSet<E> |
add(Collection<? extends E> c) |
<EE extends E> |
add(EE e) |
static <E> Set<E> |
asSet(E... es) |
<T> T |
build() |
static <E> Set<E> |
collect(Stream<E> stream)
如果不使用LinkedHashSet收集,则完全可以使用原生的Collectors.toSet()
|
static <E> Set<E> |
collect(Stream<E> stream,
boolean dummy) |
static <E> Set<E> |
collect(Stream<E> stream,
boolean dummy,
int extra)
无法确定元素个数时的流收集
|
static <E> Set<E> |
collect(Stream<E> stream,
int extra) |
static <E> Collector<E,?,Set<E>> |
collector() |
static <E> Collector<E,?,Set<E>> |
collector(boolean dummy)
无法确定元素个数时的收集器
|
static <E> Collector<E,?,Set<E>> |
collector(int initialCapacity) |
static <E> Collector<E,?,Set<E>> |
collector(int initialCapacity,
int idx) |
static <E,R extends Set<E>> |
collector(int initialCapacity,
int idx,
boolean dummy)
大致确定元素个数时的收集器
|
static <E,R extends Set<E>> |
collector(Supplier<R> supplier) |
static <E> Set<E> |
explicitCollect(Stream<E> stream,
int initialCapacity) |
static <E> Set<E> |
explicitCollect(Stream<E> stream,
int initialCapacity,
int idx,
boolean dummy)
大致确定元素个数时的流收集
|
static <E> ToSet<E> |
get(int initialCapacity) |
static <E> ToSet<E> |
get(int initialCapacity,
int idx) |
static <E> ToSet<E> |
get(int initialCapacity,
int idx,
boolean dummy) |
public static <E> ToSet<E> get(int initialCapacity, int idx, boolean dummy)
public static <E> ToSet<E> get(int initialCapacity, int idx)
public static <E> ToSet<E> get(int initialCapacity)
public <T> T build()
public ToSet<E> add(Collection<? extends E> c)
public static <E,R extends Set<E>> Collector<E,?,R> collector(int initialCapacity, int idx, boolean dummy)
initialCapacity - 大致确定的初始容量idx - 初始容量衰减次数dummy - 是否排序的public static <E> Set<E> explicitCollect(Stream<E> stream, int initialCapacity, int idx, boolean dummy)
public static <E> Set<E> collect(Stream<E> stream, boolean dummy, int extra)
dummy - 是否排序的extra - 申请额外空间public static <E> Set<E> collect(Stream<E> stream)
public static <E> Set<E> asSet(E... es)
Copyright © 2022. All rights reserved.