scala.collection.mutable

# QueueProxy

#### trait QueueProxy[A] extends Queue[A] with Proxy

`Queue` objects implement data structures that allow to insert and retrieve elements in a first-in-first-out (FIFO) manner.

A

  type of the elements in this queue proxy.

Source
  QueueProxy.scala
Version

  1.1, 03/05/2004

Since

  1

Linear Supertypes
Proxy, Queue[A], MutableList[A], Serializable, java.io.Serializable, Builder[A, MutableList[A]], Growable[A], Clearable, LinearSeqOptimized[A, Queue[A]], LinearSeq[A], collection.LinearSeq[A], LinearSeqLike[A, Queue[A]], AbstractSeq[A], Seq[A], SeqLike[A, Seq[A]], Cloneable[Queue[A]], scala.Cloneable, java.lang.Cloneable, Iterable[A], Traversable[A], Mutable, collection.AbstractSeq[A], collection.Seq[A], collection.SeqLike[A, Queue[A]], GenSeq[A], GenSeqLike[A, Queue[A]], PartialFunction[Int, A], (Int) ⇒ A, collection.AbstractIterable[A], collection.Iterable[A], IterableLike[A, Queue[A]], Equals, GenIterable[A], GenIterableLike[A, Queue[A]], AbstractTraversable[A], collection.Traversable[A], GenTraversable[A], GenericTraversableTemplate[A, Queue], TraversableLike[A, Queue[A]], GenTraversableLike[A, Queue[A]], Parallelizable[A, ParSeq[A]], TraversableOnce[A], GenTraversableOnce[A], FilterMonadic[A, Queue[A]], HasNewBuilder[A, Queue[A]], AnyRef, Any
Type Hierarchy Learn more about scaladoc diagrams
Ordering

1. Alphabetic
2. By inheritance

Inherited

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

Implicitly

1. by traversable2ops
2. by MonadOps
3. by any2stringadd
4. by any2stringfmt
5. by any2ArrowAssoc
6. by any2Ensuring
7. by alternateImplicit

1. Hide All
2. Show all

Learn more about member selection
Visibility

1. Public
2. All

### Type Members

1. #### type Self = Queue[A]

   The type implementing this traversable

   The type implementing this traversable

   Attributes
     protected
   Definition Classes
     TraversableLike

2. #### class WithFilter extends FilterMonadic[A, Repr]

   A class supporting filtered operations.

### Abstract Value Members

1. #### abstract def self: Queue[A]

   Definition Classes
     QueueProxy → Proxy

### Concrete Value Members

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

   Definition Classes
     AnyRef

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

   Test two objects for inequality.

   Test two objects for inequality.

   returns

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

   Definition Classes
     Any

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

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

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

   returns

     a hash value consistent with ==

   Definition Classes
     AnyRef → Any

4. #### def +(other: String): String

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

5. #### def ++[B](that: GenTraversableOnce[B]): Queue[B]

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

   [use case]

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

   Example:

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

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

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

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

       scala> val e = c ++ d
       e: scala.collection.mutable.LinkedList[AnyVal] = LinkedList(1, 2, a)

   B

     the element type of the returned collection.

   that

     the traversable to append.

   returns

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

   Definition Classes
     TraversableLike → GenTraversableLike
   Full Signature

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

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

   Definition Classes
     TraversableLike

7. #### def ++:[B](that: TraversableOnce[B]): Queue[B]

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

   [use case]

   As with `++`, returns a new collection containing the elements from the left operand followed by the elements from the right operand.

   It differs from `++` in that the right operand determines the type of the resulting collection rather than the left one. Mnemonic: the COLon is on the side of the new COLlection type.

   Example:

       scala> val x = List(1)
       x: List[Int] = List(1)

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

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

   B

     the element type of the returned collection.

   that

     the traversable to append.

   returns

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

   Definition Classes
     TraversableLike
   Full Signature

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

8. #### def ++=(it: TraversableOnce[A]): QueueProxy.this.type

   Adds all elements provided by an iterator at the end of the queue.

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

   it

     an iterator

   returns

     the mutable queue itself.

   Definition Classes
     QueueProxy → Growable

9. #### def +:(elem: A): Queue[A]

   [use case] A copy of the mutable queue with an element prepended.

   [use case]

   A copy of the mutable queue with an element prepended.

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

   Also, the original mutable queue is not modified, so you will want to capture the result.

   Example:

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

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

       scala> println(x)
       LinkedList(1)

   elem

     the prepended element

   returns

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

   Definition Classes
     SeqLike → GenSeqLike
   Full Signature

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

10. #### def +=(elem: A): QueueProxy.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
      QueueProxy → MutableList → Builder → Growable

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

    adds two or more elements to this mutable queue.

    adds two or more elements to this mutable queue.

    elem1

      the first element to add.

    elem2

      the second element to add.

    elems

      the remaining elements to add.

    returns

      the mutable queue itself

    Definition Classes
      Growable

12. #### def +=:(elem: A): QueueProxy.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 mutable queue.

    Definition Classes
      MutableList

13. #### def ->[B](y: B): (QueueProxy[A], B)

    Implicit information
      This member is added by an implicit conversion from QueueProxy[A] to ArrowAssoc[QueueProxy[A]] performed by method any2ArrowAssoc in scala.Predef.
    Definition Classes
      ArrowAssoc
    Annotations
      @inline()

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

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

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

          op(...op(op(z, x_1), x_2), ..., x_n)

      where `x1, ..., xn` are the elements of this mutable queue.

    Definition Classes
      TraversableOnce → GenTraversableOnce

