SynchronizedBuffer

Type Members

type Self = Buffer[A]

The type implementing this traversable
The type implementing this traversable

Attributes
protected[this]
Definition Classes
TraversableLike
class WithFilter extends FilterMonadic[A, Repr]

A class supporting filtered operations.

Value Members

final def !=(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def !=(arg0: Any): Boolean

Definition Classes
Any
final def ##(): Int

Definition Classes
AnyRef → Any
def +(other: String): String

Implicit information
This member is added by an implicit conversion from SynchronizedBuffer[A] to StringAdd[SynchronizedBuffer[A]] performed by method StringAdd in scala.Predef.
Definition Classes
StringAdd
def ++(xs: GenTraversableOnce[A]): Self

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
a new collection consisting of all the elements of this collection and xs.

Definition Classes
SynchronizedBuffer → BufferLike
def ++[B](that: GenTraversableOnce[B]): SynchronizedBuffer[B]

[use case] Returns a new synchronized buffer containing the elements from the left hand operand followed by the elements from the right hand operand.
[use case]
Returns a new synchronized buffer containing the elements from the left hand operand followed by the elements from the right hand operand. The element type of the synchronized buffer is the most specific superclass encompassing the element types of the two operands.
Example:
```
scala> val a = LinkedList(1)
a: scala.collection.mutable.LinkedList[Int] = LinkedList(1)

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

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

scala> val d = LinkedList('a')
d: scala.collection.mutable.LinkedList[Char] = LinkedList(a)

scala> val e = c ++ d
e: scala.collection.mutable.LinkedList[AnyVal] = LinkedList(1, 2, a)
```
B
the element type of the returned collection.
that
the traversable to append.
returns
a new synchronized buffer which contains all elements of this synchronized buffer followed by all elements of that.

Definition Classes
TraversableLike → GenTraversableLike
Full Signature
def ++[B >: A, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Buffer[A], B, That]): That
def ++:[B >: A, That](that: collection.Traversable[B])(implicit bf: CanBuildFrom[Buffer[A], B, That]): That

As with ++, returns a new collection containing the elements from the left operand followed by the elements from the right operand.
As with ++, returns a new collection containing the elements from the left operand followed by the elements from the right operand.
It differs from ++ in that the right operand determines the type of the resulting collection rather than the left one. Mnemonic: the COLon is on the side of the new COLlection type.
Example:
```
scala> val x = List(1)
x: List[Int] = List(1)

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

scala> val z = x ++: y
z: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2)
```
This overload exists because: for the implementation of ++: we should reuse that of ++ because many collections override it with more efficient versions.
Since TraversableOnce has no ++ method, we have to implement that directly, but Traversable and down can use the overload.
B
the element type of the returned collection.
That
the class of the returned collection. 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 synchronized buffer followed by all elements of that.

Definition Classes
TraversableLike
def ++:[B](that: TraversableOnce[B]): SynchronizedBuffer[B]

[use case] As with ++, returns a new collection containing the elements from the left operand followed by the elements from the right operand.
[use case]
As with ++, returns a new collection containing the elements from the left operand followed by the elements from the right operand.
It differs from ++ in that the right operand determines the type of the resulting collection rather than the left one. Mnemonic: the COLon is on the side of the new COLlection type.
Example:
```
scala> val x = List(1)
x: List[Int] = List(1)

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

scala> val z = x ++: y
z: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2)
```
B
the element type of the returned collection.
that
the traversable to append.
returns
a new synchronized buffer which contains all elements of this synchronized buffer followed by all elements of that.

Definition Classes
TraversableLike
Full Signature
def ++:[B >: A, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Buffer[A], B, That]): That
def ++=(xs: TraversableOnce[A]): SynchronizedBuffer.this.type

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.
xs
the iterable object.
returns
the synchronized buffer itself.

Definition Classes
SynchronizedBuffer → Growable
def ++=:(xs: TraversableOnce[A]): SynchronizedBuffer.this.type

Prepends a number of elements provided by a traversable object via its foreach method.
Prepends 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 buffer itself.

Definition Classes
SynchronizedBuffer → BufferLike
def +:(elem: A): SynchronizedBuffer[A]

[use case] A copy of the synchronized buffer with an element prepended.
[use case]
A copy of the synchronized buffer with an element prepended.
Note that :-ending operators are right associative (see example). A mnemonic for +: vs. :+ is: the COLon goes on the COLlection side.
Also, the original synchronized buffer is not modified, so you will want to capture the result.
Example:
```
scala> val x = LinkedList(1)
x: scala.collection.mutable.LinkedList[Int] = LinkedList(1)

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

scala> println(x)
LinkedList(1)
```
elem
the prepended element
returns
a new synchronized buffer consisting of elem followed by all elements of this synchronized buffer.

Definition Classes
SeqLike → GenSeqLike
Full Signature
def +:[B >: A, That](elem: B)(implicit bf: CanBuildFrom[Buffer[A], B, That]): That
def +=(elem: A): SynchronizedBuffer.this.type

Append a single element to this buffer.
Append a single element to this buffer.
elem
the element to append.
returns
the synchronized buffer itself

Definition Classes
SynchronizedBuffer → BufferLike → Growable
def +=(elem1: A, elem2: A, elems: A*): SynchronizedBuffer.this.type

Appends two or more elements to this synchronized buffer.
Appends two or more elements to this synchronized buffer.
elem1
the first element to append.
elem2
the second element to append.
elems
the remaining elements to append.
returns
the synchronized buffer itself

Definition Classes
Growable
def +=:(elem: A): SynchronizedBuffer.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
the buffer itself.

Definition Classes
SynchronizedBuffer → BufferLike
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
(Changed in version 2.8.0) - creates a new buffer. Use -= to remove an element from this buffer and return that buffer itself.
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
(Changed in version 2.8.0) - creates a new buffer. Use -= to remove an element from this buffer and return that buffer itself.
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
(Changed in version 2.8.0) -- creates a new buffer. Use --= to remove an element from this buffer and return that buffer itself.
def --=(xs: TraversableOnce[A]): SynchronizedBuffer.this.type

Removes all elements produced by an iterator from this synchronized buffer.
Removes all elements produced by an iterator from this synchronized buffer.
xs
the iterator producing the elements to remove.
returns
the synchronized buffer itself

Definition Classes
Shrinkable
def -=(x: A): SynchronizedBuffer.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
def -=(elem1: A, elem2: A, elems: A*): SynchronizedBuffer.this.type

Removes two or more elements from this synchronized buffer.
Removes two or more elements from this synchronized buffer.
elem1
the first element to remove.
elem2
the second element to remove.
elems
the remaining elements to remove.
returns
the synchronized buffer itself

Definition Classes
Shrinkable
def ->[B](y: B): (SynchronizedBuffer[A], B)

Implicit information
This member is added by an implicit conversion from SynchronizedBuffer[A] to ArrowAssoc[SynchronizedBuffer[A]] performed by method ArrowAssoc in scala.Predef.
Definition Classes
ArrowAssoc
Annotations
@inline()
def /:[B](z: B)(op: (B, A) ⇒ B): B

Applies a binary operator to a start value and all elements of this synchronized buffer, going left to right.
Applies a binary operator to a start value and all elements of this synchronized buffer, going left to right.
Note: /: is alternate syntax for foldLeft; z /: xs is the same as xs foldLeft z.
Examples:
Note that the folding function used to compute b is equivalent to that used to compute c.
```
scala> val a = LinkedList(1,2,3,4)
a: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2, 3, 4)

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

scala> val c = (5 /: a)((x,y) => x + y)
c: Int = 15
```
B
the result type of the binary operator.
z
the start value.
op
the binary operator.
returns
the result of inserting op between consecutive elements of this synchronized buffer, going left to right with the start value z on the left:
```
op(...op(op(z, x_1), x_2), ..., x_n)
```
where x₁, ..., x_n are the elements of this synchronized buffer.
Definition Classes
TraversableOnce → GenTraversableOnce
def :+(elem: A): SynchronizedBuffer[A]

[use case] A copy of this synchronized buffer with an element appended.
[use case]
A copy of this synchronized buffer with an element appended.
A mnemonic for +: vs. :+ is: the COLon goes on the COLlection side.
Example:
```
scala> import scala.collection.mutable.LinkedList
import scala.collection.mutable.LinkedList

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

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

scala> println(a)
LinkedList(1)
```
elem
the appended element
returns
a new synchronized buffer consisting of all elements of this synchronized buffer followed by elem.

Definition Classes
SeqLike → GenSeqLike
Full Signature
def :+[B >: A, That](elem: B)(implicit bf: CanBuildFrom[Buffer[A], B, That]): That
def :\[B](z: B)(op: (A, B) ⇒ B): B

