scala.collection.mutable

Queue

class Queue[A] extends MutableList[A] with Cloneable[Queue[A]]

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

known subclasses: SynchronizedQueue, QueueProxy

Inherits

  1. Cloneable
  2. MutableList
  3. Builder
  4. Growable
  5. LinearSeq
  6. LinearSeq
  7. LinearSeqLike
  8. Seq
  9. Seq
  10. SeqLike
  11. PartialFunction
  12. Function1
  13. Iterable
  14. Iterable
  15. IterableLike
  16. Equals
  17. Traversable
  18. Mutable
  19. Traversable
  20. GenericTraversableTemplate
  21. TraversableLike
  22. HasNewBuilder
  23. AnyRef
  24. Any

Type Members

  1. class WithFilter extends AnyRef

    A class supporting filtered operations

Value Members

  1. def ++[B >: A, That](that: Iterator[B])(bf: CanBuildFrom[MutableList[A], B, That]): That

    Concatenates this growable collection with the elements of an iterator

    Concatenates this growable collection with the elements of an iterator.

    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 iterator 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 growable collection followed by all elements of that.

    definition classes: TraversableLike
  2. def ++[B >: A, That](that: Traversable[B])(bf: CanBuildFrom[MutableList[A], B, That]): That

    Concatenates this growable collection with the elements of a traversable collection

    Concatenates this growable collection 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 growable collection followed by all elements of that.

    definition classes: TraversableLike
  3. def ++=(elems: Traversable[A]): Growable[A]

    adds all elements contained in a traversable collection to this growable collection

    adds all elements contained in a traversable collection to this growable collection.

    elems

    the collection containing the elements to add.

    returns

    the growable collection itself.

    definition classes: Growable
  4. def ++=(iter: Iterator[A]): Growable[A]

    adds all elements produced by an iterator to this growable collection

    adds all elements produced by an iterator to this growable collection.

    iter

    the iterator producing the elements to add.

    returns

    the growable collection itself.

    definition classes: Growable
  5. def +:[B >: A, That](elem: B)(bf: CanBuildFrom[MutableList[A], B, That]): That

    Prepends an element to this growable collection

    Prepends an element to this growable collection

    B

    the element type of the returned growable 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.

    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 growable collection.

    definition classes: SeqLike
  6. def +=(elem: A): MutableList[A]

    Appends a single element to this buffer

    Appends a single element to this buffer. This takes constant time.

    elem

    the element to append.

    returns

    the builder itself.

    definition classes: MutableListBuilderGrowable
  7. def +=(elem1: A, elem2: A, elems: A*): Growable[A]

    adds two or more elements to this growable collection

    adds two or more elements to this growable collection.

    elem1

    the first element to add.

    elem2

    the second element to add.

    elems

    the remaining elements to add.

    returns

    the growable collection itself

    definition classes: Growable
  8. def /:[B](z: B)(op: (B, A) ⇒ B): B

    Applies a binary operator to a start value and all elements of this growable collection, going left to right

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

    Note: /: is alternate syntax for foldLeft; z /: xs is the same as xs foldLeft z.

    Note: will not terminate for infinite-sized collections.

    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 growable collection$, going left to right with the start value z on the left: {{{ op(...op(op(z, x1), x2), ..., xn) }}} where x,,1,,, ..., x,,n,, are the elements of this growable collection.

    definition classes: TraversableLike
  9. def :+[B >: A, That](elem: B)(bf: CanBuildFrom[MutableList[A], B, That]): That

    Appends an element to this growable collection

    Appends an element to this growable collection

    Note: will not terminate for infinite-sized collections.

    B

    the element type of the returned growable 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.

    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 growable collection followed by elem.

    definition classes: SeqLike
  10. def :\[B](z: B)(op: (A, B) ⇒ B): B

    Applies a binary operator to all elements of this growable collection and a start value, going right to left

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

    Note: :\ is alternate syntax for foldRight; xs :\ z is the same as xs foldRight z.

    Note: will not terminate for infinite-sized collections.

    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 growable collection$, going right to left with the start value z on the right: {{{ op(x1, op(x2, ... op(xn, z)...)) }}} where x,,1,,, ..., x,,n,, are the elements of this growable collection.

    definition classes: TraversableLike
  11. def addString(b: StringBuilder): StringBuilder

    Appends all elements of this growable collection to a string builder

    Appends all elements of this growable collection to a string builder. The written text consists of the string representations (w.r.t. the method toString) of all elements of this growable collection 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: TraversableLike
  12. def addString(b: StringBuilder, sep: String): StringBuilder

    Appends all elements of this growable collection to a string builder using a separator string

    Appends all elements of this growable collection 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 growable collection, 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: TraversableLike
  13. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

    Appends all elements of this growable collection to a string builder using start, end, and separator strings

    Appends all elements of this growable collection 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 growable collection 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: TraversableLike
  14. 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
  15. def apply(n: Int): A

    Returns the nth element of this list

    Returns the nth element of this list.

    definition classes: MutableListLinearSeqLikeSeqLikeFunction1
  16. 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 growable collection should be compared

    returns

    true, if this growable collection 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
  17. def clear(): Unit

    Clears the contents of this builder

    Clears the contents of this builder. After execution of this method the builder will contain no elements.

    definition classes: MutableListBuilderGrowable
  18. def clone(): Queue[A]

    This method creates and returns a copy of the receiver object

    This method creates and returns a copy of the receiver object.

    The default implementation of the clone method is platform dependent.

    definition classes: Cloneable ⇐ AnyRef
  19. def companion: GenericCompanion[LinearSeq[A][A]]

    The factory companion object that builds instances of class Growable

    The factory companion object that builds instances of class Growable.

    definition classes: LinearSeqLinearSeqSeqSeqIterableIterableTraversableTraversableGenericTraversableTemplate
  20. def compose[A](g: (A) ⇒ Int): (A) ⇒ A

    (f compose g)(x) == f(g(x))

    (f compose g)(x) == f(g(x))

    definition classes: Function1
  21. def contains(elem: Any): Boolean

    Tests whether this growable collection contains a given value as an element

    Tests whether this growable collection contains a given value as an element.

    Note: may not terminate for infinite-sized collections.

    elem

    the element to test.

    returns

    true if this growable collection has an element that is is equal (wrt ==) to elem, false otherwise.

    definition classes: SeqLike
  22. def containsSlice[B](that: Seq[B]): Boolean

    Tests whether this growable collection contains a given sequence as a slice

    Tests whether this growable collection contains a given sequence as a slice.

    Note: may not terminate for infinite-sized collections.

    that

    the sequence to test

    returns

    true if this growable collection contains a slice with the same elements as that, otherwise false.

    definition classes: SeqLike
  23. def copyToArray[B >: A](xs: Array[B], start: Int, len: Int): Unit

    Copies elements of this growable collection to an array

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

    Note: will not terminate for infinite-sized collections.

    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: IterableLikeTraversableLike
  24. def copyToArray[B >: A](xs: Array[B]): Unit

    Copies elements of this growable collection to an array

    Copies elements of this growable collection to an array. Fills the given array xs with all elements of this growable collection, starting at position 0. Copying will stop once either the end of the current growable collection is reached, or the end of the array is reached.

    Note: will not terminate for infinite-sized collections.

    B

    the type of the elements of the array.

    xs

    the array to fill.

    definition classes: TraversableLike
  25. def copyToArray[B >: A](xs: Array[B], start: Int): Unit

    Copies elements of this growable collection to an array

    Copies elements of this growable collection to an array. Fills the given array xs with all elements of this growable collection, starting at position start. Copying will stop once either the end of the current growable collection is reached, or the end of the array is reached.

    Note: will not terminate for infinite-sized collections.

    B

    the type of the elements of the array.

    xs

    the array to fill.

    start

    the starting index.

    definition classes: TraversableLike
  26. def copyToBuffer[B >: A](dest: Buffer[B]): Unit

    Copies all elements of this growable collection to a buffer

    Copies all elements of this growable collection to a buffer.

    Note: will not terminate for infinite-sized collections.

    dest

    The buffer to which elements are copied.

    definition classes: TraversableLike
  27. def corresponds[B](that: Seq[B])(p: (A, B) ⇒ Boolean): Boolean

    Tests whether every element of this growable collection relates to the corresponding element of another sequence by satisfying a test predicate

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

    definition classes: SeqLike
  28. def count(p: (A) ⇒ Boolean): Int

    Counts the number of elements in the growable collection which satisfy a predicate

    Counts the number of elements in the growable collection which satisfy a predicate.

    p

    the predicate used to test elements.

    returns

    the number of elements satisfying the predicate p.

    definition classes: LinearSeqLikeTraversableLike
  29. 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.

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

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

  32. def diff[B >: A, That](that: Seq[B]): MutableList[A]

    Computes the multiset difference between this growable collection and another sequence

    Computes the multiset difference between this growable collection and another sequence.

    Note: will not terminate for infinite-sized collections.

    B

    the element type of the returned growable 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 sequence of elements to remove

    returns

    a new collection of type That which contains all elements of this growable collection 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
  33. 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 growable collection.

    returns

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

    definition classes: LinearSeqLikeTraversableLike
  34. def dropRight(n: Int): MutableList[A]

    Selects all elements except first n ones

    Selects all elements except first n ones.

    n

    The number of elements to take

    returns

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

    definition classes: LinearSeqLikeIterableLike
  35. 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 growable collection whose first element does not satisfy the predicate p.

    definition classes: TraversableLike
  36. def elements: Iterator[A]

  37. def endsWith[B](that: Seq[B]): Boolean

    Tests whether this growable collection ends with the given sequence

    Tests whether this growable collection ends with the given sequence.

    Note: will not terminate for infinite-sized collections.

    that

    the sequence to test

    returns

    true if this growable collection has that as a suffix, false otherwise.

    definition classes: SeqLike
  38. def enqueue(elems: A*): Unit

    Adds all elements to the queue

    Adds all elements to the queue.

    elems

    the elements to add.

  39. def equals(that: Any): Boolean

    The equality method defined in AnyRef

    The equality method defined in AnyRef.

    definition classes: SeqLikeEquals ⇐ AnyRef ⇐ Any
  40. def equalsWith[B](that: Seq[B])(f: (A, B) ⇒ Boolean): Boolean

    Tests whether every element of this growable collection relates to the corresponding element of another sequence by satisfying a test predicate

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

    definition classes: SeqLike
  41. def exists(p: (A) ⇒ Boolean): Boolean

    Tests whether a predicate holds for some of the elements of this growable collection

    Tests whether a predicate holds for some of the elements of this growable collection.

    Note: may not terminate for infinite-sized collections.

    p

    the predicate used to test elements.

    returns

    true if the given predicate p holds for some of the elements of this growable collection, otherwise false.

    definition classes: LinearSeqLikeIterableLikeTraversableLike
  42. 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.

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

    Selects all elements of this growable collection which satisfy a predicate

    Selects all elements of this growable collection which satisfy a predicate.

    p

    the predicate used to test elements.

    returns

    a new growable collection consisting of all elements of this growable collection that satisfy the given predicate p. The order of the elements is preserved.

    definition classes: TraversableLike
  44. def filterNot(p: (A) ⇒ Boolean): MutableList[A]

    Selects all elements of this growable collection which do not satisfy a predicate

    Selects all elements of this growable collection which do not satisfy a predicate.

    p

    the predicate used to test elements.

    returns

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

    definition classes: TraversableLike
  45. def find(p: (A) ⇒ Boolean): Option[A]

    Finds the first element of the growable collection satisfying a predicate, if any

    Finds the first element of the growable collection satisfying a predicate, if any.

    Note: may not terminate for infinite-sized collections.

    p

    the predicate used to test elements.

    returns

    an option value containing the first element in the growable collection that satisfies p, or None if none exists.

    definition classes: LinearSeqLikeIterableLikeTraversableLike
  46. def findIndexOf(p: (A) ⇒ Boolean): Int

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

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

    definition classes: SeqLike
  47. def findLastIndexOf(p: (A) ⇒ Boolean): Int

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

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

    definition classes: SeqLike
  48. def first: A

  49. def firstOption: Option[A]

    None if iterable is empty

    None if iterable is empty.

    definition classes: IterableLike
  50. def flatMap[B, That](f: (A) ⇒ Traversable[B])(bf: CanBuildFrom[MutableList[A], B, That]): That

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

    Builds a new collection by applying a function to all elements of this growable collection 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 growable collection and concatenating the results.

    definition classes: TraversableLike
  51. def flatten[B](asTraversable: (A) ⇒ Traversable[B]): LinearSeq[B]

    Converts this growable collection of traversable collections into a growable collection in which all element collections are concatenated

    Converts this growable collection of traversable collections into a growable collection 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 growable collection is a Traversable.

    returns

    a new growable collection resulting from concatenating all element growable collections.

    definition classes: GenericTraversableTemplate
  52. def foldLeft[B](z: B)(f: (B, A) ⇒ B): B

    Applies a binary operator to a start value and all elements of this growable collection, going left to right

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

    Note: will not terminate for infinite-sized collections.

    B

    the result type of the binary operator.

    z

    the start value.

    returns

    the result of inserting op between consecutive elements of this growable collection$, going left to right with the start value z on the left: {{{ op(...op(z, x1), x2, ..., xn) }}} where x,,1,,, ..., x,,n,, are the elements of this growable collection.

    definition classes: LinearSeqLikeTraversableLike
  53. def foldRight[B](z: B)(f: (A, B) ⇒ B): B

    Applies a binary operator to all elements of this growable collection and a start value, going right to left

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

    Note: will not terminate for infinite-sized collections.

    B

    the result type of the binary operator.

    z

    the start value.

    returns

    the result of inserting op between consecutive elements of this growable collection$, going right to left with the start value z on the right: {{{ op(x1, op(x2, ... op(xn, z)...)) }}} where x,,1,,, ..., x,,n,, are the elements of this growable collection.

    definition classes: LinearSeqLikeIterableLikeTraversableLike
  54. def forall(p: (A) ⇒ Boolean): Boolean

    Tests whether a predicate holds for all elements of this growable collection

    Tests whether a predicate holds for all elements of this growable collection.

    Note: may not terminate for infinite-sized collections.

    p

    the predicate used to test elements.

    returns

    true if the given predicate p holds for all elements of this growable collection, otherwise false.

    definition classes: LinearSeqLikeIterableLikeTraversableLike
  55. def foreach[B](f: (A) ⇒ B): Unit

    Applies a function f to all elements of this growable collection

    Applies a function f to all elements of this growable collection.

    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: LinearSeqLikeIterableLikeTraversableLike
  56. 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.

  57. def genericBuilder[B]: Builder[B, LinearSeq[B]]

    The generic builder that builds instances of Growable at arbitrary element types

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

    definition classes: GenericTraversableTemplate
  58. 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
  59. def groupBy[K](f: (A) ⇒ K): Map[K, MutableList[A]]

    Partitions this growable collection into a map of growable collections according to some discriminator function

    Partitions this growable collection into a map of growable collections 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 growable collection.

    K

    the type of keys returned by the discriminator function.

    f

    the discriminator function.

    returns

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

    definition classes: TraversableLike
  60. def hasDefiniteSize: Boolean

    Tests whether this growable collection is known to have a finite size

    Tests whether this growable collection 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.

    definition classes: TraversableLike
  61. def hashCode(): Int

    Hashcodes for Growable produce a value from the hashcodes of all the elements of the growable collection

    Hashcodes for Growable produce a value from the hashcodes of all the elements of the growable collection.

    definition classes: SeqLike ⇐ AnyRef ⇐ Any
  62. def head: A

    Returns the first element in this list

    Returns the first element in this list

  63. def headOption: Option[A]

    Optionally selects the first element

    Optionally selects the first element.

    definition classes: TraversableLike
  64. def indexOf[B >: A](elem: B, from: Int): Int

    Finds index of first occurrence of some value in this growable collection after or at some start index

    Finds index of first occurrence of some value in this growable collection after or at some start index.

    Note: may not terminate for infinite-sized collections.

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

    definition classes: SeqLike
  65. def indexOf[B >: A](elem: B): Int

    Finds index of first occurrence of some value in this growable collection

    Finds index of first occurrence of some value in this growable collection.

    Note: may not terminate for infinite-sized collections.

    B

    the type of the element elem.

    elem

    the element value to search for.

    returns

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

    definition classes: SeqLike
  66. def indexOfSlice[B >: A](that: Seq[B], from: Int): Int

    Finds first index after or at a start index where this growable collection contains a given sequence as a slice

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

    Note: may not terminate for infinite-sized collections.

    that

    the sequence to test

    from

    the start index

    returns

    the first index >= from such that the elements of this growable collection starting at this index match the elements of sequence that, or -1 of no such subsequence exists.

    definition classes: SeqLike
  67. def indexOfSlice[B >: A](that: Seq[B]): Int

    Finds first index where this growable collection contains a given sequence as a slice

    Finds first index where this growable collection contains a given sequence as a slice.

    Note: may not terminate for infinite-sized collections.

    that

    the sequence to test

    returns

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

    definition classes: SeqLike
  68. 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.

    Note: may not terminate for infinite-sized collections.

    p

    the predicate used to test elements.

    from

    the start index

    returns

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

    definition classes: LinearSeqLikeSeqLike
  69. def indexWhere(p: (A) ⇒ Boolean): Int

    Finds index of first element satisfying some predicate

    Finds index of first element satisfying some predicate.

    Note: may not terminate for infinite-sized collections.

    p

    the predicate used to test elements.

    returns

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

    definition classes: SeqLike
  70. def indices: Range

    Produces the range of all indices of this sequence

    Produces the range of all indices of this sequence.

    definition classes: SeqLike
  71. def init: MutableList[A]

    Selects all elements except the last

    Selects all elements except the last.

    definition classes: TraversableLike
  72. def intersect[B >: A, That](that: Seq[B]): MutableList[A]

    Computes the multiset intersection between this growable collection and another sequence

    Computes the multiset intersection between this growable collection and another sequence.

    Note: may not terminate for infinite-sized collections.

    B

    the element type of the returned growable 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 sequence of elements to intersect with.

    returns

    a new collection of type That which contains all elements of this growable collection 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
  73. def isDefinedAt(x: Int): Boolean

    Tests whether this growable collection contains given index

    Tests whether this growable collection contains given index.

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

    definition classes: LinearSeqLikeSeqLike
  74. def isEmpty: Boolean

    Is the list empty?

    Is the list empty?

  75. def iterator: Iterator[A]

    Returns an iterator over all elements of this list

    Returns an iterator over all elements of this list.

    definition classes: MutableListLinearSeqLikeIterableLike
  76. def last: A

    Selects the last element

    Selects the last element.

    definition classes: MutableListLinearSeqLikeTraversableLike
  77. def lastIndexOf[B >: A](elem: B, end: Int): Int

    Finds index of last occurrence of some value in this growable collection before or at a given end index

    Finds index of last occurrence of some value in this growable collection 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 growable collection that is equal (wrt ==) to elem, or -1, if none exists.

    definition classes: SeqLike
  78. def lastIndexOf[B >: A](elem: B): Int

    Finds index of last occurrence of some value in this growable collection

    Finds index of last occurrence of some value in this growable collection.

    Note: will not terminate for infinite-sized collections.

    B

    the type of the element elem.

    elem

    the element value to search for.

    returns

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

    definition classes: SeqLike
  79. def lastIndexOfSlice[B >: A](that: Seq[B], end: Int): Int

    Finds last index before or at a given end index where this growable collection contains a given sequence as a slice

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

    that

    the sequence to test

    end

    the end idnex

    returns

    the last index <= end such that the elements of this growable collection starting at this index match the elements of sequence that, or -1 of no such subsequence exists.

    definition classes: SeqLike
  80. def lastIndexOfSlice[B >: A](that: Seq[B]): Int

    Finds last index where this growable collection contains a given sequence as a slice

    Finds last index where this growable collection contains a given sequence as a slice.

    Note: will not terminate for infinite-sized collections.

    that

    the sequence to test

    returns

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

    definition classes: SeqLike
  81. 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 growable collection that satisfies the predicate p, or -1, if none exists.

    definition classes: LinearSeqLikeSeqLike
  82. def lastIndexWhere(p: (A) ⇒ Boolean): Int

    Finds index of last element satisfying some predicate

    Finds index of last element satisfying some predicate.

    Note: will not terminate for infinite-sized collections.

    p

    the predicate used to test elements.

    returns

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

    definition classes: SeqLike
  83. def lastOption: Option[A]

    Optionally selects the last element

    Optionally selects the last element.

    definition classes: TraversableLike
  84. def length: Int

    Returns the length of this list

    Returns the length of this list.

    definition classes: MutableListLinearSeqLikeSeqLike
  85. def lengthCompare(len: Int): Int

    Compares the length of this growable collection to a test value

    Compares the length of this growable collection 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: LinearSeqLikeSeqLike
  86. 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.

    definition classes: PartialFunction
  87. def map[B, That](f: (A) ⇒ B)(bf: CanBuildFrom[MutableList[A], B, That]): That

    Builds a new collection by applying a function to all elements of this growable collection

    Builds a new collection by applying a function to all elements of this growable 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.

    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 growable collection and collecting the results.

    definition classes: TraversableLike
  88. 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
  89. def max[B >: A](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 growable collection with respect to the ordering cmp.

    definition classes: TraversableLike
  90. def min[B >: A](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 growable collection with respect to the ordering cmp.

    definition classes: TraversableLike
  91. def mkString: String

    Displays all elements of this growable collection in a string

    Displays all elements of this growable collection in a string.

    definition classes: TraversableLike
  92. def mkString(sep: String): String

    Displays all elements of this growable collection in a string using a separator string

    Displays all elements of this growable collection in a string using a separator string.

    sep

    the separator string.

    returns

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

    definition classes: TraversableLike
  93. def mkString(start: String, sep: String, end: String): String

    Displays all elements of this growable collection in a string using start, end, and separator strings

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

    definition classes: TraversableLike
  94. def nonEmpty: Boolean

    Tests whether the growable collection is not empty

    Tests whether the growable collection is not empty.

    definition classes: TraversableLike
  95. 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
  96. def padTo[B >: A, That](len: Int, elem: B)(bf: CanBuildFrom[MutableList[A], B, That]): That

    Appends an element value to this growable collection until a given target length is reached

    Appends an element value to this growable collection until a given target length is reached.

    B

    the element type of the returned growable 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.

    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 growable collection followed by the minimal number of occurrences of elem so that the resulting collection has a length of at least len.

    definition classes: SeqLike
  97. def partialMap[B, That](pf: PartialFunction[A, B])(bf: CanBuildFrom[MutableList[A], B, That]): That

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

    Builds a new collection by applying a partial function to all elements of this growable collection 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 growable collection.

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

    Partitions this growable collection in two growable collections according to a predicate

    Partitions this growable collection in two growable collections according to a predicate.

    p

    the predicate on which to partition.

    returns

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

    definition classes: TraversableLike
  99. def patch[B >: A, That](from: Int, patch: Seq[B], replaced: Int)(bf: CanBuildFrom[MutableList[A], B, That]): That

    Produces a new growable collection where a slice of elements in this growable collection is replaced by another sequence

    Produces a new growable collection where a slice of elements in this growable collection is replaced by another sequence.

    B

    the element type of the returned growable 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.

    from

    the index of the first replaced element

    patch

    the replacement sequence

    replaced

    the number of elements to drop in the original growable collection

    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 growable collection except that replaced elements starting from from are replaced by patch.

    definition classes: SeqLike
  100. def prefixLength(p: (A) ⇒ Boolean): Int

    Returns the length of the longest prefix whose elements all satisfy some preficate

    Returns the length of the longest prefix whose elements all satisfy some preficate.

    Note: may not terminate for infinite-sized collections.

    p

    the predicate used to test elements.

    returns

    the length of the longest prefix of this growable collection such that every element of the segment satisfies the predicate p.

    definition classes: SeqLike
  101. def product[B >: A](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 growable collection with respect to the * operator in num.

    definition classes: TraversableLike
  102. 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
  103. def reduceLeft[B >: A](f: (B, A) ⇒ B): B

    Applies a binary operator to all elements of this growable collection, going left to right

    Applies a binary operator to all elements of this growable collection, going left to right.

    Note: will not terminate for infinite-sized collections.

    B

    the result type of the binary operator.

    returns

    the result of inserting op between consecutive elements of this growable collection$, going left to right: {{{ op(...(op(x1, x2), ... ) , xn) }}} where x,,1,,, ..., x,,n,, are the elements of this growable collection.

    definition classes: LinearSeqLikeTraversableLike
  104. def reduceLeftOption[B >: A](op: (B, A) ⇒ B): Option[B]

    Optionally applies a binary operator to all elements of this growable collection, going left to right

    Optionally applies a binary operator to all elements of this growable collection, going left to right.

    Note: will not terminate for infinite-sized collections.

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

    an option value containing the result of reduceLeft(op) is this growable collection is nonempty, None otherwise.

    definition classes: TraversableLike
  105. def reduceRight[B >: A](op: (A, B) ⇒ B): B

    Applies a binary operator to all elements of this growable collection, going right to left

    Applies a binary operator to all elements of this growable collection, going right to left.

    Note: will not terminate for infinite-sized collections.

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

    the result of inserting op between consecutive elements of this growable collection$, going right to left: {{{ op(x1, op(x2, ..., op(xn-1, xn)...)) }}} where x,,1,,, ..., x,,n,, are the elements of this growable collection.

    definition classes: LinearSeqLikeIterableLikeTraversableLike
  106. def reduceRightOption[B >: A](op: (A, B) ⇒ B): Option[B]

    Optionally applies a binary operator to all elements of this growable collection, going right to left

    Optionally applies a binary operator to all elements of this growable collection, going right to left.

    Note: will not terminate for infinite-sized collections.

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

    an option value containing the result of reduceRight(op) is this growable collection is nonempty, None otherwise.

    definition classes: TraversableLike
  107. def removeDuplicates: MutableList[A]

    Builds a new growable collection from this growable collection without any duplicate elements

    Builds a new growable collection from this growable collection without any duplicate elements.

    Note: will not terminate for infinite-sized collections.

    definition classes: SeqLike
  108. def repr: MutableList[A]

    The collection of type growable collection underlying this TraversableLike object

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

    definition classes: TraversableLike
  109. def reset(): Unit

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

    definition classes: MutableListBuilder
  111. def reverse: MutableList[A]

    Returns new growable collection wih elements in reversed order

    Returns new growable collection wih elements in reversed order.

    Note: will not terminate for infinite-sized collections.

    definition classes: SeqLike
  112. def reverseIterator: Iterator[A]

    An iterator yielding elements in reversed order

    An iterator yielding elements in reversed order.

    Note: will not terminate for infinite-sized collections.

    Note: xs.reverseIterator is the same as xs.reverse.iterator but might be more efficient.

    definition classes: SeqLike
  113. def reverseMap[B, That](f: (A) ⇒ B)(bf: CanBuildFrom[MutableList[A], B, That]): That

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

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

    Note: will not terminate for infinite-sized collections.

    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 growable collection and collecting the results in reversed order.

    definition classes: SeqLike
  114. def reversedElements: Iterator[A]

  115. def sameElements[B >: A](that: Iterable[B]): Boolean

    Checks if the other iterable collection contains the same elements in the same order as this growable collection

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

    Note: will not terminate for infinite-sized collections.

    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: LinearSeqLikeIterableLike
  116. def segmentLength(p: (A) ⇒ Boolean, from: Int): Int

    Computes length of longest segment whose elements all satisfy some preficate

    Computes length of longest segment whose elements all satisfy some preficate.

    Note: may not terminate for infinite-sized collections.

    p

    the predicate used to test elements.

    from

    the index where the search starts.

    returns

    the length of the longest segment of this growable collection starting from index from such that every element of the segment satisfies the predicate p.

    definition classes: LinearSeqLikeSeqLike
  117. def size: Int

    The size of this growable collection, equivalent to length

    The size of this growable collection, equivalent to length.

    Note: will not terminate for infinite-sized collections.

    definition classes: SeqLikeTraversableLike
  118. 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.

    definition classes: Builder
  119. def slice(from: Int, until: Int): MutableList[A]

    Selects an interval of elements

    Selects an interval of elements.

    Note: c.slice(from, to) is equivalent to (but possibly more efficient than) c.drop(from).take(to - from)

    from

    the index of the first returned element in this growable collection.

    until

    the index one past the last returned element in this growable collection.

    returns

    a growable collection containing the elements starting at index from and extending up to (but not including) index until of this growable collection.

    definition classes: LinearSeqLikeIterableLikeTraversableLike
  120. def sortBy[B](f: (A) ⇒ B)(ord: Ordering[B]): MutableList[A]

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

    Sorts this Growable 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 growable collection consisting of the elements of this growable collection sorted according to the ordering where x < y if ord.lt(f(x), f(y)).

    definition classes: SeqLike
  121. def sortWith[B >: A](ord: Ordering[B]): MutableList[A]

    Sorts this growable collection according to an Ordering

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

    definition classes: SeqLike
  122. def sortWith(lt: (A, A) ⇒ Boolean): MutableList[A]

    Sorts this growable collection according to a comparison function

    Sorts this growable collection according to a comparison function.

    Note: will not terminate for infinite-sized collections.

    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 growable collection consisting of the elements of this growable collection sorted according to the comparison function lt.

    definition classes: SeqLike
  123. def span(p: (A) ⇒ Boolean): (MutableList[A], MutableList[A])

    Spits this growable collection into a prefix/suffix pair according to a predicate

    Spits this growable collection 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 growable collection whose elements all satisfy p, and the rest of this growable collection.

    definition classes: LinearSeqLikeTraversableLike
  124. def splitAt(n: Int): (MutableList[A], MutableList[A])

    Splits this growable collection into two at a given position

    Splits this growable collection 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 growable collections consisting of the first n elements of this growable collection, and the other elements.

    definition classes: TraversableLike
  125. def startsWith[B](that: Seq[B]): Boolean

    Tests whether this growable collection starts with the given sequence

    Tests whether this growable collection starts with the given sequence.

    that

    the sequence to test

    returns

    true if this collection has that as a prefix, false otherwise. otherwise false

    definition classes: SeqLike
  126. def startsWith[B](that: Seq[B], offset: Int): Boolean

    Tests whether this growable collection contains the given sequence at a given index

    Tests whether this growable collection 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 growable collection at index offset, otherwise false.

    definition classes: SeqLike
  127. def stringPrefix: String

    Defines the prefix of this object's toString representation

    Defines the prefix of this object's toString representation.

    definition classes: TraversableLike
  128. def sum[B >: A](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 growable collection with respect to the + operator in num.

    definition classes: TraversableLike
  129. def tail: MutableList[A]

    Returns the rest of this list

    Returns the rest of this list

    definition classes: MutableListLinearSeqLikeTraversableLike
  130. def take(n: Int): MutableList[A]

    Selects first n elements

    Selects first n elements.

    n

    Tt number of elements to take from this growable collection.

    returns

    a growable collection consisting only of the first n elements of this growable collection, or else the whole growable collection, if it has less than n elements.

    definition classes: LinearSeqLikeIterableLikeTraversableLike
  131. def takeRight(n: Int): MutableList[A]

    Selects last n elements

    Selects last n elements.

    n

    the number of elements to take

    returns

    a growable collection consisting only of the last n elements of this growable collection, or else the whole growable collection, if it has less than n elements.

    definition classes: IterableLike
  132. 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 growable collection whose elements all satisfy the predicate p.

    definition classes: LinearSeqLikeIterableLikeTraversableLike
  133. def toArray[B >: A](arg0: ClassManifest[B]): Array[B]

    Converts this growable collection to an array

    Converts this growable collection to an array.

    Note: will not terminate for infinite-sized collections.

    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 growable collection.

    definition classes: TraversableLike
  134. def toIndexedSeq[B >: A]: IndexedSeq[B]

    Converts this growable collection to an indexed sequence

    Converts this growable collection to an indexed sequence.

    Note: will not terminate for infinite-sized collections.

    definition classes: TraversableLike
  135. def toIterable: Iterable[A]

    Converts this growable collection to an iterable collection

    Converts this growable collection to an iterable collection.

    Note: Will not terminate for infinite-sized collections.

    definition classes: IterableLikeTraversableLike
  136. def toList: List[A]

    Returns an instance of scala

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

    definition classes: MutableListTraversableLike
  137. def toSeq: Seq[A]

    Converts this growable collection to a sequence

    Converts this growable collection to a sequence.

    Note: will not terminate for infinite-sized collections.

    Overridden for efficiency.

    definition classes: SeqLikeTraversableLike
  138. def toSet[B >: A]: Set[B]

    Converts this growable collection to a set

    Converts this growable collection to a set.

    Note: will not terminate for infinite-sized collections.

    definition classes: TraversableLike
  139. def toStream: Stream[A]

    Converts this growable collection to a stream

    Converts this growable collection to a stream.

    Note: will not terminate for infinite-sized collections.

    definition classes: IterableLikeTraversableLike
  140. def toString(): String

    Converts this growable collection to a string

    Converts this growable collection to a string

    definition classes: SeqLikeTraversableLike ⇐ AnyRef ⇐ Any
  141. def transpose[B](asTraversable: (A) ⇒ Traversable[B]): LinearSeq[LinearSeq[B]]

    Transposes this growable collection of traversable collections into

    Transposes this growable collection of traversable collections into

    definition classes: GenericTraversableTemplate
  142. def union[B >: A, That](that: Seq[B])(bf: CanBuildFrom[MutableList[A], B, That]): That

    Produces a new sequence which contains all elements of this growable collection and also all elements of a given sequence

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

    Note: will not terminate for infinite-sized collections.

    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-oart of diff and intersect which also work on multi-sets.

    Note: will not terminate for infinite-sized collections.

    B

    the element type of the returned growable 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 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 growable collection followed by all elements of that.

    definition classes: SeqLike
  143. def unzip[A1, A2](asPair: (A) ⇒ (A1, A2)): (LinearSeq[A1], LinearSeq[A2])

    Converts this growable collection of pairs into two collections of the first and second halfs of each pair

    Converts this growable collection of pairs into two collections of the first and second halfs of each pair.

    asPair

    an implicit conversion which asserts that the element type of this growable collection is a pair.

    returns

    a pair growable collections, containing the first, respectively second half of each element pair of this growable collection.

    definition classes: GenericTraversableTemplate
  144. 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: MutableListSeq
  145. def updated[B >: A, That](index: Int, elem: B)(bf: CanBuildFrom[MutableList[A], B, That]): That

    A copy of this growable collection with one single replaced element

    A copy of this growable collection with one single replaced element.

    B

    the element type of the returned growable 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.

    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 collection of type That which is a copy of this growable collection with the element at position index replaced by elem.

    definition classes: SeqLike
  146. def view(from: Int, until: Int): SeqView[A, MutableList[A]]

    Creates a non-strict view of a slice of this growable collection

    Creates a non-strict view of a slice of this growable collection.

    Note: the difference between view and slice is that view produces a view of the current growable collection, whereas slice produces a new growable collection.

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

    definition classes: SeqLikeIterableLikeTraversableLike
  147. def view: SeqView[A, MutableList[A]]

    Creates a non-strict view of this growable collection

    Creates a non-strict view of this growable collection.

    definition classes: SeqLikeIterableLikeTraversableLike
  148. def withFilter(p: (A) ⇒ Boolean): WithFilter

    Creates a non-strict filter of this growable collection

    Creates a non-strict filter of this growable collection.

    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 growable collection which satify the predicate p.

    definition classes: TraversableLike
  149. def zip[A1 >: A, B, That](that: Iterable[B])(bf: CanBuildFrom[MutableList[A], (A1, B), That]): That

    Returns a growable collection formed from this growable collection and another iterable collection by combining corresponding elements in pairs

    Returns a growable collection formed from this growable collection 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 growable collection and that. The length of the returned collection is the minimum of the lengths of this growable collection$ and that.

    definition classes: IterableLike
  150. def zipAll[B, A1 >: A, That](that: Iterable[B], thisElem: A1, thatElem: B)(bf: CanBuildFrom[MutableList[A], (A1, B), That]): That

    Returns a growable collection formed from this growable collection and another iterable collection by combining corresponding elements in pairs

    Returns a growable collection formed from this growable collection 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 growable collection is shorter than that.

    thatElem

    the element to be used to fill up the result if that is shorter than this growable collection.

    returns

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

    definition classes: IterableLike
  151. def zipWithIndex[A1 >: A, That](bf: CanBuildFrom[MutableList[A], (A1, Int), That]): That

    Zips this growable collection with its indices

    Zips this growable collection 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 growable collection paired with their index. Indices start at 0.

    definition classes: IterableLike

Instance constructors

  1. new Queue()