15. #### def :+(elem: A): Queue[A]

    [use case] A copy of this mutable queue with an element appended.

    [use case]

    A copy of this mutable queue with an element appended.

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

    Example:

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

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

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

        scala> println(a)
        LinkedList(1)

    elem

      the appended element

    returns

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

    Definition Classes
      SeqLike → GenSeqLike
    Full Signature

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

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

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

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

          op(x_1, op(x_2, ... op(x_n, z)...))

      where `x1, ..., xn` are the elements of this mutable queue.

    Definition Classes
      TraversableOnce → GenTraversableOnce

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

    Definition Classes
      AnyRef

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

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

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

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

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

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

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

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

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

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

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

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

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

    Attributes
      protected
    Definition Classes
      MutableList

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

    Access element number `n`.

    Access element number `n`.

    returns

      the element at index `n`.

    Definition Classes
      QueueProxy → MutableList → LinearSeqOptimized → SeqLike → GenSeqLike → Function1

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

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

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

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

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

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

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

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

    x

      the function argument

    default

      the fallback function

    returns

      the result of this function or fallback function application.

    Definition Classes
      PartialFunction
    Since

      2.10

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

28. #### def asParIterable: ParIterable[A]

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

29. #### def asParSeq: ParSeq[A]

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

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

    returns

      `true`, if this mutable 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

31. #### 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
      QueueProxy → MutableList → Builder → Growable → Clearable

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

    This method clones the queue.

    This method clones the queue.

    returns

      a queue with the same elements.

    Definition Classes
      QueueProxy → Queue → MutableList → Cloneable → AnyRef

33. #### def collect[B](pf: PartialFunction[A, B]): Queue[B]

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

    [use case]

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

    B

      the element type of the returned collection.

    pf

      the partial function which filters and maps the mutable queue.

    returns

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

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

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

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

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

35. #### def combinations(n: Int): Iterator[Queue[A]]

    Iterates over combinations.

    Iterates over combinations.

    returns

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

    Definition Classes
      SeqLike
    Example:

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

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

    The factory companion object that builds instances of class `mutable.Queue`.

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

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

37. #### def compose[A](g: (A) ⇒ Int): (A) ⇒ A

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

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

    A

      the type to which function `g` can be applied

    g

      a function A => T1

    returns

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

    Definition Classes
      Function1
    Annotations
      @unspecialized()

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

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

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

    elem

      the element to test.

    returns

      `true` if this mutable queue has an element that is equal (as determined by `==`) to `elem`, `false` otherwise.

    Definition Classes
      LinearSeqOptimized → SeqLike

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

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

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

    that

      the sequence to test

    returns

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

    Definition Classes
      SeqLike

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

    [use case] Copies elements of this mutable queue to an array.

    [use case]

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

    xs

      the array to fill.

    start

      the starting index.

    len

      the maximal number of elements to copy.

    Definition Classes
      IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
    Full Signature

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

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

    [use case] Copies values of this mutable queue to an array.

    [use case]

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

    xs

      the array to fill.

    Definition Classes
      TraversableOnce → GenTraversableOnce
    Full Signature

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

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

    [use case] Copies values of this mutable queue to an array.

    [use case]

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

    xs

      the array to fill.

    start

      the starting index.

    Definition Classes
      TraversableOnce → GenTraversableOnce
    Full Signature

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

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

    Copies all elements of this mutable queue to a buffer.

    Copies all elements of this mutable queue to a buffer.

    dest

      The buffer to which elements are copied.

    Definition Classes
      TraversableOnce

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

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

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

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

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

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

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

    p

      the predicate used to test elements.

    returns

      the number of elements satisfying the predicate `p`.

    Definition Classes
      TraversableOnce → GenTraversableOnce

46. #### 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
      QueueProxy → Queue

47. #### 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
      Queue

48. #### 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
      Queue

49. #### def diff(that: collection.Seq[A]): Queue[A]

    [use case] Computes the multiset difference between this mutable queue and another sequence.

    [use case]

    Computes the multiset difference between this mutable queue and another sequence.

    that

      the sequence of elements to remove

    returns

      a new mutable queue which contains all elements of this mutable 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
    Full Signature

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

50. #### def distinct: Queue[A]

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

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

    returns

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

    Definition Classes
      SeqLike → GenSeqLike

51. #### def drop(n: Int): Queue[A]

    Selects all elements except first n ones.

    Selects all elements except first n ones.

    n

      the number of elements to drop from this mutable queue.

    returns

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

    Definition Classes
      LinearSeqOptimized → IterableLike → TraversableLike → GenTraversableLike

52. #### def dropRight(n: Int): Queue[A]

    Selects all elements except last n ones.

    Selects all elements except last n ones.

    n

      The number of elements to take

    returns

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

    Definition Classes
      LinearSeqOptimized → IterableLike

53. #### def dropWhile(p: (A) ⇒ Boolean): Queue[A]

    Drops longest prefix of elements that satisfy a predicate.

    Drops longest prefix of elements that satisfy a predicate.

    returns

      the longest suffix of this mutable queue whose first element does not satisfy the predicate `p`.

    Definition Classes
      TraversableLike → GenTraversableLike

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

    Tests whether this mutable queue ends with the given sequence.

    Tests whether this mutable queue ends with the given sequence.

    that

      the sequence to test

    returns

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

    Definition Classes
      SeqLike → GenSeqLike

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

    Adds all elements to the queue.

    Adds all elements to the queue.

    elems

      the elements to add.

    Definition Classes
      QueueProxy → Queue

56. #### def ensuring(cond: (QueueProxy[A]) ⇒ Boolean, msg: ⇒ Any): QueueProxy[A]

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

57. #### def ensuring(cond: (QueueProxy[A]) ⇒ Boolean): QueueProxy[A]

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