Applies a binary operator to all elements of this synchronized buffer and a start value, going right to left.
Applies a binary operator to all elements of this synchronized buffer and a start value, going right to left.
Note: :\ is alternate syntax for foldRight; xs :\ z is the same as xs foldRight z.
Examples:
Note that the folding function used to compute b is equivalent to that used to compute c.
```
scala> val a = LinkedList(1,2,3,4)
a: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2, 3, 4)

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

scala> val c = (a :\ 5)((x,y) => x + y)
c: Int = 15
```
B
the result type of the binary operator.
z
the start value
op
the binary operator
returns
the result of inserting op between consecutive elements of this synchronized buffer, going right to left with the start value z on the right:
```
op(x_1, op(x_2, ... op(x_n, z)...))
```
where x₁, ..., x_n are the elements of this synchronized buffer.
Definition Classes
TraversableOnce → GenTraversableOnce
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
SynchronizedBuffer → BufferLike → Scriptable
final def ==(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def ==(arg0: Any): Boolean

Definition Classes
Any
def addString(b: scala.StringBuilder): scala.StringBuilder

Appends all elements of this synchronized buffer to a string builder.
Appends all elements of this synchronized buffer to a string builder. The written text consists of the string representations (w.r.t. the method toString) of all elements of this synchronized buffer without any separator string.
Example:
```
scala> val a = LinkedList(1,2,3,4)
a: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2, 3, 4)

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

scala> val h = a.addString(b)
b: StringBuilder = 1234
```
b
the string builder to which elements are appended.
returns
the string builder b to which elements were appended.

Definition Classes
TraversableOnce
def addString(b: scala.StringBuilder, sep: String): scala.StringBuilder

Appends all elements of this synchronized buffer to a string builder using a separator string.
Appends all elements of this synchronized buffer to a string builder using a separator string. The written text consists of the string representations (w.r.t. the method toString) of all elements of this synchronized buffer, separated by the string sep.
Example:
```
scala> val a = LinkedList(1,2,3,4)
a: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2, 3, 4)

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

scala> a.addString(b, ", ")
res0: StringBuilder = 1, 2, 3, 4
```
b
the string builder to which elements are appended.
sep
the separator string.
returns
the string builder b to which elements were appended.

Definition Classes
TraversableOnce
def addString(b: scala.StringBuilder, start: String, sep: String, end: String): scala.StringBuilder

Appends all elements of this synchronized buffer to a string builder using start, end, and separator strings.
Appends all elements of this synchronized buffer to a string builder using start, end, and separator strings. The written text begins with the string start and ends with the string end. Inside, the string representations (w.r.t. the method toString) of all elements of this synchronized buffer are separated by the string sep.
Example:
```
scala> val a = LinkedList(1,2,3,4)
a: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2, 3, 4)

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

scala> a.addString(b, "LinkedList(", ", ", ")")
res1: StringBuilder = LinkedList(1, 2, 3, 4)
```
b
the string builder to which elements are appended.
start
the starting string.
sep
the separator string.
end
the ending string.
returns
the string builder b to which elements were appended.

Definition Classes
TraversableOnce
def aggregate[B](z: ⇒ B)(seqop: (B, A) ⇒ B, combop: (B, B) ⇒ B): B

Aggregates the results of applying an operator to subsequent elements.
Aggregates the results of applying an operator to subsequent elements.
This is a more general form of fold and reduce. It has similar semantics, but does not require the result to be a supertype of the element type. It traverses the elements in different partitions sequentially, using seqop to update the result, and then applies combop to results from different partitions. The implementation of this operation may operate on an arbitrary number of collection partitions, so combop may be invoked an arbitrary number of times.
For example, one might want to process some elements and then produce a Set. In this case, seqop would process an element and append it to the list, while combop would concatenate two lists from different partitions together. The initial value z would be an empty set.
```
pc.aggregate(Set[Int]())(_ += process(_), _ ++ _)
```
Another example is calculating geometric mean from a collection of doubles (one would typically require big doubles for this).
B
the type of accumulated results
z
the initial value for the accumulated result of the partition - this will typically be the neutral element for the seqop operator (e.g. Nil for list concatenation or 0 for summation) and may be evaluated more than once
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
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
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
SynchronizedBuffer → BufferLike
def appendAll(xs: TraversableOnce[A]): Unit

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.
xs
the traversable object.

Definition Classes
SynchronizedBuffer → BufferLike
def apply(n: Int): A

Selects an element by its index in the synchronized buffer.
Selects an element by its index in the synchronized buffer.
Example:
```
scala> val x = LinkedList(1, 2, 3, 4, 5)
x: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2, 3, 4, 5)

scala> x(3)
res1: Int = 4
```
returns
the element of this synchronized buffer at index idx, where 0 indicates the first element.

Definition Classes
SynchronizedBuffer → BufferLike → SeqLike → GenSeqLike → Function1
Exceptions thrown
`IndexOutOfBoundsException`
if idx does not satisfy 0 <= idx < length.
def applyOrElse[A1 <: Int, B1 >: A](x: A1, default: (A1) ⇒ B1): B1

Applies this partial function to the given argument when it is contained in the function domain.
Applies this partial function to the given argument when it is contained in the function domain. Applies fallback function where this partial function is not defined.
Note that expression pf.applyOrElse(x, default) is equivalent to
```
if(pf isDefinedAt x) pf(x) else default(x)
```
except that applyOrElse method can be implemented more efficiently. For all partial function literals compiler generates applyOrElse implementation which avoids double evaluation of pattern matchers and guards. This makes applyOrElse the basis for the efficient implementation for many operations and scenarios, such as:
- combining partial functions into orElse/andThen chains does not lead to excessive apply/isDefinedAt evaluation
- lift and unlift do not evaluate source functions twice on each invocation
- runWith allows efficient imperative-style combining of partial functions with conditionally applied actions
For non-literal partial function classes with nontrivial isDefinedAt method it is recommended to override applyOrElse with custom implementation that avoids double isDefinedAt evaluation. This may result in better performance and more predictable behavior w.r.t. side effects.
x
the function argument
default
the fallback function
returns
the result of this function or fallback function application.

Definition Classes
PartialFunction
Since
2.10
final def asInstanceOf[T0]: T0

Definition Classes
Any
def asParIterable: ParIterable[A]

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

Implicit information
This member is added by an implicit conversion from SynchronizedBuffer[A] to TraversableOps[A] performed by method traversable2ops in scala.collection.parallel.
Definition Classes
TraversableOps
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 synchronized buffer should be compared
returns
true, if this synchronized buffer can possibly equal that, false otherwise. The test takes into consideration only the run-time types of objects but ignores their elements.

Definition Classes
IterableLike → Equals
def clear(): Unit

Clears the buffer contents.
Clears the buffer contents.

Definition Classes
SynchronizedBuffer → BufferLike → Growable → Clearable
def clone(): Self

Return a clone of this buffer.
Return a clone of this buffer.
returns
an ArrayBuffer with the same elements.

Definition Classes
SynchronizedBuffer → BufferLike → Cloneable → AnyRef
def collect[B](pf: PartialFunction[A, B]): SynchronizedBuffer[B]

[use case] Builds a new collection by applying a partial function to all elements of this synchronized buffer on which the function is defined.
[use case]
Builds a new collection by applying a partial function to all elements of this synchronized buffer on which the function is defined.
B
the element type of the returned collection.
pf
the partial function which filters and maps the synchronized buffer.
returns
a new synchronized buffer resulting from applying the given partial function pf to each element on which it is defined and collecting the results. The order of the elements is preserved.

Definition Classes
TraversableLike → GenTraversableLike
Full Signature
def collect[B, That](pf: PartialFunction[A, B])(implicit bf: CanBuildFrom[Buffer[A], B, That]): That
def collectFirst[B](pf: PartialFunction[A, B]): Option[B]

Finds the first element of the synchronized buffer for which the given partial function is defined, and applies the partial function to it.
Finds the first element of the synchronized buffer for which the given partial function is defined, and applies the partial function to it.
pf
the partial function
returns
an option value containing pf applied to the first value for which it is defined, or None if none exists.
Definition Classes
TraversableOnce
Example:
1. Seq("a", 1, 5L).collectFirst({ case x: Int => x*10 }) = Some(10)
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 synchronized buffer.
Definition Classes
SeqLike
Example:
1. "abbbc".combinations(2) = Iterator(ab, ac, bb, bc)
def companion: GenericCompanion[Buffer]

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

Definition Classes
Buffer → Seq → Seq → GenSeq → Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → GenericTraversableTemplate
def compose[A](g: (A) ⇒ Int): (A) ⇒ A

Composes two instances of Function1 in a new Function1, with this function applied last.
Composes two instances of Function1 in a new Function1, with this function applied last.
A
the type to which function g can be applied
g
a function A => T1
returns
a new function f such that f(x) == apply(g(x))

Definition Classes
Function1
Annotations
@unspecialized()
def contains[A1 >: A](elem: A1): Boolean

Tests whether this synchronized buffer contains a given value as an element.
Tests whether this synchronized buffer contains a given value as an element.
elem
the element to test.
returns
true if this synchronized buffer has an element that is equal (as determined by ==) to elem, false otherwise.

Definition Classes
SeqLike
def containsSlice[B](that: GenSeq[B]): Boolean

Tests whether this synchronized buffer contains a given sequence as a slice.
Tests whether this synchronized buffer contains a given sequence as a slice.
that
the sequence to test
returns
true if this synchronized buffer contains a slice with the same elements as that, otherwise false.

Definition Classes
SeqLike
def copyToArray(xs: Array[A], start: Int, len: Int): Unit

[use case] Copies elements of this synchronized buffer to an array.
[use case]
Copies elements of this synchronized buffer to an array. Fills the given array xs with at most len elements of this synchronized buffer, starting at position start. Copying will stop once either the end of the current synchronized buffer is reached, or the end of the array is reached, or len elements have been copied.
xs
the array to fill.
start
the starting index.
len
the maximal number of elements to copy.

Definition Classes
IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
Full Signature
def copyToArray[B >: A](xs: Array[B], start: Int, len: Int): Unit
def copyToArray(xs: Array[A]): Unit

[use case] Copies values of this synchronized buffer to an array.
[use case]
Copies values of this synchronized buffer to an array. Fills the given array xs with values of this synchronized buffer. Copying will stop once either the end of the current synchronized buffer is reached, or the end of the array is reached.
xs
the array to fill.

Definition Classes
TraversableOnce → GenTraversableOnce
Full Signature
def copyToArray[B >: A](xs: Array[B]): Unit
def copyToArray(xs: Array[A], start: Int): Unit

[use case] Copies values of this synchronized buffer to an array.
[use case]
Copies values of this synchronized buffer to an array. Fills the given array xs with values of this synchronized buffer, beginning at index start. Copying will stop once either the end of the current synchronized buffer is reached, or the end of the array is reached.
xs
the array to fill.
start
the starting index.

Definition Classes
TraversableOnce → GenTraversableOnce
Full Signature
def copyToArray[B >: A](xs: Array[B], start: Int): Unit
def copyToBuffer[B >: A](dest: Buffer[B]): Unit

Copies all elements of this synchronized buffer to a buffer.
Copies all elements of this synchronized buffer to a buffer.
dest
The buffer to which elements are copied.

Definition Classes
TraversableOnce
def corresponds[B](that: GenSeq[B])(p: (A, B) ⇒ Boolean): Boolean

Tests whether every element of this synchronized buffer relates to the corresponding element of another sequence by satisfying a test predicate.
Tests whether every element of this synchronized buffer relates to the corresponding element of another sequence by satisfying a test predicate.
B
the type of the elements of that
that
the other sequence
p
the test predicate, which relates elements from both sequences
returns
true if both sequences have the same length and p(x, y) is true for all corresponding elements x of this synchronized buffer and y of that, otherwise false.

Definition Classes
SeqLike → GenSeqLike
def count(p: (A) ⇒ Boolean): Int

Counts the number of elements in the synchronized buffer which satisfy a predicate.
Counts the number of elements in the synchronized buffer which satisfy a predicate.
p
the predicate used to test elements.
returns
the number of elements satisfying the predicate p.

Definition Classes
TraversableOnce → GenTraversableOnce
def diff(that: collection.Seq[A]): SynchronizedBuffer[A]

[use case] Computes the multiset difference between this synchronized buffer and another sequence.
[use case]
Computes the multiset difference between this synchronized buffer and another sequence.
that
the sequence of elements to remove
returns
a new synchronized buffer which contains all elements of this synchronized buffer except some of occurrences of elements that also appear in that. If an element value x appears n times in that, then the first n occurrences of x will not form part of the result, but any following occurrences will.

Definition Classes
SeqLike → GenSeqLike
Full Signature
def diff[B >: A](that: GenSeq[B]): Buffer[A]
def distinct: Buffer[A]

Builds a new synchronized buffer from this synchronized buffer without any duplicate elements.
Builds a new synchronized buffer from this synchronized buffer without any duplicate elements.
returns
A new synchronized buffer which contains the first occurrence of every element of this synchronized buffer.

Definition Classes
SeqLike → GenSeqLike
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 synchronized buffer.
returns
a synchronized buffer consisting of all elements of this synchronized buffer except the first n ones, or else the empty synchronized buffer, if this synchronized buffer has less than n elements.

Definition Classes
IterableLike → TraversableLike → GenTraversableLike
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 synchronized buffer consisting of all elements of this synchronized buffer except the last n ones, or else the empty synchronized buffer, if this synchronized buffer has less than n elements.

Definition Classes
IterableLike
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.
returns
the longest suffix of this synchronized buffer whose first element does not satisfy the predicate p.

Definition Classes
TraversableLike → GenTraversableLike
def endsWith[B](that: GenSeq[B]): Boolean

Tests whether this synchronized buffer ends with the given sequence.
Tests whether this synchronized buffer ends with the given sequence.
that
the sequence to test
returns
true if this synchronized buffer has that as a suffix, false otherwise.

Definition Classes
SeqLike → GenSeqLike
def ensuring(cond: (SynchronizedBuffer[A]) ⇒ Boolean, msg: ⇒ Any): SynchronizedBuffer[A]

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

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

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

Implicit information
This member is added by an implicit conversion from SynchronizedBuffer[A] to Ensuring[SynchronizedBuffer[A]] performed by method Ensuring in scala.Predef.
Definition Classes
Ensuring
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(that: Any): Boolean

The equals method for arbitrary sequences.
The equals method for arbitrary sequences. Compares this sequence to some other object.
that
The object to compare the sequence to
returns
true if that is a sequence that has the same elements as this sequence in the same order, false otherwise

Definition Classes
GenSeqLike → Equals → Any
def exists(p: (A) ⇒ Boolean): Boolean

Tests whether a predicate holds for some of the elements of this synchronized buffer.
Tests whether a predicate holds for some of the elements of this synchronized buffer.
p
the predicate used to test elements.
returns
true if the given predicate p holds for some of the elements of this synchronized buffer, otherwise false.

Definition Classes
IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
def filter(p: (A) ⇒ Boolean): Buffer[A]

Selects all elements of this synchronized buffer which satisfy a predicate.
Selects all elements of this synchronized buffer which satisfy a predicate.
p
the predicate used to test elements.
returns
a new synchronized buffer consisting of all elements of this synchronized buffer that satisfy the given predicate p. The order of the elements is preserved.

Definition Classes
TraversableLike → GenTraversableLike
def filterNot(p: (A) ⇒ Boolean): Buffer[A]

Selects all elements of this synchronized buffer which do not satisfy a predicate.
Selects all elements of this synchronized buffer which do not satisfy a predicate.
p
the predicate used to test elements.
returns
a new synchronized buffer consisting of all elements of this synchronized buffer that do not satisfy the given predicate p. The order of the elements is preserved.

Definition Classes
TraversableLike → GenTraversableLike
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws()
def find(p: (A) ⇒ Boolean): Option[A]

Finds the first element of the synchronized buffer satisfying a predicate, if any.
Finds the first element of the synchronized buffer satisfying a predicate, if any.
p
the predicate used to test elements.
returns
an option value containing the first element in the synchronized buffer that satisfies p, or None if none exists.

Definition Classes
IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
def flatMap[B](f: (A) ⇒ GenTraversableOnce[B]): SynchronizedBuffer[B]

[use case] Builds a new collection by applying a function to all elements of this synchronized buffer and using the elements of the resulting collections.
[use case]
Builds a new collection by applying a function to all elements of this synchronized buffer and using the elements of the resulting collections.
For example:
```
def getWords(lines: Seq[String]): Seq[String] = lines flatMap (line => line split "\\W+")
```
The type of the resulting collection is guided by the static type of synchronized buffer. This might cause unexpected results sometimes. For example:
```
// lettersOf will return a Seq[Char] of likely repeated letters, instead of a Set
def lettersOf(words: Seq[String]) = words flatMap (word => word.toSet)

// lettersOf will return a Set[Char], not a Seq
def lettersOf(words: Seq[String]) = words.toSet flatMap (word => word.toSeq)

// xs will be an Iterable[Int]
val xs = Map("a" -> List(11,111), "b" -> List(22,222)).flatMap(_._2)

// ys will be a Map[Int, Int]
val ys = Map("a" -> List(1 -> 11,1 -> 111), "b" -> List(2 -> 22,2 -> 222)).flatMap(_._2)
```
B
the element type of the returned collection.
f
the function to apply to each element.
returns
a new synchronized buffer resulting from applying the given collection-valued function f to each element of this synchronized buffer and concatenating the results.

Definition Classes
TraversableLike → GenTraversableLike → FilterMonadic
Full Signature
def flatMap[B, That](f: (A) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Buffer[A], B, That]): That
def flatten[B]: SynchronizedBuffer[B]

