List (Javaslang 2.0.6 API)

Type Parameters:: T - Component type of the List

All Superinterfaces:: Foldable<T>, Function<Integer,T>, Function1<Integer,T>, Iterable<T>, Kind1<List<?>,T>, LinearSeq<T>, Seq<T>, Serializable, Stack<T>, Traversable<T>, Value<T>, λ<T>

All Known Implementing Classes:: List.Cons, List.Nil

public interface List<T>
extends Kind1<List<?>,T>, LinearSeq<T>, Stack<T>

An immutable 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.

Methods to obtain a List:

 
 // factory methods
 List.empty()                        // = List.of() = Nil.instance()
 List.of(x)                          // = new Cons<>(x, Nil.instance())
 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 primary 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()

Factory method applications:

 
 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(new int[] {1, 2, 3});
 List<List<Integer>> s4 = List.ofAll(List.of(1, 2, 3));

 List<Integer>       s5 = List.ofAll(new int[] {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.

Since:: 1.1.0
Author:: Daniel Dietrich

Nested Class Summary

Nested Classes
Modifier and Type	Interface and Description
`static class`	`List.Cons<T>` Non-empty `List`, consisting of a `head` and a `tail`.
`static class`	`List.Nil<T>` Representation of the singleton empty `List`.

Nested classes/interfaces inherited from interface javaslang.λ
λ.Memoized

Field Summary

Fields
Modifier and Type Field and Description

static long serialVersionUID

Fields
Modifier and Type	Field and Description
`static long`	`serialVersionUID`

Method Summary

All Methods Static Methods Instance Methods Abstract Methods Default Methods
Modifier and Type	Method and Description
`default List<T>`	`append(T element)` Appends an element to this.
`default List<T>`	`appendAll(Iterable<? extends T> elements)` Appends all given elements to this.
`static <T> Collector<T,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`.
`default List<List<T>>`	`combinations()` Returns the union of all combinations from k = 0 to length().
`default List<List<T>>`	`combinations(int k)` Returns the k-combination of this traversable, i.e.
`default Iterator<List<T>>`	`crossProduct(int power)` Calculates the n-ary cartesian power (or cross product or simply product) of this.
`default List<T>`	`distinct()` Returns a new version of this which contains no duplicates.
`default List<T>`	`distinctBy(Comparator<? super T> comparator)` Returns a new version of this which contains no duplicates.
`default <U> List<T>`	`distinctBy(Function<? super T,? extends U> keyExtractor)` Returns a new version of this which contains no duplicates.
`default List<T>`	`drop(long n)` Drops the first n elements of this or all elements, if this length < n.
`default List<T>`	`dropRight(long n)` Drops the last n elements of this or all elements, if this length < n.
`default List<T>`	`dropUntil(Predicate<? super T> predicate)` Drops elements until the predicate holds for the current element.
`default List<T>`	`dropWhile(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, Supplier<? extends T> s)` Returns a List containing `n` values supplied by a given Supplier `s`.
`default List<T>`	`filter(Predicate<? super T> predicate)` Returns a new traversable consisting of all elements which satisfy the given predicate.
`default <U> List<U>`	`flatMap(Function<? super T,? extends Iterable<? extends U>> mapper)` FlatMaps this Traversable.
`default T`	`get(int index)` Returns the element at the specified index.
`default <C> Map<C,List<T>>`	`groupBy(Function<? super T,? extends C> classifier)` Groups this elements by classifying the elements.
`default Iterator<List<T>>`	`grouped(long size)` Groups this `Traversable` into fixed size blocks.
`default boolean`	`hasDefiniteSize()` Checks if this Traversable is known to have a finite size.
`default 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.
`default List<T>`	`init()` Dual of Traversable.tail(), returning all elements except the last.
`default Option<List<T>>`	`initOption()` Dual of Traversable.tailOption(), returning all elements except the last as `Option`.
`default List<T>`	`insert(int index, T element)` Inserts the given element at the specified index.
`default List<T>`	`insertAll(int index, Iterable<? extends T> elements)` Inserts the given elements at the specified index.
`default List<T>`	`intersperse(T element)` Inserts an element between all elements of this Traversable.
`boolean`	`isEmpty()` Checks if this Traversable is empty.
`default boolean`	`isTraversableAgain()` Checks if this Traversable can be repeatedly traversed.
`default 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.
`int`	`length()` Computes the number of elements of this Traversable.
`default <U> List<U>`	`map(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<Boolean>`	`ofAll(boolean[] array)` Creates a List based on the elements of a boolean array.
`static List<Byte>`	`ofAll(byte[] array)` Creates a List based on the elements of a byte array.
`static List<Character>`	`ofAll(char[] array)` Creates a List based on the elements of a char array.
`static List<Double>`	`ofAll(double[] array)` Creates a List based on the elements of a double array.
`static List<Float>`	`ofAll(float[] array)` Creates a List based on the elements of a float array.
`static List<Integer>`	`ofAll(int[] array)` Creates a List based on the elements of an int array.
`static <T> List<T>`	`ofAll(Iterable<? extends T> elements)` Creates a List of the given elements.
`static List<Long>`	`ofAll(long[] array)` Creates a List based on the elements of a long array.
`static List<Short>`	`ofAll(short[] array)` Creates a List based on the elements of a short array.
`default List<T>`	`padTo(int length, T element)` A copy of this sequence with an element appended until a given target length is reached.
`default Tuple2<List<T>,List<T>>`	`partition(Predicate<? super T> predicate)` Creates a partition of this `Traversable` by splitting this elements in two in distinct tarversables according to a predicate.
`default List<T>`	`patch(int from, Iterable<? extends T> that, int replaced)` Produces a new list where a slice of elements in this list is replaced by another sequence.
`default T`	`peek()` Returns the head element without modifying the Stack.
`default List<T>`	`peek(Consumer<? super T> action)` Performs an action on the head element of this `List`.
`default Option<T>`	`peekOption()` Returns the head element without modifying the Stack.
`default List<List<T>>`	`permutations()` Computes all unique permutations.
`default List<T>`	`pop()` Removes the head element from this Stack.
`default Tuple2<T,List<T>>`	`pop2()` Removes the head element from this Stack.
`default Option<Tuple2<T,List<T>>>`	`pop2Option()` Removes the head element from this Stack.
`default Option<List<T>>`	`popOption()` Removes the head element from this Stack.
`default List<T>`	`prepend(T element)` Prepends an element to this.
`default List<T>`	`prependAll(Iterable<? extends T> elements)` Prepends all given elements to this.
`default List<T>`	`push(T... elements)` Pushes the given elements on top of this Stack.
`default List<T>`	`push(T element)` Pushes a new element on top of this Stack.
`default List<T>`	`pushAll(Iterable<T> elements)` Pushes the given elements on top of this Stack.
`static List<Character>`	`range(char from, char toExclusive)`
`static List<Integer>`	`range(int from, int toExclusive)` Creates a List of int numbers starting from `from`, extending to `toExclusive - 1`.
`static List<Long>`	`range(long from, long toExclusive)` Creates a List of long numbers starting from `from`, extending to `toExclusive - 1`.
`static List<Character>`	`rangeBy(char from, char toExclusive, int step)`
`static List<Double>`	`rangeBy(double from, double toExclusive, double step)`
`static List<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<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<Character>`	`rangeClosed(char from, char toInclusive)`
`static List<Integer>`	`rangeClosed(int from, int toInclusive)` Creates a List of int numbers starting from `from`, extending to `toInclusive`.
`static List<Long>`	`rangeClosed(long from, long toInclusive)` Creates a List of long numbers starting from `from`, extending to `toInclusive`.
`static List<Character>`	`rangeClosedBy(char from, char toInclusive, int step)`
`static List<Double>`	`rangeClosedBy(double from, double toInclusive, double step)`
`static List<Integer>`	`rangeClosedBy(int from, int toInclusive, int step)` Creates a List of int numbers starting from `from`, extending to `toInclusive`, with `step`.
`static List<Long>`	`rangeClosedBy(long from, long toInclusive, long step)` Creates a List of long numbers starting from `from`, extending to `toInclusive`, with `step`.
`default List<T>`	`remove(T element)` Removes the first occurrence of the given element.
`default List<T>`	`removeAll(Iterable<? extends T> elements)` Removes all occurrences of the given elements.
`default List<T>`	`removeAll(T removed)` Removes all occurrences of the given element.
`default List<T>`	`removeAt(int index)` Removes the element at the specified position in this sequence.
`default List<T>`	`removeFirst(Predicate<T> predicate)` Removes the first occurrence that satisfy predicate
`default List<T>`	`removeLast(Predicate<T> predicate)` Removes the last occurrence that satisfy predicate
`default List<T>`	`replace(T currentElement, T newElement)` Replaces the first occurrence (if exists) of the given currentElement with newElement.
`default List<T>`	`replaceAll(T currentElement, T newElement)` Replaces all occurrences of the given currentElement with newElement.
`default List<T>`	`retainAll(Iterable<? extends T> elements)` Keeps all occurrences of the given elements from this.
`default List<T>`	`reverse()` Reverses the order of elements.
`default List<T>`	`scan(T zero, BiFunction<? super T,? super T,? extends T> operation)` Computes a prefix scan of the elements of the collection.
`default <U> List<U>`	`scanLeft(U zero, BiFunction<? super U,? super T,? extends U> operation)` Produces a collection containing cumulative results of applying the operator going left to right.
`default <U> List<U>`	`scanRight(U zero, BiFunction<? super T,? super U,? extends U> operation)` Produces a collection containing cumulative results of applying the operator going right to left.
`default List<T>`	`slice(long beginIndex, long endIndex)` Returns a Seq that is a slice of this.
`default Iterator<List<T>>`	`sliding(long size)` Slides a window of a specific `size` and step size 1 over this `Traversable` by calling `Traversable.sliding(long, long)`.
`default Iterator<List<T>>`	`sliding(long size, long step)` Slides a window of a specific `size` and `step` size over this `Traversable`.
`default <U> List<T>`	`sortBy(Comparator<? super U> comparator, Function<? super T,? extends U> mapper)` Sorts this elements by comparing the elements in a different domain, using the given `mapper`.
`default <U extends Comparable<? super U>> List<T>`	`sortBy(Function<? super T,? extends U> mapper)` Sorts this elements by comparing the elements in a different domain, using the given `mapper`.
`default List<T>`	`sorted()` Sorts this elements according to their natural order.
`default List<T>`	`sorted(Comparator<? super T> comparator)` Sorts this elements according to the provided `Comparator`.
`default Tuple2<List<T>,List<T>>`	`span(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.
`default Tuple2<List<T>,List<T>>`	`splitAt(long n)` Splits a Seq at the specified index.
`default Tuple2<List<T>,List<T>>`	`splitAt(Predicate<? super T> predicate)` Splits a sequence at the first element which satisfies the `Predicate`, e.g.
`default Tuple2<List<T>,List<T>>`	`splitAtInclusive(Predicate<? super T> predicate)` Splits a sequence at the first element which satisfies the `Predicate`, e.g.
`default Spliterator<T>`	`spliterator()`
`default String`	`stringPrefix()` Returns the name of this Value type, which is used by toString().
`default List<T>`	`subSequence(int beginIndex)` Returns a Seq that is a subsequence of this.
`default List<T>`	`subSequence(int beginIndex, int endIndex)` Returns a Seq that is a subsequence of this.
`static <T> List<T>`	`tabulate(int n, Function<? super 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`.
`List<T>`	`tail()` Drops the first element of a non-empty Traversable.
`default Option<List<T>>`	`tailOption()` Drops the first element of a non-empty Traversable and returns an `Option`.
`default List<T>`	`take(long n)` Takes the first n elements of this or all elements, if this length < n.
`default List<T>`	`takeRight(long n)` Takes the last n elements of this or all elements, if this length < n.
`default List<T>`	`takeUntil(Predicate<? super T> predicate)` Takes elements until the predicate holds for the current element.
`default List<T>`	`takeWhile(Predicate<? super T> predicate)` Takes elements while the predicate holds for the current element.
`default <U> U`	`transform(Function<? super List<T>,? extends U> f)` Transforms this `List`.
`default <U> List<U>`	`unit(Iterable<? extends U> iterable)`
`default <T1,T2> Tuple2<List<T1>,List<T2>>`	`unzip(Function<? super T,Tuple2<? extends T1,? extends T2>> unzipper)` Unzips this elements by mapping this elements to pairs which are subsequently split into two distinct sets.
`default <T1,T2,T3> Tuple3<List<T1>,List<T2>,List<T3>>`	`unzip3(Function<? super T,Tuple3<? extends T1,? extends T2,? extends T3>> unzipper)` Unzips this elements by mapping this elements to triples which are subsequently split into three distinct sets.
`default List<T>`	`update(int index, T element)` Updates the given element at the specified index.
`default <U> List<Tuple2<T,U>>`	`zip(Iterable<? extends U> that)` Returns a traversable formed from this traversable and another Iterable collection by combining corresponding elements in pairs.
`default <U> List<Tuple2<T,U>>`	`zipAll(Iterable<? extends U> that, T thisElem, U thatElem)` Returns a traversable formed from this traversable and another Iterable by combining corresponding elements in pairs.
`default List<Tuple2<T,Long>>`	`zipWithIndex()` Zips this traversable with its indices.

Methods inherited from interface javaslang.collection.LinearSeq
indexWhere, lastIndexOfSlice, lastIndexWhere, narrow, reverseIterator, search, search, segmentLength

Methods inherited from interface javaslang.collection.Seq
apply, containsSlice, crossProduct, crossProduct, endsWith, foldRight, indexOf, indexOfSlice, indexOfSlice, indexWhere, iterator, lastIndexOf, lastIndexOfSlice, lastIndexWhere, narrow, prefixLength, startsWith, startsWith

Methods inherited from interface javaslang.collection.Traversable
average, containsAll, count, existsUnique, find, findLast, foldLeft, get, hash, head, headOption, isSingleValued, iterator, last, lastOption, max, maxBy, maxBy, min, minBy, minBy, mkString, mkString, mkString, narrow, nonEmpty, product, reduceLeft, reduceLeftOption, reduceRight, reduceRightOption, size, sum

Methods inherited from interface javaslang.collection.Foldable
fold, reduce, reduceOption

Methods inherited from interface javaslang.Value
contains, corresponds, eq, equals, exists, forAll, forEach, getOption, getOrElse, getOrElse, getOrElseThrow, getOrElseTry, hashCode, narrow, out, out, stderr, stdout, toArray, toCharSeq, toJavaArray, toJavaArray, toJavaCollection, toJavaList, toJavaList, toJavaMap, toJavaMap, toJavaOptional, toJavaSet, toJavaSet, toJavaStream, toLeft, toLeft, toList, toMap, toOption, toQueue, toRight, toRight, toSet, toStack, toStream, toString, toTree, toTry, toTry, toVector

Methods inherited from interface javaslang.Function1
andThen, arity, compose, curried, identity, lift, memoized, reversed, tupled

Methods inherited from interface javaslang.λ
isMemoized

Methods inherited from interface javaslang.collection.Stack
narrow

- Field Detail
 - serialVersionUID
```
static final long serialVersionUID
```
 See Also:
 
 Constant Field Values
- Method Detail
 - collector
```
static <T> Collector<T,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.
 
 Type Parameters:
 
 T - Component type of the List.
 
 Returns:
 
 A javaslang.collection.List Collector.
 - empty
```
static <T> List<T> empty()
```
 Returns the single instance of Nil. Convenience method for Nil.instance() .
 Note: this method intentionally returns type List and not Nil. This comes handy when folding. If you explicitly need type Nil use List.Nil.instance().
 
 Type Parameters:
 
 T - Component type of Nil, determined by type inference in the particular context.
 
 Returns:
 
 The empty list.
 - isEmpty
```
boolean isEmpty()
```
 Description copied from interface: Traversable
 
 Checks if this Traversable is empty.
 
 Specified by:
 
 isEmpty in interface Stack<T>
 
 Specified by:
 
 isEmpty in interface Traversable<T>
 
 Specified by:
 
 isEmpty in interface Value<T>
 
 Returns:
 
 true, if this Traversable contains no elements, false otherwise.
 - narrow
```
static <T> List<T> narrow(List<? extends T> list)
```
 Narrows a widened List<? extends T> to List<T> by performing a type safe-cast. This is eligible because immutable/read-only collections are covariant.
 
 Type Parameters:
 
 T - Component type of the List.
 
 Parameters:
 
 list - A List.
 
 Returns:
 
 the given list instance as narrowed type List<T>.
 - of
```
static <T> List<T> of(T element)
```
 Returns a singleton List, i.e. a List of one element.
 
 Specified by:
 
 of in interface Function1<Integer,T>
 
 Type Parameters:
 
 T - The component type
 
 Parameters:
 
 element - An element.
 
 Returns:
 
 A new List instance containing the given element
 - of
```
@SafeVarargs
static <T> List<T> of(T... elements)
```
 Creates a List of the given elements.
```
 
 List.of(1, 2, 3, 4)
 = Nil.instance().prepend(4).prepend(3).prepend(2).prepend(1)
 = new Cons(1, new Cons(2, new Cons(3, new Cons(4, Nil.instance()))))
 
 
```
 Type Parameters:
 
 T - Component type of the List.
 
 Parameters:
 
 elements - Zero or more elements.
 
 Returns:
 
 A list containing the given elements in the same order.
 
 Throws:
 
 NullPointerException - if elements is null
 - ofAll
```
static <T> List<T> ofAll(Iterable<? extends T> elements)
```
 Creates a List of the given elements.
 The resulting list has the same iteration order as the given iterable of elements if the iteration order of the elements is stable.
 
 Type Parameters:
 
 T - Component type of the List.
 
 Parameters:
 
 elements - An Iterable of elements.
 
 Returns:
 
 A list containing the given elements in the same order.
 
 Throws:
 
 NullPointerException - if elements is null
 - ofAll
```
static List<Boolean> ofAll(boolean[] array)
```
 Creates a List based on the elements of a boolean array.
 
 Parameters:
 
 array - a boolean array
 
 Returns:
 
 A new List of Boolean values
 - ofAll
```
static List<Byte> ofAll(byte[] array)
```
 Creates a List based on the elements of a byte array.
 
 Parameters:
 
 array - a byte array
 
 Returns:
 
 A new List of Byte values
 - ofAll
```
static List<Character> ofAll(char[] array)
```
 Creates a List based on the elements of a char array.
 
 Parameters:
 
 array - a char array
 
 Returns:
 
 A new List of Character values
 - ofAll
```
static List<Double> ofAll(double[] array)
```
 Creates a List based on the elements of a double array.
 
 Parameters:
 
 array - a double array
 
 Returns:
 
 A new List of Double values
 - ofAll
```
static List<Float> ofAll(float[] array)
```
 Creates a List based on the elements of a float array.
 
 Parameters:
 
 array - a float array
 
 Returns:
 
 A new List of Float values
 - ofAll
```
static List<Integer> ofAll(int[] array)
```
 Creates a List based on the elements of an int array.
 
 Parameters:
 
 array - an int array
 
 Returns:
 
 A new List of Integer values
 - ofAll
```
static List<Long> ofAll(long[] array)
```
 Creates a List based on the elements of a long array.
 
 Parameters:
 
 array - a long array
 
 Returns:
 
 A new List of Long values
 - ofAll
```
static List<Short> ofAll(short[] array)
```
 Creates a List based on the elements of a short array.
 
 Parameters:
 
 array - a short array
 
 Returns:
 
 A new List of Short values
 - tabulate
```
static <T> List<T> tabulate(int n,
 Function<? super 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.
 
 Type Parameters:
 
 T - Component type of the List
 
 Parameters:
 
 n - The number of elements in the List
 
 f - The Function computing element values
 
 Returns:
 
 A List consisting of elements f(0),f(1), ..., f(n - 1)
 
 Throws:
 
 NullPointerException - if f is null
 - fill
```
static <T> List<T> fill(int n,
 Supplier<? extends T> s)
```
 Returns a List containing n values supplied by a given Supplier s.
 
 Type Parameters:
 
 T - Component type of the List
 
 Parameters:
 
 n - The number of elements in the List
 
 s - The Supplier computing element values
 
 Returns:
 
 A List of size n, where each element contains the result supplied by s.
 
 Throws:
 
 NullPointerException - if s is null
 - range
```
static List<Character> range(char from,
 char toExclusive)
```
 - rangeBy
```
static List<Character> rangeBy(char from,
 char toExclusive,
 int step)
```
 - rangeBy
```
static List<Double> rangeBy(double from,
 double toExclusive,
 double step)
```
 - range
```
static List<Integer> range(int from,
 int toExclusive)
```
 Creates a List of int numbers starting from 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)
 
 
```
 Parameters:
 
 from - the first number
 
 toExclusive - the last number + 1
 
 Returns:
 
 a range of int values as specified or the empty range if from >= toExclusive
 - rangeBy
```
static List<Integer> rangeBy(int from,
 int toExclusive,
 int step)
```
 Creates a List of int numbers starting from 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()
 
 
```
 Parameters:
 
 from - the first number
 
 toExclusive - the last number + 1
 
 step - the step
 
 Returns:
 
 a range of long values as specified or the empty range if
 from >= toInclusive and step > 0 or
 from <= toInclusive and step < 0
 
 Throws:
 
 IllegalArgumentException - if step is zero
 - range
```
static List<Long> range(long from,
 long toExclusive)
```
 Creates a List of long numbers starting from 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)
 
 
```
 Parameters:
 
 from - the first number
 
 toExclusive - the last number + 1
 
 Returns:
 
 a range of long values as specified or the empty range if from >= toExclusive
 - rangeBy
```
static List<Long> rangeBy(long from,
 long toExclusive,
 long step)
```
 Creates a List of long numbers starting from 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()
 
 
```
 Parameters:
 
 from - the first number
 
 toExclusive - the last number + 1
 
 step - the step
 
 Returns:
 
 a range of long values as specified or the empty range if
 from >= toInclusive and step > 0 or
 from <= toInclusive and step < 0
 
 Throws:
 
 IllegalArgumentException - if step is zero
 - rangeClosed
```
static List<Character> rangeClosed(char from,
 char toInclusive)
```
 - rangeClosedBy
```
static List<Character> rangeClosedBy(char from,
 char toInclusive,
 int step)
```
 - rangeClosedBy
```
static List<Double> rangeClosedBy(double from,
 double toInclusive,
 double step)
```
 - rangeClosed
```
static List<Integer> rangeClosed(int from,
 int toInclusive)
```
 Creates a List of int numbers starting from 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)
 
 
```
 Parameters:
 
 from - the first number
 
 toInclusive - the last number
 
 Returns:
 
 a range of int values as specified or the empty range if from > toInclusive
 - rangeClosedBy
```
static List<Integer> rangeClosedBy(int from,
 int toInclusive,
 int step)
```
 Creates a List of int numbers starting from 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()
 
 
```
 Parameters:
 
 from - the first number
 
 toInclusive - the last number
 
 step - the step
 
 Returns:
 
 a range of int values as specified or the empty range if
 from > toInclusive and step > 0 or
 from < toInclusive and step < 0
 
 Throws:
 
 IllegalArgumentException - if step is zero
 - rangeClosed
```
static List<Long> rangeClosed(long from,
 long toInclusive)
```
 Creates a List of long numbers starting from 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)
 
 
```
 Parameters:
 
 from - the first number
 
 toInclusive - the last number
 
 Returns:
 
 a range of long values as specified or the empty range if from > toInclusive
 - rangeClosedBy
```
static List<Long> rangeClosedBy(long from,
 long toInclusive,
 long step)
```
 Creates a List of long numbers starting from 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()
 
 
```
 Parameters:
 
 from - the first number
 
 toInclusive - the last number
 
 step - the step
 
 Returns:
 
 a range of int values as specified or the empty range if
 from > toInclusive and step > 0 or
 from < toInclusive and step < 0
 
 Throws:
 
 IllegalArgumentException - if step is zero
 - append
```
default List<T> append(T element)
```
 Description copied from interface: Seq
 
 Appends an element to this.
 
 Specified by:
 
 append in interface LinearSeq<T>
 
 Specified by:
 
 append in interface Seq<T>
 
 Parameters:
 
 element - An element
 
 Returns:
 
 A new Seq containing the given element appended to this elements
 - appendAll
```
default List<T> appendAll(Iterable<? extends T> elements)
```
 Description copied from interface: Seq
 
 Appends all given elements to this.
 
 Specified by:
 
 appendAll in interface LinearSeq<T>
 
 Specified by:
 
 appendAll in interface Seq<T>
 
 Parameters:
 
 elements - An Iterable of elements
 
 Returns:
 
 A new Seq containing the given elements appended to this elements
 - combinations
```
default List<List<T>> combinations()
```
 Description copied from interface: Seq
 Returns the union of all combinations from k = 0 to length().
 Examples:
```
 
 [].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
 ]
 
 
```
 Specified by:
 
 combinations in interface LinearSeq<T>
 
 Specified by:
 
 combinations in interface Seq<T>
 
 Returns:
 
 the combinations of this
 - combinations
```
default List<List<T>> combinations(int k)
```
 Description copied from interface: Seq
 
 Returns the k-combination of this traversable, i.e. all subset of this of k distinct elements.
 
 Specified by:
 
 combinations in interface LinearSeq<T>
 
 Specified by:
 
 combinations in interface Seq<T>
 
 Parameters:
 
 k - Size of subsets
 
 Returns:
 
 the k-combination of this elements
 
 See Also:
 
 Combination
 - crossProduct
```
default Iterator<List<T>> crossProduct(int power)
```
 Description copied from interface: Seq
 Calculates the n-ary cartesian power (or cross product or simply product) of this.
 Example:
```
 
 // = ((A,A), (A,B), (A,C), ..., (B,A), (B,B), ..., (Z,Y), (Z,Z))
 CharSeq.rangeClosed('A', 'Z').crossProduct(2);
 
 
```
 Specified by:
 
 crossProduct in interface LinearSeq<T>
 
 Specified by:
 
 crossProduct in interface Seq<T>
 
 Parameters:
 
 power - the number of cartesian multiplications
 
 Returns:
 
 A new Iterator representing the n-ary cartesian power of this
 - distinct
```
default List<T> distinct()
```
 Description copied from interface: Traversable
 
 Returns a new version of this which contains no duplicates. Elements are compared using equals.
 
 Specified by:
 
 distinct in interface LinearSeq<T>
 
 Specified by:
 
 distinct in interface Seq<T>
 
 Specified by:
 
 distinct in interface Traversable<T>
 
 Returns:
 
 a new Traversable containing this elements without duplicates
 - distinctBy
```
default List<T> distinctBy(Comparator<? super T> comparator)
```
 Description copied from interface: Traversable
 
 Returns a new version of this which contains no duplicates. Elements are compared using the given comparator.
 
 Specified by:
 
 distinctBy in interface LinearSeq<T>
 
 Specified by:
 
 distinctBy in interface Seq<T>
 
 Specified by:
 
 distinctBy in interface Traversable<T>
 
 Parameters:
 
 comparator - A comparator
 
 Returns:
 
 a new Traversable containing this elements without duplicates
 - distinctBy
```
default  List<T> distinctBy(Function<? super T,? extends U> keyExtractor)
```
 Description copied from interface: Traversable
 
 Returns a new version of this which contains no duplicates. Elements mapped to keys which are compared using equals.
 The elements of the result are determined in the order of their occurrence - first match wins.
 
 Specified by:
 
 distinctBy in interface LinearSeq<T>
 
 Specified by:
 
 distinctBy in interface Seq<T>
 
 Specified by:
 
 distinctBy in interface Traversable<T>
 
 Type Parameters:
 
 U - key type
 
 Parameters:
 
 keyExtractor - A key extractor
 
 Returns:
 
 a new Traversable containing this elements without duplicates
 - drop
```
default List<T> drop(long n)
```
 Description copied from interface: Traversable
 
 Drops the first n elements of this or all elements, if this length < n.
 
 Specified by:
 
 drop in interface LinearSeq<T>
 
 Specified by:
 
 drop in interface Seq<T>
 
 Specified by:
 
 drop in interface Traversable<T>
 
 Parameters:
 
 n - The number of elements to drop.
 
 Returns:
 
 a new instance consisting of all elements of this except the first n ones, or else the empty instance, if this has less than n elements.
 - dropRight
```
default List<T> dropRight(long n)
```
 Description copied from interface: Traversable
 
 Drops the last n elements of this or all elements, if this length < n.
 
 Specified by:
 
 dropRight in interface LinearSeq<T>
 
 Specified by:
 
 dropRight in interface Seq<T>
 
 Specified by:
 
 dropRight in interface Traversable<T>
 
 Parameters:
 
 n - The number of elements to drop.
 
 Returns:
 
 a new instance consisting of all elements of this except the last n ones, or else the empty instance, if this has less than n elements.
 - dropUntil
```
default List<T> dropUntil(Predicate<? super T> predicate)
```
 Description copied from interface: Traversable
 
 Drops elements until the predicate holds for the current element.
 Note: This is essentially the same as dropWhile(predicate.negate()). It is intended to be used with method references, which cannot be negated directly.
 
 Specified by:
 
 dropUntil in interface LinearSeq<T>
 
 Specified by:
 
 dropUntil in interface Seq<T>
 
 Specified by:
 
 dropUntil in interface Traversable<T>
 
 Parameters:
 
 predicate - A condition tested subsequently for this elements.
 
 Returns:
 
 a new instance consisting of all elements starting from the first one which does satisfy the given predicate.
 - dropWhile
```
default List<T> dropWhile(Predicate<? super T> predicate)
```
 Description copied from interface: Traversable
 
 Drops elements while the predicate holds for the current element.
 
 Specified by:
 
 dropWhile in interface LinearSeq<T>
 
 Specified by:
 
 dropWhile in interface Seq<T>
 
 Specified by:
 
 dropWhile in interface Traversable<T>
 
 Parameters:
 
 predicate - A condition tested subsequently for this elements starting with the first.
 
 Returns:
 
 a new instance consisting of all elements starting from the first one which does not satisfy the given predicate.
 - filter
```
default List<T> filter(Predicate<? super T> predicate)
```
 Description copied from interface: Traversable
 
 Returns a new traversable consisting of all elements which satisfy the given predicate.
 
 Specified by:
 
 filter in interface LinearSeq<T>
 
 Specified by:
 
 filter in interface Seq<T>
 
 Specified by:
 
 filter in interface Traversable<T>
 
 Parameters:
 
 predicate - A predicate
 
 Returns:
 
 a new traversable
 - flatMap
```
default  List flatMap(Function<? super T,? extends Iterable<? extends U>> mapper)
```
 Description copied from interface: Traversable
 
 FlatMaps this Traversable.
 
 Specified by:
 
 flatMap in interface LinearSeq<T>
 
 Specified by:
 
 flatMap in interface Seq<T>
 
 Specified by:
 
 flatMap in interface Traversable<T>
 
 Type Parameters:
 
 U - The resulting component type.
 
 Parameters:
 
 mapper - A mapper
 
 Returns:
 
 A new Traversable instance.
 - get
```
default T get(int index)
```
 Description copied from interface: Seq
 
 Returns the element at the specified index.
 
 Specified by:
 
 get in interface Seq<T>
 
 Parameters:
 
 index - an index
 
 Returns:
 
 the element at the given index
 - groupBy
```
default <C> Map<C,List<T>> groupBy(Function<? super T,? extends C> classifier)
```
 Description copied from interface: Traversable
 
 Groups this elements by classifying the elements.
 
 Specified by:
 
 groupBy in interface LinearSeq<T>
 
 Specified by:
 
 groupBy in interface Seq<T>
 
 Specified by:
 
 groupBy in interface Traversable<T>
 
 Type Parameters:
 
 C - classified class type
 
 Parameters:
 
 classifier - A function which classifies elements into classes
 
 Returns:
 
 A Map containing the grouped elements
 - grouped
```
default Iterator<List<T>> grouped(long size)
```
 Description copied from interface: Traversable
 Groups this Traversable into fixed size blocks.
 Let length be the length of this Iterable. Then grouped is defined as follows:
 - If this.isEmpty(), the resulting Iterator is empty.
 - If 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.
 - If size > length, the resulting Iterator will contain one block of size length.
 Examples:
```
 
 [].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(long, long), i.e. grouped(size) is the same as sliding(size, size).
 Specified by:
 
 grouped in interface LinearSeq<T>
 
 Specified by:
 
 grouped in interface Seq<T>
 
 Specified by:
 
 grouped in interface Traversable<T>
 
 Parameters:
 
 size - a positive block size
 
 Returns:
 
 A new Iterator of grouped blocks of the given size
 - hasDefiniteSize
```
default boolean hasDefiniteSize()
```
 Description copied from interface: Traversable
 
 Checks if this Traversable is known to have a finite size.
 This method should be implemented by classes only, i.e. not by interfaces.
 
 Specified by:
 
 hasDefiniteSize in interface Traversable<T>
 
 Returns:
 
 true, if this Traversable is known to hafe a finite size, false otherwise.
 - indexOf
```
default int indexOf(T element,
 int from)
```
 Description copied from interface: Seq
 
 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.
 
 Specified by:
 
 indexOf in interface Seq<T>
 
 Parameters:
 
 element - an element
 
 from - start index
 
 Returns:
 
 the index of the first occurrence of the given element
 - init
```
default List<T> init()
```
 Description copied from interface: Traversable
 
 Dual of Traversable.tail(), returning all elements except the last.
 
 Specified by:
 
 init in interface LinearSeq<T>
 
 Specified by:
 
 init in interface Seq<T>
 
 Specified by:
 
 init in interface Traversable<T>
 
 Returns:
 
 a new instance containing all elements except the last.
 - initOption
```
default Option<List<T>> initOption()
```
 Description copied from interface: Traversable
 
 Dual of Traversable.tailOption(), returning all elements except the last as Option.
 
 Specified by:
 
 initOption in interface LinearSeq<T>
 
 Specified by:
 
 initOption in interface Seq<T>
 
 Specified by:
 
 initOption in interface Traversable<T>
 
 Returns:
 
 Some(traversable) or None if this is empty.
 - length
```
int length()
```
 Description copied from interface: Traversable
 
 Computes the number of elements of this Traversable.
 Same as Traversable.size().
 
 Specified by:
 
 length in interface Traversable<T>
 
 Returns:
 
 the number of elements
 - insert
```
default List<T> insert(int index,
 T element)
```
 Description copied from interface: Seq
 
 Inserts the given element at the specified index.
 
 Specified by:
 
 insert in interface LinearSeq<T>
 
 Specified by:
 
 insert in interface Seq<T>
 
 Parameters:
 
 index - an index
 
 element - an element
 
 Returns:
 
 a new Seq, where the given element is inserted into this at the given index
 - insertAll
```
default List<T> insertAll(int index,
 Iterable<? extends T> elements)
```
 Description copied from interface: Seq
 
 Inserts the given elements at the specified index.
 
 Specified by:
 
 insertAll in interface LinearSeq<T>
 
 Specified by:
 
 insertAll in interface Seq<T>
 
 Parameters:
 
 index - an index
 
 elements - An Iterable of elements
 
 Returns:
 
 a new Seq, where the given elements are inserted into this at the given index
 - intersperse
```
default List<T> intersperse(T element)
```
 Description copied from interface: Seq
 
 Inserts an element between all elements of this Traversable.
 
 Specified by:
 
 intersperse in interface LinearSeq<T>
 
 Specified by:
 
 intersperse in interface Seq<T>
 
 Parameters:
 
 element - An element.
 
 Returns:
 
 an interspersed version of this
 - isTraversableAgain
```
default boolean isTraversableAgain()
```
 Description copied from interface: Traversable
 
 Checks if this Traversable can be repeatedly traversed.
 This method should be implemented by classes only, i.e. not by interfaces.
 
 Specified by:
 
 isTraversableAgain in interface Traversable<T>
 
 Returns:
 
 true, if this Traversable is known to be traversable repeatedly, false otherwise.
 - lastIndexOf
```
default int lastIndexOf(T element,
 int end)
```
 Description copied from interface: Seq
 
 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.
 
 Specified by:
 
 lastIndexOf in interface Seq<T>
 
 Parameters:
 
 element - an element
 
 end - the end index
 
 Returns:
 
 the index of the last occurrence of the given element
 - map
```
default  List map(Function<? super T,? extends U> mapper)
```
 Description copied from interface: Traversable
 
 Maps the elements of this Traversable to elements of a new type preserving their order, if any.
 
 Specified by:
 
 map in interface LinearSeq<T>
 
 Specified by:
 
 map in interface Seq<T>
 
 Specified by:
 
 map in interface Traversable<T>
 
 Specified by:
 
 map in interface Value<T>
 
 Type Parameters:
 
 U - Component type of the target Traversable
 
 Parameters:
 
 mapper - A mapper.
 
 Returns:
 
 a mapped Traversable
 - padTo
```
default List<T> padTo(int length,
 T element)
```
 Description copied from interface: Seq
 
 A copy of this sequence with an element appended until a given target length is reached.
 
 Specified by:
 
 padTo in interface LinearSeq<T>
 
 Specified by:
 
 padTo in interface Seq<T>
 
 Parameters:
 
 length - the target length
 
 element - the padding element
 
 Returns:
 
 a new sequence consisting of all elements of this sequence followed by the minimal number of occurrences of element so that the resulting sequence has a length of at least length.
 - patch
```
default List<T> patch(int from,
 Iterable<? extends T> that,
 int replaced)
```
 Description copied from interface: Seq
 
 Produces a new list where a slice of elements in this list is replaced by another sequence.
 
 Specified by:
 
 patch in interface LinearSeq<T>
 
 Specified by:
 
 patch in interface Seq<T>
 
 Parameters:
 
 from - the index of the first replaced element
 
 that - sequence for replacement
 
 replaced - the number of elements to drop in the original list
 
 Returns:
 
 a new sequence.
 - partition
```
default Tuple2<List<T>,List<T>> partition(Predicate<? super T> predicate)
```
 Description copied from interface: Traversable
 
 Creates a partition of this Traversable by splitting this elements in two in distinct tarversables according to a predicate.
 
 Specified by:
 
 partition in interface LinearSeq<T>
 
 Specified by:
 
 partition in interface Seq<T>
 
 Specified by:
 
 partition in interface Traversable<T>
 
 Parameters:
 
 predicate - A predicate which classifies an element if it is in the first or the second traversable.
 
 Returns:
 
 A disjoint union of two traversables. The first 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.
 - peek
```
default T peek()
```
 Description copied from interface: Stack
 
 Returns the head element without modifying the Stack.
 
 Specified by:
 
 peek in interface Stack<T>
 
 Returns:
 
 the first element
 - peekOption
```
default Option<T> peekOption()
```
 Description copied from interface: Stack
 
 Returns the head element without modifying the Stack.
 
 Specified by:
 
 peekOption in interface Stack<T>
 
 Returns:
 
 None if this Stack is empty, otherwise a Some containing the head element
 - peek
```
default List<T> peek(Consumer<? super T> action)
```
 Performs an action on the head element of this List.
 
 Specified by:
 
 peek in interface LinearSeq<T>
 
 Specified by:
 
 peek in interface Seq<T>
 
 Specified by:
 
 peek in interface Traversable<T>
 
 Specified by:
 
 peek in interface Value<T>
 
 Parameters:
 
 action - A Consumer
 
 Returns:
 
 this List
 - permutations
```
default List<List<T>> permutations()
```
 Description copied from interface: Seq
 Computes all unique permutations.
 Example:
```
 
 [].permutations() = []

 [1,2,3].permutations() = [
 [1,2,3],
 [1,3,2],
 [2,1,3],
 [2,3,1],
 [3,1,2],
 [3,2,1]
 ]
 
 
```
 Specified by:
 
 permutations in interface LinearSeq<T>
 
 Specified by:
 
 permutations in interface Seq<T>
 
 Returns:
 
 this unique permutations
 - pop
```
default List<T> pop()
```
 Description copied from interface: Stack
 
 Removes the head element from this Stack.
 
 Specified by:
 
 pop in interface Stack<T>
 
 Returns:
 
 the elements of this Stack without the head element
 - popOption
```
default Option<List<T>> popOption()
```
 Description copied from interface: Stack
 
 Removes the head element from this Stack.
 
 Specified by:
 
 popOption in interface Stack<T>
 
 Returns:
 
 None if this Stack is empty, otherwise a Some containing the elements of this Stack without the head element
 - pop2
```
default Tuple2<T,List<T>> pop2()
```
 Description copied from interface: Stack
 
 Removes the head element from this Stack.
 
 Specified by:
 
 pop2 in interface Stack<T>
 
 Returns:
 
 a tuple containing the head element and the remaining elements of this Stack
 - pop2Option
```
default Option<Tuple2<T,List<T>>> pop2Option()
```
 Description copied from interface: Stack
 
 Removes the head element from this Stack.
 
 Specified by:
 
 pop2Option in interface Stack<T>
 
 Returns:
 
 None if this Stack is empty, otherwise Some Tuple containing the head element and the remaining elements of this Stack
 - prepend
```
default List<T> prepend(T element)
```
 Description copied from interface: Seq
 
 Prepends an element to this.
 
 Specified by:
 
 prepend in interface LinearSeq<T>
 
 Specified by:
 
 prepend in interface Seq<T>
 
 Parameters:
 
 element - An element
 
 Returns:
 
 A new Seq containing the given element prepended to this elements
 - prependAll
```
default List<T> prependAll(Iterable<? extends T> elements)
```
 Description copied from interface: Seq
 
 Prepends all given elements to this.
 
 Specified by:
 
 prependAll in interface LinearSeq<T>
 
 Specified by:
 
 prependAll in interface Seq<T>
 
 Parameters:
 
 elements - An Iterable of elements
 
 Returns:
 
 A new Seq containing the given elements prepended to this elements
 - push
```
default List<T> push(T element)
```
 Description copied from interface: Stack
 
 Pushes a new element on top of this Stack.
 
 Specified by:
 
 push in interface Stack<T>
 
 Parameters:
 
 element - The new element
 
 Returns:
 
 a new Stack instance, containing the new element on top of this Stack
 - push
```
default List<T> push(T... elements)
```
 Description copied from interface: Stack
 
 Pushes the given elements on top of this Stack. A Stack has LIFO order, i.e. the last of the given elements is the first which will be retrieved.
 
 Specified by:
 
 push in interface Stack<T>
 
 Parameters:
 
 elements - Elements, may be empty
 
 Returns:
 
 a new Stack instance, containing the new elements on top of this Stack
 - pushAll
```
default List<T> pushAll(Iterable<T> elements)
```
 Description copied from interface: Stack
 
 Pushes the given elements on top of this Stack. A Stack has LIFO order, i.e. the last of the given elements is the first which will be retrieved.
 
 Specified by:
 
 pushAll in interface Stack<T>
 
 Parameters:
 
 elements - An Iterable of elements, may be empty
 
 Returns:
 
 a new Stack instance, containing the new elements on top of this Stack
 - remove
```
default List<T> remove(T element)
```
 Description copied from interface: Seq
 
 Removes the first occurrence of the given element.
 
 Specified by:
 
 remove in interface LinearSeq<T>
 
 Specified by:
 
 remove in interface Seq<T>
 
 Parameters:
 
 element - An element to be removed from this Seq.
 
 Returns:
 
 a Seq containing all elements of this without the first occurrence of the given element.
 - removeFirst
```
default List<T> removeFirst(Predicate<T> predicate)
```
 Description copied from interface: Seq
 
 Removes the first occurrence that satisfy predicate
 
 Specified by:
 
 removeFirst in interface LinearSeq<T>
 
 Specified by:
 
 removeFirst in interface Seq<T>
 
 Parameters:
 
 predicate - an predicate
 
 Returns:
 
 a new Seq
 - removeLast
```
default List<T> removeLast(Predicate<T> predicate)
```
 Description copied from interface: Seq
 
 Removes the last occurrence that satisfy predicate
 
 Specified by:
 
 removeLast in interface LinearSeq<T>
 
 Specified by:
 
 removeLast in interface Seq<T>
 
 Parameters:
 
 predicate - an predicate
 
 Returns:
 
 a new Seq
 - removeAt
```
default List<T> removeAt(int index)
```
 Description copied from interface: Seq
 
 Removes the element at the specified position in this sequence. Shifts any subsequent elements to the left (subtracts one from their indices).
 
 Specified by:
 
 removeAt in interface LinearSeq<T>
 
 Specified by:
 
 removeAt in interface Seq<T>
 
 Parameters:
 
 index - position of element to remove
 
 Returns:
 
 a sequence containing all elements of this without the element at the specified position.
 - removeAll
```
default List<T> removeAll(T removed)
```
 Description copied from interface: Seq
 
 Removes all occurrences of the given element.
 
 Specified by:
 
 removeAll in interface LinearSeq<T>
 
 Specified by:
 
 removeAll in interface Seq<T>
 
 Parameters:
 
 removed - An element to be removed from this Seq.
 
 Returns:
 
 a Seq containing all elements of this but not the given element.
 - removeAll
```
default List<T> removeAll(Iterable<? extends T> elements)
```
 Description copied from interface: Seq
 
 Removes all occurrences of the given elements.
 
 Specified by:
 
 removeAll in interface LinearSeq<T>
 
 Specified by:
 
 removeAll in interface Seq<T>
 
 Parameters:
 
 elements - Elements to be removed from this Seq.
 
 Returns:
 
 a Seq containing all elements of this but none of the given elements.
 - replace
```
default List<T> replace(T currentElement,
 T newElement)
```
 Description copied from interface: Traversable
 
 Replaces the first occurrence (if exists) of the given currentElement with newElement.
 
 Specified by:
 
 replace in interface LinearSeq<T>
 
 Specified by:
 
 replace in interface Seq<T>
 
 Specified by:
 
 replace in interface Traversable<T>
 
 Parameters:
 
 currentElement - An element to be substituted.
 
 newElement - A replacement for currentElement.
 
 Returns:
 
 a Traversable containing all elements of this where the first occurrence of currentElement is replaced with newELement.
 - replaceAll
```
default List<T> replaceAll(T currentElement,
 T newElement)
```
 Description copied from interface: Traversable
 
 Replaces all occurrences of the given currentElement with newElement.
 
 Specified by:
 
 replaceAll in interface LinearSeq<T>
 
 Specified by:
 
 replaceAll in interface Seq<T>
 
 Specified by:
 
 replaceAll in interface Traversable<T>
 
 Parameters:
 
 currentElement - An element to be substituted.
 
 newElement - A replacement for currentElement.
 
 Returns:
 
 a Traversable containing all elements of this where all occurrences of currentElement are replaced with newELement.
 - retainAll
```
default List<T> retainAll(Iterable<? extends T> elements)
```
 Description copied from interface: Traversable
 
 Keeps all occurrences of the given elements from this.
 
 Specified by:
 
 retainAll in interface LinearSeq<T>
 
 Specified by:
 
 retainAll in interface Seq<T>
 
 Specified by:
 
 retainAll in interface Traversable<T>
 
 Parameters:
 
 elements - Elements to be kept.
 
 Returns:
 
 a Traversable containing all occurrences of the given elements.
 - reverse
```
default List<T> reverse()
```
 Description copied from interface: Seq
 
 Reverses the order of elements.
 
 Specified by:
 
 reverse in interface LinearSeq<T>
 
 Specified by:
 
 reverse in interface Seq<T>
 
 Returns:
 
 the reversed elements.
 - scan
```
default List<T> scan(T zero,
 BiFunction<? super T,? super T,? extends T> operation)
```
 Description copied from interface: Traversable
 
 Computes a prefix scan of the elements of the collection. Note: The neutral element z may be applied more than once.
 
 Specified by:
 
 scan in interface LinearSeq<T>
 
 Specified by:
 
 scan in interface Seq<T>
 
 Specified by:
 
 scan in interface Traversable<T>
 
 Parameters:
 
 zero - neutral element for the operator op
 
 operation - the associative operator for the scan
 
 Returns:
 
 a new traversable collection containing the prefix scan of the elements in this traversable collection
 - scanLeft
```
default  List scanLeft(U zero,
 BiFunction<? super U,? super T,? extends U> operation)
```
 Description copied from interface: Traversable
 
 Produces a collection containing cumulative results of applying the operator going left to right. Note: will not terminate for infinite-sized collections. Note: might return different results for different runs, unless the underlying collection type is ordered.
 
 Specified by:
 
 scanLeft in interface LinearSeq<T>
 
 Specified by:
 
 scanLeft in interface Seq<T>
 
 Specified by:
 
 scanLeft in interface Traversable<T>
 
 Type Parameters:
 
 U - the type of the elements in the resulting collection
 
 Parameters:
 
 zero - the initial value
 
 operation - the binary operator applied to the intermediate result and the element
 
 Returns:
 
 collection with intermediate results
 - scanRight
```
default  List scanRight(U zero,
 BiFunction<? super T,? super U,? extends U> operation)
```
 Description copied from interface: Traversable
 
 Produces a collection containing cumulative results of applying the operator going right to left. The head of the collection is the last cumulative result. Note: will not terminate for infinite-sized collections. Note: might return different results for different runs, unless the underlying collection type is ordered.
 
 Specified by:
 
 scanRight in interface LinearSeq<T>
 
 Specified by:
 
 scanRight in interface Seq<T>
 
 Specified by:
 
 scanRight in interface Traversable<T>
 
 Type Parameters:
 
 U - the type of the elements in the resulting collection
 
 Parameters:
 
 zero - the initial value
 
 operation - the binary operator applied to the intermediate result and the element
 
 Returns:
 
 collection with intermediate results
 - slice
```
default List<T> slice(long beginIndex,
 long endIndex)
```
 Description copied from interface: Seq
 Returns a Seq that is a slice of this. The slice begins with the element at the specified beginIndex 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.
 Specified by:
 
 slice in interface LinearSeq<T>
 
 Specified by:
 
 slice in interface Seq<T>
 
 Parameters:
 
 beginIndex - the beginning index, inclusive
 
 endIndex - the end index, exclusive
 
 Returns:
 
 the specified slice
 - sliding
```
default Iterator<List<T>> sliding(long size)
```
 Description copied from interface: Traversable
 
 Slides a window of a specific size and step size 1 over this Traversable by calling Traversable.sliding(long, long).
 
 Specified by:
 
 sliding in interface LinearSeq<T>
 
 Specified by:
 
 sliding in interface Seq<T>
 
 Specified by:
 
 sliding in interface Traversable<T>
 
 Parameters:
 
 size - a positive window size
 
 Returns:
 
 a new Iterator of windows of a specific size using step size 1
 - sliding
```
default Iterator<List<T>> sliding(long size,
 long step)
```
 Description copied from interface: Traversable
 Slides a window of a specific size 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],[4]]
 
 
