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
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Hide All
  2. Show all
  1. QueueProxy
  2. Proxy
  3. Queue
  4. MutableList
  5. Serializable
  6. Serializable
  7. Builder
  8. Growable
  9. LinearSeqOptimized
  10. LinearSeq
  11. LinearSeq
  12. LinearSeqLike
  13. Seq
  14. SeqLike
  15. Cloneable
  16. Seq
  17. SeqLike
  18. GenSeq
  19. GenSeqLike
  20. PartialFunction
  21. Function1
  22. Iterable
  23. Iterable
  24. IterableLike
  25. Equals
  26. GenIterable
  27. GenIterableLike
  28. Traversable
  29. Mutable
  30. Traversable
  31. GenTraversable
  32. GenericTraversableTemplate
  33. TraversableLike
  34. GenTraversableLike
  35. Parallelizable
  36. TraversableOnce
  37. GenTraversableOnce
  38. FilterMonadic
  39. HasNewBuilder
  40. AnyRef
  41. Any
Visibility
  1. Public
  2. All

Type Members

  1. type Self = MutableList[A]

    The type implementing this traversable

    The type implementing this traversable

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

    A class supporting filtered operations.

Abstract Value Members

  1. def self : Queue[A]

    Attributes
    abstract
    Definition Classes
    QueueProxyProxy