[use case] Converts this synchronized buffer of traversable collections into a synchronized buffer formed by the elements of these traversable collections.
[use case]
Converts this synchronized buffer of traversable collections into a synchronized buffer formed by the elements of these traversable collections.
The resulting collection's type will be guided by the static type of synchronized buffer. For example:
```
val xs = List(Set(1, 2, 3), Set(1, 2, 3))
// xs == List(1, 2, 3, 1, 2, 3)

val ys = Set(List(1, 2, 3), List(3, 2, 1))
// ys == Set(1, 2, 3)
```
B
the type of the elements of each traversable collection.
returns
a new synchronized buffer resulting from concatenating all element synchronized buffers.

Definition Classes
GenericTraversableTemplate
Full Signature
def flatten[B](implicit asTraversable: (A) ⇒ GenTraversableOnce[B]): Buffer[B]
def fold[A1 >: A](z: A1)(op: (A1, A1) ⇒ A1): A1

Folds the elements of this synchronized buffer using the specified associative binary operator.
Folds the elements of this synchronized buffer using the specified associative binary operator.
The order in which operations are performed on elements is unspecified and may be nondeterministic.
A1
a type parameter for the binary operator, a supertype of A.
z
a neutral element for the fold operation; may be added to the result an arbitrary number of times, and must not change the result (e.g., Nil for list concatenation, 0 for addition, or 1 for multiplication.)
op
a binary operator that must be associative
returns
the result of applying fold operator op between all the elements and z

Definition Classes
TraversableOnce → GenTraversableOnce
def foldLeft[B](z: B)(op: (B, A) ⇒ B): B

Applies a binary operator to a start value and all elements of this synchronized buffer, going left to right.
Applies a binary operator to a start value and all elements of this synchronized buffer, going left to right.
B
the result type of the binary operator.
z
the start value.
op
the binary operator.
returns
the result of inserting op between consecutive elements of this synchronized buffer, going left to right with the start value z on the left:
```
op(...op(z, x_1), x_2, ..., x_n)
```
where x₁, ..., x_n are the elements of this synchronized buffer.
Definition Classes
TraversableOnce → GenTraversableOnce
def foldRight[B](z: B)(op: (A, B) ⇒ B): B

