public interface ShortSet extends ShortIterable
| Modifier and Type | Method and Description |
|---|---|
LazyIterable<ShortShortPair> |
cartesianProduct(ShortSet set)
Returns the set whose members are all possible ordered pairs (a, b) where a is a member of
this and b is a
member of set. |
<V> SetIterable<V> |
collect(ShortToObjectFunction<? extends V> function)
Returns a new collection with the results of applying the specified function on each element of the source
collection.
|
ShortSet |
difference(ShortSet set)
Returns the set of all members of
this that are not members of set. |
boolean |
equals(Object o)
Follows the same general contract as
Set.equals(Object). |
ShortSet |
freeze()
Returns a frozen copy of this set.
|
int |
hashCode()
Follows the same general contract as
Set.hashCode(). |
ShortSet |
intersect(ShortSet set)
Returns the set of all objects that are members of both
this and set. |
default boolean |
isProperSubsetOf(ShortSet set)
Returns true if all the members of
this are also members of set and the
two sets are not equal. |
default boolean |
isSubsetOf(ShortSet set)
Returns true if all the members of
this are also members of set. |
ShortSet |
reject(ShortPredicate predicate)
Returns a new ShortIterable with all of the elements in the ShortIterable that
return false for the specified predicate.
|
ShortSet |
select(ShortPredicate predicate)
Returns a new ShortIterable with all of the elements in the ShortIterable that
return true for the specified predicate.
|
ShortSet |
symmetricDifference(ShortSet set)
Returns the set of all objects that are a member of exactly one of
this and set (elements which
are in one of the sets, but not in both). |
default ShortSet |
tap(ShortProcedure procedure) |
ImmutableShortSet |
toImmutable()
Returns an immutable copy of this set.
|
ShortSet |
union(ShortSet set) |
allSatisfy, anySatisfy, asLazy, average, averageIfEmpty, chunk, collect, collectBoolean, collectByte, collectChar, collectDouble, collectFloat, collectInt, collectLong, collectShort, contains, containsAll, containsAll, containsAny, containsAny, containsNone, containsNone, count, detectIfNone, each, flatCollect, forEach, injectInto, injectIntoBoolean, injectIntoByte, injectIntoChar, injectIntoDouble, injectIntoFloat, injectIntoInt, injectIntoLong, injectIntoShort, max, maxIfEmpty, median, medianIfEmpty, min, minIfEmpty, noneSatisfy, reduce, reduceIfEmpty, reject, select, shortIterator, sum, summaryStatistics, toArray, toArray, toBag, toList, toSet, toSortedArray, toSortedList, toSortedList, toSortedListBy, toSortedListByappendString, appendString, appendString, isEmpty, makeString, makeString, makeString, notEmpty, size, toStringdefault ShortSet tap(ShortProcedure procedure)
tap in interface ShortIterableShortSet intersect(ShortSet set)
this and set. The intersection of
[1, 2, 3] and [2, 3, 4] is the set [2, 3].ShortSet difference(ShortSet set)
this that are not members of set. The difference of
[1, 2, 3] and [2, 3, 4] is the set [1].ShortSet symmetricDifference(ShortSet set)
this and set (elements which
are in one of the sets, but not in both). For instance, for the sets [1, 2, 3] and [2, 3, 4], the symmetric
difference set is [1, 4] . It is the set difference of the union and the intersection.default boolean isSubsetOf(ShortSet set)
this are also members of set.
For example, [1, 2] is a subset of [1, 2, 3], but [1, 4] is not.default boolean isProperSubsetOf(ShortSet set)
this are also members of set and the
two sets are not equal. For example, [1, 2] is a proper subset of [1, 2, 3], but [1, 2, 3] is not.LazyIterable<ShortShortPair> cartesianProduct(ShortSet set)
this and b is a
member of set.boolean equals(Object o)
Set.equals(Object).int hashCode()
Set.hashCode().ShortSet select(ShortPredicate predicate)
ShortIterableselect in interface ShortIterableShortSet reject(ShortPredicate predicate)
ShortIterablereject in interface ShortIterable<V> SetIterable<V> collect(ShortToObjectFunction<? extends V> function)
ShortIterablecollect in interface ShortIterableShortSet freeze()
ImmutableShortSet toImmutable()
Copyright © 2004–2022. All rights reserved.