Package | Description |
---|---|
io.vavr | |
io.vavr.collection |
Purely functional collections based on Traversable.
|
Modifier and Type | Method and Description |
---|---|
static <T> Set<T> |
API.LinkedSet()
Alias for
LinkedHashSet.empty() |
static <T> Set<T> |
API.LinkedSet(T... elements)
Alias for
LinkedHashSet.of(Object...) |
static <T> Set<T> |
API.LinkedSet(T element)
Alias for
LinkedHashSet.of(Object) |
static <T> Set<T> |
API.Set()
Alias for
HashSet.empty() |
static <T> Set<T> |
API.Set(T... elements)
Alias for
HashSet.of(Object...) |
static <T> Set<T> |
API.Set(T element)
Alias for
HashSet.of(Object) |
default Set<T> |
Value.toLinkedSet()
Converts this to a
Set . |
default Set<T> |
Value.toSet()
Converts this to a
Set . |
Modifier and Type | Interface and Description |
---|---|
interface |
BitSet<T>
An immutable
BitSet implementation. |
interface |
SortedSet<T>
An immutable
SortedSet interface. |
Modifier and Type | Class and Description |
---|---|
class |
HashSet<T>
An immutable
HashSet implementation. |
class |
LinkedHashSet<T>
An immutable
HashSet implementation that has predictable (insertion-order) iteration. |
class |
TreeSet<T>
SortedSet implementation, backed by a Red/Black Tree.
|
Modifier and Type | Method and Description |
---|---|
Set<T> |
Set.add(T element)
Add the given element to this set, if it is not already contained.
|
Set<T> |
Set.addAll(Iterable<? extends T> elements)
Adds all of the given elements to this set, if not already contained.
|
<R> Set<R> |
Set.collect(PartialFunction<? super T,? extends R> partialFunction) |
Set<T> |
Set.diff(Set<? extends T> that)
Calculates the difference between this set and another set.
|
Set<T> |
Set.distinct() |
Set<T> |
Set.distinctBy(Comparator<? super T> comparator) |
<U> Set<T> |
Set.distinctBy(Function<? super T,? extends U> keyExtractor) |
Set<T> |
Set.drop(int n) |
Set<T> |
Set.dropRight(int n) |
Set<T> |
Set.dropUntil(Predicate<? super T> predicate) |
Set<T> |
Set.dropWhile(Predicate<? super T> predicate) |
Set<T> |
Set.filter(Predicate<? super T> predicate) |
<U> Set<U> |
Set.flatMap(Function<? super T,? extends Iterable<? extends U>> mapper) |
Set<T> |
Set.init() |
Set<T> |
Set.intersect(Set<? extends T> that)
Computes the intersection between this set and another set.
|
Set<K> |
Map.keySet()
Returns the keys contained in this map.
|
Set<K> |
LinkedHashMap.keySet() |
Set<K> |
HashMap.keySet() |
Set<K> |
Multimap.keySet()
Returns the keys contained in this multimap.
|
<U> Set<U> |
Set.map(Function<? super T,? extends U> mapper) |
static <T> Set<T> |
Set.narrow(Set<? extends T> set)
Narrows a widened
Set<? extends T> to Set<T>
by performing a type-safe cast. |
Set<T> |
Set.orElse(Iterable<? extends T> other) |
Set<T> |
Set.orElse(Supplier<? extends Iterable<? extends T>> supplier) |
Set<T> |
Set.peek(Consumer<? super T> action) |
Set<T> |
Set.remove(T element)
Removes a specific element from this set, if present.
|
Set<T> |
Set.removeAll(Iterable<? extends T> elements)
Removes all of the given elements from this set, if present.
|
Set<T> |
Set.replace(T currentElement,
T newElement) |
Set<T> |
Set.replaceAll(T currentElement,
T newElement) |
Set<T> |
Set.retainAll(Iterable<? extends T> elements) |
Set<T> |
Set.scan(T zero,
BiFunction<? super T,? super T,? extends T> operation) |
<U> Set<U> |
Set.scanLeft(U zero,
BiFunction<? super U,? super T,? extends U> operation) |
default <U> Set<U> |
BitSet.scanLeft(U zero,
BiFunction<? super U,? super T,? extends U> operation) |
<U> Set<U> |
TreeSet.scanLeft(U zero,
BiFunction<? super U,? super T,? extends U> operation) |
<U> Set<U> |
SortedSet.scanLeft(U zero,
BiFunction<? super U,? super T,? extends U> operation) |
<U> Set<U> |
Set.scanRight(U zero,
BiFunction<? super T,? super U,? extends U> operation) |
default <U> Set<U> |
BitSet.scanRight(U zero,
BiFunction<? super T,? super U,? extends U> operation) |
<U> Set<U> |
TreeSet.scanRight(U zero,
BiFunction<? super T,? super U,? extends U> operation) |
<U> Set<U> |
SortedSet.scanRight(U zero,
BiFunction<? super T,? super U,? extends U> operation) |
Set<T> |
Set.tail() |
Set<T> |
Set.take(int n) |
Set<T> |
Set.takeRight(int n) |
Set<T> |
Set.takeUntil(Predicate<? super T> predicate) |
Set<T> |
Set.takeWhile(Predicate<? super T> predicate) |
Set<T> |
Set.union(Set<? extends T> that)
Adds all of the elements of
that set to this set, if not already present. |
<U> Set<Tuple2<T,U>> |
Set.zip(Iterable<? extends U> that) |
<U> Set<Tuple2<T,U>> |
Set.zipAll(Iterable<? extends U> that,
T thisElem,
U thatElem) |
<U,R> Set<R> |
Set.zipWith(Iterable<? extends U> that,
BiFunction<? super T,? super U,? extends R> mapper) |
Set<Tuple2<T,Integer>> |
Set.zipWithIndex() |
<U> Set<U> |
Set.zipWithIndex(BiFunction<? super T,? super Integer,? extends U> mapper) |
Modifier and Type | Method and Description |
---|---|
<C> Map<C,? extends Set<T>> |
Set.groupBy(Function<? super T,? extends C> classifier) |
Iterator<? extends Set<T>> |
Set.grouped(int size) |
Option<? extends Set<T>> |
Set.initOption() |
Tuple2<? extends Set<T>,? extends Set<T>> |
Set.partition(Predicate<? super T> predicate) |
Tuple2<? extends Set<T>,? extends Set<T>> |
Set.partition(Predicate<? super T> predicate) |
Iterator<? extends Set<T>> |
Set.slideBy(Function<? super T,?> classifier) |
Iterator<? extends Set<T>> |
Set.sliding(int size) |
Iterator<? extends Set<T>> |
Set.sliding(int size,
int step) |
Tuple2<? extends Set<T>,? extends Set<T>> |
Set.span(Predicate<? super T> predicate) |
Tuple2<? extends Set<T>,? extends Set<T>> |
Set.span(Predicate<? super T> predicate) |
Option<? extends Set<T>> |
Set.tailOption() |
<T1,T2> Tuple2<? extends Set<T1>,? extends Set<T2>> |
Set.unzip(Function<? super T,Tuple2<? extends T1,? extends T2>> unzipper) |
<T1,T2> Tuple2<? extends Set<T1>,? extends Set<T2>> |
Set.unzip(Function<? super T,Tuple2<? extends T1,? extends T2>> unzipper) |
<T1,T2,T3> Tuple3<? extends Set<T1>,? extends Set<T2>,? extends Set<T3>> |
Set.unzip3(Function<? super T,Tuple3<? extends T1,? extends T2,? extends T3>> unzipper) |
<T1,T2,T3> Tuple3<? extends Set<T1>,? extends Set<T2>,? extends Set<T3>> |
Set.unzip3(Function<? super T,Tuple3<? extends T1,? extends T2,? extends T3>> unzipper) |
<T1,T2,T3> Tuple3<? extends Set<T1>,? extends Set<T2>,? extends Set<T3>> |
Set.unzip3(Function<? super T,Tuple3<? extends T1,? extends T2,? extends T3>> unzipper) |
Modifier and Type | Method and Description |
---|---|
Set<T> |
Set.diff(Set<? extends T> that)
Calculates the difference between this set and another set.
|
default BitSet<T> |
BitSet.diff(Set<? extends T> elements) |
TreeSet<T> |
TreeSet.diff(Set<? extends T> elements) |
HashSet<T> |
HashSet.diff(Set<? extends T> elements) |
LinkedHashSet<T> |
LinkedHashSet.diff(Set<? extends T> elements) |
SortedSet<T> |
SortedSet.diff(Set<? extends T> elements) |
Set<T> |
Set.intersect(Set<? extends T> that)
Computes the intersection between this set and another set.
|
BitSet<T> |
BitSet.intersect(Set<? extends T> elements) |
TreeSet<T> |
TreeSet.intersect(Set<? extends T> elements) |
HashSet<T> |
HashSet.intersect(Set<? extends T> elements) |
LinkedHashSet<T> |
LinkedHashSet.intersect(Set<? extends T> elements) |
SortedSet<T> |
SortedSet.intersect(Set<? extends T> elements) |
static <T> Set<T> |
Set.narrow(Set<? extends T> set)
Narrows a widened
Set<? extends T> to Set<T>
by performing a type-safe cast. |
Set<T> |
Set.union(Set<? extends T> that)
Adds all of the elements of
that set to this set, if not already present. |
default BitSet<T> |
BitSet.union(Set<? extends T> elements) |
TreeSet<T> |
TreeSet.union(Set<? extends T> elements) |
HashSet<T> |
HashSet.union(Set<? extends T> elements) |
LinkedHashSet<T> |
LinkedHashSet.union(Set<? extends T> elements)
Adds all of the elements of
elements to this set, replacing existing ones if they already present. |
SortedSet<T> |
SortedSet.union(Set<? extends T> elements) |
Copyright © 2019. All Rights Reserved.