Uses of Interface
io.vavr.collection.Set
-
Packages that use Set Package Description io.vavr BesideAPIthe io.vavr package contains core types like (Checked)Functions and Tuples.io.vavr.collection Purely functional collections based on Traversable. -
-
Uses of Set in io.vavr
Methods in io.vavr that return Set Modifier and Type Method Description static <T> Set<T>API. LinkedSet()Alias forLinkedHashSet.empty()static <T> Set<T>API. LinkedSet(T element)Alias forLinkedHashSet.of(Object)static <T> Set<T>API. LinkedSet(T @NonNull ... elements)Alias forLinkedHashSet.of(Object...)static <T> Set<T>API. Set()Alias forHashSet.empty()static <T> Set<T>API. Set(T element)Alias forHashSet.of(Object)static <T> Set<T>API. Set(T @NonNull ... elements)Alias forHashSet.of(Object...)default Set<T>Value. toLinkedSet()Converts this to aSet.default Set<T>Value. toSet()Converts this to aSet. -
Uses of Set in io.vavr.collection
Subinterfaces of Set in io.vavr.collection Modifier and Type Interface Description interfaceBitSet<T>An immutableBitSetimplementation.interfaceSortedSet<T>An immutableSortedSetinterface.Classes in io.vavr.collection that implement Set Modifier and Type Class Description static classBitSetModule.AbstractBitSet<T>static classBitSetModule.BitSet1<T>static classBitSetModule.BitSet2<T>static classBitSetModule.BitSetN<T>classHashSet<T>An immutableHashSetimplementation.classLinkedHashSet<T>An immutableHashSetimplementation that has predictable (insertion-order) iteration.classTreeSet<T>SortedSet implementation, backed by a Red/Black Tree.Fields in io.vavr.collection declared as Set Modifier and Type Field Description private Set<U>IteratorModule.DistinctIterator. knownMethods in io.vavr.collection that return Set Modifier and Type Method Description Set<T>Set. add(T element)Returns a new set containing all elements of this set plus the given element, if it was not already present.Set<T>Set. addAll(@NonNull java.lang.Iterable<? extends T> elements)Returns a new set containing all elements of this set plus the given elements, excluding duplicates.<R> Set<R>Set. collect(@NonNull PartialFunction<? super T,? extends R> partialFunction)Set<T>Set. diff(@NonNull Set<? extends T> that)Returns a new set containing all elements of this set except those in the given set.Set<T>Set. distinct()Set<T>Set. distinctBy(@NonNull java.util.Comparator<? super T> comparator)<U> Set<T>Set. distinctBy(@NonNull java.util.function.Function<? super T,? extends U> keyExtractor)Set<T>Set. drop(int n)Set<T>Set. dropRight(int n)Set<T>Set. dropUntil(@NonNull java.util.function.Predicate<? super T> predicate)Set<T>Set. dropWhile(@NonNull java.util.function.Predicate<? super T> predicate)Set<T>Set. filter(@NonNull java.util.function.Predicate<? super T> predicate)<U> Set<U>Set. flatMap(@NonNull java.util.function.Function<? super T,? extends java.lang.Iterable<? extends U>> mapper)Set<T>Set. init()Set<T>Set. intersect(@NonNull Set<? extends T> that)Returns a new set containing only the elements present in both this set and the given set.Set<K>AbstractMultimap. keySet()Set<K>HashMap. keySet()Set<K>LinkedHashMap. keySet()Set<K>Map. keySet()Returns the keys contained in this map.Set<K>Multimap. keySet()Returns the keys contained in this multimap.<U> Set<U>Set. map(@NonNull java.util.function.Function<? super T,? extends U> mapper)default <U> Set<U>Set. mapTo(U value)default Set<java.lang.Void>Set. mapToVoid()static <T> Set<T>Set. narrow(Set<? extends T> set)Narrows a widenedSet<? extends T>toSet<T>by performing a type-safe cast.Set<T>Set. orElse(@NonNull java.lang.Iterable<? extends T> other)Set<T>Set. orElse(@NonNull java.util.function.Supplier<? extends java.lang.Iterable<? extends T>> supplier)Set<T>Set. peek(@NonNull java.util.function.Consumer<? super T> action)Set<T>Set. reject(@NonNull java.util.function.Predicate<? super T> predicate)Set<T>Set. remove(T element)Returns a new set with the given element removed, if it was present.Set<T>Set. removeAll(@NonNull java.lang.Iterable<? extends T> elements)Returns a new set with all given elements removed, if present.Set<T>Set. replace(T currentElement, T newElement)Set<T>Set. replaceAll(T currentElement, T newElement)Set<T>Set. retainAll(@NonNull java.lang.Iterable<? extends T> elements)Set<T>Set. scan(T zero, @NonNull java.util.function.BiFunction<? super T,? super T,? extends T> operation)default <U> Set<U>BitSet. scanLeft(U zero, @NonNull java.util.function.BiFunction<? super U,? super T,? extends U> operation)<U> Set<U>Set. scanLeft(U zero, @NonNull java.util.function.BiFunction<? super U,? super T,? extends U> operation)<U> Set<U>SortedSet. scanLeft(U zero, @NonNull java.util.function.BiFunction<? super U,? super T,? extends U> operation)<U> Set<U>TreeSet. scanLeft(U zero, @NonNull java.util.function.BiFunction<? super U,? super T,? extends U> operation)default <U> Set<U>BitSet. scanRight(U zero, @NonNull java.util.function.BiFunction<? super T,? super U,? extends U> operation)<U> Set<U>Set. scanRight(U zero, @NonNull java.util.function.BiFunction<? super T,? super U,? extends U> operation)<U> Set<U>SortedSet. scanRight(U zero, @NonNull java.util.function.BiFunction<? super T,? super U,? extends U> operation)<U> Set<U>TreeSet. scanRight(U zero, @NonNull java.util.function.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(@NonNull java.util.function.Predicate<? super T> predicate)Set<T>Set. takeWhile(@NonNull java.util.function.Predicate<? super T> predicate)Set<T>Set. union(@NonNull Set<? extends T> that)Returns a new set containing all distinct elements from this set and the given set.<U> Set<Tuple2<T,U>>Set. zip(@NonNull java.lang.Iterable<? extends U> that)<U> Set<Tuple2<T,U>>Set. zipAll(@NonNull java.lang.Iterable<? extends U> that, T thisElem, U thatElem)<U,R>
Set<R>Set. zipWith(@NonNull java.lang.Iterable<? extends U> that, java.util.function.BiFunction<? super T,? super U,? extends R> mapper)Set<Tuple2<T,java.lang.Integer>>Set. zipWithIndex()<U> Set<U>Set. zipWithIndex(@NonNull java.util.function.BiFunction<? super T,? super java.lang.Integer,? extends U> mapper)Methods in io.vavr.collection that return types with arguments of type Set Modifier and Type Method Description <C> Map<C,? extends Set<T>>Set. groupBy(@NonNull java.util.function.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(@NonNull java.util.function.Predicate<? super T> predicate)Tuple2<? extends Set<T>,? extends Set<T>>Set. partition(@NonNull java.util.function.Predicate<? super T> predicate)Iterator<? extends Set<T>>Set. slideBy(@NonNull java.util.function.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(@NonNull java.util.function.Predicate<? super T> predicate)Tuple2<? extends Set<T>,? extends Set<T>>Set. span(@NonNull java.util.function.Predicate<? super T> predicate)Option<? extends Set<T>>Set. tailOption()<T1,T2>
Tuple2<? extends Set<T1>,? extends Set<T2>>Set. unzip(@NonNull java.util.function.Function<? super T,Tuple2<? extends T1,? extends T2>> unzipper)<T1,T2>
Tuple2<? extends Set<T1>,? extends Set<T2>>Set. unzip(@NonNull java.util.function.Function<? super T,Tuple2<? extends T1,? extends T2>> unzipper)<T1,T2,T3>
Tuple3<? extends Set<T1>,? extends Set<T2>,? extends Set<T3>>Set. unzip3(@NonNull java.util.function.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(@NonNull java.util.function.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(@NonNull java.util.function.Function<? super T,Tuple3<? extends T1,? extends T2,? extends T3>> unzipper)Methods in io.vavr.collection with parameters of type Set Modifier and Type Method Description default BitSet<T>BitSet. diff(@NonNull Set<? extends T> elements)HashSet<T>HashSet. diff(@NonNull Set<? extends T> elements)LinkedHashSet<T>LinkedHashSet. diff(@NonNull Set<? extends T> elements)Set<T>Set. diff(@NonNull Set<? extends T> that)Returns a new set containing all elements of this set except those in the given set.SortedSet<T>SortedSet. diff(@NonNull Set<? extends T> elements)TreeSet<T>TreeSet. diff(@NonNull Set<? extends T> elements)(package private) static <V> booleanCollections. equals(Set<V> source, java.lang.Object object)BitSet<T>BitSet. intersect(@NonNull Set<? extends T> elements)BitSet<T>BitSetModule.AbstractBitSet. intersect(@NonNull Set<? extends T> elements)HashSet<T>HashSet. intersect(@NonNull Set<? extends T> elements)LinkedHashSet<T>LinkedHashSet. intersect(@NonNull Set<? extends T> elements)Set<T>Set. intersect(@NonNull Set<? extends T> that)Returns a new set containing only the elements present in both this set and the given set.SortedSet<T>SortedSet. intersect(@NonNull Set<? extends T> elements)TreeSet<T>TreeSet. intersect(@NonNull Set<? extends T> elements)static <T> Set<T>Set. narrow(Set<? extends T> set)Narrows a widenedSet<? extends T>toSet<T>by performing a type-safe cast.default BitSet<T>BitSet. union(@NonNull Set<? extends T> elements)HashSet<T>HashSet. union(@NonNull Set<? extends T> elements)LinkedHashSet<T>LinkedHashSet. union(@NonNull Set<? extends T> elements)Adds all of the elements ofelementsto this set, replacing existing ones if they already present.Set<T>Set. union(@NonNull Set<? extends T> that)Returns a new set containing all distinct elements from this set and the given set.SortedSet<T>SortedSet. union(@NonNull Set<? extends T> elements)TreeSet<T>TreeSet. union(@NonNull Set<? extends T> elements)Constructors in io.vavr.collection with parameters of type Set Constructor Description DistinctIterator(Iterator<? extends T> that, Set<U> set, java.util.function.Function<? super T,? extends U> keyExtractor)
-