Eclipse Collections 13.0.0 · org.eclipse.collections.impl.factory.Sets

Set algebra operations are available in this class as static utility.

Most operations are non-destructive, i.e. no input sets are modified during execution. The exception is operations ending in "Into." These accept the target collection of the final calculation as the first parameter.

Some effort is made to return a SortedSet if any input set is sorted, but this is not guaranteed (e.g., this will not be the case for collections proxied by Hibernate). When in doubt, specify the target collection explicitly with the "Into" version. This class should be used to create instances of MutableSet, ImmutableSet and FixedSizeSet

Mutable Examples:

MutableSet<String> emptySet = Sets.mutable.empty();
MutableSet<String> setWith = Sets.mutable.with("a", "b", "c");
MutableSet<String> setOf = Sets.mutable.of("a", "b", "c");

Immutable Examples:

ImmutableSet<String> emptySet = Sets.immutable.empty();
ImmutableSet<String> setWith = Sets.immutable.with("a", "b", "c");
ImmutableSet<String> setOf = Sets.immutable.of("a", "b", "c");

FixedSize Examples:

FixedSizeSet<String> emptySet = Sets.fixedSize.empty();
FixedSizeSet<String> setWith = Sets.fixedSize.with("a", "b", "c");
FixedSizeSet<String> setOf = Sets.fixedSize.of("a", "b", "c");

Field Summary

Modifier and Type	Field and Description
public static final FixedSizeSetFactory	fixedSize
private static final Predicate<Set<?>>	HAS_NON_NULL_COMPARATOR
public static final ImmutableSetFactory	immutable
private static final Predicate<Set<?>>	INSTANCE_OF_SORTED_SET_PREDICATE
public static final MultiReaderSetFactory	multiReader
public static final MutableSetFactory	mutable

Constructor Summary

Access	Constructor and Description
private	Sets()

Method Summary

Modifier and Type	Method and Description
public static <T> MutableSet<T>	adapt(Set<T> set)
private static <E, R extends Set<E>> Procedure2<Set<? extends E>, R>	addAllProcedure()
public static <A, B> LazyIterable<Pair<A, B>>	cartesianProduct(Set<A> set1, Set<B> set2)
public static <A, B, C> LazyIterable<C>	cartesianProduct(Set<A> set1, Set<B> set2, Function2<? super A, ? super B, ? extends C> function)
public static <E> MutableSet<E>	difference(Set<? extends E> minuendSet, Set<? extends E> subtrahendSet)
public static <E> MutableSet<E>	differenceAll(Set<? extends E>... sets)
public static <E, R extends Set<E>> R	differenceAllInto(R targetSet, Set<? extends E>... sets)
public static <E, R extends Set<E>> R	differenceInto(R targetSet, Set<? extends E> minuendSet, Set<? extends E> subtrahendSet)
private static <E> Comparator<? super E>	extractComparator(Set<? extends E>... sets)
private static <E, R extends Set<E>> R	fillSet(R targetSet, Procedure2<Set<? extends E>, R> procedure, Set<? extends E>... sets)
public static <E> MutableSet<E>	intersect(Set<? extends E> setA, Set<? extends E> setB)
public static <E> MutableSet<E>	intersectAll(Set<? extends E>... sets)
public static <E, R extends Set<E>> R	intersectAllInto(R targetSet, Set<? extends E>... sets)
public static <E, R extends Set<E>> R	intersectInto(R targetSet, Set<? extends E> setA, Set<? extends E> setB)
public static <E> boolean	isProperSubsetOf(Set<? extends E> candidateSubset, Set<? extends E> candidateSuperset)
public static <E> boolean	isSubsetOf(Set<? extends E> candidateSubset, Set<? extends E> candidateSuperset)
private static <E> MutableSet<E>	newSet(Set<? extends E>... sets)
public static <T> MutableSet<MutableSet<T>>	powerSet(Set<T> set)
private static <E, R extends Set<E>> Procedure2<Set<? extends E>, R>	removeAllProcedure()
private static <E, R extends Set<E>> Procedure2<Set<? extends E>, R>	retainAllProcedure()
public static <E> MutableSet<E>	symmetricDifference(Set<? extends E> setA, Set<? extends E> setB)
public static <E, R extends Set<E>> R	symmetricDifferenceInto(R targetSet, Set<? extends E> setA, Set<? extends E> setB)
public static <E> MutableSet<E>	union(Set<? extends E> setA, Set<? extends E> setB)
public static <E> MutableSet<E>	unionAll(Set<? extends E>... sets)
public static <E, R extends Set<E>> R	unionAllInto(R targetSet, Set<? extends E>... sets)
public static <E, R extends Set<E>> R	unionInto(R targetSet, Set<? extends E> setA, Set<? extends E> setB)

