scala.collection.mutable

MutableList

class MutableList [A] extends LinearSeq[A] with LinearSeqOptimized[A, MutableList[A]] with Builder[A, MutableList[A]]

This class is used internally to represent mutable lists. It is the basis for the implementation of the classes Stack, and Queue.

linear super types: Builder[A, MutableList[A]], Growable[A], LinearSeqOptimized[A, MutableList[A]], LinearSeq[A], LinearSeq[A], LinearSeqLike[A, MutableList[A]], Seq[A], Seq[A], SeqLike[A, MutableList[A]], PartialFunction[Int, A], (Int) ⇒ A, Iterable[A], Iterable[A], IterableLike[A, MutableList[A]], Equals, Traversable[A], Mutable, Traversable[A], GenericTraversableTemplate[A, LinearSeq], TraversableLike[A, MutableList[A]], TraversableOnce[A], FilterMonadic[A, MutableList[A]], HasNewBuilder[A, MutableList[A]], AnyRef, Any
known subclasses: Queue, SynchronizedQueue, QueueProxy
source: MutableList.scala
    version
  1. 2.8

    since
  1. 1

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

Instance constructors

  1. new MutableList ()

Type Members

  1. type Self = MutableList[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]) : Growable[A]

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

    [use case]

    Concatenates this growable collection with the elements of a traversable collection.

    that

    the traversable to append.

    returns

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

    attributes: abstract
    definition classes: TraversableLike
  7. def ++ [B >: A, That] (that: TraversableOnce[B])(implicit bf: CanBuildFrom[MutableList[A], B, That]) : That

    Concatenates this growable collection with the elements of a traversable collection.

    Concatenates this growable collection with the elements of a traversable collection.

    B

    the element type of the returned collection.

    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 B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.

    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 growable collection followed by all elements of that.

    definition classes: TraversableLike
  8. def ++= (xs: TraversableOnce[A]) : MutableList.this.type

    adds all elements produced by a TraversableOnce to this growable collection.

    adds all elements produced by a TraversableOnce to this growable collection.

    returns

    the growable collection itself.

    definition classes: Growable
  9. def +: (elem: A) : Growable[A]

    [use case] Prepends an element to this growable collection

    [use case]

    Prepends an element to this growable collection

    elem

    the prepended element

    returns

    a new growable collection consisting of elem followed by all elements of this growable collection.

    attributes: abstract
    definition classes: SeqLike
  10. def +: [B >: A, That] (elem: B)(implicit bf: CanBuildFrom[MutableList[A], B, That]) : That

    Prepends an element to this growable collection

    Prepends an element to this growable collection

    B

    the element type of the returned growable collection.

    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 B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.

    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 growable collection.

    definition classes: SeqLike
  11. def += (elem: A) : MutableList.this.type

    Appends a single element to this buffer.

    Appends a single element to this buffer. This takes constant time.

    elem

    the element to [email protected] the builder itself.

    definition classes: MutableListBuilderGrowable
  12. def += (elem1: A, elem2: A, elems: A*) : MutableList.this.type

    adds two or more elements to this growable collection.

    adds two or more elements to this growable collection.

    elem1

    the first element to add.

    elem2

    the second element to add.

    elems

    the remaining elements to add.

    returns

    the growable collection itself

    definition classes: Growable
  13. def +=: (elem: A) : MutableList.this.type

    Prepends a single element to this list.

    Prepends a single element to this list. This operation takes constant time.

    elem

    the element to prepend.

    returns

    this growable collection.

  14. def /: [B] (z: B)(op: (B, A) ⇒ B) : B

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

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

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

    Note: will not terminate for infinite-sized collections.

    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 growable collection, 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 growable collection.

    definition classes: TraversableOnce
  15. def :+ (elem: A) : Growable[A]

    [use case] Appends an element to this growable collection

    [use case]

    Appends an element to this growable collection

    Note: will not terminate for infinite-sized collections.

    elem

    the appended element

    returns

    a new growable collection consisting of all elements of this growable collection followed by elem.

    attributes: abstract
    definition classes: SeqLike
  16. def :+ [B >: A, That] (elem: B)(implicit bf: CanBuildFrom[MutableList[A], B, That]) : That

    Appends an element to this growable collection

    Appends an element to this growable collection

    Note: will not terminate for infinite-sized collections.

    B

    the element type of the returned growable collection.

    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 B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.

    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 growable collection followed by elem.

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

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

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

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

    Note: will not terminate for infinite-sized collections.

    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 growable collection, 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 growable collection.

    definition classes: TraversableOnce
  18. 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
  19. 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
  20. def addString (b: StringBuilder) : StringBuilder

    Appends all elements of this growable collection to a string builder.

    Appends all elements of this growable collection to a string builder. The written text consists of the string representations (w.r.t. the method toString) of all elements of this growable collection 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
  21. def addString (b: StringBuilder, sep: String) : StringBuilder

    Appends all elements of this growable collection to a string builder using a separator string.

    Appends all elements of this growable collection 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 growable collection, 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
  22. def addString (b: StringBuilder, start: String, sep: String, end: String) : StringBuilder

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

    Appends all elements of this growable collection 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 growable collection 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
  23. 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
  24. def appendElem (elem: A) : Unit

    attributes: protected
  25. def apply (n: Int) : A

    Returns the nth element of this list.

    Returns the nth element of this list.

    definition classes: MutableListLinearSeqOptimizedSeqLikeFunction1
  26. 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
  27. 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 growable collection should be compared

    returns

    true, if this growable collection 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
  28. def clear () : Unit

    Clears the contents of this builder.

    Clears the contents of this builder. After execution of this method the builder will contain no elements.

    definition classes: MutableListBuilderGrowable
  29. 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[lang]
    definition classes: AnyRef
  30. def collect [B] (pf: PartialFunction[A, B]) : Growable[B]

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

    [use case]

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

    B

    the element type of the returned collection.

    pf

    the partial function which filters and maps the growable collection.

    returns

    a new growable collection 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
  31. def collect [B, That] (pf: PartialFunction[A, B])(implicit bf: CanBuildFrom[MutableList[A], B, That]) : That

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

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

    B

    the element type of the returned collection.

    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 B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.

    pf

    the partial function which filters and maps the growable collection.

    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
  32. def companion : GenericCompanion[LinearSeq]

    The factory companion object that builds instances of class Growable.

    The factory companion object that builds instances of class Growable. (or its Iterable superclass where class Growable is not a Seq.)

    definition classes: LinearSeqLinearSeqSeqSeqIterableIterableTraversableTraversableGenericTraversableTemplate
  33. 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
  34. def contains (elem: Any) : Boolean

    Tests whether this growable collection contains a given value as an element.

    Tests whether this growable collection contains a given value as an element.

    Note: may not terminate for infinite-sized collections.

    elem

    the element to test.

    returns

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

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

    Tests whether this growable collection contains a given sequence as a slice.

    Tests whether this growable collection contains a given sequence as a slice.

    Note: may not terminate for infinite-sized collections.

    that

    the sequence to test

    returns

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

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

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

    [use case]

    Copies elements of this growable collection to an array. Fills the given array xs with at most len elements of this growable collection, starting at position start. Copying will stop once either the end of the current growable collection 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
  37. def copyToArray [B >: A] (xs: Array[B], start: Int, len: Int) : Unit

    Copies elements of this growable collection to an array.

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

    Note: will not terminate for infinite-sized collections.

    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
  38. def copyToArray (xs: Array[A]) : Unit

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

    [use case]

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

    xs

    the array to fill.

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

    Copies values of this growable collection to an array.

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

    Note: will not terminate for infinite-sized collections.

    B

    the type of the elements of the array.

    xs

    the array to fill.

    definition classes: TraversableOnce
  40. def copyToArray (xs: Array[A], start: Int) : Unit

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

    [use case]

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

    xs

    the array to fill.

    start

    the starting index.

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

    Copies values of this growable collection to an array.

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

    Note: will not terminate for infinite-sized collections.

    B

    the type of the elements of the array.

    xs

    the array to fill.

    start

    the starting index.

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

    Copies all elements of this growable collection to a buffer.

    Copies all elements of this growable collection to a buffer.

    Note: will not terminate for infinite-sized collections.

    dest

    The buffer to which elements are copied.

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

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

    Tests whether every element of this growable collection 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 growable collection and y of that, otherwise false.

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

    Counts the number of elements in the growable collection which satisfy a predicate.

    Counts the number of elements in the growable collection which satisfy a predicate.

    p

    the predicate used to test elements.

    returns

    the number of elements satisfying the predicate p.

    definition classes: LinearSeqOptimizedTraversableOnce
  45. def diff (that: Seq[A]) : Growable[A]

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

    [use case]

    Computes the multiset difference between this growable collection and another sequence.

    Note: will not terminate for infinite-sized collections.

    that

    the sequence of elements to remove

    returns

    a new growable collection which contains all elements of this growable collection 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
  46. def diff [B >: A] (that: Seq[B]) : MutableList[A]

    Computes the multiset difference between this growable collection and another sequence.

    Computes the multiset difference between this growable collection and another sequence.

    Note: will not terminate for infinite-sized collections.

    B

    the element type of the returned growable collection.

    that

    the sequence of elements to remove

    returns

    a new collection of type That which contains all elements of this growable collection 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
  47. def distinct : MutableList[A]

    Builds a new growable collection from this growable collection without any duplicate elements.

    Builds a new growable collection from this growable collection without any duplicate elements.

    Note: will not terminate for infinite-sized collections.

    returns

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

    definition classes: SeqLike
  48. def drop (n: Int) : MutableList[A]

    Selects all elements except first n ones.

    Selects all elements except first n ones.

    n

    the number of elements to drop from this growable collection.

    returns

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

    definition classes: LinearSeqOptimizedTraversableLike
  49. def dropRight (n: Int) : MutableList[A]

    Selects all elements except last n ones.

    Selects all elements except last n ones.

    n

    The number of elements to take

    returns

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

    definition classes: LinearSeqOptimizedIterableLike
  50. def dropWhile (p: (A) ⇒ Boolean) : MutableList[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 growable collection whose first element does not satisfy the predicate p.

    definition classes: TraversableLike
  51. def elements : Iterator[A]

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

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

    Tests whether this growable collection ends with the given sequence.

    Tests whether this growable collection ends with the given sequence.

    Note: will not terminate for infinite-sized collections.

    that

    the sequence to test

    returns

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

    definition classes: SeqLike
  53. 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
  54. def equals (that: Any) : Boolean

    The equality method defined in AnyRef.

    The equality method defined in AnyRef[email protected] true if the receiver object is equivalent to the argument; false otherwise. */

    definition classes: SeqLikeEquals → AnyRef → Any
  55. def equalsWith [B] (that: Seq[B])(f: (A, B) ⇒ Boolean) : Boolean

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

    Tests whether every element of this growable collection 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 growable collection and y of that, otherwise false.

    definition classes: SeqLike
      deprecated:
    1. use corresponds instead

  56. def exists (p: (A) ⇒ Boolean) : Boolean

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

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

    Note: may not terminate for infinite-sized collections.

    p

    the predicate used to test elements.

    returns

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

  57. def filter (p: (A) ⇒ Boolean) : MutableList[A]

    Selects all elements of this growable collection which satisfy a predicate.

    Selects all elements of this growable collection which satisfy a predicate.

    p

    the predicate used to test elements.

    returns

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

    definition classes: TraversableLike
  58. def filterNot (p: (A) ⇒ Boolean) : MutableList[A]

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

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

    p

    the predicate used to test elements.

    returns

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

    definition classes: TraversableLike
  59. 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[lang]
    definition classes: AnyRef
  60. def find (p: (A) ⇒ Boolean) : Option[A]

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

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

    Note: may not terminate for infinite-sized collections.

    p

    the predicate used to test elements.

    returns

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

  61. 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
  62. 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

  63. def first : A

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

  64. var first0 : LinkedList[A]

    attributes: protected
  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]) : Growable[B]

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

    [use case]

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

    B

    the element type of the returned collection.

    f

    the function to apply to each element.

    returns

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

    attributes: abstract
    definition classes: TraversableLike
  67. def flatMap [B, That] (f: (A) ⇒ Traversable[B])(implicit bf: CanBuildFrom[MutableList[A], B, That]) : That

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

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

    B

    the element type of the returned collection.

    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 B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.

    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 growable collection and concatenating the results.

    definition classes: TraversableLikeFilterMonadic
  68. def flatten [B] : Growable[B]

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

    [use case]

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

    B

    the type of the elements of each traversable collection.

    returns

    a new growable collection resulting from concatenating all element growable collections.

    attributes: abstract
    definition classes: GenericTraversableTemplate
  69. def flatten [B] (implicit asTraversable: (A) ⇒ Traversable[B]) : LinearSeq[B]

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

    Converts this growable collection of traversable collections into a growable collection 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 growable collection is a Traversable.

    returns

    a new growable collection resulting from concatenating all element growable collections.

    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 growable collection, going left to right.

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

    Note: will not terminate for infinite-sized collections.

    B

    the result type of the binary operator.

    z

    the start value.

    returns

    the result of inserting op between consecutive elements of this growable collection, 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 growable collection.

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

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

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

    Note: will not terminate for infinite-sized collections.

    B

    the result type of the binary operator.

    z

    the start value.

    returns

    the result of inserting op between consecutive elements of this growable collection, 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 growable collection.

    definition classes: LinearSeqOptimizedIterableLikeTraversableOnce
  72. def forall (p: (A) ⇒ Boolean) : Boolean

    Tests whether a predicate holds for all elements of this growable collection.

    Tests whether a predicate holds for all elements of this growable collection.

    Note: may not terminate for infinite-sized collections.

    p

    the predicate used to test elements.

    returns

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

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

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

    [use case]

    Applies a function f to all elements of this growable collection.

    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 growable collection.

    Applies a function f to all elements of this growable collection.

    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, LinearSeq[B]]

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

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

    definition classes: GenericTraversableTemplate
  76. def get (n: Int) : Option[A]

    Returns the nth element of this list or None if index does not exist.

    Returns the nth element of this list or None if index does not exist.

  77. def getClass () : java.lang.Class[_ <: java.lang.Object]

    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
  78. def groupBy [K] (f: (A) ⇒ K) : Map[K, MutableList[A]]

    Partitions this growable collection into a map of growable collections according to some discriminator function.

    Partitions this growable collection into a map of growable collections 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 growable collection.

    K

    the type of keys returned by the discriminator function.

    f

    the discriminator function.

    returns

    A map from keys to growable collections 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 growable collection of those elements x for which f(x) equals k.

    definition classes: TraversableLike
  79. def grouped (size: Int) : Iterator[MutableList[A]]

    Partitions elements in fixed size growable collections.

    Partitions elements in fixed size growable collections.

    size

    the number of elements per group

    returns

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

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

  80. def hasDefiniteSize : Boolean

    Tests whether this growable collection is known to have a finite size.

    Tests whether this growable collection 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
  81. def hashCode () : Int

    Hashcodes for Growable produce a value from the hashcodes of all the elements of the growable collection.

    Hashcodes for Growable produce a value from the hashcodes of all the elements of the growable [email protected] the hash code value for the object. */

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

    Returns the first element in this [email protected] the first element of this growable collection.

    Returns the first element in this [email protected] the first element of this growable collection.

  83. def headOption : Option[A]

    Optionally selects the first element.

    Optionally selects the first element.

    returns

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

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

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

    [use case]

    Finds index of first occurrence of some value in this growable collection 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 growable collection that is equal (wrt ==) to elem, or -1, if none exists.

    attributes: abstract
    definition classes: SeqLike
  85. def indexOf [B >: A] (elem: B, from: Int) : Int

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

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

    Note: may not terminate for infinite-sized collections.

    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 growable collection that is equal (wrt ==) to elem, or -1, if none exists.

    definition classes: SeqLike
  86. def indexOf (elem: A) : Int

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

    [use case]

    Finds index of first occurrence of some value in this growable collection.

    elem

    the element value to search for.

    returns

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

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

    Finds index of first occurrence of some value in this growable collection.

    Finds index of first occurrence of some value in this growable collection.

    Note: may not terminate for infinite-sized collections.

    B

    the type of the element elem.

    elem

    the element value to search for.

    returns

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

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

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

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

    Note: may not terminate for infinite-sized collections.

    that

    the sequence to test

    from

    the start index

    returns

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

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

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

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

    Note: may not terminate for infinite-sized collections.

    that

    the sequence to test

    returns

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

    definition classes: SeqLike
  90. 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.

    Note: may not terminate for infinite-sized collections.

    p

    the predicate used to test elements.

    from

    the start index

    returns

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

    definition classes: LinearSeqOptimizedSeqLike
  91. def indexWhere (p: (A) ⇒ Boolean) : Int

    Finds index of first element satisfying some predicate.

    Finds index of first element satisfying some predicate.

    Note: may not terminate for infinite-sized collections.

    p

    the predicate used to test elements.

    returns

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

    definition classes: SeqLike
  92. 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 growable collection.

    definition classes: SeqLike
  93. def init : MutableList[A]

    Selects all elements except the last.

    Selects all elements except the last.

    returns

    a growable collection consisting of all elements of this growable collection except the last one.

    definition classes: TraversableLike
  94. def intersect (that: Seq[A]) : Growable[A]

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

    [use case]

    Computes the multiset intersection between this growable collection and another sequence.

    Note: may not terminate for infinite-sized collections.

    that

    the sequence of elements to intersect with.

    returns

    a new growable collection which contains all elements of this growable collection 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
  95. def intersect [B >: A] (that: Seq[B]) : MutableList[A]

    Computes the multiset intersection between this growable collection and another sequence.

    Computes the multiset intersection between this growable collection and another sequence.

    Note: may not terminate for infinite-sized collections.

    B

    the element type of the returned growable collection.

    that

    the sequence of elements to intersect with.

    returns

    a new collection of type That which contains all elements of this growable collection 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
  96. def isDefinedAt (x: Int) : Boolean

    Tests whether this growable collection contains given index.

    Tests whether this growable collection contains given index.

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

    returns

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

    definition classes: LinearSeqOptimizedSeqLike
  97. def isEmpty : Boolean

    Is the list [email protected] true if the growable collection contain no elements, false otherwise.

    Is the list [email protected] true if the growable collection contain no elements, false otherwise.

  98. 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
  99. def isTraversableAgain : Boolean

    Tests whether this growable collection can be repeatedly traversed.

    Tests whether this growable collection can be repeatedly traversed.

    returns

    true

    attributes: final
    definition classes: TraversableLikeTraversableOnce
  100. def iterator : Iterator[A]

    Returns an iterator over all elements of this list.

    Returns an iterator over all elements of this [email protected] the new iterator

    definition classes: MutableListLinearSeqLikeIterableLike
  101. def last : A

    Selects the last element.

    Selects the last element.

    returns

    The last element of this growable collection.

    definition classes: MutableListLinearSeqOptimizedTraversableLike
  102. var last0 : LinkedList[A]

    attributes: protected
  103. def lastIndexOf (elem: A, end: Int) : Int

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

    [use case]

    Finds index of last occurrence of some value in this growable collection 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 growable collection that is equal (wrt ==) to elem, or -1, if none exists.

    attributes: abstract
    definition classes: SeqLike
  104. def lastIndexOf [B >: A] (elem: B, end: Int) : Int

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

    Finds index of last occurrence of some value in this growable collection 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 growable collection that is equal (wrt ==) to elem, or -1, if none exists.

    definition classes: SeqLike
  105. def lastIndexOf (elem: A) : Int

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

    [use case]

    Finds index of last occurrence of some value in this growable collection.

    elem

    the element value to search for.

    returns

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

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

    Finds index of last occurrence of some value in this growable collection.

    Finds index of last occurrence of some value in this growable collection.

    Note: will not terminate for infinite-sized collections.

    B

    the type of the element elem.

    elem

    the element value to search for.

    returns

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

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

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

    Finds last index before or at a given end index where this growable collection 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 growable collection starting at this index match the elements of sequence that, or -1 of no such subsequence exists.

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

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

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

    Note: will not terminate for infinite-sized collections.

    that

    the sequence to test

    returns

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

    definition classes: SeqLike
  109. 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 growable collection that satisfies the predicate p, or -1, if none exists.

    definition classes: LinearSeqOptimizedSeqLike
  110. def lastIndexWhere (p: (A) ⇒ Boolean) : Int

    Finds index of last element satisfying some predicate.

    Finds index of last element satisfying some predicate.

    Note: will not terminate for infinite-sized collections.

    p

    the predicate used to test elements.

    returns

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

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

    Optionally selects the last element.

    Optionally selects the last element.

    returns

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

    definition classes: TraversableLike
  112. var len : Int

    attributes: protected
  113. def length : Int

    Returns the length of this list.

    Returns the length of this list.

    definition classes: MutableListLinearSeqOptimizedSeqLike
  114. def lengthCompare (len: Int) : Int

    Compares the length of this growable collection to a test value.

    Compares the length of this growable collection 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
  115. 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
  116. def map [B] (f: (A) ⇒ B) : Growable[B]

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

    [use case]

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

    B

    the element type of the returned collection.

    f

    the function to apply to each element.

    returns

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

    attributes: abstract
    definition classes: TraversableLike
  117. def map [B, That] (f: (A) ⇒ B)(implicit bf: CanBuildFrom[MutableList[A], B, That]) : That

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

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

    B

    the element type of the returned collection.

    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 B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.

    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 growable collection and collecting the results.

    definition classes: TraversableLikeFilterMonadic
  118. def mapResult [NewTo] (f: (MutableList[A]) ⇒ NewTo) : Builder[A, NewTo]

    Creates a new builder by applying a transformation function to the results of this builder.

    Creates a new builder by applying a transformation function to the results of this builder.

    NewTo

    the type of collection returned by f.

    f

    the transformation function.

    returns

    a new builder which is the same as the current builder except that a transformation function is applied to this builder's result.

    definition classes: Builder
  119. def max : A

    [use case] Finds the largest element.

    [use case]

    Finds the largest element.

    returns

    the largest element of this growable collection.

    attributes: abstract
    definition classes: TraversableOnce
  120. 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 growable collection with respect to the ordering cmp.

    definition classes: TraversableOnce
  121. def min : A

    [use case] Finds the smallest element.

    [use case]

    Finds the smallest element.

    returns

    the smallest element of this growable collection

    attributes: abstract
    definition classes: TraversableOnce
  122. 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 growable collection with respect to the ordering cmp.

    definition classes: TraversableOnce
  123. def mkString : String

    Displays all elements of this growable collection in a string.

    Displays all elements of this growable collection in a string.

    returns

    a string representation of this growable collection. In the resulting string the string representations (w.r.t. the method toString) of all elements of this growable collection follow each other without any separator string.

    definition classes: TraversableOnce
  124. def mkString (sep: String) : String

    Displays all elements of this growable collection in a string using a separator string.

    Displays all elements of this growable collection in a string using a separator string.

    sep

    the separator string.

    returns

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

    definition classes: TraversableOnce
  125. def mkString (start: String, sep: String, end: String) : String

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

    Displays all elements of this growable collection 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 growable collection. 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 growable collection are separated by the string sep.

    definition classes: TraversableOnce
  126. 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
  127. def newBuilder : MutableList[A]

    The builder that builds instances of type Growable[A]

    The builder that builds instances of type Growable[A]

    attributes: protected[this]
  128. def nonEmpty : Boolean

    Tests whether the growable collection is not empty.

    Tests whether the growable collection is not empty.

    returns

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

    definition classes: TraversableOnce
  129. 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
  130. 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
  131. 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
  132. def padTo (len: Int, elem: A) : Growable[A]

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

    [use case]

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

    len

    the target length

    elem

    the padding value

    returns

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

    attributes: abstract
    definition classes: SeqLike
  133. def padTo [B >: A, That] (len: Int, elem: B)(implicit bf: CanBuildFrom[MutableList[A], B, That]) : That

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

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

    B

    the element type of the returned growable collection.

    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 B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.

    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 growable collection followed by the minimal number of occurrences of elem so that the resulting collection has a length of at least len.

    definition classes: SeqLike
  134. def partition (p: (A) ⇒ Boolean) : (MutableList[A], MutableList[A])

    Partitions this growable collection in two growable collections according to a predicate.

    Partitions this growable collection in two growable collections according to a predicate.

    p

    the predicate on which to partition.

    returns

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

    definition classes: TraversableLike
  135. def patch (from: Int, that: Seq[A], replaced: Int) : Growable[A]

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

    [use case]

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

    from

    the index of the first replaced element

    replaced

    the number of elements to drop in the original growable collection

    returns

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

    attributes: abstract
    definition classes: SeqLike
  136. def patch [B >: A, That] (from: Int, patch: Seq[B], replaced: Int)(implicit bf: CanBuildFrom[MutableList[A], B, That]) : That

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

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

    B

    the element type of the returned growable collection.

    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 B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.

    from

    the index of the first replaced element

    patch

    the replacement sequence

    replaced

    the number of elements to drop in the original growable collection

    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 growable collection consisting of all elements of this growable collection except that replaced elements starting from from are replaced by patch.

    definition classes: SeqLike
  137. 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.

    Note: may not terminate for infinite-sized collections.

    p

    the predicate used to test elements.

    returns

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

    definition classes: SeqLike
  138. def prependElem (elem: A) : Unit

    attributes: protected
  139. def product : A

    [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 growable collection 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 growable collection and as result type of product. Examples of such types are: Long, Float, Double, BigInt.

    attributes: abstract
    definition classes: TraversableOnce
  140. 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 growable collection with respect to the * operator in num.

    definition classes: TraversableOnce
  141. def projection : SeqView[A, MutableList[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

  142. def reduceLeft [B >: A] (f: (B, A) ⇒ B) : B

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

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

    Note: will not terminate for infinite-sized collections.

    B

    the result type of the binary operator.

    returns

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

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

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

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

    Note: will not terminate for infinite-sized collections.

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

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

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

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

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

    Note: will not terminate for infinite-sized collections.

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

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

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

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

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

    Note: will not terminate for infinite-sized collections.

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

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

    definition classes: TraversableOnce
  146. def repr : MutableList[A]

    The collection of type growable collection underlying this TraversableLike object.

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

    definition classes: TraversableLike
  147. def reset () : Unit

      deprecated:
    1. use clear instead

  148. def result () : MutableList[A]

    Produces a collection from the added elements.

    Produces a collection from the added elements. The builder's contents are undefined after this operation.

    returns

    a collection containing the elements added to this builder.

    definition classes: MutableListBuilder
  149. def reverse : MutableList[A]

    Returns new growable collection wih elements in reversed order.

    Returns new growable collection wih elements in reversed order.

    Note: will not terminate for infinite-sized collections.

    returns

    A new growable collection with all elements of this growable collection in reversed order.

    definition classes: SeqLike
  150. def reverseIterator : Iterator[A]

    An iterator yielding elements in reversed order.

    An iterator yielding elements in reversed order.

    Note: will not terminate for infinite-sized collections.

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

    returns

    an iterator yielding the elements of this growable collection in reversed order

    definition classes: SeqLike
  151. def reverseMap [B] (f: (A) ⇒ B) : Growable[B]

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

    [use case]

    Builds a new collection by applying a function to all elements of this growable collection 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 growable collection resulting from applying the given function f to each element of this growable collection and collecting the results in reversed order.

    attributes: abstract
    definition classes: SeqLike
  152. def reverseMap [B, That] (f: (A) ⇒ B)(implicit bf: CanBuildFrom[MutableList[A], B, That]) : That

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

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

    Note: will not terminate for infinite-sized collections.

    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. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.

    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 growable collection and collecting the results in reversed order.

    definition classes: SeqLike
  153. def reversed : List[A]

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

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

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

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

    [use case]

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

    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
  156. def sameElements [B >: A] (that: Iterable[B]) : Boolean

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

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

    Note: will not terminate for infinite-sized collections.

    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
  157. def scanLeft [B, That] (z: B)(op: (B, A) ⇒ B)(implicit bf: CanBuildFrom[MutableList[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.

    Note: will not terminate for infinite-sized collections.

    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
  158. def scanRight [B, That] (z: B)(op: (A, B) ⇒ B)(implicit bf: CanBuildFrom[MutableList[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.

    Note: will not terminate for infinite-sized collections.

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

    Note: may not terminate for infinite-sized collections.

    p

    the predicate used to test elements.

    from

    the index where the search starts.

    returns

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

    definition classes: LinearSeqOptimizedSeqLike
  160. def size : Int

    The size of this growable collection, equivalent to length.

    The size of this growable collection, equivalent to length.

    Note: will not terminate for infinite-sized [email protected] the number of elements in this growable collection.

    definition classes: SeqLikeTraversableOnce
  161. def sizeHint (coll: scala.collection.TraversableLike[_, _], delta: Int =0) : Unit

    Gives a hint that one expects the result of this builder to have the same size as the given collection, plus some delta.

    Gives a hint that one expects the result of this builder to have the same size as the given collection, plus some delta. This will provide a hint only if the collection is known to have a cheap size method. Currently this is assumed ot be the case if and only if the collection is of type IndexedSeqLike. Some builder classes will optimize their representation based on the hint. However, builder implementations are still required to work correctly even if the hint is wrong, i.e. a different number of elements is added.

    coll

    the collection which serves as a hint for the result's size.

    delta

    a correction to add to the coll.size to produce the size hint.

    definition classes: Builder
  162. def sizeHint (size: Int) : Unit

    Gives a hint how many elements are expected to be added when the next result is called.

    Gives a hint how many elements are expected to be added when the next result is called. Some builder classes will optimize their representation based on the hint. However, builder implementations are still required to work correctly even if the hint is wrong, i.e. a different number of elements is added.

    size

    the hint how many elements will be added.

    definition classes: Builder
  163. def sizeHintBounded (size: Int, boundingColl: scala.collection.TraversableLike[_, _]) : Unit

    Gives a hint how many elements are expected to be added when the next result is called, together with an upper bound given by the size of some other collection.

    Gives a hint how many elements are expected to be added when the next result is called, together with an upper bound given by the size of some other collection. Some builder classes will optimize their representation based on the hint. However, builder implementations are still required to work correctly even if the hint is wrong, i.e. a different number of elements is added.

    size

    the hint how many elements will be added.

    boundingColl

    the bounding collection. If it is an IndexedSeqLike, then sizes larger than collection's size are reduced.

    definition classes: Builder
  164. def slice (from: Int, until: Int) : MutableList[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)

    from

    the index of the first returned element in this growable collection.

    until

    the index one past the last returned element in this growable collection.

    returns

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

    definition classes: LinearSeqOptimizedIterableLikeTraversableLike
  165. def sliding [B >: A] (size: Int, step: Int) : Iterator[MutableList[A]]

    definition classes: IterableLike
  166. def sliding [B >: A] (size: Int) : Iterator[MutableList[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 growable collections of size size, except the last and the only element will be truncated if there are fewer elements than size.

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

  167. def sortBy [B] (f: (A) ⇒ B)(implicit ord: Ordering[B]) : MutableList[A]

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

    Sorts this Growable 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 growable collection consisting of the elements of this growable collection sorted according to the ordering where x < y if ord.lt(f(x), f(y)).

    definition classes: SeqLike
      see also:
    1. scala.math.Ordering

      Note: will not terminate for infinite-sized collections.

  168. def sortWith (lt: (A, A) ⇒ Boolean) : MutableList[A]

    Sorts this growable collection according to a comparison function.

    Sorts this growable collection according to a comparison function.

    Note: will not terminate for infinite-sized collections.

    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 growable collection consisting of the elements of this growable collection sorted according to the comparison function lt.

    definition classes: SeqLike
  169. def sorted [B >: A] (implicit ord: Ordering[B]) : MutableList[A]

    Sorts this growable collection according to an Ordering.

    Sorts this growable collection 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 growable collection consisting of the elements of this growable collection sorted according to the ordering ord.

    definition classes: SeqLike
      see also:
    1. scala.math.Ordering

  170. def span (p: (A) ⇒ Boolean) : (MutableList[A], MutableList[A])

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

    Splits this growable collection 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 growable collection whose elements all satisfy p, and the rest of this growable collection.

    definition classes: LinearSeqOptimizedTraversableLike
  171. def splitAt (n: Int) : (MutableList[A], MutableList[A])

    Splits this growable collection into two at a given position.

    Splits this growable collection 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 growable collections consisting of the first n elements of this growable collection, and the other elements.

    definition classes: TraversableLike
  172. def startsWith [B] (that: Seq[B]) : Boolean

    Tests whether this growable collection starts with the given sequence.

    Tests whether this growable collection 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
  173. def startsWith [B] (that: Seq[B], offset: Int) : Boolean

    Tests whether this growable collection contains the given sequence at a given index.

    Tests whether this growable collection 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 growable collection at index offset, otherwise false.

    definition classes: SeqLike
  174. 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 growable collection. By default the string prefix is the simple name of the collection class growable collection.

    definition classes: TraversableLike
  175. def sum : A

    [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 growable collection 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 growable collection and as result type of sum. Examples of such types are: Long, Float, Double, BigInt.

    attributes: abstract
    definition classes: TraversableOnce
  176. 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 growable collection with respect to the + operator in num.

    definition classes: TraversableOnce
  177. def synchronized [T0] (arg0: T0) : T0

    attributes: final
    definition classes: AnyRef
  178. def tail : MutableList[A]

    Returns the rest of this [email protected] a growable collection consisting of all elements of this growable collection except the first one.

    Returns the rest of this [email protected] a growable collection consisting of all elements of this growable collection except the first one.

    definition classes: MutableListLinearSeqOptimizedTraversableLike
  179. def take (n: Int) : MutableList[A]

    Selects first n elements.

    Selects first n elements.

    n

    Tt number of elements to take from this growable collection.

    returns

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

    definition classes: LinearSeqOptimizedIterableLikeTraversableLike
  180. def takeRight (n: Int) : MutableList[A]

    Selects last n elements.

    Selects last n elements.

    n

    the number of elements to take

    returns

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

    definition classes: IterableLike
  181. def takeWhile (p: (A) ⇒ Boolean) : MutableList[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 growable collection whose elements all satisfy the predicate p.

    definition classes: LinearSeqOptimizedIterableLikeTraversableLike
  182. def thisCollection : LinearSeq[A]

    The underlying collection seen as an instance of Growable.

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

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

    [use case] Converts this growable collection to an array.

    [use case]

    Converts this growable collection to an array.

    Note: will not terminate for infinite-sized collections.

    returns

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

    attributes: abstract
    definition classes: TraversableOnce
  184. def toArray [B >: A] (implicit arg0: ClassManifest[B]) : Array[B]

    Converts this growable collection to an array.

    Converts this growable collection to an array.

    Note: will not terminate for infinite-sized collections.

    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 growable collection.

    definition classes: TraversableOnce
  185. def toBuffer [B >: A] : Buffer[B]

    Converts this growable collection to a mutable buffer.

    Converts this growable collection to a mutable buffer.

    Note: will not terminate for infinite-sized collections.

    returns

    a buffer containing all elements of this growable collection.

    definition classes: TraversableOnce
  186. def toCollection (repr: MutableList[A]) : LinearSeq[A]

    A conversion from collections of type Repr to Growable objects.

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

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

    Converts this growable collection to an indexed sequence.

    Converts this growable collection to an indexed sequence.

    Note: will not terminate for infinite-sized collections.

    returns

    an indexed sequence containing all elements of this growable collection.

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

    Converts this growable collection to an iterable collection.

    Converts this growable collection 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).

    Note: will not terminate for infinite-sized collections.

    returns

    an Iterable containing all elements of this growable collection.

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

    Returns an Iterator over the elements in this growable collection.

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

    Note: will not terminate for infinite-sized collections.

    returns

    an Iterator containing all elements of this growable collection.

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

    Returns an instance of scala.List containing the same sequence of elements.

    Returns an instance of scala.List containing the same sequence of [email protected] a list containing all elements of this growable collection.

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

    Converts this growable collection to a map.

    Converts this growable collection 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.

    Note: will not terminate for infinite-sized collections.

    returns

    a map containing all elements of this growable collection.

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

    Converts this growable collection to a sequence.

    Converts this growable collection to a sequence.

    Note: will not terminate for infinite-sized collections.

    Overridden for [email protected] a sequence containing all the elements of this growable collection.

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

    Converts this growable collection to a set.

    Converts this growable collection to a set.

    Note: will not terminate for infinite-sized collections.

    returns

    a set containing all elements of this growable collection.

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

    Converts this growable collection to a stream.

    Converts this growable collection to a stream.

    Note: will not terminate for infinite-sized collections.

    returns

    a stream containing all elements of this growable collection.

    definition classes: IterableLikeTraversableLikeTraversableOnce
  195. def toString () : String

    Converts this growable collection to a string.

    Converts this growable collection to a string.

    returns

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

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

    Converts this growable collection to an unspecified Traversable.

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

    Note: will not terminate for infinite-sized collections.

    returns

    a Traversable containing all elements of this growable collection.

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

    Transposes this growable collection of traversable collections into a growable collection of growable collections.

    Transposes this growable collection of traversable collections into a growable collection of growable collections.

    B

    the type of the elements of each traversable collection.

    asTraversable

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

    returns

    a two-dimensional growable collection of growable collections which has as nth row the nth column of this growable collection.

    definition classes: GenericTraversableTemplate
  198. def union (that: Seq[A]) : Growable[A]

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

    [use case]

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

    Note: will not terminate for infinite-sized collections.

    that

    the sequence to add.

    returns

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

    attributes: abstract
    definition classes: SeqLike
  199. def union [B >: A, That] (that: Seq[B])(implicit bf: CanBuildFrom[MutableList[A], B, That]) : That

    Produces a new sequence which contains all elements of this growable collection and also all elements of a given sequence.

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

    Note: will not terminate for infinite-sized collections.

    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.

    Note: will not terminate for infinite-sized collections.

    B

    the element type of the returned growable collection.

    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 B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.

    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 growable collection followed by all elements of that.

    definition classes: SeqLike
  200. def unzip [A1, A2] (implicit asPair: (A) ⇒ (A1, A2)) : (LinearSeq[A1], LinearSeq[A2])

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

    Converts this growable collection 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 growable collection is a pair.

    returns

    a pair growable collections, containing the first, respectively second half of each element pair of this growable collection.

    definition classes: GenericTraversableTemplate
  201. def update (n: Int, x: A) : Unit

    Updates the nth element of this list to a new value.

    Updates the nth element of this list to a new value.

    definition classes: MutableListSeq
  202. def updated (index: Int, elem: A) : Growable[A]

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

    [use case]

    A copy of this growable collection with one single replaced element.

    index

    the position of the replacement

    elem

    the replacing element

    returns

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

    attributes: abstract
    definition classes: SeqLike
  203. def updated [B >: A, That] (index: Int, elem: B)(implicit bf: CanBuildFrom[MutableList[A], B, That]) : That

    A copy of this growable collection with one single replaced element.

    A copy of this growable collection with one single replaced element.

    B

    the element type of the returned growable collection.

    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 B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.

    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 growable collection which is a copy of this growable collection with the element at position index replaced by elem.

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

    Creates a non-strict view of a slice of this growable collection.

    Creates a non-strict view of a slice of this growable collection.

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

    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 growable collection, starting at index from and extending up to (but not including) index until.

    definition classes: SeqLikeIterableLikeTraversableLike
  205. def view : SeqView[A, MutableList[A]]

    Creates a non-strict view of this growable collection.

    Creates a non-strict view of this growable collection.

    returns

    a non-strict view of this growable collection.

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

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

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

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

    Creates a non-strict filter of this growable collection.

    Creates a non-strict filter of this growable collection.

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

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

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

    [use case]

    Returns a growable collection formed from this growable collection 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 growable collection containing pairs consisting of corresponding elements of this growable collection and that. The length of the returned collection is the minimum of the lengths of this growable collection and that.

    attributes: abstract
    definition classes: IterableLike
  211. def zip [A1 >: A, B, That] (that: Iterable[B])(implicit bf: CanBuildFrom[MutableList[A], (A1, B), That]) : That

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

    Returns a growable collection formed from this growable collection 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 growable collection and that. The length of the returned collection is the minimum of the lengths of this growable collection and that.

    definition classes: IterableLike
  212. def zipAll [B] (that: Iterable[B], thisElem: A, thatElem: B) : Growable[(A, B)]

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

    [use case]

    Returns a growable collection formed from this growable collection 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 growable collection is shorter than that.

    thatElem

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

    returns

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

    attributes: abstract
    definition classes: IterableLike
  213. def zipAll [B, A1 >: A, That] (that: Iterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[MutableList[A], (A1, B), That]) : That

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

    Returns a growable collection formed from this growable collection 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 growable collection is shorter than that.

    thatElem

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

    returns

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

    definition classes: IterableLike
  214. def zipWithIndex : Growable[(A, Int)]

    [use case] Zips this growable collection with its indices.

    [use case]

    Zips this growable collection with its indices.

    returns

    A new growable collection containing pairs consisting of all elements of this growable collection 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
  215. def zipWithIndex [A1 >: A, That] (implicit bf: CanBuildFrom[MutableList[A], (A1, Int), That]) : That

    Zips this growable collection with its indices.

    Zips this growable collection 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 growable collection paired with their index. Indices start at 0.

    definition classes: IterableLike

Inherited from Builder[A, MutableList[A]]

Inherited from Growable[A]

Inherited from LinearSeqOptimized[A, MutableList[A]]

Inherited from LinearSeq[A]

Inherited from LinearSeq[A]

Inherited from LinearSeqLike[A, MutableList[A]]

Inherited from Seq[A]

Inherited from Seq[A]

Inherited from SeqLike[A, MutableList[A]]

Inherited from PartialFunction[Int, A]

Inherited from (Int) ⇒ A

Inherited from Iterable[A]

Inherited from Iterable[A]

Inherited from IterableLike[A, MutableList[A]]

Inherited from Equals

Inherited from Traversable[A]

Inherited from Mutable

Inherited from Traversable[A]

Inherited from GenericTraversableTemplate[A, LinearSeq]

Inherited from TraversableLike[A, MutableList[A]]

Inherited from TraversableOnce[A]

Inherited from FilterMonadic[A, MutableList[A]]

Inherited from HasNewBuilder[A, MutableList[A]]

Inherited from AnyRef

Inherited from Any