Uses of Class
fj.data.Set

Packages that use Set

Package	Description
fj	Types that set the premise for the existence of Functional Java.
fj.data	Common algebraic data types.

Uses of Set in fj

Methods in fj that return types with arguments of type Set

Modifier and Type	Method	Description
default F<Set<A>,Set<B>>	F.mapSet(Ord<B> o)	Promotes this function to map over a Set.
default F<Set<A>,Set<B>>	F.mapSet(Ord<B> o)	Promotes this function to map over a Set.
static <A> Equal<Set<A>>	Equal.setEqual(Equal<A> e)	Equal instance for sets.
static <A> Hash<Set<A>>	Hash.setHash(Hash<A> h)
static <A> Monoid<Set<A>>	Monoid.setIntersectionMonoid(Bounded<A> bounded, Enumerator<A> enumerator)	A intersection monoid for sets.
static <A> Semigroup<Set<A>>	Semigroup.setIntersectionSemigroup()	A intersection semigroup for sets.
default F<A,Set<B>>	F.setK(Ord<B> o)	Promotes this function to return its value in a Set.
default F2<Set<A>,Set<B>,Set<C>>	F2.setM(Ord<C> o)	Promotes this function to a function on Sets.
default F2<Set<A>,Set<B>,Set<C>>	F2.setM(Ord<C> o)	Promotes this function to a function on Sets.
default F2<Set<A>,Set<B>,Set<C>>	F2.setM(Ord<C> o)	Promotes this function to a function on Sets.
static <A> Monoid<Set<A>>	Monoid.setMonoid(Ord<A> o)	A union monoid for sets.
static <A> Ord<Set<A>>	Ord.setOrd(Ord<A> oa)	An order instance for the Set type.
static <A> Semigroup<Set<A>>	Semigroup.setSemigroup()	A union semigroup for sets.
static <A> Show<Set<A>>	Show.setShow(Show<A> sa)	A show instance for the Set type.
default F2<Set<A>,Set<B>,Set<C>>	F2.zipSetM(Ord<C> o)	Promotes this function to zip two sets, applying the function lock-step over both sets.
default F2<Set<A>,Set<B>,Set<C>>	F2.zipSetM(Ord<C> o)	Promotes this function to zip two sets, applying the function lock-step over both sets.
default F2<Set<A>,Set<B>,Set<C>>	F2.zipSetM(Ord<C> o)	Promotes this function to zip two sets, applying the function lock-step over both sets.

Uses of Set in fj.data

Subclasses of Set in fj.data

Modifier and Type	Class	Description
private static final class	Set.Empty<A>
private static final class	Set.Tree<A>

Fields in fj.data declared as Set

Modifier and Type	Field	Description
private final Set<A>	Set.Tree.a
private final Set<A>	Set.Tree.b
private final Set<P2<K, Option<V>>>	TreeMap.tree

Methods in fj.data that return Set

Modifier and Type	Method	Description
static <A> Set<A>	Set.arraySet(Ord<A> o, A... as)	Return the elements of the given iterator as a set.
private static <A> Set<A>	Set.balance(Ord<A> ord, Set.Color c, Set<A> l, A h, Set<A> r)
final <B> Set<B>	Set.bind(Ord<B> o, F<A,Set<B>> f)	Binds the given function across this set.
final Set<A>	Set.delete(A a)	Deletes the given element from this set.
static <A> Set<A>	Set.empty(Ord<A> ord)	The empty set.
final Set<A>	Set.filter(F<A,Boolean> f)	Filters elements from this set by returning only elements which produce true when the given function is applied to them.
private Set<A>	Set.ins(A x)
final Set<A>	Set.insert(A x)	Inserts the given element into this set.
final Set<A>	Set.intersect(Set<A> s)	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>	Set.join(Ord<A> o, Set<Set<A>> s)	Join a set of sets into a single set.
Set<A>	Set.Empty.l()
(package private) abstract Set<A>	Set.l()
Set<A>	Set.Tree.l()
private Set<A>	Set.makeBlack()
final <B> Set<B>	Set.map(Ord<B> o, F<A,B> f)	Maps the given function across this set.
final Set<A>	Set.minus(Set<A> s)	Remove all elements from this set that occur in the given set.
Set<A>	Set.Empty.r()
(package private) abstract Set<A>	Set.r()
Set<A>	Set.Tree.r()
static final <B> Set<List<B>>	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.
static final <B> Set<Option<B>>	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.
static <B> Set<Seq<B>>	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.
static <B> Set<Stream<B>>	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>	Set.set(Ord<A> o, A... as)	Constructs a set from the given elements.
static <A> Set<A>	Set.single(Ord<A> o, A a)	Returns a set with a single element.
final <B> Set<List<B>>	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.
final <B> Set<Option<B>>	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.
<B> Set<Seq<B>>	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.
<B> Set<Stream<B>>	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>>	Validation.traverseSet(Ord<E> ordE, Ord<C> ordC, F<T,Set<C>> f)	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.
final Set<A>	Set.union(Set<A> s)	Add all the elements of the given set to this set.

