scala.collection.mutable

# SynchronizedQueue

#### class SynchronizedQueue[A] extends Queue[A]

This is a synchronized version of the `Queue[T]` class. It implements a data structure that allows one to insert and retrieve elements in a first-in-first-out (FIFO) manner.

A

  type of elements contained in this synchronized queue.

Source
  SynchronizedQueue.scala
Version

  1.0, 03/05/2004

Since

  1

Linear Supertypes
Queue[A], MutableList[A], Serializable, Serializable, Builder[A, MutableList[A]], Growable[A], LinearSeqOptimized[A, MutableList[A]], LinearSeq[A], LinearSeq[A], LinearSeqLike[A, MutableList[A]], AbstractSeq[A], Seq[A], SeqLike[A, Seq[A]], Cloneable[Queue[A]], Iterable[A], Traversable[A], Mutable, AbstractSeq[A], Seq[A], SeqLike[A, MutableList[A]], GenSeq[A], GenSeqLike[A, MutableList[A]], PartialFunction[Int, A], (Int) ⇒ A, AbstractIterable[A], Iterable[A], IterableLike[A, MutableList[A]], Equals, GenIterable[A], GenIterableLike[A, MutableList[A]], AbstractTraversable[A], Traversable[A], GenTraversable[A], GenericTraversableTemplate[A, Queue], TraversableLike[A, MutableList[A]], GenTraversableLike[A, MutableList[A]], Parallelizable[A, ParSeq[A]], TraversableOnce[A], GenTraversableOnce[A], FilterMonadic[A, MutableList[A]], HasNewBuilder[A, Queue[A]], AnyRef, Any
Ordering

1. Alphabetic
2. By inheritance

Inherited

1. Hide All
2. Show all

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

Visibility

1. Public
2. All

### Instance Constructors

1. #### new SynchronizedQueue()

### Type Members

1. #### type Self = MutableList[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 ++[B](that: GenTraversableOnce[B]): SynchronizedQueue[B]

   [use case]

   [use case]
   B

     the element type of the returned collection.

   that

     the traversable to append.

   returns

     a new synchronized queue which contains all elements of this synchronized queue followed by all elements of `that`.

   Definition Classes
     TraversableLike → GenTraversableLike

5. #### def ++:[B >: A, That](that: Traversable[B])(implicit bf: CanBuildFrom[MutableList[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 queue followed by all elements of `that`.

   Definition Classes
     TraversableLike

6. #### def ++:[B](that: TraversableOnce[B]): SynchronizedQueue[B]

   [use case]

   [use case]
   B

     the element type of the returned collection.

   that

     the traversable to append.

   returns

     a new synchronized queue which contains all elements of this synchronized queue followed by all elements of `that`.

   Definition Classes
     TraversableLike

7. #### def ++=(xs: TraversableOnce[A]): SynchronizedQueue.this.type

   Adds all elements provided by a `TraversableOnce` object at the end of the queue.

   Adds all elements provided by a `TraversableOnce` object at the end of the queue. The elements are prepended in the order they are given out by the iterator.

   xs

     a traversable object

   returns

     the synchronized queue itself.

   Definition Classes
     SynchronizedQueue → Growable

8. #### def +:(elem: A): SynchronizedQueue[A]

   [use case]

   [use case]
   elem

     the prepended element

   returns

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

   Definition Classes
     SeqLike → GenSeqLike

9. #### def +=(elem: A): SynchronizedQueue.this.type

   Inserts a single element at the end of the queue.

   Inserts a single element at the end of the queue.

   elem

     the element to insert

   returns

     the builder itself.

   Definition Classes
     SynchronizedQueue → MutableList → Builder → Growable

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

    adds two or more elements to this synchronized queue.

    adds two or more elements to this synchronized queue.

    elem1

      the first element to add.

    elem2

      the second element to add.

    elems

      the remaining elements to add.

    returns

      the synchronized queue itself

    Definition Classes
      Growable

11. #### def +=:(elem: A): SynchronizedQueue.this.type

    Prepends a single element to this list.

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

    elem

      the element to prepend.

    returns

      this synchronized queue.

    Definition Classes
      MutableList

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

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

    Applies a binary operator to a start value and all elements of this synchronized queue, 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 queue, 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 queue.

    Definition Classes
      TraversableOnce → GenTraversableOnce

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

14. #### def :+(elem: A): SynchronizedQueue[A]

    [use case]

    [use case]
    elem

      the appended element

    returns

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

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

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

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

                scala> println(a)
                LinkedList(1)

    Definition Classes
      SeqLike → GenSeqLike

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

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

    Applies a binary operator to all elements of this synchronized queue 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 queue, 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 queue.

    Definition Classes
      TraversableOnce → GenTraversableOnce

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

    Definition Classes
      AnyRef

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

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

    Appends all elements of this synchronized queue to a string builder.

    Appends all elements of this synchronized queue to a string builder. The written text consists of the string representations (w.r.t. the method `toString`) of all elements of this synchronized queue 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

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

    Appends all elements of this synchronized queue to a string builder using a separator string.

    Appends all elements of this synchronized queue 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 queue, 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

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

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

    Appends all elements of this synchronized queue 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 queue 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

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

    Aggregates the results of applying an operator to subsequent elements.

    Aggregates the results of applying an operator to subsequent elements.

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

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

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

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

    B

      the type of accumulated results

    z

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

    seqop

      an operator used to accumulate results within a partition

    combop

      an associative operator used to combine results from different partitions

    Definition Classes
      TraversableOnce → GenTraversableOnce

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

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

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

    C

      the result type of the transformation function.

    k

      the transformation function

    returns

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

    Definition Classes
      PartialFunction → Function1

