scala.collection.mutable

# ListBuffer

#### final class ListBuffer[A] extends AbstractBuffer[A] with Buffer[A] with GenericTraversableTemplate[A, ListBuffer] with BufferLike[A, ListBuffer[A]] with Builder[A, List[A]] with SeqForwarder[A] with Serializable

A `Buffer` implementation back up by a list. It provides constant time prepend and append. Most other operations are linear.

A

  the type of this list buffer's elements.

Annotations
  @SerialVersionUID( uid = 3419063961353022662L )
Source
  ListBuffer.scala
Version

  2.8

Since

  1

See also

  "Scala's Collection Library overview" section on `List Buffers` for more information.

Linear Supertypes
Serializable, SeqForwarder[A], IterableForwarder[A], TraversableForwarder[A], Builder[A, List[A]], AbstractBuffer[A], Buffer[A], BufferLike[A, ListBuffer[A]], Subtractable[A, ListBuffer[A]], Scriptable[A], Shrinkable[A], Growable[A], AbstractSeq[A], Seq[A], SeqLike[A, ListBuffer[A]], Cloneable[ListBuffer[A]], Iterable[A], Traversable[A], Mutable, AbstractSeq[A], Seq[A], SeqLike[A, ListBuffer[A]], GenSeq[A], GenSeqLike[A, ListBuffer[A]], PartialFunction[Int, A], (Int) ⇒ A, AbstractIterable[A], Iterable[A], IterableLike[A, ListBuffer[A]], Equals, GenIterable[A], GenIterableLike[A, ListBuffer[A]], AbstractTraversable[A], Traversable[A], GenTraversable[A], GenericTraversableTemplate[A, ListBuffer], TraversableLike[A, ListBuffer[A]], GenTraversableLike[A, ListBuffer[A]], Parallelizable[A, ParSeq[A]], TraversableOnce[A], GenTraversableOnce[A], FilterMonadic[A, ListBuffer[A]], HasNewBuilder[A, ListBuffer[A]], AnyRef, Any
Ordering

1. Alphabetic
2. By inheritance

Inherited

1. Hide All
2. Show all

1. ListBuffer
2. Serializable
3. SeqForwarder
4. IterableForwarder
5. TraversableForwarder
6. Builder
7. AbstractBuffer
8. Buffer
9. BufferLike
10. Subtractable
11. Scriptable
12. Shrinkable
13. Growable
14. AbstractSeq
15. Seq
16. SeqLike
17. Cloneable
18. Iterable
19. Traversable
20. Mutable
21. AbstractSeq
22. Seq
23. SeqLike
24. GenSeq
25. GenSeqLike
26. PartialFunction
27. Function1
28. AbstractIterable
29. Iterable
30. IterableLike
31. Equals
32. GenIterable
33. GenIterableLike
34. AbstractTraversable
35. Traversable
36. GenTraversable
37. GenericTraversableTemplate
38. TraversableLike
39. GenTraversableLike
40. Parallelizable
41. TraversableOnce
42. GenTraversableOnce
43. FilterMonadic
44. HasNewBuilder
45. AnyRef
46. Any

Visibility

1. Public
2. All

### Instance Constructors

1. #### new ListBuffer()

### Type Members

1. #### type Self = ListBuffer[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. #### final def !=(arg0: AnyRef): Boolean

   Definition Classes
     AnyRef

2. #### final def !=(arg0: Any): Boolean

   Test two objects for inequality.

   Test two objects for inequality.

   returns

     `true` if !(this == that), false otherwise.

   Definition Classes
     Any

3. #### final def ##(): Int

   Equivalent to `x.hashCode` except for boxed numeric types and `null`.

   Equivalent to `x.hashCode` except for boxed numeric types and `null`. For numerics, it returns a hash value which is consistent with value equality: if two value type instances compare as true, then ## will produce the same hash value for each of them. For `null` returns a hashcode where `null.hashCode` throws a `NullPointerException`.

   returns

     a hash value consistent with ==

   Definition Classes
     AnyRef → Any

4. #### def ++(xs: GenTraversableOnce[A]): ListBuffer[A]

   Creates a new collection containing both the elements of this collection and the provided traversable object.

   Creates a new collection containing both the elements of this collection and the provided traversable object.

   xs

     the traversable object.

   returns

     a new collection consisting of all the elements of this collection and `xs`.

   Definition Classes
     BufferLike
   Annotations
     @migration
   Migration

     (Changed in version 2.8.0) `++` creates a new buffer. Use `++=` to add an element from this buffer and return that buffer itself.

5. #### def ++[B](that: GenTraversableOnce[B]): ListBuffer[B]

   [use case]

   [use case]
   B

     the element type of the returned collection.

   that

     the traversable to append.

   returns

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

   Definition Classes
     TraversableLike → GenTraversableLike

