scala.collection.mutable

# BufferProxy

#### trait BufferProxy [A] extends Buffer[A] with Proxy

This is a simple proxy class for `scala.collection.mutable.Buffer`. It is most useful for assembling customized set abstractions dynamically using object composition and forwarding.

A

  type of the elements the buffer proxy contains.

Source
  BufferProxy.scala
Version

  1.0, 16/04/2004

Since

  1

Linear Supertypes
Proxy, Buffer[A], BufferLike[A, Buffer[A]], Subtractable[A, Buffer[A]], Scriptable[A], Shrinkable[A], Growable[A], Seq[A], SeqLike[A, Buffer[A]], Cloneable[Buffer[A]], Seq[A], SeqLike[A, Buffer[A]], GenSeq[A], GenSeqLike[A, Buffer[A]], PartialFunction[Int, A], (Int) ⇒ A, Iterable[A], Iterable[A], IterableLike[A, Buffer[A]], Equals, GenIterable[A], GenIterableLike[A, Buffer[A]], Traversable[A], Mutable, Traversable[A], GenTraversable[A], GenericTraversableTemplate[A, Buffer], TraversableLike[A, Buffer[A]], GenTraversableLike[A, Buffer[A]], Parallelizable[A, ParSeq[A]], TraversableOnce[A], GenTraversableOnce[A], FilterMonadic[A, Buffer[A]], HasNewBuilder[A, Buffer[A]], AnyRef, Any
Ordering

1. Alphabetic
2. By inheritance

Inherited

1. Hide All
2. Show all

1. BufferProxy
2. Proxy
3. Buffer
4. BufferLike
5. Subtractable
6. Scriptable
7. Shrinkable
8. Growable
9. Seq
10. SeqLike
11. Cloneable
12. Seq
13. SeqLike
14. GenSeq
15. GenSeqLike
16. PartialFunction
17. Function1
18. Iterable
19. Iterable
20. IterableLike
21. Equals
22. GenIterable
23. GenIterableLike
24. Traversable
25. Mutable
26. Traversable
27. GenTraversable
28. GenericTraversableTemplate
29. TraversableLike
30. GenTraversableLike
31. Parallelizable
32. TraversableOnce
33. GenTraversableOnce
34. FilterMonadic
35. HasNewBuilder
36. AnyRef
37. Any

Visibility

1. Public
2. All

### Type Members

1. #### type Self = Buffer[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.

### Abstract Value Members

1. #### def self : Buffer[A]

   Attributes
     abstract
   Definition Classes
     BufferProxy → Proxy

### Concrete Value Members

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

   Attributes
     final
   Definition Classes
     AnyRef

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

   Test two objects for inequality.

   Test two objects for inequality.

   returns

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

   Attributes
     final
   Definition Classes
     Any

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

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

   Equivalent to `x.hashCode` except for boxed numeric types. 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.

   returns

     a hash value consistent with ==

   Attributes
     final
   Definition Classes
     AnyRef → Any

4. #### def ++ (xs: TraversableOnce[A]): Buffer[A]

   Definition Classes
     BufferLike
   Annotations
     @bridge()

5. #### def ++ [B >: A, That] (that: TraversableOnce[B])(implicit bf: CanBuildFrom[Buffer[A], B, That]): That

   Definition Classes
     TraversableLike
   Annotations
     @bridge()

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

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

   [use case]

   Concatenates this buffer proxy with the elements of a traversable collection.

   B

     the element type of the returned collection.

   that

     the traversable to append.

   returns

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

   Attributes
     abstract
   Definition Classes
     GenTraversableLike

7. #### def ++ [B >: A, That] (that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Buffer[A], B, That]): That

   Concatenates this buffer proxy with the elements of a traversable collection.

   Concatenates this buffer proxy with the elements of a traversable collection.

   B

     the element type of the returned collection.

   That

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

   that

     the traversable to append.

   bf

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

   returns

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

   Definition Classes
     TraversableLike → GenTraversableLike

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

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

   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.

   Definition Classes
     TraversableLike

9. #### def ++: [B] (that: TraversableOnce[B]): BufferProxy[B]

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

   [use case]

   Concatenates this buffer proxy with the elements of a traversable collection. It differs from ++ in that the right operand determines the type of the resulting collection rather than the left one.

   B

     the element type of the returned collection.

   that

     the traversable to append.

   returns

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

   Attributes
     abstract
   Definition Classes
     TraversableLike

10. #### def ++: [B >: A, That] (that: TraversableOnce[B])(implicit bf: CanBuildFrom[Buffer[A], B, That]): That

    Concatenates this buffer proxy with the elements of a traversable collection.

    Concatenates this buffer proxy with the elements of a traversable collection. It differs from ++ in that the right operand determines the type of the resulting collection rather than the left one.

    B

      the element type of the returned collection.

    That

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

    that

      the traversable to append.

    bf

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

    returns

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

    Definition Classes
      TraversableLike

11. #### def ++= (xs: TraversableOnce[A]): BufferProxy.this.type

    Appends a number of elements provided by a traversable object.

    Appends a number of elements provided by a traversable object.

    xs

      the traversable object.

    returns

      a reference to this buffer proxy.

    Definition Classes
      BufferProxy → Growable

12. #### def ++=: (xs: TraversableOnce[A]): BufferProxy.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
      BufferProxy → BufferLike

13. #### def +: (elem: A): BufferProxy[A]

    [use case] Prepends an element to this buffer proxy

    [use case]

    Prepends an element to this buffer proxy

    elem

      the prepended element

    returns

      a new collection of type `That` consisting of `elem` followed by all elements of this buffer proxy.

    Attributes
      abstract
    Definition Classes
      GenSeqLike

14. #### def +: [B >: A, That] (elem: B)(implicit bf: CanBuildFrom[Buffer[A], B, That]): That

    Prepends an element to this buffer proxy

    Prepends an element to this buffer proxy

    B

      the element type of the returned buffer proxy.

    That

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

    elem

      the prepended element

    bf

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

    returns

      a new collection of type `That` consisting of `elem` followed by all elements of this buffer proxy.

    Definition Classes
      SeqLike → GenSeqLike

15. #### def += (elem: A): BufferProxy.this.type

    Append a single element to this buffer.

    Append a single element to this buffer.

    elem

      the element to append.

    returns

      the buffer proxy itself

    Definition Classes
      BufferProxy → BufferLike → Growable

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

    Appends two or more elements to this buffer proxy.

    Appends two or more elements to this buffer proxy.

    elem1

      the first element to append.

    elem2

      the second element to append.

    elems

      the remaining elements to append.

    returns

      the buffer proxy itself

    Definition Classes
      Growable

17. #### def +=: (elem: A): BufferProxy.this.type

    Prepend a single element to this buffer and return the identity of the buffer.

    Prepend a single element to this buffer and return the identity of the buffer.

    elem

      the element to append.

    returns

      a reference to this buffer proxy.

    Definition Classes
      BufferProxy → BufferLike

18. #### def - (elem1: A, elem2: A, elems: A*): Buffer[A]

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

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

    elem1

      the first element to remove.

    elem2

      the second element to remove.

    elems

      the remaining elements to remove.

    returns

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

    Definition Classes
      BufferLike → Subtractable
    Annotations
      @migration
    Migration

      "As of 2.8, - always creates a new collection, even on Buffers.\n"+ "Use -= instead if you intend to remove by side effect from an existing collection.\n"