Methods in fj.data that return types with arguments of type Set

Modifier and Type	Method	Description
final F<A, F<Set<A>,Set<A>>>	Set.delete()	First-class deletion function.
final F<A, F<Set<A>,Set<A>>>	Set.delete()	First-class deletion function.
static <A> F<A, F<Set<A>,Set<A>>>	Set.insert()	First-class insertion function.
static <A> F<A, F<Set<A>,Set<A>>>	Set.insert()	First-class insertion function.
static <A> F<Set<A>, F<Set<A>,Set<A>>>	Set.intersect()	A first class function for Set.intersect(Set).
static <A> F<Set<A>, F<Set<A>,Set<A>>>	Set.intersect()	A first class function for Set.intersect(Set).
static <A> F<Set<A>, F<Set<A>,Set<A>>>	Set.intersect()	A first class function for Set.intersect(Set).
static <A> F<Set<A>, F<A,Boolean>>	Set.member()	First-class membership check.
static <A> F<Set<A>, F<Set<A>,Set<A>>>	Set.minus()	A first class function for Set.minus(Set).
static <A> F<Set<A>, F<Set<A>,Set<A>>>	Set.minus()	A first class function for Set.minus(Set).
static <A> F<Set<A>, F<Set<A>,Set<A>>>	Set.minus()	A first class function for Set.minus(Set).
final P3<Set<A>, Option<A>, Set<A>>	Set.split(A a)	Splits this set at the given element.
final P3<Set<A>, Option<A>, Set<A>>	Set.split(A a)	Splits this set at the given element.
P3<Set<V>, Option<V>, Set<V>>	TreeMap.split(Ord<V> ord, K k)	Splits this TreeMap at the given key.
P3<Set<V>, Option<V>, Set<V>>	TreeMap.split(Ord<V> ord, K k)	Splits this TreeMap at the given key.
final <B> F2<Ord<B>, F<A,Set<B>>, Set<Option<B>>>	Option.traverseSet()
final <B> F2<Ord<B>, F<A,Set<B>>, Set<Option<B>>>	Option.traverseSet()
private Either<A, P2<Boolean,Set<A>>>	Set.tryUpdate(A a, F<A,A> f)
static <A> F<Set<A>, F<Set<A>,Set<A>>>	Set.union()	A first class function for Set.union(Set).
static <A> F<Set<A>, F<Set<A>,Set<A>>>	Set.union()	A first class function for Set.union(Set).
static <A> F<Set<A>, F<Set<A>,Set<A>>>	Set.union()	A first class function for Set.union(Set).
final P2<Boolean,Set<A>>	Set.update(A a, F<A,A> f)	Updates, with the given function, the first element in the set that is equal to the given element, according to the order.

Methods in fj.data with parameters of type Set

Modifier and Type	Method	Description
private static <A> Set<A>	Set.balance(Ord<A> ord, Set.Color c, Set<A> l, A h, Set<A> r)
final Set<A>	Set.intersect(Set<A> s)	Remove all elements from this set that do not occur in the given set.
static <A> Set<A>	Set.join(Ord<A> o, Set<Set<A>> s)	Join a set of sets into a single set.
final Set<A>	Set.minus(Set<A> s)	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	Set.subsetOf(Set<A> s)	Returns true if this set is a subset of the given set.
private static <A> Set.Tree<A>	Set.tr(Ord<A> o, Set<A> a, A x, Set<A> b, A y, Set<A> c, A z, Set<A> d)
final Set<A>	Set.union(Set<A> s)	Add all the elements of the given set to this set.

Method parameters in fj.data with type arguments of type Set

Modifier and Type	Method	Description
final <B> Set<B>	Set.bind(Ord<B> o, F<A,Set<B>> f)	Binds the given function across this set.
static <A> Set<A>	Set.join(Ord<A> o, Set<Set<A>> s)	Join a set of sets into a single set.
static final <B> Set<List<B>>	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.
static final <B> Set<Option<B>>	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.
static <B> Set<Seq<B>>	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.
static <B> Set<Stream<B>>	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.
final <B> Set<List<B>>	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.
final <B> Set<Option<B>>	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.
<B> Set<Seq<B>>	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.
<B> Set<Stream<B>>	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>>	Validation.traverseSet(Ord<E> ordE, Ord<C> ordC, F<T,Set<C>> f)	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.

Constructors in fj.data with parameters of type Set

Modifier	Constructor	Description
private	Tree(Ord<A> ord, Set.Color c, Set<A> a, A x, Set<A> b)
private	TreeMap(Set<P2<K, Option<V>>> tree)