58. #### def ensuring(cond: Boolean, msg: ⇒ Any): QueueProxy[A]

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

59. #### def ensuring(cond: Boolean): QueueProxy[A]

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

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

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

    Compares the receiver object (`this`) with the argument object (`that`) for equivalence.

    Compares the receiver object (`this`) with the argument object (`that`) for equivalence.

    Any implementation of this method should be an equivalence relation:

    - It is reflexive: for any instance `x` of type `Any`, `x.equals(x)` should return `true`.
    - It is symmetric: for any instances `x` and `y` of type `Any`, `x.equals(y)` should return `true` if and only if `y.equals(x)` returns `true`.
    - It is transitive: for any instances `x`, `y`, and `z` of type `AnyRef` if `x.equals(y)` returns `true` and `y.equals(z)` returns `true`, then `x.equals(z)` should return `true`.

    If you override this method, you should verify that your implementation remains an equivalence relation. Additionally, when overriding this method it is usually necessary to override `hashCode` to ensure that objects which are "equal" (`o1.equals(o2)` returns `true`) hash to the same scala.Int. (`o1.hashCode.equals(o2.hashCode)`).

    that

      the object to compare against this object for equality.

    returns

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

    Definition Classes
      Proxy → Any

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

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

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

    p

      the predicate used to test elements.

    returns

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

    Definition Classes
      LinearSeqOptimized → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

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

64. #### def filter(p: (A) ⇒ Boolean): Queue[A]

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

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

    p

      the predicate used to test elements.

    returns

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

    Definition Classes
      TraversableLike → GenTraversableLike

65. #### def filterNot(p: (A) ⇒ Boolean): Queue[A]

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

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

    p

      the predicate used to test elements.

    returns

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

    Definition Classes
      TraversableLike → GenTraversableLike

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

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

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

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

    Attributes
      protected[java.lang]
    Definition Classes
      AnyRef
    Annotations
      @throws( classOf[java.lang.Throwable] )
    Note

      not specified by SLS as a member of AnyRef

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

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

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

    p

      the predicate used to test elements.

    returns

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

    Definition Classes
      LinearSeqOptimized → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

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

    Attributes
      protected
    Definition Classes
      MutableList

69. #### def flatMap[B](f: (A) ⇒ GenTraversableOnce[B]): Queue[B]

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

    [use case]

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

    For example:

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

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

        // lettersOf will return a Seq[Char] of likely repeated letters, instead of a Set
        def lettersOf(words: Seq[String]) = words flatMap (word => word.toSet)

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

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

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

    B

      the element type of the returned collection.

    f

      the function to apply to each element.

    returns

      a new mutable queue resulting from applying the given collection-valued function `f` to each element of this mutable queue and concatenating the results.

    Definition Classes
      TraversableLike → GenTraversableLike → FilterMonadic
    Full Signature

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

70. #### def flatten[B]: Queue[B]

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

    [use case]

    Converts this mutable queue of traversable collections into a mutable queue formed by the elements of these traversable collections.

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

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

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

    B

      the type of the elements of each traversable collection.

    returns

      a new mutable queue resulting from concatenating all element mutable queues.

    Definition Classes
      GenericTraversableTemplate
    Full Signature

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

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

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

    Folds the elements of this mutable 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

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

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

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

          op(...op(z, x_1), x_2, ..., x_n)

      where `x1, ..., xn` are the elements of this mutable queue.

    Definition Classes
      LinearSeqOptimized → TraversableOnce → GenTraversableOnce

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

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

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

          op(x_1, op(x_2, ... op(x_n, z)...))

      where `x1, ..., xn` are the elements of this mutable queue.

    Definition Classes
      LinearSeqOptimized → IterableLike → TraversableOnce → GenTraversableOnce

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

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

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

    p

      the predicate used to test elements.

    returns

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

    Definition Classes
      LinearSeqOptimized → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

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

    [use case] Applies a function `f` to all elements of this mutable queue.

    [use case]

    Applies a function `f` to all elements of this mutable queue.

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

    f

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

    Definition Classes
      LinearSeqOptimized → IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
    Full Signature

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

76. #### def formatted(fmtstr: String): String

    Returns string formatted according to given `format` string.

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

    Implicit information
      This member is added by an implicit conversion from QueueProxy[A] to StringFormat performed by method any2stringfmt in scala.Predef.
    Definition Classes
      StringFormat
    Annotations
      @inline()

77. #### 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
      QueueProxy → Queue

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

    The generic builder that builds instances of `mutable.Queue` at arbitrary element types.

    The generic builder that builds instances of `mutable.Queue` at arbitrary element types.

    Definition Classes
      GenericTraversableTemplate

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

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

81. #### def groupBy[K](f: (A) ⇒ K): immutable.Map[K, Queue[A]]

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

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

    K

      the type of keys returned by the discriminator function.

    f

      the discriminator function.

    returns

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

    Definition Classes
      TraversableLike → GenTraversableLike

82. #### def grouped(size: Int): Iterator[Queue[A]]

    Partitions elements in fixed size mutable queues.

    Partitions elements in fixed size mutable queues.

    size

      the number of elements per group

    returns

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

    Definition Classes
      IterableLike
    See also

      scala.collection.Iterator, method `grouped`

83. #### def hasDefiniteSize: Boolean

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

    Tests whether this mutable 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

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

    Calculate a hash code value for the object.

    Calculate a hash code value for the object.

    The default hashing algorithm is platform dependent.

    Note that it is allowed for two objects to have identical hash codes (`o1.hashCode.equals(o2.hashCode)`) yet not be equal (`o1.equals(o2)` returns `false`). A degenerate implementation could always return `0`. However, it is required that if two objects are equal (`o1.equals(o2)` returns `true`) that they have identical hash codes (`o1.hashCode.equals(o2.hashCode)`). Therefore, when overriding this method, be sure to verify that the behavior is consistent with the `equals` method.

    returns

      the hash code value for this object.

    Definition Classes
      Proxy → Any