19. #### def - (elem: A): Buffer[A]

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

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

    elem

      the element to remove.

    returns

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

    Definition Classes
      BufferLike → Subtractable
    Annotations
      @migration
    Migration

      "As of 2.8, - always creates a new collection, even on Buffers.\n"+ "Use -= instead if you intend to remove by side effect from an existing collection.\n"

20. #### def -- (xs: TraversableOnce[A]): Buffer[A]

    Definition Classes
      BufferLike → Subtractable
    Annotations
      @bridge()

21. #### def -- (xs: GenTraversableOnce[A]): Buffer[A]

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

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

    xs

      the traversable object.

    returns

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

    Definition Classes
      BufferLike → Subtractable
    Annotations
      @migration
    Migration

      "As of 2.8, -- always creates a new collection, even on Buffers.\n"+ "Use --= instead if you intend to remove by side effect from an existing collection.\n"

22. #### def --= (xs: TraversableOnce[A]): BufferProxy.this.type

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

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

    returns

      the buffer proxy itself

    Definition Classes
      Shrinkable

23. #### def -= (x: A): BufferProxy.this.type

    Removes a single element from this buffer, at its first occurrence.

    Removes a single element from this buffer, at its first occurrence. If the buffer does not contain that element, it is unchanged.

    x

      the element to remove.

    returns

      the buffer itself

    Definition Classes
      BufferLike → Shrinkable

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

    Removes two or more elements from this buffer proxy.

    Removes two or more elements from this buffer proxy.

    elem1

      the first element to remove.

    elem2

      the second element to remove.

    elems

      the remaining elements to remove.

    returns

      the buffer proxy itself

    Definition Classes
      Shrinkable

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

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

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

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

    B

      the result type of the binary operator.

    z

      the start value.

    op

      the binary operator.

    returns

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

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

      where `x,,1,,, ..., x,,n,,` are the elements of this buffer proxy.

    Definition Classes
      TraversableOnce → GenTraversableOnce

26. #### 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`.

    Definition Classes
      GenTraversableOnce

27. #### def :+ (elem: A): BufferProxy[A]

    [use case] Appends an element to this buffer proxy

    [use case]

    Appends an element to this buffer proxy

    elem

      the appended element

    returns

      a new collection of type `That` consisting of all elements of this buffer proxy followed by `elem`.

    Attributes
      abstract
    Definition Classes
      GenSeqLike

28. #### def :+ [B >: A, That] (elem: B)(implicit bf: CanBuildFrom[Buffer[A], B, That]): That

    Appends an element to this buffer proxy

    Appends an element to this buffer proxy

    B

      the element type of the returned buffer proxy.

    That

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

    elem

      the appended element

    bf

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

    returns

      a new collection of type `That` consisting of all elements of this buffer proxy followed by `elem`.

    Definition Classes
      SeqLike → GenSeqLike

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

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

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

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

    B

      the result type of the binary operator.

    z

      the start value

    op

      the binary operator

    returns

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

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

      where `x,,1,,, ..., x,,n,,` are the elements of this buffer proxy.

    Definition Classes
      TraversableOnce → GenTraversableOnce

30. #### 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
      BufferProxy → BufferLike → Scriptable

31. #### def == (arg0: AnyRef): Boolean

    Attributes
      final
    Definition Classes
      AnyRef

32. #### def == (arg0: Any): Boolean

    Test two objects for equality.

    Test two objects for equality.

    returns

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

    Attributes
      final
    Definition Classes
      Any

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

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

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

    b

      the string builder to which elements are appended.

    returns

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

    Definition Classes
      TraversableOnce

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

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

    Appends all elements of this buffer proxy 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 buffer proxy, separated by the string `sep`.

    b

      the string builder to which elements are appended.

    sep

      the separator string.

    returns

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

    Definition Classes
      TraversableOnce

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

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

    Appends all elements of this buffer proxy 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 buffer proxy are separated by the string `sep`.

    b

      the string builder to which elements are appended.

    start

      the starting string.

    sep

      the separator string.

    end

      the ending string.

    returns

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

    Definition Classes
      TraversableOnce

36. #### 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 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).

    z

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

    seqop

      an operator used to accumulate results within a partition

    combop

      an associative operator used to combine results from different partitions

    Definition Classes
      TraversableOnce → GenTraversableOnce

37. #### def andThen [C] (k: (A) ⇒ C): PartialFunction[Int, C]

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

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

    C

      the result type of the transformation function.

    k

      the transformation function

    returns

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

    Definition Classes
      PartialFunction → Function1

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

    Appends a sequence of elements to this buffer.

    Appends a sequence of elements to this buffer.

    elems

      the elements to append.

    Definition Classes
      BufferProxy → BufferLike

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

    Appends a number of elements provided by a traversable object.

    Appends a number of elements provided by a traversable object.

    xs

      the traversable object.

    Definition Classes
      BufferProxy → BufferLike

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

    Selects an element by its index in the buffer proxy.

    Selects an element by its index in the buffer proxy.

    returns

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

    Definition Classes
      BufferProxy → BufferLike → SeqLike → GenSeqLike → Function1

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

    Attributes
      final
    Definition Classes
      Any

42. #### 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 buffer proxy should be compared

    returns

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

    Definition Classes
      IterableLike → Equals

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

    Clears the buffer contents.

    Clears the buffer contents.

    Definition Classes
      BufferProxy → BufferLike → Growable

44. #### def clone (): Buffer[A]

    Return a clone of this buffer.

    Return a clone of this buffer.

    returns

      a `Buffer` with the same elements.

    Definition Classes
      BufferProxy → Cloneable → AnyRef

45. #### def collect [B] (pf: PartialFunction[A, B]): BufferProxy[B]

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

    [use case]

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

    B

      the element type of the returned collection.

    pf

      the partial function which filters and maps the buffer proxy.

    returns

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

    Attributes
      abstract
    Definition Classes
      GenTraversableLike