```
 Specified by:
 
 sliding in interface LinearSeq<T>
 
 Specified by:
 
 sliding in interface Seq<T>
 
 Specified by:
 
 sliding in interface Traversable<T>
 
 Parameters:
 
 size - a positive window size
 
 step - a positive step size
 
 Returns:
 
 a new Iterator of windows of a specific size using a specific step size
 - sorted
```
default List<T> sorted()
```
 Description copied from interface: Seq
 
 Sorts this elements according to their natural order. If this elements are not Comparable, a java.lang.ClassCastException may be thrown.
 
 Specified by:
 
 sorted in interface LinearSeq<T>
 
 Specified by:
 
 sorted in interface Seq<T>
 
 Returns:
 
 A sorted version of this
 - sorted
```
default List<T> sorted(Comparator<? super T> comparator)
```
 Description copied from interface: Seq
 
 Sorts this elements according to the provided Comparator. If this elements are not Comparable, a java.lang.ClassCastException may be thrown.
 
 Specified by:
 
 sorted in interface LinearSeq<T>
 
 Specified by:
 
 sorted in interface Seq<T>
 
 Parameters:
 
 comparator - A comparator
 
 Returns:
 
 a sorted version of this
 - sortBy
```
default > List<T> sortBy(Function<? super T,? extends U> mapper)
```
 Description copied from interface: Seq
 
 Sorts this elements by comparing the elements in a different domain, using the given mapper.
 
 Specified by:
 
 sortBy in interface LinearSeq<T>
 
 Specified by:
 
 sortBy in interface Seq<T>
 
 Type Parameters:
 
 U - The domain where elements are compared
 
 Parameters:
 
 mapper - A mapper
 
 Returns:
 
 a sorted version of this
 - sortBy
```
default  List<T> sortBy(Comparator<? super U> comparator,
 Function<? super T,? extends U> mapper)