85. #### def head: A

    Returns the first element in this list

    Returns the first element in this list

    returns

      the first element of this mutable queue.

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

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

    Optionally selects the first element.

    Optionally selects the first element.

    returns

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

    Definition Classes
      TraversableLike → GenTraversableLike

87. #### def ifParSeq[R](isbody: (ParSeq[A]) ⇒ R): (TraversableOps[A])#Otherwise[R]

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

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

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

    [use case]

    Finds index of first occurrence of some value in this mutable queue after or at some start index.

    elem

      the element value to search for.

    from

      the start index

    returns

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

    Definition Classes
      GenSeqLike
    Full Signature

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

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

    [use case] Finds index of first occurrence of some value in this mutable queue.

    [use case]

    Finds index of first occurrence of some value in this mutable queue.

    elem

      the element value to search for.

    returns

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

    Definition Classes
      GenSeqLike
    Full Signature

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

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

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

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

    Definition Classes
      SeqLike

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

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

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

    that

      the sequence to test

    returns

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

    Definition Classes
      SeqLike

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

    Definition Classes
      LinearSeqOptimized → SeqLike → GenSeqLike

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

    Definition Classes
      GenSeqLike

94. #### def indices: immutable.Range

    Produces the range of all indices of this sequence.

    Produces the range of all indices of this sequence.

    returns

      a `Range` value from `0` to one less than the length of this mutable queue.

    Definition Classes
      SeqLike

95. #### def init: Queue[A]

    Selects all elements except the last.

    Selects all elements except the last.

    returns

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

    Definition Classes
      TraversableLike → GenTraversableLike
    Exceptions thrown
      `UnsupportedOperationException`

      if the mutable queue is empty.

96. #### def inits: Iterator[Queue[A]]

    Iterates over the inits of this mutable queue.

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

    returns

      an iterator over all the inits of this mutable queue

    Definition Classes
      TraversableLike
    Example:

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

97. #### def intersect(that: collection.Seq[A]): Queue[A]

    [use case] Computes the multiset intersection between this mutable queue and another sequence.

    [use case]

    Computes the multiset intersection between this mutable queue and another sequence.

    that

      the sequence of elements to intersect with.

    returns

      a new mutable queue which contains all elements of this mutable 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
    Full Signature

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

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

    Tests whether this mutable queue contains given index.

    Tests whether this mutable queue contains given index.

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

    returns

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

    Definition Classes
      LinearSeqOptimized → GenSeqLike

99. #### 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
      QueueProxy → MutableList → LinearSeqOptimized → SeqLike → IterableLike → GenericTraversableTemplate → TraversableLike → TraversableOnce → GenTraversableOnce

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

101. #### def isParIterable: Boolean

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

102. #### def isParSeq: Boolean

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

103. #### def isParallel: Boolean

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

104. #### final def isTraversableAgain: Boolean

     Tests whether this mutable queue can be repeatedly traversed.

     Tests whether this mutable queue can be repeatedly traversed.

     returns

       `true`

     Definition Classes
       TraversableLike → GenTraversableLike → GenTraversableOnce

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

     Returns an iterator over all elements on the queue.

     Returns an iterator over all elements on the queue.

     returns

       an iterator over all queue elements.

     Definition Classes
       QueueProxy → MutableList → LinearSeqLike → IterableLike → GenIterableLike

106. #### def last: A

     Selects the last element.

     Selects the last element.

     returns

       The last element of this mutable queue.

     Definition Classes
       MutableList → LinearSeqOptimized → TraversableLike → GenTraversableLike
     Exceptions thrown
       NoSuchElementException

       If the mutable queue is empty.

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

     Attributes
       protected
     Definition Classes
       MutableList

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

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

     [use case]

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

     elem

       the element value to search for.

     end

       the end index.

     returns

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

     Definition Classes
       GenSeqLike
     Full Signature

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

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

     [use case] Finds index of last occurrence of some value in this mutable queue.

     [use case]

     Finds index of last occurrence of some value in this mutable queue.

     elem

       the element value to search for.

     returns

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

     Definition Classes
       GenSeqLike
     Full Signature

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

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

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

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

     Definition Classes
       SeqLike

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

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

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

     that

       the sequence to test

     returns

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

     Definition Classes
       SeqLike

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

     Definition Classes
       LinearSeqOptimized → SeqLike → GenSeqLike

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

     Definition Classes
       GenSeqLike

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

     Optionally selects the last element.

     Optionally selects the last element.

     returns

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

     Definition Classes
       TraversableLike → GenTraversableLike

115. #### var len: Int

     Attributes
       protected
     Definition Classes
       MutableList

116. #### def length: Int

     Returns the length of this queue.

     Returns the length of this queue.

     returns

       the number of elements in this mutable queue.

     Definition Classes
       QueueProxy → MutableList → LinearSeqOptimized → SeqLike → GenSeqLike

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

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

     Compares the length of this mutable 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

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

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

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

     returns

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

     Definition Classes
       PartialFunction
     See also

       Function.unlift

119. #### def map[B](f: (A) ⇒ B): Queue[B]

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

     [use case]

     Builds a new collection by applying a function to all elements of this mutable queue.

     B

       the element type of the returned collection.

     f

       the function to apply to each element.

     returns

       a new mutable queue resulting from applying the given function `f` to each element of this mutable queue and collecting the results.

     Definition Classes
       TraversableLike → GenTraversableLike → FilterMonadic
     Full Signature

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

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

