scala.collection.immutable

Nil

object Nil extends List[Nothing] with Product

The empty list.

Inherits

  1. List
  2. Product
  3. LinearSeq
  4. LinearSeq
  5. LinearSeqLike
  6. Seq
  7. Seq
  8. SeqLike
  9. PartialFunction
  10. Function1
  11. Iterable
  12. Iterable
  13. IterableLike
  14. Equals
  15. Traversable
  16. Immutable
  17. Traversable
  18. GenericTraversableTemplate
  19. TraversableLike
  20. HasNewBuilder
  21. AnyRef
  22. Any

Type Members

  1. class WithFilter extends AnyRef

    A class supporting filtered operations

Value Members

  1. def ++[B >: A, That](that: Iterator[B])(bf: CanBuildFrom[List[A], B, That]): That

    Concatenates this list with the elements of an iterator

    Concatenates this list with the elements of an iterator.

    B

    the element type of the returned collection.

    That

    the class of the returned collection. In the standard library configuration, That is always List[B] because an implicit of type CanBuildFrom[List, B, That] is defined in object List.

    that

    the iterator to append.

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type B.

    returns

    a new collection of type That which contains all elements of this list followed by all elements of that.

    definition classes: ListTraversableLike
  2. def ++[B >: A, That](that: Traversable[B])(bf: CanBuildFrom[List[A], B, That]): That

    Concatenates this list with the elements of a traversable collection

    Concatenates this list with the elements of a traversable collection.

    B

    the element type of the returned collection.

    That

    the class of the returned collection. In the standard library configuration, That is always List[B] because an implicit of type CanBuildFrom[List, B, That] is defined in object List.

    that

    the traversable to append.

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type B.

    returns

    a new collection of type That which contains all elements of this list followed by all elements of that.

    definition classes: ListTraversableLike
  3. def +:[B >: A, That](elem: B)(bf: CanBuildFrom[Repr, B, That]): That

    Prepends an element to this list

    Prepends an element to this list

    B

    the element type of the returned list.

    That

    the class of the returned collection. In the standard library configuration, That is always List[B] because an implicit of type CanBuildFrom[List, B, That] is defined in object List.

    elem

    the prepended element

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type B.

    returns

    a new collection of type That consisting of elem followed by all elements of this list.

    definition classes: SeqLike
  4. def -[B >: A](x: B): List[B]

    Computes the difference between this list and the given object x

    Computes the difference between this list and the given object x.

    x

    the object to remove from this list.

    returns

    this list without occurrences of the given object x.

    definition classes: List
  5. def --[B >: A](that: List[B]): List[B]

    Computes the difference between this list and the given list that

    Computes the difference between this list and the given list that.

    that

    the list of elements to remove from this list.

    returns

    this list without the elements of the given list that.

    definition classes: List
  6. def /:[B](z: B)(op: (B, A) ⇒ B): B

    Applies a binary operator to a start value and all elements of this list, going left to right

    Applies a binary operator to a start value and all elements of this list, going left to right.

    Note: /: is alternate syntax for foldLeft; z /: xs is the same as xs foldLeft z.

    B

    the result type of the binary operator.

    z

    the start value.

    op

    the binary operator.

    returns

    the result of inserting op between consecutive elements of this list$, going left to right with the start value z on the left: {{{ op(...op(op(z, x1), x2), ..., xn) }}} where x,,1,,, ..., x,,n,, are the elements of this list.

    definition classes: TraversableLike
  7. def :+[B >: A, That](elem: B)(bf: CanBuildFrom[Repr, B, That]): That

    Appends an element to this list

    Appends an element to this list

    B

    the element type of the returned list.

    That

    the class of the returned collection. In the standard library configuration, That is always List[B] because an implicit of type CanBuildFrom[List, B, That] is defined in object List.

    elem

    the appended element

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type B.

    returns

    a new collection of type That consisting of all elements of this list followed by elem.

    definition classes: SeqLike
  8. def ::[B >: A](x: B): List[B]

    Adds an element at the beginning of this list

    Adds an element at the beginning of this list.

    x

    the element to prepend.

    returns

    a list which contains x as first element and which continues with this list.

    definition classes: List
  9. def :::[B >: A](prefix: List[B]): List[B]

    Adds the elements of a given list in front of this list

    Adds the elements of a given list in front of this list.

    prefix

    The list elements to prepend.

    returns

    a list resulting from the concatenation of the given list prefix and this list.

    definition classes: List
  10. def :\[B](z: B)(op: (A, B) ⇒ B): B

    Applies a binary operator to all elements of this list and a start value, going right to left

    Applies a binary operator to all elements of this list and a start value, going right to left.

    Note: :\ is alternate syntax for foldRight; xs :\ z is the same as xs foldRight z.

    B

    the result type of the binary operator.

    z

    the start value

    op

    the binary operator

    returns

    the result of inserting op between consecutive elements of this list$, going right to left with the start value z on the right: {{{ op(x1, op(x2, ... op(xn, z)...)) }}} where x,,1,,, ..., x,,n,, are the elements of this list.

    definition classes: TraversableLike
  11. def addString(b: StringBuilder): StringBuilder

    Appends all elements of this list to a string builder

    Appends all elements of this list to a string builder. The written text consists of the string representations (w.r.t. the method toString) of all elements of this list without any separator string.

    b

    the string builder to which elements are appended.

    returns

    the string builder b to which elements were appended.

    definition classes: TraversableLike
  12. def addString(b: StringBuilder, sep: String): StringBuilder

    Appends all elements of this list to a string builder using a separator string

    Appends all elements of this list to a string builder using a separator string. The written text consists of the string representations (w.r.t. the method toString) of all elements of this list, separated by the string sep.

    b

    the string builder to which elements are appended.

    sep

    the separator string.

    returns

    the string builder b to which elements were appended.

    definition classes: TraversableLike
  13. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

    Appends all elements of this list to a string builder using start, end, and separator strings

    Appends all elements of this list to a string builder using start, end, and separator strings. The written text begins with the string start and ends with the string end. Inside, the string representations (w.r.t. the method toString) of all elements of this list are separated by the string sep.

    b

    the string builder to which elements are appended.

    start

    the starting string.

    sep

    the separator string.

    end

    the ending string.

    returns

    the string builder b to which elements were appended.

    definition classes: TraversableLike
  14. def andThen[C](k: (B) ⇒ C): PartialFunction[A, C]

    Composes this partial function with a transformation function that gets applied to results of this partial function

    Composes this partial function with a transformation function that gets applied to results of this partial function.

    C

    the result type of the transformation function.

    k

    the transformation function

    returns

    a partial function with the same domain as this partial function, which maps arguments x to k(this(x)).

    definition classes: PartialFunctionFunction1
  15. def apply(n: Int): A

    Selects an element by its index in the list

    Selects an element by its index in the list. Note: the execution of apply may take time proportial to the index value.

    definition classes: LinearSeqLikeSeqLike
  16. def break(p: (A) ⇒ Boolean): (List[A], List[A])

    Like span but with the predicate inverted

    Like span but with the predicate inverted.

    definition classes: List
  17. def canEqual(that: Any): Boolean

    Method called from equality methods, so that user-defined subclasses can refuse to be equal to other collections of the same kind

    Method called from equality methods, so that user-defined subclasses can refuse to be equal to other collections of the same kind.

    that

    The object with which this list should be compared

    returns

    true, if this list can possibly equal that, false otherwise. The test takes into consideration only the run-time types of objects but ignores their elements.

    definition classes: IterableLikeEquals
  18. def companion: GenericCompanion[List[A][A]]

    The factory companion object that builds instances of class List

    The factory companion object that builds instances of class List.

    definition classes: ListLinearSeqLinearSeqSeqSeqIterableIterableTraversableTraversableGenericTraversableTemplate
  19. def compose[A](g: (A) ⇒ T1): (A) ⇒ R

    (f compose g)(x) == f(g(x))

    (f compose g)(x) == f(g(x))

    definition classes: Function1
  20. def contains(elem: Any): Boolean

    Tests whether this list contains a given value as an element

    Tests whether this list contains a given value as an element.

    elem

    the element to test.

    returns

    true if this list has an element that is is equal (wrt ==) to elem, false otherwise.

    definition classes: SeqLike
  21. def containsSlice[B](that: Seq[B]): Boolean

    Tests whether this list contains a given sequence as a slice

    Tests whether this list contains a given sequence as a slice.

    that

    the sequence to test

    returns

    true if this list contains a slice with the same elements as that, otherwise false.

    definition classes: SeqLike
  22. def copyToArray[B >: A](xs: Array[B], start: Int, len: Int): Unit

    Copies elements of this list to an array

    Copies elements of this list to an array. Fills the given array xs with at most len elements of this list, starting at position start. Copying will stop once either the end of the current list is reached, or the end of the array is reached, or len elements have been copied.

    B

    the type of the elements of the array.

    xs

    the array to fill.

    start

    the starting index.

    len

    the maximal number of elements to copy.

    definition classes: IterableLikeTraversableLike
  23. def copyToArray[B >: A](xs: Array[B]): Unit

    Copies elements of this list to an array

    Copies elements of this list to an array. Fills the given array xs with all elements of this list, starting at position 0. Copying will stop once either the end of the current list is reached, or the end of the array is reached.

    B

    the type of the elements of the array.

    xs

    the array to fill.

    definition classes: TraversableLike
  24. def copyToArray[B >: A](xs: Array[B], start: Int): Unit

    Copies elements of this list to an array

    Copies elements of this list to an array. Fills the given array xs with all elements of this list, starting at position start. Copying will stop once either the end of the current list is reached, or the end of the array is reached.

    B

    the type of the elements of the array.

    xs

    the array to fill.

    start

    the starting index.

    definition classes: TraversableLike
  25. def copyToBuffer[B >: A](dest: Buffer[B]): Unit

    Copies all elements of this list to a buffer

    Copies all elements of this list to a buffer.

    dest

    The buffer to which elements are copied.

    definition classes: TraversableLike
  26. def corresponds[B](that: Seq[B])(p: (A, B) ⇒ Boolean): Boolean

    Tests whether every element of this list relates to the corresponding element of another sequence by satisfying a test predicate

    Tests whether every element of this list relates to the corresponding element of another sequence by satisfying a test predicate.

    B

    the type of the elements of that

    that

    the other sequence

    p

    the test predicate, which relates elements from both sequences

    returns

    true if both sequences have the same length and p(x, y) is true for all corresponding elements x of this list and y of that, otherwise false.

    definition classes: SeqLike
  27. def count(p: (A) ⇒ Boolean): Int

    Counts the number of elements in the list which satisfy a predicate

    Counts the number of elements in the list which satisfy a predicate.

    p

    the predicate used to test elements.

    returns

    the number of elements satisfying the predicate p.

    definition classes: LinearSeqLikeTraversableLike
  28. def diff[B >: A, That](that: Seq[B]): Repr

    Computes the multiset difference between this list and another sequence

    Computes the multiset difference between this list and another sequence.

    B

    the element type of the returned list.

    That

    the class of the returned collection. In the standard library configuration, That is always List[B] because an implicit of type CanBuildFrom[List, B, That] is defined in object List.

    that

    the sequence of elements to remove

    returns

    a new collection of type That which contains all elements of this list except some of occurrences of elements that also appear in that. If an element value x appears n times in that, then the first n occurrences of x will not form part of the result, but any following occurrences will.

    definition classes: SeqLike
  29. def drop(n: Int): List[A]

    Selects all elements except first n ones

    Selects all elements except first n ones.

    n

    the number of elements to drop from this list.

    returns

    a list consisting of all elements of this list except the first n ones, or else the empty list, if this list has less than n elements.

    definition classes: ListLinearSeqLikeTraversableLike
  30. def dropRight(n: Int): Repr

    Selects all elements except first n ones

    Selects all elements except first n ones.

    n

    The number of elements to take

    returns

    a list consisting of all elements of this list except the first n ones, or else the empty list, if this list has less than n elements.

    definition classes: LinearSeqLikeIterableLike
  31. def dropWhile(p: (A) ⇒ Boolean): List[A]

    Drops longest prefix of elements that satisfy a predicate

    Drops longest prefix of elements that satisfy a predicate.

    p

    The predicate used to test elements.

    returns

    the longest suffix of this list whose first element does not satisfy the predicate p.

    definition classes: ListTraversableLike
  32. def elements: Iterator[A]

  33. def endsWith[B](that: Seq[B]): Boolean

    Tests whether this list ends with the given sequence

    Tests whether this list ends with the given sequence.

    that

    the sequence to test

    returns

    true if this list has that as a suffix, false otherwise.

    definition classes: SeqLike
  34. def equals(that: Any): Boolean

    The equality method defined in AnyRef

    The equality method defined in AnyRef.

    definition classes: NilSeqLikeEquals ⇐ AnyRef ⇐ Any
  35. def equalsWith[B](that: Seq[B])(f: (A, B) ⇒ Boolean): Boolean

    Tests whether every element of this list relates to the corresponding element of another sequence by satisfying a test predicate

    Tests whether every element of this list relates to the corresponding element of another sequence by satisfying a test predicate.

    B

    the type of the elements of that

    that

    the other sequence

    returns

    true if both sequences have the same length and p(x, y) is true for all corresponding elements x of this list and y of that, otherwise false.

    definition classes: SeqLike
  36. def exists(p: (A) ⇒ Boolean): Boolean

    Tests whether a predicate holds for some of the elements of this list

    Tests whether a predicate holds for some of the elements of this list.

    p

    the predicate used to test elements.

    returns

    true if the given predicate p holds for some of the elements of this list, otherwise false.

    definition classes: LinearSeqLikeIterableLikeTraversableLike
  37. def filter(p: (A) ⇒ Boolean): Repr

    Selects all elements of this list which satisfy a predicate

    Selects all elements of this list which satisfy a predicate.

    p

    the predicate used to test elements.

    returns

    a new list consisting of all elements of this list that satisfy the given predicate p. The order of the elements is preserved.

    definition classes: TraversableLike
  38. def filterNot(p: (A) ⇒ Boolean): Repr

    Selects all elements of this list which do not satisfy a predicate

    Selects all elements of this list which do not satisfy a predicate.

    p

    the predicate used to test elements.

    returns

    a new list consisting of all elements of this list that do not satisfy the given predicate p. The order of the elements is preserved.

    definition classes: TraversableLike
  39. def find(p: (A) ⇒ Boolean): Option[A]

    Finds the first element of the list satisfying a predicate, if any

    Finds the first element of the list satisfying a predicate, if any.

    p

    the predicate used to test elements.

    returns

    an option value containing the first element in the list that satisfies p, or None if none exists.

    definition classes: LinearSeqLikeIterableLikeTraversableLike
  40. def findIndexOf(p: (A) ⇒ Boolean): Int

    Returns index of the first element satisying a predicate, or -1

    Returns index of the first element satisying a predicate, or -1.

    definition classes: SeqLike
  41. def findLastIndexOf(p: (A) ⇒ Boolean): Int

    Returns index of the last element satisying a predicate, or -1

    Returns index of the last element satisying a predicate, or -1.

    definition classes: SeqLike
  42. def first: A

  43. def firstOption: Option[A]

    None if iterable is empty

    None if iterable is empty.

    definition classes: IterableLike
  44. def flatMap[B, That](f: (A) ⇒ Traversable[B])(bf: CanBuildFrom[Repr, B, That]): That

    Builds a new collection by applying a function to all elements of this list and concatenating the results

    Builds a new collection by applying a function to all elements of this list and concatenating the results.

    B

    the element type of the returned collection.

    That

    the class of the returned collection. In the standard library configuration, That is always List[B] because an implicit of type CanBuildFrom[List, B, That] is defined in object List.

    f

    the function to apply to each element.

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type B.

    returns

    a new collection of type That resulting from applying the given collection-valued function f to each element of this list and concatenating the results.

    definition classes: TraversableLike
  45. def flatten[B](asTraversable: (A) ⇒ Traversable[B]): CC[B]

    Converts this list of traversable collections into a list in which all element collections are concatenated

    Converts this list of traversable collections into a list in which all element collections are concatenated.

    B

    the type of the elements of each traversable collection.

    asTraversable

    an implicit conversion which asserts that the element type of this list is a Traversable.

    returns

    a new list resulting from concatenating all element lists.

    definition classes: GenericTraversableTemplate
  46. def foldLeft[B](z: B)(f: (B, A) ⇒ B): B

    Applies a binary operator to a start value and all elements of this list, going left to right

    Applies a binary operator to a start value and all elements of this list, going left to right.

    B

    the result type of the binary operator.

    z

    the start value.

    returns

    the result of inserting op between consecutive elements of this list$, going left to right with the start value z on the left: {{{ op(...op(z, x1), x2, ..., xn) }}} where x,,1,,, ..., x,,n,, are the elements of this list.

    definition classes: LinearSeqLikeTraversableLike
  47. def foldRight[B](z: B)(f: (A, B) ⇒ B): B

    Applies a binary operator to all elements of this list and a start value, going right to left

    Applies a binary operator to all elements of this list and a start value, going right to left.

    B

    the result type of the binary operator.

    z

    the start value.

    returns

    the result of inserting op between consecutive elements of this list$, going right to left with the start value z on the right: {{{ op(x1, op(x2, ... op(xn, z)...)) }}} where x,,1,,, ..., x,,n,, are the elements of this list.

    definition classes: LinearSeqLikeIterableLikeTraversableLike
  48. def forall(p: (A) ⇒ Boolean): Boolean

    Tests whether a predicate holds for all elements of this list

    Tests whether a predicate holds for all elements of this list.

    p

    the predicate used to test elements.

    returns

    true if the given predicate p holds for all elements of this list, otherwise false.

    definition classes: LinearSeqLikeIterableLikeTraversableLike
  49. def foreach[B](f: (A) ⇒ B): Unit

    Applies a function f to all elements of this list

    Applies a function f to all elements of this list.

    Note: this method underlies the implementation of most other bulk operations. Subclasses should re-implement this method if a more efficient implementation exists.

    f

    the function that is applied for its side-effect to every element. The result of function f is discarded.

    definition classes: LinearSeqLikeIterableLikeTraversableLike
  50. def genericBuilder[B]: Builder[B, CC[B]]

    The generic builder that builds instances of List at arbitrary element types

    The generic builder that builds instances of List at arbitrary element types.

    definition classes: GenericTraversableTemplate
  51. def groupBy[K](f: (A) ⇒ K): Map[K, Repr]

    Partitions this list into a map of lists according to some discriminator function

    Partitions this list into a map of lists according to some discriminator function.

    Note: this method is not re-implemented by views. This means when applied to a view it will always force the view and return a new list.

    K

    the type of keys returned by the discriminator function.

    f

    the discriminator function.

    returns

    A map from keys to lists such that the following invariant holds: {{{ (xs partition f)(k) = xs filter (x => f(x) == k) }}} That is, every key k is bound to a list of those elements x for which f(x) equals k.

    definition classes: TraversableLike
  52. def hasDefiniteSize: Boolean

    Tests whether this list is known to have a finite size

    Tests whether this list is known to have a finite size. All strict collections are known to have finite size. For a non-strict collection such as Stream, the predicate returns true if all elements have been computed. It returns false if the stream is not yet evaluated to the end.

    Note: many collection methods will not work on collections of infinite sizes.

    definition classes: TraversableLike
  53. def hashCode(): Int

    Hashcodes for List produce a value from the hashcodes of all the elements of the list

    Hashcodes for List produce a value from the hashcodes of all the elements of the list.

    definition classes: SeqLike ⇐ AnyRef ⇐ Any
  54. def head: Nothing

    Selects the first element of this list

    Selects the first element of this list.

  55. def headOption: Option[A]

    Optionally selects the first element

    Optionally selects the first element.

    definition classes: TraversableLike
  56. def indexOf[B >: A](elem: B, from: Int): Int

    Finds index of first occurrence of some value in this list after or at some start index

    Finds index of first occurrence of some value in this list after or at some start index.

    B

    the type of the element elem.

    elem

    the element value to search for.

    from

    the start index

    returns

    the index >= from of the first element of this list that is equal (wrt ==) to elem, or -1, if none exists.

    definition classes: SeqLike
  57. def indexOf[B >: A](elem: B): Int

    Finds index of first occurrence of some value in this list

    Finds index of first occurrence of some value in this list.

    B

    the type of the element elem.

    elem

    the element value to search for.

    returns

    the index of the first element of this list that is equal (wrt ==) to elem, or -1, if none exists.

    definition classes: SeqLike
  58. def indexOfSlice[B >: A](that: Seq[B], from: Int): Int

    Finds first index after or at a start index where this list contains a given sequence as a slice

    Finds first index after or at a start index where this list contains a given sequence as a slice.

    that

    the sequence to test

    from

    the start index

    returns

    the first index >= from such that the elements of this list starting at this index match the elements of sequence that, or -1 of no such subsequence exists.

    definition classes: SeqLike
  59. def indexOfSlice[B >: A](that: Seq[B]): Int

    Finds first index where this list contains a given sequence as a slice

    Finds first index where this list contains a given sequence as a slice.

    that

    the sequence to test

    returns

    the first index such that the elements of this list starting at this index match the elements of sequence that, or -1 of no such subsequence exists.

    definition classes: SeqLike
  60. def indexWhere(p: (A) ⇒ Boolean, from: Int): Int

    Finds index of the first element satisfying some predicate after or at some start index

    Finds index of the first element satisfying some predicate after or at some start index.

    p

    the predicate used to test elements.

    from

    the start index

    returns

    the index >= from of the first element of this list that satisfies the predicate p, or -1, if none exists.

    definition classes: LinearSeqLikeSeqLike
  61. def indexWhere(p: (A) ⇒ Boolean): Int

    Finds index of first element satisfying some predicate

    Finds index of first element satisfying some predicate.

    p

    the predicate used to test elements.

    returns

    the index of the first element of this list that satisfies the predicate p, or -1, if none exists.

    definition classes: SeqLike
  62. def indices: Range

    Produces the range of all indices of this sequence

    Produces the range of all indices of this sequence.

    definition classes: SeqLike
  63. def init: Repr

    Selects all elements except the last

    Selects all elements except the last.

    definition classes: TraversableLike
  64. def intersect[B >: A, That](that: Seq[B]): Repr

    Computes the multiset intersection between this list and another sequence

    Computes the multiset intersection between this list and another sequence.

    B

    the element type of the returned list.

    That

    the class of the returned collection. In the standard library configuration, That is always List[B] because an implicit of type CanBuildFrom[List, B, That] is defined in object List.

    that

    the sequence of elements to intersect with.

    returns

    a new collection of type That which contains all elements of this list which also appear in that. If an element value x appears n times in that, then the first n occurrences of x will be retained in the result, but any following occurrences will be omitted.

    definition classes: SeqLike
  65. def isDefinedAt(x: Int): Boolean

    Tests whether this list contains given index

    Tests whether this list contains given index.

    The implementations of methods apply and isDefinedAt turn a Seq[A] into a PartialFunction[Int, A].

    definition classes: LinearSeqLikeSeqLike
  66. def isEmpty: Boolean

    Tests whether this list is empty

    Tests whether this list is empty.

  67. def iterator: Iterator[A]

    Creates a new iterator over all elements contained in this iterable object

    Creates a new iterator over all elements contained in this iterable object.

    definition classes: LinearSeqLikeIterableLike
  68. def last: A

    Selects the last element

    Selects the last element.

    definition classes: LinearSeqLikeTraversableLike
  69. def lastIndexOf[B >: A](elem: B, end: Int): Int

    Finds index of last occurrence of some value in this list before or at a given end index

    Finds index of last occurrence of some value in this list before or at a given end index.

    B

    the type of the element elem.

    elem

    the element value to search for.

    end

    the end index.

    returns

    the index <= end of the last element of this list that is equal (wrt ==) to elem, or -1, if none exists.

    definition classes: SeqLike
  70. def lastIndexOf[B >: A](elem: B): Int

    Finds index of last occurrence of some value in this list

    Finds index of last occurrence of some value in this list.

    B

    the type of the element elem.

    elem

    the element value to search for.

    returns

    the index of the last element of this list that is equal (wrt ==) to elem, or -1, if none exists.

    definition classes: SeqLike
  71. def lastIndexOfSlice[B >: A](that: Seq[B], end: Int): Int

    Finds last index before or at a given end index where this list contains a given sequence as a slice

    Finds last index before or at a given end index where this list contains a given sequence as a slice.

    that

    the sequence to test

    end

    the end idnex

    returns

    the last index <= end such that the elements of this list starting at this index match the elements of sequence that, or -1 of no such subsequence exists.

    definition classes: SeqLike
  72. def lastIndexOfSlice[B >: A](that: Seq[B]): Int

    Finds last index where this list contains a given sequence as a slice

    Finds last index where this list contains a given sequence as a slice.

    that

    the sequence to test

    returns

    the last index such that the elements of this list starting a this index match the elements of sequence that, or -1 of no such subsequence exists.

    definition classes: SeqLike
  73. def lastIndexWhere(p: (A) ⇒ Boolean, end: Int): Int

    Finds index of last element satisfying some predicate before or at given end index

    Finds index of last element satisfying some predicate before or at given end index.

    p

    the predicate used to test elements.

    returns

    the index <= end of the last element of this list that satisfies the predicate p, or -1, if none exists.

    definition classes: LinearSeqLikeSeqLike
  74. def lastIndexWhere(p: (A) ⇒ Boolean): Int

    Finds index of last element satisfying some predicate

    Finds index of last element satisfying some predicate.

    p

    the predicate used to test elements.

    returns

    the index of the last element of this list that satisfies the predicate p, or -1, if none exists.

    definition classes: SeqLike
  75. def lastOption: Option[A]

    Optionally selects the last element

    Optionally selects the last element.

    definition classes: TraversableLike
  76. def length: Int

    The length of the list

    The length of the list.

    Note: the execution of length may take time proportial to the length of the sequence.

    definition classes: LinearSeqLikeSeqLike
  77. def lengthCompare(len: Int): Int

    Compares the length of this list to a test value

    Compares the length of this list to a test value.

    len

    the test value that gets compared with the length.

    returns

    A value x where {{{ x < 0 if this.length < len x == 0 if this.length == len x > 0 if this.length > len }}} The method as implemented here does not call length directly; its running time is O(length min len) instead of O(length). The method should be overwritten if computing length is cheap.

    definition classes: LinearSeqLikeSeqLike
  78. def lift: (A) ⇒ Option[B]

    Turns this partial function into an plain function returning an Option result

    Turns this partial function into an plain function returning an Option result.

    definition classes: PartialFunction
  79. def map[B, That](f: (A) ⇒ B)(bf: CanBuildFrom[Repr, B, That]): That

    Builds a new collection by applying a function to all elements of this list

    Builds a new collection by applying a function to all elements of this list.

    B

    the element type of the returned collection.

    That

    the class of the returned collection. In the standard library configuration, That is always List[B] because an implicit of type CanBuildFrom[List, B, That] is defined in object List.

    f

    the function to apply to each element.

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type B.

    returns

    a new collection of type That resulting from applying the given function f to each element of this list and collecting the results.

    definition classes: TraversableLike
  80. def mapConserve[B >: A](f: (A) ⇒ B): List[B]

    Builds a new list by applying a function to all elements of this list

    Builds a new list by applying a function to all elements of this list. Like xs map f, but returns xs unchanged if function f maps all elements to themselves (wrt ==).

    Note: Unlike map, mapConserve is not tail-recursive.

    B

    the element type of the returned collection.

    f

    the function to apply to each element.

    returns

    a list resulting from applying the given function f to each element of this list and collecting the results.

    definition classes: List
  81. def max[B >: A](cmp: Ordering[B]): A

    Finds the largest element

    Finds the largest element.

    B

    The type over which the ordering is defined.

    cmp

    An ordering to be used for comparing elements.

    returns

    the largest element of this list with respect to the ordering cmp.

    definition classes: TraversableLike
  82. def min[B >: A](cmp: Ordering[B]): A

    Finds the smallest element

    Finds the smallest element.

    B

    The type over which the ordering is defined.

    cmp

    An ordering to be used for comparing elements.

    returns

    the smallest element of this list with respect to the ordering cmp.

    definition classes: TraversableLike
  83. def mkString: String

    Displays all elements of this list in a string

    Displays all elements of this list in a string.

    definition classes: TraversableLike
  84. def mkString(sep: String): String

    Displays all elements of this list in a string using a separator string

    Displays all elements of this list in a string using a separator string.

    sep

    the separator string.

    returns

    a string representation of this list. In the resulting string the string representations (w.r.t. the method toString) of all elements of this list are separated by the string sep.

    definition classes: TraversableLike
  85. def mkString(start: String, sep: String, end: String): String

    Displays all elements of this list in a string using start, end, and separator strings

    Displays all elements of this list in a string using start, end, and separator strings.

    start

    the starting string.

    sep

    the separator string.

    end

    the ending string.

    returns

    a string representation of this list. The resulting string begins with the string start and ends with the string end. Inside, the string representations (w.r.t. the method toString) of all elements of this list are separated by the string sep.

    definition classes: TraversableLike
  86. def nonEmpty: Boolean

    Tests whether the list is not empty

    Tests whether the list is not empty.

    definition classes: TraversableLike
  87. def orElse[A1 <: A, B1 >: B](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]

    Composes this partial function with a fallback partial function which gets applied where this partial function is not defined

    Composes this partial function with a fallback partial function which gets applied where this partial function is not defined.

    A1

    the argument type of the fallback function

    B1

    the result type of the fallback function

    that

    the fallback function

    returns

    a partial function which has as domain the union of the domains of this partial function and that. The resulting partial function takes x to this(x) where this is defined, and to that(x) where it is not.

    definition classes: PartialFunction
  88. def padTo[B >: A, That](len: Int, elem: B)(bf: CanBuildFrom[Repr, B, That]): That

    Appends an element value to this list until a given target length is reached

    Appends an element value to this list until a given target length is reached.

    B

    the element type of the returned list.

    That

    the class of the returned collection. In the standard library configuration, That is always List[B] because an implicit of type CanBuildFrom[List, B, That] is defined in object List.

    len

    the target length

    elem

    the padding value

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type B.

    returns

    a new collection of type That consisting of all elements of this list followed by the minimal number of occurrences of elem so that the resulting collection has a length of at least len.

    definition classes: SeqLike
  89. def partialMap[B, That](pf: PartialFunction[A, B])(bf: CanBuildFrom[Repr, B, That]): That

    Builds a new collection by applying a partial function to all elements of this list on which the function is defined

    Builds a new collection by applying a partial function to all elements of this list on which the function is defined.

    B

    the element type of the returned collection.

    That

    the class of the returned collection. In the standard library configuration, That is always List[B] because an implicit of type CanBuildFrom[List, B, That] is defined in object List.

    pf

    the partial function which filters and maps the list.

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type B.

    returns

    a new collection of type That resulting from applying the partial function pf to each element on which it is defined and collecting the results. The order of the elements is preserved.

    definition classes: TraversableLike
  90. def partition(p: (A) ⇒ Boolean): (Repr, Repr)

    Partitions this list in two lists according to a predicate

    Partitions this list in two lists according to a predicate.

    p

    the predicate on which to partition.

    returns

    a pair of lists: the first list consists of all elements that satisfy the predicate p and the second list consists of all elements that don't. The relative order of the elements in the resulting lists is the same as in the original list.

    definition classes: TraversableLike
  91. def patch[B >: A, That](from: Int, patch: Seq[B], replaced: Int)(bf: CanBuildFrom[Repr, B, That]): That

    Produces a new list where a slice of elements in this list is replaced by another sequence

    Produces a new list where a slice of elements in this list is replaced by another sequence.

    B

    the element type of the returned list.

    That

    the class of the returned collection. In the standard library configuration, That is always List[B] because an implicit of type CanBuildFrom[List, B, That] is defined in object List.

    from

    the index of the first replaced element

    patch

    the replacement sequence

    replaced

    the number of elements to drop in the original list

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type B.

    returns

    a new collection of type That consisting of all elements of this list except that replaced elements starting from from are replaced by patch.

    definition classes: SeqLike
  92. def prefixLength(p: (A) ⇒ Boolean): Int

    Returns the length of the longest prefix whose elements all satisfy some preficate

    Returns the length of the longest prefix whose elements all satisfy some preficate.

    p

    the predicate used to test elements.

    returns

    the length of the longest prefix of this list such that every element of the segment satisfies the predicate p.

    definition classes: SeqLike
  93. def product[B >: A](num: Numeric[B]): B

    Multiplies up the elements of this collection

    Multiplies up the elements of this collection.

    B

    the result type of the * operator.

    num

    an implicit parameter defining a set of numeric operations which includes the * operator to be used in forming the product.

    returns

    the product of all elements of this list with respect to the * operator in num.

    definition classes: TraversableLike
  94. def productArity: Int

    return k for a product A(x_1,

    return k for a product A(x_1,...,x_k)

    definition classes: NilProduct
  95. def productElement(arg0: Int): Any

    for a product A(x_1,

    for a product A(x_1,...,x_k), returns x_(n+1) for 0 <= n < k

    definition classes: NilProduct
  96. def productElements: Iterator[Any]

  97. def productIterator: Iterator[Any]

    An iterator that returns all fields of this product

    An iterator that returns all fields of this product

    definition classes: Product
  98. def productPrefix: String

    By default the empty string

    By default the empty string. Implementations may override this method in order to prepend a string prefix to the result of the toString methods.

    definition classes: NilProduct
  99. def projection: SeqView[A, Repr]

    returns a projection that can be used to call non-strict filter, map, and flatMap methods that build projections of the collection

    returns a projection that can be used to call non-strict filter, map, and flatMap methods that build projections of the collection.

    definition classes: SeqLikeIterableLike
  100. def reduceLeft[B >: A](f: (B, A) ⇒ B): B

    Applies a binary operator to all elements of this list, going left to right

    Applies a binary operator to all elements of this list, going left to right.

    B

    the result type of the binary operator.

    returns

    the result of inserting op between consecutive elements of this list$, going left to right: {{{ op(...(op(x1, x2), ... ) , xn) }}} where x,,1,,, ..., x,,n,, are the elements of this list.

    definition classes: LinearSeqLikeTraversableLike
  101. def reduceLeftOption[B >: A](op: (B, A) ⇒ B): Option[B]

    Optionally applies a binary operator to all elements of this list, going left to right

    Optionally applies a binary operator to all elements of this list, going left to right.

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

    an option value containing the result of reduceLeft(op) is this list is nonempty, None otherwise.

    definition classes: TraversableLike
  102. def reduceRight[B >: A](op: (A, B) ⇒ B): B

    Applies a binary operator to all elements of this list, going right to left

    Applies a binary operator to all elements of this list, going right to left.

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

    the result of inserting op between consecutive elements of this list$, going right to left: {{{ op(x1, op(x2, ..., op(xn-1, xn)...)) }}} where x,,1,,, ..., x,,n,, are the elements of this list.

    definition classes: LinearSeqLikeIterableLikeTraversableLike
  103. def reduceRightOption[B >: A](op: (A, B) ⇒ B): Option[B]

    Optionally applies a binary operator to all elements of this list, going right to left

    Optionally applies a binary operator to all elements of this list, going right to left.

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

    an option value containing the result of reduceRight(op) is this list is nonempty, None otherwise.

    definition classes: TraversableLike
  104. def remove(p: (A) ⇒ Boolean): List[A]

  105. def removeDuplicates: Repr

    Builds a new list from this list without any duplicate elements

    Builds a new list from this list without any duplicate elements.

    definition classes: SeqLike
  106. def repr: Repr

    The collection of type list underlying this TraversableLike object

    The collection of type list underlying this TraversableLike object. By default this is implemented as the TraversableLike object itself, but this can be overridden.

    definition classes: TraversableLike
  107. def reverse: List[A]

    Returns new list wih elements in reversed order

    Returns new list wih elements in reversed order.

    definition classes: ListSeqLike
  108. def reverseIterator: Iterator[A]

    An iterator yielding elements in reversed order

    An iterator yielding elements in reversed order.

    Note: xs.reverseIterator is the same as xs.reverse.iterator but might be more efficient.

    definition classes: SeqLike
  109. def reverseMap[B, That](f: (A) ⇒ B)(bf: CanBuildFrom[Repr, B, That]): That

    Builds a new collection by applying a function to all elements of this list and collecting the results in reversed order

    Builds a new collection by applying a function to all elements of this list and collecting the results in reversed order.

    Note: xs.reverseMap(f) is the same as xs.reverse.map(f) but might be more efficient.

    B

    the element type of the returned collection.

    That

    the class of the returned collection. In the standard library configuration, That is always List[B] because an implicit of type CanBuildFrom[List, B, That] is defined in object List.

    f

    the function to apply to each element.

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type B.

    returns

    a new collection of type That resulting from applying the given function f to each element of this list and collecting the results in reversed order.

    definition classes: SeqLike
  110. def reverse_:::[B >: A](prefix: List[B]): List[B]

    Adds the elements of a given list in reverse order in front of this list

    Adds the elements of a given list in reverse order in front of this list. xs reverse_::: ys is equivalent to xs.reverse ::: ys but is more efficient.

    prefix

    the prefix to reverse and then prepend

    returns

    the concatenation of the reversed prefix and the current list.

    definition classes: List
  111. def reversedElements: Iterator[A]

  112. def sameElements[B >: A](that: Iterable[B]): Boolean

    Checks if the other iterable collection contains the same elements in the same order as this list

    Checks if the other iterable collection contains the same elements in the same order as this list.

    B

    the type of the elements of collection that.

    that

    the collection to compare with.

    returns

    true, if both collections contain the same elements in the same order, false otherwise.

    definition classes: LinearSeqLikeIterableLike
  113. def segmentLength(p: (A) ⇒ Boolean, from: Int): Int

    Computes length of longest segment whose elements all satisfy some preficate

    Computes length of longest segment whose elements all satisfy some preficate.

    p

    the predicate used to test elements.

    from

    the index where the search starts.

    returns

    the length of the longest segment of this list starting from index from such that every element of the segment satisfies the predicate p.

    definition classes: LinearSeqLikeSeqLike
  114. def size: Int

    The size of this list, equivalent to length

    The size of this list, equivalent to length.

    definition classes: SeqLikeTraversableLike
  115. def slice(start: Int, end: Int): List[A]

    Selects an interval of elements

    Selects an interval of elements.

    Note: c.slice(from, to) is equivalent to (but possibly more efficient than) c.drop(from).take(to - from)

    definition classes: ListLinearSeqLikeIterableLikeTraversableLike
  116. def sort(lt: (A, A) ⇒ Boolean): List[A]

    Sort the list according to the comparison function lt(e1: a, e2: a) => Boolean, which should be true iff e1 precedes e2 in the desired ordering

    Sort the list according to the comparison function lt(e1: a, e2: a) => Boolean, which should be true iff e1 precedes e2 in the desired ordering. !!! todo: move sorting to IterableLike

    lt

    the comparison function

    returns

    a list sorted according to the comparison function lt(e1: a, e2: a) => Boolean.

    definition classes: List
  117. def sortBy[B](f: (A) ⇒ B)(ord: Ordering[B]): Repr

    Sorts this List according to the Ordering which results from transforming an implicitly given Ordering with a transformation function

    Sorts this List according to the Ordering which results from transforming an implicitly given Ordering with a transformation function.

    B

    the target type of the transformation f, and the type where the ordering ord is defined.

    f

    the transformation function mapping elements to some other domain B.

    ord

    the ordering assumed on domain B.

    returns

    a list consisting of the elements of this list sorted according to the ordering where x < y if ord.lt(f(x), f(y)).

    definition classes: SeqLike
  118. def sortWith[B >: A](ord: Ordering[B]): Repr

    Sorts this list according to an Ordering

    Sorts this list according to an Ordering.

    The sort is stable. That is, elements that are equal wrt lt appear in the same order in the sorted sequence as in the original.

    ord

    the ordering to be used to compare elements.

    returns

    a list consisting of the elements of this list sorted according to the ordering ord.

    definition classes: SeqLike
  119. def sortWith(lt: (A, A) ⇒ Boolean): Repr

    Sorts this list according to a comparison function

    Sorts this list according to a comparison function.

    The sort is stable. That is, elements that are equal wrt lt appear in the same order in the sorted sequence as in the original.

    lt

    the comparison function which tests whether its first argument precedes its second argument in the desired ordering.

    returns

    a list consisting of the elements of this list sorted according to the comparison function lt.

    definition classes: SeqLike
  120. def span(p: (A) ⇒ Boolean): (List[A], List[A])

    Spits this list into a prefix/suffix pair according to a predicate

    Spits this list into a prefix/suffix pair according to a predicate.

    Note: c span p is equivalent to (but possibly more efficient than) (c takeWhile p, c dropWhile p), provided the evaluation of the predicate p does not cause any side-effects.

    p

    the test predicate

    returns

    a pair consisting of the longest prefix of this list whose elements all satisfy p, and the rest of this list.

    definition classes: ListLinearSeqLikeTraversableLike
  121. def splitAt(n: Int): (List[A], List[A])

    Splits this list into two at a given position

    Splits this list into two at a given position. Note: c splitAt n is equivalent to (but possibly more efficient than) (c take n, c drop n).

    n

    the position at which to split.

    returns

    a pair of lists consisting of the first n elements of this list, and the other elements.

    definition classes: ListTraversableLike
  122. def startsWith[B](that: Seq[B]): Boolean

    Tests whether this list starts with the given sequence

    Tests whether this list starts with the given sequence.

    that

    the sequence to test

    returns

    true if this collection has that as a prefix, false otherwise. otherwise false

    definition classes: SeqLike
  123. def startsWith[B](that: Seq[B], offset: Int): Boolean

    Tests whether this list contains the given sequence at a given index

    Tests whether this list contains the given sequence at a given index.

    If the both the receiver object, this and the argument, that are infinite sequences this method may not terminate.

    that

    the sequence to test

    offset

    the index where the sequence is searched.

    returns

    true if the sequence that is contained in this list at index offset, otherwise false.

    definition classes: SeqLike
  124. def stringPrefix: String

    Defines the prefix of this object's toString representation

    Defines the prefix of this object's toString representation.

    definition classes: ListTraversableLike
  125. def sum[B >: A](num: Numeric[B]): B

    Sums up the elements of this collection

    Sums up the elements of this collection.

    B

    the result type of the + operator.

    num

    an implicit parameter defining a set of numeric operations which includes the + operator to be used in forming the sum.

    returns

    the sum of all elements of this list with respect to the + operator in num.

    definition classes: TraversableLike
  126. def tail: List[Nothing]

    Selects all elements except the first

    Selects all elements except the first.

    definition classes: NilListLinearSeqLikeTraversableLike
  127. def take(n: Int): List[A]

    Selects first n elements

    Selects first n elements.

    n

    Tt number of elements to take from this list.

    returns

    a list consisting only of the first n elements of this list, or else the whole list, if it has less than n elements.

    definition classes: ListLinearSeqLikeIterableLikeTraversableLike
  128. def takeRight(n: Int): List[A]

    Selects last n elements

    Selects last n elements.

    n

    the number of elements to take

    returns

    a list consisting only of the last n elements of this list, or else the whole list, if it has less than n elements.

    definition classes: ListIterableLike
  129. def takeWhile(p: (A) ⇒ Boolean): List[A]

    Takes longest prefix of elements that satisfy a predicate

    Takes longest prefix of elements that satisfy a predicate.

    p

    The predicate used to test elements.

    returns

    the longest prefix of this list whose elements all satisfy the predicate p.

    definition classes: ListLinearSeqLikeIterableLikeTraversableLike
  130. def toArray[B >: A](arg0: ClassManifest[B]): Array[B]

    Converts this list to an array

    Converts this list to an array.

    B

    the type of the elements of the array. A ClassManifest for this type must be available.

    returns

    an array containing all elements of this list.

    definition classes: TraversableLike
  131. def toIndexedSeq[B >: A]: IndexedSeq[B]

    Converts this list to an indexed sequence

    Converts this list to an indexed sequence.

    definition classes: TraversableLike
  132. def toIterable: Iterable[A]

    Converts this list to an iterable collection

    Converts this list to an iterable collection.

    Note: Will not terminate for infinite-sized collections.

    definition classes: IterableLikeTraversableLike
  133. def toList: List[A]

    Converts this list to a list

    Converts this list to a list.

    definition classes: ListTraversableLike
  134. def toSeq: Seq[A]

    Converts this list to a sequence

    Converts this list to a sequence.

    Overridden for efficiency.

    definition classes: SeqLikeTraversableLike
  135. def toSet[B >: A]: Set[B]

    Converts this list to a set

    Converts this list to a set.

    definition classes: TraversableLike
  136. def toStream: Stream[A]

    Converts this list to a stream

    Converts this list to a stream.

    definition classes: ListIterableLikeTraversableLike
  137. def toString(): String

    Converts this list to a string

    Converts this list to a string

    definition classes: SeqLikeTraversableLike ⇐ AnyRef ⇐ Any
  138. def transpose[B](asTraversable: (A) ⇒ Traversable[B]): CC[CC[B] @scala.annotation.unchecked.uncheckedVariance]

    Transposes this list of traversable collections into

    Transposes this list of traversable collections into

    definition classes: GenericTraversableTemplate
  139. def union[B >: A, That](that: Seq[B])(bf: CanBuildFrom[Repr, B, That]): That

    Produces a new sequence which contains all elements of this list and also all elements of a given sequence

    Produces a new sequence which contains all elements of this list and also all elements of a given sequence. xs union ys is equivalent to xs ++ ys.

    Another way to express this is that xs union ys computes the order-presevring multi-set union of xs and ys. union is hence a counter-oart of diff and intersect which also work on multi-sets.

    B

    the element type of the returned list.

    That

    the class of the returned collection. In the standard library configuration, That is always List[B] because an implicit of type CanBuildFrom[List, B, That] is defined in object List.

    that

    the sequence to add.

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type B.

    returns

    a new collection of type That which contains all elements of this list followed by all elements of that.

    definition classes: SeqLike
  140. def unzip[A1, A2](asPair: (A) ⇒ (A1, A2)): (CC[A1], CC[A2])

    Converts this list of pairs into two collections of the first and second halfs of each pair

    Converts this list of pairs into two collections of the first and second halfs of each pair.

    asPair

    an implicit conversion which asserts that the element type of this list is a pair.

    returns

    a pair lists, containing the first, respectively second half of each element pair of this list.

    definition classes: GenericTraversableTemplate
  141. def updated[B >: A, That](index: Int, elem: B)(bf: CanBuildFrom[Repr, B, That]): That

    A copy of this list with one single replaced element

    A copy of this list with one single replaced element.

    B

    the element type of the returned list.

    That

    the class of the returned collection. In the standard library configuration, That is always List[B] because an implicit of type CanBuildFrom[List, B, That] is defined in object List.

    index

    the position of the replacement

    elem

    the replacing element

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type B.

    returns

    a new collection of type That which is a copy of this list with the element at position index replaced by elem.

    definition classes: SeqLike
  142. def view(from: Int, until: Int): SeqView[A, Repr]

    Creates a non-strict view of a slice of this list

    Creates a non-strict view of a slice of this list.

    Note: the difference between view and slice is that view produces a view of the current list, whereas slice produces a new list.

    Note: view(from, to) is equivalent to view.slice(from, to)

    from

    the index of the first element of the view

    until

    the index of the element following the view

    returns

    a non-strict view of a slice of this list, starting at index from and extending up to (but not including) index until.

    definition classes: SeqLikeIterableLikeTraversableLike
  143. def view: SeqView[A, Repr]

    Creates a non-strict view of this list

    Creates a non-strict view of this list.

    definition classes: SeqLikeIterableLikeTraversableLike
  144. def withFilter(p: (A) ⇒ Boolean): WithFilter

    Creates a non-strict filter of this list

    Creates a non-strict filter of this list.

    Note: the difference between c filter p and c withFilter p is that the former creates a new collection, whereas the latter only restricts the domain of subsequent map, flatMap, foreach, and withFilter operations.

    p

    the predicate used to test elements.

    returns

    an object of class WithFilter, which supports map, flatMap, foreach, and withFilter operations. All these operations apply to those elements of this list which satify the predicate p.

    definition classes: TraversableLike
  145. def zip[A1 >: A, B, That](that: Iterable[B])(bf: CanBuildFrom[Repr, (A1, B), That]): That

    Returns a list formed from this list and another iterable collection by combining corresponding elements in pairs

    Returns a list formed from this list and another iterable collection by combining corresponding elements in pairs. If one of the two collections is longer than the other, its remaining elements are ignored.

    A1

    the type of the first half of the returned pairs (this is always a supertype of the collection's element type A).

    B

    the type of the second half of the returned pairs

    That

    the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type (A1, B) being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, (A1, B), That]. is found.

    that

    The iterable providing the second half of each result pair

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type (A1, B).

    returns

    a new collection of type That containing pairs consisting of corresponding elements of this list and that. The length of the returned collection is the minimum of the lengths of this list$ and that.

    definition classes: IterableLike
  146. def zipAll[B, A1 >: A, That](that: Iterable[B], thisElem: A1, thatElem: B)(bf: CanBuildFrom[Repr, (A1, B), That]): That

    Returns a list formed from this list and another iterable collection by combining corresponding elements in pairs

    Returns a list formed from this list and another iterable collection 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.

    that

    the iterable providing the second half of each result pair

    thisElem

    the element to be used to fill up the result if this list is shorter than that.

    thatElem

    the element to be used to fill up the result if that is shorter than this list.

    returns

    a new collection of type That containing pairs consisting of corresponding elements of this list and that. The length of the returned collection is the maximum of the lengths of this list$ and that. If this list is shorter than that, thisElem values are used to pad the result. If that is shorter than this list, thatElem values are used to pad the result.

    definition classes: IterableLike
  147. def zipWithIndex[A1 >: A, That](bf: CanBuildFrom[Repr, (A1, Int), That]): That

    Zips this list with its indices

    Zips this list with its indices.

    A1

    the type of the first half of the returned pairs (this is always a supertype of the collection's element type A).

    That

    the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type (A1, Int) being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, (A1, Int), That]. is found.

    returns

    A new collection of type That containing pairs consisting of all elements of this list paired with their index. Indices start at 0.

    definition classes: IterableLike