```
 Description copied from interface: Seq
 
 Sorts this elements by comparing the elements in a different domain, using the given mapper.
 
 Specified by:
 
 sortBy in interface LinearSeq<T>
 
 Specified by:
 
 sortBy in interface Seq<T>
 
 Type Parameters:
 
 U - The domain where elements are compared
 
 Parameters:
 
 comparator - A comparator
 
 mapper - A mapper
 
 Returns:
 
 a sorted version of this
 - span
```
default Tuple2<List<T>,List<T>> span(Predicate<? super T> predicate)
```
 Description copied from interface: Traversable
 
 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.
 
 Specified by:
 
 span in interface LinearSeq<T>
 
 Specified by:
 
 span in interface Seq<T>
 
 Specified by:
 
 span in interface Traversable<T>
 
 Parameters:
 
 predicate - A predicate.
 
 Returns:
 
 a Tuple containing the longest prefix of elements that satisfy p and the remainder.
 - splitAt
```
default Tuple2<List<T>,List<T>> splitAt(long n)
```
 Description copied from interface: Seq
 
 Splits a Seq at the specified index. The result of splitAt(n) is equivalent to Tuple.of(take(n), drop(n)).
 
 Specified by:
 
 splitAt in interface Seq<T>
 
 Parameters:
 
 n - An index.
 
 Returns:
 
 A Tuple containing the first n and the remaining elements.
 - splitAt
```
default Tuple2<List<T>,List<T>> splitAt(Predicate<? super T> predicate)
```
 Description copied from interface: Seq
 
 Splits a sequence at the first element which satisfies the Predicate, e.g. Tuple(init, element+tail).
 
 Specified by:
 
 splitAt in interface Seq<T>
 
 Parameters:
 
 predicate - An predicate
 
 Returns:
 
 A Tuple containing divided sequences
 - splitAtInclusive
```
default Tuple2<List<T>,List<T>> splitAtInclusive(Predicate<? super T> predicate)
```
 Description copied from interface: Seq
 
 Splits a sequence at the first element which satisfies the Predicate, e.g. Tuple(init+element, tail).
 
 Specified by:
 
 splitAtInclusive in interface Seq<T>
 
 Parameters:
 
 predicate - An predicate
 
 Returns:
 
 A Tuple containing divided sequences
 - spliterator
```
default Spliterator<T> spliterator()
```
 Specified by:
 
 spliterator in interface Iterable<T>
 - stringPrefix
```
default String stringPrefix()
```
 Description copied from interface: Value
 
 Returns the name of this Value type, which is used by toString().
 
 Specified by:
 
 stringPrefix in interface Value<T>
 
 Returns:
 
 This type name.
 - subSequence
```
default List<T> subSequence(int beginIndex)
```
 Description copied from interface: Seq
 Returns a Seq that is a subsequence of this. The subsequence begins with the element at the specified beginIndex 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(long) which is similar but does not throw.
 Specified by:
 
 subSequence in interface LinearSeq<T>
 
 Specified by:
 
 subSequence in interface Seq<T>
 
 Parameters:
 
 beginIndex - the beginning index, inclusive
 
 Returns:
 
 the specified subsequence
 - subSequence
```
default List<T> subSequence(int beginIndex,
 int endIndex)