121. #### def max: A

     [use case] Finds the largest element.

     [use case]

     Finds the largest element.

     returns

       the largest element of this mutable queue.

     Definition Classes
       TraversableOnce → GenTraversableOnce
     Full Signature

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

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

     Definition Classes
       TraversableOnce → GenTraversableOnce

123. #### def min: A

     [use case] Finds the smallest element.

     [use case]

     Finds the smallest element.

     returns

       the smallest element of this mutable queue

     Definition Classes
       TraversableOnce → GenTraversableOnce
     Full Signature

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

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

     Definition Classes
       TraversableOnce → GenTraversableOnce

125. #### def mkString: String

     Displays all elements of this mutable queue in a string.

     Displays all elements of this mutable queue in a string.

     returns

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

     Definition Classes
       TraversableOnce → GenTraversableOnce

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

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

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

     sep

       the separator string.

     returns

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

     Definition Classes
       TraversableOnce → GenTraversableOnce
     Example:

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

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

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

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

     Definition Classes
       TraversableOnce → GenTraversableOnce
     Example:

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

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

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

     The builder that builds instances of type `mutable.Queue`[A]

     The builder that builds instances of type `mutable.Queue`[A]

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

130. #### def nonEmpty: Boolean

     Tests whether the mutable queue is not empty.

     Tests whether the mutable queue is not empty.

     returns

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

     Definition Classes
       TraversableOnce → GenTraversableOnce

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

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

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

134. #### def padTo(len: Int, elem: A): Queue[A]

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

     [use case]

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

     len

       the target length

     elem

       the padding value

     returns

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

     Definition Classes
       SeqLike → GenSeqLike
     Full Signature

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

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

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

137. #### def partition(p: (A) ⇒ Boolean): (Queue[A], Queue[A])

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

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

     p

       the predicate on which to partition.

     returns

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

     Definition Classes
       TraversableLike → GenTraversableLike

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

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

     [use case]

     Produces a new mutable queue where a slice of elements in this mutable queue is replaced by another sequence.

     from

       the index of the first replaced element

     replaced

       the number of elements to drop in the original mutable queue

     returns

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

     Definition Classes
       SeqLike → GenSeqLike
     Full Signature

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

139. #### def permutations: Iterator[Queue[A]]

     Iterates over distinct permutations.

     Iterates over distinct permutations.

     returns

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

     Definition Classes
       SeqLike
     Example:

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

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

     Definition Classes
       GenSeqLike

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

     Attributes
       protected
     Definition Classes
       MutableList

142. #### def product: A

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

     [use case]

     Multiplies up the elements of this collection.

     returns

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

     Definition Classes
       TraversableOnce → GenTraversableOnce
     Full Signature

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

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

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

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

     Definition Classes
       TraversableOnce → GenTraversableOnce
     Exceptions thrown
       UnsupportedOperationException

       if this mutable queue is empty.

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

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

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

     B

       the result type of the binary operator.

     returns

       the result of inserting `op` between consecutive elements of this mutable queue, going left to right:

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

       where `x1, ..., xn` are the elements of this mutable queue.

     Definition Classes
       LinearSeqOptimized → TraversableOnce
     Exceptions thrown
       `UnsupportedOperationException`

       if this mutable queue is empty.

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

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

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

     Definition Classes
       TraversableOnce → GenTraversableOnce

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

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

     Reduces the elements of this mutable 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

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

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

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

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

       if this mutable queue is empty.

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

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

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

     Definition Classes
       TraversableOnce → GenTraversableOnce

149. #### def repr: Queue[A]

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

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

     Definition Classes
       TraversableLike → GenTraversableLike

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

151. #### def reverse: Queue[A]

     Returns new mutable queue wih elements in reversed order.

     Returns new mutable queue wih elements in reversed order.

     returns

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

     Definition Classes
       SeqLike → GenSeqLike

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

     Definition Classes
       SeqLike

153. #### def reverseMap[B](f: (A) ⇒ B): Queue[B]

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

     [use case]

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

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

     B

       the element type of the returned collection.

     f

       the function to apply to each element.

     returns

       a new mutable queue resulting from applying the given function `f` to each element of this mutable queue and collecting the results in reversed order.

     Definition Classes
       SeqLike → GenSeqLike
     Full Signature

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

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

     Attributes
       protected[this]
     Definition Classes
       TraversableOnce

155. #### def runWith[U](action: (A) ⇒ U): (Int) ⇒ Boolean

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

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

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

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

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

     action

       the action function

     returns

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

     Definition Classes
       PartialFunction
     Since

       2.10

     See also

       `applyOrElse`.

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

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

     [use case]

     Checks if the other iterable collection contains the same elements in the same order as this mutable queue.

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

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

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

     Definition Classes
       TraversableLike → GenTraversableLike

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

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

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

     B

       the type of the elements in the resulting collection

     That

       the actual type of the resulting collection

     z

       the initial value

     op

       the binary operator applied to the intermediate result and the element

     bf

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

     returns

       collection with intermediate results

     Definition Classes
       TraversableLike → GenTraversableLike

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

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

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

     Example:

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

     B

       the type of the elements in the resulting collection

     That

       the actual type of the resulting collection

     z

       the initial value

     op

       the binary operator applied to the intermediate result and the element

     bf

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

     returns

       collection with intermediate results

     Definition Classes
       TraversableLike → GenTraversableLike
     Annotations
       @migration
     Migration

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

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

     Definition Classes
       LinearSeqOptimized → SeqLike → GenSeqLike

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

162. #### def size: Int

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

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

     returns

       the number of elements in this mutable queue.

     Definition Classes
       SeqLike → GenTraversableLike → TraversableOnce → GenTraversableOnce

