scala.collection.immutable

List

class List [+A] extends LinearSeq[A] with Product with GenericTraversableTemplate[A, List] with LinearSeqOptimized[A, List[A]]

A class for immutable linked lists representing ordered collections of elements of type.

This class comes with two implementing case classes scala.Nil and scala.:: that implement the abstract members isEmpty, head and tail.

A

the type of the list's elements

attributes: sealed abstract
go to: companion
linear super types: LinearSeqOptimized[A, List[A]], Product, LinearSeq[A], LinearSeq[A], LinearSeqLike[A, List[A]], Seq[A], Seq[A], SeqLike[A, List[A]], PartialFunction[Int, A], (Int) ⇒ A, Iterable[A], Iterable[A], IterableLike[A, List[A]], Equals, Traversable[A], Immutable, Traversable[A], GenericTraversableTemplate[A, List], TraversableLike[A, List[A]], TraversableOnce[A], FilterMonadic[A, List[A]], HasNewBuilder[A, List[A]], AnyRef, Any
known subclasses: ::, Nil
source: List.scala
    version
  1. 2.8

    since
  1. 1.0

Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Hide All
  2. Show all
  1. List
  2. LinearSeqOptimized
  3. Product
  4. LinearSeq
  5. LinearSeq
  6. LinearSeqLike
  7. Seq
  8. Seq
  9. SeqLike
  10. PartialFunction
  11. Function1
  12. Iterable
  13. Iterable
  14. IterableLike
  15. Equals
  16. Traversable
  17. Immutable
  18. Traversable
  19. GenericTraversableTemplate
  20. TraversableLike
  21. TraversableOnce
  22. FilterMonadic
  23. HasNewBuilder
  24. AnyRef
  25. Any
Visibility
  1. Public
  2. All
Impl.
  1. Concrete
  2. Abstract

Instance constructors

  1. new List ()

Type Members

  1. type Self = List[A]

    The type implementing this traversable

    The type implementing this traversable

    attributes: protected
    definition classes: TraversableLike
  2. class WithFilter extends FilterMonadic[A, Repr]

    A class supporting filtered operations.