```
 Description copied from interface: Seq
 Returns a Seq that is a subsequence of this. The subsequence begins with the element at the specified beginIndex 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(long, long) which returns an empty sequence instead of throwing.
 Specified by:
 
 subSequence in interface LinearSeq<T>
 
 Specified by:
 
 subSequence in interface Seq<T>
 
 Parameters:
 
 beginIndex - the beginning index, inclusive
 
 endIndex - the end index, exclusive
 
 Returns:
 
 the specified subsequence
 - tail
```
List<T> tail()
```
 Description copied from interface: Traversable
 
 Drops the first element of a non-empty Traversable.
 
 Specified by:
 
 tail in interface LinearSeq<T>
 
 Specified by:
 
 tail in interface Seq<T>
 
 Specified by:
 
 tail in interface Traversable<T>
 
 Returns:
 
 A new instance of Traversable containing all elements except the first.
 - tailOption
```
default Option<List<T>> tailOption()
```
 Description copied from interface: Traversable
 
 Drops the first element of a non-empty Traversable and returns an Option.
 
 Specified by:
 
 tailOption in interface LinearSeq<T>
 
 Specified by:
 
 tailOption in interface Seq<T>
 
 Specified by:
 
 tailOption in interface Traversable<T>
 
 Returns:
 
 Some(traversable) or None if this is empty.
 - take
```
default List<T> take(long n)
```
 Description copied from interface: Traversable
 
 Takes the first n elements of this or all elements, if this length < n.
 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.
 
 Specified by:
 
 take in interface LinearSeq<T>
 
 Specified by:
 
 take in interface Seq<T>
 
 Specified by:
 
 take in interface Traversable<T>
 
 Parameters:
 
 n - The number of elements to take.
 
 Returns:
 
 A new instance consisting the first n elements of this or all elements, if this has less than n elements.
 - takeRight
```
default List<T> takeRight(long n)
```
 Description copied from interface: Traversable
 
 Takes the last n elements of this or all elements, if this length < n.
 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.
 
 Specified by:
 
 takeRight in interface LinearSeq<T>
 
 Specified by:
 
 takeRight in interface Seq<T>
 
 Specified by:
 
 takeRight in interface Traversable<T>
 
 Parameters:
 
 n - The number of elements to take.
 
 Returns:
 
 A new instance consisting the first n elements of this or all elements, if this has less than n elements.
 - takeUntil
```
default List<T> takeUntil(Predicate<? super T> predicate)
```
 Description copied from interface: Traversable
 
 Takes elements until the predicate holds for the current element.
 Note: This is essentially the same as takeWhile(predicate.negate()). It is intended to be used with method references, which cannot be negated directly.
 
 Specified by:
 
 takeUntil in interface LinearSeq<T>
 
 Specified by:
 
 takeUntil in interface Seq<T>
 
 Specified by:
 
 takeUntil in interface Traversable<T>
 
 Parameters:
 
 predicate - A condition tested subsequently for this elements.
 
 Returns:
 
 a new instance consisting of all elements until the first which does satisfy the given predicate.
 - takeWhile
```
default List<T> takeWhile(Predicate<? super T> predicate)
```
 Description copied from interface: Traversable
 
 Takes elements while the predicate holds for the current element.
 
 Specified by:
 
 takeWhile in interface LinearSeq<T>
 
 Specified by:
 
 takeWhile in interface Seq<T>
 
 Specified by:
 
 takeWhile in interface Traversable<T>
 
 Parameters:
 
 predicate - A condition tested subsequently for the contained elements.
 
 Returns:
 
 a new instance consisting of all elements until the first which does not satisfy the given predicate.
 - transform
```
default  U transform(Function<? super List<T>,? extends U> f)
```
 Transforms this List.
 
 Type Parameters:
 
 U - Type of transformation result
 
 Parameters:
 
 f - A transformation
 
 Returns:
 
 An instance of type U
 
 Throws:
 
 NullPointerException - if f is null
 - unit
```
default  List unit(Iterable<? extends U> iterable)
```
 Specified by:
 
 unit in interface LinearSeq<T>
 
 Specified by:
 
 unit in interface Seq<T>
 - unzip
```
default <T1,T2> Tuple2<List<T1>,List<T2>> unzip(Function<? super T,Tuple2<? extends T1,? extends T2>> unzipper)
```
 Description copied from interface: Traversable
 
 Unzips this elements by mapping this elements to pairs which are subsequently split into two distinct sets.
 
 Specified by:
 
 unzip in interface LinearSeq<T>
 
 Specified by:
 
 unzip in interface Seq<T>
 
 Specified by:
 
 unzip in interface Traversable<T>
 
 Type Parameters:
 
 T1 - 1st element type of a pair returned by unzipper
 
 T2 - 2nd element type of a pair returned by unzipper
 
 Parameters:
 
 unzipper - a function which converts elements of this to pairs
 
 Returns:
 
 A pair of set containing elements split by unzipper
 - unzip3
```
default <T1,T2,T3> Tuple3<List<T1>,List<T2>,List<T3>> unzip3(Function<? super T,Tuple3<? extends T1,? extends T2,? extends T3>> unzipper)
```
 Description copied from interface: Traversable
 
 Unzips this elements by mapping this elements to triples which are subsequently split into three distinct sets.
 
 Specified by:
 
 unzip3 in interface Seq<T>
 
 Specified by:
 
 unzip3 in interface Traversable<T>
 
 Type Parameters:
 
 T1 - 1st element type of a triplet returned by unzipper
 
 T2 - 2nd element type of a triplet returned by unzipper
 
 T3 - 3rd element type of a triplet returned by unzipper
 
 Parameters:
 
 unzipper - a function which converts elements of this to pairs
 
 Returns:
 
 A triplet of set containing elements split by unzipper
 - update
```
default List<T> update(int index,
 T element)