46. #### def collect [B, That] (pf: PartialFunction[A, B])(implicit bf: CanBuildFrom[Buffer[A], B, That]): That

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

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

    B

      the element type of the returned collection.

    That

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

    pf

      the partial function which filters and maps the buffer proxy.

    bf

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

    returns

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

    Definition Classes
      TraversableLike → GenTraversableLike

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

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

    Finds the first element of the buffer proxy 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)`

48. #### def combinations (n: Int): Iterator[Buffer[A]]

    Iterates over combinations.

    Iterates over combinations.

    returns

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

    Definition Classes
      SeqLike
    Example:

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

49. #### def companion : GenericCompanion[Buffer]

    The factory companion object that builds instances of class BufferProxy.

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

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

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

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

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

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

    elem

      the element to test.

    returns

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

    Definition Classes
      SeqLike

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

    Definition Classes
      SeqLike
    Annotations
      @bridge()

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

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

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

    that

      the sequence to test

    returns

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

    Definition Classes
      SeqLike

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

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

    [use case]

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

    xs

      the array to fill.

    start

      the starting index.

    len

      the maximal number of elements to copy.

    Attributes
      abstract
    Definition Classes
      TraversableLike

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

    Copies elements of this buffer proxy to an array.

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

    B

      the type of the elements of the array.

    xs

      the array to fill.

    start

      the starting index.

    len

      the maximal number of elements to copy.

    Definition Classes
      IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

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

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

    [use case]

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

    xs

      the array to fill.

    Attributes
      abstract
    Definition Classes
      GenTraversableOnce

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

    Copies values of this buffer proxy to an array.

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

    B

      the type of the elements of the array.

    xs

      the array to fill.

    Definition Classes
      TraversableOnce → GenTraversableOnce

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

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

    [use case]

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

    xs

      the array to fill.

    start

      the starting index.

    Attributes
      abstract
    Definition Classes
      GenTraversableOnce

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

    Copies values of this buffer proxy to an array.

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

    B

      the type of the elements of the array.

    xs

      the array to fill.

    start

      the starting index.

    Definition Classes
      TraversableOnce → GenTraversableOnce

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

    Copies all elements of this buffer proxy to a buffer.

    Copies all elements of this buffer proxy to a buffer.

    dest

      The buffer to which elements are copied.

    Definition Classes
      TraversableOnce

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

    Definition Classes
      SeqLike
    Annotations
      @bridge()

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

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

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

    Definition Classes
      SeqLike → GenSeqLike

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

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

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

    p

      the predicate used to test elements.

    returns

      the number of elements satisfying the predicate `p`.

    Definition Classes
      TraversableOnce → GenTraversableOnce

64. #### def diff [B >: A] (that: Seq[B]): Buffer[A]

    Definition Classes
      SeqLike
    Annotations
      @bridge()

65. #### def diff (that: Seq[A]): BufferProxy[A]

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

    [use case]

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

    that

      the sequence of elements to remove

    returns

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

    Attributes
      abstract
    Definition Classes
      SeqLike

66. #### def diff [B >: A] (that: GenSeq[B]): Buffer[A]

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

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

    B

      the element type of the returned buffer proxy.

    that

      the sequence of elements to remove

    returns

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

    Definition Classes
      SeqLike → GenSeqLike

67. #### def distinct : Buffer[A]

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

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

    returns

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

    Definition Classes
      SeqLike → GenSeqLike

68. #### def drop (n: Int): Buffer[A]

    Selects all elements except first n ones.

    Selects all elements except first n ones.

    n

      the number of elements to drop from this buffer proxy.

    returns

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

    Definition Classes
      IterableLike → TraversableLike → GenTraversableLike

69. #### def dropRight (n: Int): Buffer[A]

    Selects all elements except last n ones.

    Selects all elements except last n ones.

    n

      The number of elements to take

    returns

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

    Definition Classes
      IterableLike

70. #### def dropWhile (p: (A) ⇒ Boolean): Buffer[A]

    Drops longest prefix of elements that satisfy a predicate.

    Drops longest prefix of elements that satisfy a predicate.

    p

      The predicate used to test elements.

    returns

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

    Definition Classes
      TraversableLike → GenTraversableLike

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

    Definition Classes
      SeqLike
    Annotations
      @bridge()

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

    Tests whether this buffer proxy ends with the given sequence.

    Tests whether this buffer proxy ends with the given sequence.

    that

      the sequence to test

    returns

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

    Definition Classes
      SeqLike → GenSeqLike

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

    Attributes
      final
    Definition Classes
      AnyRef

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

    The equality method for reference types.

    The equality method for reference types. See equals in Any.

    that

      the object to compare against this object for equality.

    returns

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

    Definition Classes
      Proxy → AnyRef → Any

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

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

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

    p

      the predicate used to test elements.

    returns

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

    Definition Classes
      IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

76. #### def filter (p: (A) ⇒ Boolean): Buffer[A]

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

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

    p

      the predicate used to test elements.

    returns

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

    Definition Classes
      TraversableLike → GenTraversableLike

77. #### def filterNot (p: (A) ⇒ Boolean): Buffer[A]

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

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

    p

      the predicate used to test elements.

    returns

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

    Definition Classes
      TraversableLike → GenTraversableLike

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

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

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

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

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

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

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

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

    p

      the predicate used to test elements.

    returns

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

    Definition Classes
      IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

80. #### def flatMap [B] (f: (A) ⇒ GenTraversableOnce[B]): BufferProxy[B]

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

    [use case]

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

    B

      the element type of the returned collection.

    f

      the function to apply to each element.

    returns

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

    Attributes
      abstract
    Definition Classes
      GenTraversableLike

81. #### def flatMap [B, That] (f: (A) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Buffer[A], B, That]): That

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

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

    B

      the element type of the returned collection.

    That

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

    f

      the function to apply to each element.

    bf

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

    returns

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

    Definition Classes
      TraversableLike → GenTraversableLike → FilterMonadic

82. #### def flatten [B] : BufferProxy[B]

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

    [use case]

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

    B

      the type of the elements of each traversable collection.

    returns

      a new buffer proxy resulting from concatenating all element buffer proxys.

    Attributes
      abstract
    Definition Classes
      GenericTraversableTemplate

83. #### def flatten [B] (implicit asTraversable: (A) ⇒ TraversableOnce[B]): Traversable[B]

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

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

    B

      the type of the elements of each traversable collection.

    asTraversable

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

    returns

      a new buffer proxy resulting from concatenating all element buffer proxys.

    Definition Classes
      Traversable → GenericTraversableTemplate
    Annotations
      @bridge()

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

    Folds the elements of this sequence using the specified associative binary operator.

    Folds the elements of this sequence using the specified associative binary operator. The order in which the elements are reduced is unspecified and may be nondeterministic.

    Note this method has a different signature than the `foldLeft` and `foldRight` methods of the trait `Traversable`. The result of folding may only be a supertype of this parallel collection's type parameter `T`.

    z

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

    op

      a binary operator that must be associative

    returns

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

    Definition Classes
      TraversableOnce → GenTraversableOnce

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

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

    Applies a binary operator to a start value and all elements of this buffer proxy, 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 buffer proxy, going left to right with the start value `z` on the left:

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

      where `x,,1,,, ..., x,,n,,` are the elements of this buffer proxy.

    Definition Classes
      TraversableOnce → GenTraversableOnce

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

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

    Applies a binary operator to all elements of this buffer proxy 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 buffer proxy, going right to left with the start value `z` on the right:

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

      where `x,,1,,, ..., x,,n,,` are the elements of this buffer proxy.

    Definition Classes
      IterableLike → TraversableOnce → GenTraversableOnce

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

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

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

    p

      the predicate used to test elements.

    returns

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

    Definition Classes
      IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

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

    [use case] Applies a function `f` to all elements of this buffer proxy.

    [use case]

    Applies a function `f` to all elements of this buffer proxy.

    f

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

    Attributes
      abstract
    Definition Classes
      IterableLike

89. #### def foreach [U] (f: (A) ⇒ U): Unit

    Applies a function `f` to all elements of this buffer proxy.

    Applies a function `f` to all elements of this buffer proxy.

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

    U

      the type parameter describing the result of function `f`. This result will always be ignored. Typically `U` is `Unit`, but this is not necessary.

    f

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

    Definition Classes
      IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic

90. #### def genericBuilder [B] : Builder[B, Buffer[B]]

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

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

    Definition Classes
      GenericTraversableTemplate

91. #### def getClass (): java.lang.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.

    Attributes
      final
    Definition Classes
      AnyRef → Any

92. #### def groupBy [K] (f: (A) ⇒ K): Map[K, Buffer[A]]

    Partitions this buffer proxy into a map of buffer proxys according to some discriminator function.

    Partitions this buffer proxy into a map of buffer proxys 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 buffer proxy.

    K

      the type of keys returned by the discriminator function.

    f

      the discriminator function.

    returns

      A map from keys to buffer proxys 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 buffer proxy of those elements `x` for which `f(x)` equals `k`.

    Definition Classes
      TraversableLike → GenTraversableLike

93. #### def grouped (size: Int): Iterator[Buffer[A]]

    Partitions elements in fixed size buffer proxys.

    Partitions elements in fixed size buffer proxys.

    size

      the number of elements per group

    returns

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

    Definition Classes
      IterableLike
    See also

      Iterator#grouped

94. #### def hasDefiniteSize : Boolean

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

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

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

    The hashCode method for reference types.

    The hashCode method for reference types. See hashCode in Any.

    returns

      the hash code value for this object.

    Definition Classes
      Proxy → AnyRef → Any

96. #### def head : A

    Selects the first element of this buffer proxy.

    Selects the first element of this buffer proxy.

    returns

      the first element of this buffer proxy.

    Definition Classes
      IterableLike → GenIterableLike → TraversableLike → GenTraversableLike

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

    Optionally selects the first element.

    Optionally selects the first element.

    returns

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

    Definition Classes
      TraversableLike

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

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

    [use case]

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

    Attributes
      abstract
    Definition Classes
      GenSeqLike

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

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

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

    B

      the type of the element `elem`.

    elem

      the element value to search for.

    from

      the start index

    returns

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

    Definition Classes
      GenSeqLike

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

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

     [use case]

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

     elem

       the element value to search for.

     returns

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

     Attributes
       abstract
     Definition Classes
       GenSeqLike

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

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

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

     B

       the type of the element `elem`.

     elem

       the element value to search for.

     returns

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

     Definition Classes
       GenSeqLike

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

     Definition Classes
       SeqLike
     Annotations
       @bridge()

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

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

     Finds first index after or at a start index where this buffer proxy 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 buffer proxy starting at this index match the elements of sequence `that`, or `-1` of no such subsequence exists.

     Definition Classes
       SeqLike

104. #### def indexOfSlice [B >: A] (that: Seq[B]): Int

     Definition Classes
       SeqLike
     Annotations
       @bridge()

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

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

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

     that

       the sequence to test

     returns

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

     Definition Classes
       SeqLike

106. #### 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 buffer proxy that satisfies the predicate `p`, or `-1`, if none exists.

     Definition Classes
       SeqLike → GenSeqLike

107. #### 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 buffer proxy that satisfies the predicate `p`, or `-1`, if none exists.

     Definition Classes
       GenSeqLike

108. #### def indices : Range

     Produces the range of all indices of this sequence.

     Produces the range of all indices of this sequence.

     returns

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

     Definition Classes
       SeqLike

109. #### def init : Buffer[A]

     Selects all elements except the last.

     Selects all elements except the last.

     returns

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

     Definition Classes
       TraversableLike

110. #### def inits : Iterator[Buffer[A]]

     Iterates over the inits of this buffer proxy.

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

     returns

       an iterator over all the inits of this buffer proxy

     Definition Classes
       TraversableLike
     Example:

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

111. #### def insert (n: Int, elems: 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 one. Instead, it will insert the new elements at index `n`.

     n

       the index where a new element will be inserted.

     elems

       the new elements to insert.

     Definition Classes
       BufferProxy → BufferLike

112. #### def insertAll (n: Int, iter: Traversable[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.

     Definition Classes
       BufferProxy → BufferLike

113. #### def insertAll (n: Int, iter: Iterable[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 one. Instead, it will insert a new element at index `n`.

     n

       the index where a new element will be inserted.

     iter

       the iterable object providing all elements to insert.

114. #### def intersect [B >: A] (that: Seq[B]): Buffer[A]

     Definition Classes
       SeqLike
     Annotations
       @bridge()

115. #### def intersect (that: Seq[A]): BufferProxy[A]

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

     [use case]

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

     that

       the sequence of elements to intersect with.

     returns

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

     Attributes
       abstract
     Definition Classes
       SeqLike

116. #### def intersect [B >: A] (that: GenSeq[B]): Buffer[A]

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

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

     B

       the element type of the returned buffer proxy.

     that

       the sequence of elements to intersect with.

     returns

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

     Definition Classes
       SeqLike → GenSeqLike

117. #### def isDefinedAt (idx: Int): Boolean

     Tests whether this buffer proxy contains given index.

     Tests whether this buffer proxy contains given index.

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

     idx

       the index to test

     returns

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

     Definition Classes
       GenSeqLike

118. #### def isEmpty : Boolean

     Tests whether the buffer proxy is empty.

     Tests whether the buffer proxy is empty.

     returns

       `true` if the buffer proxy contains no elements, `false` otherwise.

     Definition Classes
       IterableLike → GenIterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

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

     Attributes
       final
     Definition Classes
       Any

120. #### def isTraversableAgain : Boolean

     Tests whether this buffer proxy can be repeatedly traversed.

     Tests whether this buffer proxy can be repeatedly traversed.

     returns

       `true`

     Attributes
       final
     Definition Classes
       GenTraversableLike → GenTraversableOnce

121. #### 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
       BufferProxy → IterableLike → GenIterableLike

122. #### def last : A

     Selects the last element.

     Selects the last element.

     returns

       The last element of this buffer proxy.

     Definition Classes
       TraversableLike

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

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

     [use case]

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

     Attributes
       abstract
     Definition Classes
       GenSeqLike

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

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

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

     B

       the type of the element `elem`.

     elem

       the element value to search for.

     end

       the end index.

     returns

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

     Definition Classes
       GenSeqLike

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

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

     [use case]

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

     elem

       the element value to search for.

     returns

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

     Attributes
       abstract
     Definition Classes
       GenSeqLike

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

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

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

     B

       the type of the element `elem`.

     elem

       the element value to search for.

     returns

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

     Definition Classes
       GenSeqLike

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

     Definition Classes
       SeqLike
     Annotations
       @bridge()

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

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

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

     Definition Classes
       SeqLike

129. #### def lastIndexOfSlice [B >: A] (that: Seq[B]): Int

     Definition Classes
       SeqLike
     Annotations
       @bridge()

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

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

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

     that

       the sequence to test

     returns

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

     Definition Classes
       SeqLike

131. #### 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 buffer proxy that satisfies the predicate `p`, or `-1`, if none exists.

     Definition Classes
       SeqLike → GenSeqLike

132. #### 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 buffer proxy that satisfies the predicate `p`, or `-1`, if none exists.

     Definition Classes
       GenSeqLike

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

     Optionally selects the last element.

     Optionally selects the last element.

     returns

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

     Definition Classes
       TraversableLike

134. #### def length : Int

     The length of the buffer proxy.

     The length of the buffer proxy.

     Note: `xs.length` and `xs.size` yield the same result.

     returns

       the number of elements in this buffer proxy.

     Definition Classes
       BufferProxy → BufferLike → SeqLike → GenSeqLike

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

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

     Compares the length of this buffer proxy 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
       SeqLike

136. #### def lift : (Int) ⇒ Option[A]

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

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

     returns

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

     Definition Classes
       PartialFunction
     See also

       Function.unlift

137. #### def map [B] (f: (A) ⇒ B): BufferProxy[B]

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

     [use case]

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

     B

       the element type of the returned collection.

     f

       the function to apply to each element.

     returns

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

     Attributes
       abstract
     Definition Classes
       GenTraversableLike

138. #### def map [B, That] (f: (A) ⇒ B)(implicit bf: CanBuildFrom[Buffer[A], B, That]): That

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

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

     B

       the element type of the returned collection.

     That

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

     f

       the function to apply to each element.

     bf

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

     returns

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

     Definition Classes
       TraversableLike → GenTraversableLike → FilterMonadic

139. #### def max : A

     [use case] Finds the largest element.

     [use case]

     Finds the largest element.

     returns

       the largest element of this buffer proxy with respect to the ordering `cmp`.

     Attributes
       abstract
     Definition Classes
       GenTraversableOnce

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

     Finds the largest element.

     Finds the largest element.

     B

       The type over which the ordering is defined.

     cmp

       An ordering to be used for comparing elements.

     returns

       the largest element of this buffer proxy with respect to the ordering `cmp`.

     Definition Classes
       TraversableOnce → GenTraversableOnce

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

     Definition Classes
       TraversableOnce → GenTraversableOnce

142. #### def min : A

     [use case] Finds the smallest element.

     [use case]

     Finds the smallest element.

     returns

       the smallest element of this buffer proxy with respect to the ordering `cmp`.

     Attributes
       abstract
     Definition Classes
       GenTraversableOnce

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

     Finds the smallest element.

     Finds the smallest element.

     B

       The type over which the ordering is defined.

     cmp

       An ordering to be used for comparing elements.

     returns

       the smallest element of this buffer proxy with respect to the ordering `cmp`.

     Definition Classes
       TraversableOnce → GenTraversableOnce

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

     Definition Classes
       TraversableOnce → GenTraversableOnce

145. #### def mkString : String

     Displays all elements of this buffer proxy in a string.

     Displays all elements of this buffer proxy in a string.

     returns

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

     Definition Classes
       TraversableOnce → GenTraversableOnce

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

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

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

     sep

       the separator string.

     returns

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

     Definition Classes
       TraversableOnce → GenTraversableOnce
     Example:

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

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

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

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

     Definition Classes
       TraversableOnce → GenTraversableOnce
     Example:

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

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

     Attributes
       final
     Definition Classes
       AnyRef

149. #### def newBuilder : Builder[A, Buffer[A]]

     The builder that builds instances of type BufferProxy[A]

     The builder that builds instances of type BufferProxy[A]

     Attributes
       protected[this]
     Definition Classes
       GenericTraversableTemplate → HasNewBuilder

150. #### def nonEmpty : Boolean

     Tests whether the buffer proxy is not empty.

     Tests whether the buffer proxy is not empty.

     returns

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

     Definition Classes
       TraversableOnce → GenTraversableOnce

151. #### def notify (): Unit

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

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

     Attributes
       final
     Definition Classes
       AnyRef

152. #### def notifyAll (): Unit

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

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

     Attributes
       final
     Definition Classes
       AnyRef

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

154. #### def padTo (len: Int, elem: A): BufferProxy[A]

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

     [use case]

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

     len

       the target length

     elem

       the padding value

     returns

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

     Attributes
       abstract
     Definition Classes
       GenSeqLike

155. #### def padTo [B >: A, That] (len: Int, elem: B)(implicit bf: CanBuildFrom[Buffer[A], B, That]): That

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

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

     B

       the element type of the returned buffer proxy.

     That

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

     len

       the target length

     elem

       the padding value

     bf

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

     returns

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

     Definition Classes
       SeqLike → GenSeqLike

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

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

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

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

     returns

       a combiner for the parallel collection of type `ParRepr`

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

158. #### def partition (p: (A) ⇒ Boolean): (Buffer[A], Buffer[A])

     Partitions this buffer proxy in two buffer proxys according to a predicate.

     Partitions this buffer proxy in two buffer proxys according to a predicate.

     p

       the predicate on which to partition.

     returns

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

     Definition Classes
       TraversableLike → GenTraversableLike

159. #### def patch [B >: A, That] (from: Int, patch: Seq[B], replaced: Int)(implicit bf: CanBuildFrom[Buffer[A], B, That]): That

     Definition Classes
       SeqLike
     Annotations
       @bridge()

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

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

     [use case]

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

     from

       the index of the first replaced element

     replaced

       the number of elements to drop in the original buffer proxy

     returns

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

     Attributes
       abstract
     Definition Classes
       GenSeqLike

161. #### def patch [B >: A, That] (from: Int, patch: GenSeq[B], replaced: Int)(implicit bf: CanBuildFrom[Buffer[A], B, That]): That

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

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

     B

       the element type of the returned buffer proxy.

     That

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

     from

       the index of the first replaced element

     patch

       the replacement sequence

     replaced

       the number of elements to drop in the original buffer proxy

     bf

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

     returns

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

     Definition Classes
       SeqLike → GenSeqLike

162. #### def permutations : Iterator[Buffer[A]]

     Iterates over distinct permutations.

     Iterates over distinct permutations.

     returns

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

     Definition Classes
       SeqLike
     Example:

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

163. #### 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 buffer proxy such that every element of the segment satisfies the predicate `p`.

     Definition Classes
       GenSeqLike

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

     Prepend an element to this list.

     Prepend an element to this list.

     elems

       the elements to prepend.@param elem the element to prepend.

     Definition Classes
       BufferProxy → BufferLike

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

     Prepends a number of elements provided by a traversable object.

     Prepends a number of elements provided by a traversable object. The identity of the buffer is returned.

     xs

       the traversable object.

     Definition Classes
       BufferProxy → BufferLike

166. #### 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 of this buffer proxy with respect to the `*` operator in `num`.

     Attributes
       abstract
     Definition Classes
       GenTraversableOnce

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

     Multiplies up the elements of this collection.

     Multiplies up the elements of this collection.

     B

       the result type of the `*` operator.

     num

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

     returns

       the product of all elements of this buffer proxy with respect to the `*` operator in `num`.

     Definition Classes
       TraversableOnce → GenTraversableOnce

168. #### def readOnly : Seq[A]

     Provide a read-only view of this buffer as a sequence

     Provide a read-only view of this buffer as a sequence

     returns

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

     Definition Classes
       BufferProxy → BufferLike

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

     Reduces the elements of this sequence using the specified associative binary operator.

     Reduces the elements of this sequence using the specified associative binary operator.

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

     Note this method has a different signature than the `reduceLeft` and `reduceRight` methods of the trait `Traversable`. The result of reducing may only be a supertype of this parallel collection's type parameter `T`.

     op

       A binary operator that must be associative.

     returns

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

     Definition Classes
       TraversableOnce → GenTraversableOnce

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

     Definition Classes
       TraversableOnce

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

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

     Optionally applies a binary operator to all elements of this buffer proxy, 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 buffer proxy is nonempty, `None` otherwise.

     Definition Classes
       TraversableOnce → GenTraversableOnce

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

     Optionally reduces the elements of this sequence using the specified associative binary operator.

     Optionally reduces the elements of this sequence using the specified associative binary operator.

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

     Note this method has a different signature than the `reduceLeftOption` and `reduceRightOption` methods of the trait `Traversable`. The result of reducing may only be a supertype of this parallel collection's type parameter `T`.

     op

       A binary operator that must be associative.

     returns

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

     Definition Classes
       TraversableOnce → GenTraversableOnce

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

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

     Applies a binary operator to all elements of this buffer proxy, 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 buffer proxy, going right to left:

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

       where `x,,1,,, ..., x,,n,,` are the elements of this buffer proxy.

     Definition Classes
       IterableLike → TraversableOnce → GenTraversableOnce

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

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

     Optionally applies a binary operator to all elements of this buffer proxy, 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 buffer proxy is nonempty, `None` otherwise.

     Definition Classes
       TraversableOnce → GenTraversableOnce

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

     Removes the element on a given index position.

     Removes the element on a given index position.

     n

       the index which refers to the element to delete.

     returns

       the previous element at index `n`

     Definition Classes
       BufferProxy → BufferLike

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

     Removes a number of elements from a given index position.

     Removes a number of elements from a given index position.

     n

       the index which refers to the first element to remove.

     count

       the number of elements to remove.

     Definition Classes
       BufferLike

177. #### def repr : Buffer[A]

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

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

     Definition Classes
       TraversableLike → GenTraversableLike

178. #### def reverse : Buffer[A]

     Returns new buffer proxy wih elements in reversed order.

     Returns new buffer proxy wih elements in reversed order.

     returns

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

     Definition Classes
       SeqLike → GenSeqLike

179. #### 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 buffer proxy in reversed order

     Definition Classes
       SeqLike

180. #### def reverseMap [B] (f: (A) ⇒ B): BufferProxy[B]

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

     [use case]

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

     B

       the element type of the returned collection.

     f

       the function to apply to each element.

     returns

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

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

     Attributes
       abstract
     Definition Classes
       GenSeqLike

181. #### def reverseMap [B, That] (f: (A) ⇒ B)(implicit bf: CanBuildFrom[Buffer[A], B, That]): That

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

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

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

     B

       the element type of the returned collection.

     That

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

     f

       the function to apply to each element.

     bf

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

     returns

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

     Definition Classes
       SeqLike → GenSeqLike

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

     Attributes
       protected[this]
     Definition Classes
       TraversableOnce

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

     Definition Classes
       IterableLike
     Annotations
       @bridge()

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

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

     [use case]

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

     that

       the collection to compare with.

     returns

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

     Attributes
       abstract
     Definition Classes
       GenIterableLike

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

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

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

     B

       the type of the elements of collection `that`.

     that

       the collection to compare with.

     returns

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

     Definition Classes
       IterableLike → GenIterableLike

186. #### def scan [B >: A, That] (z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Buffer[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 buffer proxy containing the prefix scan of the elements in this buffer proxy

     Definition Classes
       TraversableLike → GenTraversableLike

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

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

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

     B

       the type of the elements in the resulting collection

     That

       the actual type of the resulting collection

     z

       the initial value

     op

       the binary operator applied to the intermediate result and the element

     bf

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

     returns

       collection with intermediate results

     Definition Classes
       TraversableLike → GenTraversableLike

188. #### def scanRight [B, That] (z: B)(op: (A, B) ⇒ B)(implicit bf: CanBuildFrom[Buffer[A], B, That]): That

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

     Produces a collection containing cummulative results of applying the operator going right to left. The head of the collection is the last cummulative result.

     Example:

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

     B

       the type of the elements in the resulting collection

     That

       the actual type of the resulting collection

     z

       the initial value

     op

       the binary operator applied to the intermediate result and the element

     bf

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

     returns

       collection with intermediate results

     Definition Classes
       TraversableLike → GenTraversableLike
     Annotations
       @migration
     Migration

       "This scanRight definition has changed in 2.9.\n" + "The previous behavior can be reproduced with scanRight.reverse."

189. #### 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 buffer proxy starting from index `from` such that every element of the segment satisfies the predicate `p`.

     Definition Classes
       SeqLike → GenSeqLike

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

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

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

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

     returns

       a sequential view of the collection.

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

191. #### def size : Int

     The size of this buffer proxy, equivalent to `length`.

     The size of this buffer proxy, equivalent to `length`.

     returns

       the number of elements in this buffer proxy.

     Definition Classes
       SeqLike → GenTraversableLike → TraversableOnce → GenTraversableOnce

192. #### def slice (from: Int, until: Int): Buffer[A]

     Selects an interval of elements.

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

            from <= indexOf(x) < until

     from

       the lowest index to include from this buffer proxy.

     until

       the highest index to EXCLUDE from this buffer proxy.

     returns

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

     Definition Classes
       IterableLike → TraversableLike → GenTraversableLike

193. #### def sliding [B >: A] (size: Int, step: Int): Iterator[Buffer[A]]

     Definition Classes
       IterableLike

194. #### def sliding [B >: A] (size: Int): Iterator[Buffer[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 buffer proxys of size `size`, except the last and the only element will be truncated if there are fewer elements than size.

     Definition Classes
       IterableLike
     See also

       Iterator#sliding

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

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

     Sorts this BufferProxy 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 buffer proxy consisting of the elements of this buffer proxy 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

196. #### def sortWith (lt: (A, A) ⇒ Boolean): Buffer[A]

     Sorts this buffer proxy according to a comparison function.

     Sorts this buffer proxy according to a comparison function.

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

     lt

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

     returns

       a buffer proxy consisting of the elements of this buffer proxy 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")

197. #### def sorted [B >: A] (implicit ord: Ordering[B]): Buffer[A]

     Sorts this buffer proxy according to an Ordering.

     Sorts this buffer proxy according to an Ordering.

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

     ord

       the ordering to be used to compare elements.

     returns

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

     Definition Classes
       SeqLike
     See also

       scala.math.Ordering

198. #### def span (p: (A) ⇒ Boolean): (Buffer[A], Buffer[A])

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

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

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

     p

       the test predicate

     returns

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

     Definition Classes
       TraversableLike → GenTraversableLike

199. #### def splitAt (n: Int): (Buffer[A], Buffer[A])

     Splits this buffer proxy into two at a given position.

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

     Definition Classes
       TraversableLike → GenTraversableLike

200. #### def startsWith [B] (that: Seq[B], offset: Int): Boolean

     Definition Classes
       SeqLike
     Annotations
       @bridge()

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

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

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

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

     that

       the sequence to test

     offset

       the index where the sequence is searched.

     returns

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

     Definition Classes
       SeqLike → GenSeqLike

202. #### def startsWith [B] (that: Seq[B]): Boolean

     Definition Classes
       GenSeqLike
     Annotations
       @bridge()

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

     Tests whether this buffer proxy starts with the given sequence.

     Tests whether this buffer proxy starts with the given sequence.

     that

       the sequence to test

     returns

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

     Definition Classes
       GenSeqLike

204. #### def stringPrefix : String

     Defines the prefix of this object's `toString` representation.

     Defines the prefix of this object's `toString` representation.

     returns

       a string representation which starts the result of `toString` applied to this set. Unless overridden this is simply `"Buffer"`.

     Definition Classes
       BufferLike → TraversableLike → GenTraversableLike

205. #### 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 of this buffer proxy with respect to the `+` operator in `num`.

     Attributes
       abstract
     Definition Classes
       GenTraversableOnce

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

     Sums up the elements of this collection.

     Sums up the elements of this collection.

     B

       the result type of the `+` operator.

     num

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

     returns

       the sum of all elements of this buffer proxy with respect to the `+` operator in `num`.

     Definition Classes
       TraversableOnce → GenTraversableOnce

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

     Attributes
       final
     Definition Classes
       AnyRef

208. #### def tail : Buffer[A]

     Selects all elements except the first.

     Selects all elements except the first.

     returns

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

     Definition Classes
       TraversableLike → GenTraversableLike

209. #### def tails : Iterator[Buffer[A]]

     Iterates over the tails of this buffer proxy.

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

     returns

       an iterator over all the tails of this buffer proxy

     Definition Classes
       TraversableLike
     Example:

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

210. #### def take (n: Int): Buffer[A]

     Selects first n elements.

     Selects first n elements.

     n

       Tt number of elements to take from this buffer proxy.

     returns

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

     Definition Classes
       IterableLike → TraversableLike → GenTraversableLike

211. #### def takeRight (n: Int): Buffer[A]

     Selects last n elements.

     Selects last n elements.

     n

       the number of elements to take

     returns

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

     Definition Classes
       IterableLike

212. #### def takeWhile (p: (A) ⇒ Boolean): Buffer[A]

     Takes longest prefix of elements that satisfy a predicate.

     Takes longest prefix of elements that satisfy a predicate.

     p

       The predicate used to test elements.

     returns

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

     Definition Classes
       IterableLike → TraversableLike → GenTraversableLike

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

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

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

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

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

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

     [use case]

     Converts this buffer proxy to an array.

     returns

       an array containing all elements of this buffer proxy.

     Attributes
       abstract
     Definition Classes
       GenTraversableOnce

215. #### def toArray [B >: A] (implicit arg0: ClassManifest[B]): Array[B]

     Converts this buffer proxy to an array.

     Converts this buffer proxy to an array.

     B

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

     returns

       an array containing all elements of this buffer proxy.

     Definition Classes
       TraversableOnce → GenTraversableOnce

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

     Converts this buffer proxy to a mutable buffer.

     Converts this buffer proxy to a mutable buffer.

     returns

       a buffer containing all elements of this buffer proxy.

     Definition Classes
       TraversableOnce → GenTraversableOnce

217. #### def toCollection (repr: Buffer[A]): Seq[A]

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

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

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

218. #### def toIndexedSeq [B >: A] : IndexedSeq[B]

     Converts this buffer proxy to an indexed sequence.

     Converts this buffer proxy to an indexed sequence.

     returns

       an indexed sequence containing all elements of this buffer proxy.

     Definition Classes
       TraversableOnce → GenTraversableOnce

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

     Converts this buffer proxy to an iterable collection.

     Converts this buffer proxy 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 buffer proxy.

     Definition Classes
       IterableLike → TraversableOnce → GenTraversableOnce

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

     Returns an Iterator over the elements in this buffer proxy.

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

     returns

       an Iterator containing all elements of this buffer proxy.

     Definition Classes
       TraversableLike → GenTraversableOnce

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

     Converts this buffer proxy to a list.

     Converts this buffer proxy to a list.

     returns

       a list containing all elements of this buffer proxy.

     Definition Classes
       TraversableOnce → GenTraversableOnce

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

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

     [use case]

     Converts this buffer proxy 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 containing all elements of this buffer proxy.

     Attributes
       abstract
     Definition Classes
       GenTraversableOnce

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

     Converts this buffer proxy to a map.

     Converts this buffer proxy 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 containing all elements of this buffer proxy.

     Definition Classes
       TraversableOnce → GenTraversableOnce

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

     Converts this buffer proxy to a sequence.

     Converts this buffer proxy to a sequence.

     Overridden for efficiency.

     returns

       a sequence containing all elements of this buffer proxy.

     Definition Classes
       SeqLike → GenSeqLike → TraversableOnce → GenTraversableOnce

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

     Converts this buffer proxy to a set.

     Converts this buffer proxy to a set.

     returns

       a set containing all elements of this buffer proxy.

     Definition Classes
       TraversableOnce → GenTraversableOnce

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

     Converts this buffer proxy to a stream.

     Converts this buffer proxy to a stream.

     returns

       a stream containing all elements of this buffer proxy.

     Definition Classes
       IterableLike → TraversableLike → GenTraversableOnce

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

     Creates a String representation of this object.

     Creates a String representation of this object. The default representation is platform dependent. On the java platform it is the concatenation of the class name, "@", and the object's hashcode in hexadecimal.

     returns

       a String representation of the object.

     Definition Classes
       Proxy → AnyRef → Any

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

     Converts this buffer proxy to an unspecified Traversable.

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

     returns

       a Traversable containing all elements of this buffer proxy.

     Definition Classes
       TraversableLike → TraversableOnce → GenTraversableOnce

229. #### def transform (f: (A) ⇒ A): BufferProxy.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

230. #### def transpose [B] (implicit asTraversable: (A) ⇒ TraversableOnce[B]): Traversable[Traversable[B]]

     Transposes this buffer proxy of traversable collections into a buffer proxy of buffer proxys.

     Transposes this buffer proxy of traversable collections into a buffer proxy of buffer proxys.

     B

       the type of the elements of each traversable collection.

     asTraversable

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

     returns

       a two-dimensional buffer proxy of buffer proxys which has as nth row the nth column of this buffer proxy.

     Definition Classes
       Traversable → GenericTraversableTemplate
     Annotations
       @bridge()

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

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

233. #### def union (that: Seq[A]): BufferProxy[A]

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

     [use case]

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

     that

       the sequence to add.

     returns

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

     Attributes
       abstract
     Definition Classes
       SeqLike

234. #### def union [B >: A, That] (that: GenSeq[B])(implicit bf: CanBuildFrom[Buffer[A], B, That]): That

     Produces a new sequence which contains all elements of this buffer proxy and also all elements of a given sequence.

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

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

     B

       the element type of the returned buffer proxy.

     That

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

     that

       the sequence to add.

     bf

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

     returns

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

     Definition Classes
       SeqLike → GenSeqLike

235. #### def union [B >: A, That] (that: Seq[B])(implicit bf: CanBuildFrom[Buffer[A], B, That]): That

     Definition Classes
       GenSeqLike
     Annotations
       @bridge()

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

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

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

     asPair

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

     returns

       a pair buffer proxys, containing the first, respectively second half of each element pair of this buffer proxy.

     Definition Classes
       GenericTraversableTemplate

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

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

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

     returns

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

     Definition Classes
       GenericTraversableTemplate

238. #### def update (n: Int, newelem: A): Unit

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

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

     n

       the index of the element to replace.

     newelem

       the new element.

     Definition Classes
       BufferProxy → BufferLike → SeqLike

239. #### def updated (index: Int, elem: A): BufferProxy[A]

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

     [use case]

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

     index

       the position of the replacement

     elem

       the replacing element

     returns

       a new buffer proxy`which is a copy of this buffer proxy with the element at position` index`replaced by` elem`.`

     Attributes
       abstract
     Definition Classes
       GenSeqLike

240. #### def updated [B >: A, That] (index: Int, elem: B)(implicit bf: CanBuildFrom[Buffer[A], B, That]): That

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

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

     B

       the element type of the returned buffer proxy.

     That

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

     index

       the position of the replacement

     elem

       the replacing element

     bf

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

     returns

       a new buffer proxy`which is a copy of this buffer proxy with the element at position` index`replaced by` elem`.`

     Definition Classes
       SeqLike → GenSeqLike

241. #### def view (from: Int, until: Int): SeqView[A, Buffer[A]]

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

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

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

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

     Definition Classes
       SeqLike → IterableLike → TraversableLike

242. #### def view : SeqView[A, Buffer[A]]

     Creates a non-strict view of this buffer proxy.

     Creates a non-strict view of this buffer proxy.

     returns

       a non-strict view of this buffer proxy.

     Definition Classes
       SeqLike → IterableLike → TraversableLike

243. #### def wait (): Unit

     Attributes
       final
     Definition Classes
       AnyRef
     Annotations
       @throws()

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

     Attributes
       final
     Definition Classes
       AnyRef
     Annotations
       @throws()

245. #### def wait (arg0: Long): Unit

     Attributes
       final
     Definition Classes
       AnyRef
     Annotations
       @throws()

246. #### def withFilter (p: (A) ⇒ Boolean): FilterMonadic[A, Buffer[A]]

     Creates a non-strict filter of this buffer proxy.

     Creates a non-strict filter of this buffer proxy.

     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 buffer proxy which satisfy the predicate `p`.

     Definition Classes
       TraversableLike → FilterMonadic

247. #### def zip [A1 >: A, B, That] (that: Iterable[B])(implicit bf: CanBuildFrom[Buffer[A], (A1, B), That]): That

     Definition Classes
       IterableLike
     Annotations
       @bridge()

248. #### def zip [B] (that: GenIterable[B]): BufferProxy[(A, B)]

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

     [use case]

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

     Attributes
       abstract
     Definition Classes
       GenIterableLike

249. #### def zip [A1 >: A, B, That] (that: GenIterable[B])(implicit bf: CanBuildFrom[Buffer[A], (A1, B), That]): That

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

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

     A1

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

     B

       the type of the second half of the returned pairs

     That

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

     that

       The iterable providing the second half of each result pair

     bf

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

     returns

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

     Definition Classes
       IterableLike → GenIterableLike

250. #### def zipAll [B, A1 >: A, That] (that: Iterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[Buffer[A], (A1, B), That]): That

     Definition Classes
       IterableLike
     Annotations
       @bridge()

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

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

     [use case]

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

     that

       the iterable providing the second half of each result pair

     thisElem

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

     thatElem

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

     returns

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

     Attributes
       abstract
     Definition Classes
       GenIterableLike

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

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

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

     that

       the iterable providing the second half of each result pair

     thisElem

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

     thatElem

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

     returns

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

     Definition Classes
       IterableLike → GenIterableLike

253. #### def zipWithIndex : BufferProxy[(A, Int)]

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

     [use case]

     Zips this buffer proxy with its indices.

     returns

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

     Attributes
       abstract
     Definition Classes
       GenIterableLike

254. #### def zipWithIndex [A1 >: A, That] (implicit bf: CanBuildFrom[Buffer[A], (A1, Int), That]): That

     Zips this buffer proxy with its indices.

     Zips this buffer proxy with its indices.

     A1

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

     That

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

     returns

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

     Definition Classes
       IterableLike → GenIterableLike

### Deprecated Value Members

1. #### def + (elem: A): Buffer[A]

   Append a single element to this buffer and return the identity of the buffer.

   Append a single element to this buffer and return the identity of the buffer.

   elem

     the element to append.

   returns

     the updated buffer.

   Definition Classes
     BufferProxy → BufferLike
   Annotations
     @deprecated
   Deprecated

     "Use += instead if you intend to add by side effect to an existing collection.\012".+("Use `clone() ++=\' if you intend to create a new collection.")`