Applies a binary operator to all elements of this synchronized buffer and a start value, going right to left.
Applies a binary operator to all elements of this synchronized buffer and a start value, going right to left.
B
the result type of the binary operator.
z
the start value.
op
the binary operator.
returns
the result of inserting op between consecutive elements of this synchronized buffer, going right to left with the start value z on the right:
```
op(x_1, op(x_2, ... op(x_n, z)...))
```
where x₁, ..., x_n are the elements of this synchronized buffer.
Definition Classes
IterableLike → TraversableOnce → GenTraversableOnce
def forall(p: (A) ⇒ Boolean): Boolean

Tests whether a predicate holds for all elements of this synchronized buffer.
Tests whether a predicate holds for all elements of this synchronized buffer.
p
the predicate used to test elements.
returns
true if the given predicate p holds for all elements of this synchronized buffer, otherwise false.

Definition Classes
IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
def foreach(f: (A) ⇒ Unit): Unit

[use case] Applies a function f to all elements of this synchronized buffer.
[use case]
Applies a function f to all elements of this synchronized buffer.
Note: this method underlies the implementation of most other bulk operations. Subclasses should re-implement this method if a more efficient implementation exists.
f
the function that is applied for its side-effect to every element. The result of function f is discarded.

Definition Classes
IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
Full Signature
def foreach[U](f: (A) ⇒ U): Unit
def formatted(fmtstr: String): String

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

Implicit information
This member is added by an implicit conversion from SynchronizedBuffer[A] to StringFormat[SynchronizedBuffer[A]] performed by method StringFormat in scala.Predef.
Definition Classes
StringFormat
Annotations
@inline()
def genericBuilder[B]: Builder[B, Buffer[B]]

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

Definition Classes
GenericTraversableTemplate
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def groupBy[K](f: (A) ⇒ K): immutable.Map[K, Buffer[A]]

Partitions this synchronized buffer into a map of synchronized buffers according to some discriminator function.
Partitions this synchronized buffer into a map of synchronized buffers according to some discriminator function.
Note: this method is not re-implemented by views. This means when applied to a view it will always force the view and return a new synchronized buffer.
K
the type of keys returned by the discriminator function.
f
the discriminator function.
returns
A map from keys to synchronized buffers such that the following invariant holds:
```
(xs partition f)(k) = xs filter (x => f(x) == k)
```
That is, every key k is bound to a synchronized buffer of those elements x for which f(x) equals k.
Definition Classes
TraversableLike → GenTraversableLike
def grouped(size: Int): Iterator[Buffer[A]]

Partitions elements in fixed size synchronized buffers.
Partitions elements in fixed size synchronized buffers.
size
the number of elements per group
returns
An iterator producing synchronized buffers of size size, except the last will be truncated if the elements don't divide evenly.

Definition Classes
IterableLike
See also
scala.collection.Iterator, method grouped
def hasDefiniteSize: Boolean

Tests whether this synchronized buffer is known to have a finite size.
Tests whether this synchronized buffer is known to have a finite size. All strict collections are known to have finite size. For a non-strict collection such as Stream, the predicate returns true if all elements have been computed. It returns false if the stream is not yet evaluated to the end.
Note: many collection methods will not work on collections of infinite sizes.
returns
true if this collection is known to have finite size, false otherwise.

Definition Classes
TraversableLike → TraversableOnce → GenTraversableOnce
def hashCode(): Int

The hashCode method always yields an error, since it is not safe to use buffers as keys in hash tables.
The hashCode method always yields an error, since it is not safe to use buffers as keys in hash tables.
returns
never.

Definition Classes
SynchronizedBuffer → GenSeqLike → AnyRef → Any
def head: A

Selects the first element of this synchronized buffer.
Selects the first element of this synchronized buffer.
returns
the first element of this synchronized buffer.

Definition Classes
IterableLike → TraversableLike → GenTraversableLike
Exceptions thrown
`NoSuchElementException`
if the synchronized buffer is empty.
def headOption: Option[A]

Optionally selects the first element.
Optionally selects the first element.
returns
the first element of this synchronized buffer if it is nonempty, None if it is empty.

Definition Classes
TraversableLike → GenTraversableLike
def ifParSeq[R](isbody: (ParSeq[A]) ⇒ R): (TraversableOps[A])#Otherwise[R]

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

[use case] Finds index of first occurrence of some value in this synchronized buffer after or at some start index.
[use case]
Finds index of first occurrence of some value in this synchronized buffer after or at some start index.
elem
the element value to search for.
from
the start index
returns
the index >= from of the first element of this synchronized buffer that is equal (as determined by ==) to elem, or -1, if none exists.

Definition Classes
GenSeqLike
Full Signature
def indexOf[B >: A](elem: B, from: Int): Int
def indexOf(elem: A): Int

[use case] Finds index of first occurrence of some value in this synchronized buffer.
[use case]
Finds index of first occurrence of some value in this synchronized buffer.
elem
the element value to search for.
returns
the index of the first element of this synchronized buffer that is equal (as determined by ==) to elem, or -1, if none exists.

Definition Classes
GenSeqLike
Full Signature
def indexOf[B >: A](elem: B): Int
def indexOfSlice[B >: A](that: GenSeq[B], from: Int): Int

Finds first index after or at a start index where this synchronized buffer contains a given sequence as a slice.
Finds first index after or at a start index where this synchronized buffer contains a given sequence as a slice.
that
the sequence to test
from
the start index
returns
the first index >= from such that the elements of this synchronized buffer starting at this index match the elements of sequence that, or -1 of no such subsequence exists.

Definition Classes
SeqLike
def indexOfSlice[B >: A](that: GenSeq[B]): Int

Finds first index where this synchronized buffer contains a given sequence as a slice.
Finds first index where this synchronized buffer contains a given sequence as a slice.
that
the sequence to test
returns
the first index such that the elements of this synchronized buffer starting at this index match the elements of sequence that, or -1 of no such subsequence exists.

Definition Classes
SeqLike
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 synchronized buffer that satisfies the predicate p, or -1, if none exists.

Definition Classes
SeqLike → GenSeqLike
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 synchronized buffer that satisfies the predicate p, or -1, if none exists.

Definition Classes
GenSeqLike
def indices: immutable.Range

Produces the range of all indices of this sequence.
Produces the range of all indices of this sequence.
returns
a Range value from 0 to one less than the length of this synchronized buffer.

Definition Classes
SeqLike
def init: Buffer[A]

Selects all elements except the last.
Selects all elements except the last.
returns
a synchronized buffer consisting of all elements of this synchronized buffer except the last one.

Definition Classes
TraversableLike → GenTraversableLike
Exceptions thrown
`UnsupportedOperationException`
if the synchronized buffer is empty.
def inits: Iterator[Buffer[A]]

Iterates over the inits of this synchronized buffer.
Iterates over the inits of this synchronized buffer. The first value will be this synchronized buffer and the final one will be an empty synchronized buffer, with the intervening values the results of successive applications of init.
returns
an iterator over all the inits of this synchronized buffer
Definition Classes
TraversableLike
Example:
1. List(1,2,3).inits = Iterator(List(1,2,3), List(1,2), List(1), Nil)
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
SynchronizedBuffer → BufferLike
def insertAll(n: Int, xs: collection.Traversable[A]): Unit

Inserts new elements at the index n.
Inserts new elements at the index n. Opposed to method update, this method will not replace an element with a one. Instead, it will insert a new element at index n.
n
the index where a new element will be inserted.
xs
the traversable object providing all elements to insert.

Definition Classes
SynchronizedBuffer → BufferLike
def intersect(that: collection.Seq[A]): SynchronizedBuffer[A]

[use case] Computes the multiset intersection between this synchronized buffer and another sequence.
[use case]
Computes the multiset intersection between this synchronized buffer and another sequence.
that
the sequence of elements to intersect with.
returns
a new synchronized buffer which contains all elements of this synchronized buffer which also appear in that. If an element value x appears n times in that, then the first n occurrences of x will be retained in the result, but any following occurrences will be omitted.

Definition Classes
SeqLike → GenSeqLike
Full Signature
def intersect[B >: A](that: GenSeq[B]): Buffer[A]
def isDefinedAt(idx: Int): Boolean

Tests whether this synchronized buffer contains given index.
Tests whether this synchronized buffer 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 synchronized buffer contains an element at position idx, false otherwise.

Definition Classes
GenSeqLike
def isEmpty: Boolean

Tests whether this synchronized buffer is empty.
Tests whether this synchronized buffer is empty.
returns
true if the synchronized buffer contain no elements, false otherwise.

Definition Classes
SeqLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
def isParIterable: Boolean

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

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

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

Tests whether this synchronized buffer can be repeatedly traversed.
Tests whether this synchronized buffer can be repeatedly traversed.
returns
true

Definition Classes
TraversableLike → GenTraversableLike → GenTraversableOnce
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
SynchronizedBuffer → IterableLike → GenIterableLike
def last: A

Selects the last element.
Selects the last element.
returns
The last element of this synchronized buffer.

Definition Classes
TraversableLike → GenTraversableLike
Exceptions thrown
NoSuchElementException
If the synchronized buffer is empty.
def lastIndexOf(elem: A, end: Int): Int

[use case] Finds index of last occurrence of some value in this synchronized buffer before or at a given end index.
[use case]
Finds index of last occurrence of some value in this synchronized buffer before or at a given end index.
elem
the element value to search for.
end
the end index.
returns
the index <= end of the last element of this synchronized buffer that is equal (as determined by ==) to elem, or -1, if none exists.

Definition Classes
GenSeqLike
Full Signature
def lastIndexOf[B >: A](elem: B, end: Int): Int
def lastIndexOf(elem: A): Int

