scala.collection.mutable

SynchronizedBuffer

trait SynchronizedBuffer[A] extends Buffer[A]

This class should be used as a mixin. It synchronizes the Buffer methods of the class into which it is mixed in.

A

type of the elements contained in this buffer.

Source
SynchronizedBuffer.scala
Version

1.0, 08/07/2003

Since

1

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

Type Members

  1. type Self = Buffer[A]

    The type implementing this traversable

    The type implementing this traversable

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

    A class supporting filtered operations.

Value Members

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

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

    Test two objects for inequality.

    Test two objects for inequality.

    returns

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

    Definition Classes
    Any
  3. final def ##(): Int

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

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

    returns

    a hash value consistent with ==

    Definition Classes
    AnyRef → Any
  4. def ++(xs: GenTraversableOnce[A]): 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
    SynchronizedBufferBufferLike
  5. def ++[B](that: GenTraversableOnce[B]): SynchronizedBuffer[B]

    [use case]

    [use case]
    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
    TraversableLikeGenTraversableLike
  6. def ++:[B >: A, That](that: 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
  7. def ++:[B](that: TraversableOnce[B]): SynchronizedBuffer[B]

    [use case]

    [use case]
    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
  8. 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.

    returns

    the synchronized buffer [email protected] iter the iterable object.

    Definition Classes
    SynchronizedBufferGrowable
  9. 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
    SynchronizedBufferBufferLike
  10. def +:(elem: A): SynchronizedBuffer[A]

    [use case]

    [use case]
    elem

    the prepended element

    returns

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

    Definition Classes
    SeqLikeGenSeqLike
  11. 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
    SynchronizedBufferBufferLikeGrowable
  12. 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
  13. 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
    SynchronizedBufferBufferLike
  14. 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
    BufferLikeSubtractable
    Annotations
    @migration
    Migration

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

  15. 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
    BufferLikeSubtractable
    Annotations
    @migration
    Migration

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

  16. def --(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
    BufferLikeSubtractable
    Annotations
    @migration
    Migration

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

  17. def --=(xs: 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.

    returns

    the synchronized buffer itself

    Definition Classes
    Shrinkable
  18. 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
    BufferLikeShrinkable
  19. 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
  20. 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, x1), x2), ..., xn)
    

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

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

    A syntactic sugar for out of order folding.

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

    Example:

         scala> val a = LinkedList(1,2,3,4)
         a: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2, 3, 4)
    
         scala> val b = (a /:\ 5)(_+_)
         b: Int = 15
    
    Definition Classes
    GenTraversableOnce
  22. def :+(elem: A): SynchronizedBuffer[A]

    [use case]

    [use case]
    elem

    the appended element

    returns

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

          scala> import scala.collection.mutable.LinkedList
          import scala.collection.mutable.LinkedList
    
          scala> val a = LinkedList(1)
          a: scala.collection.mutable.LinkedList[Int] = LinkedList(1)
    
          scala> val b = a :+ 2
          b: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2)
    
          scala> println(a)
          LinkedList(1)
    
    Definition Classes
    SeqLikeGenSeqLike
  23. 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(x1, op(x2, ... op(xn, z)...))
    

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

    Definition Classes
    TraversableOnceGenTraversableOnce
  24. def <<(cmd: Message[A]): Unit

    Send a message to this scriptable object.

    Send a message to this scriptable object.

    cmd

    the message to send.

    Definition Classes
    SynchronizedBufferBufferLikeScriptable
  25. final def ==(arg0: AnyRef): Boolean

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

    Test two objects for equality.

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

    returns

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

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

    Appends all elements of this 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
  28. def addString(b: StringBuilder, sep: String): 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
  29. def addString(b: StringBuilder, start: String, sep: String, end: String): 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
  30. def aggregate[B](z: B)(seqop: (B, A) ⇒ B, combop: (B, B) ⇒ B): B

    Aggregates the results of applying an operator to subsequent elements.

    Aggregates the results of applying an operator to subsequent elements.

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

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

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

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

    B

    the type of accumulated results

    z

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

    seqop

    an operator used to accumulate results within a partition

    combop

    an associative operator used to combine results from different partitions

    Definition Classes
    TraversableOnceGenTraversableOnce
  31. def andThen[C](k: (A) ⇒ C): PartialFunction[Int, C]

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

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

    C

    the result type of the transformation function.

    k

    the transformation function

    returns

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

    Definition Classes
    PartialFunctionFunction1
  32. 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
    SynchronizedBufferBufferLike
  33. 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
    SynchronizedBufferBufferLike
  34. 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
    SynchronizedBufferBufferLikeSeqLikeGenSeqLikeFunction1
    Exceptions thrown
    `IndexOutOfBoundsException`

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

  35. final def asInstanceOf[T0]: T0

    Cast the receiver object to be of type T0.

    Cast the receiver object to be of type T0.

    Note that the success of a cast at runtime is modulo Scala's erasure semantics. Therefore the expression 1.asInstanceOf[String] will throw a ClassCastException at runtime, while the expression List(1).asInstanceOf[List[String]] will not. In the latter example, because the type argument is erased as part of compilation it is not possible to check whether the contents of the list are of the requested type.

    returns

    the receiver object.

    Definition Classes
    Any
    Exceptions thrown
    ClassCastException

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

  36. def canEqual(that: Any): Boolean

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

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

    that

    The object with which this 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
    IterableLikeEquals
  37. def clear(): Unit

    Clears the buffer contents.

    Clears the buffer contents.

    Definition Classes
    SynchronizedBufferBufferLikeGrowable
  38. def clone(): Self

    Return a clone of this buffer.

    Return a clone of this buffer.

    returns

    an ArrayBuffer with the same elements.

    Definition Classes
    SynchronizedBufferCloneable → AnyRef
  39. def collect[B](pf: PartialFunction[A, B]): SynchronizedBuffer[B]

    [use case]

    [use case]
    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
    TraversableLikeGenTraversableLike
  40. 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)

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

  42. 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
    BufferSeqSeqGenSeqIterableIterableGenIterableTraversableTraversableGenTraversableGenericTraversableTemplate
  43. def compose[A](g: (A) ⇒ Int): (A) ⇒ A

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

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

    A

    the type to which function g can be applied

    g

    a function A => T1

    returns

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

    Definition Classes
    Function1
  44. def contains(elem: Any): Boolean

    Tests whether this 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 is equal (wrt ==) to elem, false otherwise.

    Definition Classes
    SeqLike
  45. 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
  46. def copyToArray(xs: Array[A], start: Int, len: Int): Unit

    [use case]

    [use case]
    xs

    the array to fill.

    start

    the starting index.

    len

    the maximal number of elements to copy.

    Definition Classes
    IterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  47. def copyToArray(xs: Array[A]): Unit

    [use case]

    [use case]
    xs

    the array to fill.

    Definition Classes
    TraversableOnceGenTraversableOnce
  48. def copyToArray(xs: Array[A], start: Int): Unit

    [use case]

    [use case]
    xs

    the array to fill.

    start

    the starting index.

    Definition Classes
    TraversableOnceGenTraversableOnce
  49. 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
  50. 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
    SeqLikeGenSeqLike
  51. 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
    TraversableOnceGenTraversableOnce
  52. def diff(that: Seq[A]): SynchronizedBuffer[A]

    [use case]

    [use case]
    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
    SeqLikeGenSeqLike
  53. 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
    SeqLikeGenSeqLike
  54. 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
    IterableLikeTraversableLikeGenTraversableLike
  55. 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
  56. def dropWhile(p: (A) ⇒ Boolean): Buffer[A]

    Drops longest prefix of elements that satisfy a predicate.

    Drops longest prefix of elements that satisfy a predicate.

    p

    The predicate used to test elements.

    returns

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

    Definition Classes
    TraversableLikeGenTraversableLike
  57. 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
    SeqLikeGenSeqLike
  58. final def eq(arg0: AnyRef): Boolean

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

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

    The eq method implements an equivalence relation on non-null instances of AnyRef, and has three additional properties:

    • It is consistent: for any non-null instances x and y of type AnyRef, multiple invocations of x.eq(y) consistently returns true or consistently returns false.
    • For any non-null instance x of type AnyRef, x.eq(null) and null.eq(x) returns false.
    • null.eq(null) returns true.

    When overriding the equals or hashCode methods, it is important to ensure that their behavior is consistent with reference equality. Therefore, if two objects are references to each other (o1 eq o2), they should be equal to each other (o1 == o2) and they should hash to the same value (o1.hashCode == o2.hashCode).

    returns

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

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

    The equals method for arbitrary sequences.

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

    that

    The object to compare the sequence to

    returns

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

    Definition Classes
    GenSeqLikeEquals → AnyRef → Any
  60. 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
    IterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  61. 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
    TraversableLikeGenTraversableLike
  62. 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
    TraversableLikeGenTraversableLike
  63. def finalize(): Unit

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

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

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

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

    not specified by SLS as a member of AnyRef

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

    Finds the first element of the 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
    IterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  65. def flatMap[B](f: (A) ⇒ GenTraversableOnce[B]): SynchronizedBuffer[B]

    [use case]

    [use case]
    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
    TraversableLikeGenTraversableLikeFilterMonadic
  66. 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
    TraversableOnceGenTraversableOnce
  67. 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, x1), x2, ..., xn)
    

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

    Definition Classes
    TraversableOnceGenTraversableOnce
  68. 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(x1, op(x2, ... op(xn, z)...))
    

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

    Definition Classes
    IterableLikeTraversableOnceGenTraversableOnce
  69. 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
    IterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  70. def foreach(f: (A) ⇒ Unit): Unit

    [use case]

    [use case]
    f

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

    Definition Classes
    IterableLikeTraversableLikeGenTraversableLikeTraversableOnceGenTraversableOnceFilterMonadic
  71. 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
  72. final def getClass(): Class[_]

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

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

    The nature of the representation is platform dependent.

    returns

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

    Definition Classes
    AnyRef → Any
    Note

    not specified by SLS as a member of AnyRef

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

    Iterator#grouped

  75. 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
    TraversableLikeTraversableOnceGenTraversableOnce
  76. 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
    SynchronizedBufferGenSeqLike → AnyRef → Any
  77. 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
    IterableLikeGenIterableLikeTraversableLikeGenTraversableLike
    Exceptions thrown
    `NoSuchElementException`

    if the synchronized buffer is empty.

  78. 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
  79. def indexOf(elem: A, from: Int): Int

    [use case]

    [use case]
    elem

    the element value to search for.

    from

    the start index

    returns

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

    Definition Classes
    GenSeqLike
  80. def indexOf(elem: A): Int

    [use case]

    [use case]
    elem

    the element value to search for.

    returns

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

    Definition Classes
    GenSeqLike
  81. 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
  82. 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
  83. def indexWhere(p: (A) ⇒ Boolean, from: Int): Int

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

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

    p

    the predicate used to test elements.

    from

    the start index

    returns

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

    Definition Classes
    SeqLikeGenSeqLike
  84. def indexWhere(p: (A) ⇒ Boolean): Int

    Finds index of first element satisfying some predicate.

    Finds index of first element satisfying some predicate.

    p

    the predicate used to test elements.

    returns

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

    Definition Classes
    GenSeqLike
  85. def indices: Range

    Produces the range of all indices of this sequence.

    Produces the range of all indices of this sequence.

    returns

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

    Definition Classes
    SeqLike
  86. 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
    Exceptions thrown
    `UnsupportedOperationException`

    if the synchronized buffer is empty.

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

  88. 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
    SynchronizedBufferBufferLike
  89. def insertAll(n: Int, xs: 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
    SynchronizedBufferBufferLike
  90. def intersect(that: Seq[A]): SynchronizedBuffer[A]

    [use case]

    [use case]
    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
    SeqLikeGenSeqLike
  91. 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
  92. def isEmpty: Boolean

    Tests whether the synchronized buffer is empty.

    Tests whether the synchronized buffer is empty.

    returns

    true if the synchronized buffer contains no elements, false otherwise.

    Definition Classes
    IterableLikeGenIterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  93. final def isInstanceOf[T0]: Boolean

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

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

    Note that the result of the test is modulo Scala's erasure semantics. Therefore the expression 1.isInstanceOf[String] will return false, while the expression List(1).isInstanceOf[List[String]] will return true. In the latter example, because the type argument is erased as part of compilation it is not possible to check whether the contents of the list are of the specified type.

    returns

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

    Definition Classes
    Any
  94. final def isTraversableAgain: Boolean

    Tests whether this synchronized buffer can be repeatedly traversed.

    Tests whether this synchronized buffer can be repeatedly traversed.

    returns

    true

    Definition Classes
    GenTraversableLikeGenTraversableOnce
  95. def iterator: Iterator[A]

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

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

    returns

    the new iterator

    Definition Classes
    SynchronizedBufferIterableLikeGenIterableLike
  96. def last: A

    Selects the last element.

    Selects the last element.

    returns

    The last element of this synchronized buffer.

    Definition Classes
    TraversableLike
    Exceptions thrown
    NoSuchElementException

    If the synchronized buffer is empty.

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

    [use case]

    [use case]
    elem

    the element value to search for.

    end

    the end index.

    returns

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

    Definition Classes
    GenSeqLike
  98. def lastIndexOf(elem: A): Int

    [use case]

    [use case]
    elem

    the element value to search for.

    returns

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

    Definition Classes
    GenSeqLike
  99. 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
  100. 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
  101. def lastIndexWhere(p: (A) ⇒ Boolean, end: Int): Int

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

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

    p

    the predicate used to test elements.

    returns

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

    Definition Classes
    SeqLikeGenSeqLike
  102. def lastIndexWhere(p: (A) ⇒ Boolean): Int

    Finds index of last element satisfying some predicate.

    Finds index of last element satisfying some predicate.

    p

    the predicate used to test elements.

    returns

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

    Definition Classes
    GenSeqLike
  103. 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
  104. 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
    SynchronizedBufferBufferLikeSeqLikeGenSeqLike
  105. 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
  106. def lift: (Int) ⇒ Option[A]

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

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

    returns

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

    Definition Classes
    PartialFunction
    See also

    Function.unlift

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

    [use case]

    [use case]
    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
    TraversableLikeGenTraversableLikeFilterMonadic
  108. def max: A

    [use case]

    [use case]
    returns

    the largest element of this synchronized buffer.

    Definition Classes
    TraversableOnceGenTraversableOnce
  109. def maxBy[B](f: (A) ⇒ B)(implicit cmp: Ordering[B]): A

    Definition Classes
    TraversableOnceGenTraversableOnce
  110. def min: A

    [use case]

    [use case]
    returns

    the smallest element of this synchronized buffer

    Definition Classes
    TraversableOnceGenTraversableOnce
  111. def minBy[B](f: (A) ⇒ B)(implicit cmp: Ordering[B]): A

    Definition Classes
    TraversableOnceGenTraversableOnce
  112. def missingCase(x: Int): A

    Attributes
    protected
    Definition Classes
    PartialFunction
  113. 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
    TraversableOnceGenTraversableOnce
  114. 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
    TraversableOnceGenTraversableOnce
    Example:
    1. List(1, 2, 3).mkString("|") = "1|2|3"

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

  116. final def ne(arg0: AnyRef): Boolean

    Equivalent to !(this eq that).

    Equivalent to !(this eq that).

    returns

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

    Definition Classes
    AnyRef
  117. 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
    GenericTraversableTemplateHasNewBuilder
  118. 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
    TraversableOnceGenTraversableOnce
  119. final def notify(): Unit

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

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

    Definition Classes
    AnyRef
    Note

    not specified by SLS as a member of AnyRef

  120. final def notifyAll(): Unit

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

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

    Definition Classes
    AnyRef
    Note

    not specified by SLS as a member of AnyRef

  121. 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
  122. def orElseFast[A1 <: Int, B1 >: A](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]

    Definition Classes
    PartialFunction
  123. def padTo(len: Int, elem: A): SynchronizedBuffer[A]

    [use case]

    [use case]
    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
    SeqLikeGenSeqLike
  124. 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
  125. def parCombiner: Combiner[A, ParSeq[A]]

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

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

    returns

    a combiner for the parallel collection of type ParRepr

    Attributes
    protected[this]
    Definition Classes
    SeqLikeSeqLikeTraversableLikeParallelizable
  126. 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
    TraversableLikeGenTraversableLike
  127. def patch(from: Int, that: GenSeq[A], replaced: Int): SynchronizedBuffer[A]

    [use case]

    [use case]
    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
    SeqLikeGenSeqLike
  128. 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)

  129. 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
  130. def prepend(elems: A*): Unit

    Prepend an element to this list.

    Prepend an element to this list.

    elems

    the elements to [email protected] elem the element to prepend.

    Definition Classes
    SynchronizedBufferBufferLike
  131. 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
    SynchronizedBufferBufferLike
  132. def product: A

    [use case]

    [use case]
    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
    TraversableOnceGenTraversableOnce
  133. def readOnly: Seq[A]

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

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

    returns

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

    Definition Classes
    BufferLike
  134. 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
    TraversableOnceGenTraversableOnce
    Exceptions thrown
    UnsupportedOperationException

    if this synchronized buffer is empty.

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

    Definition Classes
    TraversableOnce
  136. 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
    TraversableOnceGenTraversableOnce
  137. 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
    TraversableOnceGenTraversableOnce
  138. 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 x1, ..., xn are the elements of this synchronized buffer.

    Definition Classes
    IterableLikeTraversableOnceGenTraversableOnce
    Exceptions thrown
    `UnsupportedOperationException`

    if this synchronized buffer is empty.

  139. 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
    TraversableOnceGenTraversableOnce
  140. 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
    SynchronizedBufferBufferLike
  141. 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.

  142. 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
    TraversableLikeGenTraversableLike
  143. 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
    SeqLikeGenSeqLike
  144. 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
  145. def reverseMap[B](f: (A) ⇒ B): SynchronizedBuffer[B]

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

    [use case]

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

    B

    the element type of the returned collection.

    f

    the function to apply to each element.

    returns

    a new 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
    SeqLikeGenSeqLike
  146. def reversed: List[A]

    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  147. def sameElements(that: GenIterable[A]): Boolean

    [use case]

    [use case]
    that

    the collection to compare with.

    returns

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

    Definition Classes
    IterableLikeGenIterableLike
  148. 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
    TraversableLikeGenTraversableLike
  149. def scanLeft[B, That](z: B)(op: (B, A) ⇒ B)(implicit bf: CanBuildFrom[Buffer[A], B, That]): That

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

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

    B

    the type of the elements in the resulting collection

    That

    the actual type of the resulting collection

    z

    the initial value

    op

    the binary operator applied to the intermediate result and the element

    bf

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

    returns

    collection with intermediate results

    Definition Classes
    TraversableLikeGenTraversableLike
  150. def scanRight[B, That](z: B)(op: (A, B) ⇒ B)(implicit bf: CanBuildFrom[Buffer[A], B, That]): That

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

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

    Example:

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

    the type of the elements in the resulting collection

    That

    the actual type of the resulting collection

    z

    the initial value

    op

    the binary operator applied to the intermediate result and the element

    bf

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

    returns

    collection with intermediate results

    Definition Classes
    TraversableLikeGenTraversableLike
    Annotations
    @migration
    Migration

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

  151. 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
    SeqLikeGenSeqLike
  152. def seq: Seq[A]

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

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

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

    returns

    a sequential view of the collection.

    Definition Classes
    SeqSeqGenSeqGenSeqLikeIterableIterableGenIterableTraversableTraversableGenTraversableParallelizableTraversableOnceGenTraversableOnce
  153. 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
    SeqLikeGenTraversableLikeTraversableOnceGenTraversableOnce
  154. def slice(from: Int, until: Int): Buffer[A]

    Selects an interval of elements.

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

       from <= indexOf(x) < until
    
    from

    the lowest index to include from this synchronized buffer.

    until

    the highest index to EXCLUDE from this synchronized buffer.

    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
    IterableLikeTraversableLikeGenTraversableLike
  155. def sliding(size: Int, step: Int): Iterator[Buffer[A]]

    Definition Classes
    IterableLike
  156. 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

    Iterator#sliding

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

  158. 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 wrt lt appear in the same order in the sorted sequence as in the original.

    lt

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

    returns

    a 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")
      
  159. def sorted[B >: A](implicit ord: 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 wrt lt appear in the same order in the sorted sequence as in the original.

    ord

    the ordering to be used to compare elements.

    returns

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

    Definition Classes
    SeqLike
    See also

    scala.math.Ordering

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

    p

    the test predicate

    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
    TraversableLikeGenTraversableLike
  161. 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
    TraversableLikeGenTraversableLike
  162. 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
    SeqLikeGenSeqLike
  163. 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
  164. 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
    BufferLikeTraversableLikeGenTraversableLike
  165. def sum: A

    [use case]

    [use case]
    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
    TraversableOnceGenTraversableOnce
  166. final def synchronized[T0](arg0: ⇒ T0): T0

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

    if the synchronized buffer is empty.

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

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

    Selects first n elements.

    Selects first n elements.

    n

    Tt 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
    IterableLikeTraversableLikeGenTraversableLike
  170. 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
  171. def takeWhile(p: (A) ⇒ Boolean): Buffer[A]

    Takes longest prefix of elements that satisfy a predicate.

    Takes longest prefix of elements that satisfy a predicate.

    p

    The predicate used to test elements.

    returns

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

    Definition Classes
    IterableLikeTraversableLikeGenTraversableLike
  172. def thisCollection: 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
    SeqLikeIterableLikeTraversableLike
  173. def toArray: Array[A]

    [use case]

    [use case]
    returns

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

    Definition Classes
    TraversableOnceGenTraversableOnce
  174. 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
    TraversableOnceGenTraversableOnce
  175. def toCollection(repr: Buffer[A]): 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
    SeqLikeIterableLikeTraversableLike
  176. def toIndexedSeq: 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
    TraversableOnceGenTraversableOnce
  177. def toIterable: 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
    IterableLikeTraversableOnceGenTraversableOnce
  178. 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
    IterableLikeTraversableLikeGenTraversableOnce
  179. 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
    TraversableOnceGenTraversableOnce
  180. def toMap[T, U]: Map[T, U]

    [use case]

    [use case]
    returns

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

    Definition Classes
    TraversableOnceGenTraversableOnce
  181. def toSeq: 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
    SeqLikeGenSeqLikeTraversableOnceGenTraversableOnce
  182. def toSet[B >: A]: 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
    TraversableOnceGenTraversableOnce
  183. def toStream: 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
    IterableLikeTraversableLikeGenTraversableOnce
  184. 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
    SeqLikeTraversableLike → AnyRef → Any
  185. def toTraversable: 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
    TraversableLikeTraversableOnceGenTraversableOnce
  186. 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
  187. 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
  188. 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
  189. def union(that: Seq[A]): SynchronizedBuffer[A]

    [use case]

    [use case]
    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
    SeqLikeGenSeqLike
  190. 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.

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

    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
  192. 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
    SynchronizedBufferBufferLikeSeqLike
  193. def updated(index: Int, elem: A): SynchronizedBuffer[A]

    [use case]

    [use case]
    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
    SeqLikeGenSeqLike
  194. 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
    SeqLikeIterableLikeTraversableLike
  195. 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
    SeqLikeIterableLikeTraversableLike
  196. final def wait(): Unit

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

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

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

    [use case]

    [use case]
    B

    the type of the second half of the returned pairs

    that

    The iterable providing the second half of each result pair

    returns

    a new 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
    IterableLikeGenIterableLike
  201. def zipAll[B](that: Iterable[B], thisElem: A, thatElem: B): SynchronizedBuffer[(A, B)]

    [use case]

    [use case]
    B

    the type of the second half of the returned pairs

    that

    The iterable providing the second half of each result pair

    thisElem

    the element to be used to fill up the result if this 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
    IterableLikeGenIterableLike
  202. def zipWithIndex: SynchronizedBuffer[(A, Int)]

    [use case]

    [use case]
    returns

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

    Definition Classes
    IterableLikeGenIterableLike

Inherited from Buffer[A]

Inherited from BufferLike[A, Buffer[A]]

Inherited from Subtractable[A, Buffer[A]]

Inherited from Scriptable[A]

Inherited from Shrinkable[A]

Inherited from Growable[A]

Inherited from Seq[A]

Inherited from SeqLike[A, Buffer[A]]

Inherited from Cloneable[Buffer[A]]

Inherited from Seq[A]

Inherited from SeqLike[A, Buffer[A]]

Inherited from GenSeq[A]

Inherited from GenSeqLike[A, Buffer[A]]

Inherited from PartialFunction[Int, A]

Inherited from (Int) ⇒ A

Inherited from Iterable[A]

Inherited from Iterable[A]

Inherited from IterableLike[A, Buffer[A]]

Inherited from Equals

Inherited from GenIterable[A]

Inherited from GenIterableLike[A, Buffer[A]]

Inherited from Traversable[A]

Inherited from Mutable

Inherited from Traversable[A]

Inherited from GenTraversable[A]

Inherited from GenericTraversableTemplate[A, Buffer]

Inherited from TraversableLike[A, Buffer[A]]

Inherited from GenTraversableLike[A, Buffer[A]]

Inherited from Parallelizable[A, ParSeq[A]]

Inherited from TraversableOnce[A]

Inherited from GenTraversableOnce[A]

Inherited from FilterMonadic[A, Buffer[A]]

Inherited from HasNewBuilder[A, Buffer[A]]

Inherited from AnyRef

Inherited from Any