2. #### def + (elem1: A, elem2: A, elems: A*): Buffer[A]

   Adds two or more elements to this collection and returns the collection itself.

   Adds two or more elements to this collection and returns the collection itself.

   Note that for backward compatibility reasons, this method mutates the collection in place, unlike similar but undeprecated methods throughout the collections hierarchy. You are strongly recommended to use '++=' instead.

   elem1

     the first element to add.

   elem2

     the second element to add.

   elems

     the remaining elements to add.

   Definition Classes
     BufferLike
   Annotations
     @deprecated
   Deprecated

     "Use ++= instead if you intend to add by side effect to an existing collection.\012".+("Use `clone() ++=\' if you intend to create a new collection.")`

3. #### def ++ (xs: GenTraversableOnce[A]): Buffer[A]

   Appends a number of elements provided by a traversable object via its `foreach` method.

   Appends a number of elements provided by a traversable object via its `foreach` method. The identity of the buffer is returned.

   xs

     the traversable object.

   returns

     the updated buffer.

   Definition Classes
     BufferProxy → BufferLike
   Annotations
     @deprecated
   Deprecated

     "Use ++= instead if you intend to add by side effect to an existing collection.\012".+("Use `clone() ++=` if you intend to create a new collection.")

4. #### def ++= (src: Array[A], start: Int, len: Int): Unit

   Adds a number of elements in an array

   Adds a number of elements in an array

   src

     the array

   start

     the first element to append

   len

     the number of elements to append

   Definition Classes
     BufferLike
   Annotations
     @deprecated
   Deprecated

     replace by: `buf ++= src.view(start, end)`

5. #### def elements : Iterator[A]

   Definition Classes
     IterableLike
   Annotations
     @deprecated
   Deprecated

     use `iterator' instead`