Value Members

  1. def != (arg0: AnyRef) : Boolean

    attributes: final
    definition classes: AnyRef
  2. def != (arg0: Any) : Boolean

    o != arg0 is the same as !(o == (arg0)).

    o != arg0 is the same as !(o == (arg0)).

    arg0

    the object to compare against this object for dis-equality.

    returns

    false if the receiver object is equivalent to the argument; true otherwise.

    attributes: final
    definition classes: Any
  3. def ## () : Int

    attributes: final
    definition classes: AnyRef → Any
  4. def $asInstanceOf [T0] () : T0

    attributes: final
    definition classes: AnyRef
  5. def $isInstanceOf [T0] () : Boolean

    attributes: final
    definition classes: AnyRef
  6. def ++ (that: TraversableOnce[A]) : List[A]

    [use case] Concatenates this list with the elements of a traversable collection.

    [use case]

    Concatenates this list with the elements of a traversable collection.

    that

    the traversable to append.

    returns

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

    attributes: abstract
    definition classes: TraversableLike
  7. def ++ [B >: A, That] (that: TraversableOnce[B])(implicit 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
  8. def +: (elem: A) : List[A]

    [use case] Prepends an element to this list

    [use case]

    Prepends an element to this list

    elem

    the prepended element

    returns

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

    attributes: abstract
    definition classes: SeqLike
  9. def +: [B >: A, That] (elem: B)(implicit bf: CanBuildFrom[List[A], 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: ListSeqLike
  10. 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.

      deprecated:
    1. use filterNot (_ == x) instead

  11. 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.

      deprecated:
    1. use list1 filterNot (list2 contains) instead

  12. 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: TraversableOnce
  13. def :+ (elem: A) : List[A]

    [use case] Appends an element to this list

    [use case]

    Appends an element to this list

    elem

    the appended element

    returns

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

    attributes: abstract
    definition classes: SeqLike
  14. def :+ [B >: A, That] (elem: B)(implicit bf: CanBuildFrom[List[A], 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
  15. def :: (x: A) : List[A]

    [use case] Adds an element at the beginning of this list.

    [use case]

    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.

    attributes: abstract
  16. 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.

  17. def ::: (prefix: List[A]) : List[A]

    [use case] Adds the elements of a given list in front of this list.

    [use case]

    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.

    attributes: abstract
  18. 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.

  19. 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: TraversableOnce
  20. def == (arg0: AnyRef) : Boolean

    o == arg0 is the same as if (o eq null) arg0 eq null else o.equals(arg0).

    o == arg0 is the same as if (o eq null) arg0 eq null else o.equals(arg0).

    arg0

    the object to compare against this object for equality.

    returns

    true if the receiver object is equivalent to the argument; false otherwise.

    attributes: final
    definition classes: AnyRef
  21. def == (arg0: Any) : Boolean

    o == arg0 is the same as o.equals(arg0).

    o == arg0 is the same as o.equals(arg0).

    arg0

    the object to compare against this object for equality.

    returns

    true if the receiver object is equivalent to the argument; false otherwise.

    attributes: final
    definition classes: Any
  22. 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: TraversableOnce
  23. 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: TraversableOnce
  24. 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: TraversableOnce
  25. def andThen [C] (k: (A) ⇒ C) : PartialFunction[Int, 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
  26. 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: LinearSeqOptimizedSeqLike
  27. def asInstanceOf [T0] : T0

    This method is used to cast the receiver object to be of type T0.

    This method is used to cast the receiver object to be of type T0.

    Note that the success of a cast at runtime is modulo Scala's erasure semantics. Therefore the expression1.asInstanceOf[String] will throw a ClassCastException at runtime, while the expressionList(1).asInstanceOf[List[String]] will not. In the latter example, because the type argument is erased as part of compilation it is not possible to check whether the contents of the list are of the requested typed.

    returns

    the receiver object.

    attributes: final
    definition classes: Any
  28. def break (p: (A) ⇒ Boolean) : (List[A], List[A])

    Like span but with the predicate inverted.

    Like span but with the predicate inverted.

      deprecated:
    1. use span { x => !p(x) } instead

  29. 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
  30. def clone () : AnyRef

    This method creates and returns a copy of the receiver object.

    This method creates and returns a copy of the receiver object.

    The default implementation of the clone method is platform dependent.

    returns

    a copy of the receiver object.

    attributes: protected
    definition classes: AnyRef
  31. def collect [B] (pf: PartialFunction[A, B]) : List[B]

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

    [use case]

    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.

    pf

    the partial function which filters and maps the list.

    returns

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

    attributes: abstract
    definition classes: TraversableLike
  32. def collect [B, That] (pf: PartialFunction[A, B])(implicit bf: CanBuildFrom[List[A], 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
  33. def companion : GenericCompanion[List]

    The factory companion object that builds instances of class List.

    The factory companion object that builds instances of class List.

    definition classes: ListLinearSeqLinearSeqSeqSeqIterableIterableTraversableTraversableGenericTraversableTemplate
  34. def compose [A] (g: (A) ⇒ Int) : (A) ⇒ A

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

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

    definition classes: Function1
  35. 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
  36. 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
  37. def copyToArray (xs: Array[A], start: Int, len: Int) : Unit

    [use case] Copies elements of this list to an array.

    [use case]

    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.

    xs

    the array to fill.

    start

    the starting index.

    len

    the maximal number of elements to copy.

    attributes: abstract
    definition classes: TraversableLike
  38. 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: IterableLikeTraversableLikeTraversableOnce
  39. def copyToArray (xs: Array[A]) : Unit

    [use case] Copies values of this list to an array.

    [use case]

    Copies values of this list to an array. Fills the given array xs with values of this list. Copying will stop once either the end of the current list is reached, or the end of the array is reached.

    xs

    the array to fill.

    attributes: abstract
    definition classes: TraversableOnce
  40. def copyToArray [B >: A] (xs: Array[B]) : Unit

    Copies values of this list to an array.

    Copies values of this list to an array. Fills the given array xs with values of this list. 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: TraversableOnce
  41. def copyToArray (xs: Array[A], start: Int) : Unit

    [use case] Copies values of this list to an array.

    [use case]

    Copies values of this list to an array. Fills the given array xs with values of this list, after skipping start values. Copying will stop once either the end of the current list is reached, or the end of the array is reached.

    xs

    the array to fill.

    start

    the starting index.

    attributes: abstract
    definition classes: TraversableOnce
  42. def copyToArray [B >: A] (xs: Array[B], start: Int) : Unit

    Copies values of this list to an array.

    Copies values of this list to an array. Fills the given array xs with values of this list, after skipping start values. 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: TraversableOnce
  43. 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: TraversableOnce
  44. 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
  45. 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: LinearSeqOptimizedTraversableOnce
  46. def diff (that: Seq[A]) : List[A]

    [use case] Computes the multiset difference between this list and another sequence.

    [use case]

    Computes the multiset difference between this list and another sequence.

    that

    the sequence of elements to remove

    returns

    a new list 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.

    attributes: abstract
    definition classes: SeqLike
  47. def diff [B >: A] (that: Seq[B]) : List[A]

    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 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
  48. def distinct : List[A]

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

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

    returns

    A new list which contains the first occurrence of every element of this list.

    definition classes: SeqLike
  49. 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: ListLinearSeqOptimizedTraversableLike
  50. def dropRight (n: Int) : List[A]

    Selects all elements except last n ones.

    Selects all elements except last 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: LinearSeqOptimizedIterableLike
  51. 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
  52. def elements : Iterator[A]

    definition classes: IterableLike
      deprecated:
    1. use iterator' instead

  53. 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
  54. def eq (arg0: AnyRef) : Boolean

    This method is used to test whether the argument (arg0) is a reference to the receiver object (this).

    This method is used to test whether the argument (arg0) is a reference to the receiver object (this).

    The eq method implements an [http://en.wikipedia.org/wiki/Equivalence_relation equivalence relation] on non-null instances of AnyRef: * It is reflexive: for any non-null instance x of type AnyRef, x.eq(x) returns true. * It is symmetric: for any non-null instances x and y of type AnyRef, x.eq(y) returns true if and only if y.eq(x) returns true. * It is transitive: for any non-null instances x, y, and z of type AnyRef if x.eq(y) returns true and y.eq(z) returns true, then x.eq(z) returns true.

    Additionally, the eq method has three other properties. * It is consistent: for any non-null instances x and y of type AnyRef, multiple invocations of x.eq(y) consistently returns true or consistently returns false. * For any non-null instance x of type AnyRef, x.eq(null) and null.eq(x) returns false. * null.eq(null) returns true.

    When overriding the equals or hashCode methods, it is important to ensure that their behavior is consistent with reference equality. Therefore, if two objects are references to each other (o1 eq o2), they should be equal to each other (o1 == o2) and they should hash to the same value (o1.hashCode == o2.hashCode).

    arg0

    the object to compare against this object for reference equality.

    returns

    true if the argument is a reference to the receiver object; false otherwise.

    attributes: final
    definition classes: AnyRef
  55. def equals (that: Any) : Boolean

    The equality method defined in AnyRef.

    The equality method defined in AnyRef.@return true if the receiver object is equivalent to the argument; false otherwise. */

    definition classes: SeqLikeEquals → AnyRef → Any
  56. 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
      deprecated:
    1. use corresponds instead

  57. 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.

  58. def filter (p: (A) ⇒ Boolean) : List[A]

    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
  59. def filterNot (p: (A) ⇒ Boolean) : List[A]

    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
  60. def finalize () : Unit

    This method is called by the garbage collector on the receiver object when garbage collection determines that there are no more references to the object.

    This method is called by the garbage collector on the receiver object when garbage collection determines that there are no more references to the object.

    The details of when and if the finalize method are invoked, as well as the interaction between finalizeand non-local returns and exceptions, are all platform dependent.

    attributes: protected
    definition classes: AnyRef
  61. 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.

  62. def findIndexOf (p: (A) ⇒ Boolean) : Int

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

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

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

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

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

    definition classes: SeqLike
      deprecated:
    1. use lastIndexWhere instead

  64. def first : A

    definition classes: IterableLike
      deprecated:
    1. use head' instead

  65. def firstOption : Option[A]

    None if iterable is empty.

    None if iterable is empty.

    definition classes: IterableLike
      deprecated:
    1. use headOption' instead

  66. def flatMap [B] (f: (A) ⇒ Traversable[B]) : List[B]

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

    [use case]

    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.

    f

    the function to apply to each element.

    returns

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

    attributes: abstract
    definition classes: TraversableLike
  67. def flatMap [B, That] (f: (A) ⇒ Traversable[B])(implicit bf: CanBuildFrom[List[A], 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: TraversableLikeFilterMonadic
  68. def flatten [B] : List[B]

    [use case] Converts this list of traversable collections into a list in which all element collections are concatenated.

    [use case]

    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.

    returns

    a new list resulting from concatenating all element lists.

    attributes: abstract
    definition classes: GenericTraversableTemplate
  69. def flatten [B] (implicit asTraversable: (A) ⇒ Traversable[B]) : List[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
  70. 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: LinearSeqOptimizedTraversableOnce
  71. 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: LinearSeqOptimizedIterableLikeTraversableOnce
  72. 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.

  73. def foreach (f: (A) ⇒ Unit) : Unit

    [use case] Applies a function f to all elements of this list.

    [use case]

    Applies a function f to all elements of this list.

    f

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

    attributes: abstract
    definition classes: IterableLike
  74. 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.

  75. def genericBuilder [B] : Builder[B, List[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
  76. def getClass () : java.lang.Class[_]

    Returns a representation that corresponds to the dynamic class of the receiver object.

    Returns a representation that corresponds to the dynamic class of the receiver object.

    The nature of the representation is platform dependent.

    returns

    a representation that corresponds to the dynamic class of the receiver object.

    attributes: final
    definition classes: AnyRef
  77. def groupBy [K] (f: (A) ⇒ K) : Map[K, List[A]]

    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
  78. def grouped (size: Int) : Iterator[List[A]]

    Partitions elements in fixed size lists.

    Partitions elements in fixed size lists.

    size

    the number of elements per group

    returns

    An iterator producing lists of size size, except the last will be truncated if the elements don't divide evenly.

    definition classes: IterableLike
      see also:
    1. Iterator#grouped

  79. 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.

    returns

    true if this collection is known to have finite size, false otherwise.

    definition classes: TraversableLikeTraversableOnce
  80. 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.@return the hash code value for the object. */

    definition classes: SeqLike → AnyRef → Any
  81. def head : A

    Selects the first element of this list.

    Selects the first element of this list.

    returns

    the first element of this list.

    definition classes: IterableLikeTraversableLike
  82. def headOption : Option[A]

    Optionally selects the first element.

    Optionally selects the first element.

    returns

    the first element of this list if it is nonempty, None if it is empty.

    definition classes: TraversableLike
  83. def indexOf (elem: A, from: Int) : Int

    [use case] Finds index of first occurrence of some value in this list after or at some start index.

    [use case]

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

    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.

    attributes: abstract
    definition classes: SeqLike
  84. 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
  85. def indexOf (elem: A) : Int

    [use case] Finds index of first occurrence of some value in this list.

    [use case]

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

    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.

    attributes: abstract
    definition classes: SeqLike
  86. 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
  87. 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
  88. 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
  89. 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: LinearSeqOptimizedSeqLike
  90. 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
  91. def indices : Range

    Produces the range of all indices of this sequence.

    Produces the range of all indices of this sequence.

    returns

    a Range value from 0 to one less than the length of this list.

    definition classes: SeqLike
  92. def init : List[A]

    Selects all elements except the last.

    Selects all elements except the last.

    returns

    a list consisting of all elements of this list except the last one.

    definition classes: TraversableLike
  93. def intersect (that: Seq[A]) : List[A]

    [use case] Computes the multiset intersection between this list and another sequence.

    [use case]

    Computes the multiset intersection between this list and another sequence.

    that

    the sequence of elements to intersect with.

    returns

    a new list 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.

    attributes: abstract
    definition classes: SeqLike
  94. def intersect [B >: A] (that: Seq[B]) : List[A]

    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 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
  95. 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].

    returns

    true if this list contains an element at position idx, false otherwise.

    definition classes: LinearSeqOptimizedSeqLike
  96. def isEmpty : Boolean

    Tests whether this list is empty.

    Tests whether this list is empty.

    returns

    true if the list contain no elements, false otherwise.

    definition classes: IterableLikeTraversableLikeTraversableOnce
  97. def isInstanceOf [T0] : Boolean

    This method is used to test whether the dynamic type of the receiver object is T0.

    This method is used to test whether the dynamic type of the receiver object is T0.

    Note that the test result of the test is modulo Scala's erasure semantics. Therefore the expression1.isInstanceOf[String] will return false, while the expression List(1).isInstanceOf[List[String]] will return true. In the latter example, because the type argument is erased as part of compilation it is not possible to check whether the contents of the list are of the requested typed.

    returns

    true if the receiver object is an instance of erasure of type T0; false otherwise.

    attributes: final
    definition classes: Any
  98. def isTraversableAgain : Boolean

    Tests whether this list can be repeatedly traversed.

    Tests whether this list can be repeatedly traversed.

    returns

    true

    attributes: final
    definition classes: TraversableLikeTraversableOnce
  99. 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.

    returns

    the new iterator

    definition classes: LinearSeqLikeIterableLike
  100. def last : A

    Selects the last element.

    Selects the last element.

    returns

    the first element of this list.

    definition classes: LinearSeqOptimizedTraversableLike
  101. def lastIndexOf (elem: A, end: Int) : Int

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

    [use case]

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

    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.

    attributes: abstract
    definition classes: SeqLike
  102. 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
  103. def lastIndexOf (elem: A) : Int

    [use case] Finds index of last occurrence of some value in this list.

    [use case]

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

    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.

    attributes: abstract
    definition classes: SeqLike
  104. 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
  105. 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 index

    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
  106. 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
  107. 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: LinearSeqOptimizedSeqLike
  108. 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
  109. def lastOption : Option[A]

    Optionally selects the last element.

    Optionally selects the last element.

    returns

    the last element of this list$ if it is nonempty, None if it is empty.

    definition classes: TraversableLike
  110. 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.@return the number of elements in this list.

    definition classes: LinearSeqOptimizedSeqLike
  111. 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: LinearSeqOptimizedSeqLike
  112. def lift : (Int) ⇒ Option[A]

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

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

    returns

    a function that takes an argument x to Some(this(x)) if this is defined for x, and to None otherwise.

    definition classes: PartialFunction
  113. def map [B] (f: (A) ⇒ B) : List[B]

    [use case] Builds a new collection by applying a function to all elements of this list.

    [use case]

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

    B

    the element type of the returned collection.

    f

    the function to apply to each element.

    returns

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

    attributes: abstract
    definition classes: TraversableLike
  114. def map [B, That] (f: (A) ⇒ B)(implicit bf: CanBuildFrom[List[A], 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: TraversableLikeFilterMonadic
  115. def mapConserve (f: (A) ⇒ A) : List[A]

    [use case] Builds a new list by applying a function to all elements of this list.

    [use case]

    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 eq).

    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.

    attributes: abstract
  116. def mapConserve [B >: A <: AnyRef] (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 eq).

    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.

  117. def max : A

    [use case] Finds the largest element.

    [use case]

    Finds the largest element.

    returns

    the largest element of this list.

    attributes: abstract
    definition classes: TraversableOnce
  118. def max [B >: A] (implicit 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: TraversableOnce
  119. def min : A

    [use case] Finds the smallest element.

    [use case]

    Finds the smallest element.

    returns

    the smallest element of this list

    attributes: abstract
    definition classes: TraversableOnce
  120. def min [B >: A] (implicit 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: TraversableOnce
  121. def mkString : String

    Displays all elements of this list in a string.

    Displays all elements of this list in a 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 follow each other without any separator string.

    definition classes: TraversableOnce
  122. 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: TraversableOnce
  123. 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: TraversableOnce
  124. def ne (arg0: AnyRef) : Boolean

    o.ne(arg0) is the same as !(o.eq(arg0)).

    o.ne(arg0) is the same as !(o.eq(arg0)).

    arg0

    the object to compare against this object for reference dis-equality.

    returns

    false if the argument is not a reference to the receiver object; true otherwise.

    attributes: final
    definition classes: AnyRef
  125. def newBuilder : Builder[A, List[A]]

    The builder that builds instances of type List[A]

    The builder that builds instances of type List[A]

    attributes: protected[this]
    definition classes: GenericTraversableTemplateHasNewBuilder
  126. def nonEmpty : Boolean

    Tests whether the list is not empty.

    Tests whether the list is not empty.

    returns

    true if the list contains at least one element, false otherwise.

    definition classes: TraversableOnce
  127. def notify () : Unit

    Wakes up a single thread that is waiting on the receiver object's monitor.

    Wakes up a single thread that is waiting on the receiver object's monitor.

    attributes: final
    definition classes: AnyRef
  128. def notifyAll () : Unit

    Wakes up all threads that are waiting on the receiver object's monitor.

    Wakes up all threads that are waiting on the receiver object's monitor.

    attributes: final
    definition classes: AnyRef
  129. 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
  130. def padTo (len: Int, elem: A) : List[A]

    [use case] Appends an element value to this list until a given target length is reached.

    [use case]

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

    len

    the target length

    elem

    the padding value

    returns

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

    attributes: abstract
    definition classes: SeqLike
  131. def padTo [B >: A, That] (len: Int, elem: B)(implicit bf: CanBuildFrom[List[A], 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
  132. def partition (p: (A) ⇒ Boolean) : (List[A], List[A])

    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
  133. def patch (from: Int, that: Seq[A], replaced: Int) : List[A]

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

    [use case]

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

    from

    the index of the first replaced element

    replaced

    the number of elements to drop in the original list

    returns

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

    attributes: abstract
    definition classes: SeqLike
  134. def patch [B >: A, That] (from: Int, patch: Seq[B], replaced: Int)(implicit bf: CanBuildFrom[List[A], 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 list consisting of all elements of this list except that replaced elements starting from from are replaced by patch.

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

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

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

    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
  136. def product : Int

    [use case] Multiplies up the elements of this collection.

    [use case]

    Multiplies up the elements of this collection.

    returns

    the product of all elements in this list of numbers of type Int. Instead of Int, any other type T with an implicit Numeric[T] implementation can be used as element type of the list and as result type of product. Examples of such types are: Long, Float, Double, BigInt.

    attributes: abstract
    definition classes: TraversableOnce
  137. def product [B >: A] (implicit 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: TraversableOnce
  138. def productArity : Int

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

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

    attributes: abstract
    definition classes: Product
  139. def productElement (n: Int) : Any

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

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

    n

    the index of the element to return

    returns

    The element n elements after the first element

    attributes: abstract
    definition classes: Product
  140. def productElements : Iterator[Any]

    definition classes: Product
      deprecated:
    1. use productIterator instead

  141. 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
  142. 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: Product
  143. def projection : SeqView[A, List[A]]

    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
      deprecated:
    1. use view' instead

  144. 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: LinearSeqOptimizedTraversableOnce
  145. 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: TraversableOnce
  146. 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: LinearSeqOptimizedIterableLikeTraversableOnce
  147. 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: TraversableOnce
  148. def remove (p: (A) ⇒ Boolean) : List[A]

      deprecated:
    1. use filterNot' instead

  149. def removeDuplicates : List[A]

      deprecated:
    1. use distinct' instead

  150. def repr : List[A]

    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
  151. def reverse : List[A]

    Returns new list wih elements in reversed order.

    Returns new list wih elements in reversed order.

    returns

    A new list with all elements of this list in reversed order.

    definition classes: ListSeqLike
  152. 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.

    returns

    an iterator yielding the elements of this list in reversed order

    definition classes: SeqLike
  153. def reverseMap [B] (f: (A) ⇒ B) : List[B]

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

    [use case]

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

    B

    the element type of the returned collection.

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

    f

    the function to apply to each element.

    returns

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

    attributes: abstract
    definition classes: SeqLike
  154. def reverseMap [B, That] (f: (A) ⇒ B)(implicit bf: CanBuildFrom[List[A], 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
  155. def reverse_::: (prefix: List[A]) : List[A]

    [use case] Adds the elements of a given list in reverse order in front of this list.

    [use case]

    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.

    attributes: abstract
  156. 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.

  157. def reversed : List[A]

    attributes: protected[this]
    definition classes: TraversableOnce
  158. def reversedElements : Iterator[A]

    definition classes: SeqLike
      deprecated:
    1. use reverseIterator' instead

  159. def sameElements (that: Iterable[A]) : Boolean

    [use case] Checks if the other iterable collection contains the same elements in the same order as this list.

    [use case]

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

    that

    the collection to compare with.

    returns

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

    attributes: abstract
    definition classes: IterableLike
  160. 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: LinearSeqOptimizedIterableLike
  161. def scanLeft [B, That] (z: B)(op: (B, A) ⇒ B)(implicit bf: CanBuildFrom[List[A], B, That]) : That

    Produces a collection containing cummulative results of applying the operator going left to right.

    Produces a collection containing cummulative results of applying the operator going left to right.

    B

    the type of the elements in the resulting collection

    That

    the actual type of the resulting collection

    z

    the initial value

    op

    the binary operator applied to the intermediate result and the 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

    collection with intermediate results

    definition classes: TraversableLike
  162. def scanRight [B, That] (z: B)(op: (A, B) ⇒ B)(implicit bf: CanBuildFrom[List[A], B, That]) : That

    Produces a collection containing cummulative results of applying the operator going right to left.

    Produces a collection containing cummulative results of applying the operator going right to left.

    B

    the type of the elements in the resulting collection

    That

    the actual type of the resulting collection

    z

    the initial value

    op

    the binary operator applied to the intermediate result and the 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

    collection with intermediate results

    definition classes: TraversableLike
  163. def segmentLength (p: (A) ⇒ Boolean, from: Int) : Int

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

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

    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: LinearSeqOptimizedSeqLike
  164. def size : Int

    The size of this list, equivalent to length.

    The size of this list, equivalent to length.

    returns

    the number of elements in this list.

    definition classes: SeqLikeTraversableOnce
  165. 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)

    returns

    a list containing the elements starting at index from and extending up to (but not including) index until of this list.

    definition classes: ListLinearSeqOptimizedIterableLikeTraversableLike
  166. def sliding [B >: A] (size: Int, step: Int) : Iterator[List[A]]

    definition classes: IterableLike
  167. def sliding [B >: A] (size: Int) : Iterator[List[A]]

    Groups elements in fixed size blocks by passing a "sliding window" over them (as opposed to partitioning them, as is done in grouped.

    Groups elements in fixed size blocks by passing a "sliding window" over them (as opposed to partitioning them, as is done in grouped.)

    size

    the number of elements per group

    returns

    An iterator producing lists of size size, except the last will be truncated if the elements don't divide evenly.

    definition classes: IterableLike
      see also:
    1. Iterator#sliding

  168. def sort (lt: (A, A) ⇒ Boolean) : List[A]

    Sort the list according to the comparison function lt(e1: a, e2: a) =&gt; 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) =&gt; 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) =&gt; Boolean.

      deprecated:
    1. use sortWith' instead

  169. def sortBy [B] (f: (A) ⇒ B)(implicit ord: Ordering[B]) : List[A]

    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
      see also:
    1. scala.math.Ordering

  170. def sortWith (lt: (A, A) ⇒ Boolean) : List[A]

    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
  171. def sorted [B >: A] (implicit ord: Ordering[B]) : List[A]

    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
      see also:
    1. scala.math.Ordering

  172. def span (p: (A) ⇒ Boolean) : (List[A], List[A])

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

    Splits 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: ListLinearSeqOptimizedTraversableLike
  173. 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
  174. 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.

    definition classes: SeqLike
  175. 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
  176. def stringPrefix : String

    Defines the prefix of this object's toString representation.

    Defines the prefix of this object's toString representation.

    returns

    a string representation which starts the result of toString applied to this list. By default the string prefix is the simple name of the collection class list.

    definition classes: ListTraversableLike
  177. def sum : Int

    [use case] Sums up the elements of this collection.

    [use case]

    Sums up the elements of this collection.

    returns

    the sum of all elements in this list of numbers of type Int. Instead of Int, any other type T with an implicit Numeric[T] implementation can be used as element type of the list and as result type of sum. Examples of such types are: Long, Float, Double, BigInt.

    attributes: abstract
    definition classes: TraversableOnce
  178. def sum [B >: A] (implicit 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: TraversableOnce
  179. def synchronized [T0] (arg0: T0) : T0

    attributes: final
    definition classes: AnyRef
  180. def tail : List[A]

    Selects all elements except the first.

    Selects all elements except the first.

    returns

    a list consisting of all elements of this list except the first one.

    definition classes: TraversableLike
  181. 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: ListLinearSeqOptimizedIterableLikeTraversableLike
  182. 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
  183. 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: ListLinearSeqOptimizedIterableLikeTraversableLike
  184. def thisCollection : LinearSeq[A]

    The underlying collection seen as an instance of List.

    The underlying collection seen as an instance of List. By default this is implemented as the current collection object itself, but this can be overridden.

    attributes: protected[this]
    definition classes: LinearSeqLikeSeqLikeIterableLikeTraversableLike
  185. def toArray : Array[A]

    [use case] Converts this list to an array.

    [use case]

    Converts this list to an array.

    returns

    an array containing all elements of this list. A ClassManifest must be available for the element type of this list.

    attributes: abstract
    definition classes: TraversableOnce
  186. def toArray [B >: A] (implicit 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: TraversableOnce
  187. def toBuffer [B >: A] : Buffer[B]

    Converts this list to a mutable buffer.

    Converts this list to a mutable buffer.

    returns

    a buffer containing all elements of this list.

    definition classes: TraversableOnce
  188. def toCollection (repr: List[A]) : LinearSeq[A]

    A conversion from collections of type Repr to List objects.

    A conversion from collections of type Repr to List objects. By default this is implemented as just a cast, but this can be overridden.

    attributes: protected[this]
    definition classes: LinearSeqLikeSeqLikeIterableLikeTraversableLike
  189. def toIndexedSeq [B >: A] : IndexedSeq[B]

    Converts this list to an indexed sequence.

    Converts this list to an indexed sequence.

    returns

    an indexed sequence containing all elements of this list.

    definition classes: TraversableOnce
  190. def toIterable : Iterable[A]

    Converts this list to an iterable collection.

    Converts this list to an iterable collection. Note that the choice of target Iterable is lazy in this default implementation as this TraversableOnce may be lazy and unevaluated (i.e. it may be an iterator which is only traversable once).

    returns

    an Iterable containing all elements of this list.

    definition classes: IterableLikeTraversableOnce
  191. def toIterator : Iterator[A]

    Returns an Iterator over the elements in this list.

    Returns an Iterator over the elements in this list. Will return the same Iterator if this instance is already an Iterator.

    returns

    an Iterator containing all elements of this list.

    definition classes: TraversableLikeTraversableOnce
  192. def toList : List[A]

    Converts this list to a list.

    Converts this list to a list.

    returns

    a list containing all elements of this list.

    definition classes: ListTraversableOnce
  193. def toMap [T, U] (implicit ev: <:<[A, (T, U)]) : Map[T, U]

    Converts this list to a map.

    Converts this list to a map. This method is unavailable unless the elements are members of Tuple2, each ((K, V)) becoming a key-value pair in the map. Duplicate keys will be overwritten by later keys: if this is an unordered collection, which key is in the resulting map is undefined.

    returns

    a map containing all elements of this list.

    definition classes: TraversableOnce
  194. def toSeq : Seq[A]

    Converts this list to a sequence.

    Converts this list to a sequence.

    Overridden for efficiency.@return a sequence containing all the elements of this list.

    definition classes: SeqLikeIterableLikeTraversableOnce
  195. def toSet [B >: A] : Set[B]

    Converts this list to a set.

    Converts this list to a set.

    returns

    a set containing all elements of this list.

    definition classes: TraversableOnce
  196. def toStream : Stream[A]

    Converts this list to a stream.

    Converts this list to a stream.

    returns

    a stream containing all elements of this list.

    definition classes: ListIterableLikeTraversableLikeTraversableOnce
  197. def toString () : String

    Converts this list to a string.

    Converts this list to a string.

    returns

    a string representation of this collection. By default this string consists of the stringPrefix of this list, followed by all elements separated by commas and enclosed in parentheses.

    definition classes: SeqLikeTraversableLike → AnyRef → Any
  198. def toTraversable : Traversable[A]

    Converts this list to an unspecified Traversable.

    Converts this list to an unspecified Traversable. Will return the same collection if this instance is already Traversable.

    returns

    a Traversable containing all elements of this list.

    definition classes: TraversableLikeTraversableOnce
  199. def transpose [B] (implicit asTraversable: (A) ⇒ Traversable[B]) : List[List[B]]

    Transposes this list of traversable collections into a list of lists.

    Transposes this list of traversable collections into a list of lists.

    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 two-dimensional list of lists which has as nth row the nth column of this list.

    definition classes: GenericTraversableTemplate
  200. def union (that: Seq[A]) : List[A]

    [use case] Produces a new sequence which contains all elements of this list and also all elements of a given sequence.

    [use case]

    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.

    that

    the sequence to add.

    returns

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

    attributes: abstract
    definition classes: SeqLike
  201. def union [B >: A, That] (that: Seq[B])(implicit bf: CanBuildFrom[List[A], 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-part 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
  202. def unzip [A1, A2] (implicit asPair: (A) ⇒ (A1, A2)) : (List[A1], List[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
  203. def updated (index: Int, elem: A) : List[A]

    [use case] A copy of this list with one single replaced element.

    [use case]

    A copy of this list with one single replaced element.

    index

    the position of the replacement

    elem

    the replacing element

    returns

    a copy of this list with the element at position index replaced by elem.

    attributes: abstract
    definition classes: SeqLike
  204. def updated [B >: A, That] (index: Int, elem: B)(implicit bf: CanBuildFrom[List[A], 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 list which is a copy of this list with the element at position index replaced by elem.

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

    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
  206. def view : SeqView[A, List[A]]

    Creates a non-strict view of this list.

    Creates a non-strict view of this list.

    returns

    a non-strict view of this list.

    definition classes: SeqLikeIterableLikeTraversableLike
  207. def wait () : Unit

    attributes: final
    definition classes: AnyRef
  208. def wait (arg0: Long, arg1: Int) : Unit

    attributes: final
    definition classes: AnyRef
  209. def wait (arg0: Long) : Unit

    attributes: final
    definition classes: AnyRef
  210. def withFilter (p: (A) ⇒ Boolean) : FilterMonadic[A, List[A]]

    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 satisfy the predicate p.

    definition classes: TraversableLikeFilterMonadic
  211. def zip [B] (that: Iterable[B]) : List[(A, B)]

    [use case] Returns a list formed from this list and another iterable collection by combining corresponding elements in pairs.

    [use case]

    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.

    B

    the type of the second half of the returned pairs

    that

    The iterable providing the second half of each result pair

    returns

    a new list 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.

    attributes: abstract
    definition classes: IterableLike
  212. def zip [A1 >: A, B, That] (that: Iterable[B])(implicit bf: CanBuildFrom[List[A], (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
  213. def zipAll [B] (that: Iterable[B], thisElem: A, thatElem: B) : List[(A, B)]

    [use case] Returns a list formed from this list and another iterable collection by combining corresponding elements in pairs.

    [use case]

    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.

    B

    the type of the second half of the returned pairs

    that

    The iterable providing the second half of each result pair

    thisElem

    the element to be used to fill up the result if this 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 list 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.

    attributes: abstract
    definition classes: IterableLike
  214. def zipAll [B, A1 >: A, That] (that: Iterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[List[A], (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
  215. def zipWithIndex : List[(A, Int)]

    [use case] Zips this list with its indices.

    [use case]

    Zips this list with its indices.

    returns

    A new list containing pairs consisting of all elements of this list paired with their index. Indices start at 0. @example List("a", "b", "c").zipWithIndex = List(("a", 0), ("b", 1), ("c", 2))

    attributes: abstract
    definition classes: IterableLike
  216. def zipWithIndex [A1 >: A, That] (implicit bf: CanBuildFrom[List[A], (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

Inherited from LinearSeqOptimized[A, List[A]]

Inherited from Product

Inherited from LinearSeq[A]

Inherited from LinearSeq[A]

Inherited from LinearSeqLike[A, List[A]]

Inherited from Seq[A]

Inherited from Seq[A]

Inherited from SeqLike[A, List[A]]

Inherited from PartialFunction[Int, A]

Inherited from (Int) ⇒ A

Inherited from Iterable[A]

Inherited from Iterable[A]

Inherited from IterableLike[A, List[A]]

Inherited from Equals

Inherited from Traversable[A]

Inherited from Immutable

Inherited from Traversable[A]

Inherited from GenericTraversableTemplate[A, List]

Inherited from TraversableLike[A, List[A]]

Inherited from TraversableOnce[A]

Inherited from FilterMonadic[A, List[A]]

Inherited from HasNewBuilder[A, List[A]]

Inherited from AnyRef

Inherited from Any