T - Component type of the Listpublic abstract class List<T> extends java.lang.Object implements LinearSeq<T>
List is an eager sequence of elements. Its immutability makes it suitable for concurrent programming.
A List is composed of a head element and a tail List.
There are two implementations of the List interface:
List.Nil, which represents the empty List.List.Cons, which represents a List containing one or more elements.List is a Stack in the sense that it stores elements allowing a last-in-first-out (LIFO) retrieval.
Stack API:
peek()peekOption()pop()popOption()pop2()pop2Option()push(Object)push(Object[])pushAll(Iterable)List:
// factory methods
List.empty() // = List.of()
List.of(x) // e.g. List.of(1)
List.of(Object...) // e.g. List.of(1, 2, 3)
List.ofAll(Iterable) // e.g. List.ofAll(Stream.of(1, 2, 3)) = 1, 2, 3
List.ofAll(<primitive array>) // e.g. List.of(new int[] {1, 2, 3}) = 1, 2, 3
// int sequences
List.range(0, 3) // = 0, 1, 2
List.rangeClosed(0, 3) // = 0, 1, 2, 3
Note: A List is primarily a Seq and extends Stack for technical reasons (so Stack does not need to wrap List).
If operating on a List, please prefer
prepend(Object) over push(Object)prependAll(Iterable) over pushAll(Iterable)tail() over pop()tailOption() over popOption()
List<Integer> s1 = List.of(1);
List<Integer> s2 = List.of(1, 2, 3);
// = List.of(new Integer[] {1, 2, 3});
List<int[]> s3 = List.ofAll(1, 2, 3);
List<List<Integer>> s4 = List.ofAll(List.of(1, 2, 3));
List<Integer> s5 = List.ofAll(1, 2, 3);
List<Integer> s6 = List.ofAll(List.of(1, 2, 3));
// cuckoo's egg
List<Integer[]> s7 = List.<Integer[]> of(new Integer[] {1, 2, 3});
Example: Converting a String to digits
// = List(1, 2, 3)
List.of("123".toCharArray()).map(c -> Character.digit(c, 10))
See Okasaki, Chris: Purely Functional Data Structures (p. 7 ff.). Cambridge, 2003.| Modifier and Type | Class and Description |
|---|---|
static class |
List.Cons<T>
Deprecated.
will be removed from the public API
|
static class |
List.Nil<T>
Deprecated.
will be removed from the public API
|
| Modifier and Type | Method and Description |
|---|---|
List<T> |
append(T element)
Appends an element to this.
|
List<T> |
appendAll(java.lang.Iterable<? extends T> elements)
Appends all given elements to this.
|
T |
apply(java.lang.Integer index)
A
Seq is a partial function which returns the element at the specified index if the
index is valid. |
java.util.List<T> |
asJava()
Creates an immutable
List view on top of this Seq,
i.e. |
List<T> |
asJava(java.util.function.Consumer<? super java.util.List<T>> action)
Creates an immutable
List view on top of this Seq
that is passed to the given action. |
java.util.List<T> |
asJavaMutable()
Creates a mutable
List view on top of this Seq,
i.e. |
List<T> |
asJavaMutable(java.util.function.Consumer<? super java.util.List<T>> action)
Creates a mutable
List view on top of this Seq
that is passed to the given action. |
<R> List<R> |
collect(PartialFunction<? super T,? extends R> partialFunction)
Collects all elements that are in the domain of the given
partialFunction by mapping the elements to type R. |
static <T> java.util.stream.Collector<T,java.util.ArrayList<T>,List<T>> |
collector()
Returns a
Collector which may be used in conjunction with
Stream.collect(java.util.stream.Collector) to obtain a List. |
List<List<T>> |
combinations()
Returns the union of all combinations from k = 0 to length().
|
List<List<T>> |
combinations(int k)
Returns the k-combination of this traversable, i.e.
|
Iterator<List<T>> |
crossProduct(int power)
Calculates the n-ary cartesian power (or cross product or simply product) of this.
|
List<T> |
distinct()
Returns a new version of this which contains no duplicates.
|
List<T> |
distinctBy(java.util.Comparator<? super T> comparator)
Returns a new version of this which contains no duplicates.
|
<U> List<T> |
distinctBy(java.util.function.Function<? super T,? extends U> keyExtractor)
Returns a new version of this which contains no duplicates.
|
List<T> |
drop(int n)
Drops the first n elements of this or all elements, if this length < n.
|
List<T> |
dropRight(int n)
Drops the last n elements of this or all elements, if this length < n.
|
List<T> |
dropRightUntil(java.util.function.Predicate<? super T> predicate)
Drops elements until the predicate holds for the current element, starting from the end.
|
List<T> |
dropRightWhile(java.util.function.Predicate<? super T> predicate)
Drops elements while the predicate holds for the current element, starting from the end.
|
List<T> |
dropUntil(java.util.function.Predicate<? super T> predicate)
Drops elements until the predicate holds for the current element.
|
List<T> |
dropWhile(java.util.function.Predicate<? super T> predicate)
Drops elements while the predicate holds for the current element.
|
static <T> List<T> |
empty()
Returns the single instance of Nil.
|
static <T> List<T> |
fill(int n,
java.util.function.Supplier<? extends T> s)
Returns a List containing
n values supplied by a given Supplier s. |
static <T> List<T> |
fill(int n,
T element)
Returns a List containing
n times the given element |
List<T> |
filter(java.util.function.Predicate<? super T> predicate)
Returns a new traversable consisting of all elements which satisfy the given predicate.
|
List<T> |
filterNot(java.util.function.Predicate<? super T> predicate)
Returns a new traversable consisting of all elements which do not satisfy the given predicate.
|
<U> List<U> |
flatMap(java.util.function.Function<? super T,? extends java.lang.Iterable<? extends U>> mapper)
FlatMaps this Traversable.
|
Seq<List<T>> |
group()
Groups subsequent equal elements.
|
<C> Map<C,List<T>> |
groupBy(java.util.function.Function<? super T,? extends C> classifier)
Groups this elements by classifying the elements.
|
Iterator<List<T>> |
grouped(int size)
Groups this
Traversable into fixed size blocks. |
boolean |
hasDefiniteSize()
Checks if this Traversable is known to have a finite size.
|
int |
indexOf(T element,
int from)
Returns the index of the first occurrence of the given element after or at some start index
or -1 if this does not contain the given element.
|
List<T> |
init()
Dual of Traversable.tail(), returning all elements except the last.
|
Option<List<T>> |
initOption()
Dual of Traversable.tailOption(), returning all elements except the last as
Option. |
List<T> |
insert(int index,
T element)
Inserts the given element at the specified index.
|
List<T> |
insertAll(int index,
java.lang.Iterable<? extends T> elements)
Inserts the given elements at the specified index.
|
List<T> |
intersperse(T element)
Inserts an element between all elements of this Traversable.
|
boolean |
isAsync()
A
List is computed synchronously. |
boolean |
isDefinedAt(java.lang.Integer index)
Deprecated.
|
abstract boolean |
isEmpty()
Checks if this Traversable is empty.
|
boolean |
isLazy()
A
List is computed eagerly. |
boolean |
isTraversableAgain()
Checks if this Traversable can be repeatedly traversed.
|
T |
last()
Dual of Traversable.head(), returning the last element.
|
int |
lastIndexOf(T element,
int end)
Returns the index of the last occurrence of the given element before or at a given end index
or -1 if this does not contain the given element.
|
List<T> |
leftPadTo(int length,
T element)
A copy of this sequence with an element prepended until a given target length is reached.
|
abstract int |
length()
Computes the number of elements of this Traversable.
|
<U> List<U> |
map(java.util.function.Function<? super T,? extends U> mapper)
Maps the elements of this
Traversable to elements of a new type preserving their order, if any. |
static <T> List<T> |
narrow(List<? extends T> list)
Narrows a widened
List<? extends T> to List<T>
by performing a type-safe cast. |
static <T> List<T> |
of(T... elements)
Creates a List of the given elements.
|
static <T> List<T> |
of(T element)
Returns a singleton
List, i.e. |
static List<java.lang.Boolean> |
ofAll(boolean... elements)
Creates a List from boolean values.
|
static List<java.lang.Byte> |
ofAll(byte... elements)
Creates a List from byte values.
|
static List<java.lang.Character> |
ofAll(char... elements)
Creates a List from char values.
|
static List<java.lang.Double> |
ofAll(double... elements)
Creates a List from double values.
|
static List<java.lang.Float> |
ofAll(float... elements)
Creates a List from float values.
|
static List<java.lang.Integer> |
ofAll(int... elements)
Creates a List from int values.
|
static <T> List<T> |
ofAll(java.lang.Iterable<? extends T> elements)
Creates a List of the given elements.
|
static List<java.lang.Long> |
ofAll(long... elements)
Creates a List from long values.
|
static List<java.lang.Short> |
ofAll(short... elements)
Creates a List from short values.
|
static <T> List<T> |
ofAll(java.util.stream.Stream<? extends T> javaStream)
Creates a List that contains the elements of the given
Stream. |
List<T> |
orElse(java.lang.Iterable<? extends T> other)
Returns this
Traversable if it is nonempty, otherwise return the alternative. |
List<T> |
orElse(java.util.function.Supplier<? extends java.lang.Iterable<? extends T>> supplier)
Returns this
Traversable if it is nonempty, otherwise return the result of evaluating supplier. |
List<T> |
padTo(int length,
T element)
A copy of this sequence with an element appended until a given target length is reached.
|
Tuple2<List<T>,List<T>> |
partition(java.util.function.Predicate<? super T> predicate)
Creates a partition of this
Traversable by splitting this elements in two in distinct traversables
according to a predicate. |
List<T> |
patch(int from,
java.lang.Iterable<? extends T> that,
int replaced)
Produces a new list where a slice of elements in this list is replaced by another sequence.
|
T |
peek()
Deprecated.
use head() instead
|
List<T> |
peek(java.util.function.Consumer<? super T> action)
Performs an action on the head element of this
List. |
Option<T> |
peekOption()
Deprecated.
use headOption() instead
|
List<List<T>> |
permutations()
Computes all unique permutations.
|
List<T> |
pop()
Deprecated.
use tail() instead
|
Tuple2<T,List<T>> |
pop2()
Deprecated.
use Tuple.of(list.head(), list.tail()) instead
|
Option<Tuple2<T,List<T>>> |
pop2Option()
Deprecated.
use list.isEmpty() ? Option.none() : Option.some(Tuple.of(list.head(), list.tail())) instead
|
Option<List<T>> |
popOption()
Deprecated.
use tailOption() instead
|
List<T> |
prepend(T element)
Prepends an element to this.
|
List<T> |
prependAll(java.lang.Iterable<? extends T> elements)
Prepends all given elements to this.
|
List<T> |
push(T... elements)
Deprecated.
use prependAll(List.of(elements).reverse()) instead
|
List<T> |
push(T element)
Deprecated.
use prepend(T) instead
|
List<T> |
pushAll(java.lang.Iterable<T> elements)
Deprecated.
use prependAll(List.of(elements).reverse()) instead
|
static List<java.lang.Character> |
range(char from,
char toExclusive) |
static List<java.lang.Integer> |
range(int from,
int toExclusive)
Creates a List of int numbers starting from
from, extending to toExclusive - 1. |
static List<java.lang.Long> |
range(long from,
long toExclusive)
Creates a List of long numbers starting from
from, extending to toExclusive - 1. |
static List<java.lang.Character> |
rangeBy(char from,
char toExclusive,
int step) |
static List<java.lang.Double> |
rangeBy(double from,
double toExclusive,
double step) |
static List<java.lang.Integer> |
rangeBy(int from,
int toExclusive,
int step)
Creates a List of int numbers starting from
from, extending to toExclusive - 1,
with step. |
static List<java.lang.Long> |
rangeBy(long from,
long toExclusive,
long step)
Creates a List of long numbers starting from
from, extending to toExclusive - 1,
with step. |
static List<java.lang.Character> |
rangeClosed(char from,
char toInclusive) |
static List<java.lang.Integer> |
rangeClosed(int from,
int toInclusive)
Creates a List of int numbers starting from
from, extending to toInclusive. |
static List<java.lang.Long> |
rangeClosed(long from,
long toInclusive)
Creates a List of long numbers starting from
from, extending to toInclusive. |
static List<java.lang.Character> |
rangeClosedBy(char from,
char toInclusive,
int step) |
static List<java.lang.Double> |
rangeClosedBy(double from,
double toInclusive,
double step) |
static List<java.lang.Integer> |
rangeClosedBy(int from,
int toInclusive,
int step)
Creates a List of int numbers starting from
from, extending to toInclusive,
with step. |
static List<java.lang.Long> |
rangeClosedBy(long from,
long toInclusive,
long step)
Creates a List of long numbers starting from
from, extending to toInclusive,
with step. |
List<T> |
remove(T element)
Removes the first occurrence of the given element.
|
List<T> |
removeAll(java.lang.Iterable<? extends T> elements)
Removes all occurrences of the given elements.
|
List<T> |
removeAll(T element)
Removes all occurrences of the given element.
|
List<T> |
removeAt(int index)
Removes the element at the specified position in this sequence.
|
List<T> |
removeFirst(java.util.function.Predicate<T> predicate)
Removes the first occurrence that satisfy predicate
|
List<T> |
removeLast(java.util.function.Predicate<T> predicate)
Removes the last occurrence that satisfy predicate
|
List<T> |
replace(T currentElement,
T newElement)
Replaces the first occurrence (if exists) of the given currentElement with newElement.
|
List<T> |
replaceAll(T currentElement,
T newElement)
Replaces all occurrences of the given currentElement with newElement.
|
List<T> |
retainAll(java.lang.Iterable<? extends T> elements)
Keeps all occurrences of the given elements from this.
|
List<T> |
reverse()
Reverses the order of elements.
|
List<T> |
rotateLeft(int n)
Circular rotates the elements by the specified distance to the left direction.
|
List<T> |
rotateRight(int n)
Circular rotates the elements by the specified distance to the right direction.
|
List<T> |
scan(T zero,
java.util.function.BiFunction<? super T,? super T,? extends T> operation)
Computes a prefix scan of the elements of the collection.
|
<U> List<U> |
scanLeft(U zero,
java.util.function.BiFunction<? super U,? super T,? extends U> operation)
Produces a collection containing cumulative results of applying the
operator going left to right.
|
<U> List<U> |
scanRight(U zero,
java.util.function.BiFunction<? super T,? super U,? extends U> operation)
Produces a collection containing cumulative results of applying the
operator going right to left.
|
List<T> |
shuffle()
Randomize the order of the elements in the current sequence.
|
List<T> |
shuffle(java.util.Random random)
Randomize the order of the elements in the current sequence using the given source
of randomness.
|
List<T> |
slice(int beginIndex,
int endIndex)
Returns a Seq that is a slice of this.
|
Iterator<List<T>> |
slideBy(java.util.function.Function<? super T,?> classifier)
Slides a non-overlapping window of a variable size over this
Traversable. |
Iterator<List<T>> |
sliding(int size)
Slides a window of a specific
size and step size 1 over this Traversable by calling
Traversable.sliding(int, int). |
Iterator<List<T>> |
sliding(int size,
int step)
Slides a window of a specific
size and step size over this Traversable. |
<U> List<T> |
sortBy(java.util.Comparator<? super U> comparator,
java.util.function.Function<? super T,? extends U> mapper)
Sorts this elements by comparing the elements in a different domain, using the given
mapper. |
<U extends java.lang.Comparable<? super U>> |
sortBy(java.util.function.Function<? super T,? extends U> mapper)
Sorts this elements by comparing the elements in a different domain, using the given
mapper. |
List<T> |
sorted()
Sorts this elements according to their natural order.
|
List<T> |
sorted(java.util.Comparator<? super T> comparator)
Sorts this elements according to the provided
Comparator. |
Tuple2<List<T>,List<T>> |
span(java.util.function.Predicate<? super T> predicate)
Returns a tuple where the first element is the longest prefix of elements that satisfy the given
predicate and the second element is the remainder. |
Tuple2<List<T>,List<T>> |
splitAt(int n)
Splits a Seq at the specified index.
|
Tuple2<List<T>,List<T>> |
splitAt(java.util.function.Predicate<? super T> predicate)
Splits a sequence at the first element which satisfies the
Predicate, e.g. |
Tuple2<List<T>,List<T>> |
splitAtInclusive(java.util.function.Predicate<? super T> predicate)
Splits a sequence at the first element which satisfies the
Predicate, e.g. |
java.lang.String |
stringPrefix()
Returns the name of this Value type, which is used by toString().
|
List<T> |
subSequence(int beginIndex)
Returns a Seq that is a subsequence of this.
|
List<T> |
subSequence(int beginIndex,
int endIndex)
Returns a Seq that is a subsequence of this.
|
static <T> List<T> |
tabulate(int n,
java.util.function.Function<? super java.lang.Integer,? extends T> f)
Returns a List containing
n values of a given Function f
over a range of integer values from 0 to n - 1. |
abstract List<T> |
tail()
Drops the first element of a non-empty Traversable.
|
Option<List<T>> |
tailOption()
Drops the first element of a non-empty Traversable and returns an
Option. |
List<T> |
take(int n)
Takes the first n elements of this or all elements, if this length < n.
|
List<T> |
takeRight(int n)
Takes the last n elements of this or all elements, if this length < n.
|
List<T> |
takeRightUntil(java.util.function.Predicate<? super T> predicate)
Takes elements until the predicate holds for the current element, starting from the end.
|
List<T> |
takeRightWhile(java.util.function.Predicate<? super T> predicate)
Takes elements while the predicate holds for the current element, starting from the end.
|
List<T> |
takeUntil(java.util.function.Predicate<? super T> predicate)
Takes elements until the predicate holds for the current element.
|
List<T> |
takeWhile(java.util.function.Predicate<? super T> predicate)
Takes elements while the predicate holds for the current element.
|
<U> U |
transform(java.util.function.Function<? super List<T>,? extends U> f)
Transforms this
List. |
static <T> List<List<T>> |
transpose(List<List<T>> matrix)
Transposes the rows and columns of a
List matrix. |
static <T> List<T> |
unfold(T seed,
java.util.function.Function<? super T,Option<Tuple2<? extends T,? extends T>>> f)
Creates a list from a seed value and a function.
|
static <T,U> List<U> |
unfoldLeft(T seed,
java.util.function.Function<? super T,Option<Tuple2<? extends T,? extends U>>> f)
Creates a list from a seed value and a function.
|
static <T,U> List<U> |
unfoldRight(T seed,
java.util.function.Function<? super T,Option<Tuple2<? extends U,? extends T>>> f)
Creates a list from a seed value and a function.
|
List<T> |
update(int index,
java.util.function.Function<? super T,? extends T> updater)
Updates the given element at the specified index using the specified function.
|
List<T> |
update(int index,
T element)
Updates the given element at the specified index.
|
<U> List<Tuple2<T,U>> |
zip(java.lang.Iterable<? extends U> that)
Returns a traversable formed from this traversable and another Iterable collection by combining
corresponding elements in pairs.
|
<U> List<Tuple2<T,U>> |
zipAll(java.lang.Iterable<? extends U> that,
T thisElem,
U thatElem)
Returns a traversable formed from this traversable and another Iterable by combining corresponding elements in
pairs.
|
<U,R> List<R> |
zipWith(java.lang.Iterable<? extends U> that,
java.util.function.BiFunction<? super T,? super U,? extends R> mapper)
Returns a traversable formed from this traversable and another Iterable collection by mapping elements.
|
List<Tuple2<T,java.lang.Integer>> |
zipWithIndex()
Zips this traversable with its indices.
|
<U> List<U> |
zipWithIndex(java.util.function.BiFunction<? super T,? super java.lang.Integer,? extends U> mapper)
Zips this traversable with its indices by applying mapper provided.
|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, waitasPartialFunction, indexOfSlice, indexWhere, lastIndexOfSlice, lastIndexWhere, narrow, reverseIterator, search, search, segmentLengthcontainsSlice, crossProduct, crossProduct, endsWith, foldRight, get, getOption, getOrElse, indexOf, indexOfOption, indexOfOption, indexOfSlice, indexOfSliceOption, indexOfSliceOption, indexWhere, indexWhereOption, indexWhereOption, isSequential, iterator, lastIndexOf, lastIndexOfOption, lastIndexOfOption, lastIndexOfSlice, lastIndexOfSliceOption, lastIndexOfSliceOption, lastIndexWhere, lastIndexWhereOption, lastIndexWhereOption, lift, narrow, prefixLength, startsWith, startsWitharrangeBy, average, containsAll, count, equals, existsUnique, find, findLast, fold, foldLeft, forEachWithIndex, get, hashCode, head, headOption, isDistinct, isOrdered, isSingleValued, iterator, lastOption, max, maxBy, maxBy, min, minBy, minBy, mkCharSeq, mkCharSeq, mkCharSeq, mkString, mkString, mkString, narrow, nonEmpty, product, reduce, reduceLeft, reduceLeftOption, reduceOption, reduceRight, reduceRightOption, single, singleOption, size, spliterator, sum, toLinkedMap, toMap, toSortedMap, toSortedMap, unzip, unzip3collect, collect, contains, corresponds, eq, exists, forAll, forEach, getOrElse, getOrElse, getOrElseThrow, getOrElseTry, getOrNull, narrow, out, out, stderr, stdout, toArray, toCharSeq, toCompletableFuture, toEither, toEither, toInvalid, toInvalid, toJavaArray, toJavaArray, toJavaArray, toJavaCollection, toJavaList, toJavaList, toJavaMap, toJavaMap, toJavaMap, toJavaOptional, toJavaParallelStream, toJavaSet, toJavaSet, toJavaStream, toLeft, toLeft, toLinkedMap, toLinkedMap, toLinkedSet, toList, toMap, toMap, toOption, toPriorityQueue, toPriorityQueue, toQueue, toRight, toRight, toSet, toSortedMap, toSortedMap, toSortedMap, toSortedMap, toSortedSet, toSortedSet, toStream, toString, toTree, toTree, toTry, toTry, toValid, toValid, toValidation, toValidation, toVectorpublic static <T> java.util.stream.Collector<T,java.util.ArrayList<T>,List<T>> collector()
Collector which may be used in conjunction with
Stream.collect(java.util.stream.Collector) to obtain a List.T - Component type of the List.Collector which collects all the input elements into a
List, in encounter orderpublic static <T> List<T> empty()
Note: this method intentionally returns type List and not Nil. This comes handy when folding.
T - Component type of Nil, determined by type inference in the particular context.public final boolean isAsync()
List is computed synchronously.public abstract boolean isEmpty()
Traversablepublic final boolean isLazy()
List is computed eagerly.public static <T> List<T> narrow(List<? extends T> list)
List<? extends T> to List<T>
by performing a type-safe cast. This is eligible because immutable/read-only
collections are covariant.T - Component type of the List.list - A List.list instance as narrowed type List<T>.public static <T> List<T> of(T element)
List, i.e. a List of one element.@SafeVarargs public static <T> List<T> of(T... elements)
List.of(1, 2, 3, 4)
T - Component type of the List.elements - Zero or more elements.java.lang.NullPointerException - if elements is nullpublic static <T> List<T> ofAll(java.lang.Iterable<? extends T> elements)
The resulting list has the same iteration order as the given iterable of elements if the iteration order of the elements is stable.
T - Component type of the List.elements - An Iterable of elements.java.lang.NullPointerException - if elements is nullpublic static <T> List<T> ofAll(java.util.stream.Stream<? extends T> javaStream)
Stream.T - Component type of the Stream.javaStream - A Streampublic static List<java.lang.Boolean> ofAll(boolean... elements)
elements - boolean valuesjava.lang.NullPointerException - if elements is nullpublic static List<java.lang.Byte> ofAll(byte... elements)
elements - byte valuesjava.lang.NullPointerException - if elements is nullpublic static List<java.lang.Character> ofAll(char... elements)
elements - char valuesjava.lang.NullPointerException - if elements is nullpublic static List<java.lang.Double> ofAll(double... elements)
elements - double valuesjava.lang.NullPointerException - if elements is nullpublic static List<java.lang.Float> ofAll(float... elements)
elements - a float valuesjava.lang.NullPointerException - if elements is nullpublic static List<java.lang.Integer> ofAll(int... elements)
elements - int valuesjava.lang.NullPointerException - if elements is nullpublic static List<java.lang.Long> ofAll(long... elements)
elements - long valuesjava.lang.NullPointerException - if elements is nullpublic static List<java.lang.Short> ofAll(short... elements)
elements - short valuesjava.lang.NullPointerException - if elements is nullpublic static <T> List<T> tabulate(int n, java.util.function.Function<? super java.lang.Integer,? extends T> f)
n values of a given Function f
over a range of integer values from 0 to n - 1.T - Component type of the Listn - The number of elements in the Listf - The Function computing element valuesf(0),f(1), ..., f(n - 1)java.lang.NullPointerException - if f is nullpublic static <T> List<T> fill(int n, java.util.function.Supplier<? extends T> s)
n values supplied by a given Supplier s.T - Component type of the Listn - The number of elements in the Lists - The Supplier computing element valuesn, where each element contains the result supplied by s.java.lang.NullPointerException - if s is nullpublic static <T> List<T> fill(int n, T element)
n times the given elementT - Component type of the Listn - The number of elements in the Listelement - The elementn, where each element is the given element.public static List<java.lang.Character> range(char from, char toExclusive)
public static List<java.lang.Character> rangeBy(char from, char toExclusive, int step)
public static List<java.lang.Double> rangeBy(double from, double toExclusive, double step)
public static List<java.lang.Integer> range(int from, int toExclusive)
from, extending to toExclusive - 1.
Examples:
List.range(0, 0) // = List()
List.range(2, 0) // = List()
List.range(-2, 2) // = List(-2, -1, 0, 1)
from - the first numbertoExclusive - the last number + 1from >= toExclusivepublic static List<java.lang.Integer> rangeBy(int from, int toExclusive, int step)
from, extending to toExclusive - 1,
with step.
Examples:
List.rangeBy(1, 3, 1) // = List(1, 2)
List.rangeBy(1, 4, 2) // = List(1, 3)
List.rangeBy(4, 1, -2) // = List(4, 2)
List.rangeBy(4, 1, 2) // = List()
from - the first numbertoExclusive - the last number + 1step - the stepfrom >= toInclusive and step > 0 orfrom <= toInclusive and step < 0java.lang.IllegalArgumentException - if step is zeropublic static List<java.lang.Long> range(long from, long toExclusive)
from, extending to toExclusive - 1.
Examples:
List.range(0L, 0L) // = List()
List.range(2L, 0L) // = List()
List.range(-2L, 2L) // = List(-2L, -1L, 0L, 1L)
from - the first numbertoExclusive - the last number + 1from >= toExclusivepublic static List<java.lang.Long> rangeBy(long from, long toExclusive, long step)
from, extending to toExclusive - 1,
with step.
Examples:
List.rangeBy(1L, 3L, 1L) // = List(1L, 2L)
List.rangeBy(1L, 4L, 2L) // = List(1L, 3L)
List.rangeBy(4L, 1L, -2L) // = List(4L, 2L)
List.rangeBy(4L, 1L, 2L) // = List()
from - the first numbertoExclusive - the last number + 1step - the stepfrom >= toInclusive and step > 0 orfrom <= toInclusive and step < 0java.lang.IllegalArgumentException - if step is zeropublic static List<java.lang.Character> rangeClosed(char from, char toInclusive)
public static List<java.lang.Character> rangeClosedBy(char from, char toInclusive, int step)
public static List<java.lang.Double> rangeClosedBy(double from, double toInclusive, double step)
public static List<java.lang.Integer> rangeClosed(int from, int toInclusive)
from, extending to toInclusive.
Examples:
List.rangeClosed(0, 0) // = List(0)
List.rangeClosed(2, 0) // = List()
List.rangeClosed(-2, 2) // = List(-2, -1, 0, 1, 2)
from - the first numbertoInclusive - the last numberfrom > toInclusivepublic static List<java.lang.Integer> rangeClosedBy(int from, int toInclusive, int step)
from, extending to toInclusive,
with step.
Examples:
List.rangeClosedBy(1, 3, 1) // = List(1, 2, 3)
List.rangeClosedBy(1, 4, 2) // = List(1, 3)
List.rangeClosedBy(4, 1, -2) // = List(4, 2)
List.rangeClosedBy(4, 1, 2) // = List()
from - the first numbertoInclusive - the last numberstep - the stepfrom > toInclusive and step > 0 orfrom < toInclusive and step < 0java.lang.IllegalArgumentException - if step is zeropublic static List<java.lang.Long> rangeClosed(long from, long toInclusive)
from, extending to toInclusive.
Examples:
List.rangeClosed(0L, 0L) // = List(0L)
List.rangeClosed(2L, 0L) // = List()
List.rangeClosed(-2L, 2L) // = List(-2L, -1L, 0L, 1L, 2L)
from - the first numbertoInclusive - the last numberfrom > toInclusivepublic static List<java.lang.Long> rangeClosedBy(long from, long toInclusive, long step)
from, extending to toInclusive,
with step.
Examples:
List.rangeClosedBy(1L, 3L, 1L) // = List(1L, 2L, 3L)
List.rangeClosedBy(1L, 4L, 2L) // = List(1L, 3L)
List.rangeClosedBy(4L, 1L, -2L) // = List(4L, 2L)
List.rangeClosedBy(4L, 1L, 2L) // = List()
from - the first numbertoInclusive - the last numberstep - the stepfrom > toInclusive and step > 0 orfrom < toInclusive and step < 0java.lang.IllegalArgumentException - if step is zeropublic static <T> List<List<T>> transpose(List<List<T>> matrix)
List matrix.T - matrix element typematrix - to be transposed.List matrix.java.lang.IllegalArgumentException - if the row lengths of matrix differ.
ex: List.transpose(List(List(1,2,3), List(4,5,6))) → List(List(1,4), List(2,5), List(3,6))
public static <T,U> List<U> unfoldRight(T seed, java.util.function.Function<? super T,Option<Tuple2<? extends U,? extends T>>> f)
None when it's
done generating the list, otherwise Some Tuple
of the element for the next call and the value to add to the
resulting list.
Example:
List.unfoldRight(10, x -> x == 0
? Option.none()
: Option.of(new Tuple2<>(x, x-1)));
// List(10, 9, 8, 7, 6, 5, 4, 3, 2, 1))
T - type of seedsU - type of unfolded valuesseed - the start value for the iterationf - the function to get the next step of the iterationjava.lang.NullPointerException - if f is nullpublic static <T,U> List<U> unfoldLeft(T seed, java.util.function.Function<? super T,Option<Tuple2<? extends T,? extends U>>> f)
None when it's
done generating the list, otherwise Some Tuple
of the value to add to the resulting list and
the element for the next call.
Example:
List.unfoldLeft(10, x -> x == 0
? Option.none()
: Option.of(new Tuple2<>(x-1, x)));
// List(1, 2, 3, 4, 5, 6, 7, 8, 9, 10))
T - type of seedsU - type of unfolded valuesseed - the start value for the iterationf - the function to get the next step of the iterationjava.lang.NullPointerException - if f is nullpublic static <T> List<T> unfold(T seed, java.util.function.Function<? super T,Option<Tuple2<? extends T,? extends T>>> f)
None when it's
done generating the list, otherwise Some Tuple
of the value to add to the resulting list and
the element for the next call.
Example:
List.unfold(10, x -> x == 0
? Option.none()
: Option.of(new Tuple2<>(x-1, x)));
// List(1, 2, 3, 4, 5, 6, 7, 8, 9, 10))
T - type of seeds and unfolded valuesseed - the start value for the iterationf - the function to get the next step of the iterationjava.lang.NullPointerException - if f is nullpublic final List<T> append(T element)
Seqpublic final List<T> appendAll(java.lang.Iterable<? extends T> elements)
Seqpublic final java.util.List<T> asJava()
SeqList view on top of this Seq,
i.e. calling mutators will result in UnsupportedOperationException at runtime.
The difference to conversion methods toJava*() is that
java.util.List view throws UnsupportedOperationException before
checking method arguments. Java does handle this case inconsistently.public final List<T> asJava(java.util.function.Consumer<? super java.util.List<T>> action)
SeqList view on top of this Seq
that is passed to the given action.public final java.util.List<T> asJavaMutable()
SeqList view on top of this Seq,
i.e. all mutator methods of the List are implemented.asJavaMutable in interface Seq<T>Collection view on this Traversable.Seq.asJava()public final List<T> asJavaMutable(java.util.function.Consumer<? super java.util.List<T>> action)
SeqList view on top of this Seq
that is passed to the given action.asJavaMutable in interface LinearSeq<T>asJavaMutable in interface Seq<T>action - A side-effecting unit of work that operates on a mutable java.util.List view.java.util.List view or a new instance of this type, if write operations are performed on the java.util.List view.Seq.asJavaMutable()public final <R> List<R> collect(PartialFunction<? super T,? extends R> partialFunction)
TraversablepartialFunction by mapping the elements to type R.
More specifically, for each of this elements in iteration order first it is checked
partialFunction.isDefinedAt(element)
If the elements makes it through that filter, the mapped instance is added to the result collection
R newElement = partialFunction.apply(element)
Note:If this Traversable is ordered (i.e. extends Ordered,
the caller of collect has to ensure that the elements are comparable (i.e. extend Comparable).collect in interface LinearSeq<T>collect in interface Seq<T>collect in interface Traversable<T>R - The new element typepartialFunction - A function that is not necessarily defined of all elements of this traversable.Traversable instance containing elements of type Rpublic final List<List<T>> combinations()
SeqExamples:
[].combinations() = [[]]
[1,2,3].combinations() = [
[], // k = 0
[1], [2], [3], // k = 1
[1,2], [1,3], [2,3], // k = 2
[1,2,3] // k = 3
]
combinations in interface LinearSeq<T>combinations in interface Seq<T>public final List<List<T>> combinations(int k)
Seqcombinations in interface LinearSeq<T>combinations in interface Seq<T>k - Size of subsetspublic final Iterator<List<T>> crossProduct(int power)
SeqExample:
// = ((A,A), (A,B), (A,C), ..., (B,A), (B,B), ..., (Z,Y), (Z,Z))
CharSeq.rangeClosed('A', 'Z').crossProduct(2);
Cartesian power of negative value will return empty iterator.
Example:
// = ()
CharSeq.rangeClosed('A', 'Z').crossProduct(-1);
crossProduct in interface LinearSeq<T>crossProduct in interface Seq<T>power - the number of cartesian multiplicationspublic final List<T> distinct()
Traversableequals.public final List<T> distinctBy(java.util.Comparator<? super T> comparator)
Traversablecomparator.distinctBy in interface LinearSeq<T>distinctBy in interface Seq<T>distinctBy in interface Traversable<T>comparator - A comparatorTraversable containing this elements without duplicatespublic final <U> List<T> distinctBy(java.util.function.Function<? super T,? extends U> keyExtractor)
Traversableequals.
The elements of the result are determined in the order of their occurrence - first match wins.
distinctBy in interface LinearSeq<T>distinctBy in interface Seq<T>distinctBy in interface Traversable<T>U - key typekeyExtractor - A key extractorTraversable containing this elements without duplicatespublic final List<T> drop(int n)
Traversabledrop in interface LinearSeq<T>drop in interface Seq<T>drop in interface Traversable<T>n - The number of elements to drop.public final List<T> dropUntil(java.util.function.Predicate<? super T> predicate)
TraversabledropUntil in interface LinearSeq<T>dropUntil in interface Seq<T>dropUntil in interface Traversable<T>predicate - A condition tested subsequently for this elements.public final List<T> dropWhile(java.util.function.Predicate<? super T> predicate)
Traversable
Note: This is essentially the same as dropUntil(predicate.negate()).
It is intended to be used with method references, which cannot be negated directly.
dropWhile in interface LinearSeq<T>dropWhile in interface Seq<T>dropWhile in interface Traversable<T>predicate - A condition tested subsequently for this elements.public final List<T> dropRight(int n)
TraversabledropRight in interface LinearSeq<T>dropRight in interface Seq<T>dropRight in interface Traversable<T>n - The number of elements to drop.public final List<T> dropRightUntil(java.util.function.Predicate<? super T> predicate)
SeqdropRightUntil in interface LinearSeq<T>dropRightUntil in interface Seq<T>predicate - A condition tested subsequently for this elements, starting from the end.public final List<T> dropRightWhile(java.util.function.Predicate<? super T> predicate)
Seq
Note: This is essentially the same as dropRightUntil(predicate.negate()).
It is intended to be used with method references, which cannot be negated directly.
dropRightWhile in interface LinearSeq<T>dropRightWhile in interface Seq<T>predicate - A condition tested subsequently for this elements, starting from the end.public final List<T> filter(java.util.function.Predicate<? super T> predicate)
Traversablepublic final List<T> filterNot(java.util.function.Predicate<? super T> predicate)
TraversableThe default implementation is equivalent to
filter(predicate.negate()public final <U> List<U> flatMap(java.util.function.Function<? super T,? extends java.lang.Iterable<? extends U>> mapper)
Traversablepublic final T apply(java.lang.Integer index)
SeqSeq is a partial function which returns the element at the specified index if the
index is valid. It's up to the caller to make sure the index is valid (for instance through
isDefinedAt).
The behaviour is undefined if the index is out of bounds.
It may throw any RuntimeException or return an arbitrary value.apply in interface Seq<T>apply in interface Function1<java.lang.Integer,T>apply in interface PartialFunction<java.lang.Integer,T>apply in interface java.util.function.Function<java.lang.Integer,T>index - an indexpublic final Seq<List<T>> group()
Seqpublic final <C> Map<C,List<T>> groupBy(java.util.function.Function<? super T,? extends C> classifier)
TraversablegroupBy in interface LinearSeq<T>groupBy in interface Seq<T>groupBy in interface Traversable<T>C - classified class typeclassifier - A function which classifies elements into classesTraversable.arrangeBy(Function)public final Iterator<List<T>> grouped(int size)
TraversableTraversable into fixed size blocks.
Let length be the length of this Iterable. Then grouped is defined as follows:
this.isEmpty(), the resulting Iterator is empty.size <= length, the resulting Iterator will contain length / size blocks of size
size and maybe a non-empty block of size length % size, if there are remaining elements.size > length, the resulting Iterator will contain one block of size length.
[].grouped(1) = []
[].grouped(0) throws
[].grouped(-1) throws
[1,2,3,4].grouped(2) = [[1,2],[3,4]]
[1,2,3,4,5].grouped(2) = [[1,2],[3,4],[5]]
[1,2,3,4].grouped(5) = [[1,2,3,4]]
Please note that grouped(int) is a special case of Traversable.sliding(int, int), i.e.
grouped(size) is the same as sliding(size, size).public final boolean hasDefiniteSize()
TraversableThis method should be implemented by classes only, i.e. not by interfaces.
hasDefiniteSize in interface Traversable<T>public final int indexOf(T element, int from)
Seqpublic final List<T> init()
Traversablepublic final Option<List<T>> initOption()
TraversableOption.initOption in interface LinearSeq<T>initOption in interface Seq<T>initOption in interface Traversable<T>Some(traversable) or None if this is empty.public abstract int length()
Traversable
Same as Traversable.size().
length in interface Traversable<T>@Deprecated public boolean isDefinedAt(java.lang.Integer index)
PartialFunctionisDefinedAt in interface PartialFunction<java.lang.Integer,T>index - a potential function argumentpublic final List<T> insert(int index, T element)
Seqpublic final List<T> insertAll(int index, java.lang.Iterable<? extends T> elements)
Seqpublic final List<T> intersperse(T element)
Seqintersperse in interface LinearSeq<T>intersperse in interface Seq<T>element - An element.public final boolean isTraversableAgain()
TraversableThis method should be implemented by classes only, i.e. not by interfaces.
isTraversableAgain in interface Traversable<T>public final T last()
Traversablelast in interface Traversable<T>public final int lastIndexOf(T element, int end)
SeqlastIndexOf in interface Seq<T>element - an elementend - the end indexpublic final <U> List<U> map(java.util.function.Function<? super T,? extends U> mapper)
TraversableTraversable to elements of a new type preserving their order, if any.public final List<T> orElse(java.lang.Iterable<? extends T> other)
TraversableTraversable if it is nonempty, otherwise return the alternative.public final List<T> orElse(java.util.function.Supplier<? extends java.lang.Iterable<? extends T>> supplier)
TraversableTraversable if it is nonempty, otherwise return the result of evaluating supplier.public final List<T> padTo(int length, T element)
SeqNote: lazily-evaluated Seq implementations need to process all elements in order to gather the overall length.
padTo in interface LinearSeq<T>padTo in interface Seq<T>length - the target lengthelement - the padding elementelement so that the resulting sequence has a length of at least length.public final List<T> leftPadTo(int length, T element)
SeqNote: lazily-evaluated Seq implementations need to process all elements in order to gather the overall length.
leftPadTo in interface Seq<T>length - the target lengthelement - the padding elementelement so that the resulting sequence has a length of at least length.public final List<T> patch(int from, java.lang.Iterable<? extends T> that, int replaced)
Seqpublic final Tuple2<List<T>,List<T>> partition(java.util.function.Predicate<? super T> predicate)
TraversableTraversable by splitting this elements in two in distinct traversables
according to a predicate.partition in interface LinearSeq<T>partition in interface Seq<T>partition in interface Traversable<T>predicate - A predicate which classifies an element if it is in the first or the second traversable.Traversable contains all elements that satisfy the given predicate, the second Traversable contains all elements that don't. The original order of elements is preserved.@Deprecated public final T peek()
java.util.NoSuchElementException - if this List is empty@Deprecated public final Option<T> peekOption()
None if this List is empty, otherwise a Some containing the head elementpublic final List<T> peek(java.util.function.Consumer<? super T> action)
List.public final List<List<T>> permutations()
SeqExample:
[].permutations() = []
[1,2,3].permutations() = [
[1,2,3],
[1,3,2],
[2,1,3],
[2,3,1],
[3,1,2],
[3,2,1]
]
permutations in interface LinearSeq<T>permutations in interface Seq<T>@Deprecated public final List<T> pop()
java.util.NoSuchElementException - if this List is empty@Deprecated public final Option<List<T>> popOption()
None if this List is empty, otherwise a Some containing the elements of this List without the head element@Deprecated public final Tuple2<T,List<T>> pop2()
java.util.NoSuchElementException - if this List is empty@Deprecated public final Option<Tuple2<T,List<T>>> pop2Option()
None if this List is empty, otherwise Some Tuple containing the head element and the remaining elements of this Listpublic final List<T> prepend(T element)
Seqpublic final List<T> prependAll(java.lang.Iterable<? extends T> elements)
SeqprependAll in interface LinearSeq<T>prependAll in interface Seq<T>elements - An Iterable of elements@Deprecated public final List<T> push(T element)
element - The new elementList instance, containing the new element on top of this List@Deprecated public final List<T> push(T... elements)
elements - Elements, may be emptyList instance, containing the new elements on top of this Listjava.lang.NullPointerException - if elements is null@Deprecated public final List<T> pushAll(java.lang.Iterable<T> elements)
elements - An Iterable of elements, may be emptyList instance, containing the new elements on top of this Listjava.lang.NullPointerException - if elements is nullpublic final List<T> remove(T element)
Seqpublic final List<T> removeFirst(java.util.function.Predicate<T> predicate)
SeqremoveFirst in interface LinearSeq<T>removeFirst in interface Seq<T>predicate - an predicatepublic final List<T> removeLast(java.util.function.Predicate<T> predicate)
SeqremoveLast in interface LinearSeq<T>removeLast in interface Seq<T>predicate - an predicatepublic final List<T> removeAt(int index)
Seqpublic final List<T> removeAll(T element)
Seqpublic final List<T> removeAll(java.lang.Iterable<? extends T> elements)
Seqpublic final List<T> replace(T currentElement, T newElement)
Traversablereplace in interface LinearSeq<T>replace in interface Seq<T>replace in interface Traversable<T>currentElement - An element to be substituted.newElement - A replacement for currentElement.public final List<T> replaceAll(T currentElement, T newElement)
TraversablereplaceAll in interface LinearSeq<T>replaceAll in interface Seq<T>replaceAll in interface Traversable<T>currentElement - An element to be substituted.newElement - A replacement for currentElement.public final List<T> retainAll(java.lang.Iterable<? extends T> elements)
Traversablepublic final List<T> reverse()
Seqpublic final List<T> rotateLeft(int n)
Seq
// = List(3, 4, 5, 1, 2)
List.of(1, 2, 3, 4, 5).rotateLeft(2);
rotateLeft in interface LinearSeq<T>rotateLeft in interface Seq<T>n - distance of left rotationpublic final List<T> rotateRight(int n)
Seq
// = List(4, 5, 1, 2, 3)
List.of(1, 2, 3, 4, 5).rotateRight(2);
rotateRight in interface LinearSeq<T>rotateRight in interface Seq<T>n - distance of right rotationpublic final List<T> scan(T zero, java.util.function.BiFunction<? super T,? super T,? extends T> operation)
Traversablescan in interface LinearSeq<T>scan in interface Seq<T>scan in interface Traversable<T>zero - neutral element for the operator opoperation - the associative operator for the scanpublic final <U> List<U> scanLeft(U zero, java.util.function.BiFunction<? super U,? super T,? extends U> operation)
TraversablescanLeft in interface LinearSeq<T>scanLeft in interface Seq<T>scanLeft in interface Traversable<T>U - the type of the elements in the resulting collectionzero - the initial valueoperation - the binary operator applied to the intermediate result and the elementpublic final <U> List<U> scanRight(U zero, java.util.function.BiFunction<? super T,? super U,? extends U> operation)
TraversablescanRight in interface LinearSeq<T>scanRight in interface Seq<T>scanRight in interface Traversable<T>U - the type of the elements in the resulting collectionzero - the initial valueoperation - the binary operator applied to the intermediate result and the elementpublic final List<T> shuffle()
Seqpublic final List<T> shuffle(java.util.Random random)
Seqpublic final List<T> slice(int beginIndex, int endIndex)
SeqbeginIndex and extends to the element at index endIndex - 1.
Examples:
List.of(1, 2, 3, 4).slice(1, 3); // = (2, 3)
List.of(1, 2, 3, 4).slice(0, 4); // = (1, 2, 3, 4)
List.of(1, 2, 3, 4).slice(2, 2); // = ()
List.of(1, 2).slice(1, 0); // = ()
List.of(1, 2).slice(-10, 10); // = (1, 2)
See also Seq.subSequence(int, int) which throws in some cases instead of returning a sequence.public final Iterator<List<T>> slideBy(java.util.function.Function<? super T,?> classifier)
TraversableTraversable.
Each window contains elements with the same class, as determined by classifier. Two consecutive
values in this Traversable will be in the same window only if classifier returns equal
values for them. Otherwise, the values will constitute the last element of the previous window and the
first element of the next window.
Examples:
[].slideBy(Function.identity()) = []
[1,2,3,4,4,5].slideBy(Function.identity()) = [[1],[2],[3],[4,4],[5]]
[1,2,3,10,12,5,7,20,29].slideBy(x -> x/10) = [[1,2,3],[10,12],[5,7],[20,29]]
public final Iterator<List<T>> sliding(int size)
Traversablesize and step size 1 over this Traversable by calling
Traversable.sliding(int, int).public final Iterator<List<T>> sliding(int size, int step)
Traversablesize and step size over this Traversable.
Examples:
[].sliding(1,1) = []
[1,2,3,4,5].sliding(2,3) = [[1,2],[4,5]]
[1,2,3,4,5].sliding(2,4) = [[1,2],[5]]
[1,2,3,4,5].sliding(2,5) = [[1,2]]
[1,2,3,4].sliding(5,3) = [[1,2,3,4]]
public final List<T> sorted()
SeqComparable, a java.lang.ClassCastException may be thrown.public final List<T> sorted(java.util.Comparator<? super T> comparator)
SeqComparator. If this elements are not
Comparable, a java.lang.ClassCastException may be thrown.public final <U extends java.lang.Comparable<? super U>> List<T> sortBy(java.util.function.Function<? super T,? extends U> mapper)
Seqmapper.public final <U> List<T> sortBy(java.util.Comparator<? super U> comparator, java.util.function.Function<? super T,? extends U> mapper)
Seqmapper.public final Tuple2<List<T>,List<T>> span(java.util.function.Predicate<? super T> predicate)
Traversablepredicate and the second element is the remainder.public final Tuple2<List<T>,List<T>> splitAt(int n)
SeqsplitAt(n) is equivalent to
Tuple.of(take(n), drop(n)).public final Tuple2<List<T>,List<T>> splitAt(java.util.function.Predicate<? super T> predicate)
SeqPredicate, e.g. Tuple(init, element+tail).public final Tuple2<List<T>,List<T>> splitAtInclusive(java.util.function.Predicate<? super T> predicate)
SeqPredicate, e.g. Tuple(init+element, tail).splitAtInclusive in interface Seq<T>predicate - An predicateTuple containing divided sequencespublic final java.lang.String stringPrefix()
ValuestringPrefix in interface Value<T>public final List<T> subSequence(int beginIndex)
SeqbeginIndex and extends to the end of this Seq.
Examples:
List.of(1, 2).subSequence(0); // = (1, 2)
List.of(1, 2).subSequence(1); // = (2)
List.of(1, 2).subSequence(2); // = ()
List.of(1, 2).subSequence(10); // throws IndexOutOfBoundsException
List.of(1, 2).subSequence(-10); // throws IndexOutOfBoundsException
See also Seq.drop(int) which is similar but does not throw.subSequence in interface LinearSeq<T>subSequence in interface Seq<T>beginIndex - the beginning index, inclusivepublic final List<T> subSequence(int beginIndex, int endIndex)
SeqbeginIndex and extends to the element at index endIndex - 1.
Examples:
List.of(1, 2, 3, 4).subSequence(1, 3); // = (2, 3)
List.of(1, 2, 3, 4).subSequence(0, 4); // = (1, 2, 3, 4)
List.of(1, 2, 3, 4).subSequence(2, 2); // = ()
List.of(1, 2).subSequence(1, 0); // throws IndexOutOfBoundsException
List.of(1, 2).subSequence(-10, 1); // throws IndexOutOfBoundsException
List.of(1, 2).subSequence(0, 10); // throws IndexOutOfBoundsException
See also Seq.slice(int, int) which returns an empty sequence instead of throwing.subSequence in interface LinearSeq<T>subSequence in interface Seq<T>beginIndex - the beginning index, inclusiveendIndex - the end index, exclusivepublic abstract List<T> tail()
Traversablepublic final Option<List<T>> tailOption()
TraversableOption.tailOption in interface LinearSeq<T>tailOption in interface Seq<T>tailOption in interface Traversable<T>Some(traversable) or None if this is empty.public final List<T> take(int n)
Traversable
The result is equivalent to sublist(0, max(0, min(length(), n))) but does not throw if n < 0 or
n > length().
In the case of n < 0 the empty instance is returned, in the case of n > length() this is returned.
public final List<T> takeUntil(java.util.function.Predicate<? super T> predicate)
Traversable
Note: This is essentially the same as takeWhile(predicate.negate()). It is intended to be used with
method references, which cannot be negated directly.
takeUntil in interface LinearSeq<T>takeUntil in interface Seq<T>takeUntil in interface Traversable<T>predicate - A condition tested subsequently for this elements.public final List<T> takeWhile(java.util.function.Predicate<? super T> predicate)
TraversabletakeWhile in interface LinearSeq<T>takeWhile in interface Seq<T>takeWhile in interface Traversable<T>predicate - A condition tested subsequently for the contained elements.public final List<T> takeRight(int n)
Traversable
The result is equivalent to sublist(max(0, min(length(), length() - n)), n), i.e. takeRight will not
throw if n < 0 or n > length().
In the case of n < 0 the empty instance is returned, in the case of n > length() this is returned.
takeRight in interface LinearSeq<T>takeRight in interface Seq<T>takeRight in interface Traversable<T>n - The number of elements to take.public final List<T> takeRightUntil(java.util.function.Predicate<? super T> predicate)
SeqtakeRightUntil in interface LinearSeq<T>takeRightUntil in interface Seq<T>predicate - A condition tested subsequently for this elements, starting from the end.public final List<T> takeRightWhile(java.util.function.Predicate<? super T> predicate)
Seq
Note: This is essentially the same as takeRightUntil(predicate.negate()).
It is intended to be used with method references, which cannot be negated directly.
takeRightWhile in interface LinearSeq<T>takeRightWhile in interface Seq<T>predicate - A condition tested subsequently for this elements, starting from the end.public final <U> U transform(java.util.function.Function<? super List<T>,? extends U> f)
List.U - Type of transformation resultf - A transformationUjava.lang.NullPointerException - if f is nullpublic final List<T> update(int index, T element)
Seqpublic final List<T> update(int index, java.util.function.Function<? super T,? extends T> updater)
Seqpublic final <U> List<Tuple2<T,U>> zip(java.lang.Iterable<? extends U> that)
Traversable
The length of the returned traversable is the minimum of the lengths of this traversable and that
iterable.
zip in interface LinearSeq<T>zip in interface Seq<T>zip in interface Traversable<T>U - The type of the second half of the returned pairs.that - The Iterable providing the second half of each result pair.that iterable.public final <U,R> List<R> zipWith(java.lang.Iterable<? extends U> that, java.util.function.BiFunction<? super T,? super U,? extends R> mapper)
Traversable
The length of the returned traversable is the minimum of the lengths of this traversable and that
iterable.
zipWith in interface LinearSeq<T>zipWith in interface Seq<T>zipWith in interface Traversable<T>U - The type of the second parameter of the mapper.R - The type of the mapped elements.that - The Iterable providing the second parameter of the mapper.mapper - a mapper.that iterable.public final <U> List<Tuple2<T,U>> zipAll(java.lang.Iterable<? extends U> that, T thisElem, U thatElem)
Traversable
The length of the returned traversable is the maximum of the lengths of this traversable and that
iterable.
Special case: if this traversable is shorter than that elements, and that elements contains duplicates, the resulting traversable may be shorter than the maximum of the lengths of this and that because a traversable contains an element at most once.
If this Traversable is shorter than that, thisElem values are used to fill the result. If that is shorter than this Traversable, thatElem values are used to fill the result.
zipAll in interface LinearSeq<T>zipAll in interface Seq<T>zipAll in interface Traversable<T>U - The type of the second half of the returned pairs.that - The Iterable providing the second half of each result pair.thisElem - The element to be used to fill up the result if this traversable is shorter than that.thatElem - The element to be used to fill up the result if that is shorter than this traversable.public final List<Tuple2<T,java.lang.Integer>> zipWithIndex()
TraversablezipWithIndex in interface LinearSeq<T>zipWithIndex in interface Seq<T>zipWithIndex in interface Traversable<T>public final <U> List<U> zipWithIndex(java.util.function.BiFunction<? super T,? super java.lang.Integer,? extends U> mapper)
TraversablezipWithIndex in interface LinearSeq<T>zipWithIndex in interface Seq<T>zipWithIndex in interface Traversable<T>U - The type of the mapped elements.mapper - a mapper.