6. #### def equalsWith [B] (that: Seq[B])(f: (A, B) ⇒ Boolean): Boolean

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

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

   B

     the type of the elements of `that`

   that

     the other sequence

   returns

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

   Definition Classes
     SeqLike
   Annotations
     @deprecated
   Deprecated

     use `corresponds` instead

7. #### def findIndexOf (p: (A) ⇒ Boolean): Int

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

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

   Definition Classes
     SeqLike
   Annotations
     @deprecated
   Deprecated

     Use indexWhere(p) instead.

8. #### def findLastIndexOf (p: (A) ⇒ Boolean): Int

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

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

   Definition Classes
     SeqLike
   Annotations
     @deprecated
   Deprecated

     use `lastIndexWhere` instead

9. #### def first : A

   Definition Classes
     IterableLike
   Annotations
     @deprecated
   Deprecated

     use `head' instead`

10. #### def firstOption : Option[A]

    `None` if iterable is empty.

    `None` if iterable is empty.

    Definition Classes
      IterableLike
    Annotations
      @deprecated
    Deprecated

      use `headOption' instead`

11. #### def projection : SeqView[A, Buffer[A]]

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

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

    Definition Classes
      SeqLike → IterableLike
    Annotations
      @deprecated
    Deprecated

      use `view' instead`

12. #### def reversedElements : Iterator[A]

    Definition Classes
      SeqLike
    Annotations
      @deprecated
    Deprecated

      use `reverseIterator' instead`

### Inherited from Proxy

### Inherited from Buffer[A]

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

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

### Inherited from Scriptable[A]

### Inherited from Shrinkable[A]

### Inherited from Growable[A]

### Inherited from Seq[A]

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

### Inherited from Cloneable[Buffer[A]]

### Inherited from Seq[A]

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

### Inherited from GenSeq[A]

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

### Inherited from PartialFunction[Int, A]

### Inherited from (Int) ⇒ A

### Inherited from Iterable[A]

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

### Inherited from Equals

### Inherited from GenIterable[A]

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

### Inherited from Traversable[A]

### Inherited from Mutable

### Inherited from Traversable[A]

### Inherited from GenTraversable[A]

### Inherited from GenericTraversableTemplate[A, Buffer]

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

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

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

### Inherited from TraversableOnce[A]

### Inherited from GenTraversableOnce[A]

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

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

### Inherited from AnyRef

### Inherited from Any