[use case] Finds index of last occurrence of some value in this synchronized buffer.
[use case]
Finds index of last occurrence of some value in this synchronized buffer.
elem
the element value to search for.
returns
the index of the last element of this synchronized buffer that is equal (as determined by ==) to elem, or -1, if none exists.

Definition Classes
GenSeqLike
Full Signature
def lastIndexOf[B >: A](elem: B): Int
def lastIndexOfSlice[B >: A](that: GenSeq[B], end: Int): Int

Finds last index before or at a given end index where this synchronized buffer contains a given sequence as a slice.
Finds last index before or at a given end index where this synchronized buffer contains a given sequence as a slice.
that
the sequence to test
end
the end index
returns
the last index <= end such that the elements of this synchronized buffer starting at this index match the elements of sequence that, or -1 of no such subsequence exists.

Definition Classes
SeqLike
def lastIndexOfSlice[B >: A](that: GenSeq[B]): Int

Finds last index where this synchronized buffer contains a given sequence as a slice.
Finds last index where this synchronized buffer contains a given sequence as a slice.
that
the sequence to test
returns
the last index such that the elements of this synchronized buffer starting a this index match the elements of sequence that, or -1 of no such subsequence exists.

Definition Classes
SeqLike
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 synchronized buffer that satisfies the predicate p, or -1, if none exists.

Definition Classes
SeqLike → GenSeqLike
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 synchronized buffer that satisfies the predicate p, or -1, if none exists.

Definition Classes
GenSeqLike
def lastOption: Option[A]

Optionally selects the last element.
Optionally selects the last element.
returns
the last element of this synchronized buffer$ if it is nonempty, None if it is empty.

Definition Classes
TraversableLike → GenTraversableLike
def length: Int

The length of the synchronized buffer.
The length of the synchronized buffer.
Note: xs.length and xs.size yield the same result.
returns
the number of elements in this synchronized buffer.

Definition Classes
SynchronizedBuffer → BufferLike → SeqLike → GenSeqLike
def lengthCompare(len: Int): Int

Compares the length of this synchronized buffer to a test value.
Compares the length of this synchronized buffer to a test value.
len
the test value that gets compared with the length.
returns
A value x where
```
x <  0       if this.length <  len
x == 0       if this.length == len
x >  0       if this.length >  len
```
The method as implemented here does not call length directly; its running time is O(length min len) instead of O(length). The method should be overwritten if computing length is cheap.
Definition Classes
SeqLike
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
def map[B](f: (A) ⇒ B): SynchronizedBuffer[B]

[use case] Builds a new collection by applying a function to all elements of this synchronized buffer.
[use case]
Builds a new collection by applying a function to all elements of this synchronized buffer.
B
the element type of the returned collection.
f
the function to apply to each element.
returns
a new synchronized buffer resulting from applying the given function f to each element of this synchronized buffer and collecting the results.

Definition Classes
TraversableLike → GenTraversableLike → FilterMonadic
Full Signature
def map[B, That](f: (A) ⇒ B)(implicit bf: CanBuildFrom[Buffer[A], B, That]): That
def max: A

[use case] Finds the largest element.
[use case]
Finds the largest element.
returns
the largest element of this synchronized buffer.

Definition Classes
TraversableOnce → GenTraversableOnce
Full Signature
def max[B >: A](implicit cmp: Ordering[B]): A
def maxBy[B](f: (A) ⇒ B)(implicit cmp: Ordering[B]): A

Definition Classes
TraversableOnce → GenTraversableOnce
def min: A

[use case] Finds the smallest element.
[use case]
Finds the smallest element.
returns
the smallest element of this synchronized buffer

Definition Classes
TraversableOnce → GenTraversableOnce
Full Signature
def min[B >: A](implicit cmp: Ordering[B]): A
def minBy[B](f: (A) ⇒ B)(implicit cmp: Ordering[B]): A

Definition Classes
TraversableOnce → GenTraversableOnce
def mkString: String

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

Definition Classes
TraversableOnce → GenTraversableOnce
def mkString(sep: String): String

Displays all elements of this synchronized buffer in a string using a separator string.
Displays all elements of this synchronized buffer in a string using a separator string.
sep
the separator string.
returns
a string representation of this synchronized buffer. In the resulting string the string representations (w.r.t. the method toString) of all elements of this synchronized buffer are separated by the string sep.
Definition Classes
TraversableOnce → GenTraversableOnce
Example:
1. List(1, 2, 3).mkString("|") = "1|2|3"
def mkString(start: String, sep: String, end: String): String

Displays all elements of this synchronized buffer in a string using start, end, and separator strings.
Displays all elements of this synchronized buffer in a string using start, end, and separator strings.
start
the starting string.
sep
the separator string.
end
the ending string.
returns
a string representation of this synchronized buffer. The resulting string begins with the string start and ends with the string end. Inside, the string representations (w.r.t. the method toString) of all elements of this synchronized buffer are separated by the string sep.
Definition Classes
TraversableOnce → GenTraversableOnce
Example:
1. List(1, 2, 3).mkString("(", "; ", ")") = "(1; 2; 3)"
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def newBuilder: Builder[A, Buffer[A]]

The builder that builds instances of type SynchronizedBuffer[A]
The builder that builds instances of type SynchronizedBuffer[A]

Attributes
protected[this]
Definition Classes
GenericTraversableTemplate → HasNewBuilder
def nonEmpty: Boolean

Tests whether the synchronized buffer is not empty.
Tests whether the synchronized buffer is not empty.
returns
true if the synchronized buffer contains at least one element, false otherwise.

Definition Classes
TraversableOnce → GenTraversableOnce
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
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
def padTo(len: Int, elem: A): SynchronizedBuffer[A]

[use case] A copy of this synchronized buffer with an element value appended until a given target length is reached.
[use case]
A copy of this synchronized buffer with an element value appended until a given target length is reached.
len
the target length
elem
the padding value
returns
a new synchronized buffer consisting of all elements of this synchronized buffer followed by the minimal number of occurrences of elem so that the resulting synchronized buffer has a length of at least len.

Definition Classes
SeqLike → GenSeqLike
Full Signature
def padTo[B >: A, That](len: Int, elem: B)(implicit bf: CanBuildFrom[Buffer[A], B, That]): That
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
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
def partition(p: (A) ⇒ Boolean): (Buffer[A], Buffer[A])

Partitions this synchronized buffer in two synchronized buffers according to a predicate.
Partitions this synchronized buffer in two synchronized buffers according to a predicate.
p
the predicate on which to partition.
returns
a pair of synchronized buffers: the first synchronized buffer consists of all elements that satisfy the predicate p and the second synchronized buffer consists of all elements that don't. The relative order of the elements in the resulting synchronized buffers is the same as in the original synchronized buffer.

Definition Classes
TraversableLike → GenTraversableLike
def patch(from: Int, that: GenSeq[A], replaced: Int): SynchronizedBuffer[A]

[use case] Produces a new synchronized buffer where a slice of elements in this synchronized buffer is replaced by another sequence.
[use case]
Produces a new synchronized buffer where a slice of elements in this synchronized buffer is replaced by another sequence.
from
the index of the first replaced element
replaced
the number of elements to drop in the original synchronized buffer
returns
a new synchronized buffer consisting of all elements of this synchronized buffer except that replaced elements starting from from are replaced by patch.

Definition Classes
SeqLike → GenSeqLike
Full Signature
def patch[B >: A, That](from: Int, patch: GenSeq[B], replaced: Int)(implicit bf: CanBuildFrom[Buffer[A], B, That]): That
def permutations: Iterator[Buffer[A]]

Iterates over distinct permutations.
Iterates over distinct permutations.
returns
An Iterator which traverses the distinct permutations of this synchronized buffer.
Definition Classes
SeqLike
Example:
1. "abb".permutations = Iterator(abb, bab, bba)
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 synchronized buffer such that every element of the segment satisfies the predicate p.

Definition Classes
GenSeqLike
def prepend(elems: A*): Unit

Prepend an element to this list.
Prepend an element to this list.
elems
the elements to prepend.

Definition Classes
SynchronizedBuffer → BufferLike
def prependAll(xs: TraversableOnce[A]): Unit

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

Definition Classes
SynchronizedBuffer → BufferLike
def product: A

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

Definition Classes
TraversableOnce → GenTraversableOnce
Full Signature
def product[B >: A](implicit num: Numeric[B]): B
def readOnly: collection.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
BufferLike
def reduce[A1 >: A](op: (A1, A1) ⇒ A1): A1

Reduces the elements of this synchronized buffer using the specified associative binary operator.
Reduces the elements of this synchronized buffer using the specified associative binary operator.
The order in which operations are performed on elements is unspecified and may be nondeterministic.
A1
A type parameter for the binary operator, a supertype of A.
op
A binary operator that must be associative.
returns
The result of applying reduce operator op between all the elements if the synchronized buffer is nonempty.

Definition Classes
TraversableOnce → GenTraversableOnce
Exceptions thrown
UnsupportedOperationException
if this synchronized buffer is empty.
def reduceLeft[B >: A](op: (B, A) ⇒ B): B

Applies a binary operator to all elements of this synchronized buffer, going left to right.
Applies a binary operator to all elements of this synchronized buffer, going left to right.
B
the result type of the binary operator.
op
the binary operator.
returns
the result of inserting op between consecutive elements of this synchronized buffer, going left to right:
```
op( op( ... op(x_1, x_2) ..., x_{n-1}), x_n)
```
where x₁, ..., x_n are the elements of this synchronized buffer.
Definition Classes
TraversableOnce
Exceptions thrown
`UnsupportedOperationException`
if this synchronized buffer is empty.
def reduceLeftOption[B >: A](op: (B, A) ⇒ B): Option[B]