Inherited from java.lang.Object:: clone equals finalize getClass hashCode notify notifyAll toString wait wait wait

Field Detail

fixedSize	back to summary
public static final FixedSizeSetFactory fixedSize

HAS_NON_NULL_COMPARATOR	back to summary
private static final Predicate<Set<?>> HAS_NON_NULL_COMPARATOR

immutable	back to summary
public static final ImmutableSetFactory immutable

INSTANCE_OF_SORTED_SET_PREDICATE	back to summary
private static final Predicate<Set<?>> INSTANCE_OF_SORTED_SET_PREDICATE

multiReader	back to summary
public static final MultiReaderSetFactory multiReader

mutable	back to summary
public static final MutableSetFactory mutable

Constructor Detail

Sets	back to summary
private Sets()

Method Detail

adapt	back to summary
public static <T> MutableSet<T> adapt(Set<T> set) Since 9.0.

addAllProcedure	back to summary
private static <E, R extends Set<E>> Procedure2<Set<? extends E>, R> addAllProcedure()

cartesianProduct	back to summary
public static <A, B> LazyIterable<Pair<A, B>> cartesianProduct(Set<A> set1, Set<B> set2)

cartesianProduct	back to summary
public static <A, B, C> LazyIterable<C> cartesianProduct(Set<A> set1, Set<B> set2, Function2<? super A, ? super B, ? extends C> function)

difference	back to summary
public static <E> MutableSet<E> difference(Set<? extends E> minuendSet, Set<? extends E> subtrahendSet)

differenceAll	back to summary
public static <E> MutableSet<E> differenceAll(Set<? extends E>... sets)

differenceAllInto	back to summary
public static <E, R extends Set<E>> R differenceAllInto(R targetSet, Set<? extends E>... sets)

differenceInto	back to summary
public static <E, R extends Set<E>> R differenceInto(R targetSet, Set<? extends E> minuendSet, Set<? extends E> subtrahendSet)

extractComparator	back to summary
private static <E> Comparator<? super E> extractComparator(Set<? extends E>... sets)

fillSet	back to summary
private static <E, R extends Set<E>> R fillSet(R targetSet, Procedure2<Set<? extends E>, R> procedure, Set<? extends E>... sets)

intersect	back to summary
public static <E> MutableSet<E> intersect(Set<? extends E> setA, Set<? extends E> setB)

intersectAll	back to summary
public static <E> MutableSet<E> intersectAll(Set<? extends E>... sets)

intersectAllInto	back to summary
public static <E, R extends Set<E>> R intersectAllInto(R targetSet, Set<? extends E>... sets)

intersectInto	back to summary
public static <E, R extends Set<E>> R intersectInto(R targetSet, Set<? extends E> setA, Set<? extends E> setB)

isProperSubsetOf	back to summary
public static <E> boolean isProperSubsetOf(Set<? extends E> candidateSubset, Set<? extends E> candidateSuperset)

isSubsetOf	back to summary
public static <E> boolean isSubsetOf(Set<? extends E> candidateSubset, Set<? extends E> candidateSuperset)

newSet	back to summary
private static <E> MutableSet<E> newSet(Set<? extends E>... sets)

powerSet	back to summary
public static <T> MutableSet<MutableSet<T>> powerSet(Set<T> set)

removeAllProcedure	back to summary
private static <E, R extends Set<E>> Procedure2<Set<? extends E>, R> removeAllProcedure()

retainAllProcedure	back to summary
private static <E, R extends Set<E>> Procedure2<Set<? extends E>, R> retainAllProcedure()

symmetricDifference	back to summary
public static <E> MutableSet<E> symmetricDifference(Set<? extends E> setA, Set<? extends E> setB)

symmetricDifferenceInto	back to summary
public static <E, R extends Set<E>> R symmetricDifferenceInto(R targetSet, Set<? extends E> setA, Set<? extends E> setB)

union	back to summary
public static <E> MutableSet<E> union(Set<? extends E> setA, Set<? extends E> setB)

unionAll	back to summary
public static <E> MutableSet<E> unionAll(Set<? extends E>... sets)

unionAllInto	back to summary
public static <E, R extends Set<E>> R unionAllInto(R targetSet, Set<? extends E>... sets)