Uses of Class
fj.data.Set
Packages that use Set
Package
Description
Types that set the premise for the existence of Functional Java.
Common algebraic data types.
-
Uses of Set in fj
Modifier and TypeMethodDescriptionPromotes this function to map over a Set.Promotes this function to map over a Set.Equal instance for sets.Monoid.setIntersectionMonoid
(Bounded<A> bounded, Enumerator<A> enumerator) A intersection monoid for sets.Semigroup.setIntersectionSemigroup()
A intersection semigroup for sets.Promotes this function to return its value in a Set.Promotes this function to a function on Sets.Promotes this function to a function on Sets.Promotes this function to a function on Sets.A union monoid for sets.An order instance for theSet
type.Semigroup.setSemigroup()
A union semigroup for sets.A show instance for theSet
type.Promotes this function to zip two sets, applying the function lock-step over both sets.Promotes this function to zip two sets, applying the function lock-step over both sets.Promotes this function to zip two sets, applying the function lock-step over both sets. -
Uses of Set in fj.data
Modifier and TypeClassDescriptionprivate static final class
Set.Empty<A>
private static final class
Set.Tree<A>
Modifier and TypeMethodDescriptionstatic <A> Set
<A> Return the elements of the given iterator as a set.private static <A> Set
<A> final <B> Set
<B> Binds the given function across this set.Deletes the given element from this set.static <A> Set
<A> The empty set.Filters elements from this set by returning only elements which producetrue
when the given function is applied to them.Inserts the given element into this set.Remove all elements from this set that do not occur in the given set.static <A> Set
<A> Set.iterableSet
(Ord<A> o, Iterable<A> as) Return the elements of the given iterable as a set.static <A> Set
<A> Set.iteratorSet
(Ord<A> o, Iterator<A> as) Return the elements of the given iterator as a set.static <A> Set
<A> Join a set of sets into a single set.Set.Empty.l()
Set.l()
Set.Tree.l()
Set.makeBlack()
final <B> Set
<B> Maps the given function across this set.Remove all elements from this set that occur in the given set.Set.Empty.r()
Set.r()
Set.Tree.r()
List.sequenceSet
(Ord<B> ord, List<Set<B>> list) Sequence the given list and collect the output as a set; use the given ord to order the set.Option.sequenceSet
(Ord<B> ord, Option<Set<B>> option) Sequence the given option and collect the output as a set; use the given ord to order the set.Seq.sequenceSet
(Ord<B> ord, Seq<Set<B>> seq) Sequence the given seq and collect the output as a set; use the given ord to order the set.Stream.sequenceSet
(Ord<B> ord, Stream<Set<B>> stream) Sequence the given stream and collect the output as a set; use the given ord to order the set.static final <E,
C> Set <Validation<E, C>> Validation.sequenceSet
(Ord<E> ordE, Ord<C> ordC, Validation<E, Set<C>> validation) Sequence the given validation and collect the output as a set.static <A> Set
<A> Constructs a set from the given elements.static <A> Set
<A> Returns a set with a single element.List.traverseSet
(Ord<B> ord, F<A, Set<B>> f) Traverse this list with the given function and collect the output as a set; use the given ord to order the set.Option.traverseSet
(Ord<B> ord, F<A, Set<B>> f) Traverse this option with the given function and collect the output as a set; use the given ord to order the set.Seq.traverseSet
(Ord<B> ord, F<A, Set<B>> f) Traverse this seq with the given function and collect the output as a set; use the given ord to order the set.Stream.traverseSet
(Ord<B> ord, F<A, Set<B>> f) Traverse this stream with the given function and collect the output as a set; use the given ord to order the set.final <C> Set
<Validation<E, C>> Traverse this validation with the given function and collect the output as a set; use the given success and failure value ords to order the set.Add all the elements of the given set to this set.Modifier and TypeMethodDescriptionSet.delete()
First-class deletion function.Set.delete()
First-class deletion function.Set.insert()
First-class insertion function.Set.insert()
First-class insertion function.Set.intersect()
A first class function forintersect(Set)
.Set.intersect()
A first class function forintersect(Set)
.Set.intersect()
A first class function forintersect(Set)
.Set.member()
First-class membership check.Set.minus()
A first class function forminus(Set)
.Set.minus()
A first class function forminus(Set)
.Set.minus()
A first class function forminus(Set)
.Splits this set at the given element.Splits this set at the given element.Splits this TreeMap at the given key.Splits this TreeMap at the given key.Option.traverseSet()
Option.traverseSet()
Set.union()
A first class function forunion(Set)
.Set.union()
A first class function forunion(Set)
.Set.union()
A first class function forunion(Set)
.Updates, with the given function, the first element in the set that is equal to the given element, according to the order.Modifier and TypeMethodDescriptionprivate static <A> Set
<A> Remove all elements from this set that do not occur in the given set.static <A> Set
<A> Join a set of sets into a single set.Remove all elements from this set that occur in the given set.static <K,
V> TreeMap <K, V> TreeMap.setTreeMap
(Ord<K> ord, Set<P2<K, Option<V>>> s) Constructs a TreeMap from the given set.final boolean
Returns true if this set is a subset of the given set.private static <A> Set.Tree
<A> Add all the elements of the given set to this set.Modifier and TypeMethodDescriptionfinal <B> Set
<B> Binds the given function across this set.static <A> Set
<A> Join a set of sets into a single set.List.sequenceSet
(Ord<B> ord, List<Set<B>> list) Sequence the given list and collect the output as a set; use the given ord to order the set.Option.sequenceSet
(Ord<B> ord, Option<Set<B>> option) Sequence the given option and collect the output as a set; use the given ord to order the set.Seq.sequenceSet
(Ord<B> ord, Seq<Set<B>> seq) Sequence the given seq and collect the output as a set; use the given ord to order the set.Stream.sequenceSet
(Ord<B> ord, Stream<Set<B>> stream) Sequence the given stream and collect the output as a set; use the given ord to order the set.static final <E,
C> Set <Validation<E, C>> Validation.sequenceSet
(Ord<E> ordE, Ord<C> ordC, Validation<E, Set<C>> validation) Sequence the given validation and collect the output as a set.List.traverseSet
(Ord<B> ord, F<A, Set<B>> f) Traverse this list with the given function and collect the output as a set; use the given ord to order the set.Option.traverseSet
(Ord<B> ord, F<A, Set<B>> f) Traverse this option with the given function and collect the output as a set; use the given ord to order the set.Seq.traverseSet
(Ord<B> ord, F<A, Set<B>> f) Traverse this seq with the given function and collect the output as a set; use the given ord to order the set.Stream.traverseSet
(Ord<B> ord, F<A, Set<B>> f) Traverse this stream with the given function and collect the output as a set; use the given ord to order the set.final <C> Set
<Validation<E, C>> Traverse this validation with the given function and collect the output as a set; use the given success and failure value ords to order the set.