Concrete Value Members

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

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

    Test two objects for inequality.

    Test two objects for inequality.

    returns

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

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

    Equivalent to x.hashCode except for boxed numeric types.

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

    returns

    a hash value consistent with ==

    Attributes
    final
    Definition Classes
    AnyRef → Any
  4. def ++ [B >: A, That] (that: TraversableOnce[B])(implicit bf: CanBuildFrom[MutableList[A], B, That]): That

    Definition Classes
    TraversableLike
    Annotations
    @bridge()
  5. def ++ [B] (that: GenTraversableOnce[B]): mutable.Queue[B]

    [use case] Concatenates this mutable queue with the elements of a traversable collection.

    [use case]

    Concatenates this mutable queue with the elements of a traversable collection.

    B

    the element type of the returned collection.

    that

    the traversable to append.

    returns

    a new collection of type That which contains all elements of this mutable queue followed by all elements of that.

    Attributes
    abstract
    Definition Classes
    GenTraversableLike
  6. def ++ [B >: A, That] (that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[MutableList[A], B, That]): That

    Concatenates this mutable queue with the elements of a traversable collection.

    Concatenates this mutable queue with the elements of a traversable collection.

    B

    the element type of the returned collection.

    That

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

    that

    the traversable to append.

    bf

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

    returns

    a new collection of type That which contains all elements of this mutable queue followed by all elements of that.

    Definition Classes
    TraversableLike → GenTraversableLike
  7. def ++: [B >: A, That] (that: Traversable[B])(implicit bf: CanBuildFrom[MutableList[A], B, That]): That

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

    This overload exists because: for the implementation of ++: we should reuse that of ++ because many collections override it with more efficient versions. Since TraversableOnce has no '++' method, we have to implement that directly, but Traversable and down can use the overload.

    Definition Classes
    TraversableLike
  8. def ++: [B] (that: TraversableOnce[B]): mutable.Queue[B]

    [use case] Concatenates this mutable queue with the elements of a traversable collection.

    [use case]

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

    B

    the element type of the returned collection.

    that

    the traversable to append.

    returns

    a new collection of type That which contains all elements of this mutable queue followed by all elements of that.

    Attributes
    abstract
    Definition Classes
    TraversableLike
  9. def ++: [B >: A, That] (that: TraversableOnce[B])(implicit bf: CanBuildFrom[MutableList[A], B, That]): That

    Concatenates this mutable queue with the elements of a traversable collection.

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

    B

    the element type of the returned collection.

    That

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

    that

    the traversable to append.

    bf

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

    returns

    a new collection of type That which contains all elements of this mutable queue followed by all elements of that.

    Definition Classes
    TraversableLike
  10. 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.

    returns

    the mutable queue [email protected] iter an iterator

    Definition Classes
    QueueProxyGrowable
  11. def +: (elem: A): mutable.Queue[A]

    [use case] Prepends an element to this mutable queue

    [use case]

    Prepends an element to this mutable queue

    elem

    the prepended element

    returns

    a new collection of type That consisting of elem followed by all elements of this mutable queue.

    Attributes
    abstract
    Definition Classes
    GenSeqLike
  12. def +: [B >: A, That] (elem: B)(implicit bf: CanBuildFrom[MutableList[A], B, That]): That

    Prepends an element to this mutable queue

    Prepends an element to this mutable queue

    B

    the element type of the returned mutable queue.

    That

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

    elem

    the prepended element

    bf

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

    returns

    a new collection of type That consisting of elem followed by all elements of this mutable queue.

    Definition Classes
    SeqLike → GenSeqLike
  13. 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
    QueueProxyMutableListBuilderGrowable
  14. 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
  15. 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
  16. 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.

    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 x,,1,,, ..., x,,n,, are the elements of this mutable queue.

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

    A syntactic sugar for out of order folding.

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

    Definition Classes
    GenTraversableOnce
  18. def :+ (elem: A): mutable.Queue[A]

    [use case] Appends an element to this mutable queue

    [use case]

    Appends an element to this mutable queue

    elem

    the appended element

    returns

    a new collection of type That consisting of all elements of this mutable queue followed by elem.

    Attributes
    abstract
    Definition Classes
    GenSeqLike
  19. def :+ [B >: A, That] (elem: B)(implicit bf: CanBuildFrom[MutableList[A], B, That]): That

    Appends an element to this mutable queue

    Appends an element to this mutable queue

    B

    the element type of the returned mutable queue.

    That

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

    elem

    the appended element

    bf

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

    returns

    a new collection of type That consisting of all elements of this mutable queue followed by elem.

    Definition Classes
    SeqLike → GenSeqLike
  20. 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.

    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 x,,1,,, ..., x,,n,, are the elements of this mutable queue.

    Definition Classes
    TraversableOnceGenTraversableOnce
  21. def == (arg0: AnyRef): Boolean

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

    Test two objects for equality.

    Test two objects for equality.

    returns

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

    Attributes
    final
    Definition Classes
    Any
  23. def addString (b: StringBuilder): 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.

    b

    the string builder to which elements are appended.

    returns

    the string builder b to which elements were appended.

    Definition Classes
    TraversableOnce
  24. def addString (b: StringBuilder, sep: String): 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.

    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
  25. def addString (b: StringBuilder, start: String, sep: String, end: String): 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.

    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
  26. def aggregate [B] (z: B)(seqop: (B, A) ⇒ B, combop: (B, B) ⇒ B): B

    Aggregates the results of applying an operator to subsequent elements.

    Aggregates the results of applying an operator to subsequent elements.

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

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

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

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

    z

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

    seqop

    an operator used to accumulate results within a partition

    combop

    an associative operator used to combine results from different partitions

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

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

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

    C

    the result type of the transformation function.

    k

    the transformation function

    returns

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

    Definition Classes
    PartialFunctionFunction1
  28. def appendElem (elem: A): Unit

    Attributes
    protected
    Definition Classes
    MutableList
  29. def apply (n: Int): A

    Access element number n.

    Access element number n.

    returns

    the element at index n.

    Definition Classes
    QueueProxyMutableListLinearSeqOptimizedSeqLike → GenSeqLike → Function1
  30. def asInstanceOf [T0] : T0

    Cast the receiver object to be of type T0.

    Cast the receiver object to be of type T0.

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

    returns

    the receiver object.

    Attributes
    final
    Definition Classes
    Any
  31. 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
    IterableLikeEquals
  32. 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
    QueueProxyMutableListBuilderGrowable
  33. def clone (): Queue[A]

    This method clones the queue.

    This method clones the queue.

    returns

    a queue with the same elements.

    Definition Classes
    QueueProxyCloneable → AnyRef
  34. def collect [B] (pf: PartialFunction[A, B]): mutable.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 collection of type That resulting from applying the partial function pf to each element on which it is defined and collecting the results. The order of the elements is preserved.

    Attributes
    abstract
    Definition Classes
    GenTraversableLike
  35. def collect [B, That] (pf: PartialFunction[A, B])(implicit bf: CanBuildFrom[MutableList[A], B, That]): That

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

    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.

    That

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

    pf

    the partial function which filters and maps the mutable queue.

    bf

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

    returns

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

    Definition Classes
    TraversableLike → GenTraversableLike
  36. 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)

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

    Iterates over combinations.

    Iterates over combinations.

    returns

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

    Definition Classes
    SeqLike
    Example:
    1. "abbbc".combinations(2) = Iterator(ab, ac, bb, bc)

  38. def companion : GenericCompanion[Queue]

    The factory companion object that builds instances of class mutable.

    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
    QueueMutableListLinearSeqLinearSeqSeqSeqGenSeqIterableIterableGenIterableTraversableTraversableGenTraversableGenericTraversableTemplate
  39. 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
  40. 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 is equal (wrt ==) to elem, false otherwise.

    Definition Classes
    SeqLike
  41. def containsSlice [B] (that: Seq[B]): Boolean

    Definition Classes
    SeqLike
    Annotations
    @bridge()
  42. 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
  43. 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.

    Attributes
    abstract
    Definition Classes
    TraversableLike
  44. def copyToArray [B >: A] (xs: Array[B], start: Int, len: Int): Unit

    Copies elements of this mutable queue to an array.

    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.

    B

    the type of the elements of the array.

    xs

    the array to fill.

    start

    the starting index.

    len

    the maximal number of elements to copy.

    Definition Classes
    IterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  45. 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.

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  46. def copyToArray [B >: A] (xs: Array[B]): Unit

    Copies values of this mutable queue to an array.

    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.

    B

    the type of the elements of the array.

    xs

    the array to fill.

    Definition Classes
    TraversableOnceGenTraversableOnce
  47. 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.

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  48. def copyToArray [B >: A] (xs: Array[B], start: Int): Unit

    Copies values of this mutable queue to an array.

    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.

    B

    the type of the elements of the array.

    xs

    the array to fill.

    start

    the starting index.

    Definition Classes
    TraversableOnceGenTraversableOnce
  49. def copyToBuffer [B >: A] (dest: Buffer[B]): Unit

    Copies all elements of this 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
  50. def corresponds [B] (that: Seq[B])(p: (A, B) ⇒ Boolean): Boolean

    Definition Classes
    SeqLike
    Annotations
    @bridge()
  51. 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
    SeqLike → GenSeqLike
  52. 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
    LinearSeqOptimizedTraversableOnceGenTraversableOnce
  53. 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
    QueueProxyQueue
  54. 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
  55. 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
  56. def diff [B >: A] (that: Seq[B]): MutableList[A]

    Definition Classes
    SeqLike
    Annotations
    @bridge()
  57. def diff (that: Seq[A]): mutable.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 collection of type That 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.

    Attributes
    abstract
    Definition Classes
    SeqLike
  58. def diff [B >: A] (that: GenSeq[B]): MutableList[A]

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

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

    B

    the element type of the returned mutable queue.

    that

    the sequence of elements to remove

    returns

    a new collection of type That 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
  59. def distinct : MutableList[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
  60. def drop (n: Int): MutableList[A]

    Selects all elements except first n ones.

    Selects all elements except first n ones.

    n

    the number of elements to drop from this 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
    LinearSeqOptimizedIterableLikeTraversableLike → GenTraversableLike
  61. def dropRight (n: Int): MutableList[A]

    Selects all elements except last n ones.

    Selects all elements except last n ones.

    n

    The number of elements to take

    returns

    a 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
    LinearSeqOptimizedIterableLike
  62. def dropWhile (p: (A) ⇒ Boolean): MutableList[A]

    Drops longest prefix of elements that satisfy a predicate.

    Drops longest prefix of elements that satisfy a predicate.

    p

    The predicate used to test elements.

    returns

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

    Definition Classes
    TraversableLike → GenTraversableLike
  63. def endsWith [B] (that: Seq[B]): Boolean

    Definition Classes
    SeqLike
    Annotations
    @bridge()
  64. 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
  65. def enqueue (elems: A*): Unit

    Adds all elements to the queue.

    Adds all elements to the queue.

    elems

    the elements to add.

    Definition Classes
    QueueProxyQueue
  66. def eq (arg0: AnyRef): Boolean

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

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

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

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

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

    returns

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

    Attributes
    final
    Definition Classes
    AnyRef
  67. def equals (that: Any): Boolean

    The equality method for reference types.

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

    that

    the object to compare against this object for equality.

    returns

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

    Definition Classes
    Proxy → AnyRef → Any
  68. 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
    LinearSeqOptimizedIterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  69. 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
  70. def filter (p: (A) ⇒ Boolean): MutableList[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
  71. def filterNot (p: (A) ⇒ Boolean): MutableList[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
  72. def finalize (): Unit

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

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

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

    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws()
  73. 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
    LinearSeqOptimizedIterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  74. var first0 : LinkedList[A]

    Attributes
    protected
    Definition Classes
    MutableList
  75. def flatMap [B] (f: (A) ⇒ GenTraversableOnce[B]): mutable.Queue[B]

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

    [use case]

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

    B

    the element type of the returned collection.

    f

    the function to apply to each element.

    returns

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

    Attributes
    abstract
    Definition Classes
    GenTraversableLike
  76. def flatMap [B, That] (f: (A) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[MutableList[A], B, That]): That

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

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

    B

    the element type of the returned collection.

    That

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

    f

    the function to apply to each element.

    bf

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

    returns

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

    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  77. def flatten [B] : mutable.Queue[B]

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

    [use case]

    Converts this mutable queue of traversable collections into a mutable queue in which all element collections are concatenated.

    B

    the type of the elements of each traversable collection.

    returns

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

    Attributes
    abstract
    Definition Classes
    GenericTraversableTemplate
  78. def flatten [B] (implicit asTraversable: (A) ⇒ TraversableOnce[B]): Traversable[B]

    Converts this mutable queue of traversable collections into a mutable queue in which all element collections are concatenated.

    Converts this mutable queue of traversable collections into a mutable queue in which all element collections are concatenated.

    B

    the type of the elements of each traversable collection.

    asTraversable

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

    returns

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

    Definition Classes
    TraversableGenericTraversableTemplate
    Annotations
    @bridge()
  79. def fold [A1 >: A] (z: A1)(op: (A1, A1) ⇒ A1): A1

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

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

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

    z

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

    op

    a binary operator that must be associative

    returns

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

    Definition Classes
    TraversableOnceGenTraversableOnce
  80. 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 x,,1,,, ..., x,,n,, are the elements of this mutable queue.

    Definition Classes
    LinearSeqOptimizedTraversableOnceGenTraversableOnce
  81. 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 x,,1,,, ..., x,,n,, are the elements of this mutable queue.

    Definition Classes
    LinearSeqOptimizedIterableLikeTraversableOnceGenTraversableOnce
  82. 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
    LinearSeqOptimizedIterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  83. 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.

    f

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

    Attributes
    abstract
    Definition Classes
    IterableLike
  84. def foreach [B] (f: (A) ⇒ B): Unit

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

    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
    LinearSeqOptimizedIterableLikeTraversableLike → GenTraversableLike → TraversableOnceGenTraversableOnceFilterMonadic
  85. 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
    QueueProxyQueue
  86. def genericBuilder [B] : Builder[B, Queue[B]]

    The generic builder that builds instances of mutable.

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

    Definition Classes
    GenericTraversableTemplate
  87. def get (n: Int): Option[A]

    Returns the nth element of this list or None if index does not exist.

    Returns the nth element of this list or None if index does not exist.

    Definition Classes
    MutableList
  88. def getClass (): java.lang.Class[_ <: java.lang.Object]

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

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

    The nature of the representation is platform dependent.

    returns

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

    Attributes
    final
    Definition Classes
    AnyRef
  89. def groupBy [K] (f: (A) ⇒ K): Map[K, MutableList[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
  90. def grouped (size: Int): Iterator[MutableList[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

    Iterator#grouped

  91. 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
    TraversableLikeTraversableOnceGenTraversableOnce
  92. def hashCode (): Int

    The hashCode method for reference types.

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

    returns

    the hash code value for this object.

    Definition Classes
    Proxy → AnyRef → Any
  93. 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
    MutableListLinearSeqOptimizedIterableLike → GenIterableLike → GenericTraversableTemplateTraversableLike → GenTraversableLike
  94. 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
  95. 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 (wrt ==) to elem, or -1, if none exists.

    Attributes
    abstract
    Definition Classes
    GenSeqLike
  96. def indexOf [B >: A] (elem: B, from: Int): Int

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

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

    B

    the type of the element elem.

    elem

    the element value to search for.

    from

    the start index

    returns

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

    Definition Classes
    GenSeqLike
  97. 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 (wrt ==) to elem, or -1, if none exists.

    Attributes
    abstract
    Definition Classes
    GenSeqLike
  98. def indexOf [B >: A] (elem: B): Int

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

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

    B

    the type of the element elem.

    elem

    the element value to search for.

    returns

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

    Definition Classes
    GenSeqLike
  99. def indexOfSlice [B >: A] (that: Seq[B], from: Int): Int

    Definition Classes
    SeqLike
    Annotations
    @bridge()
  100. 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
  101. def indexOfSlice [B >: A] (that: Seq[B]): Int

    Definition Classes
    SeqLike
    Annotations
    @bridge()
  102. 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
  103. 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
    LinearSeqOptimizedSeqLike → GenSeqLike
  104. 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
  105. def indices : Range

    Produces the range of all indices of this sequence.

    Produces the range of all indices of this sequence.

    returns

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

    Definition Classes
    SeqLike
  106. def init : MutableList[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
  107. def inits : Iterator[MutableList[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)

  108. def intersect [B >: A] (that: Seq[B]): MutableList[A]

    Definition Classes
    SeqLike
    Annotations
    @bridge()
  109. def intersect (that: Seq[A]): mutable.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 collection of type That 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.

    Attributes
    abstract
    Definition Classes
    SeqLike
  110. def intersect [B >: A] (that: GenSeq[B]): MutableList[A]

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

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

    B

    the element type of the returned mutable queue.

    that

    the sequence of elements to intersect with.

    returns

    a new collection of type That 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
  111. 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
  112. 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
    QueueProxyMutableListLinearSeqOptimizedIterableLike → GenIterableLike → GenericTraversableTemplateTraversableLikeTraversableOnceGenTraversableOnce
  113. def isInstanceOf [T0] : Boolean

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

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

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

    returns

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

    Attributes
    final
    Definition Classes
    Any
  114. def isTraversableAgain : Boolean

    Tests whether this mutable queue can be repeatedly traversed.

    Tests whether this mutable queue can be repeatedly traversed.

    returns

    true

    Attributes
    final
    Definition Classes
    GenTraversableLike → GenTraversableOnce
  115. 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
    QueueProxyMutableListLinearSeqLikeIterableLike → GenIterableLike
  116. def last : A

    Selects the last element.

    Selects the last element.

    returns

    The last element of this mutable queue.

    Definition Classes
    MutableListLinearSeqOptimizedTraversableLike
  117. var last0 : LinkedList[A]

    Attributes
    protected
    Definition Classes
    MutableList
  118. 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 (wrt ==) to elem, or -1, if none exists.

    Attributes
    abstract
    Definition Classes
    GenSeqLike
  119. def lastIndexOf [B >: A] (elem: B, end: Int): Int

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

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

    B

    the type of the element elem.

    elem

    the element value to search for.

    end

    the end index.

    returns

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

    Definition Classes
    GenSeqLike
  120. 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 (wrt ==) to elem, or -1, if none exists.

    Attributes
    abstract
    Definition Classes
    GenSeqLike
  121. def lastIndexOf [B >: A] (elem: B): Int

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

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

    B

    the type of the element elem.

    elem

    the element value to search for.

    returns

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

    Definition Classes
    GenSeqLike
  122. def lastIndexOfSlice [B >: A] (that: Seq[B], end: Int): Int

    Definition Classes
    SeqLike
    Annotations
    @bridge()
  123. 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
  124. def lastIndexOfSlice [B >: A] (that: Seq[B]): Int

    Definition Classes
    SeqLike
    Annotations
    @bridge()
  125. 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
  126. 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
    LinearSeqOptimizedSeqLike → GenSeqLike
  127. 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
  128. 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
  129. var len : Int

    Attributes
    protected
    Definition Classes
    MutableList
  130. 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
    QueueProxyMutableListLinearSeqOptimizedSeqLike → GenSeqLike
  131. 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
    LinearSeqOptimizedSeqLike
  132. def lift : (Int) ⇒ Option[A]

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

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

    returns

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

    Definition Classes
    PartialFunction
    See also

    Function.unlift

  133. def map [B] (f: (A) ⇒ B): mutable.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 collection of type That resulting from applying the given function f to each element of this mutable queue and collecting the results.

    Attributes
    abstract
    Definition Classes
    GenTraversableLike
  134. def map [B, That] (f: (A) ⇒ B)(implicit bf: CanBuildFrom[MutableList[A], B, That]): That

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

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

    B

    the element type of the returned collection.

    That

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

    f

    the function to apply to each element.

    bf

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

    returns

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

    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  135. 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
  136. def max : A

    [use case] Finds the largest element.

    [use case]

    Finds the largest element.

    returns

    the largest element of this mutable queue with respect to the ordering cmp.

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  137. def max [B >: A] (implicit cmp: Ordering[B]): A

    Finds the largest element.

    Finds the largest element.

    B

    The type over which the ordering is defined.

    cmp

    An ordering to be used for comparing elements.

    returns

    the largest element of this mutable queue with respect to the ordering cmp.

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

    Definition Classes
    TraversableOnceGenTraversableOnce
  139. def min : A

    [use case] Finds the smallest element.

    [use case]

    Finds the smallest element.

    returns

    the smallest element of this mutable queue with respect to the ordering cmp.

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  140. def min [B >: A] (implicit cmp: Ordering[B]): A

    Finds the smallest element.

    Finds the smallest element.

    B

    The type over which the ordering is defined.

    cmp

    An ordering to be used for comparing elements.

    returns

    the smallest element of this mutable queue with respect to the ordering cmp.

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

    Definition Classes
    TraversableOnceGenTraversableOnce
  142. 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
    TraversableOnceGenTraversableOnce
  143. 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
    TraversableOnceGenTraversableOnce
    Example:
    1. List(1, 2, 3).mkString("|") = "1|2|3"

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

  145. def ne (arg0: AnyRef): Boolean

    Equivalent to !(this eq that).

    Equivalent to !(this eq that).

    returns

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

    Attributes
    final
    Definition Classes
    AnyRef
  146. def newBuilder : Builder[A, Queue[A]]

    The builder that builds instances of type mutable.

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

    Attributes
    protected[this]
    Definition Classes
    QueueMutableListGenericTraversableTemplateTraversableLikeHasNewBuilder
  147. 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
    TraversableOnceGenTraversableOnce
  148. def notify (): Unit

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

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

    Attributes
    final
    Definition Classes
    AnyRef
  149. def notifyAll (): Unit

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

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

    Attributes
    final
    Definition Classes
    AnyRef
  150. 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
  151. def padTo (len: Int, elem: A): mutable.Queue[A]

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

    [use case]

    Appends an element value to this mutable queue until a given target length is reached.

    len

    the target length

    elem

    the padding value

    returns

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

    Attributes
    abstract
    Definition Classes
    GenSeqLike
  152. def padTo [B >: A, That] (len: Int, elem: B)(implicit bf: CanBuildFrom[MutableList[A], B, That]): That

    Appends an element value to this mutable queue until a given target length is reached.

    Appends an element value to this mutable queue until a given target length is reached.

    B

    the element type of the returned mutable queue.

    That

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

    len

    the target length

    elem

    the padding value

    bf

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

    returns

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

    Definition Classes
    SeqLike → GenSeqLike
  153. 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
  154. def parCombiner : Combiner[A, ParSeq[A]]

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

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

    returns

    a combiner for the parallel collection of type ParRepr

    Attributes
    protected[this]
    Definition Classes
    SeqLikeSeqLikeTraversableLikeParallelizable
  155. def partition (p: (A) ⇒ Boolean): (MutableList[A], MutableList[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
  156. def patch [B >: A, That] (from: Int, patch: Seq[B], replaced: Int)(implicit bf: CanBuildFrom[MutableList[A], B, That]): That

    Definition Classes
    SeqLike
    Annotations
    @bridge()
  157. def patch (from: Int, that: GenSeq[A], replaced: Int): mutable.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.

    Attributes
    abstract
    Definition Classes
    GenSeqLike
  158. def patch [B >: A, That] (from: Int, patch: GenSeq[B], replaced: Int)(implicit bf: CanBuildFrom[MutableList[A], B, That]): That

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

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

    B

    the element type of the returned mutable queue.

    That

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

    from

    the index of the first replaced element

    patch

    the replacement sequence

    replaced

    the number of elements to drop in the original mutable queue

    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 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
  159. def permutations : Iterator[MutableList[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)

  160. 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
  161. def prependElem (elem: A): Unit

    Attributes
    protected
    Definition Classes
    MutableList
  162. def product : A

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

    [use case]

    Multiplies up the elements of this collection.

    returns

    the product of all elements of this mutable queue with respect to the * operator in num.

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  163. def product [B >: A] (implicit num: Numeric[B]): B

    Multiplies up the elements of this collection.

    Multiplies up the elements of this collection.

    B

    the result type of the * operator.

    num

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

    returns

    the product of all elements of this mutable queue with respect to the * operator in num.

    Definition Classes
    TraversableOnceGenTraversableOnce
  164. def reduce [A1 >: A] (op: (A1, A1) ⇒ A1): A1

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

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

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

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

    op

    A binary operator that must be associative.

    returns

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

    Definition Classes
    TraversableOnceGenTraversableOnce
  165. def reduceLeft [B >: A] (f: (B, A) ⇒ B): B

    Definition Classes
    LinearSeqOptimizedTraversableOnce
  166. 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
    TraversableOnceGenTraversableOnce
  167. def reduceOption [A1 >: A] (op: (A1, A1) ⇒ A1): Option[A1]

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

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

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

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

    op

    A binary operator that must be associative.

    returns

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

    Definition Classes
    TraversableOnceGenTraversableOnce
  168. 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 x,,1,,, ..., x,,n,, are the elements of this mutable queue.

    Definition Classes
    LinearSeqOptimizedIterableLikeTraversableOnceGenTraversableOnce
  169. 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
    TraversableOnceGenTraversableOnce
  170. def repr : MutableList[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
  171. 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
    MutableListBuilder
  172. def reverse : MutableList[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
  173. 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
  174. def reverseMap [B] (f: (A) ⇒ B): mutable.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.

    B

    the element type of the returned collection.

    f

    the function to apply to each element.

    returns

    a new collection of type That resulting from applying the given function f to each element of this 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.

    Attributes
    abstract
    Definition Classes
    GenSeqLike
  175. def reverseMap [B, That] (f: (A) ⇒ B)(implicit bf: CanBuildFrom[MutableList[A], B, That]): That

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

    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.

    That

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

    f

    the function to apply to each element.

    bf

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

    returns

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

    Definition Classes
    SeqLike → GenSeqLike
  176. def reversed : List[A]

    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  177. 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.

    Attributes
    abstract
    Definition Classes
    GenIterableLike
  178. def sameElements [B >: A] (that: GenIterable[B]): Boolean

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

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

    B

    the type of the elements of collection that.

    that

    the collection to compare with.

    returns

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

    Definition Classes
    LinearSeqOptimizedIterableLike → GenIterableLike
  179. def sameElements [B >: A] (that: Iterable[B]): Boolean

    Definition Classes
    IterableLike
    Annotations
    @bridge()
  180. def scan [B >: A, That] (z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[MutableList[A], B, That]): That

    Computes a prefix scan of the elements of the collection.

    Computes a prefix scan of the elements of the collection.

    Note: The neutral element z may be applied more than once.

    B

    element type of the resulting collection

    That

    type of the resulting collection

    z

    neutral element for the operator op

    op

    the associative operator for the scan

    cbf

    combiner factory which provides a combiner

    returns

    a new mutable queue containing the prefix scan of the elements in this mutable queue

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

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

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

    B

    the type of the elements in the resulting collection

    That

    the actual type of the resulting collection

    z

    the initial value

    op

    the binary operator applied to the intermediate result and the element

    bf

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

    returns

    collection with intermediate results

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

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

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

    Example:

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

    the type of the elements in the resulting collection

    That

    the actual type of the resulting collection

    z

    the initial value

    op

    the binary operator applied to the intermediate result and the element

    bf

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

    returns

    collection with intermediate results

    Definition Classes
    TraversableLike → GenTraversableLike
    Annotations
    @migration
    Migration

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

  183. 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
    LinearSeqOptimizedSeqLike → GenSeqLike
  184. def seq : Seq[A]

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

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

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

    returns

    a sequential view of the collection.

    Definition Classes
    SeqSeqGenSeqIterableIterableGenIterableTraversableTraversableGenTraversableParallelizableTraversableOnceGenTraversableOnce
  185. 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 → TraversableOnceGenTraversableOnce
  186. def sizeHint (coll: scala.collection.TraversableLike[_, _], delta: Int = 0): Unit

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

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

    coll

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

    delta

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

    Definition Classes
    Builder
  187. 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
  188. def sizeHintBounded (size: Int, boundingColl: scala.collection.TraversableLike[_, _]): Unit

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

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

    size

    the hint how many elements will be added.

    boundingColl

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

    Definition Classes
    Builder
  189. def slice (from: Int, until: Int): MutableList[A]

    Selects an interval of elements.

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

       from <= indexOf(x) < until
    
    from

    the lowest index to include from this mutable queue.

    until

    the highest index to EXCLUDE from this mutable queue.

    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
    LinearSeqOptimizedIterableLikeTraversableLike → GenTraversableLike
  190. def sliding [B >: A] (size: Int, step: Int): Iterator[MutableList[A]]

    Definition Classes
    IterableLike
  191. def sliding [B >: A] (size: Int): Iterator[MutableList[A]]

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

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

    size

    the number of elements per group

    returns

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

    Iterator#sliding

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

    Sorts this mutable.

    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

  193. def sortWith (lt: (A, A) ⇒ Boolean): MutableList[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 wrt lt appear in the same order in the sorted sequence as in the original.

    lt

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

    returns

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

    ord

    the ordering to be used to compare elements.

    returns

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

    Definition Classes
    SeqLike
    See also

    scala.math.Ordering

  195. def span (p: (A) ⇒ Boolean): (MutableList[A], MutableList[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.

    p

    the test predicate

    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
    LinearSeqOptimizedTraversableLike → GenTraversableLike
  196. def splitAt (n: Int): (MutableList[A], MutableList[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
  197. def startsWith [B] (that: Seq[B], offset: Int): Boolean

    Definition Classes
    SeqLike
    Annotations
    @bridge()
  198. 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.

    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
  199. def startsWith [B] (that: Seq[B]): Boolean

    Definition Classes
    GenSeqLike
    Annotations
    @bridge()
  200. 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
  201. 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
  202. def sum : A

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

    [use case]

    Sums up the elements of this collection.

    returns

    the sum of all elements of this mutable queue with respect to the + operator in num.

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  203. def sum [B >: A] (implicit num: Numeric[B]): B

    Sums up the elements of this collection.

    Sums up the elements of this collection.

    B

    the result type of the + operator.

    num

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

    returns

    the sum of all elements of this mutable queue with respect to the + operator in num.

    Definition Classes
    TraversableOnceGenTraversableOnce
  204. def synchronized [T0] (arg0: ⇒ T0): T0

    Attributes
    final
    Definition Classes
    AnyRef
  205. def tail : MutableList[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
    MutableListLinearSeqOptimizedTraversableLike → GenTraversableLike
  206. def tails : Iterator[MutableList[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)

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

    Selects first n elements.

    Selects first n elements.

    n

    Tt 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
    LinearSeqOptimizedIterableLikeTraversableLike → GenTraversableLike
  208. def takeRight (n: Int): MutableList[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
  209. def takeWhile (p: (A) ⇒ Boolean): MutableList[A]

    Takes longest prefix of elements that satisfy a predicate.

    Takes longest prefix of elements that satisfy a predicate.

    p

    The predicate used to test elements.

    returns

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

    Definition Classes
    LinearSeqOptimizedIterableLikeTraversableLike → GenTraversableLike
  210. def thisCollection : 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
    LinearSeqLikeSeqLikeIterableLikeTraversableLike
  211. 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.

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  212. def toArray [B >: A] (implicit arg0: ClassManifest[B]): Array[B]

    Converts this mutable queue to an array.

    Converts this mutable queue to an array.

    B

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

    returns

    an array containing all elements of this mutable queue.

    Definition Classes
    TraversableOnceGenTraversableOnce
  213. 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
    TraversableOnceGenTraversableOnce
  214. def toCollection (repr: MutableList[A]): 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
    LinearSeqLikeSeqLikeIterableLikeTraversableLike
  215. def toIndexedSeq [B >: A] : IndexedSeq[B]

    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
    TraversableOnceGenTraversableOnce
  216. def toIterable : 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
    IterableLikeTraversableOnceGenTraversableOnce
  217. 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
    TraversableLikeGenTraversableOnce
  218. def toList : List[A]

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

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

    returns

    a list containing all elements of this mutable queue.

    Definition Classes
    MutableListTraversableOnceGenTraversableOnce
  219. def toMap [T, U] : 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 containing all elements of this mutable queue.

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  220. def toMap [T, U] (implicit ev: <:<[A, (T, U)]): Map[T, U]

    Converts this mutable queue to a map.

    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 containing all elements of this mutable queue.

    Definition Classes
    TraversableOnceGenTraversableOnce
  221. def toQueue : Queue[A]

    Definition Classes
    MutableList
  222. def toSeq : 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 → TraversableOnceGenTraversableOnce
  223. def toSet [B >: A] : 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
    TraversableOnceGenTraversableOnce
  224. def toStream : 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
    IterableLikeTraversableLikeGenTraversableOnce
  225. def toString (): String

    Creates a String representation of this object.

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

    returns

    a String representation of the object.

    Definition Classes
    Proxy → AnyRef → Any
  226. def toTraversable : 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
    TraversableLikeTraversableOnceGenTraversableOnce
  227. 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
  228. def transpose [B] (implicit asTraversable: (A) ⇒ TraversableOnce[B]): Traversable[Traversable[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
    TraversableGenericTraversableTemplate
    Annotations
    @bridge()
  229. def union (that: Seq[A]): mutable.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.

    that

    the sequence to add.

    returns

    a new collection of type That which contains all elements of this mutable queue followed by all elements of that.

    Attributes
    abstract
    Definition Classes
    SeqLike
  230. def union [B >: A, That] (that: GenSeq[B])(implicit bf: CanBuildFrom[MutableList[A], B, That]): That

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

    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.

    B

    the element type of the returned mutable queue.

    That

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

    that

    the sequence to add.

    bf

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

    returns

    a new collection of type That which contains all elements of this mutable queue followed by all elements of that.

    Definition Classes
    SeqLike → GenSeqLike
  231. def union [B >: A, That] (that: Seq[B])(implicit bf: CanBuildFrom[MutableList[A], B, That]): That

    Definition Classes
    GenSeqLike
    Annotations
    @bridge()
  232. 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.

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

    returns

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

    Definition Classes
    GenericTraversableTemplate
  234. def update (n: Int, x: A): Unit

    Updates the nth element of this list to a new value.

    Updates the nth element of this list to a new value.

    n

    the index of the element to replace.

    Definition Classes
    MutableListSeqLike
  235. def updated (index: Int, elem: A): mutable.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 new mutable queue which is a copy of this mutable queue with the element at position index replaced by elem.

    Attributes
    abstract
    Definition Classes
    GenSeqLike
  236. def updated [B >: A, That] (index: Int, elem: B)(implicit bf: CanBuildFrom[MutableList[A], B, That]): That

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

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

    B

    the element type of the returned mutable queue.

    That

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

    index

    the position of the replacement

    elem

    the replacing element

    bf

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

    returns

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

    Definition Classes
    SeqLike → GenSeqLike
  237. def view (from: Int, until: Int): SeqView[A, MutableList[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
    SeqLikeIterableLikeTraversableLike
  238. def view : SeqView[A, MutableList[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
    SeqLikeIterableLikeTraversableLike
  239. def wait (): Unit

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

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

    Attributes
    final
    Definition Classes
    AnyRef
    Annotations
    @throws()
  242. def withFilter (p: (A) ⇒ Boolean): FilterMonadic[A, MutableList[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
    TraversableLikeFilterMonadic
  243. def zip [A1 >: A, B, That] (that: Iterable[B])(implicit bf: CanBuildFrom[MutableList[A], (A1, B), That]): That

    Definition Classes
    IterableLike
    Annotations
    @bridge()
  244. def zip [B] (that: GenIterable[B]): mutable.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 collection of type That 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.

    Attributes
    abstract
    Definition Classes
    GenIterableLike
  245. def zip [A1 >: A, B, That] (that: GenIterable[B])(implicit bf: CanBuildFrom[MutableList[A], (A1, B), That]): That

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

    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.

    A1

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

    B

    the type of the second half of the returned pairs

    That

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

    that

    The iterable providing the second half of each result pair

    bf

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

    returns

    a new collection of type That containing pairs consisting of corresponding elements of this 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
  246. def zipAll [B, A1 >: A, That] (that: Iterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[MutableList[A], (A1, B), That]): That

    Definition Classes
    IterableLike
    Annotations
    @bridge()
  247. def zipAll [B] (that: Iterable[B], thisElem: A, thatElem: B): mutable.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.

    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 collection of type That 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.

    Attributes
    abstract
    Definition Classes
    GenIterableLike
  248. def zipAll [B, A1 >: A, That] (that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[MutableList[A], (A1, B), That]): That

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

    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.

    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 collection of type That 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
  249. def zipWithIndex : mutable.Queue[(A, Int)]

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

    [use case]

    Zips this mutable queue with its indices.

    returns

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

    Attributes
    abstract
    Definition Classes
    GenIterableLike
  250. def zipWithIndex [A1 >: A, That] (implicit bf: CanBuildFrom[MutableList[A], (A1, Int), That]): That

    Zips this mutable queue with its indices.

    Zips this mutable queue with its indices.

    A1

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

    That

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

    returns

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

    Definition Classes
    IterableLike → GenIterableLike
  251. def elements : Iterator[A]

    Definition Classes
    IterableLike
    Annotations
    @deprecated
    Deprecated

    use iterator' instead

  252. def equalsWith [B] (that: Seq[B])(f: (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

    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
    SeqLike
    Annotations
    @deprecated
    Deprecated

    use corresponds instead

  253. def findIndexOf (p: (A) ⇒ Boolean): Int

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

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

    Definition Classes
    SeqLike
    Annotations
    @deprecated
    Deprecated

    Use indexWhere(p) instead.

  254. def findLastIndexOf (p: (A) ⇒ Boolean): Int

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

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

    Definition Classes
    SeqLike
    Annotations
    @deprecated
    Deprecated

    use lastIndexWhere instead

  255. def first : A

    Definition Classes
    IterableLike
    Annotations
    @deprecated
    Deprecated

    use head' instead

  256. def firstOption : Option[A]

    None if iterable is empty.

    None if iterable is empty.

    Definition Classes
    IterableLike
    Annotations
    @deprecated
    Deprecated

    use headOption' instead

  257. def projection : SeqView[A, MutableList[A]]

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

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

    Definition Classes
    SeqLikeIterableLike
    Annotations
    @deprecated
    Deprecated

    use view' instead

  258. def reset (): Unit

    Definition Classes
    MutableList
    Annotations
    @deprecated
    Deprecated

    use clear() instead

  259. def reversedElements : Iterator[A]

    Definition Classes
    SeqLike
    Annotations
    @deprecated
    Deprecated

    use reverseIterator' instead

Inherited from Proxy

Inherited from Queue[A]

Inherited from MutableList[A]

Inherited from Serializable

Inherited from Serializable

Inherited from Builder[A, MutableList[A]]

Inherited from Growable[A]

Inherited from LinearSeqOptimized[A, MutableList[A]]

Inherited from LinearSeq[A]

Inherited from LinearSeq[A]

Inherited from LinearSeqLike[A, MutableList[A]]

Inherited from Seq[A]

Inherited from SeqLike[A, Seq[A]]

Inherited from Cloneable[Queue[A]]

Inherited from Seq[A]

Inherited from SeqLike[A, MutableList[A]]

Inherited from GenSeq[A]

Inherited from GenSeqLike[A, MutableList[A]]

Inherited from PartialFunction[Int, A]

Inherited from (Int) ⇒ A

Inherited from Iterable[A]

Inherited from Iterable[A]

Inherited from IterableLike[A, MutableList[A]]

Inherited from Equals

Inherited from GenIterable[A]

Inherited from GenIterableLike[A, MutableList[A]]

Inherited from Traversable[A]

Inherited from Mutable

Inherited from Traversable[A]

Inherited from GenTraversable[A]

Inherited from GenericTraversableTemplate[A, Queue]

Inherited from TraversableLike[A, MutableList[A]]

Inherited from GenTraversableLike[A, MutableList[A]]

Inherited from Parallelizable[A, ParSeq[A]]

Inherited from TraversableOnce[A]

Inherited from GenTraversableOnce[A]

Inherited from FilterMonadic[A, MutableList[A]]

Inherited from HasNewBuilder[A, Queue[A]]

Inherited from AnyRef

Inherited from Any