public final class TreeSortedSet<T> extends AbstractMutableCollection<T> implements Externalizable, MutableSortedSet<T>
Constructor and Description |
---|
TreeSortedSet() |
TreeSortedSet(Comparator<? super T> comparator) |
TreeSortedSet(Comparator<? super T> comparator,
Iterable<? extends T> iterable) |
TreeSortedSet(Iterable<? extends T> iterable) |
TreeSortedSet(SortedSet<T> set) |
Modifier and Type | Method and Description |
---|---|
boolean |
add(T element) |
boolean |
addAll(Collection<? extends T> collection) |
ParallelSortedSetIterable<T> |
asParallel(ExecutorService executorService,
int batchSize) |
MutableSortedSet<T> |
asSynchronized()
Returns a synchronized (thread-safe) collection backed by this collection.
|
MutableSortedSet<T> |
asUnmodifiable()
Returns an unmodifable view of the set.
|
<B> LazyIterable<Pair<T,B>> |
cartesianProduct(SetIterable<B> 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 . |
void |
clear() |
TreeSortedSet<T> |
clone() |
<V> MutableList<V> |
collect(Function<? super T,? extends V> function)
Returns a new collection with the results of applying the specified function on each element of the source
collection.
|
MutableBooleanList |
collectBoolean(BooleanFunction<? super T> booleanFunction)
Returns a new primitive
boolean iterable with the results of applying the specified function on each element
of the source collection. |
MutableByteList |
collectByte(ByteFunction<? super T> byteFunction)
Returns a new primitive
byte iterable with the results of applying the specified function on each element
of the source collection. |
MutableCharList |
collectChar(CharFunction<? super T> charFunction)
Returns a new primitive
char iterable with the results of applying the specified function on each element
of the source collection. |
MutableDoubleList |
collectDouble(DoubleFunction<? super T> doubleFunction)
Returns a new primitive
double iterable with the results of applying the specified function on each element
of the source collection. |
MutableFloatList |
collectFloat(FloatFunction<? super T> floatFunction)
Returns a new primitive
float iterable with the results of applying the specified function on each element
of the source collection. |
<V> MutableList<V> |
collectIf(Predicate<? super T> predicate,
Function<? super T,? extends V> function)
Returns a new collection with the results of applying the specified function on each element of the source
collection, but only for those elements which return true upon evaluation of the predicate.
|
MutableIntList |
collectInt(IntFunction<? super T> intFunction)
Returns a new primitive
int iterable with the results of applying the specified function on each element
of the source collection. |
MutableLongList |
collectLong(LongFunction<? super T> longFunction)
Returns a new primitive
long iterable with the results of applying the specified function on each element
of the source collection. |
MutableShortList |
collectShort(ShortFunction<? super T> shortFunction)
Returns a new primitive
short iterable with the results of applying the specified function on each element
of the source collection. |
<P,V> MutableList<V> |
collectWith(Function2<? super T,? super P,? extends V> function,
P parameter)
Same as collect with a
Function2 and specified parameter which is passed to the block
|
Comparator<? super T> |
comparator()
Returns the comparator used to order the elements in this set, or null if this set uses the natural ordering of
its elements.
|
int |
compareTo(SortedSetIterable<T> otherSet) |
boolean |
contains(Object o)
Returns true if the iterable has an element which responds true to element.equals(object).
|
boolean |
containsAll(Collection<?> collection)
Returns true if all elements in source are contained in this collection.
|
TreeSortedSet<T> |
difference(SetIterable<? extends T> subtrahendSet)
Returns the set of all members of
this that are not members of subtrahendSet . |
<R extends Set<T>> |
differenceInto(SetIterable<? extends T> subtrahendSet,
R targetSet)
Same as
SetIterable.difference(SetIterable) but adds all the objects to targetSet and returns it. |
MutableSortedSet<T> |
distinct()
Returns a new
SortedIterable containing the distinct elements in this iterable. |
MutableSortedSet<T> |
dropWhile(Predicate<? super T> predicate)
Returns the final elements that do not satisfy the Predicate.
|
boolean |
equals(Object object)
Follows the same general contract as
Set.equals(Object) . |
T |
first() |
<V> MutableList<V> |
flatCollect(Function<? super T,? extends Iterable<V>> function)
flatCollect is a special case of RichIterable.collect(Function) . |
void |
forEach(Procedure<? super T> procedure)
The procedure is executed for each element in the iterable.
|
T |
getFirst()
Returns the first element of an iterable.
|
T |
getLast()
Returns the last element of an iterable.
|
<V> TreeSortedSetMultimap<V,T> |
groupBy(Function<? super T,? extends V> function)
For each element of the iterable, the function is evaluated and the results of these evaluations are collected
into a new multimap, where the transformed value is the key and the original values are added to the same (or similar)
species of collection as the source iterable.
|
<V> TreeSortedSetMultimap<V,T> |
groupByEach(Function<? super T,? extends Iterable<V>> function)
Similar to
RichIterable.groupBy(Function) , except the result of evaluating function will return a collection of keys
for each value. |
<V> MutableMap<V,T> |
groupByUniqueKey(Function<? super T,? extends V> function)
For each element of the iterable, the function is evaluated and he results of these evaluations are collected
into a new map, where the transformed value is the key.
|
int |
hashCode()
Follows the same general contract as
Set.hashCode() . |
MutableSortedSet<T> |
headSet(T toElement) |
TreeSortedSet<T> |
intersect(SetIterable<? extends T> set)
Returns the set of all objects that are members of both
this and set . |
<R extends Set<T>> |
intersectInto(SetIterable<? extends T> set,
R targetSet)
Same as
SetIterable.intersect(SetIterable) but adds all the objects to targetSet and returns it. |
boolean |
isProperSubsetOf(SetIterable<? extends T> candidateSuperset)
Returns true if all the members of
this are also members of candidateSuperset and the
two sets are not equal. |
boolean |
isSubsetOf(SetIterable<? extends T> candidateSuperset)
Returns true if all the members of
this are also members of candidateSuperset . |
Iterator<T> |
iterator() |
T |
last() |
TreeSortedSet<T> |
newEmpty()
Creates a new empty mutable version of the same collection type.
|
static <T> TreeSortedSet<T> |
newSet() |
static <T> TreeSortedSet<T> |
newSet(Comparator<? super T> comparator) |
static <T> TreeSortedSet<T> |
newSet(Comparator<? super T> comparator,
Iterable<? extends T> iterable) |
static <T> TreeSortedSet<T> |
newSet(Iterable<? extends T> source) |
static <T> TreeSortedSet<T> |
newSetWith(Comparator<? super T> comparator,
T... elements) |
static <T> TreeSortedSet<T> |
newSetWith(T... elements) |
PartitionMutableSortedSet<T> |
partition(Predicate<? super T> predicate)
Filters a collection into a PartitionedIterable based on the evaluation of the predicate.
|
PartitionMutableSortedSet<T> |
partitionWhile(Predicate<? super T> predicate)
Returns a Partition of the initial elements that satisfy the Predicate and the remaining elements.
|
<P> PartitionMutableSortedSet<T> |
partitionWith(Predicate2<? super T,? super P> predicate,
P parameter)
Filters a collection into a PartitionIterable based on the evaluation of the predicate.
|
MutableSortedSet<SortedSetIterable<T>> |
powerSet()
Returns the set whose members are all possible subsets of
this . |
void |
readExternal(ObjectInput in) |
TreeSortedSet<T> |
reject(Predicate<? super T> predicate)
Returns all elements of the source collection that return false when evaluating of the predicate.
|
<P> TreeSortedSet<T> |
rejectWith(Predicate2<? super T,? super P> predicate,
P parameter)
Similar to
RichIterable.reject(Predicate) , except with an evaluation parameter for the second generic argument in Predicate2 . |
boolean |
remove(Object element) |
boolean |
removeAllIterable(Iterable<?> iterable) |
TreeSortedSet<T> |
select(Predicate<? super T> predicate)
Returns all elements of the source collection that return true when evaluating the predicate.
|
<S> TreeSortedSet<S> |
selectInstancesOf(Class<S> clazz)
Returns all elements of the source collection that are instances of the Class
clazz . |
<P> TreeSortedSet<T> |
selectWith(Predicate2<? super T,? super P> predicate,
P parameter)
Similar to
RichIterable.select(Predicate) , except with an evaluation parameter for the second generic argument in Predicate2 . |
int |
size()
Returns the number of items in this iterable.
|
MutableSortedSet<T> |
subSet(T fromElement,
T toElement) |
MutableSortedSet<T> |
symmetricDifference(SetIterable<? extends T> setB)
Returns the set of all objects that are a member of exactly one of
this and setB (elements which
are in one of the sets, but not in both). |
<R extends Set<T>> |
symmetricDifferenceInto(SetIterable<? extends T> set,
R targetSet)
Same as
SetIterable.symmetricDifference(SetIterable) but adds all the objects to targetSet and returns it. |
MutableSortedSet<T> |
tailSet(T fromElement) |
MutableSortedSet<T> |
takeWhile(Predicate<? super T> predicate)
Returns the initial elements that satisfy the Predicate.
|
ImmutableSortedSet<T> |
toImmutable()
Returns an immutable copy of this set.
|
MutableStack<T> |
toStack()
Converts the SortedIterable to a mutable MutableStack implementation.
|
TreeSortedSet<T> |
union(SetIterable<? extends T> set)
Returns the set of all objects that are a member of
this or set or both. |
<R extends Set<T>> |
unionInto(SetIterable<? extends T> set,
R targetSet)
Same as
SetIterable.union(SetIterable) but adds all the objects to targetSet and returns it. |
TreeSortedSet<T> |
with(T... elements) |
TreeSortedSet<T> |
with(T element)
This method allows mutable and fixed size collections the ability to add elements to their existing elements.
|
TreeSortedSet<T> |
with(T element1,
T element2) |
TreeSortedSet<T> |
with(T element1,
T element2,
T element3) |
TreeSortedSet<T> |
withAll(Iterable<? extends T> elements)
This method allows mutable and fixed size collections the ability to add multiple elements to their existing
elements.
|
TreeSortedSet<T> |
without(T element)
This method allows mutable and fixed size collections the ability to remove elements from their existing elements.
|
TreeSortedSet<T> |
withoutAll(Iterable<? extends T> elements)
This method allows mutable and fixed size collections the ability to remove multiple elements from their existing
elements.
|
void |
writeExternal(ObjectOutput out) |
<S> MutableList<Pair<T,S>> |
zip(Iterable<S> that)
Returns a
RichIterable formed from this RichIterable and another RichIterable by
combining corresponding elements in pairs. |
TreeSortedSet<Pair<T,Integer>> |
zipWithIndex()
Zips this
RichIterable with its indices. |
addAllIterable, aggregateBy, aggregateInPlaceBy, chunk, injectIntoWith, removeAll, removeIf, removeIfWith, retainAll, retainAllIterable, selectAndRejectWith
allSatisfy, allSatisfyWith, anySatisfy, anySatisfyWith, appendString, appendString, appendString, asLazy, collect, collectBoolean, collectByte, collectChar, collectDouble, collectFloat, collectIf, collectInt, collectLong, collectShort, collectWith, containsAllArguments, containsAllIterable, count, countWith, detect, detectIfNone, detectWith, detectWithIfNone, flatCollect, forEachWith, forEachWithIndex, groupBy, groupByEach, injectInto, injectInto, injectInto, injectInto, injectInto, isEmpty, makeString, makeString, makeString, max, max, maxBy, min, min, minBy, noneSatisfy, noneSatisfyWith, notEmpty, reject, rejectWith, select, selectWith, sumOfDouble, sumOfFloat, sumOfInt, sumOfLong, toArray, toArray, toBag, toList, toMap, toSet, toSortedList, toSortedList, toSortedListBy, toSortedMap, toSortedMap, toSortedSet, toSortedSet, toSortedSetBy, toString, zip, zipWithIndex
max, min
aggregateBy, aggregateInPlaceBy, allSatisfy, allSatisfyWith, anySatisfy, anySatisfyWith, appendString, appendString, appendString, asLazy, chunk, collect, collectBoolean, collectByte, collectChar, collectDouble, collectFloat, collectIf, collectInt, collectLong, collectShort, collectWith, containsAllArguments, containsAllIterable, count, countWith, detect, detectIfNone, detectWith, detectWithIfNone, flatCollect, groupBy, groupByEach, injectInto, injectInto, injectInto, injectInto, injectInto, isEmpty, makeString, makeString, makeString, max, maxBy, min, minBy, noneSatisfy, noneSatisfyWith, notEmpty, reject, rejectWith, select, selectWith, sumOfDouble, sumOfFloat, sumOfInt, sumOfLong, toArray, toArray, toBag, toList, toMap, toSet, toSortedList, toSortedList, toSortedListBy, toSortedMap, toSortedMap, toSortedSet, toSortedSet, toSortedSetBy, toString, zip, zipWithIndex
forEachWith, forEachWithIndex
forEach, spliterator
addAllIterable, aggregateBy, aggregateInPlaceBy, injectIntoWith, removeIf, removeIfWith, retainAllIterable, selectAndRejectWith
spliterator
parallelStream, removeIf, stream
public TreeSortedSet()
public TreeSortedSet(Comparator<? super T> comparator)
public TreeSortedSet(Comparator<? super T> comparator, Iterable<? extends T> iterable)
public static <T> TreeSortedSet<T> newSet()
public static <T> TreeSortedSet<T> newSet(Comparator<? super T> comparator)
public static <T> TreeSortedSet<T> newSet(Iterable<? extends T> source)
public static <T> TreeSortedSet<T> newSet(Comparator<? super T> comparator, Iterable<? extends T> iterable)
public static <T> TreeSortedSet<T> newSetWith(T... elements)
public static <T> TreeSortedSet<T> newSetWith(Comparator<? super T> comparator, T... elements)
public MutableSortedSet<T> asUnmodifiable()
MutableSortedSet
asUnmodifiable
in interface MutableCollection<T>
asUnmodifiable
in interface MutableSortedSet<T>
public MutableSortedSet<T> asSynchronized()
MutableCollection
MutableCollection collection = myCollection.asSynchronized(); ... synchronized(collection) { Iterator i = c.iterator(); // Must be in the synchronized block while (i.hasNext()) foo(i.next()); }Failure to follow this advice may result in non-deterministic behavior. The preferred way of iterating over a synchronized collection is to use the collection.forEach() method which is properly synchronized internally.
MutableCollection collection = myCollection.asSynchronized(); ... collection.forEach(new Procedure() { public void value(Object each) { ... } });The returned collection does not pass the hashCode and equals operations through to the backing collection, but relies on Object's equals and hashCode methods. This is necessary to preserve the contracts of these operations in the case that the backing collection is a set or a list. The returned collection will be serializable if this collection is serializable.
asSynchronized
in interface MutableCollection<T>
asSynchronized
in interface MutableSortedSet<T>
public ParallelSortedSetIterable<T> asParallel(ExecutorService executorService, int batchSize)
public ImmutableSortedSet<T> toImmutable()
MutableSortedSet
toImmutable
in interface MutableCollection<T>
toImmutable
in interface MutableSortedSet<T>
toImmutable
in interface SortedSetIterable<T>
public MutableStack<T> toStack()
SortedIterable
toStack
in interface SortedIterable<T>
public boolean add(T element)
add
in interface Collection<T>
add
in interface Set<T>
add
in class AbstractMutableCollection<T>
public boolean remove(Object element)
remove
in interface Collection<T>
remove
in interface Set<T>
remove
in class AbstractMutableCollection<T>
public boolean addAll(Collection<? extends T> collection)
addAll
in interface Collection<T>
addAll
in interface Set<T>
addAll
in class AbstractMutableCollection<T>
public boolean contains(Object o)
RichIterable
contains
in interface RichIterable<T>
contains
in interface Collection<T>
contains
in interface Set<T>
contains
in class AbstractRichIterable<T>
public boolean containsAll(Collection<?> collection)
RichIterable
containsAll
in interface RichIterable<T>
containsAll
in interface Collection<T>
containsAll
in interface Set<T>
containsAll
in class AbstractRichIterable<T>
Collection.containsAll(Collection)
public void clear()
public TreeSortedSet<T> clone()
clone
in interface MutableSortedSet<T>
clone
in class Object
public boolean equals(Object object)
SetIterable
Set.equals(Object)
.public int hashCode()
SetIterable
Set.hashCode()
.public TreeSortedSet<T> with(T element)
MutableCollection
MutableCollectionIn the case oflist; list = list.with("1"); list = list.with("2"); return list;
FixedSizeCollection
a new instance of MutableCollection will be returned by with, and any
variables that previously referenced the original collection will need to be redirected to reference the
new instance. For other MutableCollection types you will replace the reference to collection with the same
collection, since the instance will return "this" after calling add on itself.with
in interface MutableCollection<T>
with
in interface MutableSortedSet<T>
Collection.add(Object)
public TreeSortedSet<T> with(T element1, T element2)
public TreeSortedSet<T> with(T element1, T element2, T element3)
public TreeSortedSet<T> with(T... elements)
public TreeSortedSet<T> without(T element)
MutableCollection
MutableCollectionIn the case oflist; list = list.without("1"); list = list.without("2"); return list;
FixedSizeCollection
a new instance of MutableCollection will be returned by without, and
any variables that previously referenced the original collection will need to be redirected to reference the
new instance. For other MutableCollection types you will replace the reference to collection with the same
collection, since the instance will return "this" after calling remove on itself.without
in interface MutableCollection<T>
without
in interface MutableSortedSet<T>
Collection.remove(Object)
public TreeSortedSet<T> withAll(Iterable<? extends T> elements)
MutableCollection
MutableCollectionIn the case oflist; list = list.withAll(FastList.newListWith("1", "2")); return list;
FixedSizeCollection
a new instance of MutableCollection will be returned by withAll, and
any variables that previously referenced the original collection will need to be redirected to reference the
new instance. For other MutableCollection types you will replace the reference to collection with the same
collection, since the instance will return "this" after calling addAll on itself.withAll
in interface MutableCollection<T>
withAll
in interface MutableSortedSet<T>
Collection.addAll(Collection)
public TreeSortedSet<T> withoutAll(Iterable<? extends T> elements)
MutableCollection
MutableCollectionIn the case oflist; list = list.withoutAll(FastList.newListWith("1", "2")); return list;
FixedSizeCollection
a new instance of MutableCollection will be returned by withoutAll,
and any variables that previously referenced the original collection will need to be redirected to reference the
new instance. For other MutableCollection types you will replace the reference to collection with the same
collection, since the instance will return "this" after calling removeAll on itself.withoutAll
in interface MutableCollection<T>
withoutAll
in interface MutableSortedSet<T>
Collection.removeAll(Collection)
public TreeSortedSet<T> newEmpty()
MutableCollection
newEmpty
in interface MutableCollection<T>
newEmpty
in interface MutableSortedSet<T>
public void forEach(Procedure<? super T> procedure)
InternalIterable
e.g. people.forEach(new Procedure() { public void value(Person person) { LOGGER.info(person.getName()); } });
forEach
in interface InternalIterable<T>
public TreeSortedSet<T> select(Predicate<? super T> predicate)
RichIterable
e.g. return people.select(new Predicate<Person>() { public boolean accept(Person person) { return person.getAddress().getCity().equals("Metuchen"); } });
select
in interface MutableCollection<T>
select
in interface SortedIterable<T>
select
in interface RichIterable<T>
select
in interface SetIterable<T>
select
in interface MutableSortedSet<T>
select
in interface SortedSetIterable<T>
public TreeSortedSet<T> reject(Predicate<? super T> predicate)
RichIterable
e.g. return people.reject(new Predicate<Person>() { public boolean accept(Person person) { return person.person.getLastName().equals("Smith"); } });
e.g. return people.reject(Predicates.attributeEqual("lastName", "Smith"));
reject
in interface MutableCollection<T>
reject
in interface SortedIterable<T>
reject
in interface RichIterable<T>
reject
in interface SetIterable<T>
reject
in interface MutableSortedSet<T>
reject
in interface SortedSetIterable<T>
predicate
- a Predicate
to use as the reject criteriaPredicate.accept(Object)
method to evaluate to falsepublic PartitionMutableSortedSet<T> partition(Predicate<? super T> predicate)
RichIterable
e.g. return people.partition(new Predicate<Person>() { public boolean accept(Person person) { return person.getAddress().getState().getName().equals("New York"); } });
partition
in interface MutableCollection<T>
partition
in interface SortedIterable<T>
partition
in interface RichIterable<T>
partition
in interface SetIterable<T>
partition
in interface MutableSortedSet<T>
partition
in interface SortedSetIterable<T>
public <P> PartitionMutableSortedSet<T> partitionWith(Predicate2<? super T,? super P> predicate, P parameter)
RichIterable
e.g. return people.partitionWith(new Predicate2<Person, String>() { public boolean accept(Person person, String state) { return person.getAddress().getState().getName().equals(state); } }, "New York");
partitionWith
in interface MutableCollection<T>
partitionWith
in interface RichIterable<T>
partitionWith
in interface SetIterable<T>
partitionWith
in interface MutableSortedSet<T>
partitionWith
in interface SortedSetIterable<T>
public PartitionMutableSortedSet<T> partitionWhile(Predicate<? super T> predicate)
SortedIterable
partitionWhile
in interface SortedIterable<T>
partitionWhile
in interface MutableSortedSet<T>
partitionWhile
in interface SortedSetIterable<T>
public <S> TreeSortedSet<S> selectInstancesOf(Class<S> clazz)
RichIterable
clazz
.selectInstancesOf
in interface MutableCollection<T>
selectInstancesOf
in interface SortedIterable<T>
selectInstancesOf
in interface RichIterable<T>
selectInstancesOf
in interface SetIterable<T>
selectInstancesOf
in interface MutableSortedSet<T>
selectInstancesOf
in interface SortedSetIterable<T>
public <V> MutableList<V> collect(Function<? super T,? extends V> function)
RichIterable
e.g. return people.collect(new Function<Person, String>() { public String valueOf(Person person) { return person.getFirstName() + " " + person.getLastName(); } });
collect
in interface MutableCollection<T>
collect
in interface RichIterable<T>
collect
in interface MutableSortedSet<T>
collect
in interface SortedSetIterable<T>
public MutableBooleanList collectBoolean(BooleanFunction<? super T> booleanFunction)
RichIterable
boolean
iterable with the results of applying the specified function on each element
of the source collection. This method is also commonly called transform or map.
e.g. return people.collectBoolean(new BooleanFunction<Person>() { public boolean booleanValueOf(Person person) { return person.hasDrivingLicense(); } });
collectBoolean
in interface MutableCollection<T>
collectBoolean
in interface RichIterable<T>
collectBoolean
in interface MutableSortedSet<T>
collectBoolean
in interface SortedSetIterable<T>
public MutableByteList collectByte(ByteFunction<? super T> byteFunction)
RichIterable
byte
iterable with the results of applying the specified function on each element
of the source collection. This method is also commonly called transform or map.
e.g. return people.collectByte(new ByteFunction<Person>() { public byte byteValueOf(Person person) { return person.getCode(); } });
collectByte
in interface MutableCollection<T>
collectByte
in interface RichIterable<T>
collectByte
in interface MutableSortedSet<T>
collectByte
in interface SortedSetIterable<T>
public MutableCharList collectChar(CharFunction<? super T> charFunction)
RichIterable
char
iterable with the results of applying the specified function on each element
of the source collection. This method is also commonly called transform or map.
e.g. return people.collectChar(new CharFunction<Person>() { public char charValueOf(Person person) { return person.getMiddleInitial(); } });
collectChar
in interface MutableCollection<T>
collectChar
in interface RichIterable<T>
collectChar
in interface MutableSortedSet<T>
collectChar
in interface SortedSetIterable<T>
public MutableDoubleList collectDouble(DoubleFunction<? super T> doubleFunction)
RichIterable
double
iterable with the results of applying the specified function on each element
of the source collection. This method is also commonly called transform or map.
e.g. return people.collectDouble(new DoubleFunction<Person>() { public double doubleValueOf(Person person) { return person.getMilesFromNorthPole(); } });
collectDouble
in interface MutableCollection<T>
collectDouble
in interface RichIterable<T>
collectDouble
in interface MutableSortedSet<T>
collectDouble
in interface SortedSetIterable<T>
public MutableFloatList collectFloat(FloatFunction<? super T> floatFunction)
RichIterable
float
iterable with the results of applying the specified function on each element
of the source collection. This method is also commonly called transform or map.
e.g. return people.collectFloat(new FloatFunction<Person>() { public float floatValueOf(Person person) { return person.getHeightInInches(); } });
collectFloat
in interface MutableCollection<T>
collectFloat
in interface RichIterable<T>
collectFloat
in interface MutableSortedSet<T>
collectFloat
in interface SortedSetIterable<T>
public MutableIntList collectInt(IntFunction<? super T> intFunction)
RichIterable
int
iterable with the results of applying the specified function on each element
of the source collection. This method is also commonly called transform or map.
e.g. return people.collectInt(new IntFunction<Person>() { public int intValueOf(Person person) { return person.getAge(); } });
collectInt
in interface MutableCollection<T>
collectInt
in interface RichIterable<T>
collectInt
in interface MutableSortedSet<T>
collectInt
in interface SortedSetIterable<T>
public MutableLongList collectLong(LongFunction<? super T> longFunction)
RichIterable
long
iterable with the results of applying the specified function on each element
of the source collection. This method is also commonly called transform or map.
e.g. return people.collectLong(new LongFunction<Person>() { public long longValueOf(Person person) { return person.getGuid(); } });
collectLong
in interface MutableCollection<T>
collectLong
in interface RichIterable<T>
collectLong
in interface MutableSortedSet<T>
collectLong
in interface SortedSetIterable<T>
public MutableShortList collectShort(ShortFunction<? super T> shortFunction)
RichIterable
short
iterable with the results of applying the specified function on each element
of the source collection. This method is also commonly called transform or map.
e.g. return people.collectShort(new ShortFunction<Person>() { public short shortValueOf(Person person) { return person.getNumberOfJunkMailItemsReceivedPerMonth(); } });
collectShort
in interface MutableCollection<T>
collectShort
in interface RichIterable<T>
collectShort
in interface MutableSortedSet<T>
collectShort
in interface SortedSetIterable<T>
public <V> MutableList<V> flatCollect(Function<? super T,? extends Iterable<V>> function)
RichIterable
flatCollect
is a special case of RichIterable.collect(Function)
. With collect
, when the Function
returns
a collection, the result is a collection of collections. flatCollect
outputs a single "flattened" collection
instead. This method is commonly called flatMap.
Consider the following example where we have a Person
class, and each Person
has a list of Address
objects. Take the following Function
:
Function<Person, List<Address>> addressFunction = new Function<Person, List<Address>>() { public List<Address> valueOf(Person person) { return person.getAddresses(); } }; MutableList<Person> people = ...;Using
collect
returns a collection of collections of addresses.
MutableList<List<Address>> addresses = people.collect(addressFunction);Using
flatCollect
returns a single flattened list of addresses.
MutableList<Address> addresses = people.flatCollect(addressFunction);
flatCollect
in interface MutableCollection<T>
flatCollect
in interface RichIterable<T>
flatCollect
in interface MutableSortedSet<T>
flatCollect
in interface SortedSetIterable<T>
function
- The Function
to applyfunction
public <V> MutableList<V> collectIf(Predicate<? super T> predicate, Function<? super T,? extends V> function)
RichIterable
e.g. Lists.mutable.of().with(1, 2, 3).collectIf(Predicates.notNull(), Functions.getToString())
collectIf
in interface MutableCollection<T>
collectIf
in interface RichIterable<T>
collectIf
in interface MutableSortedSet<T>
collectIf
in interface SortedSetIterable<T>
public <V> TreeSortedSetMultimap<V,T> groupBy(Function<? super T,? extends V> function)
RichIterable
e.g. return people.groupBy(new Function<Person, String>() { public String value(Person person) { return person.getFirstName() + " " + person.getLastName(); } });
groupBy
in interface MutableCollection<T>
groupBy
in interface SortedIterable<T>
groupBy
in interface RichIterable<T>
groupBy
in interface MutableSortedSet<T>
groupBy
in interface SortedSetIterable<T>
public <V> TreeSortedSetMultimap<V,T> groupByEach(Function<? super T,? extends Iterable<V>> function)
RichIterable
RichIterable.groupBy(Function)
, except the result of evaluating function will return a collection of keys
for each value.groupByEach
in interface MutableCollection<T>
groupByEach
in interface SortedIterable<T>
groupByEach
in interface RichIterable<T>
groupByEach
in interface MutableSortedSet<T>
groupByEach
in interface SortedSetIterable<T>
public <V> MutableMap<V,T> groupByUniqueKey(Function<? super T,? extends V> function)
RichIterable
groupByUniqueKey
in interface MutableCollection<T>
groupByUniqueKey
in interface RichIterable<T>
RichIterable.groupBy(Function)
public <P> TreeSortedSet<T> selectWith(Predicate2<? super T,? super P> predicate, P parameter)
RichIterable
RichIterable.select(Predicate)
, except with an evaluation parameter for the second generic argument in Predicate2
.selectWith
in interface MutableCollection<T>
selectWith
in interface SortedIterable<T>
selectWith
in interface RichIterable<T>
selectWith
in interface SetIterable<T>
selectWith
in interface MutableSortedSet<T>
selectWith
in interface SortedSetIterable<T>
predicate
- a Predicate2
to use as the select criteriaparameter
- a parameter to pass in for evaluation of the second argument P
in predicate
RichIterable.select(Predicate)
public <P> TreeSortedSet<T> rejectWith(Predicate2<? super T,? super P> predicate, P parameter)
RichIterable
RichIterable.reject(Predicate)
, except with an evaluation parameter for the second generic argument in Predicate2
.rejectWith
in interface MutableCollection<T>
rejectWith
in interface SortedIterable<T>
rejectWith
in interface RichIterable<T>
rejectWith
in interface SetIterable<T>
rejectWith
in interface MutableSortedSet<T>
rejectWith
in interface SortedSetIterable<T>
predicate
- a Predicate2
to use as the select criteriaparameter
- a parameter to pass in for evaluation of the second argument P
in predicate
RichIterable.select(Predicate)
public <P,V> MutableList<V> collectWith(Function2<? super T,? super P,? extends V> function, P parameter)
RichIterable
Function2
and specified parameter which is passed to the block
e.g. Function2addParameterFunction = new Function2 () { public Integer value(final Integer each, final Integer parameter) { return each + parameter; } }; FastList.newListWith(1, 2, 3).collectWith(addParameterFunction, Integer.valueOf(1));
collectWith
in interface MutableCollection<T>
collectWith
in interface RichIterable<T>
collectWith
in interface MutableSortedSet<T>
collectWith
in interface SortedSetIterable<T>
function
- A Function2
to use as the collect transformation functionparameter
- A parameter to pass in for evaluation of the second argument P
in function
RichIterable
that contains the transformed elements returned by Function2.value(Object, Object)
RichIterable.collect(Function)
public <S> MutableList<Pair<T,S>> zip(Iterable<S> that)
RichIterable
RichIterable
formed from this RichIterable
and another RichIterable
by
combining corresponding elements in pairs. If one of the two RichIterable
s is longer than the other, its
remaining elements are ignored.zip
in interface MutableCollection<T>
zip
in interface SortedIterable<T>
zip
in interface RichIterable<T>
zip
in interface MutableSortedSet<T>
S
- the type of the second half of the returned pairsthat
- The RichIterable
providing the second half of each result pairRichIterable
containing pairs consisting of corresponding elements of this RichIterable
and that. The length of the returned RichIterable
is the minimum of the lengths of
this RichIterable
and that.public TreeSortedSet<Pair<T,Integer>> zipWithIndex()
RichIterable
RichIterable
with its indices.zipWithIndex
in interface MutableCollection<T>
zipWithIndex
in interface SortedIterable<T>
zipWithIndex
in interface RichIterable<T>
zipWithIndex
in interface SetIterable<T>
zipWithIndex
in interface MutableSortedSet<T>
zipWithIndex
in interface SortedSetIterable<T>
RichIterable
containing pairs consisting of all elements of this RichIterable
paired with their index. Indices start at 0.RichIterable.zip(Iterable)
public MutableSortedSet<T> takeWhile(Predicate<? super T> predicate)
SortedIterable
takeWhile
in interface SortedIterable<T>
takeWhile
in interface MutableSortedSet<T>
takeWhile
in interface SortedSetIterable<T>
public MutableSortedSet<T> dropWhile(Predicate<? super T> predicate)
SortedIterable
dropWhile
in interface SortedIterable<T>
dropWhile
in interface MutableSortedSet<T>
dropWhile
in interface SortedSetIterable<T>
public MutableSortedSet<T> distinct()
SortedIterable
SortedIterable
containing the distinct elements in this iterable.
Conceptually similar to RichIterable.toSet()
.RichIterable.toList()
but retains the original order. If an element appears
multiple times in this iterable, the first one will be copied into the result.distinct
in interface SortedIterable<T>
distinct
in interface MutableSortedSet<T>
distinct
in interface SortedSetIterable<T>
SortedIterable
of distinct elementspublic boolean removeAllIterable(Iterable<?> iterable)
removeAllIterable
in interface MutableCollection<T>
removeAllIterable
in class AbstractMutableCollection<T>
Collection.removeAll(Collection)
public Comparator<? super T> comparator()
SortedSetIterable
comparator
in interface SortedIterable<T>
comparator
in interface SortedSetIterable<T>
comparator
in interface SortedSet<T>
public MutableSortedSet<T> subSet(T fromElement, T toElement)
public MutableSortedSet<T> headSet(T toElement)
public MutableSortedSet<T> tailSet(T fromElement)
public T getFirst()
RichIterable
getFirst
in interface RichIterable<T>
public T getLast()
RichIterable
getLast
in interface RichIterable<T>
public MutableSortedSet<SortedSetIterable<T>> powerSet()
SortedSetIterable
this
. For example, the powerset of [1, 2] is
[[], [1], [2], [1, 2]].powerSet
in interface MutableSortedSet<T>
powerSet
in interface SortedSetIterable<T>
public <B> LazyIterable<Pair<T,B>> cartesianProduct(SetIterable<B> set)
SetIterable
this
and b is a
member of set
.cartesianProduct
in interface SetIterable<T>
public TreeSortedSet<T> union(SetIterable<? extends T> set)
SortedSetIterable
this
or set
or both. The union of [1, 2, 3]
and [2, 3, 4] is the set [1, 2, 3, 4]. If equal elements appear in both sets, then the output will contain the
copy from this
.union
in interface SetIterable<T>
union
in interface MutableSortedSet<T>
union
in interface SortedSetIterable<T>
public TreeSortedSet<T> intersect(SetIterable<? extends T> set)
SortedSetIterable
this
and set
. The intersection of
[1, 2, 3] and [2, 3, 4] is the set [2, 3]. The output will contain instances from this
, not set
.intersect
in interface SetIterable<T>
intersect
in interface MutableSortedSet<T>
intersect
in interface SortedSetIterable<T>
public TreeSortedSet<T> difference(SetIterable<? extends T> subtrahendSet)
SortedSetIterable
this
that are not members of subtrahendSet
. The difference of
[1, 2, 3] and [2, 3, 4] is [1].difference
in interface SetIterable<T>
difference
in interface MutableSortedSet<T>
difference
in interface SortedSetIterable<T>
public MutableSortedSet<T> symmetricDifference(SetIterable<? extends T> setB)
SortedSetIterable
this
and setB
(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.symmetricDifference
in interface SetIterable<T>
symmetricDifference
in interface MutableSortedSet<T>
symmetricDifference
in interface SortedSetIterable<T>
public <R extends Set<T>> R unionInto(SetIterable<? extends T> set, R targetSet)
SetIterable
SetIterable.union(SetIterable)
but adds all the objects to targetSet
and returns it.unionInto
in interface SetIterable<T>
public <R extends Set<T>> R intersectInto(SetIterable<? extends T> set, R targetSet)
SetIterable
SetIterable.intersect(SetIterable)
but adds all the objects to targetSet
and returns it.intersectInto
in interface SetIterable<T>
public <R extends Set<T>> R differenceInto(SetIterable<? extends T> subtrahendSet, R targetSet)
SetIterable
SetIterable.difference(SetIterable)
but adds all the objects to targetSet
and returns it.differenceInto
in interface SetIterable<T>
public <R extends Set<T>> R symmetricDifferenceInto(SetIterable<? extends T> set, R targetSet)
SetIterable
SetIterable.symmetricDifference(SetIterable)
but adds all the objects to targetSet
and returns it.symmetricDifferenceInto
in interface SetIterable<T>
public boolean isSubsetOf(SetIterable<? extends T> candidateSuperset)
SetIterable
this
are also members of candidateSuperset
.
For example, [1, 2] is a subset of [1, 2, 3], but [1, 4] is not.isSubsetOf
in interface SetIterable<T>
public boolean isProperSubsetOf(SetIterable<? extends T> candidateSuperset)
SetIterable
this
are also members of candidateSuperset
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.isProperSubsetOf
in interface SetIterable<T>
public int size()
RichIterable
size
in interface RichIterable<T>
size
in interface Collection<T>
size
in interface Set<T>
public void writeExternal(ObjectOutput out) throws IOException
writeExternal
in interface Externalizable
IOException
public void readExternal(ObjectInput in) throws IOException, ClassNotFoundException
readExternal
in interface Externalizable
IOException
ClassNotFoundException
public int compareTo(SortedSetIterable<T> otherSet)
compareTo
in interface Comparable<SortedSetIterable<T>>
Copyright © 2004–2017. All rights reserved.