163. #### def sizeHint(coll: TraversableLike[_, _], delta: Int): Unit

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

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

     coll

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

     delta

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

     Definition Classes
       Builder

164. #### def sizeHint(coll: TraversableLike[_, _]): Unit

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

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

     coll

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

     Definition Classes
       Builder

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

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

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

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

     size

       the hint how many elements will be added.

     boundingColl

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

     Definition Classes
       Builder

167. #### def slice(from: Int, until: Int): Queue[A]

     Selects an interval of elements.

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

         from <= indexOf(x) < until

     returns

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

     Definition Classes
       LinearSeqOptimized → IterableLike → TraversableLike → GenTraversableLike

168. #### def sliding(size: Int, step: Int): Iterator[Queue[A]]

     Groups elements in fixed size blocks by passing a "sliding window" over them (as opposed to partitioning them, as is done in grouped.

     Groups elements in fixed size blocks by passing a "sliding window" over them (as opposed to partitioning them, as is done in grouped.)

     size

       the number of elements per group

     step

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

     returns

       An iterator producing mutable 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

       scala.collection.Iterator, method `sliding`

169. #### def sliding(size: Int): Iterator[Queue[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 mutable 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

       scala.collection.Iterator, method `sliding`

170. #### def sortBy[B](f: (A) ⇒ B)(implicit ord: math.Ordering[B]): Queue[A]

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

     Sorts this `mutable.Queue` 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 mutable queue consisting of the elements of this mutable 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

171. #### def sortWith(lt: (A, A) ⇒ Boolean): Queue[A]

     Sorts this mutable queue according to a comparison function.

     Sorts this mutable queue according to a comparison function.

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

     lt

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

     returns

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

172. #### def sorted[B >: A](implicit ord: math.Ordering[B]): Queue[A]

     Sorts this mutable queue according to an Ordering.

     Sorts this mutable queue according to an Ordering.

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

     ord

       the ordering to be used to compare elements.

     returns

       a mutable queue consisting of the elements of this mutable queue sorted according to the ordering `ord`.

     Definition Classes
       SeqLike
     See also

       scala.math.Ordering

173. #### def span(p: (A) ⇒ Boolean): (Queue[A], Queue[A])

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

     Splits this mutable 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.

     returns

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

     Definition Classes
       LinearSeqOptimized → TraversableLike → GenTraversableLike

174. #### def splitAt(n: Int): (Queue[A], Queue[A])

     Splits this mutable queue into two at a given position.

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

     Definition Classes
       TraversableLike → GenTraversableLike

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

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

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

     Definition Classes
       SeqLike → GenSeqLike

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

     Tests whether this mutable queue starts with the given sequence.

     Tests whether this mutable 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

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

     Definition Classes
       TraversableLike → GenTraversableLike

178. #### def sum: A

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

     [use case]

     Sums up the elements of this collection.

     returns

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

     Definition Classes
       TraversableOnce → GenTraversableOnce
     Full Signature

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

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

     Definition Classes
       AnyRef

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

     Returns the rest of this list

     Returns the rest of this list

     returns

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

     Definition Classes
       Queue → MutableList → LinearSeqOptimized → TraversableLike → GenTraversableLike

181. #### def tails: Iterator[Queue[A]]

     Iterates over the tails of this mutable queue.

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

     returns

       an iterator over all the tails of this mutable queue

     Definition Classes
       TraversableLike
     Example:

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

182. #### def take(n: Int): Queue[A]

     Selects first n elements.

     Selects first n elements.

     n

       the number of elements to take from this mutable queue.

     returns

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

     Definition Classes
       LinearSeqOptimized → IterableLike → TraversableLike → GenTraversableLike

183. #### def takeRight(n: Int): Queue[A]

     Selects last n elements.

     Selects last n elements.

     n

       the number of elements to take

     returns

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

     Definition Classes
       IterableLike

184. #### def takeWhile(p: (A) ⇒ Boolean): Queue[A]

     Takes longest prefix of elements that satisfy a predicate.

     Takes longest prefix of elements that satisfy a predicate.

     returns

       the longest prefix of this mutable queue whose elements all satisfy the predicate `p`.

     Definition Classes
       LinearSeqOptimized → IterableLike → TraversableLike → GenTraversableLike

185. #### def thisCollection: collection.LinearSeq[A]

     The underlying collection seen as an instance of ``mutable.Queue``.

     The underlying collection seen as an instance of ``mutable.Queue``. 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

186. #### def to[Col[_]]: Col[A]

     [use case] Converts this mutable queue into another by copying all elements.

     [use case]

     Converts this mutable queue into another by copying all elements.

     Col

       The collection type to build.

     returns

       a new collection containing all elements of this mutable queue.

     Definition Classes
       TraversableLike → TraversableOnce → GenTraversableOnce
     Full Signature

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

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

     [use case] Converts this mutable queue to an array.

     [use case]

     Converts this mutable queue to an array.

     returns

       an array containing all elements of this mutable queue. An `ClassTag` must be available for the element type of this mutable queue.

     Definition Classes
       TraversableOnce → GenTraversableOnce
     Full Signature

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

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

     Converts this mutable queue to a mutable buffer.

     Converts this mutable queue to a mutable buffer.

     returns

       a buffer containing all elements of this mutable queue.

     Definition Classes
       TraversableOnce → GenTraversableOnce

189. #### def toCollection(repr: Queue[A]): collection.LinearSeq[A]

     A conversion from collections of type `Repr` to ``mutable.Queue`` objects.

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

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

190. #### def toIndexedSeq: immutable.IndexedSeq[A]

     Converts this mutable queue to an indexed sequence.

     Converts this mutable queue to an indexed sequence.

     returns

       an indexed sequence containing all elements of this mutable queue.

     Definition Classes
       TraversableOnce → GenTraversableOnce

191. #### def toIterable: collection.Iterable[A]

     Converts this mutable queue to an iterable collection.

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

     Definition Classes
       IterableLike → TraversableOnce → GenTraversableOnce

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

     Returns an Iterator over the elements in this mutable queue.

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

     returns

       an Iterator containing all elements of this mutable queue.

     Definition Classes
       IterableLike → TraversableLike → GenTraversableOnce

193. #### def toList: immutable.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 mutable queue.

     Definition Classes
       MutableList → TraversableOnce → GenTraversableOnce

194. #### def toMap[T, U]: collection.Map[T, U]

     [use case] Converts this mutable queue to a map.

     [use case]

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

     returns

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

     Definition Classes
       TraversableOnce → GenTraversableOnce
     Full Signature

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

195. #### def toParArray: ParArray[A]

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

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

     Definition Classes
       MutableList

197. #### def toSeq: collection.Seq[A]

     Converts this mutable queue to a sequence.

     Converts this mutable queue to a sequence.

     Overridden for efficiency.

     returns

       a sequence containing all elements of this mutable queue.

     Definition Classes
       SeqLike → GenSeqLike → TraversableOnce → GenTraversableOnce

198. #### def toSet[B >: A]: immutable.Set[B]

     Converts this mutable queue to a set.

     Converts this mutable queue to a set.

     returns

       a set containing all elements of this mutable queue.

     Definition Classes
       TraversableOnce → GenTraversableOnce

199. #### def toStream: immutable.Stream[A]

     Converts this mutable queue to a stream.

     Converts this mutable queue to a stream.

     returns

       a stream containing all elements of this mutable queue.

     Definition Classes
       IterableLike → TraversableLike → GenTraversableOnce

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

     Returns a string representation of the object.

     Returns a string representation of the object.

     The default representation is platform dependent.

     returns

       a string representation of the object.

     Definition Classes
       Proxy → Any

201. #### def toTraversable: collection.Traversable[A]

     Converts this mutable queue to an unspecified Traversable.

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

     returns

       a Traversable containing all elements of this mutable queue.

     Definition Classes
       TraversableLike → TraversableOnce → GenTraversableOnce

202. #### def toVector: Vector[A]

     Converts this mutable queue to a Vector.

     Converts this mutable queue to a Vector.

     returns

       a vector containing all elements of this mutable queue.

     Definition Classes
       TraversableOnce → GenTraversableOnce

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

204. #### def transpose[B](implicit asTraversable: (A) ⇒ GenTraversableOnce[B]): Queue[Queue[B]]

     Transposes this mutable queue of traversable collections into a mutable queue of mutable queues.

     Transposes this mutable queue of traversable collections into a mutable queue of mutable queues.

     B

       the type of the elements of each traversable collection.

     asTraversable

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

     returns

       a two-dimensional mutable queue of mutable queues which has as nth row the nth column of this mutable queue.

     Definition Classes
       GenericTraversableTemplate
     Annotations
       @migration
     Migration

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

     Exceptions thrown
       `IllegalArgumentException`

       if all collections in this mutable queue are not of the same size.

205. #### def union(that: collection.Seq[A]): Queue[A]

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

     [use case]

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

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

     that

       the sequence to add.

     returns

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

     Definition Classes
       SeqLike → GenSeqLike
     Full Signature

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

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

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

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

     A1

       the type of the first half of the element pairs

     A2

       the type of the second half of the element pairs

     asPair

       an implicit conversion which asserts that the element type of this mutable queue is a pair.

     returns

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

     Definition Classes
       GenericTraversableTemplate

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

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

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

     A1

       the type of the first member of the element triples

     A2

       the type of the second member of the element triples

     A3

       the type of the third member of the element triples

     asTriple

       an implicit conversion which asserts that the element type of this mutable queue is a triple.

     returns

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

     Definition Classes
       GenericTraversableTemplate

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

     Definition Classes
       MutableList → SeqLike
     Exceptions thrown
       IndexOutOfBoundsException

       if index does not exist.

209. #### def updated(index: Int, elem: A): Queue[A]

     [use case] A copy of this mutable queue with one single replaced element.

     [use case]

     A copy of this mutable queue with one single replaced element.

     index

       the position of the replacement

     elem

       the replacing element

     returns

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

     Definition Classes
       SeqLike → GenSeqLike
     Full Signature

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

210. #### def view(from: Int, until: Int): SeqView[A, Queue[A]]

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

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

     Note: the difference between `view` and `slice` is that `view` produces a view of the current mutable queue, whereas `slice` produces a new mutable 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 mutable queue, starting at index `from` and extending up to (but not including) index `until`.

     Definition Classes
       SeqLike → IterableLike → TraversableLike

211. #### def view: SeqView[A, Queue[A]]

     Creates a non-strict view of this mutable queue.

     Creates a non-strict view of this mutable queue.

     returns

       a non-strict view of this mutable queue.

     Definition Classes
       SeqLike → IterableLike → TraversableLike

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

     Definition Classes
       AnyRef
     Annotations
       @throws( ... )

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

     Definition Classes
       AnyRef
     Annotations
       @throws( ... )

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

     Definition Classes
       AnyRef
     Annotations
       @throws( ... )

215. #### def withFilter(p: (A) ⇒ Boolean): FilterMonadic[A, Queue[A]]

     Creates a non-strict filter of this mutable queue.

     Creates a non-strict filter of this mutable 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 mutable queue which satisfy the predicate `p`.

     Definition Classes
       TraversableLike → FilterMonadic

216. #### def zip[B](that: GenIterable[B]): Queue[(A, B)]

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

     [use case]

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

     B

       the type of the second half of the returned pairs

     that

       The iterable providing the second half of each result pair

     returns

       a new mutable queue containing pairs consisting of corresponding elements of this mutable queue and `that`. The length of the returned collection is the minimum of the lengths of this mutable queue and `that`.

     Definition Classes
       IterableLike → GenIterableLike
     Full Signature

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

217. #### def zipAll[B](that: collection.Iterable[B], thisElem: A, thatElem: B): Queue[(A, B)]

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

     [use case]

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

     B

       the type of the second half of the returned pairs

     that

       The iterable providing the second half of each result pair

     thisElem

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

     thatElem

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

     returns

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

     Definition Classes
       IterableLike → GenIterableLike
     Full Signature

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

218. #### def zipWithIndex: Queue[(A, Int)]

     [use case] Zips this mutable queue with its indices.

     [use case]

     Zips this mutable queue with its indices.

     returns

       A new mutable queue containing pairs consisting of all elements of this mutable queue paired with their index. Indices start at `0`.

     Definition Classes
       IterableLike → GenIterableLike
     Full Signature

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

     Example:

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

219. #### def →[B](y: B): (QueueProxy[A], B)

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

### Shadowed Implicit Value Members

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

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

         (queueProxy: MonadOps[A]).filter(p)

   Definition Classes
     MonadOps

2. #### def flatMap[B](f: (A) ⇒ GenTraversableOnce[B]): TraversableOnce[B]

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

         (queueProxy: MonadOps[A]).flatMap(f)

   Definition Classes
     MonadOps

3. #### def map[B](f: (A) ⇒ B): TraversableOnce[B]

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

         (queueProxy: MonadOps[A]).map(f)

   Definition Classes
     MonadOps

4. #### val self: Any

   Implicit information
     This member is added by an implicit conversion from QueueProxy[A] to StringAdd performed by method any2stringadd in scala.Predef.
   Shadowing
     This implicitly inherited member is shadowed by one or more members in this class.
     To access this member you can use a type ascription:

         (queueProxy: StringAdd).self

   Definition Classes
     StringAdd

5. #### val self: Any

   Implicit information
     This member is added by an implicit conversion from QueueProxy[A] to StringFormat performed by method any2stringfmt in scala.Predef.
   Shadowing
     This implicitly inherited member is shadowed by one or more members in this class.
     To access this member you can use a type ascription:

         (queueProxy: StringFormat).self

   Definition Classes
     StringFormat

6. #### def withFilter(p: (A) ⇒ Boolean): Iterator[A]

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

         (queueProxy: MonadOps[A]).withFilter(p)

   Definition Classes
     MonadOps

### Deprecated Value Members

1. #### def /:\[A1 >: A](z: A1)(op: (A1, A1) ⇒ A1): A1

   A syntactic sugar for out of order folding.

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

   Example:

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

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

   Definition Classes
     GenTraversableOnce
   Annotations
     @deprecated
   Deprecated

     (Since version 2.10.0) use fold instead

2. #### def x: QueueProxy[A]

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

         (queueProxy: ArrowAssoc[QueueProxy[A]]).x

   Definition Classes
     ArrowAssoc
   Annotations
     @deprecated
   Deprecated

     (Since version 2.10.0) Use `leftOfArrow`instead``

3. #### def x: QueueProxy[A]

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

         (queueProxy: Ensuring[QueueProxy[A]]).x

   Definition Classes
     Ensuring
   Annotations
     @deprecated
   Deprecated

     (Since version 2.10.0) Use `resultOfEnsuring`instead``

### Inherited from Proxy

### Inherited from Queue[A]

### Inherited from MutableList[A]

### Inherited from Serializable

### Inherited from java.io.Serializable

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

### Inherited from Growable[A]

### Inherited from Clearable

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

### Inherited from LinearSeq[A]

### Inherited from collection.LinearSeq[A]

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

### Inherited from AbstractSeq[A]

### Inherited from Seq[A]

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

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

### Inherited from scala.Cloneable

### Inherited from java.lang.Cloneable

### Inherited from Iterable[A]

### Inherited from Traversable[A]

### Inherited from Mutable

### Inherited from collection.AbstractSeq[A]

### Inherited from collection.Seq[A]

### Inherited from collection.SeqLike[A, Queue[A]]

### Inherited from GenSeq[A]

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

### Inherited from PartialFunction[Int, A]

### Inherited from (Int) ⇒ A

### Inherited from collection.AbstractIterable[A]

### Inherited from collection.Iterable[A]

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

### Inherited from Equals

### Inherited from GenIterable[A]

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

### Inherited from AbstractTraversable[A]

### Inherited from collection.Traversable[A]

### Inherited from GenTraversable[A]

### Inherited from GenericTraversableTemplate[A, Queue]

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

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

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

### Inherited from TraversableOnce[A]

### Inherited from GenTraversableOnce[A]

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

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

### Inherited from AnyRef

### Inherited from Any

### Inherited by implicit conversion traversable2ops from QueueProxy[A] to TraversableOps[A]

### Inherited by implicit conversion MonadOps from QueueProxy[A] to MonadOps[A]

### Inherited by implicit conversion any2stringadd from QueueProxy[A] to StringAdd

### Inherited by implicit conversion any2stringfmt from QueueProxy[A] to StringFormat

### Inherited by implicit conversion any2ArrowAssoc from QueueProxy[A] to ArrowAssoc[QueueProxy[A]]

### Inherited by implicit conversion any2Ensuring from QueueProxy[A] to Ensuring[QueueProxy[A]]

### Inherited by implicit conversion alternateImplicit from QueueProxy[A] to ForceImplicitAmbiguity

### Ungrouped