@FunctionalInterface public interface EntrySequence<K,V> extends IterableList<java.util.Map.Entry<K,V>>
Iterable sequence of Map.Entry elements with Stream-like operations for refining,
transforming and collating the list of Map.Entry elements.| Modifier and Type | Method and Description |
|---|---|
default boolean |
all(java.util.function.BiPredicate<? super K,? super V> biPredicate) |
default boolean |
any(java.util.function.BiPredicate<? super K,? super V> biPredicate) |
default EntrySequence<K,V> |
append(java.lang.Iterable<? extends java.util.Map.Entry<K,V>> that)
Append the elements of the given
Iterable to the end of this EntrySequence. |
default EntrySequence<K,V> |
append(java.util.Iterator<? extends java.util.Map.Entry<K,V>> iterator)
Append the elements of the given
Iterator to the end of this EntrySequence. |
default EntrySequence<K,V> |
append(java.util.Map.Entry<K,V>... entries)
Append the given elements to the end of this
EntrySequence. |
default EntrySequence<K,V> |
append(java.util.stream.Stream<java.util.Map.Entry<K,V>> stream)
Append the elements of the given
Stream to the end of this EntrySequence. |
default EntrySequence<K,V> |
appendEntry(K key,
V value)
Append the given entry to the end of this
EntrySequence. |
default java.util.Optional<java.util.Map.Entry<K,V>> |
at(int index) |
default java.util.Optional<java.util.Map.Entry<K,V>> |
at(int index,
java.util.function.BiPredicate<? super K,? super V> predicate) |
default java.util.Optional<java.util.Map.Entry<K,V>> |
at(int index,
java.util.function.Predicate<? super java.util.Map.Entry<K,V>> predicate) |
default Sequence<EntrySequence<K,V>> |
batch(java.util.function.BiPredicate<? super java.util.Map.Entry<K,V>,? super java.util.Map.Entry<K,V>> predicate)
Batch the elements of this
EntrySequence into a sequence of EntrySequences of distinct elements,
where the given predicate determines where to split the lists of partitioned elements. |
default Sequence<EntrySequence<K,V>> |
batch(int size)
Batch the elements of this
EntrySequence into a sequence of EntrySequences of distinct elements,
each with the given batch size. |
default Sequence<EntrySequence<K,V>> |
batch(QuaternaryPredicate<? super K,? super V,? super K,? super V> predicate)
Batch the elements of this
EntrySequence into a sequence of EntrySequences of distinct elements,
where the given predicate determines where to split the lists of partitioned elements. |
static <K,V> EntrySequence<K,V> |
cache(java.lang.Iterable<java.util.Map.Entry<K,V>> iterable)
Create an
EntrySequence with a cached copy of an Iterable of entries. |
static <K,V> EntrySequence<K,V> |
cache(java.util.Iterator<java.util.Map.Entry<K,V>> iterator)
Create an
EntrySequence with a cached copy of an Iterator of entries. |
static <K,V> EntrySequence<K,V> |
cache(java.util.stream.Stream<java.util.Map.Entry<K,V>> stream)
Create an
EntrySequence with a cached copy of a Stream of entries. |
default <S,R> S |
collect(java.util.stream.Collector<java.util.Map.Entry<K,V>,R,S> collector)
Collect this
EntrySequence into an arbitrary container using the given Collector. |
default <C> C |
collect(java.util.function.Supplier<? extends C> constructor,
java.util.function.BiConsumer<? super C,? super java.util.Map.Entry<K,V>> adder)
Collect this
EntrySequence into an arbitrary container using the given constructor and adder. |
default <C> C |
collectInto(C result,
java.util.function.BiConsumer<? super C,? super java.util.Map.Entry<K,V>> adder)
Collect this
EntrySequence into the given container, using the given adder. |
default <U extends java.util.Collection<java.util.Map.Entry<K,V>>> |
collectInto(U collection)
Collect this
EntrySequence into the given Collection. |
default boolean |
contains(K key,
V value) |
default boolean |
contains(java.util.Map.Entry<K,V> entry) |
default boolean |
containsAll(java.lang.Iterable<? extends java.util.Map.Entry<K,V>> entries) |
default boolean |
containsAll(java.util.Map.Entry<K,V>... entries) |
default boolean |
containsAny(java.lang.Iterable<? extends java.util.Map.Entry<K,V>> entries) |
default boolean |
containsAny(java.util.Map.Entry<K,V>... entries) |
default EntrySequence<K,V> |
distinct() |
static <K,V> EntrySequence<K,V> |
empty()
Create an empty
EntrySequence with no items. |
default EntrySequence<K,V> |
endingAt(java.util.function.BiPredicate<? super K,? super V> terminal)
Terminate this
EntrySequence when the given predicate is satisfied, including the element that satisfies
the predicate as the last element in the EntrySequence. |
default EntrySequence<K,V> |
endingAt(K key,
V value)
Terminate this
EntrySequence when the entry the given key and value is encountered,
including the element as the last element in the EntrySequence. |
default EntrySequence<K,V> |
endingAt(java.util.Map.Entry<K,V> terminal)
Terminate this
EntrySequence when the given element is encountered, including the element as the last
element in the EntrySequence. |
default EntrySequence<K,V> |
endingAt(java.util.function.Predicate<? super java.util.Map.Entry<K,V>> terminal)
Terminate this
EntrySequence when the given predicate is satisfied, including the element that satisfies
the predicate as the last element in the EntrySequence. |
default EntrySequence<K,V> |
excluding(java.lang.Iterable<? extends java.util.Map.Entry<K,V>> entries) |
default EntrySequence<K,V> |
excluding(java.util.Map.Entry<K,V>... entries) |
default EntrySequence<K,V> |
filter(java.util.function.BiPredicate<? super K,? super V> predicate)
Filter the elements in this
EntrySequence, keeping only the elements that match the given
BiPredicate. |
default EntrySequence<K,V> |
filter(java.util.function.Predicate<? super java.util.Map.Entry<K,V>> predicate)
Filter the elements in this
EntrySequence, keeping only the entries that match the given
Predicate. |
default EntrySequence<K,V> |
filterIndexed(ObjIntPredicate<? super java.util.Map.Entry<K,V>> predicate)
Filter the entries in this
EntrySequence, keeping only the elements that match the given
ObjIntPredicate, which is passed the current entry and its index in the sequence. |
default EntrySequence<K,V> |
filterIndexed(ObjObjIntPredicate<? super K,? super V> predicate)
Filter the entries in this
EntrySequence, keeping only the elements that match the given
ObjIntPredicate, which is passed the current entry and its index in the sequence. |
default java.util.Optional<java.util.Map.Entry<K,V>> |
first() |
default java.util.Optional<java.util.Map.Entry<K,V>> |
first(java.util.function.BiPredicate<? super K,? super V> predicate) |
default java.util.Optional<java.util.Map.Entry<K,V>> |
first(java.util.function.Predicate<? super java.util.Map.Entry<K,V>> predicate) |
default <T> Sequence<T> |
flatten() |
default <KK,VV> EntrySequence<KK,VV> |
flatten(java.util.function.BiFunction<? super K,? super V,? extends java.lang.Iterable<java.util.Map.Entry<KK,VV>>> mapper)
Flatten the elements in this
EntrySequence according to the given mapper BiFunction. |
default <KK,VV> EntrySequence<KK,VV> |
flatten(java.util.function.Function<? super java.util.Map.Entry<K,V>,? extends java.lang.Iterable<java.util.Map.Entry<KK,VV>>> mapper)
Flatten the elements in this
EntrySequence according to the given mapper Function. |
default <KK> EntrySequence<KK,V> |
flattenKeys(java.util.function.Function<? super java.util.Map.Entry<K,V>,? extends java.lang.Iterable<KK>> mapper)
Flatten the keys of each entry in this sequence, applying multiples of keys returned by the given
mapper to the same value of each entry.
|
default <VV> EntrySequence<K,VV> |
flattenValues(java.util.function.Function<? super java.util.Map.Entry<K,V>,? extends java.lang.Iterable<VV>> mapper)
Flatten the values of each entry in this sequence, applying multiples of values returned by the given
mapper to the same key of each entry.
|
default void |
forEach(java.util.function.BiConsumer<? super K,? super V> action)
Perform the given action for each element in this
EntrySequence. |
static <K,V> EntrySequence<K,V> |
from(java.lang.Iterable<java.util.Map.Entry<K,V>>... iterables)
Create a concatenated
EntrySequence from several Iterables of entries which are concatenated
together to form the stream of entries in the EntrySequence. |
static <K,V> EntrySequence<K,V> |
from(java.lang.Iterable<java.util.Map.Entry<K,V>> iterable)
Create an
EntrySequence from an Iterable of entries. |
static <K,V> EntrySequence<K,V> |
from(java.util.Map<K,V> map)
Create an
EntrySequence of Map.Entry key/value items from a Map of items. |
static <K,V> EntrySequence<K,V> |
generate(java.util.function.Supplier<java.util.Map.Entry<K,V>> supplier) |
default EntrySequence<K,V> |
including(java.lang.Iterable<? extends java.util.Map.Entry<K,V>> entries) |
default EntrySequence<K,V> |
including(java.util.Map.Entry<K,V>... entries) |
default java.lang.String |
join(java.lang.String delimiter)
Join this
EntrySequence into a string separated by the given delimiter. |
default java.lang.String |
join(java.lang.String prefix,
java.lang.String delimiter,
java.lang.String suffix)
Join this
EntrySequence into a string separated by the given delimiter, with the given prefix and
suffix. |
default java.util.Optional<java.util.Map.Entry<K,V>> |
last() |
default java.util.Optional<java.util.Map.Entry<K,V>> |
last(java.util.function.BiPredicate<? super K,? super V> predicate) |
default java.util.Optional<java.util.Map.Entry<K,V>> |
last(java.util.function.Predicate<? super java.util.Map.Entry<K,V>> predicate) |
default EntrySequence<K,V> |
limit(int limit)
Limit the maximum number of results returned by this
EntrySequence. |
default <KK,VV> EntrySequence<KK,VV> |
map(java.util.function.BiFunction<? super K,? super V,? extends java.util.Map.Entry<KK,VV>> mapper)
Map the entries in this
EntrySequence to another set of entries specified by the given mapper
function. |
default <KK,VV> EntrySequence<KK,VV> |
map(java.util.function.Function<? super K,? extends KK> keyMapper,
java.util.function.Function<? super V,? extends VV> valueMapper)
Map the entries in this
EntrySequence to another set of entries specified by the given keyMapper
amd valueMapper functions. |
default <KK,VV> EntrySequence<KK,VV> |
map(java.util.function.Function<? super java.util.Map.Entry<K,V>,? extends java.util.Map.Entry<KK,VV>> mapper)
Map the entries in this
EntrySequence to another set of entries specified by the given mapper
function. |
default <KK,VV> EntrySequence<KK,VV> |
mapIndexed(ObjIntFunction<? super java.util.Map.Entry<K,V>,? extends java.util.Map.Entry<KK,VV>> mapper)
Map the entries in this
EntrySequence to another set of entries specified by the given mapper
function. |
default <KK,VV> EntrySequence<KK,VV> |
mapIndexed(ObjObjIntFunction<? super K,? super V,? extends java.util.Map.Entry<KK,VV>> mapper)
Map the entries in this
EntrySequence to another set of entries specified by the given mapper
function. |
default java.util.Optional<java.util.Map.Entry<K,V>> |
max() |
default java.util.Optional<java.util.Map.Entry<K,V>> |
max(java.util.Comparator<? super java.util.Map.Entry<K,V>> comparator) |
default java.util.Optional<java.util.Map.Entry<K,V>> |
min() |
default java.util.Optional<java.util.Map.Entry<K,V>> |
min(java.util.Comparator<? super java.util.Map.Entry<K,V>> comparator) |
static <K,V> EntrySequence<K,V> |
multiGenerate(java.util.function.Supplier<? extends java.util.function.Supplier<? extends java.util.Map.Entry<K,V>>> supplierSupplier) |
default boolean |
none(java.util.function.BiPredicate<? super K,? super V> predicate) |
static <K,V> EntrySequence<K,V> |
of(java.util.Map.Entry<K,V>... items)
Create an
EntrySequence with the given Map.Entry list. |
static <K,V> EntrySequence<K,V> |
of(java.util.Map.Entry<K,V> item)
Create an
EntrySequence with one Map.Entry. |
static <K,V> EntrySequence<K,V> |
ofEntries(java.lang.Object... os)
Create an
EntrySequence with an Map.Entry list created from the given keys and values in sequence in
the input array. |
static <K,V> EntrySequence<K,V> |
ofEntry(K left,
V right)
Create an
EntrySequence with one Map.Entry of the given key and value. |
static <K,V> EntrySequence<K,V> |
once(java.util.Iterator<java.util.Map.Entry<K,V>> iterator)
Create a once-only
EntrySequence from an Iterator of entries. |
static <K,V> EntrySequence<K,V> |
once(java.util.stream.Stream<java.util.Map.Entry<K,V>> stream)
Create a once-only
EntrySequence from a Stream of entries. |
default EntrySequence<K,V> |
peek(java.util.function.BiConsumer<? super K,? super V> action)
Allow the given
BiConsumer to see the components of each entry in this EntrySequence as it is
traversed. |
default EntrySequence<K,V> |
peek(java.util.function.Consumer<? super java.util.Map.Entry<K,V>> consumer)
Allow the given
Consumer to see each entry in this EntrySequence as it is traversed. |
default EntrySequence<K,V> |
peekIndexed(java.util.function.ObjIntConsumer<? super java.util.Map.Entry<K,V>> action)
Allow the given
ObjIntConsumer to see each entry with its index as this EntrySequence is
traversed. |
default EntrySequence<K,V> |
peekIndexed(ObjObjIntConsumer<? super K,? super V> action)
Allow the given
ObjObjIntConsumer to see the components of each entry with their index as this
EntrySequence is traversed. |
static <K,V,KK,VV> |
recurse(K keySeed,
V valueSeed,
java.util.function.BiFunction<? super K,? super V,? extends java.util.Map.Entry<KK,VV>> f,
java.util.function.BiFunction<? super KK,? super VV,? extends java.util.Map.Entry<K,V>> g)
Returns an
EntrySequence produced by recursively applying the given mapper f and incrementer
g operations to the given seeds, the first element being f(keySeed, valueSeed), the second
being f(g(f(keySeed, valueSeed))), the third f(g(f(g(f(keySeed, valueSeed))))) and so on. |
static <K,V> EntrySequence<K,V> |
recurse(K keySeed,
V valueSeed,
java.util.function.BiFunction<K,V,? extends java.util.Map.Entry<K,V>> op)
Returns an
EntrySequence produced by recursively applying the given operation to the given seeds, which
form the first element of the sequence, the second being f(keySeed, valueSeed), the third
f(f(keySeed, valueSeed)) and so on. |
static <K,V> EntrySequence<K,V> |
recurse(java.util.Map.Entry<K,V> entry,
java.util.function.UnaryOperator<java.util.Map.Entry<K,V>> unaryOperator)
Returns an
EntrySequence produced by recursively applying the given operation to the given seed, which
form the first element of the sequence, the second being f(seed), the third f(f(seed)) and so
on. |
default java.util.Optional<java.util.Map.Entry<K,V>> |
reduce(java.util.function.BinaryOperator<java.util.Map.Entry<K,V>> operator)
Reduce this
EntrySequence into a single element by iteratively applying the given binary operator to
the current result and each entry in this sequence. |
default java.util.Map.Entry<K,V> |
reduce(K key,
V value,
QuaternaryFunction<K,V,K,V,java.util.Map.Entry<K,V>> operator)
Reduce this
EntrySequence into a single element by iteratively applying the given binary operator to
the current result and each entry in this sequence, starting with the given identity as the initial result. |
default java.util.Map.Entry<K,V> |
reduce(java.util.Map.Entry<K,V> identity,
java.util.function.BinaryOperator<java.util.Map.Entry<K,V>> operator)
Reduce this
EntrySequence into a single element by iteratively applying the given binary operator to
the current result and each entry in this sequence, starting with the given identity as the initial result. |
default java.util.Optional<java.util.Map.Entry<K,V>> |
reduce(QuaternaryFunction<K,V,K,V,java.util.Map.Entry<K,V>> operator)
Reduce this
EntrySequence into a single element by iteratively applying the given function to
the current result and each entry in this sequence. |
default EntrySequence<K,V> |
repeat()
Repeat this
EntrySequence forever, producing a sequence that never terminates unless the original
sequence is empty in which case the resulting sequence is also empty. |
default EntrySequence<K,V> |
repeat(int times)
Repeat this
EntrySequence the given number of times. |
default EntrySequence<K,V> |
reverse() |
default EntrySequence<K,V> |
shuffle() |
default EntrySequence<K,V> |
shuffle(java.util.Random random) |
default EntrySequence<K,V> |
shuffle(java.util.function.Supplier<? extends java.util.Random> randomSupplier) |
default EntrySequence<K,V> |
skip(int skip)
Skip a set number of steps in this
EntrySequence. |
default EntrySequence<K,V> |
skipTail(int skip)
Skip a set number of steps at the end of this
EntrySequence. |
default EntrySequence<K,V> |
sorted() |
default EntrySequence<K,V> |
sorted(java.util.Comparator<? super java.util.Map.Entry<? extends K,? extends V>> comparator) |
default Sequence<EntrySequence<K,V>> |
split(java.util.function.BiPredicate<? super K,? super V> predicate)
Split the elements of this
EntrySequence into a sequence of EntrySequences of distinct elements,
where the given predicate determines which elements to split the partitioned elements around. |
default Sequence<EntrySequence<K,V>> |
split(java.util.Map.Entry<K,V> element)
Split the elements of this
EntrySequence into a sequence of EntrySequences of distinct elements,
around the given element. |
default Sequence<EntrySequence<K,V>> |
split(java.util.function.Predicate<? super java.util.Map.Entry<K,V>> predicate)
Split the elements of this
EntrySequence into a sequence of EntrySequences of distinct elements,
where the given predicate determines which elements to split the partitioned elements around. |
default EntrySequence<K,V> |
startingAfter(java.util.function.BiPredicate<? super K,? super V> predicate)
Begin this
EntrySequence just after the given predicate is satisfied, not including the entry that
satisfies the predicate in the EntrySequence. |
default EntrySequence<K,V> |
startingAfter(java.util.Map.Entry<K,V> element)
Begin this
EntrySequence just after the given Entry is encountered, not including the entry in the
EntrySequence. |
default EntrySequence<K,V> |
startingAfter(java.util.function.Predicate<? super java.util.Map.Entry<K,V>> predicate)
Begin this
EntrySequence just after the given predicate is satisfied, not including the entry that
satisfies the predicate in the EntrySequence. |
default EntrySequence<K,V> |
startingFrom(java.util.function.BiPredicate<? super K,? super V> predicate)
Begin this
EntrySequence when the given predicate is satisfied, including the entry that satisfies
the predicate as the first element in the EntrySequence. |
default EntrySequence<K,V> |
startingFrom(java.util.Map.Entry<K,V> element)
Begin this
EntrySequence when the given Entry is encountered, including the entry as the first element
in the EntrySequence. |
default EntrySequence<K,V> |
startingFrom(java.util.function.Predicate<? super java.util.Map.Entry<K,V>> predicate)
Begin this
EntrySequence when the given predicate is satisfied, including the entry that satisfies
the predicate as the first element in the EntrySequence. |
default EntrySequence<K,V> |
step(int step)
Skip x number of steps in between each invocation of the iterator of this
EntrySequence. |
default java.util.Map.Entry<K,V>[] |
toArray()
Collect the entries in this
EntrySequence into an array. |
default java.util.Map.Entry<K,V>[] |
toArray(java.util.function.IntFunction<java.util.Map.Entry<K,V>[]> constructor)
Collect the entries in this
EntrySequence into an array of the type determined by the given array
constructor. |
default BiSequence<K,V> |
toBiSequence()
|
default CharSeq |
toChars(ToCharBiFunction<? super K,? super V> mapper)
Convert this
EntrySequence to a CharSeq using the given mapper function to map each entry to a
char. |
default CharSeq |
toChars(ToCharFunction<? super java.util.Map.Entry<K,V>> mapper)
Convert this
EntrySequence to a CharSeq using the given mapper function to map each entry to a
char. |
default <C extends java.util.Collection<java.util.Map.Entry<K,V>>> |
toCollection(java.util.function.Supplier<? extends C> constructor)
Collect this
EntrySequence into a Collection of the type determined by the given constructor. |
default DoubleSequence |
toDoubles(java.util.function.ToDoubleBiFunction<? super K,? super V> mapper)
Convert this
EntrySequence to a DoubleSequence using the given mapper function to map each entry
to a double. |
default DoubleSequence |
toDoubles(java.util.function.ToDoubleFunction<? super java.util.Map.Entry<K,V>> mapper)
Convert this
EntrySequence to a DoubleSequence using the given mapper function to map each entry
to a double. |
default IntSequence |
toInts(java.util.function.ToIntBiFunction<? super K,? super V> mapper)
Convert this
EntrySequence to an IntSequence using the given mapper function to map each entry
to an int. |
default IntSequence |
toInts(java.util.function.ToIntFunction<? super java.util.Map.Entry<K,V>> mapper)
Convert this
EntrySequence to an IntSequence using the given mapper function to map each entry
to an int. |
default java.util.List<java.util.Map.Entry<K,V>> |
toList()
Collect the entries in this
EntrySequence into a List. |
default java.util.List<java.util.Map.Entry<K,V>> |
toList(java.util.function.Supplier<java.util.List<java.util.Map.Entry<K,V>>> constructor)
Collect the entries in this
EntrySequence into a List of the type determined by the given
constructor. |
default LongSequence |
toLongs(java.util.function.ToLongBiFunction<? super K,? super V> mapper)
Convert this
EntrySequence to a LongSequence using the given mapper function to map each entry
to a long. |
default LongSequence |
toLongs(java.util.function.ToLongFunction<? super java.util.Map.Entry<K,V>> mapper)
Convert this
EntrySequence to a LongSequence using the given mapper function to map each entry
to a long. |
default java.util.Map<K,V> |
toMap()
Collect the entries in this
EntrySequence into a Map. |
default <M extends java.util.Map<K,V>> |
toMap(java.util.function.Supplier<? extends M> constructor)
Collect the entries in this
EntrySequence into a Map of the type determined by the given
constructor. |
default Sequence<java.util.Map.Entry<K,V>> |
toSequence()
|
default <T> Sequence<T> |
toSequence(java.util.function.BiFunction<? super K,? super V,? extends T> mapper)
Convert this
EntrySequence to a Sequence where each item is generated by the given mapper. |
default <T> Sequence<T> |
toSequence(java.util.function.Function<? super java.util.Map.Entry<K,V>,? extends T> mapper)
Convert this
EntrySequence to a Sequence where each item is generated by the given mapper. |
default java.util.Set<java.util.Map.Entry<K,V>> |
toSet()
Collect the entries in this
EntrySequence into a Set. |
default <S extends java.util.Set<java.util.Map.Entry<K,V>>> |
toSet(java.util.function.Supplier<? extends S> constructor)
Collect the entries in this
EntrySequence into a Set of the type determined by the given
constructor. |
default java.util.SortedMap<K,V> |
toSortedMap()
Collect the entries in this
EntrySequence into a SortedMap. |
default java.util.SortedSet<java.util.Map.Entry<K,V>> |
toSortedSet()
Collect the entries in this
EntrySequence into a SortedSet. |
default EntrySequence<K,V> |
until(java.util.function.BiPredicate<? super K,? super V> terminal)
Terminate this
EntrySequence just before the given predicate is satisfied, not including the element
that
satisfies the predicate in the EntrySequence. |
default EntrySequence<K,V> |
until(K key,
V value)
Terminate this
EntrySequence just before the entry with the given key and value is encountered,
not including the entry in the EntrySequence. |
default EntrySequence<K,V> |
until(java.util.Map.Entry<K,V> terminal)
Terminate this
EntrySequence just before the given element is encountered, not including the element in
the EntrySequence. |
default EntrySequence<K,V> |
until(java.util.function.Predicate<? super java.util.Map.Entry<K,V>> terminal)
Terminate this
EntrySequence just before the given predicate is satisfied, not including the element
that
satisfies the predicate in the EntrySequence. |
default Sequence<EntrySequence<K,V>> |
window(int window)
Window the elements of this
EntrySequence into a Sequence of EntrySequences of entrues,
each with the size of the given window. |
default Sequence<EntrySequence<K,V>> |
window(int window,
int step)
Window the elements of this
EntrySequence into a sequence of EntrySequences of elements, each
with the size of the given window, stepping step elements between each window. |
add, add, addAll, addAll, clear, contains, containsAll, from, get, indexOf, isEmpty, lastIndexOf, listIterator, listIterator, remove, remove, removeAll, retainAll, set, size, subList, toArraystatic <K,V> EntrySequence<K,V> empty()
EntrySequence with no items.empty in interface IterableCollection<java.util.Map.Entry<K,V>>#of(Entry),
#of(Entry...),
ofEntry(Object, Object),
ofEntries(Object...),
from(Iterable)static <K,V> EntrySequence<K,V> of(java.util.Map.Entry<K,V> item)
EntrySequence with one Map.Entry.of in interface IterableCollection<java.util.Map.Entry<K,V>>#of(Entry...),
ofEntry(Object, Object),
ofEntries(Object...),
from(Iterable)@SafeVarargs static <K,V> EntrySequence<K,V> of(java.util.Map.Entry<K,V>... items)
EntrySequence with the given Map.Entry list.of in interface IterableCollection<java.util.Map.Entry<K,V>>#of(Entry),
ofEntry(Object, Object),
ofEntries(Object...),
from(Iterable)static <K,V> EntrySequence<K,V> ofEntry(K left, V right)
EntrySequence with one Map.Entry of the given key and value.ofEntries(Object...),
#of(Entry),
#of(Entry...),
from(Iterable)static <K,V> EntrySequence<K,V> ofEntries(java.lang.Object... os)
EntrySequence with an Map.Entry list created from the given keys and values in sequence in
the input array.java.lang.IllegalArgumentException - if the array of keys and values is not of even length.ofEntry(Object, Object),
#of(Entry),
#of(Entry...),
from(Iterable)static <K,V> EntrySequence<K,V> from(java.lang.Iterable<java.util.Map.Entry<K,V>> iterable)
EntrySequence from an Iterable of entries.#of(Entry),
#of(Entry...),
from(Iterable...),
cache(Iterable)@SafeVarargs static <K,V> EntrySequence<K,V> from(java.lang.Iterable<java.util.Map.Entry<K,V>>... iterables)
EntrySequence from several Iterables of entries which are concatenated
together to form the stream of entries in the EntrySequence.#of(Entry),
#of(Entry...),
from(Iterable)static <K,V> EntrySequence<K,V> once(java.util.Iterator<java.util.Map.Entry<K,V>> iterator)
EntrySequence from an Iterator of entries. Note that EntrySequences
created from Iterators cannot be passed over more than once. Further attempts will register the
EntrySequence as empty.#of(Entry),
#of(Entry...),
from(Iterable),
cache(Iterator)static <K,V> EntrySequence<K,V> once(java.util.stream.Stream<java.util.Map.Entry<K,V>> stream)
EntrySequence from a Stream of entries. Note that EntrySequences
created from Streams cannot be passed over more than once. Further attempts will register the
EntrySequence as empty.#of(Entry),
#of(Entry...),
from(Iterable),
once(Iterator),
cache(Stream)static <K,V> EntrySequence<K,V> from(java.util.Map<K,V> map)
EntrySequence of Map.Entry key/value items from a Map of items. The resulting
EntrySequence can be mapped using Pair items, which implement Map.Entry and can thus be
processed as part of the EntrySequence's transformation steps.of(java.util.Map.Entry<K, V>),
from(Iterable)static <K,V> EntrySequence<K,V> cache(java.lang.Iterable<java.util.Map.Entry<K,V>> iterable)
EntrySequence with a cached copy of an Iterable of entries.cache(Iterator),
cache(Stream),
from(Iterable)static <K,V> EntrySequence<K,V> cache(java.util.Iterator<java.util.Map.Entry<K,V>> iterator)
EntrySequence with a cached copy of an Iterator of entries.cache(Iterable),
cache(Stream),
once(Iterator)static <K,V> EntrySequence<K,V> cache(java.util.stream.Stream<java.util.Map.Entry<K,V>> stream)
EntrySequence with a cached copy of a Stream of entries.cache(Iterable),
cache(Iterator),
once(Stream)static <K,V> EntrySequence<K,V> generate(java.util.function.Supplier<java.util.Map.Entry<K,V>> supplier)
EntrySequence generated by repeatedly calling the given supplier. The returned
EntrySequence never terminates naturally.#recurse(Entry, UnaryOperator),
recurse(Object, Object, BiFunction),
#endingAt(Entry),
#until(Entry)static <K,V> EntrySequence<K,V> multiGenerate(java.util.function.Supplier<? extends java.util.function.Supplier<? extends java.util.Map.Entry<K,V>>> supplierSupplier)
EntrySequence where each Collection.iterator() is generated by polling for a supplier
and then using it to generate the sequence of entries. The sequence never terminates.generate(Supplier),
#recurse(Entry, UnaryOperator),
#endingAt(Entry),
#until(Entry)static <K,V> EntrySequence<K,V> recurse(K keySeed, V valueSeed, java.util.function.BiFunction<K,V,? extends java.util.Map.Entry<K,V>> op)
EntrySequence produced by recursively applying the given operation to the given seeds, which
form the first element of the sequence, the second being f(keySeed, valueSeed), the third
f(f(keySeed, valueSeed)) and so on. The returned EntrySequence never terminates naturally.EntrySequence produced by recursively applying the given operation to the given seed#recurse(Entry, UnaryOperator),
generate(Supplier),
#endingAt(Entry),
#until(Entry)static <K,V> EntrySequence<K,V> recurse(java.util.Map.Entry<K,V> entry, java.util.function.UnaryOperator<java.util.Map.Entry<K,V>> unaryOperator)
EntrySequence produced by recursively applying the given operation to the given seed, which
form the first element of the sequence, the second being f(seed), the third f(f(seed)) and so
on. The returned EntrySequence never terminates naturally.EntrySequence produced by recursively applying the given operation to the given seed#recurse(Entry, UnaryOperator),
recurse(Object, Object, BiFunction),
generate(Supplier),
#endingAt(Entry),
#until(Entry)static <K,V,KK,VV> EntrySequence<KK,VV> recurse(K keySeed, V valueSeed, java.util.function.BiFunction<? super K,? super V,? extends java.util.Map.Entry<KK,VV>> f, java.util.function.BiFunction<? super KK,? super VV,? extends java.util.Map.Entry<K,V>> g)
EntrySequence produced by recursively applying the given mapper f and incrementer
g operations to the given seeds, the first element being f(keySeed, valueSeed), the second
being f(g(f(keySeed, valueSeed))), the third f(g(f(g(f(keySeed, valueSeed))))) and so on.
The returned EntrySequence never terminates naturally.f - a mapper function for producing elements that are to be included in the sequence, the first being
f(keySeed, valueSeed)g - an incrementer function for producing the next unmapped element to be included in the sequence,
applied to the first mapped element f(keySeed, valueSeed) to produce the second unmapped valueEntrySequence produced by recursively applying the given mapper and incrementer operations
to the
given seeds#recurse(Entry, UnaryOperator),
recurse(Object, Object, BiFunction),
#endingAt(Entry),
#until(Entry)default <KK,VV> EntrySequence<KK,VV> map(java.util.function.BiFunction<? super K,? super V,? extends java.util.Map.Entry<KK,VV>> mapper)
EntrySequence to another set of entries specified by the given mapper
function.map(Function),
map(Function, Function),
flatten(Function)default <KK,VV> EntrySequence<KK,VV> map(java.util.function.Function<? super java.util.Map.Entry<K,V>,? extends java.util.Map.Entry<KK,VV>> mapper)
EntrySequence to another set of entries specified by the given mapper
function.map(BiFunction),
map(Function, Function),
flatten(Function)default <KK,VV> EntrySequence<KK,VV> map(java.util.function.Function<? super K,? extends KK> keyMapper, java.util.function.Function<? super V,? extends VV> valueMapper)
EntrySequence to another set of entries specified by the given keyMapper
amd valueMapper functions.map(BiFunction),
map(Function),
flatten(Function)default <KK,VV> EntrySequence<KK,VV> mapIndexed(ObjIntFunction<? super java.util.Map.Entry<K,V>,? extends java.util.Map.Entry<KK,VV>> mapper)
EntrySequence to another set of entries specified by the given mapper
function. In addition to the current entry, the mapper has access to the index of each entry.map(Function),
flatten(Function)default <KK,VV> EntrySequence<KK,VV> mapIndexed(ObjObjIntFunction<? super K,? super V,? extends java.util.Map.Entry<KK,VV>> mapper)
EntrySequence to another set of entries specified by the given mapper
function. In addition to the current entry, the mapper has access to the index of each entry.map(Function),
flatten(Function)default EntrySequence<K,V> skip(int skip)
EntrySequence.default EntrySequence<K,V> skipTail(int skip)
EntrySequence.default EntrySequence<K,V> limit(int limit)
EntrySequence.default EntrySequence<K,V> filter(java.util.function.BiPredicate<? super K,? super V> predicate)
EntrySequence, keeping only the elements that match the given
BiPredicate.default EntrySequence<K,V> filter(java.util.function.Predicate<? super java.util.Map.Entry<K,V>> predicate)
EntrySequence, keeping only the entries that match the given
Predicate.default EntrySequence<K,V> filterIndexed(ObjIntPredicate<? super java.util.Map.Entry<K,V>> predicate)
EntrySequence, keeping only the elements that match the given
ObjIntPredicate, which is passed the current entry and its index in the sequence.default EntrySequence<K,V> filterIndexed(ObjObjIntPredicate<? super K,? super V> predicate)
EntrySequence, keeping only the elements that match the given
ObjIntPredicate, which is passed the current entry and its index in the sequence.default EntrySequence<K,V> including(java.util.Map.Entry<K,V>... entries)
EntrySequence containing only the entries found in the given target array.default EntrySequence<K,V> including(java.lang.Iterable<? extends java.util.Map.Entry<K,V>> entries)
EntrySequence containing only the entries found in the given target iterable.default EntrySequence<K,V> excluding(java.util.Map.Entry<K,V>... entries)
EntrySequence containing only the entries not found in the given target array.default EntrySequence<K,V> excluding(java.lang.Iterable<? extends java.util.Map.Entry<K,V>> entries)
EntrySequence containing only the entries not found in the given target iterable.default <T> Sequence<T> flatten()
Sequence of the Map.Entry elements in this EntrySequence flattened into their
key and value components strung together.default <KK,VV> EntrySequence<KK,VV> flatten(java.util.function.BiFunction<? super K,? super V,? extends java.lang.Iterable<java.util.Map.Entry<KK,VV>>> mapper)
EntrySequence according to the given mapper BiFunction. The
resulting EntrySequence contains the elements that is the result of applying the mapper
BiFunction to each element, appended together inline as a single EntrySequence.default <KK,VV> EntrySequence<KK,VV> flatten(java.util.function.Function<? super java.util.Map.Entry<K,V>,? extends java.lang.Iterable<java.util.Map.Entry<KK,VV>>> mapper)
EntrySequence according to the given mapper Function. The
resulting EntrySequence contains the entries that is the result of applying the mapper
Function to each entry, appended together inline as a single EntrySequence.default <KK> EntrySequence<KK,V> flattenKeys(java.util.function.Function<? super java.util.Map.Entry<K,V>,? extends java.lang.Iterable<KK>> mapper)
default <VV> EntrySequence<K,VV> flattenValues(java.util.function.Function<? super java.util.Map.Entry<K,V>,? extends java.lang.Iterable<VV>> mapper)
default EntrySequence<K,V> until(java.util.Map.Entry<K,V> terminal)
EntrySequence just before the given element is encountered, not including the element in
the EntrySequence.until(Predicate),
#endingAt(Entry),
generate(Supplier),
recurse(K, V, java.util.function.BiFunction<K, V, ? extends java.util.Map.Entry<K, V>>),
repeat()default EntrySequence<K,V> endingAt(java.util.Map.Entry<K,V> terminal)
EntrySequence when the given element is encountered, including the element as the last
element in the EntrySequence.endingAt(Predicate),
#until(Entry),
generate(Supplier),
#recurse(Entry, UnaryOperator),
repeat()default EntrySequence<K,V> until(K key, V value)
EntrySequence just before the entry with the given key and value is encountered,
not including the entry in the EntrySequence.#until(Entry),
until(Predicate),
until(BiPredicate),
#endingAt(Entry),
generate(Supplier),
#recurse(Entry, UnaryOperator),
repeat()default EntrySequence<K,V> endingAt(K key, V value)
EntrySequence when the entry the given key and value is encountered,
including the element as the last element in the EntrySequence.#endingAt(Entry),
endingAt(Predicate),
endingAt(BiPredicate),
#until(Entry),
generate(Supplier),
#recurse(Entry, UnaryOperator),
repeat()default EntrySequence<K,V> until(java.util.function.BiPredicate<? super K,? super V> terminal)
EntrySequence just before the given predicate is satisfied, not including the element
that
satisfies the predicate in the EntrySequence.until(Predicate),
until(Object, Object),
#until(Entry),
endingAt(Predicate),
generate(Supplier),
#recurse(Entry, UnaryOperator),
repeat()default EntrySequence<K,V> endingAt(java.util.function.BiPredicate<? super K,? super V> terminal)
EntrySequence when the given predicate is satisfied, including the element that satisfies
the predicate as the last element in the EntrySequence.endingAt(Predicate),
endingAt(Object, Object),
#endingAt(Entry),
until(Predicate),
generate(Supplier),
#recurse(Entry, UnaryOperator),
repeat()default EntrySequence<K,V> until(java.util.function.Predicate<? super java.util.Map.Entry<K,V>> terminal)
EntrySequence just before the given predicate is satisfied, not including the element
that
satisfies the predicate in the EntrySequence.until(BiPredicate),
#until(Entry),
endingAt(Predicate),
generate(Supplier),
#recurse(Entry, UnaryOperator),
repeat()default EntrySequence<K,V> endingAt(java.util.function.Predicate<? super java.util.Map.Entry<K,V>> terminal)
EntrySequence when the given predicate is satisfied, including the element that satisfies
the predicate as the last element in the EntrySequence.endingAt(BiPredicate),
#endingAt(Entry),
until(Predicate),
generate(Supplier),
#recurse(Entry, UnaryOperator),
repeat()default EntrySequence<K,V> startingAfter(java.util.Map.Entry<K,V> element)
EntrySequence just after the given Entry is encountered, not including the entry in the
EntrySequence.startingAfter(Predicate),
startingAfter(BiPredicate),
#startingFrom(Entry)default EntrySequence<K,V> startingFrom(java.util.Map.Entry<K,V> element)
EntrySequence when the given Entry is encountered, including the entry as the first element
in the EntrySequence.startingFrom(Predicate),
startingFrom(BiPredicate),
#startingAfter(Entry)default EntrySequence<K,V> startingAfter(java.util.function.Predicate<? super java.util.Map.Entry<K,V>> predicate)
EntrySequence just after the given predicate is satisfied, not including the entry that
satisfies the predicate in the EntrySequence.startingAfter(BiPredicate),
#startingAfter(Entry),
startingFrom(Predicate)default EntrySequence<K,V> startingFrom(java.util.function.Predicate<? super java.util.Map.Entry<K,V>> predicate)
EntrySequence when the given predicate is satisfied, including the entry that satisfies
the predicate as the first element in the EntrySequence.startingFrom(BiPredicate),
#startingFrom(Entry),
startingAfter(Predicate)default EntrySequence<K,V> startingAfter(java.util.function.BiPredicate<? super K,? super V> predicate)
EntrySequence just after the given predicate is satisfied, not including the entry that
satisfies the predicate in the EntrySequence.startingAfter(Predicate),
#startingAfter(Entry),
startingFrom(Predicate)default EntrySequence<K,V> startingFrom(java.util.function.BiPredicate<? super K,? super V> predicate)
EntrySequence when the given predicate is satisfied, including the entry that satisfies
the predicate as the first element in the EntrySequence.startingFrom(Predicate),
#startingFrom(Entry),
startingAfter(Predicate)default java.util.Map.Entry<K,V>[] toArray()
EntrySequence into an array.toArray in interface java.util.Collection<java.util.Map.Entry<K,V>>toArray in interface IterableCollection<java.util.Map.Entry<K,V>>toArray in interface IterableList<java.util.Map.Entry<K,V>>toArray in interface java.util.List<java.util.Map.Entry<K,V>>default java.util.Map.Entry<K,V>[] toArray(java.util.function.IntFunction<java.util.Map.Entry<K,V>[]> constructor)
EntrySequence into an array of the type determined by the given array
constructor.default java.util.List<java.util.Map.Entry<K,V>> toList()
EntrySequence into a List.default java.util.List<java.util.Map.Entry<K,V>> toList(java.util.function.Supplier<java.util.List<java.util.Map.Entry<K,V>>> constructor)
EntrySequence into a List of the type determined by the given
constructor.default java.util.Set<java.util.Map.Entry<K,V>> toSet()
EntrySequence into a Set.default <S extends java.util.Set<java.util.Map.Entry<K,V>>> S toSet(java.util.function.Supplier<? extends S> constructor)
EntrySequence into a Set of the type determined by the given
constructor.default java.util.SortedSet<java.util.Map.Entry<K,V>> toSortedSet()
EntrySequence into a SortedSet.default <M extends java.util.Map<K,V>> M toMap(java.util.function.Supplier<? extends M> constructor)
EntrySequence into a Map of the type determined by the given
constructor.default java.util.SortedMap<K,V> toSortedMap()
EntrySequence into a SortedMap.default <C extends java.util.Collection<java.util.Map.Entry<K,V>>> C toCollection(java.util.function.Supplier<? extends C> constructor)
EntrySequence into a Collection of the type determined by the given constructor.default <C> C collect(java.util.function.Supplier<? extends C> constructor,
java.util.function.BiConsumer<? super C,? super java.util.Map.Entry<K,V>> adder)
EntrySequence into an arbitrary container using the given constructor and adder.default <S,R> S collect(java.util.stream.Collector<java.util.Map.Entry<K,V>,R,S> collector)
EntrySequence into an arbitrary container using the given Collector.default <U extends java.util.Collection<java.util.Map.Entry<K,V>>> U collectInto(U collection)
EntrySequence into the given Collection.default <C> C collectInto(C result,
java.util.function.BiConsumer<? super C,? super java.util.Map.Entry<K,V>> adder)
EntrySequence into the given container, using the given adder.default java.lang.String join(java.lang.String delimiter)
EntrySequence into a string separated by the given delimiter.default java.lang.String join(java.lang.String prefix,
java.lang.String delimiter,
java.lang.String suffix)
EntrySequence into a string separated by the given delimiter, with the given prefix and
suffix.default java.util.Optional<java.util.Map.Entry<K,V>> reduce(java.util.function.BinaryOperator<java.util.Map.Entry<K,V>> operator)
EntrySequence into a single element by iteratively applying the given binary operator to
the current result and each entry in this sequence.default java.util.Optional<java.util.Map.Entry<K,V>> reduce(QuaternaryFunction<K,V,K,V,java.util.Map.Entry<K,V>> operator)
EntrySequence into a single element by iteratively applying the given function to
the current result and each entry in this sequence. The function is passed the key and value of the result,
followed by the keys and values of the current entry, respectively.default java.util.Map.Entry<K,V> reduce(java.util.Map.Entry<K,V> identity, java.util.function.BinaryOperator<java.util.Map.Entry<K,V>> operator)
EntrySequence into a single element by iteratively applying the given binary operator to
the current result and each entry in this sequence, starting with the given identity as the initial result.default java.util.Map.Entry<K,V> reduce(K key, V value, QuaternaryFunction<K,V,K,V,java.util.Map.Entry<K,V>> operator)
EntrySequence into a single element by iteratively applying the given binary operator to
the current result and each entry in this sequence, starting with the given identity as the initial result.
The function is passed the key and value of the result, followed by the keys and values of the current entry,
respectively.default java.util.Optional<java.util.Map.Entry<K,V>> first()
EntrySequence or an empty Optional if there are no entries in
the EntrySequence.default java.util.Optional<java.util.Map.Entry<K,V>> last()
EntrySequence or an empty Optional if there are no entries in
the EntrySequence.default java.util.Optional<java.util.Map.Entry<K,V>> at(int index)
Optional if the EntrySequence is smaller
than the index.default java.util.Optional<java.util.Map.Entry<K,V>> first(java.util.function.Predicate<? super java.util.Map.Entry<K,V>> predicate)
EntrySequence that matches the given predicate, or an empty
Optional if there are no matching entries in the EntrySequence.default java.util.Optional<java.util.Map.Entry<K,V>> last(java.util.function.Predicate<? super java.util.Map.Entry<K,V>> predicate)
EntrySequence the matches the given predicate, or an empty
Optional
if there are no matching entries in the EntrySequence.default java.util.Optional<java.util.Map.Entry<K,V>> at(int index, java.util.function.Predicate<? super java.util.Map.Entry<K,V>> predicate)
Optional if the EntrySequence of matching entries is smaller than the index.default java.util.Optional<java.util.Map.Entry<K,V>> first(java.util.function.BiPredicate<? super K,? super V> predicate)
EntrySequence that matches the given predicate, or an empty
Optional if there are no matching entries in the EntrySequence.default java.util.Optional<java.util.Map.Entry<K,V>> last(java.util.function.BiPredicate<? super K,? super V> predicate)
EntrySequence the matches the given predicate, or an empty
Optional if there are no matching entries in the EntrySequence.default java.util.Optional<java.util.Map.Entry<K,V>> at(int index, java.util.function.BiPredicate<? super K,? super V> predicate)
Optional if the EntrySequence of matching entries is smaller than the index.default Sequence<EntrySequence<K,V>> window(int window)
EntrySequence into a Sequence of EntrySequences of entrues,
each with the size of the given window. The first item in each sequence is the second item in the previous
sequence. The final sequence may be shorter than the window. This method is equivalent to
window(window, 1).default Sequence<EntrySequence<K,V>> window(int window, int step)
EntrySequence into a sequence of EntrySequences of elements, each
with the size of the given window, stepping step elements between each window. If the given step is less
than the window size, the windows will overlap each other. If the step is larger than the window size, elements
will be skipped in between windows.default Sequence<EntrySequence<K,V>> batch(int size)
EntrySequence into a sequence of EntrySequences of distinct elements,
each with the given batch size. This method is equivalent to window(size, size).default Sequence<EntrySequence<K,V>> batch(java.util.function.BiPredicate<? super java.util.Map.Entry<K,V>,? super java.util.Map.Entry<K,V>> predicate)
EntrySequence into a sequence of EntrySequences of distinct elements,
where the given predicate determines where to split the lists of partitioned elements. The predicate is given
the current and next item in the iteration, and if it returns true a partition is created between the elements.default Sequence<EntrySequence<K,V>> batch(QuaternaryPredicate<? super K,? super V,? super K,? super V> predicate)
EntrySequence into a sequence of EntrySequences of distinct elements,
where the given predicate determines where to split the lists of partitioned elements. The predicate is given
the keys and values of the current and next items in the iteration, and if it returns true a partition is
created between the elements.default Sequence<EntrySequence<K,V>> split(java.util.Map.Entry<K,V> element)
EntrySequence into a sequence of EntrySequences of distinct elements,
around the given element. The elements around which the sequence is split are not included in the result.default Sequence<EntrySequence<K,V>> split(java.util.function.Predicate<? super java.util.Map.Entry<K,V>> predicate)
EntrySequence into a sequence of EntrySequences of distinct elements,
where the given predicate determines which elements to split the partitioned elements around. The elements
matching the predicate are not included in the result.default Sequence<EntrySequence<K,V>> split(java.util.function.BiPredicate<? super K,? super V> predicate)
EntrySequence into a sequence of EntrySequences of distinct elements,
where the given predicate determines which elements to split the partitioned elements around. The elements
matching the predicate are not included in the result.default EntrySequence<K,V> step(int step)
EntrySequence.default EntrySequence<K,V> distinct()
EntrySequence where each item in this EntrySequence occurs only once, the first time
it is encountered.default EntrySequence<K,V> sorted()
EntrySequence sorted according to the natural order.default EntrySequence<K,V> sorted(java.util.Comparator<? super java.util.Map.Entry<? extends K,? extends V>> comparator)
EntrySequence sorted according to the given Comparator.default java.util.Optional<java.util.Map.Entry<K,V>> min()
EntrySequence according to their natural order. The entries in the
sequence must all implement Comparable or a ClassCastException will be thrown at runtime.default java.util.Optional<java.util.Map.Entry<K,V>> max()
EntrySequence according to their natural order. The entries in the
sequence must all implement Comparable or a ClassCastException will be thrown at runtime.default java.util.Optional<java.util.Map.Entry<K,V>> min(java.util.Comparator<? super java.util.Map.Entry<K,V>> comparator)
EntrySequence according to the given Comparator.default java.util.Optional<java.util.Map.Entry<K,V>> max(java.util.Comparator<? super java.util.Map.Entry<K,V>> comparator)
EntrySequence according to the given Comparator.default boolean all(java.util.function.BiPredicate<? super K,? super V> biPredicate)
EntrySequence satisfy the given predicate, false otherwise.default boolean none(java.util.function.BiPredicate<? super K,? super V> predicate)
EntrySequence satisfy the given predicate, false otherwise.default boolean any(java.util.function.BiPredicate<? super K,? super V> biPredicate)
EntrySequence satisfies the given predicate, false otherwise.default EntrySequence<K,V> peek(java.util.function.BiConsumer<? super K,? super V> action)
BiConsumer to see the components of each entry in this EntrySequence as it is
traversed.default EntrySequence<K,V> peek(java.util.function.Consumer<? super java.util.Map.Entry<K,V>> consumer)
Consumer to see each entry in this EntrySequence as it is traversed.default EntrySequence<K,V> peekIndexed(ObjObjIntConsumer<? super K,? super V> action)
ObjObjIntConsumer to see the components of each entry with their index as this
EntrySequence is traversed.default EntrySequence<K,V> peekIndexed(java.util.function.ObjIntConsumer<? super java.util.Map.Entry<K,V>> action)
ObjIntConsumer to see each entry with its index as this EntrySequence is
traversed.default EntrySequence<K,V> append(java.util.Iterator<? extends java.util.Map.Entry<K,V>> iterator)
Iterator to the end of this EntrySequence.
The appended elements will only be available on the first traversal of the resulting Sequence.
default EntrySequence<K,V> append(java.lang.Iterable<? extends java.util.Map.Entry<K,V>> that)
Iterable to the end of this EntrySequence.default EntrySequence<K,V> append(java.util.Map.Entry<K,V>... entries)
EntrySequence.default EntrySequence<K,V> appendEntry(K key, V value)
EntrySequence.default EntrySequence<K,V> append(java.util.stream.Stream<java.util.Map.Entry<K,V>> stream)
Stream to the end of this EntrySequence.
The appended elements will only be available on the first traversal of the resulting EntrySequence.
default <T> Sequence<T> toSequence(java.util.function.BiFunction<? super K,? super V,? extends T> mapper)
EntrySequence to a Sequence where each item is generated by the given mapper.default <T> Sequence<T> toSequence(java.util.function.Function<? super java.util.Map.Entry<K,V>,? extends T> mapper)
EntrySequence to a Sequence where each item is generated by the given mapper.default BiSequence<K,V> toBiSequence()
default CharSeq toChars(ToCharBiFunction<? super K,? super V> mapper)
EntrySequence to a CharSeq using the given mapper function to map each entry to a
char.default IntSequence toInts(java.util.function.ToIntBiFunction<? super K,? super V> mapper)
EntrySequence to an IntSequence using the given mapper function to map each entry
to an int.default LongSequence toLongs(java.util.function.ToLongBiFunction<? super K,? super V> mapper)
EntrySequence to a LongSequence using the given mapper function to map each entry
to a long.default DoubleSequence toDoubles(java.util.function.ToDoubleBiFunction<? super K,? super V> mapper)
EntrySequence to a DoubleSequence using the given mapper function to map each entry
to a double.default CharSeq toChars(ToCharFunction<? super java.util.Map.Entry<K,V>> mapper)
EntrySequence to a CharSeq using the given mapper function to map each entry to a
char.default IntSequence toInts(java.util.function.ToIntFunction<? super java.util.Map.Entry<K,V>> mapper)
EntrySequence to an IntSequence using the given mapper function to map each entry
to an int.default LongSequence toLongs(java.util.function.ToLongFunction<? super java.util.Map.Entry<K,V>> mapper)
EntrySequence to a LongSequence using the given mapper function to map each entry
to a long.default DoubleSequence toDoubles(java.util.function.ToDoubleFunction<? super java.util.Map.Entry<K,V>> mapper)
EntrySequence to a DoubleSequence using the given mapper function to map each entry
to a double.default EntrySequence<K,V> repeat()
EntrySequence forever, producing a sequence that never terminates unless the original
sequence is empty in which case the resulting sequence is also empty.default EntrySequence<K,V> repeat(int times)
EntrySequence the given number of times.default EntrySequence<K,V> reverse()
EntrySequence which iterates over this EntrySequence in reverse order.default EntrySequence<K,V> shuffle()
EntrySequence which iterates over this EntrySequence in random order.default EntrySequence<K,V> shuffle(java.util.Random random)
EntrySequence which iterates over this EntrySequence in random order as determined by
the given random generator.default EntrySequence<K,V> shuffle(java.util.function.Supplier<? extends java.util.Random> randomSupplier)
EntrySequence which iterates over this EntrySequence in random order as determined by
the given random generator. A new instance of Random is created by the given supplier at the start of
each iteration.default boolean contains(java.util.Map.Entry<K,V> entry)
EntrySequence contains the given entry, false otherwise.default boolean contains(K key, V value)
EntrySequence contains the given pair, false otherwise.default boolean containsAll(java.util.Map.Entry<K,V>... entries)
EntrySequence contains all of the given entries, false otherwise.default boolean containsAny(java.util.Map.Entry<K,V>... entries)
EntrySequence contains any of the given entries, false otherwise.default boolean containsAll(java.lang.Iterable<? extends java.util.Map.Entry<K,V>> entries)
EntrySequence contains all of the given entries, false otherwise.default boolean containsAny(java.lang.Iterable<? extends java.util.Map.Entry<K,V>> entries)
EntrySequence contains any of the given entries, false otherwise.