Optionally applies a binary operator to all elements of this synchronized buffer, going left to right.
Optionally applies a binary operator to all elements of this synchronized buffer, going left to right.
B
the result type of the binary operator.
op
the binary operator.
returns
an option value containing the result of reduceLeft(op) is this synchronized buffer is nonempty, None otherwise.

Definition Classes
TraversableOnce → GenTraversableOnce
def reduceOption[A1 >: A](op: (A1, A1) ⇒ A1): Option[A1]

Reduces the elements of this synchronized buffer, if any, using the specified associative binary operator.
Reduces the elements of this synchronized buffer, if any, using the specified associative binary operator.
The order in which operations are performed on elements is unspecified and may be nondeterministic.
A1
A type parameter for the binary operator, a supertype of A.
op
A binary operator that must be associative.
returns
An option value containing result of applying reduce operator op between all the elements if the collection is nonempty, and None otherwise.

Definition Classes
TraversableOnce → GenTraversableOnce
def reduceRight[B >: A](op: (A, B) ⇒ B): B

Applies a binary operator to all elements of this synchronized buffer, going right to left.
Applies a binary operator to all elements of this synchronized buffer, going right to left.
B
the result type of the binary operator.
op
the binary operator.
returns
the result of inserting op between consecutive elements of this synchronized buffer, going right to left:
```
op(x_1, op(x_2, ..., op(x_{n-1}, x_n)...))
```
where x₁, ..., x_n are the elements of this synchronized buffer.
Definition Classes
IterableLike → TraversableOnce → GenTraversableOnce
Exceptions thrown
`UnsupportedOperationException`
if this synchronized buffer is empty.
def reduceRightOption[B >: A](op: (A, B) ⇒ B): Option[B]

Optionally applies a binary operator to all elements of this synchronized buffer, going right to left.
Optionally applies a binary operator to all elements of this synchronized buffer, going right to left.
B
the result type of the binary operator.
op
the binary operator.
returns
an option value containing the result of reduceRight(op) is this synchronized buffer is nonempty, None otherwise.

Definition Classes
TraversableOnce → GenTraversableOnce
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
SynchronizedBuffer → BufferLike
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
Exceptions thrown
IllegalArgumentException
if count < 0.
IndexOutOfBoundsException
if the index n is not in the valid range 0 <= n <= length - count.
def repr: Buffer[A]

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

Definition Classes
TraversableLike → GenTraversableLike
def reverse: Buffer[A]

Returns new synchronized buffer wih elements in reversed order.
Returns new synchronized buffer wih elements in reversed order.
returns
A new synchronized buffer with all elements of this synchronized buffer in reversed order.

Definition Classes
SeqLike → GenSeqLike
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 synchronized buffer in reversed order

Definition Classes
SeqLike
def reverseMap[B](f: (A) ⇒ B): SynchronizedBuffer[B]

[use case] Builds a new collection by applying a function to all elements of this synchronized buffer and collecting the results in reversed order.
[use case]
Builds a new collection by applying a function to all elements of this synchronized buffer and collecting the results in reversed order.
Note: xs.reverseMap(f) is the same as xs.reverse.map(f) but might be more efficient.
B
the element type of the returned collection.
f
the function to apply to each element.
returns
a new synchronized buffer resulting from applying the given function f to each element of this synchronized buffer and collecting the results in reversed order.

Definition Classes
SeqLike → GenSeqLike
Full Signature
def reverseMap[B, That](f: (A) ⇒ B)(implicit bf: CanBuildFrom[Buffer[A], B, That]): That
def reversed: List[A]

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

Composes this partial function with an action function which gets applied to results of this partial function.
Composes this partial function with an action function which gets applied to results of this partial function. The action function is invoked only for its side effects; its result is ignored.
Note that expression pf.runWith(action)(x) is equivalent to
```
if(pf isDefinedAt x) { action(pf(x)); true } else false
```
except that runWith is implemented via applyOrElse and thus potentially more efficient. Using runWith avoids double evaluation of pattern matchers and guards for partial function literals.
action
the action function
returns
a function which maps arguments x to isDefinedAt(x). The resulting function runs action(this(x)) where this is defined.

Definition Classes
PartialFunction
Since
2.10
See also
applyOrElse.
def sameElements(that: GenIterable[A]): Boolean

[use case] Checks if the other iterable collection contains the same elements in the same order as this synchronized buffer.
[use case]
Checks if the other iterable collection contains the same elements in the same order as this synchronized buffer.
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
Full Signature
def sameElements[B >: A](that: GenIterable[B]): Boolean
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 synchronized buffer containing the prefix scan of the elements in this synchronized buffer

Definition Classes
TraversableLike → GenTraversableLike
def scanLeft[B, That](z: B)(op: (B, A) ⇒ B)(implicit bf: CanBuildFrom[Buffer[A], B, That]): That

Produces a collection containing cumulative results of applying the operator going left to right.
Produces a collection containing cumulative results of applying the operator going left to right.
B
the type of the elements in the resulting collection
That
the actual type of the resulting collection
z
the initial value
op
the binary operator applied to the intermediate result and the element
bf
an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type B.
returns
collection with intermediate results

Definition Classes
TraversableLike → GenTraversableLike
def scanRight[B, That](z: B)(op: (A, B) ⇒ B)(implicit bf: CanBuildFrom[Buffer[A], B, That]): That

Produces a collection containing cumulative results of applying the operator going right to left.
Produces a collection containing cumulative results of applying the operator going right to left. The head of the collection is the last cumulative result.
Example:
```
List(1, 2, 3, 4).scanRight(0)(_ + _) == List(10, 9, 7, 4, 0)
```
B
the type of the elements in the resulting collection
That
the actual type of the resulting collection
z
the initial value
op
the binary operator applied to the intermediate result and the element
bf
an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type B.
returns
collection with intermediate results

Definition Classes
TraversableLike → GenTraversableLike
Annotations
@migration
Migration
(Changed in version 2.9.0) The behavior of scanRight has changed. The previous behavior can be reproduced with scanRight.reverse.
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 synchronized buffer starting from index from such that every element of the segment satisfies the predicate p.

Definition Classes
SeqLike → GenSeqLike
def seq: Seq[A]