```
 Description copied from interface: Seq
 
 Updates the given element at the specified index.
 
 Specified by:
 
 update in interface LinearSeq<T>
 
 Specified by:
 
 update in interface Seq<T>
 
 Parameters:
 
 index - an index
 
 element - an element
 
 Returns:
 
 a new Seq consisting of this elements and the given element is set at the given index
 - zip
```
default  List<Tuple2<T,U>> zip(Iterable<? extends U> that)
```
 Description copied from interface: Traversable
 
 Returns a traversable formed from this traversable and another Iterable collection by combining corresponding elements in pairs. If one of the two iterables is longer than the other, its remaining elements are ignored.
 The length of the returned traversable is the minimum of the lengths of this traversable and that iterable.
 
 Specified by:
 
 zip in interface LinearSeq<T>
 
 Specified by:
 
 zip in interface Seq<T>
 
 Specified by:
 
 zip in interface Traversable<T>
 
 Type Parameters:
 
 U - The type of the second half of the returned pairs.
 
 Parameters:
 
 that - The Iterable providing the second half of each result pair.
 
 Returns:
 
 a new traversable containing pairs consisting of corresponding elements of this traversable and that iterable.
 - zipAll
```
default  List<Tuple2<T,U>> zipAll(Iterable<? extends U> that,
 T thisElem,
 U thatElem)