23. #### def appendElem(elem: A): Unit

    Attributes
      protected
    Definition Classes
      MutableList

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

    Returns the `n`-th element of this list.

    Returns the `n`-th element of this list.

    returns

      the element of this synchronized queue at index `idx`, where `0` indicates the first element.

    Definition Classes
      MutableList → LinearSeqOptimized → SeqLike → GenSeqLike → Function1
    Exceptions thrown
      IndexOutOfBoundsException

      if index does not exist.

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

26. #### 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 queue should be compared

    returns

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

    Definition Classes
      IterableLike → Equals

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

    Removes all elements from the queue.

    Removes all elements from the queue. After this operation is completed, the queue will be empty.

    Definition Classes
      SynchronizedQueue → MutableList → Builder → Growable

28. #### def clone(): Queue[A]

    Create a copy of the receiver object.

    Create a copy of the receiver object.

    The default implementation of the `clone` method is platform dependent.

    returns

      a copy of the receiver object.

    Definition Classes
      Cloneable → AnyRef
    Note

      not specified by SLS as a member of AnyRef

29. #### def collect[B](pf: PartialFunction[A, B]): SynchronizedQueue[B]

    [use case]

    [use case]
    B

      the element type of the returned collection.

    pf

      the partial function which filters and maps the synchronized queue.

    returns

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

    Definition Classes
      TraversableLike → GenTraversableLike

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

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

    Finds the first element of the synchronized queue 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)`

31. #### def combinations(n: Int): Iterator[MutableList[A]]

    Iterates over combinations.

    Iterates over combinations.

    returns

      An Iterator which traverses the possible n-element combinations of this synchronized queue.

    Definition Classes
      SeqLike
    Example:

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

32. #### def companion: GenericCompanion[Queue]

    The factory companion object that builds instances of class SynchronizedQueue.

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

    Definition Classes
      Queue → MutableList → LinearSeq → LinearSeq → Seq → Iterable → Traversable → Seq → GenSeq → Iterable → GenIterable → Traversable → GenTraversable → GenericTraversableTemplate

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

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

    Tests whether this synchronized queue contains a given value as an element.

    Tests whether this synchronized queue contains a given value as an element.

    elem

      the element to test.

    returns

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

    Definition Classes
      SeqLike

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

    Tests whether this synchronized queue contains a given sequence as a slice.

    Tests whether this synchronized queue contains a given sequence as a slice.

    that

      the sequence to test

    returns

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

    Definition Classes
      SeqLike

36. #### 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
      IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

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

    [use case]

    [use case]
    xs

      the array to fill.

    Definition Classes
      TraversableOnce → GenTraversableOnce

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

    [use case]

    [use case]
    xs

      the array to fill.

    start

      the starting index.

    Definition Classes
      TraversableOnce → GenTraversableOnce

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

    Copies all elements of this synchronized queue to a buffer.

    Copies all elements of this synchronized queue to a buffer.

    dest

      The buffer to which elements are copied.

    Definition Classes
      TraversableOnce

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

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

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

    Definition Classes
      LinearSeqLike → SeqLike → GenSeqLike
    Annotations
      @tailrec()

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

    Counts the number of elements in the synchronized queue which satisfy a predicate.

    Counts the number of elements in the synchronized queue which satisfy a predicate.

    p

      the predicate used to test elements.

    returns

      the number of elements satisfying the predicate `p`.

    Definition Classes
      LinearSeqOptimized → TraversableOnce → GenTraversableOnce

42. #### def dequeue(): A

    Returns the first element in the queue, and removes this element from the queue.

    Returns the first element in the queue, and removes this element from the queue.

    returns

      the first element of the queue.

    Definition Classes
      SynchronizedQueue → Queue

43. #### def dequeueAll(p: (A) ⇒ Boolean): Seq[A]

    Returns all elements in the queue which satisfy the given predicate, and removes those elements from the queue.

    Returns all elements in the queue which satisfy the given predicate, and removes those elements from the queue.

    p

      the predicate used for choosing elements

    returns

      a sequence of all elements in the queue for which p yields true.

    Definition Classes
      SynchronizedQueue → Queue

44. #### def dequeueFirst(p: (A) ⇒ Boolean): Option[A]

    Returns the first element in the queue which satisfies the given predicate, and removes this element from the queue.

    Returns the first element in the queue which satisfies the given predicate, and removes this element from the queue.

    p

      the predicate used for choosing the first element

    returns

      the first element of the queue for which p yields true

    Definition Classes
      SynchronizedQueue → Queue

45. #### def diff(that: Seq[A]): SynchronizedQueue[A]

    [use case]

    [use case]
    that

      the sequence of elements to remove

    returns

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

    Definition Classes
      SeqLike → GenSeqLike

46. #### def distinct: MutableList[A]

    Builds a new synchronized queue from this synchronized queue without any duplicate elements.

    Builds a new synchronized queue from this synchronized queue without any duplicate elements.

    returns

      A new synchronized queue which contains the first occurrence of every element of this synchronized queue.

    Definition Classes
      SeqLike → GenSeqLike

47. #### def drop(n: Int): MutableList[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 queue.

    returns

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

    Definition Classes
      LinearSeqOptimized → IterableLike → TraversableLike → GenTraversableLike

48. #### def dropRight(n: Int): MutableList[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 queue consisting of all elements of this synchronized queue except the last `n` ones, or else the empty synchronized queue, if this synchronized queue has less than `n` elements.

    Definition Classes
      LinearSeqOptimized → IterableLike

49. #### def dropWhile(p: (A) ⇒ Boolean): MutableList[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 queue whose first element does not satisfy the predicate `p`.

    Definition Classes
      TraversableLike → GenTraversableLike

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

    Tests whether this synchronized queue ends with the given sequence.

    Tests whether this synchronized queue ends with the given sequence.

    that

      the sequence to test

    returns

      `true` if this synchronized queue has `that` as a suffix, `false` otherwise.

    Definition Classes
      SeqLike → GenSeqLike

51. #### def enqueue(elems: A*): Unit

    Adds all elements to the queue.

    Adds all elements to the queue.

    elems

      the elements to add.

    Definition Classes
      SynchronizedQueue → Queue

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

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

    Checks if two queues are structurally identical.

    Checks if two queues are structurally identical.

    that

      The object to compare the sequence to

    returns

      true, iff both queues contain the same sequence of elements.

    Definition Classes
      SynchronizedQueue → GenSeqLike → Equals → AnyRef → Any

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

    Tests whether a predicate holds for some of the elements of this synchronized queue.

    Tests whether a predicate holds for some of the elements of this synchronized queue.

    p

      the predicate used to test elements.

    returns

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

    Definition Classes
      LinearSeqOptimized → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

55. #### def extractFirst(start: LinkedList[A], p: (A) ⇒ Boolean): Option[LinkedList[A]]

    Return the proper suffix of this list which starts with the first element that satisfies `p`.

    Return the proper suffix of this list which starts with the first element that satisfies `p`. That element is unlinked from the list. If no element satisfies `p`, return None.

    Definition Classes
      Queue

56. #### def filter(p: (A) ⇒ Boolean): MutableList[A]

    Selects all elements of this synchronized queue which satisfy a predicate.

    Selects all elements of this synchronized queue which satisfy a predicate.

    p

      the predicate used to test elements.

    returns

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

    Definition Classes
      TraversableLike → GenTraversableLike

57. #### def filterNot(p: (A) ⇒ Boolean): MutableList[A]

    Selects all elements of this synchronized queue which do not satisfy a predicate.

    Selects all elements of this synchronized queue which do not satisfy a predicate.

    p

      the predicate used to test elements.

    returns

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

    Definition Classes
      TraversableLike → GenTraversableLike

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

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

    Finds the first element of the synchronized queue satisfying a predicate, if any.

    Finds the first element of the synchronized queue satisfying a predicate, if any.

    p

      the predicate used to test elements.

    returns

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

    Definition Classes
      LinearSeqOptimized → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

60. #### var first0: LinkedList[A]

    Attributes
      protected
    Definition Classes
      MutableList

61. #### def flatMap[B](f: (A) ⇒ GenTraversableOnce[B]): SynchronizedQueue[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 queue resulting from applying the given collection-valued function `f` to each element of this synchronized queue and concatenating the results.

    Definition Classes
      TraversableLike → GenTraversableLike → FilterMonadic

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

    Folds the elements of this synchronized queue using the specified associative binary operator.

    Folds the elements of this synchronized queue using the specified associative binary operator.

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

    A1

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

    z

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

    op

      a binary operator that must be associative

    returns

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

    Definition Classes
      TraversableOnce → GenTraversableOnce

63. #### def foldLeft[B](z: B)(f: (B, A) ⇒ B): B

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

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

    B

      the result type of the binary operator.

    z

      the start value.

    returns

      the result of inserting `op` between consecutive elements of this synchronized queue, 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 queue.

    Definition Classes
      LinearSeqOptimized → TraversableOnce → GenTraversableOnce

64. #### def foldRight[B](z: B)(f: (A, B) ⇒ B): B

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

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

    B

      the result type of the binary operator.

    z

      the start value.

    returns

      the result of inserting `op` between consecutive elements of this synchronized queue, 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 queue.

    Definition Classes
      LinearSeqOptimized → IterableLike → TraversableOnce → GenTraversableOnce

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

    Tests whether a predicate holds for all elements of this synchronized queue.

    Tests whether a predicate holds for all elements of this synchronized queue.

    p

      the predicate used to test elements.

    returns

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

    Definition Classes
      LinearSeqOptimized → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

66. #### 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
      LinearSeqOptimized → IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic

67. #### def front: A

    Returns the first element in the queue, or throws an error if there is no element contained in the queue.

    Returns the first element in the queue, or throws an error if there is no element contained in the queue.

    returns

      the first element.

    Definition Classes
      SynchronizedQueue → Queue

68. #### def genericBuilder[B]: Builder[B, Queue[B]]

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

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

    Definition Classes
      GenericTraversableTemplate

69. #### def get(n: Int): Option[A]

    Returns the `n`-th element of this list or `None` if index does not exist.

    Returns the `n`-th element of this list or `None` if index does not exist.

    Definition Classes
      MutableList

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

71. #### def groupBy[K](f: (A) ⇒ K): Map[K, MutableList[A]]

    Partitions this synchronized queue into a map of synchronized queues according to some discriminator function.

    Partitions this synchronized queue into a map of synchronized queues 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 queue.

    K

      the type of keys returned by the discriminator function.

    f

      the discriminator function.

    returns

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

    Definition Classes
      TraversableLike → GenTraversableLike

72. #### def grouped(size: Int): Iterator[MutableList[A]]

    Partitions elements in fixed size synchronized queues.

    Partitions elements in fixed size synchronized queues.

    size

      the number of elements per group

    returns

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

    Definition Classes
      IterableLike
    See also

      Iterator#grouped

73. #### def hasDefiniteSize: Boolean

    Tests whether this synchronized queue is known to have a finite size.

    Tests whether this synchronized queue is known to have a finite size. All strict collections are known to have finite size. For a non-strict collection such as `Stream`, the predicate returns `true` if all elements have been computed. It returns `false` if the stream is not yet evaluated to the end.

    Note: many collection methods will not work on collections of infinite sizes.

    returns

      `true` if this collection is known to have finite size, `false` otherwise.

    Definition Classes
      TraversableLike → TraversableOnce → GenTraversableOnce

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

    Hashcodes for SynchronizedQueue produce a value from the hashcodes of all the elements of the synchronized queue.

    Hashcodes for SynchronizedQueue produce a value from the hashcodes of all the elements of the synchronized queue.

    returns

      the hash code value for this object.

    Definition Classes
      LinearSeqLike → GenSeqLike → AnyRef → Any

75. #### def head: A

    Returns the first element in this list

    Returns the first element in this list

    returns

      the first element of this synchronized queue.

    Definition Classes
      MutableList → LinearSeqOptimized → IterableLike → GenIterableLike → GenericTraversableTemplate → TraversableLike → GenTraversableLike

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

    Optionally selects the first element.

    Optionally selects the first element.

    returns

      the first element of this synchronized queue if it is nonempty, `None` if it is empty.

    Definition Classes
      TraversableLike

77. #### 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 queue that is equal (wrt `==`) to `elem`, or `-1`, if none exists.

    Definition Classes
      GenSeqLike

78. #### 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 queue that is equal (wrt `==`) to `elem`, or `-1`, if none exists.

    Definition Classes
      GenSeqLike

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

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

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

    Definition Classes
      SeqLike

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

    Finds first index where this synchronized queue contains a given sequence as a slice.

    Finds first index where this synchronized queue contains a given sequence as a slice.

    that

      the sequence to test

    returns

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

    Definition Classes
      SeqLike

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

    Definition Classes
      LinearSeqOptimized → SeqLike → GenSeqLike

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

    Definition Classes
      GenSeqLike

83. #### 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 queue.

    Definition Classes
      SeqLike

84. #### def init: MutableList[A]

    Selects all elements except the last.

    Selects all elements except the last.

    returns

      a synchronized queue consisting of all elements of this synchronized queue except the last one.

    Definition Classes
      TraversableLike
    Exceptions thrown
      `UnsupportedOperationException`

      if the synchronized queue is empty.

85. #### def inits: Iterator[MutableList[A]]

    Iterates over the inits of this synchronized queue.

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

    returns

      an iterator over all the inits of this synchronized queue

    Definition Classes
      TraversableLike
    Example:

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

86. #### def intersect(that: Seq[A]): SynchronizedQueue[A]

    [use case]

    [use case]
    that

      the sequence of elements to intersect with.

    returns

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

    Definition Classes
      SeqLike → GenSeqLike

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

    Tests whether this synchronized queue contains given index.

    Tests whether this synchronized queue contains given index.

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

    returns

      `true` if this synchronized queue contains an element at position `idx`, `false` otherwise.

    Definition Classes
      LinearSeqOptimized → GenSeqLike

88. #### def isEmpty: Boolean

    Checks if the queue is empty.

    Checks if the queue is empty.

    returns

      true, iff there is no element in the queue.

    Definition Classes
      SynchronizedQueue → MutableList → LinearSeqOptimized → IterableLike → GenIterableLike → GenericTraversableTemplate → TraversableLike → TraversableOnce → GenTraversableOnce

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

90. #### final def isTraversableAgain: Boolean

    Tests whether this synchronized queue can be repeatedly traversed.

    Tests whether this synchronized queue can be repeatedly traversed.

    returns

      `true`

    Definition Classes
      GenTraversableLike → GenTraversableOnce

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

    Returns an iterator over all elements of this list.

    Returns an iterator over all elements of this list.

    returns

      the new iterator

    Definition Classes
      MutableList → LinearSeqLike → IterableLike → GenIterableLike

92. #### def last: A

    Selects the last element.

    Selects the last element.

    returns

      The last element of this synchronized queue.

    Definition Classes
      MutableList → LinearSeqOptimized → TraversableLike
    Exceptions thrown
      NoSuchElementException

      If the synchronized queue is empty.

93. #### var last0: LinkedList[A]

    Attributes
      protected
    Definition Classes
      MutableList

94. #### 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 queue that is equal (wrt `==`) to `elem`, or `-1`, if none exists.

    Definition Classes
      GenSeqLike

95. #### 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 queue that is equal (wrt `==`) to `elem`, or `-1`, if none exists.

    Definition Classes
      GenSeqLike

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

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

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

    Definition Classes
      SeqLike

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

    Finds last index where this synchronized queue contains a given sequence as a slice.

    Finds last index where this synchronized queue contains a given sequence as a slice.

    that

      the sequence to test

    returns

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

    Definition Classes
      SeqLike

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

    Definition Classes
      LinearSeqOptimized → SeqLike → GenSeqLike

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

    Definition Classes
      GenSeqLike

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

     Optionally selects the last element.

     Optionally selects the last element.

     returns

       the last element of this synchronized queue$ if it is nonempty, `None` if it is empty.

     Definition Classes
       TraversableLike

101. #### var len: Int

     Attributes
       protected
     Definition Classes
       MutableList

102. #### def length: Int

     Returns the length of this list.

     Returns the length of this list.

     returns

       the number of elements in this synchronized queue.

     Definition Classes
       MutableList → LinearSeqOptimized → SeqLike → GenSeqLike

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

     Compares the length of this synchronized queue to a test value.

     Compares the length of this synchronized queue 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
       LinearSeqOptimized → SeqLike

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

105. #### def map[B](f: (A) ⇒ B): SynchronizedQueue[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 queue resulting from applying the given function `f` to each element of this synchronized queue and collecting the results.

     Definition Classes
       TraversableLike → GenTraversableLike → FilterMonadic

106. #### def mapResult[NewTo](f: (MutableList[A]) ⇒ NewTo): Builder[A, NewTo]

     Creates a new builder by applying a transformation function to the results of this builder.

     Creates a new builder by applying a transformation function to the results of this builder.

     NewTo

       the type of collection returned by `f`.

     f

       the transformation function.

     returns

       a new builder which is the same as the current builder except that a transformation function is applied to this builder's result.

     Definition Classes
       Builder

107. #### def max: A

     [use case]

     [use case]
     returns

       the largest element of this synchronized queue.

     Definition Classes
       TraversableOnce → GenTraversableOnce

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

     Definition Classes
       TraversableOnce → GenTraversableOnce

109. #### def min: A

     [use case]

     [use case]
     returns

       the smallest element of this synchronized queue

     Definition Classes
       TraversableOnce → GenTraversableOnce

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

     Definition Classes
       TraversableOnce → GenTraversableOnce

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

     Attributes
       protected
     Definition Classes
       PartialFunction

112. #### def mkString: String

     Displays all elements of this synchronized queue in a string.

     Displays all elements of this synchronized queue in a string.

     returns

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

     Definition Classes
       TraversableOnce → GenTraversableOnce

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

     Displays all elements of this synchronized queue in a string using a separator string.

     Displays all elements of this synchronized queue in a string using a separator string.

     sep

       the separator string.

     returns

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

     Definition Classes
       TraversableOnce → GenTraversableOnce
     Example:

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

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

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

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

     Definition Classes
       TraversableOnce → GenTraversableOnce
     Example:

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

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

116. #### def newBuilder: Builder[A, Queue[A]]

     The builder that builds instances of type SynchronizedQueue[A]

     The builder that builds instances of type SynchronizedQueue[A]

     Attributes
       protected[this]
     Definition Classes
       Queue → MutableList → GenericTraversableTemplate → TraversableLike → HasNewBuilder

117. #### def nonEmpty: Boolean

     Tests whether the synchronized queue is not empty.

     Tests whether the synchronized queue is not empty.

     returns

       `true` if the synchronized queue contains at least one element, `false` otherwise.

     Definition Classes
       TraversableOnce → GenTraversableOnce

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

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

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

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

     Definition Classes
       PartialFunction

122. #### def padTo(len: Int, elem: A): SynchronizedQueue[A]

     [use case]

     [use case]
     len

       the target length

     elem

       the padding value

     returns

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

     Definition Classes
       SeqLike → GenSeqLike

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

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

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

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

     returns

       a combiner for the parallel collection of type `ParRepr`

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

125. #### def partition(p: (A) ⇒ Boolean): (MutableList[A], MutableList[A])

     Partitions this synchronized queue in two synchronized queues according to a predicate.

     Partitions this synchronized queue in two synchronized queues according to a predicate.

     p

       the predicate on which to partition.

     returns

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

     Definition Classes
       TraversableLike → GenTraversableLike

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

     [use case]

     [use case]
     from

       the index of the first replaced element

     replaced

       the number of elements to drop in the original synchronized queue

     returns

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

     Definition Classes
       SeqLike → GenSeqLike

127. #### def permutations: Iterator[MutableList[A]]

     Iterates over distinct permutations.

     Iterates over distinct permutations.

     returns

       An Iterator which traverses the distinct permutations of this synchronized queue.

     Definition Classes
       SeqLike
     Example:

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

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

     Definition Classes
       GenSeqLike

129. #### def prependElem(elem: A): Unit

     Attributes
       protected
     Definition Classes
       MutableList

130. #### def product: A

     [use case]

     [use case]
     returns

       the product of all elements in this synchronized queue 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 queue and as result type of `product`. Examples of such types are: `Long`, `Float`, `Double`, `BigInt`.

     Definition Classes
       TraversableOnce → GenTraversableOnce

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

     Reduces the elements of this synchronized queue using the specified associative binary operator.

     Reduces the elements of this synchronized queue 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 queue is nonempty.

     Definition Classes
       TraversableOnce → GenTraversableOnce
     Exceptions thrown
       UnsupportedOperationException

       if this synchronized queue is empty.

132. #### def reduceLeft[B >: A](f: (B, A) ⇒ B): B

     Definition Classes
       LinearSeqOptimized → TraversableOnce

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

     Optionally applies a binary operator to all elements of this synchronized queue, going left to right.

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

     Definition Classes
       TraversableOnce → GenTraversableOnce

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

     Reduces the elements of this synchronized queue, if any, using the specified associative binary operator.

     Reduces the elements of this synchronized queue, if any, using the specified associative binary operator.

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

     A1

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

     op

       A binary operator that must be associative.

     returns

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

     Definition Classes
       TraversableOnce → GenTraversableOnce

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

     Applies a binary operator to all elements of this synchronized queue, going right to left.

     Applies a binary operator to all elements of this synchronized queue, 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 queue, 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 queue.

     Definition Classes
       LinearSeqOptimized → IterableLike → TraversableOnce → GenTraversableOnce
     Exceptions thrown
       `UnsupportedOperationException`

       if this synchronized queue is empty.

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

     Optionally applies a binary operator to all elements of this synchronized queue, going right to left.

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

     Definition Classes
       TraversableOnce → GenTraversableOnce

137. #### def repr: MutableList[A]

     The collection of type synchronized queue underlying this `TraversableLike` object.

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

     Definition Classes
       TraversableLike → GenTraversableLike

138. #### def result(): MutableList[A]

     Produces a collection from the added elements.

     Produces a collection from the added elements. The builder's contents are undefined after this operation.

     returns

       a collection containing the elements added to this builder.

     Definition Classes
       MutableList → Builder

139. #### def reverse: MutableList[A]

     Returns new synchronized queue wih elements in reversed order.

     Returns new synchronized queue wih elements in reversed order.

     returns

       A new synchronized queue with all elements of this synchronized queue in reversed order.

     Definition Classes
       SeqLike → GenSeqLike

140. #### 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 queue in reversed order

     Definition Classes
       SeqLike

141. #### def reverseMap[B](f: (A) ⇒ B): SynchronizedQueue[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 queue resulting from applying the given function `f` to each element of this synchronized queue and collecting the results in reversed order.

     Definition Classes
       SeqLike → GenSeqLike

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

     Attributes
       protected[this]
     Definition Classes
       TraversableOnce

143. #### 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
       LinearSeqOptimized → IterableLike → GenIterableLike

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

     Definition Classes
       TraversableLike → GenTraversableLike

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

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

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

     B

       the type of the elements in the resulting collection

     That

       the actual type of the resulting collection

     z

       the initial value

     op

       the binary operator applied to the intermediate result and the element

     bf

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

     returns

       collection with intermediate results

     Definition Classes
       TraversableLike → GenTraversableLike

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

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

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

     Example:

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

     B

       the type of the elements in the resulting collection

     That

       the actual type of the resulting collection

     z

       the initial value

     op

       the binary operator applied to the intermediate result and the element

     bf

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

     returns

       collection with intermediate results

     Definition Classes
       TraversableLike → GenTraversableLike
     Annotations
       @migration
     Migration

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

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

     Definition Classes
       LinearSeqOptimized → SeqLike → GenSeqLike

148. #### def seq: LinearSeq[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
       LinearSeq → LinearSeq → LinearSeqLike → Seq → Seq → GenSeq → GenSeqLike → Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce

149. #### def size: Int

     The size of this synchronized queue, equivalent to `length`.

     The size of this synchronized queue, equivalent to `length`.

     returns

       the number of elements in this synchronized queue.

     Definition Classes
       SeqLike → GenTraversableLike → TraversableOnce → GenTraversableOnce

150. #### def sizeHint(coll: scala.collection.TraversableLike[_, _], delta: Int = 0): Unit

     Gives a hint that one expects the `result` of this builder to have the same size as the given collection, plus some delta.

     Gives a hint that one expects the `result` of this builder to have the same size as the given collection, plus some delta. This will provide a hint only if the collection is known to have a cheap `size` method. Currently this is assumed to be the case if and only if the collection is of type `IndexedSeqLike`. Some builder classes will optimize their representation based on the hint. However, builder implementations are still required to work correctly even if the hint is wrong, i.e. a different number of elements is added.

     coll

       the collection which serves as a hint for the result's size.

     delta

       a correction to add to the `coll.size` to produce the size hint.

     Definition Classes
       Builder

151. #### def sizeHint(size: Int): Unit

     Gives a hint how many elements are expected to be added when the next `result` is called.

     Gives a hint how many elements are expected to be added when the next `result` is called. Some builder classes will optimize their representation based on the hint. However, builder implementations are still required to work correctly even if the hint is wrong, i.e. a different number of elements is added.

     size

       the hint how many elements will be added.

     Definition Classes
       Builder

152. #### def sizeHintBounded(size: Int, boundingColl: scala.collection.TraversableLike[_, _]): Unit

     Gives a hint how many elements are expected to be added when the next `result` is called, together with an upper bound given by the size of some other collection.

     Gives a hint how many elements are expected to be added when the next `result` is called, together with an upper bound given by the size of some other collection. Some builder classes will optimize their representation based on the hint. However, builder implementations are still required to work correctly even if the hint is wrong, i.e. a different number of elements is added.

     size

       the hint how many elements will be added.

     boundingColl

       the bounding collection. If it is an IndexedSeqLike, then sizes larger than collection's size are reduced.

     Definition Classes
       Builder

153. #### def slice(from: Int, until: Int): MutableList[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 queue.

     until

       the highest index to EXCLUDE from this synchronized queue.

     returns

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

     Definition Classes
       LinearSeqOptimized → IterableLike → TraversableLike → GenTraversableLike

154. #### def sliding(size: Int, step: Int): Iterator[MutableList[A]]

     Definition Classes
       IterableLike

155. #### def sliding(size: Int): Iterator[MutableList[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 queues 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

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

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

     Sorts this SynchronizedQueue 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 queue consisting of the elements of this synchronized queue 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

157. #### def sortWith(lt: (A, A) ⇒ Boolean): MutableList[A]

     Sorts this synchronized queue according to a comparison function.

     Sorts this synchronized queue 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 queue consisting of the elements of this synchronized queue 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")

158. #### def sorted[B >: A](implicit ord: Ordering[B]): MutableList[A]

     Sorts this synchronized queue according to an Ordering.

     Sorts this synchronized queue 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 queue consisting of the elements of this synchronized queue sorted according to the ordering `ord`.

     Definition Classes
       SeqLike
     See also

       scala.math.Ordering

159. #### def span(p: (A) ⇒ Boolean): (MutableList[A], MutableList[A])

     Splits this synchronized queue into a prefix/suffix pair according to a predicate.

     Splits this synchronized queue 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 queue whose elements all satisfy `p`, and the rest of this synchronized queue.

     Definition Classes
       LinearSeqOptimized → TraversableLike → GenTraversableLike

160. #### def splitAt(n: Int): (MutableList[A], MutableList[A])

     Splits this synchronized queue into two at a given position.

     Splits this synchronized queue 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 queues consisting of the first `n` elements of this synchronized queue, and the other elements.

     Definition Classes
       TraversableLike → GenTraversableLike

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

     Tests whether this synchronized queue contains the given sequence at a given index.

     Tests whether this synchronized queue 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 queue at index `offset`, otherwise `false`.

     Definition Classes
       SeqLike → GenSeqLike

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

     Tests whether this synchronized queue starts with the given sequence.

     Tests whether this synchronized queue 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

163. #### 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 synchronized queue. By default the string prefix is the simple name of the collection class synchronized queue.

     Definition Classes
       TraversableLike → GenTraversableLike

164. #### def sum: A

     [use case]

     [use case]
     returns

       the sum of all elements in this synchronized queue 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 queue and as result type of `sum`. Examples of such types are: `Long`, `Float`, `Double`, `BigInt`.

     Definition Classes
       TraversableOnce → GenTraversableOnce

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

     Definition Classes
       AnyRef

166. #### def tail: MutableList[A]

     Returns the rest of this list

     Returns the rest of this list

     returns

       a synchronized queue consisting of all elements of this synchronized queue except the first one.

     Definition Classes
       MutableList → LinearSeqOptimized → TraversableLike → GenTraversableLike

167. #### def tails: Iterator[MutableList[A]]

     Iterates over the tails of this synchronized queue.

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

     returns

       an iterator over all the tails of this synchronized queue

     Definition Classes
       TraversableLike
     Example:

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

168. #### def take(n: Int): MutableList[A]

     Selects first n elements.

     Selects first n elements.

     n

       Tt number of elements to take from this synchronized queue.

     returns

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

     Definition Classes
       LinearSeqOptimized → IterableLike → TraversableLike → GenTraversableLike

169. #### def takeRight(n: Int): MutableList[A]

     Selects last n elements.

     Selects last n elements.

     n

       the number of elements to take

     returns

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

     Definition Classes
       IterableLike

170. #### def takeWhile(p: (A) ⇒ Boolean): MutableList[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 queue whose elements all satisfy the predicate `p`.

     Definition Classes
       LinearSeqOptimized → IterableLike → TraversableLike → GenTraversableLike

171. #### def thisCollection: LinearSeq[A]

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

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

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

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

     [use case]

     [use case]
     returns

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

     Definition Classes
       TraversableOnce → GenTraversableOnce

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

     Converts this synchronized queue to a mutable buffer.

     Converts this synchronized queue to a mutable buffer.

     returns

       a buffer containing all elements of this synchronized queue.

     Definition Classes
       TraversableOnce → GenTraversableOnce

174. #### def toCollection(repr: MutableList[A]): LinearSeq[A]

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

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

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

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

     Converts this synchronized queue to an indexed sequence.

     Converts this synchronized queue to an indexed sequence.

     returns

       an indexed sequence containing all elements of this synchronized queue.

     Definition Classes
       TraversableOnce → GenTraversableOnce

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

     Converts this synchronized queue to an iterable collection.

     Converts this synchronized queue 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 queue.

     Definition Classes
       IterableLike → TraversableOnce → GenTraversableOnce

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

     Returns an Iterator over the elements in this synchronized queue.

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

     returns

       an Iterator containing all elements of this synchronized queue.

     Definition Classes
       IterableLike → TraversableLike → GenTraversableOnce

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

     Returns an instance of scala.List containing the same sequence of elements.

     Returns an instance of scala.List containing the same sequence of elements.

     returns

       a list containing all elements of this synchronized queue.

     Definition Classes
       MutableList → TraversableOnce → GenTraversableOnce

179. #### 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 queue.

     Definition Classes
       TraversableOnce → GenTraversableOnce

180. #### def toQueue: Queue[A]

     Definition Classes
       MutableList

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

     Converts this synchronized queue to a sequence.

     Converts this synchronized queue to a sequence.

     Overridden for efficiency.

     returns

       a sequence containing all elements of this synchronized queue.

     Definition Classes
       SeqLike → GenSeqLike → TraversableOnce → GenTraversableOnce

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

     Converts this synchronized queue to a set.

     Converts this synchronized queue to a set.

     returns

       a set containing all elements of this synchronized queue.

     Definition Classes
       TraversableOnce → GenTraversableOnce

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

     Converts this synchronized queue to a stream.

     Converts this synchronized queue to a stream.

     returns

       a stream containing all elements of this synchronized queue.

     Definition Classes
       IterableLike → TraversableLike → GenTraversableOnce

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

     Returns a textual representation of a queue as a string.

     Returns a textual representation of a queue as a string.

     returns

       the string representation of this queue.

     Definition Classes
       SynchronizedQueue → SeqLike → Function1 → TraversableLike → AnyRef → Any

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

     Converts this synchronized queue to an unspecified Traversable.

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

     returns

       a Traversable containing all elements of this synchronized queue.

     Definition Classes
       TraversableLike → TraversableOnce → GenTraversableOnce

186. #### def transform(f: (A) ⇒ A): SynchronizedQueue.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 union(that: Seq[A]): SynchronizedQueue[A]

     [use case]

     [use case]
     that

       the sequence to add.

     returns

       a new synchronized queue which contains all elements of this synchronized queue followed by all elements of `that`.

     Definition Classes
       SeqLike → GenSeqLike

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

     Converts this synchronized queue of pairs into two collections of the first and second half of each pair.

     Converts this synchronized queue 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 queue is a pair.

     returns

       a pair synchronized queues, containing the first, respectively second half of each element pair of this synchronized queue.

     Definition Classes
       GenericTraversableTemplate

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

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

     Converts this synchronized queue 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 queue is a triple.

     returns

       a triple synchronized queues, containing the first, second, respectively third member of each element triple of this synchronized queue.

     Definition Classes
       GenericTraversableTemplate

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

     Updates the `n`-th element of this list to a new value.

     Updates the `n`-th element of this list to a new value.

     n

       the index of the element to replace.

     Definition Classes
       MutableList → SeqLike
     Exceptions thrown
       IndexOutOfBoundsException

       if index does not exist.

191. #### def updated(index: Int, elem: A): SynchronizedQueue[A]

     [use case]

     [use case]
     index

       the position of the replacement

     elem

       the replacing element

     returns

       a copy of this synchronized queue with the element at position `index` replaced by `elem`.

     Definition Classes
       SeqLike → GenSeqLike

192. #### def view(from: Int, until: Int): SeqView[A, MutableList[A]]

     Creates a non-strict view of a slice of this synchronized queue.

     Creates a non-strict view of a slice of this synchronized queue.

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

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

     Definition Classes
       SeqLike → IterableLike → TraversableLike

193. #### def view: SeqView[A, MutableList[A]]

     Creates a non-strict view of this synchronized queue.

     Creates a non-strict view of this synchronized queue.

     returns

       a non-strict view of this synchronized queue.

     Definition Classes
       SeqLike → IterableLike → TraversableLike

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

     Definition Classes
       AnyRef
     Annotations
       @throws()

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

     Definition Classes
       AnyRef
     Annotations
       @throws()

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

     Definition Classes
       AnyRef
     Annotations
       @throws()

197. #### def withFilter(p: (A) ⇒ Boolean): FilterMonadic[A, MutableList[A]]

     Creates a non-strict filter of this synchronized queue.

     Creates a non-strict filter of this synchronized queue.

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

     Definition Classes
       TraversableLike → FilterMonadic

198. #### def zip[B](that: GenIterable[B]): SynchronizedQueue[(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 queue containing pairs consisting of corresponding elements of this synchronized queue and `that`. The length of the returned collection is the minimum of the lengths of this synchronized queue and `that`.

     Definition Classes
       IterableLike → GenIterableLike

199. #### def zipAll[B](that: Iterable[B], thisElem: A, thatElem: B): SynchronizedQueue[(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 queue is shorter than `that`.

     thatElem

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

     returns

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

     Definition Classes
       IterableLike → GenIterableLike

200. #### def zipWithIndex: SynchronizedQueue[(A, Int)]

     [use case]

     [use case]
     returns

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

     Definition Classes
       IterableLike → GenIterableLike

### Inherited from Queue[A]

### Inherited from MutableList[A]

### Inherited from Serializable

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

### Inherited from Growable[A]

### Inherited from LinearSeqOptimized[A, MutableList[A]]

### Inherited from LinearSeq[A]

### Inherited from LinearSeqLike[A, MutableList[A]]

### Inherited from AbstractSeq[A]

### Inherited from Seq[A]

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

### Inherited from Cloneable[Queue[A]]

### Inherited from Iterable[A]

### Inherited from Traversable[A]

### Inherited from Mutable

### Inherited from AbstractSeq[A]

### Inherited from Seq[A]

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

### Inherited from GenSeq[A]

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

### Inherited from PartialFunction[Int, A]

### Inherited from (Int) ⇒ A

### Inherited from AbstractIterable[A]

### Inherited from Iterable[A]

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

### Inherited from Equals

### Inherited from GenIterable[A]

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

### Inherited from AbstractTraversable[A]

### Inherited from Traversable[A]

### Inherited from GenTraversable[A]

### Inherited from GenericTraversableTemplate[A, Queue]

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

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

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

### Inherited from TraversableOnce[A]

### Inherited from GenTraversableOnce[A]

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

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

### Inherited from AnyRef

### Inherited from Any