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, immutable.List[A]] with SeqForwarder[A] with java.io.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
java.io.Serializable, SeqForwarder[A], IterableForwarder[A], TraversableForwarder[A], Builder[A, immutable.List[A]], AbstractBuffer[A], Buffer[A], BufferLike[A, ListBuffer[A]], Subtractable[A, ListBuffer[A]], Scriptable[A], Shrinkable[A], Growable[A], Clearable, AbstractSeq[A], Seq[A], SeqLike[A, ListBuffer[A]], Cloneable[ListBuffer[A]], scala.Cloneable, java.lang.Cloneable, Iterable[A], Traversable[A], Mutable, collection.AbstractSeq[A], collection.Seq[A], collection.SeqLike[A, ListBuffer[A]], GenSeq[A], GenSeqLike[A, ListBuffer[A]], PartialFunction[Int, A], (Int) ⇒ A, collection.AbstractIterable[A], collection.Iterable[A], IterableLike[A, ListBuffer[A]], Equals, GenIterable[A], GenIterableLike[A, ListBuffer[A]], AbstractTraversable[A], collection.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, scala.collection.mutable.ListBuffer[A] @scala.annotation.unchecked.uncheckedVariance], AnyRef, Any
Type Hierarchy Learn more about scaladoc diagrams
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  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. Clearable
  15. AbstractSeq
  16. Seq
  17. SeqLike
  18. Cloneable
  19. Cloneable
  20. Cloneable
  21. Iterable
  22. Traversable
  23. Mutable
  24. AbstractSeq
  25. Seq
  26. SeqLike
  27. GenSeq
  28. GenSeqLike
  29. PartialFunction
  30. Function1
  31. AbstractIterable
  32. Iterable
  33. IterableLike
  34. Equals
  35. GenIterable
  36. GenIterableLike
  37. AbstractTraversable
  38. Traversable
  39. GenTraversable
  40. GenericTraversableTemplate
  41. TraversableLike
  42. GenTraversableLike
  43. Parallelizable
  44. TraversableOnce
  45. GenTraversableOnce
  46. FilterMonadic
  47. HasNewBuilder
  48. AnyRef
  49. Any
Implicitly
  1. by traversable2ops
  2. by MonadOps
  3. by any2stringadd
  4. by any2stringfmt
  5. by any2ArrowAssoc
  6. by any2Ensuring
  7. by alternateImplicit
  1. Hide All
  2. Show all