A version of this collection with all of the operations implemented sequentially (i.
A version of this collection with all of the operations implemented sequentially (i.e. in a single-threaded manner).
This method returns a reference to this collection. In parallel collections, it is redefined to return a sequential implementation of this collection. In both cases, it has O(1) complexity.
returns
a sequential view of the collection.

Definition Classes
Seq → Seq → GenSeq → GenSeqLike → Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
def size: Int

The size of this synchronized buffer, equivalent to length.
The size of this synchronized buffer, equivalent to length.
returns
the number of elements in this synchronized buffer.

Definition Classes
SeqLike → GenTraversableLike → TraversableOnce → GenTraversableOnce
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
```
returns
a synchronized buffer containing the elements greater than or equal to index from extending up to (but not including) index until of this synchronized buffer.

Definition Classes
IterableLike → TraversableLike → GenTraversableLike
def sliding(size: Int, step: 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
step
the distance between the first elements of successive groups (defaults to 1)
returns
An iterator producing synchronized buffers of size size, except the last and the only element will be truncated if there are fewer elements than size.

Definition Classes
IterableLike
See also
scala.collection.Iterator, method sliding
def sliding(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 synchronized buffers of size size, except the last and the only element will be truncated if there are fewer elements than size.

Definition Classes
IterableLike
See also
scala.collection.Iterator, method sliding
def sortBy[B](f: (A) ⇒ B)(implicit ord: math.Ordering[B]): Buffer[A]

Sorts this SynchronizedBuffer according to the Ordering which results from transforming an implicitly given Ordering with a transformation function.
Sorts this SynchronizedBuffer 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 synchronized buffer consisting of the elements of this synchronized buffer sorted according to the ordering where x < y if ord.lt(f(x), f(y)).
Definition Classes
SeqLike
Example:
1. val words = "The quick brown fox jumped over the lazy dog".split(' ') // this works because scala.Ordering will implicitly provide an Ordering[Tuple2[Int, Char]] words.sortBy(x => (x.length, x.head)) res0: Array[String] = Array(The, dog, fox, the, lazy, over, brown, quick, jumped)
See also
scala.math.Ordering
def sortWith(lt: (A, A) ⇒ Boolean): Buffer[A]

Sorts this synchronized buffer according to a comparison function.
Sorts this synchronized buffer according to a comparison function.
The sort is stable. That is, elements that are equal (as determined by lt) appear in the same order in the sorted sequence as in the original.
lt
the comparison function which tests whether its first argument precedes its second argument in the desired ordering.
returns
a synchronized buffer consisting of the elements of this synchronized buffer sorted according to the comparison function lt.
Definition Classes
SeqLike
Example:
1. List("Steve", "Tom", "John", "Bob").sortWith(_.compareTo(_) < 0) = List("Bob", "John", "Steve", "Tom")
def sorted[B >: A](implicit ord: math.Ordering[B]): Buffer[A]

Sorts this synchronized buffer according to an Ordering.
Sorts this synchronized buffer according to an Ordering.
The sort is stable. That is, elements that are equal (as determined by lt) appear in the same order in the sorted sequence as in the original.
ord
the ordering to be used to compare elements.
returns
a synchronized buffer consisting of the elements of this synchronized buffer sorted according to the ordering ord.

Definition Classes
SeqLike
See also
scala.math.Ordering
def span(p: (A) ⇒ Boolean): (Buffer[A], Buffer[A])

Splits this synchronized buffer into a prefix/suffix pair according to a predicate.
Splits this synchronized buffer into a prefix/suffix pair according to a predicate.
Note: c span p is equivalent to (but possibly more efficient than) (c takeWhile p, c dropWhile p), provided the evaluation of the predicate p does not cause any side-effects.
returns
a pair consisting of the longest prefix of this synchronized buffer whose elements all satisfy p, and the rest of this synchronized buffer.

Definition Classes
TraversableLike → GenTraversableLike
def splitAt(n: Int): (Buffer[A], Buffer[A])

Splits this synchronized buffer into two at a given position.
Splits this synchronized buffer into two at a given position. Note: c splitAt n is equivalent to (but possibly more efficient than) (c take n, c drop n).
n
the position at which to split.
returns
a pair of synchronized buffers consisting of the first n elements of this synchronized buffer, and the other elements.

Definition Classes
TraversableLike → GenTraversableLike
def startsWith[B](that: GenSeq[B], offset: Int): Boolean

Tests whether this synchronized buffer contains the given sequence at a given index.
Tests whether this synchronized buffer contains the given sequence at a given index.
Note: If the both the receiver object this and the argument that are infinite sequences this method may not terminate.
that
the sequence to test
offset
the index where the sequence is searched.
returns
true if the sequence that is contained in this synchronized buffer at index offset, otherwise false.

Definition Classes
SeqLike → GenSeqLike
def startsWith[B](that: GenSeq[B]): Boolean

Tests whether this synchronized buffer starts with the given sequence.
Tests whether this synchronized buffer starts with the given sequence.
that
the sequence to test
returns
true if this collection has that as a prefix, false otherwise.

Definition Classes
GenSeqLike
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
def sum: A

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

Definition Classes
TraversableOnce → GenTraversableOnce
Full Signature
def sum[B >: A](implicit num: Numeric[B]): B
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def tail: Buffer[A]

Selects all elements except the first.
Selects all elements except the first.
returns
a synchronized buffer consisting of all elements of this synchronized buffer except the first one.

Definition Classes
TraversableLike → GenTraversableLike
Exceptions thrown
`UnsupportedOperationException`
if the synchronized buffer is empty.
def tails: Iterator[Buffer[A]]

Iterates over the tails of this synchronized buffer.
Iterates over the tails of this synchronized buffer. The first value will be this synchronized buffer and the final one will be an empty synchronized buffer, with the intervening values the results of successive applications of tail.
returns
an iterator over all the tails of this synchronized buffer
Definition Classes
TraversableLike
Example:
1. List(1,2,3).tails = Iterator(List(1,2,3), List(2,3), List(3), Nil)
def take(n: Int): Buffer[A]

Selects first n elements.
Selects first n elements.
n
the number of elements to take from this synchronized buffer.
returns
a synchronized buffer consisting only of the first n elements of this synchronized buffer, or else the whole synchronized buffer, if it has less than n elements.

Definition Classes
IterableLike → TraversableLike → GenTraversableLike
def takeRight(n: Int): Buffer[A]

Selects last n elements.
Selects last n elements.
n
the number of elements to take
returns
a synchronized buffer consisting only of the last n elements of this synchronized buffer, or else the whole synchronized buffer, if it has less than n elements.

Definition Classes
IterableLike
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.
returns
the longest prefix of this synchronized buffer whose elements all satisfy the predicate p.

Definition Classes
IterableLike → TraversableLike → GenTraversableLike
def thisCollection: collection.Seq[A]

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

Attributes
protected[this]
Definition Classes
SeqLike → IterableLike → TraversableLike
def to[Col[_]]: Col[A]

[use case] Converts this synchronized buffer into another by copying all elements.
[use case]
Converts this synchronized buffer into another by copying all elements.
Col
The collection type to build.
returns
a new collection containing all elements of this synchronized buffer.

Definition Classes
TraversableLike → TraversableOnce → GenTraversableOnce
Full Signature
def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, A, Col[A]]): Col[A]
def toArray: Array[A]

[use case] Converts this synchronized buffer to an array.
[use case]
Converts this synchronized buffer to an array.
returns
an array containing all elements of this synchronized buffer. An ClassTag must be available for the element type of this synchronized buffer.

Definition Classes
TraversableOnce → GenTraversableOnce
Full Signature
def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
def toBuffer[B >: A]: Buffer[B]

Converts this synchronized buffer to a mutable buffer.
Converts this synchronized buffer to a mutable buffer.
returns
a buffer containing all elements of this synchronized buffer.

Definition Classes
TraversableOnce → GenTraversableOnce
def toCollection(repr: Buffer[A]): collection.Seq[A]

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

Attributes
protected[this]
Definition Classes
SeqLike → IterableLike → TraversableLike
def toIndexedSeq: immutable.IndexedSeq[A]

Converts this synchronized buffer to an indexed sequence.
Converts this synchronized buffer to an indexed sequence.
returns
an indexed sequence containing all elements of this synchronized buffer.

Definition Classes
TraversableOnce → GenTraversableOnce
def toIterable: collection.Iterable[A]

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

Definition Classes
IterableLike → TraversableOnce → GenTraversableOnce
def toIterator: Iterator[A]

Returns an Iterator over the elements in this synchronized buffer.
Returns an Iterator over the elements in this synchronized buffer. Will return the same Iterator if this instance is already an Iterator.
returns
an Iterator containing all elements of this synchronized buffer.

Definition Classes
IterableLike → TraversableLike → GenTraversableOnce
def toList: List[A]

Converts this synchronized buffer to a list.
Converts this synchronized buffer to a list.
returns
a list containing all elements of this synchronized buffer.

Definition Classes
TraversableOnce → GenTraversableOnce
def toMap[T, U]: collection.Map[T, U]

[use case] Converts this synchronized buffer to a map.
[use case]
Converts this synchronized buffer to a map. This method is unavailable unless the elements are members of Tuple2, each ((T, U)) becoming a key-value pair in the map. Duplicate keys will be overwritten by later keys: if this is an unordered collection, which key is in the resulting map is undefined.
returns
a map of type immutable.Map[T, U] containing all key/value pairs of type (T, U) of this synchronized buffer.

Definition Classes
TraversableOnce → GenTraversableOnce
Full Signature
def toMap[T, U](implicit ev: <:<[A, (T, U)]): immutable.Map[T, U]
def toParArray: ParArray[A]

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

Converts this synchronized buffer to a sequence.
Converts this synchronized buffer to a sequence.
Overridden for efficiency.
returns
a sequence containing all elements of this synchronized buffer.

Definition Classes
SeqLike → GenSeqLike → TraversableOnce → GenTraversableOnce
def toSet[B >: A]: immutable.Set[B]

Converts this synchronized buffer to a set.
Converts this synchronized buffer to a set.
returns
a set containing all elements of this synchronized buffer.

Definition Classes
TraversableOnce → GenTraversableOnce
def toStream: immutable.Stream[A]

Converts this synchronized buffer to a stream.
Converts this synchronized buffer to a stream.
returns
a stream containing all elements of this synchronized buffer.

Definition Classes
IterableLike → TraversableLike → GenTraversableOnce
def toString(): String

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

Definition Classes
SeqLike → TraversableLike → Any
def toTraversable: collection.Traversable[A]

Converts this synchronized buffer to an unspecified Traversable.
Converts this synchronized buffer to an unspecified Traversable. Will return the same collection if this instance is already Traversable.
returns
a Traversable containing all elements of this synchronized buffer.

Definition Classes
TraversableLike → TraversableOnce → GenTraversableOnce
def toVector: Vector[A]

Converts this synchronized buffer to a Vector.
Converts this synchronized buffer to a Vector.
returns
a vector containing all elements of this synchronized buffer.

Definition Classes
TraversableOnce → GenTraversableOnce
def transform(f: (A) ⇒ A): SynchronizedBuffer.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
def transpose[B](implicit asTraversable: (A) ⇒ GenTraversableOnce[B]): Buffer[Buffer[B]]

Transposes this synchronized buffer of traversable collections into a synchronized buffer of synchronized buffers.
Transposes this synchronized buffer of traversable collections into a synchronized buffer of synchronized buffers.
B
the type of the elements of each traversable collection.
asTraversable
an implicit conversion which asserts that the element type of this synchronized buffer is a Traversable.
returns
a two-dimensional synchronized buffer of synchronized buffers which has as nth row the nth column of this synchronized buffer.

Definition Classes
GenericTraversableTemplate
Annotations
@migration
Migration
(Changed in version 2.9.0) transpose throws an IllegalArgumentException if collections are not uniformly sized.
Exceptions thrown
`IllegalArgumentException`
if all collections in this synchronized buffer are not of the same size.
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
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
def union(that: collection.Seq[A]): SynchronizedBuffer[A]

[use case] Produces a new sequence which contains all elements of this synchronized buffer and also all elements of a given sequence.
[use case]
Produces a new sequence which contains all elements of this synchronized buffer and also all elements of a given sequence. xs union ys is equivalent to xs ++ ys.
Another way to express this is that xs union ys computes the order-presevring multi-set union of xs and ys. union is hence a counter-part of diff and intersect which also work on multi-sets.
that
the sequence to add.
returns
a new synchronized buffer which contains all elements of this synchronized buffer followed by all elements of that.

Definition Classes
SeqLike → GenSeqLike
Full Signature
def union[B >: A, That](that: GenSeq[B])(implicit bf: CanBuildFrom[Buffer[A], B, That]): That
def unzip[A1, A2](implicit asPair: (A) ⇒ (A1, A2)): (Buffer[A1], Buffer[A2])

Converts this synchronized buffer of pairs into two collections of the first and second half of each pair.
Converts this synchronized buffer of pairs into two collections of the first and second half of each pair.
A1
the type of the first half of the element pairs
A2
the type of the second half of the element pairs
asPair
an implicit conversion which asserts that the element type of this synchronized buffer is a pair.
returns
a pair synchronized buffers, containing the first, respectively second half of each element pair of this synchronized buffer.

Definition Classes
GenericTraversableTemplate
def unzip3[A1, A2, A3](implicit asTriple: (A) ⇒ (A1, A2, A3)): (Buffer[A1], Buffer[A2], Buffer[A3])

Converts this synchronized buffer of triples into three collections of the first, second, and third element of each triple.
Converts this synchronized buffer of triples into three collections of the first, second, and third element of each triple.
A1
the type of the first member of the element triples
A2
the type of the second member of the element triples
A3
the type of the third member of the element triples
asTriple
an implicit conversion which asserts that the element type of this synchronized buffer is a triple.
returns
a triple synchronized buffers, containing the first, second, respectively third member of each element triple of this synchronized buffer.

Definition Classes
GenericTraversableTemplate
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
SynchronizedBuffer → BufferLike → SeqLike
def updated(index: Int, elem: A): SynchronizedBuffer[A]

[use case] A copy of this synchronized buffer with one single replaced element.
[use case]
A copy of this synchronized buffer with one single replaced element.
index
the position of the replacement
elem
the replacing element
returns
a copy of this synchronized buffer with the element at position index replaced by elem.

Definition Classes
SeqLike → GenSeqLike
Full Signature
def updated[B >: A, That](index: Int, elem: B)(implicit bf: CanBuildFrom[Buffer[A], B, That]): That
def view(from: Int, until: Int): SeqView[A, Buffer[A]]

Creates a non-strict view of a slice of this synchronized buffer.
Creates a non-strict view of a slice of this synchronized buffer.
Note: the difference between view and slice is that view produces a view of the current synchronized buffer, whereas slice produces a new synchronized buffer.
Note: view(from, to) is equivalent to view.slice(from, to)
from
the index of the first element of the view
until
the index of the element following the view
returns
a non-strict view of a slice of this synchronized buffer, starting at index from and extending up to (but not including) index until.

Definition Classes
SeqLike → IterableLike → TraversableLike
def view: SeqView[A, Buffer[A]]

Creates a non-strict view of this synchronized buffer.
Creates a non-strict view of this synchronized buffer.
returns
a non-strict view of this synchronized buffer.

Definition Classes
SeqLike → IterableLike → TraversableLike
final def wait(): Unit

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

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

Definition Classes
AnyRef
Annotations
@throws()
def withFilter(p: (A) ⇒ Boolean): FilterMonadic[A, Buffer[A]]

Creates a non-strict filter of this synchronized buffer.
Creates a non-strict filter of this synchronized buffer.
Note: the difference between c filter p and c withFilter p is that the former creates a new collection, whereas the latter only restricts the domain of subsequent map, flatMap, foreach, and withFilter operations.
p
the predicate used to test elements.
returns
an object of class WithFilter, which supports map, flatMap, foreach, and withFilter operations. All these operations apply to those elements of this synchronized buffer which satisfy the predicate p.

Definition Classes
TraversableLike → FilterMonadic
def zip[B](that: GenIterable[B]): SynchronizedBuffer[(A, B)]

[use case] Returns a synchronized buffer formed from this synchronized buffer and another iterable collection by combining corresponding elements in pairs.
[use case]
Returns a synchronized buffer formed from this synchronized buffer and another iterable collection by combining corresponding elements in pairs. If one of the two collections is longer than the other, its remaining elements are ignored.
B
the type of the second half of the returned pairs
that
The iterable providing the second half of each result pair
returns
a new synchronized buffer containing pairs consisting of corresponding elements of this synchronized buffer and that. The length of the returned collection is the minimum of the lengths of this synchronized buffer and that.

Definition Classes
IterableLike → GenIterableLike
Full Signature
def zip[A1 >: A, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[Buffer[A], (A1, B), That]): That
def zipAll[B](that: collection.Iterable[B], thisElem: A, thatElem: B): SynchronizedBuffer[(A, B)]

[use case] Returns a synchronized buffer formed from this synchronized buffer and another iterable collection by combining corresponding elements in pairs.
[use case]
Returns a synchronized buffer formed from this synchronized buffer and another iterable collection by combining corresponding elements in pairs. If one of the two collections is shorter than the other, placeholder elements are used to extend the shorter collection to the length of the longer.
B
the type of the second half of the returned pairs
that
The iterable providing the second half of each result pair
thisElem
the element to be used to fill up the result if this synchronized buffer is shorter than that.
thatElem
the element to be used to fill up the result if that is shorter than this synchronized buffer.
returns
a new synchronized buffer containing pairs consisting of corresponding elements of this synchronized buffer and that. The length of the returned collection is the maximum of the lengths of this synchronized buffer and that. If this synchronized buffer is shorter than that, thisElem values are used to pad the result. If that is shorter than this synchronized buffer, thatElem values are used to pad the result.

Definition Classes
IterableLike → GenIterableLike
Full Signature
def zipAll[B, A1 >: A, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[Buffer[A], (A1, B), That]): That
def zipWithIndex: SynchronizedBuffer[(A, Int)]

[use case] Zips this synchronized buffer with its indices.
[use case]
Zips this synchronized buffer with its indices.
returns
A new synchronized buffer containing pairs consisting of all elements of this synchronized buffer paired with their index. Indices start at 0.
Definition Classes
IterableLike → GenIterableLike
Full Signature
def zipWithIndex[A1 >: A, That](implicit bf: CanBuildFrom[Buffer[A], (A1, Int), That]): That
Example:
1. List("a", "b", "c").zipWithIndex = List(("a", 0), ("b", 1), ("c", 2))
def →[B](y: B): (SynchronizedBuffer[A], B)

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

Shadowed Implicit Value Members

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

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 Clearable

Inherited from Seq[A]

Inherited from SeqLike[A, Buffer[A]]

Inherited from Cloneable[Buffer[A]]

Inherited from scala.Cloneable

Inherited from java.lang.Cloneable

Inherited from collection.Seq[A]

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

Inherited from AnyRef

Inherited from Any

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

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

Inherited by implicit conversion StringAdd from SynchronizedBuffer[A] to StringAdd[SynchronizedBuffer[A]]

Inherited by implicit conversion StringFormat from SynchronizedBuffer[A] to StringFormat[SynchronizedBuffer[A]]

Inherited by implicit conversion Ensuring from SynchronizedBuffer[A] to Ensuring[SynchronizedBuffer[A]]

Inherited by implicit conversion ArrowAssoc from SynchronizedBuffer[A] to ArrowAssoc[SynchronizedBuffer[A]]

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

Ungrouped

trait SynchronizedBuffer[A] extends Buffer[A]

Type Members

type Self = Buffer[A]

class WithFilter extends FilterMonadic[A, Repr]

Value Members

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

def +(other: String): String

def ++(xs: GenTraversableOnce[A]): Self

def ++[B](that: GenTraversableOnce[B]): SynchronizedBuffer[B]

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

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

def ++:[B](that: TraversableOnce[B]): SynchronizedBuffer[B]

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

def ++=(xs: TraversableOnce[A]): SynchronizedBuffer.this.type

def ++=:(xs: TraversableOnce[A]): SynchronizedBuffer.this.type

def +:(elem: A): SynchronizedBuffer[A]

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

def +=(elem: A): SynchronizedBuffer.this.type

def +=(elem1: A, elem2: A, elems: A*): SynchronizedBuffer.this.type

def +=:(elem: A): SynchronizedBuffer.this.type

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

def -(elem: A): Buffer[A]

def --(xs: GenTraversableOnce[A]): Buffer[A]

def --=(xs: TraversableOnce[A]): SynchronizedBuffer.this.type

def -=(x: A): SynchronizedBuffer.this.type

def -=(elem1: A, elem2: A, elems: A*): SynchronizedBuffer.this.type

def ->[B](y: B): (SynchronizedBuffer[A], B)

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

def :+(elem: A): SynchronizedBuffer[A]

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

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

def <<(cmd: Message[A]): Unit

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

def addString(b: scala.StringBuilder): scala.StringBuilder

def addString(b: scala.StringBuilder, sep: String): scala.StringBuilder

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

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

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

def append(elems: A*): Unit

def appendAll(xs: TraversableOnce[A]): Unit

def apply(n: Int): A

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

final def asInstanceOf[T0]: T0

def asParIterable: ParIterable[A]

def asParSeq: ParSeq[A]

def canEqual(that: Any): Boolean

def clear(): Unit

def clone(): Self

def collect[B](pf: PartialFunction[A, B]): SynchronizedBuffer[B]

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

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

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

def companion: GenericCompanion[Buffer]

def compose[A](g: (A) ⇒ Int): (A) ⇒ A

def contains[A1 >: A](elem: A1): Boolean

def containsSlice[B](that: GenSeq[B]): Boolean

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

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

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

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

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

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

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

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

def count(p: (A) ⇒ Boolean): Int

def diff(that: collection.Seq[A]): SynchronizedBuffer[A]

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

def distinct: Buffer[A]

def drop(n: Int): Buffer[A]

def dropRight(n: Int): Buffer[A]

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

def endsWith[B](that: GenSeq[B]): Boolean

def ensuring(cond: (SynchronizedBuffer[A]) ⇒ Boolean, msg: ⇒ Any): SynchronizedBuffer[A]

def ensuring(cond: (SynchronizedBuffer[A]) ⇒ Boolean): SynchronizedBuffer[A]

def ensuring(cond: Boolean, msg: ⇒ Any): SynchronizedBuffer[A]

def ensuring(cond: Boolean): SynchronizedBuffer[A]