```
 Description copied from interface: Traversable
 
 Returns a traversable formed from this traversable and another Iterable by combining corresponding elements in pairs. If one of the two collections is shorter than the other, placeholder elements are used to extend the shorter collection to the length of the longer.
 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.
 
 Specified by:
 
 zipAll in interface LinearSeq<T>
 
 Specified by:
 
 zipAll in interface Seq<T>
 
 Specified by:
 
 zipAll in interface Traversable<T>
 
 Type Parameters:
 
 U - The type of the second half of the returned pairs.
 
 Parameters:
 
 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.
 
 Returns:
 
 A new traversable containing pairs consisting of corresponding elements of this traversable and that.
 - zipWithIndex
```
default List<Tuple2<T,Long>> zipWithIndex()
```
 Description copied from interface: Traversable
 
 Zips this traversable with its indices.
 
 Specified by:
 
 zipWithIndex in interface LinearSeq<T>
 
 Specified by:
 
 zipWithIndex in interface Seq<T>
 
 Specified by:
 
 zipWithIndex in interface Traversable<T>
 
 Returns:
 
 A new traversable containing all elements of this traversable paired with their index, starting with 0.

Interface List<T>

Nested Class Summary

Nested classes/interfaces inherited from interface javaslang.λ

Field Summary

Method Summary

Methods inherited from interface javaslang.collection.LinearSeq

Methods inherited from interface javaslang.collection.Seq

Methods inherited from interface javaslang.collection.Traversable

Methods inherited from interface javaslang.collection.Foldable

Methods inherited from interface javaslang.Value

Methods inherited from interface javaslang.Function1

Methods inherited from interface javaslang.λ

Methods inherited from interface javaslang.collection.Stack

Field Detail

serialVersionUID

Method Detail

collector

empty

isEmpty

narrow

of

of

ofAll

ofAll

ofAll

ofAll

ofAll

ofAll

ofAll

ofAll

ofAll

tabulate

fill

range

rangeBy

rangeBy

range

rangeBy

range

rangeBy

rangeClosed

rangeClosedBy

rangeClosedBy

rangeClosed

rangeClosedBy

rangeClosed

rangeClosedBy

append

appendAll

combinations

combinations

crossProduct

distinct

distinctBy

distinctBy

drop

dropRight

dropUntil

dropWhile

filter

flatMap

get

groupBy

grouped

hasDefiniteSize

indexOf

init

initOption

length

insert

insertAll

intersperse

isTraversableAgain

lastIndexOf

map

padTo

patch

partition

peek

peekOption