Learn more about member selection
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 +(other: String): String

    Implicit information
    This member is added by an implicit conversion from ListBuffer[A] to StringAdd performed by method any2stringadd in scala.Predef.
    Definition Classes
    StringAdd
  5. 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.

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

    [use case] Returns a new list buffer containing the elements from the left hand operand followed by the elements from the right hand operand.

    [use case]

    Returns a new list buffer containing the elements from the left hand operand followed by the elements from the right hand operand. The element type of the list buffer is the most specific superclass encompassing the element types of the two operands.

    Example:

    scala> val a = LinkedList(1)
    a: scala.collection.mutable.LinkedList[Int] = LinkedList(1)
    
    scala> val b = LinkedList(2)
    b: scala.collection.mutable.LinkedList[Int] = LinkedList(2)
    
    scala> val c = a ++ b
    c: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2)
    
    scala> val d = LinkedList('a')
    d: scala.collection.mutable.LinkedList[Char] = LinkedList(a)
    
    scala> val e = c ++ d
    e: scala.collection.mutable.LinkedList[AnyVal] = LinkedList(1, 2, a)
    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
    TraversableLikeGenTraversableLike
    Full Signature

    def ++[B >: A, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[ListBuffer[A], B, That]): That

  7. def ++:[B >: A, That](that: collection.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
  8. def ++:[B](that: TraversableOnce[B]): ListBuffer[B]

    [use case] As with ++, returns a new collection containing the elements from the left operand followed by the elements from the right operand.

    [use case]

    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)
    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
    Full Signature

    def ++:[B >: A, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[ListBuffer[A], B, That]): That

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

    xs

    the TraversableOnce producing the elements to append.

    returns

    the list buffer itself.

    Definition Classes
    ListBufferGrowable
  10. 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
    ListBufferBufferLike
  11. def +:(elem: A): ListBuffer[A]

    [use case] A copy of the list buffer with an element prepended.

    [use case]

    A copy of the list buffer with an element prepended.

    Note that :-ending operators are right associative (see example). A mnemonic for +: vs. :+ is: the COLon goes on the COLlection side.

    Also, the original list buffer is not modified, so you will want to capture the result.

    Example:

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

    the prepended element

    returns

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

    Definition Classes
    SeqLikeGenSeqLike
    Full Signature

    def +:[B >: A, That](elem: B)(implicit bf: CanBuildFrom[ListBuffer[A], B, That]): That

  12. 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
    ListBufferBuilderBufferLikeGrowable
  13. 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
  14. 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
    ListBufferBufferLike
  15. 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
    BufferLikeSubtractable
    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 -(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
    BufferLikeSubtractable
    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: 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
    BufferLikeSubtractable
    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.

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

    xs

    the iterator producing the elements to remove.

    returns

    the list buffer itself

    Definition Classes
    Shrinkable
  19. 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.

    elem

    the element to remove.

    returns

    this list buffer.

    Definition Classes
    ListBufferBufferLikeShrinkable
  20. 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
  21. def ->[B](y: B): (ListBuffer[A], B)

    Implicit information
    This member is added by an implicit conversion from ListBuffer[A] to ArrowAssoc[ListBuffer[A]] performed by method any2ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  22. 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, x_1), x_2), ..., x_n)

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

    Definition Classes
    TraversableForwarderTraversableOnceGenTraversableOnce
  23. def :+(elem: A): ListBuffer[A]

    [use case] A copy of this list buffer with an element appended.

    [use case]

    A copy of this list buffer with an element appended.

    A mnemonic for +: vs. :+ is: the COLon goes on the COLlection side.

    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)
    elem

    the appended element

    returns

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

    Definition Classes
    SeqLikeGenSeqLike
    Full Signature

    def :+[B >: A, That](elem: B)(implicit bf: CanBuildFrom[ListBuffer[A], B, That]): That

  24. 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(x_1, op(x_2, ... op(x_n, z)...))

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

    Definition Classes
    TraversableForwarderTraversableOnceGenTraversableOnce
  25. 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
    BufferLikeScriptable
  26. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  27. 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
  28. 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
    TraversableForwarderTraversableOnce
  29. 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
    TraversableForwarderTraversableOnce
  30. 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
    TraversableForwarderTraversableOnce
  31. 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
    TraversableOnceGenTraversableOnce
  32. def andThen[C](k: (A) ⇒ C): PartialFunction[Int, C]

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

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

    C

    the result type of the transformation function.

    k

    the transformation function

    returns

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

    Definition Classes
    PartialFunctionFunction1
  33. 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
  34. 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
  35. 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
    ListBufferSeqForwarderBufferLikeSeqLikeGenSeqLikeFunction1
    Exceptions thrown
    `IndexOutOfBoundsException`

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

  36. def applyOrElse[A1 <: Int, B1 >: A](x: A1, default: (A1) ⇒ B1): B1

    Applies this partial function to the given argument when it is contained in the function domain.

    Applies this partial function to the given argument when it is contained in the function domain. Applies fallback function where this partial function is not defined.

    Note that expression pf.applyOrElse(x, default) is equivalent to

    if(pf isDefinedAt x) pf(x) else default(x)

    except that applyOrElse method can be implemented more efficiently. For all partial function literals compiler generates applyOrElse implementation which avoids double evaluation of pattern matchers and guards. This makes applyOrElse the basis for the efficient implementation for many operations and scenarios, such as:

    • combining partial functions into orElse/andThen chains does not lead to excessive apply/isDefinedAt evaluation
    • lift and unlift do not evaluate source functions twice on each invocation
    • runWith allows efficient imperative-style combining of partial functions with conditionally applied actions

    For non-literal partial function classes with nontrivial isDefinedAt method it is recommended to override applyOrElse with custom implementation that avoids double isDefinedAt evaluation. This may result in better performance and more predictable behavior w.r.t. side effects.

    x

    the function argument

    default

    the fallback function

    returns

    the result of this function or fallback function application.

    Definition Classes
    PartialFunction
    Since

    2.10

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

  38. def asParIterable: ParIterable[A]

    Implicit information
    This member is added by an implicit conversion from ListBuffer[A] to TraversableOps[A] performed by method traversable2ops in scala.collection.parallel.
    Definition Classes
    TraversableOps
  39. def asParSeq: ParSeq[A]

    Implicit information
    This member is added by an implicit conversion from ListBuffer[A] to TraversableOps[A] performed by method traversable2ops in scala.collection.parallel.
    Definition Classes
    TraversableOps
  40. 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
    IterableLikeEquals
  41. def clear(): Unit

    Clears the buffer contents.

    Clears the buffer contents.

    Definition Classes
    ListBufferBuilderBufferLikeGrowableClearable
  42. 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
    ListBufferBufferLikeCloneable → AnyRef
  43. def collect[B](pf: PartialFunction[A, B]): ListBuffer[B]

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

    [use case]

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

    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
    TraversableLikeGenTraversableLike
    Full Signature

    def collect[B, That](pf: PartialFunction[A, B])(implicit bf: CanBuildFrom[ListBuffer[A], B, That]): That

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

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

  46. 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
    ListBufferBufferSeqIterableTraversableSeqGenSeqIterableGenIterableTraversableGenTraversableGenericTraversableTemplate
  47. 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
    Annotations
    @unspecialized()
  48. 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 equal (as determined by ==) to elem, false otherwise.

    Definition Classes
    SeqForwarderSeqLike
  49. 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
    SeqForwarderSeqLike
  50. def copyToArray(xs: Array[A]): Unit

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

    [use case]

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

    xs

    the array to fill.

    Definition Classes
    TraversableForwarderTraversableOnceGenTraversableOnce
    Full Signature

    def copyToArray[B >: A](xs: Array[B]): Unit

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

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

    [use case]

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

    xs

    the array to fill.

    start

    the starting index.

    Definition Classes
    TraversableForwarderTraversableOnceGenTraversableOnce
    Full Signature

    def copyToArray[B >: A](xs: Array[B], start: Int): Unit

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

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

    [use case]

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

    xs

    the array to fill.

    start

    the starting index.

    len

    the maximal number of elements to copy.

    Definition Classes
    TraversableForwarderTraversableLikeTraversableOnceGenTraversableOnce
    Full Signature

    def copyToArray[B >: A](xs: Array[B], start: Int, len: Int): Unit

  53. 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
    TraversableForwarderTraversableOnce
  54. 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
    SeqForwarderSeqLikeGenSeqLike
  55. 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
    TraversableForwarderTraversableOnceGenTraversableOnce
  56. def diff(that: collection.Seq[A]): ListBuffer[A]

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

    [use case]

    Computes the multiset difference between this list buffer and another sequence.

    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
    SeqLikeGenSeqLike
    Full Signature

    def diff[B >: A](that: GenSeq[B]): ListBuffer[A]

  57. 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
    SeqLikeGenSeqLike
  58. 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
    IterableLikeTraversableLikeGenTraversableLike
  59. 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
  60. 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.

    returns

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

    Definition Classes
    TraversableLikeGenTraversableLike
  61. 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
    SeqForwarderSeqLikeGenSeqLike
  62. def ensuring(cond: (ListBuffer[A]) ⇒ Boolean, msg: ⇒ Any): ListBuffer[A]

    Implicit information
    This member is added by an implicit conversion from ListBuffer[A] to Ensuring[ListBuffer[A]] performed by method any2Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  63. def ensuring(cond: (ListBuffer[A]) ⇒ Boolean): ListBuffer[A]

    Implicit information
    This member is added by an implicit conversion from ListBuffer[A] to Ensuring[ListBuffer[A]] performed by method any2Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  64. def ensuring(cond: Boolean, msg: ⇒ Any): ListBuffer[A]

    Implicit information
    This member is added by an implicit conversion from ListBuffer[A] to Ensuring[ListBuffer[A]] performed by method any2Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  65. def ensuring(cond: Boolean): ListBuffer[A]

    Implicit information
    This member is added by an implicit conversion from ListBuffer[A] to Ensuring[ListBuffer[A]] performed by method any2Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  66. 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
  67. 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
    ListBufferGenSeqLikeEquals → AnyRef → Any
  68. 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
    TraversableForwarderTraversableLikeTraversableOnceGenTraversableOnce
  69. 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
    TraversableLikeGenTraversableLike
  70. 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
    TraversableLikeGenTraversableLike
  71. 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[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
    Note

    not specified by SLS as a member of AnyRef

  72. 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
    TraversableForwarderTraversableLikeTraversableOnceGenTraversableOnce
  73. def flatMap[B](f: (A) ⇒ GenTraversableOnce[B]): ListBuffer[B]

    [use case] Builds a new collection by applying a function to all elements of this list buffer and using the elements of the resulting collections.

    [use case]

    Builds a new collection by applying a function to all elements of this list buffer and using the elements of the resulting collections.

    For example:

    def getWords(lines: Seq[String]): Seq[String] = lines flatMap (line => line split "\\W+")

    The type of the resulting collection is guided by the static type of list buffer. This might cause unexpected results sometimes. For example:

    // lettersOf will return a Seq[Char] of likely repeated letters, instead of a Set
    def lettersOf(words: Seq[String]) = words flatMap (word => word.toSet)
    
    // lettersOf will return a Set[Char], not a Seq
    def lettersOf(words: Seq[String]) = words.toSet flatMap (word => word.toSeq)
    
    // xs will be a an Iterable[Int]
    val xs = Map("a" -> List(11,111), "b" -> List(22,222)).flatMap(_._2)
    
    // ys will be a Map[Int, Int]
    val ys = Map("a" -> List(1 -> 11,1 -> 111), "b" -> List(2 -> 22,2 -> 222)).flatMap(_._2)
    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
    TraversableLikeGenTraversableLikeFilterMonadic
    Full Signature

    def flatMap[B, That](f: (A) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[ListBuffer[A], B, That]): That

  74. def flatten[B]: ListBuffer[B]

    [use case] Converts this list buffer of traversable collections into a list buffer formed by the elements of these traversable collections.

    [use case]

    Converts this list buffer of traversable collections into a list buffer formed by the elements of these traversable collections.

    The resulting collection's type will be guided by the static type of list buffer. For example:

    val xs = List(Set(1, 2, 3), Set(1, 2, 3))
    // xs == List(1, 2, 3, 1, 2, 3)
    
    val ys = Set(List(1, 2, 3), List(3, 2, 1))
    // ys == Set(1, 2, 3)
    B

    the type of the elements of each traversable collection.

    returns

    a new list buffer resulting from concatenating all element list buffers.

    Definition Classes
    GenericTraversableTemplate
    Full Signature

    def flatten[B](implicit asTraversable: (A) ⇒ GenTraversableOnce[B]): ListBuffer[B]

  75. 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
    TraversableOnceGenTraversableOnce
  76. 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, x_1), x_2, ..., x_n)

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

    Definition Classes
    TraversableForwarderTraversableOnceGenTraversableOnce
  77. 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(x_1, op(x_2, ... op(x_n, z)...))

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

    Definition Classes
    TraversableForwarderTraversableOnceGenTraversableOnce
  78. 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
    TraversableForwarderTraversableLikeTraversableOnceGenTraversableOnce
  79. 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
    TraversableForwarderGenericTraversableTemplateTraversableLikeGenTraversableLikeTraversableOnceGenTraversableOnceFilterMonadic
    Full Signature

    def foreach[B](f: (A) ⇒ B): Unit

  80. def formatted(fmtstr: String): String

    Returns string formatted according to given format string.

    Returns string formatted according to given format string. Format strings are as for String.format (@see java.lang.String.format).

    Implicit information
    This member is added by an implicit conversion from ListBuffer[A] to StringFormat performed by method any2stringfmt in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()
  81. 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
  82. 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

  83. def groupBy[K](f: (A) ⇒ K): immutable.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
    TraversableLikeGenTraversableLike
  84. 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

    scala.collection.Iterator, method grouped

  85. 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
    TraversableForwarderTraversableLikeTraversableOnceGenTraversableOnce
  86. 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
    GenSeqLikeAny
  87. 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
    TraversableForwarderGenericTraversableTemplateTraversableLikeGenTraversableLike
    Exceptions thrown
    `NoSuchElementException`

    if the list buffer is empty.

  88. 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
    TraversableForwarderTraversableLikeGenTraversableLike
  89. def ifParSeq[R](isbody: (ParSeq[A]) ⇒ R): (TraversableOps[A])#Otherwise[R]

    Implicit information
    This member is added by an implicit conversion from ListBuffer[A] to TraversableOps[A] performed by method traversable2ops in scala.collection.parallel.
    Definition Classes
    TraversableOps
  90. def indexOf(elem: A, from: Int): Int

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

    [use case]

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

    elem

    the element value to search for.

    from

    the start index

    returns

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

    Definition Classes
    SeqForwarderGenSeqLike
    Full Signature

    def indexOf[B >: A](elem: B, from: Int): Int

  91. def indexOf(elem: A): Int

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

    [use case]

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

    elem

    the element value to search for.

    returns

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

    Definition Classes
    SeqForwarderGenSeqLike
    Full Signature

    def indexOf[B >: A](elem: B): Int

  92. 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
    SeqForwarderSeqLike
  93. 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
    SeqForwarderSeqLike
  94. 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
    SeqForwarderSeqLikeGenSeqLike
  95. 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
    SeqForwarderGenSeqLike
  96. def indices: immutable.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
    SeqForwarderSeqLike
  97. 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
    TraversableLikeGenTraversableLike
    Exceptions thrown
    `UnsupportedOperationException`

    if the list buffer is empty.

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

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

  100. def insertAll(n: Int, seq: collection.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.

    seq

    the iterable object providing all elements to insert.

    Definition Classes
    ListBufferBufferLike
    Exceptions thrown
    Predef.IndexOutOfBoundsException

    if n is out of bounds.

  101. def intersect(that: collection.Seq[A]): ListBuffer[A]

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

    [use case]

    Computes the multiset intersection between this list buffer and another sequence.

    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
    SeqLikeGenSeqLike
    Full Signature

    def intersect[B >: A](that: GenSeq[B]): ListBuffer[A]

  102. 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
    SeqForwarderGenSeqLikePartialFunction
  103. 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
    TraversableForwarderGenericTraversableTemplateTraversableLikeTraversableOnceGenTraversableOnce
  104. 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
  105. def isParIterable: Boolean

    Implicit information
    This member is added by an implicit conversion from ListBuffer[A] to TraversableOps[A] performed by method traversable2ops in scala.collection.parallel.
    Definition Classes
    TraversableOps
  106. def isParSeq: Boolean

    Implicit information
    This member is added by an implicit conversion from ListBuffer[A] to TraversableOps[A] performed by method traversable2ops in scala.collection.parallel.
    Definition Classes
    TraversableOps
  107. def isParallel: Boolean

    Implicit information
    This member is added by an implicit conversion from ListBuffer[A] to TraversableOps[A] performed by method traversable2ops in scala.collection.parallel.
    Definition Classes
    TraversableOps
  108. 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
    TraversableLikeGenTraversableLikeGenTraversableOnce
  109. 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
    ListBufferIterableForwarderIterableLikeGenIterableLike
  110. def last: A

    Selects the last element.

    Selects the last element.

    returns

    The last element of this list buffer.

    Definition Classes
    TraversableForwarderTraversableLikeGenTraversableLike
    Exceptions thrown
    NoSuchElementException

    If the list buffer is empty.

  111. def lastIndexOf(elem: A, end: Int): Int

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

    [use case]

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

    elem

    the element value to search for.

    end

    the end index.

    returns

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

    Definition Classes
    SeqForwarderGenSeqLike
    Full Signature

    def lastIndexOf[B >: A](elem: B, end: Int): Int

  112. def lastIndexOf(elem: A): Int

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

    [use case]

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

    elem

    the element value to search for.

    returns

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

    Definition Classes
    SeqForwarderGenSeqLike
    Full Signature

    def lastIndexOf[B >: A](elem: B): Int

  113. 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
    SeqForwarderSeqLike
  114. 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
    SeqForwarderSeqLike
  115. 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
    SeqForwarderSeqLikeGenSeqLike
  116. 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
    SeqForwarderGenSeqLike
  117. 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
    TraversableForwarderTraversableLikeGenTraversableLike
  118. 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
    ListBufferSeqForwarderBufferLikeSeqLikeGenSeqLike
  119. 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
    SeqForwarderSeqLike
  120. def lift: (Int) ⇒ Option[A]

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

    Turns this partial function into a 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

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

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

    [use case]

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

    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
    TraversableLikeGenTraversableLikeFilterMonadic
    Full Signature

    def map[B, That](f: (A) ⇒ B)(implicit bf: CanBuildFrom[ListBuffer[A], B, That]): That

  122. def mapResult[NewTo](f: (immutable.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
  123. def max: A

    [use case] Finds the largest element.

    [use case]

    Finds the largest element.

    returns

    the largest element of this list buffer.

    Definition Classes
    TraversableForwarderTraversableOnceGenTraversableOnce
    Full Signature

    def max[B >: A](implicit cmp: Ordering[B]): A

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

    Definition Classes
    TraversableOnceGenTraversableOnce
  125. def min: A

    [use case] Finds the smallest element.

    [use case]

    Finds the smallest element.

    returns

    the smallest element of this list buffer

    Definition Classes
    TraversableForwarderTraversableOnceGenTraversableOnce
    Full Signature

    def min[B >: A](implicit cmp: Ordering[B]): A

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

    Definition Classes
    TraversableOnceGenTraversableOnce
  127. 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
    TraversableForwarderTraversableOnceGenTraversableOnce
  128. 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
    TraversableForwarderTraversableOnceGenTraversableOnce
    Example:
    1. List(1, 2, 3).mkString("|") = "1|2|3"

  129. 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
    TraversableForwarderTraversableOnceGenTraversableOnce
    Example:
    1. List(1, 2, 3).mkString("(", "; ", ")") = "(1; 2; 3)"

  130. 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
  131. 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
    GenericTraversableTemplateHasNewBuilder
  132. 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
    TraversableForwarderTraversableOnceGenTraversableOnce
  133. 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

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

  135. 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
  136. def padTo(len: Int, elem: A): ListBuffer[A]

    [use case] A copy of this list buffer with an element value appended until a given target length is reached.

    [use case]

    A copy of this list buffer with an element value appended until a given target length is reached.

    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
    SeqLikeGenSeqLike
    Full Signature

    def padTo[B >: A, That](len: Int, elem: B)(implicit bf: CanBuildFrom[ListBuffer[A], B, That]): That

  137. 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
  138. 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
    SeqLikeSeqLikeTraversableLikeParallelizable
  139. 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
    TraversableLikeGenTraversableLike
  140. def patch(from: Int, that: GenSeq[A], replaced: Int): ListBuffer[A]

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

    [use case]

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

    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
    SeqLikeGenSeqLike
    Full Signature

    def patch[B >: A, That](from: Int, patch: GenSeq[B], replaced: Int)(implicit bf: CanBuildFrom[ListBuffer[A], B, That]): That

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

  142. 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
    SeqForwarderGenSeqLike
  143. 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
  144. 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
  145. def prependToList(xs: immutable.List[A]): immutable.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

  146. def product: A

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

    [use case]

    Multiplies up the elements of this collection.

    returns

    the product of all elements in this 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
    TraversableForwarderTraversableOnceGenTraversableOnce
    Full Signature

    def product[B >: A](implicit num: Numeric[B]): B

  147. def readOnly: immutable.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
    ListBufferBufferLike
  148. 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
    TraversableOnceGenTraversableOnce
    Exceptions thrown
    UnsupportedOperationException

    if this list buffer is empty.

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

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

    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

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

    op( op( ... op(x_1, x_2) ..., x_{n-1}), x_n)

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

    Definition Classes
    TraversableForwarderTraversableOnce
    Exceptions thrown
    `UnsupportedOperationException`

    if this list buffer is empty.

  150. 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
    TraversableForwarderTraversableOnceGenTraversableOnce
  151. 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
    TraversableOnceGenTraversableOnce
  152. 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
    TraversableForwarderTraversableOnceGenTraversableOnce
    Exceptions thrown
    `UnsupportedOperationException`

    if this list buffer is empty.

  153. 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
    TraversableForwarderTraversableOnceGenTraversableOnce
  154. 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
    ListBufferBufferLike
    Exceptions thrown
    Predef.IndexOutOfBoundsException

    if n is out of bounds.

    Note

    an element must exists at position n.

  155. 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
    ListBufferBufferLike
    Annotations
    @migration
    Migration

    (Changed in version 2.11) Invalid input values will be rejected in future releases.

  156. 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
    TraversableLikeGenTraversableLike
  157. def result(): immutable.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
    ListBufferBuilder
  158. 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
    SeqLikeGenSeqLike
  159. 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
    SeqForwarderSeqLike
  160. def reverseMap[B](f: (A) ⇒ B): ListBuffer[B]

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

    [use case]

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

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

    B

    the element type of the returned collection.

    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
    SeqLikeGenSeqLike
    Full Signature

    def reverseMap[B, That](f: (A) ⇒ B)(implicit bf: CanBuildFrom[ListBuffer[A], B, That]): That

  161. def reversed: List[A]

    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  162. def runWith[U](action: (A) ⇒ U): (Int) ⇒ Boolean

    Composes this partial function with an action function which gets applied to results of this partial function.

    Composes this partial function with an action function which gets applied to results of this partial function. The action function is invoked only for its side effects; its result is ignored.

    Note that expression pf.runWith(action)(x) is equivalent to

    if(pf isDefinedAt x) { action(pf(x)); true } else false

    except that runWith is implemented via applyOrElse and thus potentially more efficient. Using runWith avoids double evaluation of pattern matchers and guards for partial function literals.

    action

    the action function

    returns

    a function which maps arguments x to isDefinedAt(x). The resulting function runs action(this(x)) where this is defined.

    Definition Classes
    PartialFunction
    Since

    2.10

    See also

    applyOrElse.

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

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

    [use case]

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

    that

    the collection to compare with.

    returns

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

    Definition Classes
    IterableForwarderIterableLikeGenIterableLike
    Full Signature

    def sameElements[B >: A](that: GenIterable[B]): Boolean

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

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

    Produces a collection containing cumulative 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
    TraversableLikeGenTraversableLike
  166. def scanRight[B, That](z: B)(op: (A, B) ⇒ B)(implicit bf: CanBuildFrom[ListBuffer[A], B, That]): That

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

    Produces a collection containing cumulative results of applying the operator going right to left. The head of the collection is the last cumulative 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
    TraversableLikeGenTraversableLike
    Annotations
    @migration
    Migration

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

  167. 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
    SeqForwarderSeqLikeGenSeqLike
  168. 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
    SeqSeqGenSeqGenSeqLikeIterableIterableGenIterableTraversableTraversableGenTraversableParallelizableTraversableOnceGenTraversableOnce
  169. 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
    ListBufferTraversableForwarderSeqLikeGenTraversableLikeTraversableOnceGenTraversableOnce
  170. def sizeHint(coll: TraversableLike[_, _], delta: Int): 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
  171. def sizeHint(coll: TraversableLike[_, _]): 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.

    Definition Classes
    Builder
  172. 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
  173. def sizeHintBounded(size: Int, boundingColl: 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
  174. 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
    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
    IterableLikeTraversableLikeGenTraversableLike
  175. def sliding(size: Int, step: 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

    step

    the distance between the first elements of successive groups (defaults to 1)

    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

    scala.collection.Iterator, method sliding

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

    scala.collection.Iterator, method sliding

  177. def sortBy[B](f: (A) ⇒ B)(implicit ord: math.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

  178. 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 (as determined by 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")
  179. def sorted[B >: A](implicit ord: math.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 (as determined by 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

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

    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
    TraversableLikeGenTraversableLike
  181. 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
    TraversableLikeGenTraversableLike
  182. 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
    SeqForwarderGenSeqLike
  183. 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
    SeqForwarderSeqLikeGenSeqLike
  184. 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
    ListBufferBufferLikeTraversableLikeGenTraversableLike
  185. def sum: A

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

    [use case]

    Sums up the elements of this collection.

    returns

    the sum of all elements in this 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
    TraversableForwarderTraversableOnceGenTraversableOnce
    Full Signature

    def sum[B >: A](implicit num: Numeric[B]): B

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

    Definition Classes
    AnyRef
  187. 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
    TraversableLikeGenTraversableLike
    Exceptions thrown
    `UnsupportedOperationException`

    if the list buffer is empty.

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

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

    Selects first n elements.

    Selects first n elements.

    n

    the 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
    IterableLikeTraversableLikeGenTraversableLike
  190. 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
  191. 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.

    returns

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

    Definition Classes
    IterableLikeTraversableLikeGenTraversableLike
  192. def thisCollection: collection.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
    SeqLikeIterableLikeTraversableLike
  193. def to[Col[_]]: Col[A]

    [use case] Converts this list buffer into another by copying all elements.

    [use case]

    Converts this list buffer into another by copying all elements.

    Col

    The collection type to build.

    returns

    a new collection containing all elements of this list buffer.

    Definition Classes
    TraversableLikeTraversableOnceGenTraversableOnce
    Full Signature

    def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, A, Col[A]]): Col[A]

  194. def toArray: Array[A]

    [use case] Converts this list buffer to an array.

    [use case]

    Converts this list buffer to an array.

    returns

    an array containing all elements of this list buffer. An ClassTag must be available for the element type of this list buffer.

    Definition Classes
    TraversableForwarderTraversableOnceGenTraversableOnce
    Full Signature

    def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]

  195. 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
    TraversableForwarderTraversableOnceGenTraversableOnce
  196. def toCollection(repr: ListBuffer[A]): collection.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
    SeqLikeIterableLikeTraversableLike
  197. def toIndexedSeq: immutable.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
    TraversableForwarderTraversableOnceGenTraversableOnce
  198. def toIterable: collection.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
    TraversableForwarderTraversableOnceGenTraversableOnce
  199. 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
    IterableLikeTraversableLikeGenTraversableOnce
  200. def toList: immutable.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
    ListBufferTraversableForwarderTraversableOnceGenTraversableOnce
  201. def toMap[T, U]: collection.Map[T, U]

    [use case] Converts this list buffer to a map.

    [use case]

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

    returns

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

    Definition Classes
    TraversableForwarderTraversableOnceGenTraversableOnce
    Full Signature

    def toMap[T, U](implicit ev: <:<[A, (T, U)]): immutable.Map[T, U]

  202. def toParArray: ParArray[A]

    Implicit information
    This member is added by an implicit conversion from ListBuffer[A] to TraversableOps[A] performed by method traversable2ops in scala.collection.parallel.
    Definition Classes
    TraversableOps
  203. def toSeq: collection.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
    TraversableForwarderTraversableOnceGenTraversableOnce
  204. def toSet[B >: A]: immutable.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
    TraversableForwarderTraversableOnceGenTraversableOnce
  205. def toStream: immutable.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
    TraversableForwarderTraversableLikeGenTraversableOnce
  206. 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
    SeqLikeTraversableLikeAny
  207. def toTraversable: collection.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
    TraversableLikeTraversableOnceGenTraversableOnce
  208. def toVector: Vector[A]

    Converts this list buffer to a Vector.

    Converts this list buffer to a Vector.

    returns

    a vector containing all elements of this list buffer.

    Definition Classes
    TraversableOnceGenTraversableOnce
  209. 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
  210. def transpose[B](implicit asTraversable: (A) ⇒ GenTraversableOnce[B]): ListBuffer[ListBuffer[B]]

    Transposes this list buffer of traversable collections into a list buffer of list buffers.

    Transposes this list buffer of traversable collections into a list buffer of list buffers.

    B

    the type of the elements of each traversable collection.

    asTraversable

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

    returns

    a two-dimensional list buffer of list buffers which has as nth row the nth column of this list buffer.

    Definition Classes
    GenericTraversableTemplate
    Annotations
    @migration
    Migration

    (Changed in version 2.9.0) transpose throws an IllegalArgumentException if collections are not uniformly sized.

    Exceptions thrown
    `IllegalArgumentException`

    if all collections in this list buffer are not of the same size.

  211. 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
  212. 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
  213. def underlying: immutable.Seq[A]

    The iterable object to which calls are forwarded

    The iterable object to which calls are forwarded

    Attributes
    protected
    Definition Classes
    ListBufferSeqForwarderIterableForwarderTraversableForwarder
  214. def union(that: collection.Seq[A]): ListBuffer[A]

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

    [use case]

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

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

    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
    SeqLikeGenSeqLike
    Full Signature

    def union[B >: A, That](that: GenSeq[B])(implicit bf: CanBuildFrom[ListBuffer[A], B, That]): That

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

    A1

    the type of the first half of the element pairs

    A2

    the type of the second half of the element pairs

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

    A1

    the type of the first member of the element triples

    A2

    the type of the second member of the element triples

    A3

    the type of the third member of the element triples

    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
  217. 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
    ListBufferBufferLikeSeqLike
    Exceptions thrown
    Predef.IndexOutOfBoundsException

    if n is out of bounds.

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

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

    [use case]

    A copy of this list buffer with one single replaced element.

    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
    SeqLikeGenSeqLike
    Full Signature

    def updated[B >: A, That](index: Int, elem: B)(implicit bf: CanBuildFrom[ListBuffer[A], B, That]): That

  219. 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
    SeqLikeIterableLikeTraversableLike
  220. 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
    SeqLikeIterableLikeTraversableLike
  221. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  222. final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  223. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  224. 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
    TraversableLikeFilterMonadic
  225. def zip[B](that: GenIterable[B]): ListBuffer[(A, B)]

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

    [use case]

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

    B

    the type of the second half of the returned pairs

    that

    The iterable providing the second half of each result pair

    returns

    a new list 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
    IterableLikeGenIterableLike
    Full Signature

    def zip[A1 >: A, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[ListBuffer[A], (A1, B), That]): That

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

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

    [use case]

    Returns a list buffer formed from this list buffer and another iterable collection by combining corresponding elements in pairs. If one of the two collections is shorter than the other, placeholder elements are used to extend the shorter collection to the length of the longer.

    B

    the type of the second half of the returned pairs

    that

    The iterable providing the second half of each result pair

    thisElem

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

    def zipAll[B, A1 >: A, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[ListBuffer[A], (A1, B), That]): That

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

    [use case] Zips this list buffer with its indices.

    [use case]

    Zips this list buffer with its indices.

    returns

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

    Definition Classes
    IterableLikeGenIterableLike
    Full Signature

    def zipWithIndex[A1 >: A, That](implicit bf: CanBuildFrom[ListBuffer[A], (A1, Int), That]): That

    Example:
    1. List("a", "b", "c").zipWithIndex = List(("a", 0), ("b", 1), ("c", 2))

  228. def [B](y: B): (ListBuffer[A], B)

    Implicit information
    This member is added by an implicit conversion from ListBuffer[A] to ArrowAssoc[ListBuffer[A]] performed by method any2ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc

Shadowed Implicit Value Members

  1. def filter(p: (A) ⇒ Boolean): TraversableOnce[A]

    Implicit information
    This member is added by an implicit conversion from ListBuffer[A] to MonadOps[A] performed by method MonadOps in scala.collection.TraversableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (listBuffer: MonadOps[A]).filter(p)
    Definition Classes
    MonadOps
  2. def flatMap[B](f: (A) ⇒ GenTraversableOnce[B]): TraversableOnce[B]

    Implicit information
    This member is added by an implicit conversion from ListBuffer[A] to MonadOps[A] performed by method MonadOps in scala.collection.TraversableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (listBuffer: MonadOps[A]).flatMap(f)
    Definition Classes
    MonadOps
  3. def map[B](f: (A) ⇒ B): TraversableOnce[B]

    Implicit information
    This member is added by an implicit conversion from ListBuffer[A] to MonadOps[A] performed by method MonadOps in scala.collection.TraversableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (listBuffer: MonadOps[A]).map(f)
    Definition Classes
    MonadOps
  4. val self: Any

    Implicit information
    This member is added by an implicit conversion from ListBuffer[A] to StringAdd performed by method any2stringadd in scala.Predef.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (listBuffer: StringAdd).self
    Definition Classes
    StringAdd
  5. val self: Any

    Implicit information
    This member is added by an implicit conversion from ListBuffer[A] to StringFormat performed by method any2stringfmt in scala.Predef.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (listBuffer: StringFormat).self
    Definition Classes
    StringFormat
  6. def withFilter(p: (A) ⇒ Boolean): Iterator[A]

    Implicit information
    This member is added by an implicit conversion from ListBuffer[A] to MonadOps[A] performed by method MonadOps in scala.collection.TraversableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (listBuffer: MonadOps[A]).withFilter(p)
    Definition Classes
    MonadOps

Deprecated Value Members

  1. 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
    Annotations
    @deprecated
    Deprecated

    (Since version 2.10.0) use fold instead

  2. def x: ListBuffer[A]

    Implicit information
    This member is added by an implicit conversion from ListBuffer[A] to ArrowAssoc[ListBuffer[A]] performed by method any2ArrowAssoc in scala.Predef.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (listBuffer: ArrowAssoc[ListBuffer[A]]).x
    Definition Classes
    ArrowAssoc
    Annotations
    @deprecated
    Deprecated

    (Since version 2.10.0) Use leftOfArrow instead

  3. def x: ListBuffer[A]

    Implicit information
    This member is added by an implicit conversion from ListBuffer[A] to Ensuring[ListBuffer[A]] performed by method any2Ensuring in scala.Predef.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (listBuffer: Ensuring[ListBuffer[A]]).x
    Definition Classes
    Ensuring
    Annotations
    @deprecated
    Deprecated

    (Since version 2.10.0) Use resultOfEnsuring instead

Inherited from java.io.Serializable

Inherited from SeqForwarder[A]

Inherited from IterableForwarder[A]

Inherited from TraversableForwarder[A]

Inherited from Builder[A, immutable.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 Clearable

Inherited from AbstractSeq[A]

Inherited from Seq[A]

Inherited from SeqLike[A, ListBuffer[A]]

Inherited from Cloneable[ListBuffer[A]]

Inherited from scala.Cloneable

Inherited from java.lang.Cloneable

Inherited from Iterable[A]

Inherited from Traversable[A]

Inherited from Mutable

Inherited from collection.AbstractSeq[A]

Inherited from collection.Seq[A]

Inherited from collection.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 collection.AbstractIterable[A]

Inherited from collection.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 collection.Traversable[A]

Inherited from GenTraversable[A]

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, scala.collection.mutable.ListBuffer[A] @scala.annotation.unchecked.uncheckedVariance]

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion traversable2ops from ListBuffer[A] to TraversableOps[A]

Inherited by implicit conversion MonadOps from ListBuffer[A] to MonadOps[A]

Inherited by implicit conversion any2stringadd from ListBuffer[A] to StringAdd

Inherited by implicit conversion any2stringfmt from ListBuffer[A] to StringFormat

Inherited by implicit conversion any2ArrowAssoc from ListBuffer[A] to ArrowAssoc[ListBuffer[A]]

Inherited by implicit conversion any2Ensuring from ListBuffer[A] to Ensuring[ListBuffer[A]]

Inherited by implicit conversion alternateImplicit from ListBuffer[A] to ForceImplicitAmbiguity

Ungrouped