6. #### def ++:[B >: A, That](that: Traversable[B])(implicit bf: CanBuildFrom[ListBuffer[A], B, That]): That

   As with `++`, returns a new collection containing the elements from the left operand followed by the elements from the right operand.

   As with `++`, returns a new collection containing the elements from the left operand followed by the elements from the right operand.

   It differs from `++` in that the right operand determines the type of the resulting collection rather than the left one. Mnemonic: the COLon is on the side of the new COLlection type.

   Example:

           scala> val x = List(1)
           x: List[Int] = List(1)

           scala> val y = LinkedList(2)
           y: scala.collection.mutable.LinkedList[Int] = LinkedList(2)

           scala> val z = x ++: y
           z: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2)

   This overload exists because: for the implementation of `++:` we should reuse that of `++` because many collections override it with more efficient versions.

   Since `TraversableOnce` has no `++` method, we have to implement that directly, but `Traversable` and down can use the overload.

   B

     the element type of the returned collection.

   That

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

   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`. This is usually the `canBuildFrom` value defined in object `ListBuffer`.

   returns

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

   Definition Classes
     TraversableLike

7. #### def ++:[B](that: TraversableOnce[B]): ListBuffer[B]

   [use case]

   [use case]
   B

     the element type of the returned collection.

   that

     the traversable to append.

   returns

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

   Definition Classes
     TraversableLike

8. #### def ++=(xs: TraversableOnce[A]): ListBuffer.this.type

   Appends all elements produced by a TraversableOnce to this list buffer.

   Appends all elements produced by a TraversableOnce to this list buffer.

   returns

     the list buffer itself.

   Definition Classes
     ListBuffer → Growable

9. #### def ++=:(xs: TraversableOnce[A]): ListBuffer.this.type

   Prepends elements to this buffer.

   Prepends elements to this buffer.

   xs

     the TraversableOnce containing the elements to prepend.

   returns

     the buffer itself.

   Definition Classes
     ListBuffer → BufferLike

10. #### def +:(elem: A): ListBuffer[A]

    [use case]

    [use case]
    elem

      the prepended element

    returns

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

    Definition Classes
      SeqLike → GenSeqLike

11. #### def +=(x: A): ListBuffer.this.type

    Appends a single element to this buffer.

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

    x

      the element to append.

    returns

      this list buffer.

    Definition Classes
      ListBuffer → Builder → BufferLike → Growable

12. #### def +=(elem1: A, elem2: A, elems: A*): ListBuffer.this.type

    Appends two or more elements to this list buffer.

    Appends two or more elements to this list buffer.

    elem1

      the first element to append.

    elem2

      the second element to append.

    elems

      the remaining elements to append.

    returns

      the list buffer itself

    Definition Classes
      Growable

13. #### def +=:(x: A): ListBuffer.this.type

    Prepends a single element to this buffer.

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

    x

      the element to prepend.

    returns

      this list buffer.

    Definition Classes
      ListBuffer → BufferLike

14. #### def -(elem1: A, elem2: A, elems: A*): ListBuffer[A]

    Creates a new collection with all the elements of this collection except the two or more specified elements.

    Creates a new collection with all the elements of this collection except the two or more specified elements.

    elem1

      the first element to remove.

    elem2

      the second element to remove.

    elems

      the remaining elements to remove.

    returns

      a new collection consisting of all the elements of this collection except `elem1`, `elem2` and those in `elems`.

    Definition Classes
      BufferLike → Subtractable
    Annotations
      @migration
    Migration

      (Changed in version 2.8.0) `-` creates a new buffer. Use `-=` to remove an element from this buffer and return that buffer itself.

15. #### def -(elem: A): ListBuffer[A]

    Creates a new collection with all the elements of this collection except `elem`.

    Creates a new collection with all the elements of this collection except `elem`.

    elem

      the element to remove.

    returns

      a new collection consisting of all the elements of this collection except `elem`.

    Definition Classes
      BufferLike → Subtractable
    Annotations
      @migration
    Migration

      (Changed in version 2.8.0) `-` creates a new buffer. Use `-=` to remove an element from this buffer and return that buffer itself.

16. #### def --(xs: GenTraversableOnce[A]): ListBuffer[A]

    Creates a new collection with all the elements of this collection except those provided by the specified traversable object.

    Creates a new collection with all the elements of this collection except those provided by the specified traversable object.

    xs

      the traversable object.

    returns

      a new collection with all the elements of this collection except those in `xs`

    Definition Classes
      BufferLike → Subtractable
    Annotations
      @migration
    Migration

      (Changed in version 2.8.0) `--` creates a new buffer. Use `--=` to remove an element from this buffer and return that buffer itself.

17. #### def --=(xs: TraversableOnce[A]): ListBuffer.this.type

    Removes all elements produced by an iterator from this list buffer.

    Removes all elements produced by an iterator from this list buffer.

    returns

      the list buffer itself

    Definition Classes
      Shrinkable

18. #### def -=(elem: A): ListBuffer.this.type

    Remove a single element from this buffer.

    Remove a single element from this buffer. May take time linear in the buffer size.

    returns

      this list buffer.

    Definition Classes
      ListBuffer → BufferLike → Shrinkable

19. #### def -=(elem1: A, elem2: A, elems: A*): ListBuffer.this.type

    Removes two or more elements from this list buffer.

    Removes two or more elements from this list buffer.

    elem1

      the first element to remove.

    elem2

      the second element to remove.

    elems

      the remaining elements to remove.

    returns

      the list buffer itself

    Definition Classes
      Shrinkable

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

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

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

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

    Examples:

    Note that the folding function used to compute b is equivalent to that used to compute c.

             scala> val a = LinkedList(1,2,3,4)
             a: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2, 3, 4)

             scala> val b = (5 /: a)(_+_)
             b: Int = 15

             scala> val c = (5 /: a)((x,y) => x + y)
             c: Int = 15

    B

      the result type of the binary operator.

    z

      the start value.

    op

      the binary operator.

    returns

      the result of inserting `op` between consecutive elements of this list buffer, going left to right with the start value `z` on the left:

                      op(...op(op(z, x1), x2), ..., xn)

      where `x1, ..., xn` are the elements of this list buffer.

    Definition Classes
      TraversableForwarder → TraversableOnce → GenTraversableOnce

21. #### def /:\[A1 >: A](z: A1)(op: (A1, A1) ⇒ A1): A1

    A syntactic sugar for out of order folding.

    A syntactic sugar for out of order folding. See `fold`.

    Example:

             scala> val a = LinkedList(1,2,3,4)
             a: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2, 3, 4)

             scala> val b = (a /:\ 5)(_+_)
             b: Int = 15

    Definition Classes
      GenTraversableOnce

22. #### def :+(elem: A): ListBuffer[A]

    [use case]

    [use case]
    elem

      the appended element

    returns

      a new list buffer consisting of all elements of this list buffer followed by `elem`. @example

                scala> import scala.collection.mutable.LinkedList
                import scala.collection.mutable.LinkedList

                scala> val a = LinkedList(1)
                a: scala.collection.mutable.LinkedList[Int] = LinkedList(1)

                scala> val b = a :+ 2
                b: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2)

                scala> println(a)
                LinkedList(1)

    Definition Classes
      SeqLike → GenSeqLike

23. #### def :\[B](z: B)(op: (A, B) ⇒ B): B

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

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

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

    Examples:

    Note that the folding function used to compute b is equivalent to that used to compute c.

             scala> val a = LinkedList(1,2,3,4)
             a: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2, 3, 4)

             scala> val b = (a :\ 5)(_+_)
             b: Int = 15

             scala> val c = (a :\ 5)((x,y) => x + y)
             c: Int = 15

    B

      the result type of the binary operator.

    z

      the start value

    op

      the binary operator

    returns

      the result of inserting `op` between consecutive elements of this list buffer, going right to left with the start value `z` on the right:

                      op(x1, op(x2, ... op(xn, z)...))

      where `x1, ..., xn` are the elements of this list buffer.

    Definition Classes
      TraversableForwarder → TraversableOnce → GenTraversableOnce

24. #### def <<(cmd: Message[A]): Unit

    Send a message to this scriptable object.

    Send a message to this scriptable object.

    cmd

      the message to send.

    Definition Classes
      BufferLike → Scriptable

25. #### final def ==(arg0: AnyRef): Boolean

    Definition Classes
      AnyRef

26. #### final def ==(arg0: Any): Boolean

    Test two objects for equality.

    Test two objects for equality. The expression `x == that` is equivalent to `if (x eq null) that eq null else x.equals(that)`.

    returns

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

    Definition Classes
      Any

27. #### def addString(b: StringBuilder): StringBuilder

    Appends all elements of this list buffer to a string builder.

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

    Example:

             scala> val a = LinkedList(1,2,3,4)
             a: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2, 3, 4)

             scala> val b = new StringBuilder()
             b: StringBuilder =

             scala> val h = a.addString(b)
             b: StringBuilder = 1234

    b

      the string builder to which elements are appended.

    returns

      the string builder `b` to which elements were appended.

    Definition Classes
      TraversableForwarder → TraversableOnce

28. #### def addString(b: StringBuilder, sep: String): StringBuilder

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

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

    Example:

             scala> val a = LinkedList(1,2,3,4)
             a: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2, 3, 4)

             scala> val b = new StringBuilder()
             b: StringBuilder =

             scala> a.addString(b, ", ")
             res0: StringBuilder = 1, 2, 3, 4

    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
      TraversableForwarder → TraversableOnce

29. #### def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

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

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

    Example:

             scala> val a = LinkedList(1,2,3,4)
             a: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2, 3, 4)

             scala> val b = new StringBuilder()
             b: StringBuilder =

             scala> a.addString(b, "LinkedList(", ", ", ")")
             res1: StringBuilder = LinkedList(1, 2, 3, 4)

    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
      TraversableForwarder → TraversableOnce

30. #### def aggregate[B](z: B)(seqop: (B, A) ⇒ B, combop: (B, B) ⇒ B): B

    Aggregates the results of applying an operator to subsequent elements.

    Aggregates the results of applying an operator to subsequent elements.

    This is a more general form of `fold` and `reduce`. It has similar semantics, but does not require the result to be a supertype of the element type. It traverses the elements in different partitions sequentially, using `seqop` to update the result, and then applies `combop` to results from different partitions. The implementation of this operation may operate on an arbitrary number of collection partitions, so `combop` may be invoked an arbitrary number of times.

    For example, one might want to process some elements and then produce a `Set`. In this case, `seqop` would process an element and append it to the list, while `combop` would concatenate two lists from different partitions together. The initial value `z` would be an empty set.

           pc.aggregate(Set[Int]())(_ += process(_), _ ++ _)

    Another example is calculating geometric mean from a collection of doubles (one would typically require big doubles for this).

    B

      the type of accumulated results

    z

      the initial value for the accumulated result of the partition - this will typically be the neutral element for the `seqop` operator (e.g. `Nil` for list concatenation or `0` for summation)

    seqop

      an operator used to accumulate results within a partition

    combop

      an associative operator used to combine results from different partitions

    Definition Classes
      TraversableOnce → GenTraversableOnce

31. #### 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
      PartialFunction → Function1

32. #### def append(elems: A*): Unit

    Appends the given elements to this buffer.

    Appends the given elements to this buffer.

    elems

      the elements to append.

    Definition Classes
      BufferLike

33. #### def appendAll(xs: TraversableOnce[A]): Unit

    Appends the elements contained in a traversable object to this buffer.

    Appends the elements contained in a traversable object to this buffer.

    xs

      the traversable object containing the elements to append.

    Definition Classes
      BufferLike

34. #### def apply(n: Int): A

    Selects an element by its index in the list buffer.

    Selects an element by its index in the list buffer.

    Example:

           scala> val x = LinkedList(1, 2, 3, 4, 5)
           x: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2, 3, 4, 5)

           scala> x(3)
           res1: Int = 4

    returns

      the element of this list buffer at index `idx`, where `0` indicates the first element.

    Definition Classes
      ListBuffer → SeqForwarder → BufferLike → SeqLike → GenSeqLike → Function1
    Exceptions thrown
      `IndexOutOfBoundsException`

      if `idx` does not satisfy `0 <= idx < length`.

35. #### final def asInstanceOf[T0]: T0

    Cast the receiver object to be of type `T0`.

    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 expression `1.asInstanceOf[String]` will throw a `ClassCastException` at runtime, while the expression `List(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 type.

    returns

      the receiver object.

    Definition Classes
      Any
    Exceptions thrown
      ClassCastException

      if the receiver object is not an instance of the erasure of type `T0`.

36. #### def canEqual(that: Any): Boolean

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

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

    that

      The object with which this list buffer should be compared

    returns

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

    Definition Classes
      IterableLike → Equals

37. #### def clear(): Unit

    Clears the buffer contents.

    Clears the buffer contents.

    Definition Classes
      ListBuffer → Builder → BufferLike → Growable

38. #### def clone(): ListBuffer[A]

    Returns a clone of this buffer.

    Returns a clone of this buffer.

    returns

      a `ListBuffer` with the same elements.

    Definition Classes
      ListBuffer → Cloneable → AnyRef

39. #### def collect[B](pf: PartialFunction[A, B]): ListBuffer[B]

    [use case]

    [use case]
    B

      the element type of the returned collection.

    pf

      the partial function which filters and maps the list buffer.

    returns

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

    Definition Classes
      TraversableLike → GenTraversableLike

40. #### def collectFirst[B](pf: PartialFunction[A, B]): Option[B]

    Finds the first element of the list buffer for which the given partial function is defined, and applies the partial function to it.

    Finds the first element of the list buffer for which the given partial function is defined, and applies the partial function to it.

    pf

      the partial function

    returns

      an option value containing pf applied to the first value for which it is defined, or `None` if none exists.

    Definition Classes
      TraversableOnce
    Example:

    1. `Seq("a", 1, 5L).collectFirst({ case x: Int => x*10 }) = Some(10)`

41. #### def combinations(n: Int): Iterator[ListBuffer[A]]

    Iterates over combinations.

    Iterates over combinations.

    returns

      An Iterator which traverses the possible n-element combinations of this list buffer.

    Definition Classes
      SeqLike
    Example:

    1. `"abbbc".combinations(2) = Iterator(ab, ac, bb, bc)`

42. #### def companion: GenericCompanion[ListBuffer]

    The factory companion object that builds instances of class ListBuffer.

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

    Definition Classes
      ListBuffer → Buffer → Seq → Iterable → Traversable → Seq → GenSeq → Iterable → GenIterable → Traversable → GenTraversable → GenericTraversableTemplate

43. #### def compose[A](g: (A) ⇒ Int): (A) ⇒ A

    Composes two instances of Function1 in a new Function1, with this function applied last.

    Composes two instances of Function1 in a new Function1, with this function applied last.

    A

      the type to which function `g` can be applied

    g

      a function A => T1

    returns

      a new function `f` such that `f(x) == apply(g(x))`

    Definition Classes
      Function1

44. #### def contains(elem: Any): Boolean

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

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

    elem

      the element to test.

    returns

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

    Definition Classes
      SeqForwarder → SeqLike

45. #### def containsSlice[B](that: GenSeq[B]): Boolean

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

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

    that

      the sequence to test

    returns

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

    Definition Classes
      SeqForwarder → SeqLike

46. #### def copyToArray(xs: Array[A]): Unit

    [use case]

    [use case]
    xs

      the array to fill.

    Definition Classes
      TraversableForwarder → TraversableOnce → GenTraversableOnce

47. #### def copyToArray(xs: Array[A], start: Int): Unit

    [use case]

    [use case]
    xs

      the array to fill.

    start

      the starting index.

    Definition Classes
      TraversableForwarder → TraversableOnce → GenTraversableOnce

48. #### def copyToArray(xs: Array[A], start: Int, len: Int): Unit

    [use case]

    [use case]
    xs

      the array to fill.

    start

      the starting index.

    len

      the maximal number of elements to copy.

    Definition Classes
      TraversableForwarder → TraversableLike → TraversableOnce → GenTraversableOnce

49. #### def copyToBuffer[B >: A](dest: Buffer[B]): Unit

    Copies all elements of this list buffer to a buffer.

    Copies all elements of this list buffer to a buffer.

    dest

      The buffer to which elements are copied.

    Definition Classes
      TraversableForwarder → TraversableOnce

50. #### def corresponds[B](that: GenSeq[B])(p: (A, B) ⇒ Boolean): Boolean

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

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

    B

      the type of the elements of `that`

    that

      the other sequence

    p

      the test predicate, which relates elements from both sequences

    returns

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

    Definition Classes
      SeqForwarder → SeqLike → GenSeqLike

51. #### def count(p: (A) ⇒ Boolean): Int

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

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

    p

      the predicate used to test elements.

    returns

      the number of elements satisfying the predicate `p`.

    Definition Classes
      TraversableForwarder → TraversableOnce → GenTraversableOnce

52. #### def diff(that: Seq[A]): ListBuffer[A]

    [use case]

    [use case]
    that

      the sequence of elements to remove

    returns

      a new list buffer which contains all elements of this list buffer 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 → GenSeqLike

53. #### def distinct: ListBuffer[A]

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

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

    returns

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

    Definition Classes
      SeqLike → GenSeqLike

54. #### def drop(n: Int): ListBuffer[A]

    Selects all elements except first n ones.

    Selects all elements except first n ones.

    n

      the number of elements to drop from this list buffer.

    returns

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

    Definition Classes
      IterableLike → TraversableLike → GenTraversableLike

55. #### def dropRight(n: Int): ListBuffer[A]

    Selects all elements except last n ones.

    Selects all elements except last n ones.

    n

      The number of elements to take

    returns

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

    Definition Classes
      IterableLike

56. #### def dropWhile(p: (A) ⇒ Boolean): ListBuffer[A]

    Drops longest prefix of elements that satisfy a predicate.

    Drops longest prefix of elements that satisfy a predicate.

    p

      The predicate used to test elements.

    returns

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

    Definition Classes
      TraversableLike → GenTraversableLike

57. #### def endsWith[B](that: GenSeq[B]): Boolean

    Tests whether this list buffer ends with the given sequence.

    Tests whether this list buffer ends with the given sequence.

    that

      the sequence to test

    returns

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

    Definition Classes
      SeqForwarder → SeqLike → GenSeqLike

58. #### final def eq(arg0: AnyRef): Boolean

    Tests whether the argument (`arg0`) is a reference to the receiver object (`this`).

    Tests whether the argument (`arg0`) is a reference to the receiver object (`this`).

    The `eq` method implements an equivalence relation on non-null instances of `AnyRef`, and has three additional 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`).

    returns

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

    Definition Classes
      AnyRef

59. #### def equals(that: Any): Boolean

    The equals method for arbitrary sequences.

    The equals method for arbitrary sequences. Compares this sequence to some other object.

    that

      The object to compare the sequence to

    returns

      `true` if `that` is a sequence that has the same elements as this sequence in the same order, `false` otherwise

    Definition Classes
      ListBuffer → GenSeqLike → Equals → AnyRef → Any

60. #### def exists(p: (A) ⇒ Boolean): Boolean

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

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

    p

      the predicate used to test elements.

    returns

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

    Definition Classes
      TraversableForwarder → TraversableLike → TraversableOnce → GenTraversableOnce

61. #### def filter(p: (A) ⇒ Boolean): ListBuffer[A]

    Selects all elements of this list buffer which satisfy a predicate.

    Selects all elements of this list buffer which satisfy a predicate.

    p

      the predicate used to test elements.

    returns

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

    Definition Classes
      TraversableLike → GenTraversableLike

62. #### def filterNot(p: (A) ⇒ Boolean): ListBuffer[A]

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

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

    p

      the predicate used to test elements.

    returns

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

    Definition Classes
      TraversableLike → GenTraversableLike

63. #### def finalize(): Unit

    Called by the garbage collector on the receiver object when there are no more references to the object.

    Called by the garbage collector on the receiver object when there are no more references to the object.

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

    Attributes
      protected[lang]
    Definition Classes
      AnyRef
    Annotations
      @throws()
    Note

      not specified by SLS as a member of AnyRef

64. #### def find(p: (A) ⇒ Boolean): Option[A]

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

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

    p

      the predicate used to test elements.

    returns

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

    Definition Classes
      TraversableForwarder → TraversableLike → TraversableOnce → GenTraversableOnce

65. #### def flatMap[B](f: (A) ⇒ GenTraversableOnce[B]): ListBuffer[B]

    [use case]

    [use case]
    B

      the element type of the returned collection.

    f

      the function to apply to each element.

    returns

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

    Definition Classes
      TraversableLike → GenTraversableLike → FilterMonadic

66. #### def fold[A1 >: A](z: A1)(op: (A1, A1) ⇒ A1): A1

    Folds the elements of this list buffer using the specified associative binary operator.

    Folds the elements of this list buffer using the specified associative binary operator.

    The order in which operations are performed on elements is unspecified and may be nondeterministic.

    A1

      a type parameter for the binary operator, a supertype of `A`.

    z

      a neutral element for the fold operation; may be added to the result an arbitrary number of times, and must not change the result (e.g., `Nil` for list concatenation, 0 for addition, or 1 for multiplication.)

    op

      a binary operator that must be associative

    returns

      the result of applying fold operator `op` between all the elements and `z`

    Definition Classes
      TraversableOnce → GenTraversableOnce

67. #### def foldLeft[B](z: B)(op: (B, A) ⇒ B): B

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

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

    B

      the result type of the binary operator.

    z

      the start value.

    op

      the binary operator.

    returns

      the result of inserting `op` between consecutive elements of this list buffer, going left to right with the start value `z` on the left:

                      op(...op(z, x1), x2, ..., xn)

      where `x1, ..., xn` are the elements of this list buffer.

    Definition Classes
      TraversableForwarder → TraversableOnce → GenTraversableOnce

68. #### def foldRight[B](z: B)(op: (A, B) ⇒ B): B

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

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

    B

      the result type of the binary operator.

    z

      the start value.

    op

      the binary operator.

    returns

      the result of inserting `op` between consecutive elements of this list buffer, going right to left with the start value `z` on the right:

                      op(x1, op(x2, ... op(xn, z)...))

      where `x1, ..., xn` are the elements of this list buffer.

    Definition Classes
      TraversableForwarder → TraversableOnce → GenTraversableOnce

69. #### def forall(p: (A) ⇒ Boolean): Boolean

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

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

    p

      the predicate used to test elements.

    returns

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

    Definition Classes
      TraversableForwarder → TraversableLike → TraversableOnce → GenTraversableOnce

70. #### def foreach(f: (A) ⇒ Unit): Unit

    [use case]

    [use case]
    f

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

    Definition Classes
      TraversableForwarder → GenericTraversableTemplate → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic

71. #### def genericBuilder[B]: Builder[B, ListBuffer[B]]

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

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

    Definition Classes
      GenericTraversableTemplate

72. #### final def getClass(): Class[_]

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

    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.

    Definition Classes
      AnyRef → Any
    Note

      not specified by SLS as a member of AnyRef

73. #### def groupBy[K](f: (A) ⇒ K): Map[K, ListBuffer[A]]

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

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

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

    K

      the type of keys returned by the discriminator function.

    f

      the discriminator function.

    returns

      A map from keys to list buffers such that the following invariant holds:

                          (xs partition f)(k) = xs filter (x => f(x) == k)

      That is, every key `k` is bound to a list buffer of those elements `x` for which `f(x)` equals `k`.

    Definition Classes
      TraversableLike → GenTraversableLike

74. #### def grouped(size: Int): Iterator[ListBuffer[A]]

    Partitions elements in fixed size list buffers.

    Partitions elements in fixed size list buffers.

    size

      the number of elements per group

    returns

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

    Definition Classes
      IterableLike
    See also

      Iterator#grouped

75. #### def hasDefiniteSize: Boolean

    Tests whether this list buffer is known to have a finite size.

    Tests whether this list buffer 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
      TraversableForwarder → TraversableLike → TraversableOnce → GenTraversableOnce

76. #### def hashCode(): Int

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

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

    returns

      the hash code value for this object.

    Definition Classes
      GenSeqLike → AnyRef → Any

77. #### def head: A

    Selects the first element of this list buffer.

    Selects the first element of this list buffer.

    returns

      the first element of this list buffer.

    Definition Classes
      TraversableForwarder → GenericTraversableTemplate → TraversableLike → GenTraversableLike
    Exceptions thrown
      `NoSuchElementException`

      if the list buffer is empty.

78. #### def headOption: Option[A]

    Optionally selects the first element.

    Optionally selects the first element.

    returns

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

    Definition Classes
      TraversableForwarder → TraversableLike

79. #### def indexOf(elem: A, from: Int): Int

    [use case]

    [use case]
    elem

      the element value to search for.

    from

      the start index

    returns

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

    Definition Classes
      SeqForwarder → GenSeqLike

80. #### def indexOf(elem: A): Int

    [use case]

    [use case]
    elem

      the element value to search for.

    returns

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

    Definition Classes
      SeqForwarder → GenSeqLike

81. #### def indexOfSlice[B >: A](that: GenSeq[B], from: Int): Int

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

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

    that

      the sequence to test

    from

      the start index

    returns

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

    Definition Classes
      SeqForwarder → SeqLike

82. #### def indexOfSlice[B >: A](that: GenSeq[B]): Int

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

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

    that

      the sequence to test

    returns

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

    Definition Classes
      SeqForwarder → SeqLike

83. #### def indexWhere(p: (A) ⇒ Boolean, from: Int): Int

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

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

    p

      the predicate used to test elements.

    from

      the start index

    returns

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

    Definition Classes
      SeqForwarder → SeqLike → GenSeqLike

84. #### def indexWhere(p: (A) ⇒ Boolean): Int

    Finds index of first element satisfying some predicate.

    Finds index of first element satisfying some predicate.

    p

      the predicate used to test elements.

    returns

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

    Definition Classes
      SeqForwarder → GenSeqLike

85. #### def indices: Range

    Produces the range of all indices of this sequence.

    Produces the range of all indices of this sequence.

    returns

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

    Definition Classes
      SeqForwarder → SeqLike

86. #### def init: ListBuffer[A]

    Selects all elements except the last.

    Selects all elements except the last.

    returns

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

    Definition Classes
      TraversableLike
    Exceptions thrown
      `UnsupportedOperationException`

      if the list buffer is empty.

87. #### def inits: Iterator[ListBuffer[A]]

    Iterates over the inits of this list buffer.

    Iterates over the inits of this list buffer. The first value will be this list buffer and the final one will be an empty list buffer, with the intervening values the results of successive applications of `init`.

    returns

      an iterator over all the inits of this list buffer

    Definition Classes
      TraversableLike
    Example:

    1. `List(1,2,3).inits = Iterator(List(1,2,3), List(1,2), List(1), Nil)`

88. #### def insert(n: Int, elems: A*): Unit

    Inserts new elements at a given index into this buffer.

    Inserts new elements at a given index into this buffer.

    n

      the index where new elements are inserted.

    elems

      the traversable collection containing the elements to insert.

    Definition Classes
      BufferLike
    Exceptions thrown
      IndexOutOfBoundsException

      if the index `n` is not in the valid range `0 <= n <= length`.

89. #### def insertAll(n: Int, seq: Traversable[A]): Unit

    Inserts new elements at the index `n`.

    Inserts new elements at the index `n`. Opposed to method `update`, this method will not replace an element with a new one. Instead, it will insert a new element at index `n`.

    n

      the index where a new element will be inserted.

    Definition Classes
      ListBuffer → BufferLike
    Exceptions thrown
      Predef.IndexOutOfBoundsException

      if `n` is out of bounds.

90. #### def intersect(that: Seq[A]): ListBuffer[A]

    [use case]

    [use case]
    that

      the sequence of elements to intersect with.

    returns

      a new list buffer which contains all elements of this list buffer 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 → GenSeqLike

91. #### def isDefinedAt(x: Int): Boolean

    Tests whether this list buffer contains given index.

    Tests whether this list buffer contains given index.

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

    returns

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

    Definition Classes
      SeqForwarder → GenSeqLike → PartialFunction

92. #### def isEmpty: Boolean

    Tests whether this list buffer is empty.

    Tests whether this list buffer is empty.

    returns

      `true` if the list buffer contain no elements, `false` otherwise.

    Definition Classes
      TraversableForwarder → GenericTraversableTemplate → TraversableLike → TraversableOnce → GenTraversableOnce

93. #### final def isInstanceOf[T0]: Boolean

    Test whether the dynamic type of the receiver object is `T0`.

    Test whether the dynamic type of the receiver object is `T0`.

    Note that the result of the test is modulo Scala's erasure semantics. Therefore the expression `1.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 specified type.

    returns

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

    Definition Classes
      Any

94. #### final def isTraversableAgain: Boolean

    Tests whether this list buffer can be repeatedly traversed.

    Tests whether this list buffer can be repeatedly traversed.

    returns

      `true`

    Definition Classes
      GenTraversableLike → GenTraversableOnce

95. #### def iterator: Iterator[A]

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

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

    returns

      the new iterator

    Definition Classes
      ListBuffer → IterableForwarder → IterableLike → GenIterableLike

96. #### def last: A

    Selects the last element.

    Selects the last element.

    returns

      The last element of this list buffer.

    Definition Classes
      TraversableForwarder → TraversableLike
    Exceptions thrown
      NoSuchElementException

      If the list buffer is empty.

97. #### def lastIndexOf(elem: A, end: Int): Int

    [use case]

    [use case]
    elem

      the element value to search for.

    end

      the end index.

    returns

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

    Definition Classes
      SeqForwarder → GenSeqLike

98. #### def lastIndexOf(elem: A): Int

    [use case]

    [use case]
    elem

      the element value to search for.

    returns

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

    Definition Classes
      SeqForwarder → GenSeqLike

99. #### def lastIndexOfSlice[B >: A](that: GenSeq[B], end: Int): Int

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

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

    that

      the sequence to test

    end

      the end index

    returns

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

    Definition Classes
      SeqForwarder → SeqLike

100. #### def lastIndexOfSlice[B >: A](that: GenSeq[B]): Int

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

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

     that

       the sequence to test

     returns

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

     Definition Classes
       SeqForwarder → SeqLike

101. #### def lastIndexWhere(p: (A) ⇒ Boolean, end: Int): Int

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

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

     p

       the predicate used to test elements.

     returns

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

     Definition Classes
       SeqForwarder → SeqLike → GenSeqLike

102. #### def lastIndexWhere(p: (A) ⇒ Boolean): Int

     Finds index of last element satisfying some predicate.

     Finds index of last element satisfying some predicate.

     p

       the predicate used to test elements.

     returns

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

     Definition Classes
       SeqForwarder → GenSeqLike

103. #### def lastOption: Option[A]

     Optionally selects the last element.

     Optionally selects the last element.

     returns

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

     Definition Classes
       TraversableForwarder → TraversableLike

104. #### def length: Int

     The current length of the buffer.

     The current length of the buffer.

     This operation takes constant time.

     returns

       the number of elements in this list buffer.

     Definition Classes
       ListBuffer → SeqForwarder → BufferLike → SeqLike → GenSeqLike

105. #### def lengthCompare(len: Int): Int

     Compares the length of this list buffer to a test value.

     Compares the length of this list buffer 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
       SeqForwarder → SeqLike

106. #### 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
     See also

       Function.unlift

107. #### def map[B](f: (A) ⇒ B): ListBuffer[B]

     [use case]

     [use case]
     B

       the element type of the returned collection.

     f

       the function to apply to each element.

     returns

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

     Definition Classes
       TraversableLike → GenTraversableLike → FilterMonadic

108. #### def mapResult[NewTo](f: (List[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

109. #### def max: A

     [use case]

     [use case]
     returns

       the largest element of this list buffer.

     Definition Classes
       TraversableForwarder → TraversableOnce → GenTraversableOnce

110. #### def maxBy[B](f: (A) ⇒ B)(implicit cmp: Ordering[B]): A

     Definition Classes
       TraversableOnce → GenTraversableOnce

111. #### def min: A

     [use case]

     [use case]
     returns

       the smallest element of this list buffer

     Definition Classes
       TraversableForwarder → TraversableOnce → GenTraversableOnce

112. #### def minBy[B](f: (A) ⇒ B)(implicit cmp: Ordering[B]): A

     Definition Classes
       TraversableOnce → GenTraversableOnce

113. #### def missingCase(x: Int): A

     Attributes
       protected
     Definition Classes
       PartialFunction

114. #### def mkString: String

     Displays all elements of this list buffer in a string.

     Displays all elements of this list buffer in a string.

     returns

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

     Definition Classes
       TraversableForwarder → TraversableOnce → GenTraversableOnce

115. #### def mkString(sep: String): String

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

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

     sep

       the separator string.

     returns

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

     Definition Classes
       TraversableForwarder → TraversableOnce → GenTraversableOnce
     Example:

     1. `List(1, 2, 3).mkString("|") = "1|2|3"`

116. #### def mkString(start: String, sep: String, end: String): String

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

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

     start

       the starting string.

     sep

       the separator string.

     end

       the ending string.

     returns

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

     Definition Classes
       TraversableForwarder → TraversableOnce → GenTraversableOnce
     Example:

     1. `List(1, 2, 3).mkString("(", "; ", ")") = "(1; 2; 3)"`

117. #### final def ne(arg0: AnyRef): Boolean

     Equivalent to `!(this eq that)`.

     Equivalent to `!(this eq that)`.

     returns

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

     Definition Classes
       AnyRef

118. #### def newBuilder: Builder[A, ListBuffer[A]]

     The builder that builds instances of type ListBuffer[A]

     The builder that builds instances of type ListBuffer[A]

     Attributes
       protected[this]
     Definition Classes
       GenericTraversableTemplate → HasNewBuilder

119. #### def nonEmpty: Boolean

     Tests whether the list buffer is not empty.

     Tests whether the list buffer is not empty.

     returns

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

     Definition Classes
       TraversableForwarder → TraversableOnce → GenTraversableOnce

120. #### final 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.

     Definition Classes
       AnyRef
     Note

       not specified by SLS as a member of AnyRef

121. #### final 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.

     Definition Classes
       AnyRef
     Note

       not specified by SLS as a member of AnyRef

122. #### def orElse[A1 <: Int, B1 >: A](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

123. #### def orElseFast[A1 <: Int, B1 >: A](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]

     Definition Classes
       PartialFunction

124. #### def padTo(len: Int, elem: A): ListBuffer[A]

     [use case]

     [use case]
     len

       the target length

     elem

       the padding value

     returns

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

     Definition Classes
       SeqLike → GenSeqLike

125. #### def par: ParSeq[A]

     Returns a parallel implementation of this collection.

     Returns a parallel implementation of this collection.

     For most collection types, this method creates a new parallel collection by copying all the elements. For these collection, `par` takes linear time. Mutable collections in this category do not produce a mutable parallel collection that has the same underlying dataset, so changes in one collection will not be reflected in the other one.

     Specific collections (e.g. `ParArray` or `mutable.ParHashMap`) override this default behaviour by creating a parallel collection which shares the same underlying dataset. For these collections, `par` takes constant or sublinear time.

     All parallel collections return a reference to themselves.

     returns

       a parallel implementation of this collection

     Definition Classes
       Parallelizable

126. #### def parCombiner: Combiner[A, ParSeq[A]]

     The default `par` implementation uses the combiner provided by this method to create a new parallel collection.

     The default `par` implementation uses the combiner provided by this method to create a new parallel collection.

     returns

       a combiner for the parallel collection of type `ParRepr`

     Attributes
       protected[this]
     Definition Classes
       SeqLike → SeqLike → TraversableLike → Parallelizable

127. #### def partition(p: (A) ⇒ Boolean): (ListBuffer[A], ListBuffer[A])

     Partitions this list buffer in two list buffers according to a predicate.

     Partitions this list buffer in two list buffers according to a predicate.

     p

       the predicate on which to partition.

     returns

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

     Definition Classes
       TraversableLike → GenTraversableLike

128. #### def patch(from: Int, that: GenSeq[A], replaced: Int): ListBuffer[A]

     [use case]

     [use case]
     from

       the index of the first replaced element

     replaced

       the number of elements to drop in the original list buffer

     returns

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

     Definition Classes
       SeqLike → GenSeqLike

129. #### def permutations: Iterator[ListBuffer[A]]

     Iterates over distinct permutations.

     Iterates over distinct permutations.

     returns

       An Iterator which traverses the distinct permutations of this list buffer.

     Definition Classes
       SeqLike
     Example:

     1. `"abb".permutations = Iterator(abb, bab, bba)`

130. #### def prefixLength(p: (A) ⇒ Boolean): Int

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

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

     p

       the predicate used to test elements.

     returns

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

     Definition Classes
       SeqForwarder → GenSeqLike

131. #### def prepend(elems: A*): Unit

     Prepends given elements to this buffer.

     Prepends given elements to this buffer.

     elems

       the elements to prepend.

     Definition Classes
       BufferLike

132. #### def prependAll(xs: TraversableOnce[A]): Unit

     Prepends the elements contained in a traversable object to this buffer.

     Prepends the elements contained in a traversable object to this buffer.

     xs

       the collection containing the elements to prepend.

     Definition Classes
       BufferLike

133. #### def prependToList(xs: List[A]): List[A]

     Prepends the elements of this buffer to a given list

     Prepends the elements of this buffer to a given list

     xs

       the list to which elements are prepended

134. #### def product: A

     [use case]

     [use case]
     returns

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

     Definition Classes
       TraversableForwarder → TraversableOnce → GenTraversableOnce

135. #### def readOnly: List[A]

     expose the underlying list but do not mark it as exported

     expose the underlying list but do not mark it as exported

     returns

       A sequence which refers to this buffer for all its operations.

     Definition Classes
       ListBuffer → BufferLike

136. #### def reduce[A1 >: A](op: (A1, A1) ⇒ A1): A1

     Reduces the elements of this list buffer using the specified associative binary operator.

     Reduces the elements of this list buffer using the specified associative binary operator.

     The order in which operations are performed on elements is unspecified and may be nondeterministic.

     A1

       A type parameter for the binary operator, a supertype of `A`.

     op

       A binary operator that must be associative.

     returns

       The result of applying reduce operator `op` between all the elements if the list buffer is nonempty.

     Definition Classes
       TraversableOnce → GenTraversableOnce
     Exceptions thrown
       UnsupportedOperationException

       if this list buffer is empty.

137. #### def reduceLeft[B >: A](op: (B, A) ⇒ B): B

     Definition Classes
       TraversableForwarder → TraversableOnce

138. #### def reduceLeftOption[B >: A](op: (B, A) ⇒ B): Option[B]

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

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

     B

       the result type of the binary operator.

     op

       the binary operator.

     returns

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

     Definition Classes
       TraversableForwarder → TraversableOnce → GenTraversableOnce

139. #### def reduceOption[A1 >: A](op: (A1, A1) ⇒ A1): Option[A1]

     Reduces the elements of this list buffer, if any, using the specified associative binary operator.

     Reduces the elements of this list buffer, if any, using the specified associative binary operator.

     The order in which operations are performed on elements is unspecified and may be nondeterministic.

     A1

       A type parameter for the binary operator, a supertype of `A`.

     op

       A binary operator that must be associative.

     returns

       An option value containing result of applying reduce operator `op` between all the elements if the collection is nonempty, and `None` otherwise.

     Definition Classes
       TraversableOnce → GenTraversableOnce

140. #### def reduceRight[B >: A](op: (A, B) ⇒ B): B

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

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

     B

       the result type of the binary operator.

     op

       the binary operator.

     returns

       the result of inserting `op` between consecutive elements of this list buffer, going right to left:

                       op(x,,1,,, op(x,,2,,, ..., op(x,,n-1,,, x,,n,,)...))

       where `x1, ..., xn` are the elements of this list buffer.

     Definition Classes
       TraversableForwarder → TraversableOnce → GenTraversableOnce
     Exceptions thrown
       `UnsupportedOperationException`

       if this list buffer is empty.

141. #### def reduceRightOption[B >: A](op: (A, B) ⇒ B): Option[B]

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

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

     B

       the result type of the binary operator.

     op

       the binary operator.

     returns

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

     Definition Classes
       TraversableForwarder → TraversableOnce → GenTraversableOnce

142. #### def remove(n: Int): A

     Removes the element on a given index position.

     Removes the element on a given index position. May take time linear in the buffer size.

     n

       the index which refers to the element to delete.

     returns

       n the element that was formerly at position `n`.

     Definition Classes
       ListBuffer → BufferLike
     Exceptions thrown
       Predef.IndexOutOfBoundsException

       if `n` is out of bounds.

     Note

       an element must exists at position `n`.

143. #### def remove(n: Int, count: Int): Unit

     Removes a given number of elements on a given index position.

     Removes a given number of elements on a given index position. May take time linear in the buffer size.

     n

       the index which refers to the first element to remove.

     count

       the number of elements to remove.

     Definition Classes
       ListBuffer → BufferLike

144. #### def repr: ListBuffer[A]

     The collection of type list buffer underlying this `TraversableLike` object.

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

     Definition Classes
       TraversableLike → GenTraversableLike

145. #### def result(): List[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
       ListBuffer → Builder

146. #### def reverse: ListBuffer[A]

     Returns new list buffer wih elements in reversed order.

     Returns new list buffer wih elements in reversed order.

     returns

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

     Definition Classes
       SeqLike → GenSeqLike

147. #### def reverseIterator: Iterator[A]

     An iterator yielding elements in reversed order.

     An iterator yielding elements in reversed order.

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

     returns

       an iterator yielding the elements of this list buffer in reversed order

     Definition Classes
       SeqForwarder → SeqLike

148. #### def reverseMap[B](f: (A) ⇒ B): ListBuffer[B]

     [use case] Note: `xs.reverseMap(f)` is the same as `xs.reverse.map(f)` but might be more efficient.

     [use case]

     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.

     f

       the function to apply to each element.

     returns

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

     Definition Classes
       SeqLike → GenSeqLike

149. #### def reversed: List[A]

     Attributes
       protected[this]
     Definition Classes
       TraversableOnce

150. #### def sameElements(that: GenIterable[A]): Boolean

     [use case]

     [use case]
     that

       the collection to compare with.

     returns

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

     Definition Classes
       IterableForwarder → IterableLike → GenIterableLike

151. #### def scan[B >: A, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[ListBuffer[A], B, That]): That

     Computes a prefix scan of the elements of the collection.

     Computes a prefix scan of the elements of the collection.

     Note: The neutral element `z` may be applied more than once.

     B

       element type of the resulting collection

     That

       type of the resulting collection

     z

       neutral element for the operator `op`

     op

       the associative operator for the scan

     cbf

       combiner factory which provides a combiner

     returns

       a new list buffer containing the prefix scan of the elements in this list buffer

     Definition Classes
       TraversableLike → GenTraversableLike

152. #### def scanLeft[B, That](z: B)(op: (B, A) ⇒ B)(implicit bf: CanBuildFrom[ListBuffer[A], B, That]): That

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

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

     B

       the type of the elements in the resulting collection

     That

       the actual type of the resulting collection

     z

       the initial value

     op

       the binary operator applied to the intermediate result and the element

     bf

       an implicit value of class `CanBuildFrom` which determines the result class `That` from the current representation type `Repr` and the new element type `B`. This is usually the `canBuildFrom` value defined in object `ListBuffer`.

     returns

       collection with intermediate results

     Definition Classes
       TraversableLike → GenTraversableLike

153. #### def scanRight[B, That](z: B)(op: (A, B) ⇒ B)(implicit bf: CanBuildFrom[ListBuffer[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. The head of the collection is the last cummulative result.

     Example:

            List(1, 2, 3, 4).scanRight(0)(_ + _) == List(10, 9, 7, 4, 0)

     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`. This is usually the `canBuildFrom` value defined in object `ListBuffer`.

     returns

       collection with intermediate results

     Definition Classes
       TraversableLike → GenTraversableLike
     Annotations
       @migration
     Migration

       (Changed in version 2.9.0) The behavior of `scanRight` has changed. The previous behavior can be reproduced with scanRight.reverse.

154. #### def segmentLength(p: (A) ⇒ Boolean, from: Int): Int

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

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

     p

       the predicate used to test elements.

     from

       the index where the search starts.

     returns

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

     Definition Classes
       SeqForwarder → SeqLike → GenSeqLike

155. #### def seq: Seq[A]

     A version of this collection with all of the operations implemented sequentially (i.

     A version of this collection with all of the operations implemented sequentially (i.e. in a single-threaded manner).

     This method returns a reference to this collection. In parallel collections, it is redefined to return a sequential implementation of this collection. In both cases, it has O(1) complexity.

     returns

       a sequential view of the collection.

     Definition Classes
       Seq → Seq → GenSeq → GenSeqLike → Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce

156. #### def size: Int

     The size of this list buffer.

     The size of this list buffer.

     returns

       the number of elements in this list buffer.

     Definition Classes
       ListBuffer → TraversableForwarder → SeqLike → GenTraversableLike → TraversableOnce → GenTraversableOnce

157. #### 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 to 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

158. #### 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

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

160. #### def slice(from: Int, until: Int): ListBuffer[A]

     Selects an interval of elements.

     Selects an interval of elements. The returned collection is made up of all elements `x` which satisfy the invariant:

            from <= indexOf(x) < until

     from

       the lowest index to include from this list buffer.

     until

       the highest index to EXCLUDE from this list buffer.

     returns

       a list buffer containing the elements greater than or equal to index `from` extending up to (but not including) index `until` of this list buffer.

     Definition Classes
       IterableLike → TraversableLike → GenTraversableLike

161. #### def sliding(size: Int, step: Int): Iterator[ListBuffer[A]]

     Definition Classes
       IterableLike

162. #### def sliding(size: Int): Iterator[ListBuffer[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 list buffers 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

       Iterator#sliding

163. #### def sortBy[B](f: (A) ⇒ B)(implicit ord: Ordering[B]): ListBuffer[A]

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

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

     B

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

     f

       the transformation function mapping elements to some other domain `B`.

     ord

       the ordering assumed on domain `B`.

     returns

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

     Definition Classes
       SeqLike
     Example:

     1.        val words = "The quick brown fox jumped over the lazy dog".split(' ')
               // this works because scala.Ordering will implicitly provide an Ordering[Tuple2[Int, Char]]
               words.sortBy(x => (x.length, x.head))
               res0: Array[String] = Array(The, dog, fox, the, lazy, over, brown, quick, jumped)

     See also

       scala.math.Ordering

164. #### def sortWith(lt: (A, A) ⇒ Boolean): ListBuffer[A]

     Sorts this list buffer according to a comparison function.

     Sorts this list buffer according to a comparison function.

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

     lt

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

     returns

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

     Definition Classes
       SeqLike
     Example:

     1.        List("Steve", "Tom", "John", "Bob").sortWith(_.compareTo(_) < 0) =
               List("Bob", "John", "Steve", "Tom")

165. #### def sorted[B >: A](implicit ord: Ordering[B]): ListBuffer[A]

     Sorts this list buffer according to an Ordering.

     Sorts this list buffer according to an Ordering.

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

     ord

       the ordering to be used to compare elements.

     returns

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

     Definition Classes
       SeqLike
     See also

       scala.math.Ordering

166. #### def span(p: (A) ⇒ Boolean): (ListBuffer[A], ListBuffer[A])

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

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

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

     p

       the test predicate

     returns

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

     Definition Classes
       TraversableLike → GenTraversableLike

167. #### def splitAt(n: Int): (ListBuffer[A], ListBuffer[A])

     Splits this list buffer into two at a given position.

     Splits this list buffer 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 list buffers consisting of the first `n` elements of this list buffer, and the other elements.

     Definition Classes
       TraversableLike → GenTraversableLike

168. #### def startsWith[B](that: GenSeq[B]): Boolean

     Tests whether this list buffer starts with the given sequence.

     Tests whether this list buffer starts with the given sequence.

     that

       the sequence to test

     returns

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

     Definition Classes
       SeqForwarder → GenSeqLike

169. #### def startsWith[B](that: GenSeq[B], offset: Int): Boolean

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

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

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

     that

       the sequence to test

     offset

       the index where the sequence is searched.

     returns

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

     Definition Classes
       SeqForwarder → SeqLike → GenSeqLike

170. #### def stringPrefix: String

     Defines the prefix of the string representation.

     Defines the prefix of the string representation.

     returns

       the string representation of this buffer.

     Definition Classes
       ListBuffer → BufferLike → TraversableLike → GenTraversableLike

171. #### def sum: A

     [use case]

     [use case]
     returns

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

     Definition Classes
       TraversableForwarder → TraversableOnce → GenTraversableOnce

172. #### final def synchronized[T0](arg0: ⇒ T0): T0

     Definition Classes
       AnyRef

173. #### def tail: ListBuffer[A]

     Selects all elements except the first.

     Selects all elements except the first.

     returns

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

     Definition Classes
       TraversableLike → GenTraversableLike
     Exceptions thrown
       `UnsupportedOperationException`

       if the list buffer is empty.

174. #### def tails: Iterator[ListBuffer[A]]

     Iterates over the tails of this list buffer.

     Iterates over the tails of this list buffer. The first value will be this list buffer and the final one will be an empty list buffer, with the intervening values the results of successive applications of `tail`.

     returns

       an iterator over all the tails of this list buffer

     Definition Classes
       TraversableLike
     Example:

     1. `List(1,2,3).tails = Iterator(List(1,2,3), List(2,3), List(3), Nil)`

175. #### def take(n: Int): ListBuffer[A]

     Selects first n elements.

     Selects first n elements.

     n

       Tt number of elements to take from this list buffer.

     returns

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

     Definition Classes
       IterableLike → TraversableLike → GenTraversableLike

176. #### def takeRight(n: Int): ListBuffer[A]

     Selects last n elements.

     Selects last n elements.

     n

       the number of elements to take

     returns

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

     Definition Classes
       IterableLike

177. #### def takeWhile(p: (A) ⇒ Boolean): ListBuffer[A]

     Takes longest prefix of elements that satisfy a predicate.

     Takes longest prefix of elements that satisfy a predicate.

     p

       The predicate used to test elements.

     returns

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

     Definition Classes
       IterableLike → TraversableLike → GenTraversableLike

178. #### def thisCollection: Seq[A]

     The underlying collection seen as an instance of `ListBuffer`.

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

     Attributes
       protected[this]
     Definition Classes
       SeqLike → IterableLike → TraversableLike

179. #### def toArray: Array[A]

     [use case]

     [use case]
     returns

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

     Definition Classes
       TraversableForwarder → TraversableOnce → GenTraversableOnce

180. #### def toBuffer[B >: A]: Buffer[B]

     Converts this list buffer to a mutable buffer.

     Converts this list buffer to a mutable buffer.

     returns

       a buffer containing all elements of this list buffer.

     Definition Classes
       TraversableForwarder → TraversableOnce → GenTraversableOnce

181. #### def toCollection(repr: ListBuffer[A]): Seq[A]

     A conversion from collections of type `Repr` to `ListBuffer` objects.

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

     Attributes
       protected[this]
     Definition Classes
       SeqLike → IterableLike → TraversableLike

182. #### def toIndexedSeq: IndexedSeq[A]

     Converts this list buffer to an indexed sequence.

     Converts this list buffer to an indexed sequence.

     returns

       an indexed sequence containing all elements of this list buffer.

     Definition Classes
       TraversableForwarder → TraversableOnce → GenTraversableOnce

183. #### def toIterable: Iterable[A]

     Converts this list buffer to an iterable collection.

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

     returns

       an `Iterable` containing all elements of this list buffer.

     Definition Classes
       TraversableForwarder → TraversableOnce → GenTraversableOnce

184. #### def toIterator: Iterator[A]

     Returns an Iterator over the elements in this list buffer.

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

     returns

       an Iterator containing all elements of this list buffer.

     Definition Classes
       IterableLike → TraversableLike → GenTraversableOnce

185. #### def toList: List[A]

     Converts this buffer to a list.

     Converts this buffer to a list. Takes constant time. The buffer is copied lazily, the first time it is mutated.

     returns

       a list containing all elements of this list buffer.

     Definition Classes
       ListBuffer → TraversableForwarder → TraversableOnce → GenTraversableOnce

186. #### def toMap[T, U]: Map[T, U]

     [use case]

     [use case]
     returns

       a map of type `immutable.Map[T, U]` containing all key/value pairs of type `(T, U)` of this list buffer.

     Definition Classes
       TraversableForwarder → TraversableOnce → GenTraversableOnce

187. #### def toSeq: Seq[A]

     Converts this list buffer to a sequence.

     Converts this list buffer to a sequence. As with `toIterable`, it's lazy in this default implementation, as this `TraversableOnce` may be lazy and unevaluated.

     returns

       a sequence containing all elements of this list buffer.

     Definition Classes
       TraversableForwarder → TraversableOnce → GenTraversableOnce

188. #### def toSet[B >: A]: Set[B]

     Converts this list buffer to a set.

     Converts this list buffer to a set.

     returns

       a set containing all elements of this list buffer.

     Definition Classes
       TraversableForwarder → TraversableOnce → GenTraversableOnce

189. #### def toStream: Stream[A]

     Converts this list buffer to a stream.

     Converts this list buffer to a stream.

     returns

       a stream containing all elements of this list buffer.

     Definition Classes
       TraversableForwarder → TraversableLike → GenTraversableOnce

190. #### def toString(): String

     Converts this list buffer to a string.

     Converts this list buffer to a string.

     returns

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

     Definition Classes
       SeqLike → TraversableLike → AnyRef → Any

191. #### def toTraversable: Traversable[A]

     Converts this list buffer to an unspecified Traversable.

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

     returns

       a Traversable containing all elements of this list buffer.

     Definition Classes
       TraversableLike → TraversableOnce → GenTraversableOnce

192. #### def transform(f: (A) ⇒ A): ListBuffer.this.type

     Applies a transformation function to all values contained in this sequence.

     Applies a transformation function to all values contained in this sequence. The transformation function produces new values from existing elements.

     f

       the transformation to apply

     returns

       the sequence itself.

     Definition Classes
       SeqLike

193. #### def trimEnd(n: Int): Unit

     Removes the last n elements of this buffer.

     Removes the last n elements of this buffer.

     n

       the number of elements to remove from the end of this buffer.

     Definition Classes
       BufferLike

194. #### def trimStart(n: Int): Unit

     Removes the first n elements of this buffer.

     Removes the first n elements of this buffer.

     n

       the number of elements to remove from the beginning of this buffer.

     Definition Classes
       BufferLike

195. #### def underlying: Seq[A]

     The iterable object to which calls are forwarded

     The iterable object to which calls are forwarded

     Attributes
       protected
     Definition Classes
       ListBuffer → SeqForwarder → IterableForwarder → TraversableForwarder

196. #### def union(that: Seq[A]): ListBuffer[A]

     [use case]

     [use case]
     that

       the sequence to add.

     returns

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

     Definition Classes
       SeqLike → GenSeqLike

197. #### def unzip[A1, A2](implicit asPair: (A) ⇒ (A1, A2)): (ListBuffer[A1], ListBuffer[A2])

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

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

     asPair

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

     returns

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

     Definition Classes
       GenericTraversableTemplate

198. #### def unzip3[A1, A2, A3](implicit asTriple: (A) ⇒ (A1, A2, A3)): (ListBuffer[A1], ListBuffer[A2], ListBuffer[A3])

     Converts this list buffer of triples into three collections of the first, second, and third element of each triple.

     Converts this list buffer of triples into three collections of the first, second, and third element of each triple.

     asTriple

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

     returns

       a triple list buffers, containing the first, second, respectively third member of each element triple of this list buffer.

     Definition Classes
       GenericTraversableTemplate

199. #### def update(n: Int, x: A): Unit

     Replaces element at index `n` with the new element `newelem`.

     Replaces element at index `n` with the new element `newelem`. Takes time linear in the buffer size. (except the first element, which is updated in constant time).

     n

       the index of the element to replace.

     x

       the new element.

     Definition Classes
       ListBuffer → BufferLike → SeqLike
     Exceptions thrown
       Predef.IndexOutOfBoundsException

       if `n` is out of bounds.

200. #### def updated(index: Int, elem: A): ListBuffer[A]

     [use case]

     [use case]
     index

       the position of the replacement

     elem

       the replacing element

     returns

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

     Definition Classes
       SeqLike → GenSeqLike

201. #### def view(from: Int, until: Int): SeqView[A, ListBuffer[A]]

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

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

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

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

     from

       the index of the first element of the view

     until

       the index of the element following the view

     returns

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

     Definition Classes
       SeqLike → IterableLike → TraversableLike

202. #### def view: SeqView[A, ListBuffer[A]]

     Creates a non-strict view of this list buffer.

     Creates a non-strict view of this list buffer.

     returns

       a non-strict view of this list buffer.

     Definition Classes
       SeqLike → IterableLike → TraversableLike

203. #### final def wait(): Unit

     Definition Classes
       AnyRef
     Annotations
       @throws()

204. #### final def wait(arg0: Long, arg1: Int): Unit

     Definition Classes
       AnyRef
     Annotations
       @throws()

205. #### final def wait(arg0: Long): Unit

     Definition Classes
       AnyRef
     Annotations
       @throws()

206. #### def withFilter(p: (A) ⇒ Boolean): FilterMonadic[A, ListBuffer[A]]

     Creates a non-strict filter of this list buffer.

     Creates a non-strict filter of this list buffer.

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

     p

       the predicate used to test elements.

     returns

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

     Definition Classes
       TraversableLike → FilterMonadic

207. #### def zip[B](that: GenIterable[B]): ListBuffer[(A, B)]

     [use case]

     [use case]
     B

       the type of the second half of the returned pairs

     that

       The iterable providing the second half of each result pair

     returns

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

     Definition Classes
       IterableLike → GenIterableLike

208. #### def zipAll[B](that: Iterable[B], thisElem: A, thatElem: B): ListBuffer[(A, B)]

     [use case]

     [use case]
     B

       the type of the second half of the returned pairs

     that

       The iterable providing the second half of each result pair

     thisElem

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

     thatElem

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

     returns

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

     Definition Classes
       IterableLike → GenIterableLike

209. #### def zipWithIndex: ListBuffer[(A, Int)]

     [use case]

     [use case]
     returns

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

     Definition Classes
       IterableLike → GenIterableLike

### Inherited from Serializable

### Inherited from SeqForwarder[A]

### Inherited from IterableForwarder[A]

### Inherited from TraversableForwarder[A]

### Inherited from Builder[A, List[A]]

### Inherited from AbstractBuffer[A]

### Inherited from Buffer[A]

### Inherited from BufferLike[A, ListBuffer[A]]

### Inherited from Subtractable[A, ListBuffer[A]]

### Inherited from Scriptable[A]

### Inherited from Shrinkable[A]

### Inherited from Growable[A]

### Inherited from AbstractSeq[A]

### Inherited from Seq[A]

### Inherited from SeqLike[A, ListBuffer[A]]

### Inherited from Cloneable[ListBuffer[A]]

### Inherited from Iterable[A]

### Inherited from Traversable[A]

### Inherited from Mutable

### Inherited from AbstractSeq[A]

### Inherited from Seq[A]

### Inherited from SeqLike[A, ListBuffer[A]]

### Inherited from GenSeq[A]

### Inherited from GenSeqLike[A, ListBuffer[A]]

### Inherited from PartialFunction[Int, A]

### Inherited from (Int) ⇒ A

### Inherited from AbstractIterable[A]

### Inherited from Iterable[A]

### Inherited from IterableLike[A, ListBuffer[A]]

### Inherited from Equals

### Inherited from GenIterable[A]

### Inherited from GenIterableLike[A, ListBuffer[A]]

### Inherited from AbstractTraversable[A]

### Inherited from Traversable[A]

### Inherited from GenTraversable[A]

### Inherited from GenericTraversableTemplate[A, ListBuffer]

### Inherited from TraversableLike[A, ListBuffer[A]]

### Inherited from GenTraversableLike[A, ListBuffer[A]]

### Inherited from Parallelizable[A, ParSeq[A]]

### Inherited from TraversableOnce[A]

### Inherited from GenTraversableOnce[A]

### Inherited from FilterMonadic[A, ListBuffer[A]]

### Inherited from HasNewBuilder[A, ListBuffer[A]]

### Inherited from AnyRef

### Inherited from Any