Packages

class ArrayDeque[A] extends AbstractBuffer[A] with IndexedBuffer[A] with IndexedSeqOps[A, ArrayDeque, ArrayDeque[A]] with StrictOptimizedSeqOps[A, ArrayDeque, ArrayDeque[A]] with IterableFactoryDefaults[A, ArrayDeque] with ArrayDequeOps[A, ArrayDeque, ArrayDeque[A]] with Cloneable[ArrayDeque[A]] with DefaultSerializable

An implementation of a double-ended queue that internally uses a resizable circular buffer.

Append, prepend, removeHead, removeLast and random-access (indexed-lookup and indexed-replacement) take amortized constant time. In general, removals and insertions at i-th index are O(min(i, n-i)) and thus insertions and removals from end/beginning are fast.

A

the type of this ArrayDeque's elements.

Source
ArrayDeque.scala
Note

Subclasses must override the ofArray protected method to return a more specific type.

Known Subclasses
Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. ArrayDeque
  2. DefaultSerializable
  3. Serializable
  4. ArrayDequeOps
  5. StrictOptimizedSeqOps
  6. StrictOptimizedIterableOps
  7. IndexedBuffer
  8. IndexedSeq
  9. IndexedSeqOps
  10. IndexedSeq
  11. IndexedSeqOps
  12. AbstractBuffer
  13. Buffer
  14. Shrinkable
  15. Growable
  16. Clearable
  17. AbstractSeq
  18. Seq
  19. SeqOps
  20. Cloneable
  21. Cloneable
  22. Iterable
  23. AbstractSeq
  24. Seq
  25. Equals
  26. SeqOps
  27. PartialFunction
  28. Function1
  29. AbstractIterable
  30. Iterable
  31. IterableFactoryDefaults
  32. IterableOps
  33. IterableOnceOps
  34. IterableOnce
  35. AnyRef
  36. Any
Implicitly
  1. by UnliftOps
  2. by iterableOnceExtensionMethods
  3. by any2stringadd
  4. by StringFormat
  5. by Ensuring
  6. by ArrowAssoc
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Instance Constructors

  1. new ArrayDeque(initialSize: Int = ArrayDeque.DefaultInitialSize)
  2. new ArrayDeque(array: Array[AnyRef], start: Int, end: Int)

    Attributes
    protected

Value Members

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

    Test two objects for inequality.

    Test two objects for inequality.

    returns

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

    Definition Classes
    AnyRef → Any
  2. final def ##: Int

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

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

    returns

    a hash value consistent with ==

    Definition Classes
    AnyRef → Any
  3. def +(other: String): String
    Implicit
    This member is added by an implicit conversion from ArrayDeque[A] toany2stringadd[ArrayDeque[A]] performed by method any2stringadd in scala.Predef.
    Definition Classes
    any2stringadd
  4. final def ++[B >: A](suffix: IterableOnce[B]): ArrayDeque[B]

    Alias for concat

    Alias for concat

    Definition Classes
    IterableOps
    Annotations
    @inline()
  5. final def ++:[B >: A](prefix: IterableOnce[B]): ArrayDeque[B]

    Alias for prependedAll.

    Alias for prependedAll.

    Definition Classes
    SeqOpsIterableOps
    Annotations
    @inline()
  6. final def ++=(elems: IterableOnce[A]): ArrayDeque.this.type

    Alias for addAll

    Alias for addAll

    Definition Classes
    Growable
    Annotations
    @inline()
  7. final def ++=:(elems: IterableOnce[A]): ArrayDeque.this.type

    Alias for prependAll

    Alias for prependAll

    Definition Classes
    Buffer
    Annotations
    @inline()
  8. final def +:[B >: A](elem: B): ArrayDeque[B]

    Alias for prepended.

    Alias for prepended.

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

    Definition Classes
    SeqOps
    Annotations
    @inline()
  9. final def +=(elem: A): ArrayDeque.this.type

    Alias for addOne

    Alias for addOne

    Definition Classes
    Growable
    Annotations
    @inline()
  10. final def +=:(elem: A): ArrayDeque.this.type

    Alias for prepend

    Alias for prepend

    Definition Classes
    Buffer
    Annotations
    @inline()
  11. final def --=(xs: IterableOnce[A]): ArrayDeque.this.type

    Alias for subtractAll

    Alias for subtractAll

    Definition Classes
    Shrinkable
    Annotations
    @inline()
  12. final def -=(elem: A): ArrayDeque.this.type

    Alias for subtractOne

    Alias for subtractOne

    Definition Classes
    Shrinkable
    Annotations
    @inline()
  13. def ->[B](y: B): (ArrayDeque[A], B)
    Implicit
    This member is added by an implicit conversion from ArrayDeque[A] toArrowAssoc[ArrayDeque[A]] performed by method ArrowAssoc in scala.Predef.This conversion will take place only if A is a subclass of Option[Nothing] (A <: Option[Nothing]).
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  14. final def :+[B >: A](elem: B): ArrayDeque[B]

    Alias for appended.

    Alias for appended.

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

    Definition Classes
    SeqOps
    Annotations
    @inline()
  15. final def :++[B >: A](suffix: IterableOnce[B]): ArrayDeque[B]

    Alias for appendedAll.

    Alias for appendedAll.

    Definition Classes
    SeqOps
    Annotations
    @inline()
  16. final def ==(arg0: Any): Boolean

    The expression x == that is equivalent to if (x eq null) that eq null else x.equals(that).

    The expression x == that is equivalent to if (x eq null) that eq null else x.equals(that).

    returns

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

    Definition Classes
    AnyRef → Any
  17. def addAll(elems: IterableOnce[A]): ArrayDeque.this.type

    Adds all elements produced by an IterableOnce to this array deque.

    Adds all elements produced by an IterableOnce to this array deque.

    elems

    the IterableOnce producing the elements to add.

    returns

    the array deque itself.

    Definition Classes
    ArrayDequeGrowable
  18. def addOne(elem: A): ArrayDeque.this.type

    Adds a single element to this array deque.

    Adds a single element to this array deque.

    elem

    the element to add.

    returns

    the array deque itself

    Definition Classes
    ArrayDequeGrowable
  19. final def addString(b: StringBuilder): b.type

    Appends all elements of this array deque to a string builder.

    Appends all elements of this array deque to a string builder. The written text consists of the string representations (w.r.t. the method toString) of all elements of this array deque without any separator string.

    Example:

    scala> val a = List(1,2,3,4)
    a: List[Int] = List(1, 2, 3, 4)
    
    scala> val b = new StringBuilder()
    b: StringBuilder =
    
    scala> val h = a.addString(b)
    h: StringBuilder = 1234
    b

    the string builder to which elements are appended.

    returns

    the string builder b to which elements were appended.

    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  20. final def addString(b: StringBuilder, sep: String): b.type

    Appends all elements of this array deque to a string builder using a separator string.

    Appends all elements of this array deque 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 array deque, separated by the string sep.

    Example:

    scala> val a = List(1,2,3,4)
    a: List[Int] = List(1, 2, 3, 4)
    
    scala> val b = new StringBuilder()
    b: StringBuilder =
    
    scala> a.addString(b, ", ")
    res0: StringBuilder = 1, 2, 3, 4
    b

    the string builder to which elements are appended.

    sep

    the separator string.

    returns

    the string builder b to which elements were appended.

    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  21. def addString(b: StringBuilder, start: String, sep: String, end: String): b.type

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

    Appends all elements of this array deque 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 array deque are separated by the string sep.

    Example:

    scala> val a = List(1,2,3,4)
    a: List[Int] = List(1, 2, 3, 4)
    
    scala> val b = new StringBuilder()
    b: StringBuilder =
    
    scala> a.addString(b , "List(" , ", " , ")")
    res5: StringBuilder = List(1, 2, 3, 4)
    b

    the string builder to which elements are appended.

    start

    the starting string.

    sep

    the separator string.

    end

    the ending string.

    returns

    the string builder b to which elements were appended.

    Definition Classes
    IterableOnceOps
  22. def andThen[C](k: PartialFunction[A, C]): PartialFunction[Int, C]

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

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

    Note that calling isDefinedAt on the resulting partial function may apply the first partial function and execute its side effect. For efficiency, it is recommended to call applyOrElse instead of isDefinedAt or apply.

    C

    the result type of the transformation function.

    k

    the transformation function

    returns

    a partial function with the domain of this partial function narrowed by other partial function, which maps arguments x to k(this(x)).

    Definition Classes
    PartialFunction
  23. def andThen[C](k: (A) => C): PartialFunction[Int, C]

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

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

    If the runtime type of the function is a PartialFunction then the other andThen method is used (note its cautions).

    C

    the result type of the transformation function.

    k

    the transformation function

    returns

    a partial function with the domain of this partial function, possibly narrowed by the specified function, which maps arguments x to k(this(x)).

    Definition Classes
    PartialFunctionFunction1
  24. final def append(elem: A): ArrayDeque.this.type

    Appends the given elements to this buffer.

    Appends the given elements to this buffer.

    elem

    the element to append.

    returns

    this array deque

    Definition Classes
    Buffer
    Annotations
    @inline()
  25. final def appendAll(elems: IterableOnce[A]): ArrayDeque.this.type

    Appends the elements contained in a iterable object to this buffer.

    Appends the elements contained in a iterable object to this buffer.

    elems

    the iterable object containing the elements to append.

    returns

    this array deque

    Definition Classes
    Buffer
    Annotations
    @inline()
  26. def appended[B >: A](elem: B): ArrayDeque[B]

    A copy of this array deque with an element appended.

    A copy of this array deque with an element appended.

    Example:

    scala> val a = List(1)
    a: List[Int] = List(1)
    
    scala> val b = a :+ 2
    b: List[Int] = List(1, 2)
    
    scala> println(a)
    List(1)
    B

    the element type of the returned array deque.

    elem

    the appended element

    returns

    a new array deque consisting of all elements of this array deque followed by value.

    Definition Classes
    StrictOptimizedSeqOpsSeqOps
  27. def appendedAll[B >: A](suffix: IterableOnce[B]): ArrayDeque[B]

    Returns a new array deque containing the elements from the left hand operand followed by the elements from the right hand operand.

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

    B

    the element type of the returned collection.

    suffix

    the iterable to append.

    returns

    a new collection of type CC[B] which contains all elements of this array deque followed by all elements of suffix.

    Definition Classes
    StrictOptimizedSeqOpsSeqOps
  28. def apply(idx: Int): A

    Gets the element at the specified index.

    Gets the element at the specified index. This operation is provided for convenience in Seq. It should not be assumed to be efficient unless you have an IndexedSeq.

    Definition Classes
    ArrayDequeSeqOpsFunction1
  29. def applyOrElse[A1 <: Int, B1 >: A](x: A1, default: (A1) => B1): B1

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

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

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

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

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

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

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

    x

    the function argument

    default

    the fallback function

    returns

    the result of this function or fallback function application.

    Definition Classes
    PartialFunction
  30. var array: Array[AnyRef]
    Attributes
    protected
    Definition Classes
    ArrayDequeArrayDequeOps
  31. final def asInstanceOf[T0]: T0

    Cast the receiver object to be of type T0.

    Cast the receiver object to be of type T0.

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

    returns

    the receiver object.

    Definition Classes
    Any
    Exceptions thrown

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

  32. def canEqual(that: Any): Boolean

    Checks whether this instance can possibly equal that.

    Checks whether this instance can possibly equal that.

    A method that should be called from every well-designed equals method that is open to be overridden in a subclass. See Programming in Scala, Chapter 28 for discussion and design.

    that

    the value being probed for possible equality

    returns

    true if this instance can possibly equal that, otherwise false

    Definition Classes
    SeqEquals
  33. def className: String

    Defines the prefix of this object's toString representation.

    Defines the prefix of this object's toString representation.

    It is recommended to return the name of the concrete collection type, but not implementation subclasses. For example, for ListMap this method should return "ListMap", not "Map" (the supertype) or "Node" (an implementation subclass).

    The default implementation returns "Iterable". It is overridden for the basic collection kinds "Seq", "IndexedSeq", "LinearSeq", "Buffer", "Set", "Map", "SortedSet", "SortedMap" and "View".

    returns

    a string representation which starts the result of toString applied to this array deque. By default the string prefix is the simple name of the collection class array deque.

    Attributes
    protected[this]
    Definition Classes
    Iterable
  34. def clear(): Unit

    Note: This does not actually resize the internal representation.

    Note: This does not actually resize the internal representation. See clearAndShrink if you want to also resize internally

    Definition Classes
    ArrayDequeClearable
  35. def clearAndShrink(size: Int = ArrayDeque.DefaultInitialSize): ArrayDeque.this.type

    Clears this buffer and shrinks to @param size

  36. final def clone(): ArrayDeque[A]

    Create a copy of the receiver object.

    Create a copy of the receiver object.

    The default implementation of the clone method is platform dependent.

    returns

    a copy of the receiver object.

    Definition Classes
    ArrayDequeOps → AnyRef
    Note

    not specified by SLS as a member of AnyRef

  37. final def coll: ArrayDeque.this.type

    returns

    This collection as a C.

    Attributes
    protected
    Definition Classes
    IterableIterableOps
  38. def collect[B](pf: PartialFunction[A, B]): ArrayDeque[B]

    Builds a new array deque by applying a partial function to all elements of this array deque on which the function is defined.

    Builds a new array deque by applying a partial function to all elements of this array deque on which the function is defined.

    B

    the element type of the returned array deque.

    pf

    the partial function which filters and maps the array deque.

    returns

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

    Definition Classes
    StrictOptimizedIterableOpsIterableOpsIterableOnceOps
  39. def collectFirst[B](pf: PartialFunction[A, B]): Option[B]

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

    Finds the first element of the array deque 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
    IterableOnceOps
    Example:
    1. Seq("a", 1, 5L).collectFirst({ case x: Int => x*10 }) = Some(10)

  40. def combinations(n: Int): Iterator[ArrayDeque[A]]

    Iterates over combinations of elements.

    Iterates over combinations of elements.

    A combination of length n is a sequence of n elements selected in order of their first index in this sequence.

    For example, "xyx" has two combinations of length 2. The x is selected first: "xx", "xy". The sequence "yx" is not returned as a combination because it is subsumed by "xy".

    If there is more than one way to generate the same combination, only one will be returned.

    For example, the result "xy" arbitrarily selected one of the x elements.

    As a further illustration, "xyxx" has three different ways to generate "xy" because there are three elements x to choose from. Moreover, there are three unordered pairs "xx" but only one is returned.

    It is not specified which of these equal combinations is returned. It is an implementation detail that should not be relied on. For example, the combination "xx" does not necessarily contain the first x in this sequence. This behavior is observable if the elements compare equal but are not identical.

    As a consequence, "xyx".combinations(3).next() is "xxy": the combination does not reflect the order of the original sequence, but the order in which elements were selected, by "first index"; the order of each x element is also arbitrary.

    Note: Even when applied to a view or a lazy collection it will always force the elements.

    returns

    An Iterator which traverses the n-element combinations of this array deque.

    Definition Classes
    SeqOps
    Example:
    1. Seq('a', 'b', 'b', 'b', 'c').combinations(2).foreach(println)
      // List(a, b)
      // List(a, c)
      // List(b, b)
      // List(b, c)
      Seq('b', 'a', 'b').combinations(2).foreach(println)
      // List(b, b)
      // List(b, a)
  41. def compose[R](k: PartialFunction[R, Int]): PartialFunction[R, A]

    Composes another partial function k with this partial function so that this partial function gets applied to results of k.

    Composes another partial function k with this partial function so that this partial function gets applied to results of k.

    Note that calling isDefinedAt on the resulting partial function may apply the first partial function and execute its side effect. For efficiency, it is recommended to call applyOrElse instead of isDefinedAt or apply.

    R

    the parameter type of the transformation function.

    k

    the transformation function

    returns

    a partial function with the domain of other partial function narrowed by this partial function, which maps arguments x to this(k(x)).

    Definition Classes
    PartialFunction
  42. def compose[A](g: (A) => Int): (A) => A

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

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

    A

    the type to which function g can be applied

    g

    a function A => T1

    returns

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

    Definition Classes
    Function1
    Annotations
    @unspecialized()
  43. final def concat[B >: A](suffix: IterableOnce[B]): ArrayDeque[B]

    Returns a new array deque containing the elements from the left hand operand followed by the elements from the right hand operand.

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

    B

    the element type of the returned collection.

    suffix

    the iterable to append.

    returns

    a new array deque which contains all elements of this array deque followed by all elements of suffix.

    Definition Classes
    SeqOpsIterableOps
    Annotations
    @inline()
  44. def contains[A1 >: A](elem: A1): Boolean

    Tests whether this array deque contains a given value as an element.

    Tests whether this array deque contains a given value as an element.

    elem

    the element to test.

    returns

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

    Definition Classes
    SeqOps
  45. def containsSlice[B >: A](that: collection.Seq[B]): Boolean

    Tests whether this array deque contains a given sequence as a slice.

    Tests whether this array deque contains a given sequence as a slice.

    that

    the sequence to test

    returns

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

    Definition Classes
    SeqOps
  46. def copySliceToArray(srcStart: Int, dest: Array[_], destStart: Int, maxItems: Int): dest.type

    This is a more general version of copyToArray - this also accepts a srcStart unlike copyToArray This copies maxItems elements from this collections srcStart to dest's destStart If we reach the end of either collections before we could copy maxItems, we simply stop copying

    This is a more general version of copyToArray - this also accepts a srcStart unlike copyToArray This copies maxItems elements from this collections srcStart to dest's destStart If we reach the end of either collections before we could copy maxItems, we simply stop copying

    Definition Classes
    ArrayDequeOps
  47. def copyToArray[B >: A](dest: Array[B], destStart: Int, len: Int): Int

    Copy elements to an array, returning the number of elements written.

    Copy elements to an array, returning the number of elements written.

    Fills the given array xs starting at index start with at most len elements of this array deque.

    Copying will stop once either all the elements of this array deque have been copied, or the end of the array is reached, or len elements have been copied.

    B

    the type of the elements of the array.

    len

    the maximal number of elements to copy.

    returns

    the number of elements written to the array

    Definition Classes
    ArrayDequeIterableOnceOps
    Note

    Reuse: After calling this method, one should discard the iterator it was called on. Using it is undefined and subject to change.

  48. def copyToArray[B >: A](xs: Array[B], start: Int): Int

    Copies elements to an array, returning the number of elements written.

    Copies elements to an array, returning the number of elements written.

    Fills the given array xs starting at index start with values of this array deque.

    Copying will stop once either all the elements of this array deque have been copied, 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 of xs.

    returns

    the number of elements written to the array

    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
    Note

    Reuse: After calling this method, one should discard the iterator it was called on. Using it is undefined and subject to change.

  49. def copyToArray[B >: A](xs: Array[B]): Int

    Copies elements to an array, returning the number of elements written.

    Copies elements to an array, returning the number of elements written.

    Fills the given array xs starting at index start with values of this array deque.

    Copying will stop once either all the elements of this array deque have been copied, or the end of the array is reached.

    B

    the type of the elements of the array.

    xs

    the array to fill.

    returns

    the number of elements written to the array

    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
    Note

    Reuse: After calling this method, one should discard the iterator it was called on. Using it is undefined and subject to change.

  50. def corresponds[B](that: collection.Seq[B])(p: (A, B) => Boolean): Boolean

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

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

    Definition Classes
    SeqOps
  51. def corresponds[B](that: IterableOnce[B])(p: (A, B) => Boolean): Boolean

    Tests whether every element of this collection's iterator relates to the corresponding element of another collection by satisfying a test predicate.

    Tests whether every element of this collection's iterator relates to the corresponding element of another collection by satisfying a test predicate.

    B

    the type of the elements of that

    that

    the other collection

    p

    the test predicate, which relates elements from both collections

    returns

    true if both collections have the same length and p(x, y) is true for all corresponding elements x of this iterator and y of that, otherwise false

    Definition Classes
    IterableOnceOps
  52. def count(p: (A) => Boolean): Int

    Counts the number of elements in the array deque which satisfy a predicate.

    Counts the number of elements in the array deque which satisfy a predicate.

    p

    the predicate used to test elements.

    returns

    the number of elements satisfying the predicate p.

    Definition Classes
    IterableOnceOps
  53. def diff[B >: A](that: collection.Seq[B]): ArrayDeque[A]

    Computes the multiset difference between this array deque and another sequence.

    Computes the multiset difference between this array deque and another sequence.

    that

    the sequence of elements to remove

    returns

    a new array deque which contains all elements of this array deque 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
    StrictOptimizedSeqOpsSeqOps
  54. def distinct: ArrayDeque[A]

    Selects all the elements of this array deque ignoring the duplicates.

    Selects all the elements of this array deque ignoring the duplicates.

    returns

    a new array deque consisting of all the elements of this array deque without duplicates.

    Definition Classes
    SeqOps
  55. def distinctBy[B](f: (A) => B): ArrayDeque[A]

    Selects all the elements of this array deque ignoring the duplicates as determined by == after applying the transforming function f.

    Selects all the elements of this array deque ignoring the duplicates as determined by == after applying the transforming function f.

    B

    the type of the elements after being transformed by f

    f

    The transforming function whose result is used to determine the uniqueness of each element

    returns

    a new array deque consisting of all the elements of this array deque without duplicates.

    Definition Classes
    StrictOptimizedSeqOpsSeqOps
  56. def drop(n: Int): ArrayDeque[A]

    Selects all elements except the first n ones.

    Selects all elements except the first n ones.

    n

    the number of elements to drop from this array deque.

    returns

    a array deque consisting of all elements of this array deque except the first n ones, or else the empty array deque, if this array deque has less than n elements. If n is negative, don't drop any elements.

    Definition Classes
    IndexedSeqOpsIterableOpsIterableOnceOps
  57. def dropInPlace(n: Int): ArrayDeque.this.type

    Removes the first n elements from this array deque.

    Removes the first n elements from this array deque.

    n

    the number of elements to remove

    returns

    this array deque

    Definition Classes
    Buffer
  58. def dropRight(n: Int): ArrayDeque[A]

    The rest of the collection without its n last elements.

    The rest of the collection without its n last elements. For linear, immutable collections this should avoid making a copy.

    Note: Even when applied to a view or a lazy collection it will always force the elements.

    n

    the number of elements to drop from this array deque.

    returns

    a array deque consisting of all elements of this array deque except the last n ones, or else the empty array deque, if this array deque has less than n elements. If n is negative, don't drop any elements.

    Definition Classes
    StrictOptimizedIterableOpsIterableOps
  59. def dropRightInPlace(n: Int): ArrayDeque.this.type

    Removes the last n elements from this array deque.

    Removes the last n elements from this array deque.

    n

    the number of elements to remove

    returns

    this array deque

    Definition Classes
    Buffer
  60. def dropWhile(p: (A) => Boolean): ArrayDeque[A]

    Selects all elements except the longest prefix that satisfies a predicate.

    Selects all elements except the longest prefix that satisfies a predicate.

    The matching prefix starts with the first element of this array deque, and the element following the prefix is the first element that does not satisfy the predicate. The matching prefix may be empty, so that this method returns the entire array deque.

    Example:

    scala> List(1, 2, 3, 100, 4).dropWhile(n => n < 10)
    val res0: List[Int] = List(100, 4)
    
    scala> List(1, 2, 3, 100, 4).dropWhile(n => n == 0)
    val res1: List[Int] = List(1, 2, 3, 100, 4)

    Use span to obtain both the prefix and suffix. Use filterNot to drop all elements that satisfy the predicate.

    p

    The predicate used to test elements.

    returns

    the longest suffix of this array deque whose first element does not satisfy the predicate p.

    Definition Classes
    IterableOpsIterableOnceOps
  61. def dropWhileInPlace(p: (A) => Boolean): ArrayDeque.this.type

    Drops the longest prefix of elements that satisfy a predicate.

    Drops the longest prefix of elements that satisfy a predicate.

    p

    The predicate used to test elements.

    returns

    this array deque

    Definition Classes
    Buffer
    See also

    dropWhile

  62. def elementWise: ElementWiseExtractor[Int, A]

    Returns an extractor object with a unapplySeq method, which extracts each element of a sequence data.

    Returns an extractor object with a unapplySeq method, which extracts each element of a sequence data.

    Definition Classes
    PartialFunction
    Example:
    1. val firstChar: String => Option[Char] = _.headOption
      
      Seq("foo", "bar", "baz") match {
        case firstChar.unlift.elementWise(c0, c1, c2) =>
          println(s"$c0, $c1, $c2") // Output: f, b, b
      }
  63. def empty: ArrayDeque[A]

    The empty iterable of the same type as this iterable.

    The empty iterable of the same type as this iterable.

    returns

    an empty iterable of type C.

    Definition Classes
    IterableFactoryDefaultsIterableOps
  64. def endsWith[B >: A](that: collection.Iterable[B]): Boolean

    Tests whether this array deque ends with the given sequence.

    Tests whether this array deque ends with the given sequence.

    that

    the sequence to test

    returns

    true if this array deque has that as a suffix, false otherwise.

    Definition Classes
    SeqOps
  65. def ensureSize(hint: Int): Unit
    Annotations
    @inline()
  66. def ensuring(cond: (ArrayDeque[A]) => Boolean, msg: => Any): ArrayDeque[A]
    Implicit
    This member is added by an implicit conversion from ArrayDeque[A] toEnsuring[ArrayDeque[A]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  67. def ensuring(cond: (ArrayDeque[A]) => Boolean): ArrayDeque[A]
    Implicit
    This member is added by an implicit conversion from ArrayDeque[A] toEnsuring[ArrayDeque[A]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  68. def ensuring(cond: Boolean, msg: => Any): ArrayDeque[A]
    Implicit
    This member is added by an implicit conversion from ArrayDeque[A] toEnsuring[ArrayDeque[A]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  69. def ensuring(cond: Boolean): ArrayDeque[A]
    Implicit
    This member is added by an implicit conversion from ArrayDeque[A] toEnsuring[ArrayDeque[A]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  70. final def eq(arg0: AnyRef): Boolean

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

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

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

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

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

    returns

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

    Definition Classes
    AnyRef
  71. def equals(o: Any): Boolean

    Checks whether this instance is equal to that.

    Checks whether this instance is equal to that. This universal equality method is defined in AnyRef.

    Definition Classes
    SeqEquals → AnyRef → Any
  72. def exists(p: (A) => Boolean): Boolean

    Tests whether a predicate holds for at least one element of this array deque.

    Tests whether a predicate holds for at least one element of this array deque.

    p

    the predicate used to test elements.

    returns

    true if the given predicate p is satisfied by at least one element of this array deque, otherwise false

    Definition Classes
    IterableOnceOps
  73. def filter(pred: (A) => Boolean): ArrayDeque[A]

    Selects all elements of this array deque which satisfy a predicate.

    Selects all elements of this array deque which satisfy a predicate.

    returns

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

    Definition Classes
    StrictOptimizedIterableOpsIterableOpsIterableOnceOps
  74. def filterImpl(pred: (A) => Boolean, isFlipped: Boolean): ArrayDeque[A]
    Attributes
    protected[collection]
    Definition Classes
    StrictOptimizedIterableOps
  75. def filterInPlace(p: (A) => Boolean): ArrayDeque.this.type

    Replace the contents of this array deque with the filtered result.

    Replace the contents of this array deque with the filtered result.

    returns

    this array deque

    Definition Classes
    IndexedBuffer
  76. def filterNot(pred: (A) => Boolean): ArrayDeque[A]

    Selects all elements of this array deque which do not satisfy a predicate.

    Selects all elements of this array deque which do not satisfy a predicate.

    pred

    the predicate used to test elements.

    returns

    a new array deque consisting of all elements of this array deque that do not satisfy the given predicate pred. Their order may not be preserved.

    Definition Classes
    StrictOptimizedIterableOpsIterableOpsIterableOnceOps
  77. 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(classOf[java.lang.Throwable])
    Note

    not specified by SLS as a member of AnyRef

  78. def find(p: (A) => Boolean): Option[A]

    Finds the first element of the array deque satisfying a predicate, if any.

    Finds the first element of the array deque satisfying a predicate, if any.

    p

    the predicate used to test elements.

    returns

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

    Definition Classes
    IterableOnceOps
  79. def findLast(p: (A) => Boolean): Option[A]

    Finds the last element of the array deque satisfying a predicate, if any.

    Finds the last element of the array deque satisfying a predicate, if any.

    p

    the predicate used to test elements.

    returns

    an option value containing the last element in the array deque that satisfies p, or None if none exists.

    Definition Classes
    SeqOps
  80. def flatMap[B](f: (A) => IterableOnce[B]): ArrayDeque[B]

    Builds a new array deque by applying a function to all elements of this array deque and using the elements of the resulting collections.

    Builds a new array deque by applying a function to all elements of this array deque and using the elements of the resulting collections.

    For example:

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

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

    // lettersOf will return a Seq[Char] of likely repeated letters, instead of a Set
    def lettersOf(words: Seq[String]) = words flatMap (word => word.toSet)
    
    // lettersOf will return a Set[Char], not a Seq
    def lettersOf(words: Seq[String]) = words.toSet flatMap ((word: String) => word.toSeq)
    
    // xs will be an Iterable[Int]
    val xs = Map("a" -> List(11,111), "b" -> List(22,222)).flatMap(_._2)
    
    // ys will be a Map[Int, Int]
    val ys = Map("a" -> List(1 -> 11,1 -> 111), "b" -> List(2 -> 22,2 -> 222)).flatMap(_._2)
    B

    the element type of the returned collection.

    f

    the function to apply to each element.

    returns

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

    Definition Classes
    StrictOptimizedIterableOpsIterableOpsIterableOnceOps
  81. def flatMapInPlace(f: (A) => IterableOnce[A]): ArrayDeque.this.type

    Replace the contents of this array deque with the flatmapped result.

    Replace the contents of this array deque with the flatmapped result.

    f

    the mapping function

    returns

    this array deque

    Definition Classes
    IndexedBuffer
  82. def flatten[B](implicit toIterableOnce: (A) => IterableOnce[B]): ArrayDeque[B]

    Converts this array deque of iterable collections into a array deque formed by the elements of these iterable collections.

    Converts this array deque of iterable collections into a array deque formed by the elements of these iterable collections.

    The resulting collection's type will be guided by the type of array deque. For example:

    val xs = List(
               Set(1, 2, 3),
               Set(1, 2, 3)
             ).flatten
    // xs == List(1, 2, 3, 1, 2, 3)
    
    val ys = Set(
               List(1, 2, 3),
               List(3, 2, 1)
             ).flatten
    // ys == Set(1, 2, 3)
    B

    the type of the elements of each iterable collection.

    returns

    a new array deque resulting from concatenating all element array deques.

    Definition Classes
    StrictOptimizedIterableOpsIterableOpsIterableOnceOps
  83. def fold[A1 >: A](z: A1)(op: (A1, A1) => A1): A1

    Applies the given binary operator op to the given initial value z and all elements of this array deque.

    Applies the given binary operator op to the given initial value z and all elements of this array deque.

    For each application of the operator, each operand is either an element of this array deque, the initial value, or another such application of the operator.

    The order of applications of the operator is unspecified and may be nondeterministic. Each element appears exactly once in the computation. The initial value may be used an arbitrary number of times, but at least once.

    If this collection is ordered, then for any application of the operator, the element(s) appearing in the left operand will precede those in the right.

    Note: might return different results for different runs, unless either of the following conditions is met: (1) the operator is associative, and the underlying collection type is ordered; or (2) the operator is associative and commutative. In either case, it is also necessary that the initial value be a neutral value for the operator, e.g. Nil for List concatenation or 1 for multiplication.

    The default implementation in IterableOnce is equivalent to foldLeft but may be overridden for more efficient traversal orders.

    A1

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

    z

    An initial value; may be used an arbitrary number of times in the computation of the result; must be a neutral value for op for the result to always be the same across runs.

    op

    A binary operator; must be associative for the result to always be the same across runs.

    returns

    The result of applying op between all the elements and z, or z if this array deque is empty.

    Definition Classes
    IterableOnceOps
  84. def foldLeft[B](z: B)(op: (B, A) => B): B

    Applies the given binary operator op to the given initial value z and all elements of this array deque, going left to right.

    Applies the given binary operator op to the given initial value z and all elements of this array deque, going left to right. Returns the initial value if this array deque is empty.

    "Going left to right" only makes sense if this collection is ordered: then if x1, x2, ..., xn are the elements of this array deque, the result is op( op( ... op( op(z, x1), x2) ... ), xn).

    If this collection is not ordered, then for each application of the operator, each right operand is an element. In addition, the leftmost operand is the initial value, and each other left operand is itself an application of the operator. The elements of this array deque and the initial value all appear exactly once in the computation.

    B

    The result type of the binary operator.

    z

    An initial value.

    op

    A binary operator.

    returns

    The result of applying op to z and all elements of this array deque, going left to right. Returns z if this array deque is empty.

    Definition Classes
    IterableOnceOps
  85. def foldRight[B](z: B)(op: (A, B) => B): B

    Applies the given binary operator op to all elements of this array deque and the given initial value z, going right to left.

    Applies the given binary operator op to all elements of this array deque and the given initial value z, going right to left. Returns the initial value if this array deque is empty.

    "Going right to left" only makes sense if this collection is ordered: then if x1, x2, ..., xn are the elements of this array deque, the result is op(x1, op(x2, op( ... op(xn, z) ... ))).

    If this collection is not ordered, then for each application of the operator, each left operand is an element. In addition, the rightmost operand is the initial value, and each other right operand is itself an application of the operator. The elements of this array deque and the initial value all appear exactly once in the computation.

    B

    The result type of the binary operator.

    z

    An initial value.

    op

    A binary operator.

    returns

    The result of applying op to all elements of this array deque and z, going right to left. Returns z if this array deque is empty.

    Definition Classes
    IndexedSeqOpsIterableOnceOps
  86. def forall(p: (A) => Boolean): Boolean

    Tests whether a predicate holds for all elements of this array deque.

    Tests whether a predicate holds for all elements of this array deque.

    p

    the predicate used to test elements.

    returns

    true if this array deque is empty or the given predicate p holds for all elements of this array deque, otherwise false.

    Definition Classes
    IterableOnceOps
  87. def foreach[U](f: (A) => U): Unit

    Applies f to each element for its side effects.

    Applies f to each element for its side effects. Note: U parameter needed to help scalac's type inference.

    Definition Classes
    IterableOnceOps
  88. def fromSpecific(coll: IterableOnce[A]): ArrayDeque[A]

    Defines how to turn a given Iterable[A] into a collection of type C.

    Defines how to turn a given Iterable[A] into a collection of type C.

    This process can be done in a strict way or a non-strict way (ie. without evaluating the elements of the resulting collections). In other words, this methods defines the evaluation model of the collection.

    Attributes
    protected
    Definition Classes
    IterableFactoryDefaultsIterableOps
    Note

    When implementing a custom collection type and refining C to the new type, this method needs to be overridden (the compiler will issue an error otherwise). In the common case where C =:= CC[A], this can be done by mixing in the scala.collection.IterableFactoryDefaults trait, which implements the method using iterableFactory.

    ,

    As witnessed by the @uncheckedVariance annotation, using this method might be unsound. However, as long as it is called with an Iterable[A] obtained from this collection (as it is the case in the implementations of operations where we use a View[A]), it is safe.

  89. final def getClass(): Class[_ <: AnyRef]

    Returns the runtime class representation of the object.

    Returns the runtime class representation of the object.

    returns

    a class object corresponding to the runtime type of the receiver.

    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  90. def groupBy[K](f: (A) => K): immutable.Map[K, ArrayDeque[A]]

    Partitions this array deque into a map of array deques according to some discriminator function.

    Partitions this array deque into a map of array deques according to some discriminator function.

    Note: Even when applied to a view or a lazy collection it will always force the elements.

    K

    the type of keys returned by the discriminator function.

    f

    the discriminator function.

    returns

    A map from keys to array deques such that the following invariant holds:

    (xs groupBy f)(k) = xs filter (x => f(x) == k)

    That is, every key k is bound to a array deque of those elements x for which f(x) equals k.

    Definition Classes
    IterableOps
  91. def groupMap[K, B](key: (A) => K)(f: (A) => B): immutable.Map[K, ArrayDeque[B]]

    Partitions this array deque into a map of array deques according to a discriminator function key.

    Partitions this array deque into a map of array deques according to a discriminator function key. Each element in a group is transformed into a value of type B using the value function.

    It is equivalent to groupBy(key).mapValues(_.map(f)), but more efficient.

    case class User(name: String, age: Int)
    
    def namesByAge(users: Seq[User]): Map[Int, Seq[String]] =
      users.groupMap(_.age)(_.name)

    Note: Even when applied to a view or a lazy collection it will always force the elements.

    K

    the type of keys returned by the discriminator function

    B

    the type of values returned by the transformation function

    key

    the discriminator function

    f

    the element transformation function

    Definition Classes
    IterableOps
  92. def groupMapReduce[K, B](key: (A) => K)(f: (A) => B)(reduce: (B, B) => B): immutable.Map[K, B]

    Partitions this array deque into a map according to a discriminator function key.

    Partitions this array deque into a map according to a discriminator function key. All the values that have the same discriminator are then transformed by the f function and then reduced into a single value with the reduce function.

    It is equivalent to groupBy(key).mapValues(_.map(f).reduce(reduce)), but more efficient.

    def occurrences[A](as: Seq[A]): Map[A, Int] =
      as.groupMapReduce(identity)(_ => 1)(_ + _)

    Note: Even when applied to a view or a lazy collection it will always force the elements.

    Definition Classes
    IterableOps
  93. def grouped(n: Int): Iterator[ArrayDeque[A]]

    Partitions elements in fixed size array deques.

    Partitions elements in fixed size array deques.

    returns

    An iterator producing array deques of size size, except the last will be less than size size if the elements don't divide evenly.

    Definition Classes
    ArrayDequeOpsIterableOps
    See also

    scala.collection.Iterator, method grouped

  94. def hashCode(): Int

    The hashCode method for reference types.

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

    returns

    the hash code value for this object.

    Definition Classes
    Seq → AnyRef → Any
  95. def head: A

    Selects the first element of this array deque.

    Selects the first element of this array deque.

    returns

    the first element of this array deque.

    Definition Classes
    IndexedSeqOpsIterableOps
    Exceptions thrown

    NoSuchElementException if the array deque is empty.

  96. def headOption: Option[A]

    Optionally selects the first element.

    Optionally selects the first element.

    returns

    the first element of this array deque if it is nonempty, None if it is empty.

    Definition Classes
    IndexedSeqOpsIterableOps
  97. def indexOf[B >: A](elem: B): Int

    Finds index of first occurrence of some value in this array deque.

    Finds index of first occurrence of some value in this array deque.

    B

    the type of the element elem.

    elem

    the element value to search for.

    returns

    the index >= 0 of the first element of this array deque that is equal (as determined by ==) to elem, or -1, if none exists.

    Definition Classes
    SeqOps
    Annotations
    @deprecatedOverriding()
  98. def indexOf[B >: A](elem: B, from: Int): Int

    Finds index of first occurrence of some value in this array deque after or at some start index.

    Finds index of first occurrence of some value in this array deque 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 array deque that is equal (as determined by ==) to elem, or -1, if none exists.

    Definition Classes
    SeqOps
  99. def indexOfSlice[B >: A](that: collection.Seq[B]): Int

    Finds first index where this array deque contains a given sequence as a slice.

    Finds first index where this array deque contains a given sequence as a slice.

    that

    the sequence to test

    returns

    the first index >= 0 such that the elements of this array deque starting at this index match the elements of sequence that, or -1 if no such subsequence exists.

    Definition Classes
    SeqOps
    Annotations
    @deprecatedOverriding()
  100. def indexOfSlice[B >: A](that: collection.Seq[B], from: Int): Int

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

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

    Definition Classes
    SeqOps
  101. def indexWhere(p: (A) => Boolean): Int

    Finds index of the first element satisfying some predicate.

    Finds index of the first element satisfying some predicate.

    p

    the predicate used to test elements.

    returns

    the index >= 0 of the first element of this array deque that satisfies the predicate p, or -1, if none exists.

    Definition Classes
    SeqOps
    Annotations
    @deprecatedOverriding()
  102. 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 array deque that satisfies the predicate p, or -1, if none exists.

    Definition Classes
    SeqOps
  103. def indices: immutable.Range

    Produces the range of all indices of this sequence.

    Produces the range of all indices of this sequence.

    Note: Even when applied to a view or a lazy collection it will always force the elements.

    returns

    a Range value from 0 to one less than the length of this array deque.

    Definition Classes
    SeqOps
  104. def init: ArrayDeque[A]

    The initial part of the collection without its last element.

    The initial part of the collection without its last element.

    Note: Even when applied to a view or a lazy collection it will always force the elements.

    Definition Classes
    IterableOps
  105. def inits: Iterator[ArrayDeque[A]]

    Iterates over the inits of this array deque.

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

    Note: Even when applied to a view or a lazy collection it will always force the elements.

    returns

    an iterator over all the inits of this array deque

    Definition Classes
    IterableOps
    Example:
    1. List(1,2,3).inits = Iterator(List(1,2,3), List(1,2), List(1), Nil)

  106. def insert(idx: Int, elem: A): Unit

    Inserts a new element at a given index into this buffer.

    Inserts a new element at a given index into this buffer.

    idx

    the index where the new elements is inserted.

    elem

    the element to insert.

    Definition Classes
    ArrayDequeBuffer
    Exceptions thrown

    IndexOutOfBoundsException if the index idx is not in the valid range 0 <= idx <= length.

  107. def insertAll(idx: Int, elems: IterableOnce[A]): Unit

    Inserts new elements at the index idx.

    Inserts new elements at the index idx. Opposed to method update, this method will not replace an element with a new one. Instead, it will insert a new element at index idx.

    idx

    the index where a new element will be inserted.

    elems

    the iterable object providing all elements to insert.

    Definition Classes
    ArrayDequeBuffer
    Exceptions thrown

    IndexOutOfBoundsException if idx is out of bounds.

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

    Computes the multiset intersection between this array deque and another sequence.

    Computes the multiset intersection between this array deque and another sequence.

    that

    the sequence of elements to intersect with.

    returns

    a new array deque which contains all elements of this array deque 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
    StrictOptimizedSeqOpsSeqOps
  109. def isDefinedAt(idx: Int): Boolean

    Tests whether this array deque contains given index.

    Tests whether this array deque contains given index.

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

    idx

    the index to test

    returns

    true if this array deque contains an element at position idx, false otherwise.

    Definition Classes
    SeqOps
  110. def isEmpty: Boolean

    Tests whether the array deque is empty.

    Tests whether the array deque is empty.

    Note: The default implementation creates and discards an iterator.

    Note: Implementations in subclasses that are not repeatedly iterable must take care not to consume any elements when isEmpty is called.

    returns

    true if the array deque contains no elements, false otherwise.

    Definition Classes
    ArrayDequeSeqOpsIterableOnceOps
  111. final def isInstanceOf[T0]: Boolean

    Test whether the dynamic type of the receiver object has the same erasure as T0.

    Test whether the dynamic type of the receiver object has the same erasure as T0.

    Depending on what T0 is, the test is done in one of the below ways:

    • T0 is a non-parameterized class type, e.g. BigDecimal: this method returns true if the value of the receiver object is a BigDecimal or a subtype of BigDecimal.
    • T0 is a parameterized class type, e.g. List[Int]: this method returns true if the value of the receiver object is some List[X] for any X. For example, List(1, 2, 3).isInstanceOf[List[String]] will return true.
    • T0 is some singleton type x.type or literal x: this method returns this.eq(x). For example, x.isInstanceOf[1] is equivalent to x.eq(1)
    • T0 is an intersection X with Y or X & Y: this method is equivalent to x.isInstanceOf[X] && x.isInstanceOf[Y]
    • T0 is a union X | Y: this method is equivalent to x.isInstanceOf[X] || x.isInstanceOf[Y]
    • T0 is a type parameter or an abstract type member: this method is equivalent to isInstanceOf[U] where U is T0's upper bound, Any if T0 is unbounded. For example, x.isInstanceOf[A] where A is an unbounded type parameter will return true for any value of x.

    This is exactly equivalent to the type pattern _: T0

    returns

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

    Definition Classes
    Any
    Note

    due to the unexpectedness of List(1, 2, 3).isInstanceOf[List[String]] returning true and x.isInstanceOf[A] where A is a type parameter or abstract member returning true, these forms issue a warning.

  112. def isTraversableAgain: Boolean

    Tests whether this array deque can be repeatedly traversed.

    Tests whether this array deque can be repeatedly traversed. Always true for Iterables and false for Iterators unless overridden.

    returns

    true if it is repeatedly traversable, false otherwise.

    Definition Classes
    IterableOpsIterableOnceOps
  113. def iterableFactory: SeqFactory[ArrayDeque]

    The companion object of this array deque, providing various factory methods.

    The companion object of this array deque, providing various factory methods.

    Definition Classes
    ArrayDequeIndexedBufferIndexedSeqIndexedSeqBufferSeqIterableSeqIterableIterableOps
    Note

    When implementing a custom collection type and refining CC to the new type, this method needs to be overridden to return a factory for the new type (the compiler will issue an error otherwise).

  114. def iterator: Iterator[A]

    An scala.collection.Iterator over the elements of this array deque.

    An scala.collection.Iterator over the elements of this array deque.

    If an IterableOnce object is in fact an scala.collection.Iterator, this method always returns itself, in its current state, but if it is an scala.collection.Iterable, this method always returns a new scala.collection.Iterator.

    Definition Classes
    IndexedSeqOpsIterableOnce
  115. def klone(): ArrayDeque[A]
    Attributes
    protected
    Definition Classes
    ArrayDequeArrayDequeOps
  116. def knownSize: Int

    The number of elements in this array deque, if it can be cheaply computed, -1 otherwise.

    The number of elements in this array deque, if it can be cheaply computed, -1 otherwise. Cheaply usually means: Not requiring a collection traversal.

    Definition Classes
    ArrayDequeIndexedSeqOpsBufferGrowableIterableOnce
  117. def last: A

    Selects the last element.

    Selects the last element.

    returns

    The last element of this array deque.

    Definition Classes
    IndexedSeqOpsIterableOps
    Exceptions thrown

    NoSuchElementException If the array deque is empty.

  118. def lastIndexOf[B >: A](elem: B, end: Int = length - 1): Int

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

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

    Definition Classes
    SeqOps
  119. def lastIndexOfSlice[B >: A](that: collection.Seq[B]): Int

    Finds last index where this array deque contains a given sequence as a slice.

    Finds last index where this array deque contains a given sequence as a slice.

    that

    the sequence to test

    returns

    the last index such that the elements of this array deque starting at this index match the elements of sequence that, or -1 if no such subsequence exists.

    Definition Classes
    SeqOps
    Annotations
    @deprecatedOverriding()
  120. def lastIndexOfSlice[B >: A](that: collection.Seq[B], end: Int): Int

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

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

    Definition Classes
    SeqOps
  121. 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 array deque that satisfies the predicate p, or -1, if none exists.

    Definition Classes
    SeqOps
    Annotations
    @deprecatedOverriding()
  122. 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 array deque that satisfies the predicate p, or -1, if none exists.

    Definition Classes
    SeqOps
  123. def lastOption: Option[A]

    Optionally selects the last element.

    Optionally selects the last element.

    returns

    the last element of this array deque$ if it is nonempty, None if it is empty.

    Definition Classes
    IterableOps
  124. def lazyZip[B](that: collection.Iterable[B]): LazyZip2[A, B, ArrayDeque.this.type]

    Analogous to zip except that the elements in each collection are not consumed until a strict operation is invoked on the returned LazyZip2 decorator.

    Analogous to zip except that the elements in each collection are not consumed until a strict operation is invoked on the returned LazyZip2 decorator.

    Calls to lazyZip can be chained to support higher arities (up to 4) without incurring the expense of constructing and deconstructing intermediary tuples.

    val xs = List(1, 2, 3)
    val res = (xs lazyZip xs lazyZip xs lazyZip xs).map((a, b, c, d) => a + b + c + d)
    // res == List(4, 8, 12)
    B

    the type of the second element in each eventual pair

    that

    the iterable providing the second element of each eventual pair

    returns

    a decorator LazyZip2 that allows strict operations to be performed on the lazily evaluated pairs or chained calls to lazyZip. Implicit conversion to Iterable[(A, B)] is also supported.

    Definition Classes
    Iterable
  125. def length: Int

    The length (number of elements) of the array deque.

    The length (number of elements) of the array deque. size is an alias for length in Seq collections.

    Definition Classes
    ArrayDequeSeqOps
  126. final def lengthCompare(that: collection.Iterable[_]): Int

    Compares the length of this array deque to the size of another Iterable.

    Compares the length of this array deque to the size of another Iterable.

    that

    the Iterable whose size is compared with this array deque's length.

    returns

    A value x where

    x <  0       if this.length <  that.size
    x == 0       if this.length == that.size
    x >  0       if this.length >  that.size

    The method as implemented here does not call length or size directly; its running time is O(this.length min that.size) instead of O(this.length + that.size). The method should be overridden if computing size is cheap and knownSize returns -1.

    Definition Classes
    IndexedSeqOpsSeqOps
  127. final def lengthCompare(len: Int): Int

    Compares the length of this array deque to a test value.

    Compares the length of this array deque 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 overridden if computing length is cheap and knownSize returns -1.

    Definition Classes
    IndexedSeqOpsSeqOps
    See also

    lengthIs

  128. final def lengthIs: SizeCompareOps

    Returns a value class containing operations for comparing the length of this array deque to a test value.

    Returns a value class containing operations for comparing the length of this array deque to a test value.

    These operations are implemented in terms of lengthCompare(Int), and allow the following more readable usages:

    this.lengthIs < len     // this.lengthCompare(len) < 0
    this.lengthIs <= len    // this.lengthCompare(len) <= 0
    this.lengthIs == len    // this.lengthCompare(len) == 0
    this.lengthIs != len    // this.lengthCompare(len) != 0
    this.lengthIs >= len    // this.lengthCompare(len) >= 0
    this.lengthIs > len     // this.lengthCompare(len) > 0
    Definition Classes
    SeqOps
    Annotations
    @inline()
  129. def lift: (Int) => Option[A]

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

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

    returns

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

    Definition Classes
    PartialFunction
    See also

    Function.unlift

  130. def map[B](f: (A) => B): ArrayDeque[B]

    Builds a new array deque by applying a function to all elements of this array deque.

    Builds a new array deque by applying a function to all elements of this array deque.

    B

    the element type of the returned array deque.

    f

    the function to apply to each element.

    returns

    a new array deque resulting from applying the given function f to each element of this array deque and collecting the results.

    Definition Classes
    StrictOptimizedIterableOpsIterableOpsIterableOnceOps
  131. def mapInPlace(f: (A) => A): ArrayDeque.this.type

    Modifies this array deque by applying a function to all elements of this array deque.

    Modifies this array deque by applying a function to all elements of this array deque.

    f

    the function to apply to each element.

    returns

    this array deque modified by replacing all elements with the result of applying the given function f to each element of this array deque.

    Definition Classes
    IndexedSeqOps
  132. def max[B >: A](implicit ord: math.Ordering[B]): A

    Finds the largest element.

    Finds the largest element.

    B

    The type over which the ordering is defined.

    ord

    An ordering to be used for comparing elements.

    returns

    the largest element of this array deque with respect to the ordering ord.

    Definition Classes
    IterableOnceOps
    Exceptions thrown

    UnsupportedOperationException if this array deque is empty.

  133. def maxBy[B](f: (A) => B)(implicit ord: math.Ordering[B]): A

    Finds the first element which yields the largest value measured by function f.

    Finds the first element which yields the largest value measured by function f.

    B

    The result type of the function f.

    f

    The measuring function.

    returns

    the first element of this array deque with the largest value measured by function f with respect to the ordering cmp.

    Definition Classes
    IterableOnceOps
    Exceptions thrown

    UnsupportedOperationException if this array deque is empty.

  134. def maxByOption[B](f: (A) => B)(implicit ord: math.Ordering[B]): Option[A]

    Finds the first element which yields the largest value measured by function f.

    Finds the first element which yields the largest value measured by function f.

    B

    The result type of the function f.

    f

    The measuring function.

    returns

    an option value containing the first element of this array deque with the largest value measured by function f with respect to the ordering cmp.

    Definition Classes
    IterableOnceOps
  135. def maxOption[B >: A](implicit ord: math.Ordering[B]): Option[A]

    Finds the largest element.

    Finds the largest element.

    B

    The type over which the ordering is defined.

    ord

    An ordering to be used for comparing elements.

    returns

    an option value containing the largest element of this array deque with respect to the ordering ord.

    Definition Classes
    IterableOnceOps
  136. def min[B >: A](implicit ord: math.Ordering[B]): A

    Finds the smallest element.

    Finds the smallest element.

    B

    The type over which the ordering is defined.

    ord

    An ordering to be used for comparing elements.

    returns

    the smallest element of this array deque with respect to the ordering ord.

    Definition Classes
    IterableOnceOps
    Exceptions thrown

    UnsupportedOperationException if this array deque is empty.

  137. def minBy[B](f: (A) => B)(implicit ord: math.Ordering[B]): A

    Finds the first element which yields the smallest value measured by function f.

    Finds the first element which yields the smallest value measured by function f.

    B

    The result type of the function f.

    f

    The measuring function.

    returns

    the first element of this array deque with the smallest value measured by function f with respect to the ordering cmp.

    Definition Classes
    IterableOnceOps
    Exceptions thrown

    UnsupportedOperationException if this array deque is empty.

  138. def minByOption[B](f: (A) => B)(implicit ord: math.Ordering[B]): Option[A]

    Finds the first element which yields the smallest value measured by function f.

    Finds the first element which yields the smallest value measured by function f.

    B

    The result type of the function f.

    f

    The measuring function.

    returns

    an option value containing the first element of this array deque with the smallest value measured by function f with respect to the ordering cmp.

    Definition Classes
    IterableOnceOps
  139. def minOption[B >: A](implicit ord: math.Ordering[B]): Option[A]

    Finds the smallest element.

    Finds the smallest element.

    B

    The type over which the ordering is defined.

    ord

    An ordering to be used for comparing elements.

    returns

    an option value containing the smallest element of this array deque with respect to the ordering ord.

    Definition Classes
    IterableOnceOps
  140. final def mkString: String

    Displays all elements of this array deque in a string.

    Displays all elements of this array deque in a string.

    Delegates to addString, which can be overridden.

    returns

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

    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  141. final def mkString(sep: String): String

    Displays all elements of this array deque in a string using a separator string.

    Displays all elements of this array deque in a string using a separator string.

    Delegates to addString, which can be overridden.

    sep

    the separator string.

    returns

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

    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
    Example:
    1. List(1, 2, 3).mkString("|") = "1|2|3"

  142. final def mkString(start: String, sep: String, end: String): String

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

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

    Delegates to addString, which can be overridden.

    start

    the starting string.

    sep

    the separator string.

    end

    the ending string.

    returns

    a string representation of this array deque. 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 array deque are separated by the string sep.

    Definition Classes
    IterableOnceOps
    Example:
    1. List(1, 2, 3).mkString("(", "; ", ")") = "(1; 2; 3)"

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

    Equivalent to !(this eq that).

    Equivalent to !(this eq that).

    returns

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

    Definition Classes
    AnyRef
  144. def newSpecificBuilder: Builder[A, ArrayDeque[A]]

    returns

    a strict builder for the same collection type. Note that in the case of lazy collections (e.g. scala.collection.View or scala.collection.immutable.LazyList), it is possible to implement this method but the resulting Builder will break laziness. As a consequence, operations should preferably be implemented with fromSpecific instead of this method.

    Attributes
    protected
    Definition Classes
    IterableFactoryDefaultsIterableOps
    Note

    When implementing a custom collection type and refining C to the new type, this method needs to be overridden (the compiler will issue an error otherwise). In the common case where C =:= CC[A], this can be done by mixing in the scala.collection.IterableFactoryDefaults trait, which implements the method using iterableFactory.

    ,

    As witnessed by the @uncheckedVariance annotation, using this method might be unsound. However, as long as the returned builder is only fed with A values taken from this instance, it is safe.

  145. def nonEmpty: Boolean

    Tests whether the array deque is not empty.

    Tests whether the array deque is not empty.

    returns

    true if the array deque contains at least one element, false otherwise.

    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  146. final def notify(): Unit

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

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

    Definition Classes
    AnyRef
    Annotations
    @native()
    Note

    not specified by SLS as a member of AnyRef

  147. final def notifyAll(): Unit

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

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

    Definition Classes
    AnyRef
    Annotations
    @native()
    Note

    not specified by SLS as a member of AnyRef

  148. def occCounts[B](sq: collection.Seq[B]): Map[B, Int]
    Attributes
    protected[collection]
    Definition Classes
    SeqOps
  149. def ofArray(array: Array[AnyRef], end: Int): ArrayDeque[A]
    Attributes
    protected
    Definition Classes
    ArrayDequeArrayDequeOps
  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[B >: A](len: Int, elem: B): ArrayDeque[B]

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

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

    B

    the element type of the returned array deque.

    len

    the target length

    elem

    the padding value

    returns

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

    Definition Classes
    StrictOptimizedSeqOpsSeqOps
  152. def padToInPlace(len: Int, elem: A): ArrayDeque.this.type

    Append the given element to this array deque until a target length is reached.

    Append the given element to this array deque until a target length is reached.

    len

    the target length

    elem

    the padding value

    returns

    this array deque

    Definition Classes
    Buffer
  153. def partition(p: (A) => Boolean): (ArrayDeque[A], ArrayDeque[A])

    A pair of, first, all elements that satisfy predicate p and, second, all elements that do not.

    A pair of, first, all elements that satisfy predicate p and, second, all elements that do not.

    The two array deque correspond to the result of filter and filterNot, respectively.

    The default implementation provided here needs to traverse the collection twice. Strict collections have an overridden version of partition in StrictOptimizedIterableOps, which requires only a single traversal.

    Definition Classes
    StrictOptimizedIterableOpsIterableOps
  154. def partitionMap[A1, A2](f: (A) => Either[A1, A2]): (ArrayDeque[A1], ArrayDeque[A2])

    Applies a function f to each element of the array deque and returns a pair of array deques: the first one made of those values returned by f that were wrapped in scala.util.Left, and the second one made of those wrapped in scala.util.Right.

    Applies a function f to each element of the array deque and returns a pair of array deques: the first one made of those values returned by f that were wrapped in scala.util.Left, and the second one made of those wrapped in scala.util.Right.

    Example:

    val xs = `mutable.ArrayDeque`(1, "one", 2, "two", 3, "three") partitionMap {
     case i: Int => Left(i)
     case s: String => Right(s)
    }
    // xs == (`mutable.ArrayDeque`(1, 2, 3),
    //        `mutable.ArrayDeque`(one, two, three))
    A1

    the element type of the first resulting collection

    A2

    the element type of the second resulting collection

    f

    the 'split function' mapping the elements of this array deque to an scala.util.Either

    returns

    a pair of array deques: the first one made of those values returned by f that were wrapped in scala.util.Left, and the second one made of those wrapped in scala.util.Right.

    Definition Classes
    StrictOptimizedIterableOpsIterableOps
  155. def patch[B >: A](from: Int, other: IterableOnce[B], replaced: Int): ArrayDeque[B]

    Produces a new array deque where a slice of elements in this array deque is replaced by another sequence.

    Produces a new array deque where a slice of elements in this array deque is replaced by another sequence.

    Patching at negative indices is the same as patching starting at 0. Patching at indices at or larger than the length of the original array deque appends the patch to the end. If the replaced count would exceed the available elements, the difference in excess is ignored.

    B

    the element type of the returned array deque.

    from

    the index of the first replaced element

    other

    the replacement sequence

    replaced

    the number of elements to drop in the original array deque

    returns

    a new array deque consisting of all elements of this array deque except that replaced elements starting from from are replaced by all the elements of other.

    Definition Classes
    SeqOps
  156. def patchInPlace(from: Int, patch: IterableOnce[A], replaced: Int): ArrayDeque.this.type

    Replaces a slice of elements in this array deque by another sequence of elements.

    Replaces a slice of elements in this array deque by another sequence of elements.

    Patching at negative indices is the same as patching starting at 0. Patching at indices at or larger than the length of the original array deque appends the patch to the end. If the replaced count would exceed the available elements, the difference in excess is ignored.

    from

    the index of the first replaced element

    patch

    the replacement sequence

    replaced

    the number of elements to drop in the original array deque

    returns

    this array deque

    Definition Classes
    IndexedBufferBuffer
  157. def permutations: Iterator[ArrayDeque[A]]

    Iterates over distinct permutations of elements.

    Iterates over distinct permutations of elements.

    Note: Even when applied to a view or a lazy collection it will always force the elements.

    returns

    An Iterator which traverses the distinct permutations of this array deque.

    Definition Classes
    SeqOps
    Example:
    1. Seq('a', 'b', 'b').permutations.foreach(println)
      // List(a, b, b)
      // List(b, a, b)
      // List(b, b, a)
  158. def prepend(elem: A): ArrayDeque.this.type

    Prepends a single element at the front of this array deque.

    Prepends a single element at the front of this array deque.

    elem

    the element to add.

    returns

    the array deque itself

    Definition Classes
    ArrayDequeBuffer
  159. def prependAll(elems: IterableOnce[A]): ArrayDeque.this.type

    Prepends the elements contained in a iterable object to this buffer.

    Prepends the elements contained in a iterable object to this buffer.

    elems

    the iterable object containing the elements to append.

    returns

    this array deque

    Definition Classes
    ArrayDequeBuffer
  160. def prepended[B >: A](elem: B): ArrayDeque[B]

    A copy of the array deque with an element prepended.

    A copy of the array deque with an element prepended.

    Also, the original array deque is not modified, so you will want to capture the result.

    Example:

    scala> val x = List(1)
    x: List[Int] = List(1)
    
    scala> val y = 2 +: x
    y: List[Int] = List(2, 1)
    
    scala> println(x)
    List(1)
    B

    the element type of the returned array deque.

    elem

    the prepended element

    returns

    a new array deque consisting of value followed by all elements of this array deque.

    Definition Classes
    StrictOptimizedSeqOpsSeqOps
  161. def prependedAll[B >: A](prefix: IterableOnce[B]): ArrayDeque[B]

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

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

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

    B

    the element type of the returned collection.

    prefix

    the iterable to prepend.

    returns

    a new array deque which contains all elements of prefix followed by all the elements of this array deque.

    Definition Classes
    StrictOptimizedSeqOpsSeqOps
  162. def product[B >: A](implicit num: math.Numeric[B]): B

    Multiplies together the elements of this collection.

    Multiplies together the elements of this collection.

    The default implementation uses reduce for a known non-empty collection, foldLeft otherwise.

    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 array deque with respect to the * operator in num.

    Definition Classes
    IterableOnceOps
  163. def reduce[B >: A](op: (B, B) => B): B

    Applies the given binary operator op to all elements of this array deque.

    Applies the given binary operator op to all elements of this array deque.

    For each application of the operator, each operand is either an element of this array deque or another such application of the operator. The order of applications of the operator is unspecified and may be nondeterministic. Each element appears exactly once in the computation.

    If this collection is ordered, then for any application of the operator, the element(s) appearing in the left operand will precede those in the right.

    Note: might return different results for different runs, unless either of the following conditions is met: (1) the operator is associative, and the underlying collection type is ordered; or (2) the operator is associative and commutative.

    B

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

    op

    A binary operator; must be associative for the result to always be the same across runs.

    returns

    The result of applying op between all the elements if the array deque is nonempty.

    Definition Classes
    IterableOnceOps
    Exceptions thrown

    UnsupportedOperationException if this array deque is empty.

  164. def reduceLeft[B >: A](op: (B, A) => B): B

    Applies the given binary operator op to all elements of this array deque, going left to right.

    Applies the given binary operator op to all elements of this array deque, going left to right.

    "Going left to right" only makes sense if this collection is ordered: then if x1, x2, ..., xn are the elements of this array deque, the result is op( op( op( ... op(x1, x2) ... ), xn-1), xn).

    If this collection is not ordered, then for each application of the operator, each right operand is an element. In addition, the leftmost operand is the first element of this array deque and each other left operand is itself an application of the operator. Each element appears exactly once in the computation.

    Note: might return different results for different runs, unless the underlying collection type is ordered or the operator is associative and commutative.

    B

    The result type of the binary operator, a supertype of A.

    op

    A binary operator.

    returns

    The result of applying op to all elements of this array deque, going left to right.

    Definition Classes
    IterableOnceOps
    Exceptions thrown

    UnsupportedOperationException if this array deque is empty.

  165. def reduceLeftOption[B >: A](op: (B, A) => B): Option[B]

    If this array deque is nonempty, reduces it with the given binary operator op, going left to right.

    If this array deque is nonempty, reduces it with the given binary operator op, going left to right.

    The behavior is the same as reduceLeft except that the value is None if the array deque is empty. Each element appears exactly once in the computation.

    Note: might return different results for different runs, unless the underlying collection type is ordered or the operator is associative and commutative.

    B

    The result type of the binary operator, a supertype of A.

    op

    A binary operator.

    returns

    The result of reducing this array deque with op going left to right if the array deque is nonempty, inside a Some, and None otherwise.

    Definition Classes
    IterableOnceOps
  166. def reduceOption[B >: A](op: (B, B) => B): Option[B]

    If this array deque is nonempty, reduces it with the given binary operator op.

    If this array deque is nonempty, reduces it with the given binary operator op.

    The behavior is the same as reduce except that the value is None if the array deque is empty. The order of applications of the operator is unspecified and may be nondeterministic. Each element appears exactly once in the computation.

    Note: might return different results for different runs, unless either of the following conditions is met: (1) the operator is associative, and the underlying collection type is ordered; or (2) the operator is associative and commutative.

    B

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

    op

    A binary operator; must be associative for the result to always be the same across runs.

    returns

    The result of reducing this array deque with op if the array deque is nonempty, inside a Some, and None otherwise.

    Definition Classes
    IterableOnceOps
  167. def reduceRight[B >: A](op: (A, B) => B): B

    Applies the given binary operator op to all elements of this array deque, going right to left.

    Applies the given binary operator op to all elements of this array deque, going right to left.

    "Going right to left" only makes sense if this collection is ordered: then if x1, x2, ..., xn are the elements of this array deque, the result is op(x1, op(x2, op( ... op(xn-1, xn) ... ))).

    If this collection is not ordered, then for each application of the operator, each left operand is an element. In addition, the rightmost operand is the last element of this array deque and each other right operand is itself an application of the operator. Each element appears exactly once in the computation.

    Note: might return different results for different runs, unless the underlying collection type is ordered or the operator is associative and commutative.

    B

    The result type of the binary operator, a supertype of A.

    op

    A binary operator.

    returns

    The result of applying op to all elements of this array deque, going right to left.

    Definition Classes
    IterableOnceOps
    Exceptions thrown

    UnsupportedOperationException if this array deque is empty.

  168. def reduceRightOption[B >: A](op: (A, B) => B): Option[B]

    If this array deque is nonempty, reduces it with the given binary operator op, going right to left.

    If this array deque is nonempty, reduces it with the given binary operator op, going right to left.

    The behavior is the same as reduceRight except that the value is None if the array deque is empty. Each element appears exactly once in the computation.

    Note: might return different results for different runs, unless the underlying collection type is ordered or the operator is associative and commutative.

    B

    The result type of the binary operator, a supertype of A.

    op

    A binary operator.

    returns

    The result of reducing this array deque with op going right to left if the array deque is nonempty, inside a Some, and None otherwise.

    Definition Classes
    IterableOnceOps
  169. def remove(idx: Int): A

    Removes the element at a given index position.

    Removes the element at a given index position.

    idx

    the index which refers to the element to delete.

    returns

    the element that was formerly at index idx.

    Definition Classes
    ArrayDequeBuffer
  170. def remove(idx: Int, count: Int): Unit

    Removes the element on a given index position.

    Removes the element on a given index position. It takes time linear in the buffer size.

    idx

    the index which refers to the first element to remove.

    count

    the number of elements to remove.

    Definition Classes
    ArrayDequeBuffer
    Exceptions thrown

    IllegalArgumentException if count < 0.

    IndexOutOfBoundsException if the index idx is not in the valid range 0 <= idx <= length - count (with count > 0).

  171. def removeAll(p: (A) => Boolean): immutable.Seq[A]

    Returns all elements in this collection which satisfy the given predicate and removes those elements from this collections.

    Returns all elements in this collection which satisfy the given predicate and removes those elements from this collections.

    p

    the predicate used for choosing elements

    returns

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

  172. def removeAll(): immutable.Seq[A]

    Remove all elements from this collection and return the elements while emptying this data structure

  173. def removeAllReverse(): immutable.Seq[A]

    Remove all elements from this collection and return the elements in reverse while emptying this data structure

  174. def removeFirst(p: (A) => Boolean, from: Int = 0): Option[A]

    Returns the first element which satisfies the given predicate after or at some start index and removes this element from the collections

    Returns the first element which satisfies the given predicate after or at some start index and removes this element from the collections

    p

    the predicate used for choosing the first element

    from

    the start index

    returns

    the first element of the queue for which p yields true

  175. def removeHead(resizeInternalRepr: Boolean = false): A

    Unsafely remove the first element (throws exception when empty) See also removeHeadOption()

    Unsafely remove the first element (throws exception when empty) See also removeHeadOption()

    resizeInternalRepr

    If this is set, resize the internal representation to reclaim space once in a while

    Exceptions thrown

    NoSuchElementException when empty

  176. def removeHeadOption(resizeInternalRepr: Boolean = false): Option[A]

    resizeInternalRepr

    If this is set, resize the internal representation to reclaim space once in a while

  177. def removeHeadWhile(f: (A) => Boolean): immutable.Seq[A]

    Returns and removes all elements from the left of this queue which satisfy the given predicate

    Returns and removes all elements from the left of this queue which satisfy the given predicate

    f

    the predicate used for choosing elements

  178. def removeLast(resizeInternalRepr: Boolean = false): A

    Unsafely remove the last element (throws exception when empty) See also removeLastOption()

    Unsafely remove the last element (throws exception when empty) See also removeLastOption()

    resizeInternalRepr

    If this is set, resize the internal representation to reclaim space once in a while

    Exceptions thrown

    NoSuchElementException when empty

  179. def removeLastOption(resizeInternalRepr: Boolean = false): Option[A]

    resizeInternalRepr

    If this is set, resize the internal representation to reclaim space once in a while

  180. def removeLastWhile(f: (A) => Boolean): immutable.Seq[A]

    Returns and removes all elements from the right of this queue which satisfy the given predicate

    Returns and removes all elements from the right of this queue which satisfy the given predicate

    f

    the predicate used for choosing elements

  181. final def requireBounds(idx: Int, until: Int = length): Unit
    Attributes
    protected
    Definition Classes
    ArrayDequeOps
    Annotations
    @inline()
  182. def reverse: ArrayDeque[A]

    Returns a new array deque with the elements of this array deque in reverse order.

    Returns a new array deque with the elements of this array deque in reverse order.

    Note: Even when applied to a view or a lazy collection it will always force the elements.

    returns

    a new array deque with all elements of this array deque in reverse order.

    Definition Classes
    ArrayDequeOpsSeqOps
  183. def reverseIterator: Iterator[A]

    An iterator yielding the elements of this array deque in reverse order.

    An iterator yielding the elements of this array deque in reverse order.

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

    returns

    an iterator yielding the elements of this array deque in reverse order.

    Definition Classes
    IndexedSeqOpsSeqOps
  184. def reversed: collection.Iterable[A]
    Attributes
    protected
    Definition Classes
    IndexedSeqOpsIterableOnceOps
  185. def runWith[U](action: (A) => U): (Int) => Boolean

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

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

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

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

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

    action

    the action function

    returns

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

    Definition Classes
    PartialFunction
    See also

    applyOrElse.

  186. def sameElements[B >: A](that: IterableOnce[B]): Boolean

    Tests whether the elements of this collection are the same (and in the same order) as those of that.

    Tests whether the elements of this collection are the same (and in the same order) as those of that.

    Definition Classes
    SeqOps
  187. def scan[B >: A](z: B)(op: (B, B) => B): ArrayDeque[B]

    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

    z

    neutral element for the operator op

    op

    the associative operator for the scan

    returns

    a new array deque containing the prefix scan of the elements in this array deque

    Definition Classes
    IterableOps
  188. def scanLeft[B](z: B)(op: (B, A) => B): ArrayDeque[B]

    Produces a array deque containing cumulative results of applying the operator going left to right, including the initial value.

    Produces a array deque containing cumulative results of applying the operator going left to right, including the initial value.

    B

    the type of the elements in the resulting collection

    z

    the initial value

    op

    the binary operator applied to the intermediate result and the element

    returns

    collection with intermediate results

    Definition Classes
    StrictOptimizedIterableOpsIterableOpsIterableOnceOps
  189. def scanRight[B](z: B)(op: (A, B) => B): ArrayDeque[B]

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

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

    Note: Even when applied to a view or a lazy collection it will always force the elements.

    Example:

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

    the type of the elements in the resulting collection

    z

    the initial value

    op

    the binary operator applied to the intermediate result and the element

    returns

    collection with intermediate results

    Definition Classes
    IterableOps
  190. def search[B >: A](elem: B, from: Int, to: Int)(implicit ord: math.Ordering[B]): SearchResult

    Searches within an interval in this sorted sequence for a specific element.

    Searches within an interval in this sorted sequence for a specific element. If this sequence is an IndexedSeq, a binary search is used. Otherwise, a linear search is used.

    The sequence should be sorted with the same Ordering before calling; otherwise, the results are undefined.

    elem

    the element to find.

    from

    the index where the search starts.

    to

    the index following where the search ends.

    ord

    the ordering to be used to compare elements.

    returns

    a Found value containing the index corresponding to the element in the sequence, or the InsertionPoint where the element would be inserted if the element is not in the sequence.

    Definition Classes
    IndexedSeqOpsSeqOps
    Note

    if to <= from, the search space is empty, and an InsertionPoint at from is returned

    See also

    scala.collection.IndexedSeq

    scala.math.Ordering

    scala.collection.SeqOps, method sorted

  191. def search[B >: A](elem: B)(implicit ord: math.Ordering[B]): SearchResult

    Searches this sorted sequence for a specific element.

    Searches this sorted sequence for a specific element. If the sequence is an IndexedSeq, a binary search is used. Otherwise, a linear search is used.

    The sequence should be sorted with the same Ordering before calling; otherwise, the results are undefined.

    elem

    the element to find.

    ord

    the ordering to be used to compare elements.

    returns

    a Found value containing the index corresponding to the element in the sequence, or the InsertionPoint where the element would be inserted if the element is not in the sequence.

    Definition Classes
    IndexedSeqOpsSeqOps
    See also

    scala.collection.IndexedSeq

    scala.math.Ordering

    scala.collection.SeqOps, method sorted

  192. def segmentLength(p: (A) => Boolean, from: Int): Int

    Computes the length of the longest segment that starts from some index and whose elements all satisfy some predicate.

    Computes the length of the longest segment that starts from some index and 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 array deque starting from index from such that every element of the segment satisfies the predicate p.

    Definition Classes
    SeqOps
  193. final def segmentLength(p: (A) => Boolean): Int

    Computes the length of the longest segment that starts from the first element and whose elements all satisfy some predicate.

    Computes the length of the longest segment that starts from the first element and whose elements all satisfy some predicate.

    p

    the predicate used to test elements.

    returns

    the length of the longest segment of this array deque that starts from the first element such that every element of the segment satisfies the predicate p.

    Definition Classes
    SeqOps
  194. final def size: Int

    The size of this array deque.

    The size of this array deque.

    returns

    the number of elements in this array deque.

    Definition Classes
    SeqOpsIterableOnceOps
  195. final def sizeCompare(that: collection.Iterable[_]): Int

    Compares the size of this array deque to the size of another Iterable.

    Compares the size of this array deque to the size of another Iterable.

    that

    the Iterable whose size is compared with this array deque's size.

    returns

    A value x where

    x <  0       if this.size <  that.size
    x == 0       if this.size == that.size
    x >  0       if this.size >  that.size

    The method as implemented here does not call size directly; its running time is O(this.size min that.size) instead of O(this.size + that.size). The method should be overridden if computing size is cheap and knownSize returns -1.

    Definition Classes
    SeqOpsIterableOps
  196. final def sizeCompare(otherSize: Int): Int

    Compares the size of this array deque to a test value.

    Compares the size of this array deque to a test value.

    otherSize

    the test value that gets compared with the size.

    returns

    A value x where

    x <  0       if this.size <  otherSize
    x == 0       if this.size == otherSize
    x >  0       if this.size >  otherSize

    The method as implemented here does not call size directly; its running time is O(size min otherSize) instead of O(size). The method should be overridden if computing size is cheap and knownSize returns -1.

    Definition Classes
    SeqOpsIterableOps
    See also

    sizeIs

  197. final def sizeIs: SizeCompareOps

    Returns a value class containing operations for comparing the size of this array deque to a test value.

    Returns a value class containing operations for comparing the size of this array deque to a test value.

    These operations are implemented in terms of sizeCompare(Int), and allow the following more readable usages:

    this.sizeIs < size     // this.sizeCompare(size) < 0
    this.sizeIs <= size    // this.sizeCompare(size) <= 0
    this.sizeIs == size    // this.sizeCompare(size) == 0
    this.sizeIs != size    // this.sizeCompare(size) != 0
    this.sizeIs >= size    // this.sizeCompare(size) >= 0
    this.sizeIs > size     // this.sizeCompare(size) > 0
    Definition Classes
    IterableOps
    Annotations
    @inline()
  198. def slice(from: Int, until: Int): ArrayDeque[A]

    Selects an interval of elements.

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

    from <= indexOf(x) < until
    from

    the lowest index to include from this array deque.

    until

    the lowest index to EXCLUDE from this array deque.

    returns

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

    Definition Classes
    ArrayDequeOpsIterableOpsIterableOnceOps
  199. def sliceInPlace(start: Int, end: Int): ArrayDeque.this.type

    Retains the specified slice from this array deque and removes the rest.

    Retains the specified slice from this array deque and removes the rest.

    start

    the lowest index to include

    end

    the lowest index to exclude

    returns

    this array deque

    Definition Classes
    Buffer
  200. def sliding(window: Int, step: Int): Iterator[ArrayDeque[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).

    The returned iterator will be empty when called on an empty collection. The last element the iterator produces may be smaller than the window size when the original collection isn't exhausted by the window before it and its last element isn't skipped by the step before it.

    step

    the distance between the first elements of successive groups

    returns

    An iterator producing array deques of size size, except the last element (which may be the only element) will be smaller if there are fewer than size elements remaining to be grouped.

    Definition Classes
    ArrayDequeOpsIterableOps
    Examples:
    1. List(1, 2, 3, 4, 5).sliding(2, 2) = Iterator(List(1, 2), List(3, 4), List(5))

    2. ,
    3. List(1, 2, 3, 4, 5, 6).sliding(2, 3) = Iterator(List(1, 2), List(4, 5))

    See also

    scala.collection.Iterator, method sliding

  201. def sliding(size: Int): Iterator[ArrayDeque[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).

    An empty collection returns an empty iterator, and a non-empty collection containing fewer elements than the window size returns an iterator that will produce the original collection as its only element.

    size

    the number of elements per group

    returns

    An iterator producing array deques of size size, except for a non-empty collection with less than size elements, which returns an iterator that produces the source collection itself as its only element.

    Definition Classes
    IterableOps
    Examples:
    1. List().sliding(2) = empty iterator

    2. ,
    3. List(1).sliding(2) = Iterator(List(1))

    4. ,
    5. List(1, 2).sliding(2) = Iterator(List(1, 2))

    6. ,
    7. List(1, 2, 3).sliding(2) = Iterator(List(1, 2), List(2, 3))

    See also

    scala.collection.Iterator, method sliding

  202. def sortBy[B](f: (A) => B)(implicit ord: Ordering[B]): ArrayDeque[A]

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

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

    Note: Even when applied to a view or a lazy collection it will always force the elements.

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

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

    Definition Classes
    SeqOps
    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

  203. def sortInPlace[B >: A]()(implicit ord: Ordering[B]): ArrayDeque.this.type

    Sorts this array deque in place according to an Ordering.

    Sorts this array deque in place according to an Ordering.

    ord

    the ordering to be used to compare elements.

    returns

    modified input array deque sorted according to the ordering ord.

    Definition Classes
    IndexedSeqOps
    See also

    scala.collection.SeqOps.sorted

  204. def sortInPlaceBy[B](f: (A) => B)(implicit ord: Ordering[B]): ArrayDeque.this.type

    Sorts this array deque in place according to the Ordering which results from transforming an implicitly given Ordering with a transformation function.

    Sorts this array deque in place according to the Ordering which results from transforming an implicitly given Ordering with a transformation function.

    Definition Classes
    IndexedSeqOps
    See also

    scala.collection.SeqOps.sortBy

  205. def sortInPlaceWith(lt: (A, A) => Boolean): ArrayDeque.this.type

    Sorts this array deque in place according to a comparison function.

    Sorts this array deque in place according to a comparison function.

    Definition Classes
    IndexedSeqOps
    See also

    scala.collection.SeqOps.sortWith

  206. def sortWith(lt: (A, A) => Boolean): ArrayDeque[A]

    Sorts this array deque according to a comparison function.

    Sorts this array deque according to a comparison function.

    Note: Even when applied to a view or a lazy collection it will always force the elements.

    The sort is stable. That is, elements that are equal (lt returns false for both directions of comparison) appear in the same order in the sorted sequence as in the original.

    lt

    a predicate that is true if its first argument strictly precedes its second argument in the desired ordering.

    returns

    a array deque consisting of the elements of this array deque sorted according to the comparison function lt.

    Definition Classes
    SeqOps
    Example:
    1. List("Steve", "Bobby", "Tom", "John", "Bob").sortWith((x, y) => x.take(3).compareTo(y.take(3)) < 0) =
      List("Bobby", "Bob", "John", "Steve", "Tom")
  207. def sorted[B >: A](implicit ord: Ordering[B]): ArrayDeque[A]

    Sorts this array deque according to an Ordering.

    Sorts this array deque according to an Ordering.

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

    ord

    the ordering to be used to compare elements.

    returns

    a array deque consisting of the elements of this array deque sorted according to the ordering ord.

    Definition Classes
    SeqOps
    See also

    scala.math.Ordering Note: Even when applied to a view or a lazy collection it will always force the elements.

  208. def span(p: (A) => Boolean): (ArrayDeque[A], ArrayDeque[A])

    Splits this array deque into a prefix/suffix pair according to a predicate.

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

    Definition Classes
    StrictOptimizedIterableOpsIterableOpsIterableOnceOps
  209. def splitAt(n: Int): (ArrayDeque[A], ArrayDeque[A])

    Splits this array deque into a prefix/suffix pair at a given position.

    Splits this array deque into a prefix/suffix pair 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 array deques consisting of the first n elements of this array deque, and the other elements.

    Definition Classes
    IterableOpsIterableOnceOps
  210. def start_+(idx: Int): Int
    Attributes
    protected
    Definition Classes
    ArrayDequeArrayDequeOps
    Annotations
    @inline()
  211. def startsWith[B >: A](that: IterableOnce[B], offset: Int = 0): Boolean

    Tests whether this array deque contains the given sequence at a given index.

    Tests whether this array deque contains the given sequence at a given index.

    Note: If the both the receiver object this and the argument that are infinite sequences this method may not terminate.

    that

    the sequence to test

    offset

    the index where the sequence is searched.

    returns

    true if the sequence that is contained in this array deque at index offset, otherwise false.

    Definition Classes
    SeqOps
  212. def stepper[S <: Stepper[_]](implicit shape: StepperShape[A, S]): S with EfficientSplit

    Returns a scala.collection.Stepper for the elements of this collection.

    Returns a scala.collection.Stepper for the elements of this collection.

    The Stepper enables creating a Java stream to operate on the collection, see scala.jdk.StreamConverters. For collections holding primitive values, the Stepper can be used as an iterator which doesn't box the elements.

    The implicit scala.collection.StepperShape parameter defines the resulting Stepper type according to the element type of this collection.

    Note that this method is overridden in subclasses and the return type is refined to S with EfficientSplit, for example scala.collection.IndexedSeqOps.stepper. For Steppers marked with scala.collection.Stepper.EfficientSplit, the converters in scala.jdk.StreamConverters allow creating parallel streams, whereas bare Steppers can be converted only to sequential streams.

    Definition Classes
    ArrayDequeIndexedSeqOpsIterableOnce
  213. final def strictOptimizedCollect[B, C2](b: Builder[B, C2], pf: PartialFunction[A, B]): C2

    B

    Type of elements of the resulting collection (e.g. String)

    C2

    Type of the resulting collection (e.g. List[String])

    b

    Builder to use to build the resulting collection

    pf

    Element transformation partial function

    returns

    The resulting collection

    Attributes
    protected[this]
    Definition Classes
    StrictOptimizedIterableOps
    Annotations
    @inline()
  214. final def strictOptimizedConcat[B >: A, C2](that: IterableOnce[B], b: Builder[B, C2]): C2

    B

    Type of elements of the resulting collections (e.g. Int)

    C2

    Type of the resulting collection (e.g. List[Int])

    that

    Elements to concatenate to this collection

    b

    Builder to use to build the resulting collection

    returns

    The resulting collection

    Attributes
    protected[this]
    Definition Classes
    StrictOptimizedIterableOps
    Annotations
    @inline()
  215. final def strictOptimizedFlatMap[B, C2](b: Builder[B, C2], f: (A) => IterableOnce[B]): C2

    B

    Type of elements of the resulting collection (e.g. String)

    C2

    Type of the resulting collection (e.g. List[String])

    b

    Builder to use to build the resulting collection

    f

    Element transformation function

    returns

    The resulting collection

    Attributes
    protected[this]
    Definition Classes
    StrictOptimizedIterableOps
    Annotations
    @inline()
  216. final def strictOptimizedFlatten[B, C2](b: Builder[B, C2])(implicit toIterableOnce: (A) => IterableOnce[B]): C2

    B

    Type of elements of the resulting collection (e.g. Int)

    C2

    Type of the resulting collection (e.g. List[Int])

    b

    Builder to use to build the resulting collection

    toIterableOnce

    Evidence that A can be seen as an IterableOnce[B]

    returns

    The resulting collection

    Attributes
    protected[this]
    Definition Classes
    StrictOptimizedIterableOps
    Annotations
    @inline()
  217. final def strictOptimizedMap[B, C2](b: Builder[B, C2], f: (A) => B): C2

    B

    Type of elements of the resulting collection (e.g. String)

    C2

    Type of the resulting collection (e.g. List[String])

    b

    Builder to use to build the resulting collection

    f

    Element transformation function

    returns

    The resulting collection

    Attributes
    protected[this]
    Definition Classes
    StrictOptimizedIterableOps
    Annotations
    @inline()
  218. final def strictOptimizedZip[B, C2](that: IterableOnce[B], b: Builder[(A, B), C2]): C2

    B

    Type of elements of the second collection (e.g. String)

    C2

    Type of the resulting collection (e.g. List[(Int, String)])

    that

    Collection to zip with this collection

    b

    Builder to use to build the resulting collection

    returns

    The resulting collection

    Attributes
    protected[this]
    Definition Classes
    StrictOptimizedIterableOps
    Annotations
    @inline()
  219. def stringPrefix: String
    Attributes
    protected[this]
    Definition Classes
    ArrayDequeIndexedSeqBufferSeqIterable
    Annotations
    @nowarn()
  220. def subtractAll(xs: IterableOnce[A]): ArrayDeque.this.type

    Removes all elements produced by an iterator from this array deque.

    Removes all elements produced by an iterator from this array deque.

    xs

    the iterator producing the elements to remove.

    returns

    the array deque itself

    Definition Classes
    Shrinkable
  221. def subtractOne(elem: A): ArrayDeque.this.type

    Removes a single element from this buffer, at its first occurrence.

    Removes a single element from this buffer, at its first occurrence. If the buffer does not contain that element, it is unchanged.

    returns

    the buffer itself

    Definition Classes
    ArrayDequeBufferShrinkable
  222. def sum[B >: A](implicit num: math.Numeric[B]): B

    Sums the elements of this collection.

    Sums the elements of this collection.

    The default implementation uses reduce for a known non-empty collection, foldLeft otherwise.

    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 array deque with respect to the + operator in num.

    Definition Classes
    IterableOnceOps
  223. final def synchronized[T0](arg0: => T0): T0

    Executes the code in body with an exclusive lock on this.

    Executes the code in body with an exclusive lock on this.

    returns

    the result of body

    Definition Classes
    AnyRef
  224. def tail: ArrayDeque[A]

    The rest of the collection without its first element.

    The rest of the collection without its first element.

    Definition Classes
    IterableOps
  225. def tails: Iterator[ArrayDeque[A]]

    Iterates over the tails of this array deque.

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

    returns

    an iterator over all the tails of this array deque

    Definition Classes
    IterableOps
    Example:
    1. List(1,2,3).tails = Iterator(List(1,2,3), List(2,3), List(3), Nil)

  226. def take(n: Int): ArrayDeque[A]

    Selects the first n elements.

    Selects the first n elements.

    n

    the number of elements to take from this array deque.

    returns

    a array deque consisting only of the first n elements of this array deque, or else the whole array deque, if it has less than n elements. If n is negative, returns an empty array deque.

    Definition Classes
    IndexedSeqOpsIterableOpsIterableOnceOps
  227. def takeInPlace(n: Int): ArrayDeque.this.type

    Retains the first n elements from this array deque and removes the rest.

    Retains the first n elements from this array deque and removes the rest.

    n

    the number of elements to retain

    returns

    this array deque

    Definition Classes
    Buffer
  228. def takeRight(n: Int): ArrayDeque[A]

    A collection containing the last n elements of this collection.

    A collection containing the last n elements of this collection.

    Note: Even when applied to a view or a lazy collection it will always force the elements.

    n

    the number of elements to take from this array deque.

    returns

    a array deque consisting only of the last n elements of this array deque, or else the whole array deque, if it has less than n elements. If n is negative, returns an empty array deque.

    Definition Classes
    StrictOptimizedIterableOpsIterableOps
  229. def takeRightInPlace(n: Int): ArrayDeque.this.type

    Retains the last n elements from this array deque and removes the rest.

    Retains the last n elements from this array deque and removes the rest.

    n

    the number of elements to retain

    returns

    this array deque

    Definition Classes
    Buffer
  230. def takeWhile(p: (A) => Boolean): ArrayDeque[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 array deque whose elements all satisfy the predicate p.

    Definition Classes
    IterableOpsIterableOnceOps
  231. def takeWhileInPlace(p: (A) => Boolean): ArrayDeque.this.type

    Retains the longest prefix of elements that satisfy a predicate.

    Retains the longest prefix of elements that satisfy a predicate.

    p

    The predicate used to test elements.

    returns

    this array deque

    Definition Classes
    Buffer
    See also

    takeWhile

  232. def tapEach[U](f: (A) => U): ArrayDeque[A]

    Applies a side-effecting function to each element in this collection.

    Applies a side-effecting function to each element in this collection. Strict collections will apply f to their elements immediately, while lazy collections like Views and LazyLists will only apply f on each element if and when that element is evaluated, and each time that element is evaluated.

    U

    the return type of f

    f

    a function to apply to each element in this array deque

    returns

    The same logical collection as this

    Definition Classes
    StrictOptimizedIterableOpsIterableOpsIterableOnceOps
  233. def to[C1](factory: Factory[A, C1]): C1

    Given a collection factory factory, converts this array deque to the appropriate representation for the current element type A.

    Given a collection factory factory, converts this array deque to the appropriate representation for the current element type A. Example uses:

    xs.to(List)
    xs.to(ArrayBuffer)
    xs.to(BitSet) // for xs: Iterable[Int]
    Definition Classes
    IterableOnceOps
  234. def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]

    Converts this array deque to an Array.

    Converts this array deque to an Array.

    Implementation note: DO NOT call Array.from from this method.

    B

    The type of elements of the result, a supertype of A.

    returns

    This array deque as an Array[B].

    Definition Classes
    ArrayDequeIterableOnceOps
  235. final def toBuffer[B >: A]: Buffer[B]

    Converts this array deque to a Buffer.

    Converts this array deque to a Buffer.

    B

    The type of elements of the result, a supertype of A.

    returns

    This array deque as a Buffer[B].

    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  236. def toIndexedSeq: immutable.IndexedSeq[A]

    Converts this array deque to an IndexedSeq.

    Converts this array deque to an IndexedSeq.

    returns

    This array deque as an IndexedSeq[A].

    Definition Classes
    IterableOnceOps
  237. def toList: immutable.List[A]

    Converts this array deque to a List.

    Converts this array deque to a List.

    returns

    This array deque as a List[A].

    Definition Classes
    IterableOnceOps
  238. def toMap[K, V](implicit ev: <:<[A, (K, V)]): immutable.Map[K, V]

    Converts this array deque to a Map, given an implicit coercion from the array deque's type to a key-value tuple.

    Converts this array deque to a Map, given an implicit coercion from the array deque's type to a key-value tuple.

    K

    The key type for the resulting map.

    V

    The value type for the resulting map.

    ev

    An implicit coercion from A to [K, V].

    returns

    This array deque as a Map[K, V].

    Definition Classes
    IterableOnceOps
  239. def toSeq: immutable.Seq[A]

    returns

    This array deque as a Seq[A]. This is equivalent to to(Seq) but might be faster.

    Definition Classes
    IterableOnceOps
  240. def toSet[B >: A]: immutable.Set[B]

    Converts this array deque to a Set.

    Converts this array deque to a Set.

    B

    The type of elements of the result, a supertype of A.

    returns

    This array deque as a Set[B].

    Definition Classes
    IterableOnceOps
  241. 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
    SeqFunction1Iterable → AnyRef → Any
  242. def toVector: immutable.Vector[A]

    Converts this array deque to a Vector.

    Converts this array deque to a Vector.

    returns

    This array deque as a Vector[A].

    Definition Classes
    IterableOnceOps
  243. def transpose[B](implicit asIterable: (A) => collection.Iterable[B]): ArrayDeque[ArrayDeque[B]]

    Transposes this array deque of iterable collections into a array deque of array deques.

    Transposes this array deque of iterable collections into a array deque of array deques.

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

    val xs = List(
               Set(1, 2, 3),
               Set(4, 5, 6)).transpose
    // xs == List(
    //         List(1, 4),
    //         List(2, 5),
    //         List(3, 6))
    
    val ys = Vector(
               List(1, 2, 3),
               List(4, 5, 6)).transpose
    // ys == Vector(
    //         Vector(1, 4),
    //         Vector(2, 5),
    //         Vector(3, 6))

    Note: Even when applied to a view or a lazy collection it will always force the elements.

    B

    the type of the elements of each iterable collection.

    asIterable

    an implicit conversion which asserts that the element type of this array deque is an Iterable.

    returns

    a two-dimensional array deque of array deques which has as nth row the nth column of this array deque.

    Definition Classes
    IterableOps
    Exceptions thrown

    IllegalArgumentException if all collections in this array deque are not of the same size.

  244. def trimToSize(): Unit

    Trims the capacity of this ArrayDeque's instance to be the current size

  245. def unapply(a: Int): Option[A]

    Tries to extract a B from an A in a pattern matching expression.

    Tries to extract a B from an A in a pattern matching expression.

    Definition Classes
    PartialFunction
  246. def unlift: PartialFunction[Int, B]

    Converts an optional function to a partial function.

    Converts an optional function to a partial function.

    Implicit
    This member is added by an implicit conversion from ArrayDeque[A] toUnliftOps[Int, B] performed by method UnliftOps in scala.Function1.This conversion will take place only if A is a subclass of Option[B] (A <: Option[B]).
    Definition Classes
    UnliftOps
    Example:
    1. Unlike Function.unlift, this UnliftOps.unlift method can be used in extractors.

      val of: Int => Option[String] = { i =>
        if (i == 2) {
          Some("matched by an optional function")
        } else {
          None
        }
      }
      
      util.Random.nextInt(4) match {
        case of.unlift(m) => // Convert an optional function to a pattern
          println(m)
        case _ =>
          println("Not matched")
      }
  247. def unzip[A1, A2](implicit asPair: (A) => (A1, A2)): (ArrayDeque[A1], ArrayDeque[A2])

    Converts this array deque of pairs into two collections of the first and second half of each pair.

    Converts this array deque of pairs into two collections of the first and second half of each pair.

    val xs = `mutable.ArrayDeque`(
               (1, "one"),
               (2, "two"),
               (3, "three")).unzip
    // xs == (`mutable.ArrayDeque`(1, 2, 3),
    //        `mutable.ArrayDeque`(one, two, three))
    A1

    the type of the first half of the element pairs

    A2

    the type of the second half of the element pairs

    asPair

    an implicit conversion which asserts that the element type of this array deque is a pair.

    returns

    a pair of array deques, containing the first, respectively second half of each element pair of this array deque.

    Definition Classes
    StrictOptimizedIterableOpsIterableOps
  248. def unzip3[A1, A2, A3](implicit asTriple: (A) => (A1, A2, A3)): (ArrayDeque[A1], ArrayDeque[A2], ArrayDeque[A3])

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

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

    val xs = `mutable.ArrayDeque`(
               (1, "one", '1'),
               (2, "two", '2'),
               (3, "three", '3')).unzip3
    // xs == (`mutable.ArrayDeque`(1, 2, 3),
    //        `mutable.ArrayDeque`(one, two, three),
    //        `mutable.ArrayDeque`(1, 2, 3))
    A1

    the type of the first member of the element triples

    A2

    the type of the second member of the element triples

    A3

    the type of the third member of the element triples

    asTriple

    an implicit conversion which asserts that the element type of this array deque is a triple.

    returns

    a triple of array deques, containing the first, second, respectively third member of each element triple of this array deque.

    Definition Classes
    StrictOptimizedIterableOpsIterableOps
  249. def update(idx: Int, elem: A): Unit

    Replaces element at given index with a new value.

    Replaces element at given index with a new value.

    idx

    the index of the element to replace.

    elem

    the new value.

    Definition Classes
    ArrayDequeSeqOps
    Exceptions thrown

    IndexOutOfBoundsException if the index is not valid.

  250. def updated[B >: A](index: Int, elem: B): ArrayDeque[B]

    A copy of this array deque with one single replaced element.

    A copy of this array deque with one single replaced element.

    B

    the element type of the returned array deque.

    index

    the position of the replacement

    elem

    the replacing element

    returns

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

    Definition Classes
    SeqOps
    Exceptions thrown

    IndexOutOfBoundsException if index does not satisfy 0 <= index < length. In case of a lazy collection this exception may be thrown at a later time or not at all (if the end of the collection is never evaluated).

  251. def view: IndexedSeqView[A]

    A view over the elements of this collection.

    A view over the elements of this collection.

    Definition Classes
    IndexedSeqOpsSeqOpsIterableOps
  252. final def wait(): Unit

    See https://docs.oracle.com/javase/8/docs/api/java/lang/Object.html#wait--.

    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
    Note

    not specified by SLS as a member of AnyRef

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

    See https://docs.oracle.com/javase/8/docs/api/java/lang/Object.html#wait-long-int-

    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
    Note

    not specified by SLS as a member of AnyRef

  254. final def wait(arg0: Long): Unit

    See https://docs.oracle.com/javase/8/docs/api/java/lang/Object.html#wait-long-.

    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
    Note

    not specified by SLS as a member of AnyRef

  255. def withFilter(p: (A) => Boolean): WithFilter[A, [_]ArrayDeque[_]]

    Creates a non-strict filter of this array deque.

    Creates a non-strict filter of this array deque.

    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 array deque which satisfy the predicate p.

    Definition Classes
    IterableOps
  256. def writeReplace(): AnyRef
    Attributes
    protected[this]
    Definition Classes
    DefaultSerializable
  257. def zip[B](that: IterableOnce[B]): ArrayDeque[(A, B)]

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

    Returns a array deque formed from this array deque 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 array deque containing pairs consisting of corresponding elements of this array deque and that. The length of the returned collection is the minimum of the lengths of this array deque and that.

    Definition Classes
    StrictOptimizedIterableOpsIterableOps
  258. def zipAll[A1 >: A, B](that: collection.Iterable[B], thisElem: A1, thatElem: B): ArrayDeque[(A1, B)]

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

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

    thatElem

    the element to be used to fill up the result if that is shorter than this array deque.

    returns

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

    Definition Classes
    IterableOps
  259. def zipWithIndex: ArrayDeque[(A, Int)]

    Zips this array deque with its indices.

    Zips this array deque with its indices.

    returns

    A new array deque containing pairs consisting of all elements of this array deque paired with their index. Indices start at 0.

    Definition Classes
    StrictOptimizedIterableOpsIterableOpsIterableOnceOps
    Example:
    1. List("a", "b", "c").zipWithIndex == List(("a", 0), ("b", 1), ("c", 2))

Deprecated Value Members

  1. final def +=(elem1: A, elem2: A, elems: A*): ArrayDeque.this.type

    Adds two or more elements to this array deque.

    Adds two or more elements to this array deque.

    elem1

    the first element to add.

    elem2

    the second element to add.

    elems

    the remaining elements to add.

    returns

    the array deque itself

    Definition Classes
    Growable
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use ++= aka addAll instead of varargs +=; infix operations with an operand of multiple args will be deprecated

  2. def -=(elem1: A, elem2: A, elems: A*): ArrayDeque.this.type

    Removes two or more elements from this array deque.

    Removes two or more elements from this array deque.

    elem1

    the first element to remove.

    elem2

    the second element to remove.

    elems

    the remaining elements to remove.

    returns

    the array deque itself

    Definition Classes
    Shrinkable
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.3) Use --= aka subtractAll instead of varargs -=; infix operations with an operand of multiple args will be deprecated

  3. def /:[B](z: B)(op: (B, A) => B): B
    Implicit
    This member is added by an implicit conversion from ArrayDeque[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (arrayDeque: IterableOnceExtensionMethods[A])./:(z)(op)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.foldLeft instead

  4. final def /:[B](z: B)(op: (B, A) => B): B
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use foldLeft instead of /:

  5. def :\[B](z: B)(op: (A, B) => B): B
    Implicit
    This member is added by an implicit conversion from ArrayDeque[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (arrayDeque: IterableOnceExtensionMethods[A]).:\(z)(op)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.foldRight instead

  6. final def :\[B](z: B)(op: (A, B) => B): B
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use foldRight instead of :\

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

    Since this method degenerates to foldLeft for sequential (non-parallel) collections, where the combining operation is ignored, it is advisable to prefer foldLeft for that case.

    For parallel collections, use the aggregate method specified by scala.collection.parallel.ParIterableLike.

    B

    the result type, produced by seqop, combop, and by this function as a final result.

    z

    the start value, a neutral element for seqop.

    seqop

    the binary operator used to accumulate the result.

    combop

    an associative operator for combining sequential results, unused for sequential collections.

    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) For sequential collections, prefer foldLeft(z)(seqop). For parallel collections, use ParIterableLike#aggregate.

  8. final def append(elems: A*): ArrayDeque.this.type
    Definition Classes
    Buffer
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use appendAll instead

  9. def collectFirst[B](f: PartialFunction[A, B]): Option[B]
    Implicit
    This member is added by an implicit conversion from ArrayDeque[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (arrayDeque: IterableOnceExtensionMethods[A]).collectFirst(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.collectFirst(...) instead

  10. def companion: IterableFactory[[_]ArrayDeque[_]]
    Definition Classes
    IterableOps
    Annotations
    @deprecated @deprecatedOverriding() @inline()
    Deprecated

    (Since version 2.13.0) Use iterableFactory instead

  11. def copyToBuffer(dest: Buffer[A]): Unit
    Implicit
    This member is added by an implicit conversion from ArrayDeque[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (arrayDeque: IterableOnceExtensionMethods[A]).copyToBuffer(dest)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.copyToBuffer(...) instead

  12. final def copyToBuffer[B >: A](dest: Buffer[B]): Unit
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use dest ++= coll instead

  13. def count(f: (A) => Boolean): Int
    Implicit
    This member is added by an implicit conversion from ArrayDeque[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (arrayDeque: IterableOnceExtensionMethods[A]).count(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.count(...) instead

  14. def exists(f: (A) => Boolean): Boolean
    Implicit
    This member is added by an implicit conversion from ArrayDeque[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (arrayDeque: IterableOnceExtensionMethods[A]).exists(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.exists(...) instead

  15. def filter(f: (A) => Boolean): Iterator[A]
    Implicit
    This member is added by an implicit conversion from ArrayDeque[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (arrayDeque: IterableOnceExtensionMethods[A]).filter(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.filter(...) instead

  16. def find(p: (A) => Boolean): Option[A]
    Implicit
    This member is added by an implicit conversion from ArrayDeque[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (arrayDeque: IterableOnceExtensionMethods[A]).find(p)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.find instead

  17. def flatMap[B](f: (A) => IterableOnce[B]): IterableOnce[B]
    Implicit
    This member is added by an implicit conversion from ArrayDeque[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (arrayDeque: IterableOnceExtensionMethods[A]).flatMap(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.flatMap instead or consider requiring an Iterable

  18. def fold[A1 >: A](z: A1)(op: (A1, A1) => A1): A1
    Implicit
    This member is added by an implicit conversion from ArrayDeque[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (arrayDeque: IterableOnceExtensionMethods[A]).fold(z)(op)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.fold instead

  19. def foldLeft[B](z: B)(op: (B, A) => B): B
    Implicit
    This member is added by an implicit conversion from ArrayDeque[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (arrayDeque: IterableOnceExtensionMethods[A]).foldLeft(z)(op)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.foldLeft instead

  20. def foldRight[B](z: B)(op: (A, B) => B): B
    Implicit
    This member is added by an implicit conversion from ArrayDeque[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (arrayDeque: IterableOnceExtensionMethods[A]).foldRight(z)(op)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.foldRight instead

  21. def forall(f: (A) => Boolean): Boolean
    Implicit
    This member is added by an implicit conversion from ArrayDeque[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (arrayDeque: IterableOnceExtensionMethods[A]).forall(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.forall(...) instead

  22. def foreach[U](f: (A) => U): Unit
    Implicit
    This member is added by an implicit conversion from ArrayDeque[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (arrayDeque: IterableOnceExtensionMethods[A]).foreach(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.foreach(...) instead

  23. def formatted(fmtstr: String): String

    Returns string formatted according to given format string.

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

    Implicit
    This member is added by an implicit conversion from ArrayDeque[A] toStringFormat[ArrayDeque[A]] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.12.16) Use formatString.format(value) instead of value.formatted(formatString), or use the f"" string interpolator. In Java 15 and later, formatted resolves to the new method in String which has reversed parameters.

  24. def hasDefiniteSize: Boolean

    Tests whether this array deque is known to have a finite size.

    Tests whether this array deque 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. Non-empty Iterators usually return false even if they were created from a collection with a known finite size.

    Note: many collection methods will not work on collections of infinite sizes. The typical failure mode is an infinite loop. These methods always attempt a traversal without checking first that hasDefiniteSize returns true. However, checking hasDefiniteSize can provide an assurance that size is well-defined and non-termination is not a concern.

    returns

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

    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Check .knownSize instead of .hasDefiniteSize for more actionable information (see scaladoc for details)

    See also

    method knownSize for a more useful alternative

  25. def isEmpty: Boolean
    Implicit
    This member is added by an implicit conversion from ArrayDeque[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (arrayDeque: IterableOnceExtensionMethods[A]).isEmpty
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.isEmpty instead

  26. def map[B](f: (A) => B): IterableOnce[B]
    Implicit
    This member is added by an implicit conversion from ArrayDeque[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (arrayDeque: IterableOnceExtensionMethods[A]).map(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.map instead or consider requiring an Iterable

  27. def max(implicit ord: math.Ordering[A]): A
    Implicit
    This member is added by an implicit conversion from ArrayDeque[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (arrayDeque: IterableOnceExtensionMethods[A]).max(ord)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.max instead

  28. def maxBy[B](f: (A) => B)(implicit cmp: math.Ordering[B]): A
    Implicit
    This member is added by an implicit conversion from ArrayDeque[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (arrayDeque: IterableOnceExtensionMethods[A]).maxBy(f)(cmp)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.maxBy(...) instead

  29. def min(implicit ord: math.Ordering[A]): A
    Implicit
    This member is added by an implicit conversion from ArrayDeque[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (arrayDeque: IterableOnceExtensionMethods[A]).min(ord)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.min instead

  30. def minBy[B](f: (A) => B)(implicit cmp: math.Ordering[B]): A
    Implicit
    This member is added by an implicit conversion from ArrayDeque[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (arrayDeque: IterableOnceExtensionMethods[A]).minBy(f)(cmp)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.minBy(...) instead

  31. def mkString: String
    Implicit
    This member is added by an implicit conversion from ArrayDeque[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (arrayDeque: IterableOnceExtensionMethods[A]).mkString
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.mkString instead

  32. def mkString(sep: String): String
    Implicit
    This member is added by an implicit conversion from ArrayDeque[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (arrayDeque: IterableOnceExtensionMethods[A]).mkString(sep)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.mkString instead

  33. def mkString(start: String, sep: String, end: String): String
    Implicit
    This member is added by an implicit conversion from ArrayDeque[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (arrayDeque: IterableOnceExtensionMethods[A]).mkString(start, sep, end)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.mkString instead

  34. def nonEmpty: Boolean
    Implicit
    This member is added by an implicit conversion from ArrayDeque[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (arrayDeque: IterableOnceExtensionMethods[A]).nonEmpty
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.nonEmpty instead

  35. final 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 array deque such that every element of the segment satisfies the predicate p.

    Definition Classes
    SeqOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use segmentLength instead of prefixLength

  36. final def prepend(elems: A*): ArrayDeque.this.type
    Definition Classes
    Buffer
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use prependAll instead

  37. def product(implicit num: math.Numeric[A]): A
    Implicit
    This member is added by an implicit conversion from ArrayDeque[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (arrayDeque: IterableOnceExtensionMethods[A]).product(num)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.product instead

  38. def reduce(f: (A, A) => A): A
    Implicit
    This member is added by an implicit conversion from ArrayDeque[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (arrayDeque: IterableOnceExtensionMethods[A]).reduce(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.reduce(...) instead

  39. def reduceLeft(f: (A, A) => A): A
    Implicit
    This member is added by an implicit conversion from ArrayDeque[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (arrayDeque: IterableOnceExtensionMethods[A]).reduceLeft(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.reduceLeft(...) instead

  40. def reduceLeftOption(f: (A, A) => A): Option[A]
    Implicit
    This member is added by an implicit conversion from ArrayDeque[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (arrayDeque: IterableOnceExtensionMethods[A]).reduceLeftOption(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.reduceLeftOption(...) instead

  41. def reduceOption(f: (A, A) => A): Option[A]
    Implicit
    This member is added by an implicit conversion from ArrayDeque[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (arrayDeque: IterableOnceExtensionMethods[A]).reduceOption(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.reduceOption(...) instead

  42. def reduceRight(f: (A, A) => A): A
    Implicit
    This member is added by an implicit conversion from ArrayDeque[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (arrayDeque: IterableOnceExtensionMethods[A]).reduceRight(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.reduceRight(...) instead

  43. def reduceRightOption(f: (A, A) => A): Option[A]
    Implicit
    This member is added by an implicit conversion from ArrayDeque[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (arrayDeque: IterableOnceExtensionMethods[A]).reduceRightOption(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.reduceRightOption(...) instead

  44. final def repr: ArrayDeque[A]
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use coll instead of repr in a collection implementation, use the collection value itself from the outside

  45. def reverseMap[B](f: (A) => B): ArrayDeque[B]
    Definition Classes
    SeqOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .reverseIterator.map(f).to(...) instead of .reverseMap(f)

  46. def sameElements[B >: A](that: IterableOnce[B]): Boolean
    Implicit
    This member is added by an implicit conversion from ArrayDeque[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (arrayDeque: IterableOnceExtensionMethods[A]).sameElements(that)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.sameElements instead

  47. def seq: ArrayDeque.this.type
    Definition Classes
    Iterable
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Iterable.seq always returns the iterable itself

  48. def size: Int
    Implicit
    This member is added by an implicit conversion from ArrayDeque[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (arrayDeque: IterableOnceExtensionMethods[A]).size
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.size instead

  49. def sum(implicit num: math.Numeric[A]): A
    Implicit
    This member is added by an implicit conversion from ArrayDeque[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (arrayDeque: IterableOnceExtensionMethods[A]).sum(num)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.sum instead

  50. def to[C1](factory: Factory[A, C1]): C1
    Implicit
    This member is added by an implicit conversion from ArrayDeque[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (arrayDeque: IterableOnceExtensionMethods[A]).to(factory)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.to(factory) instead

  51. def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
    Implicit
    This member is added by an implicit conversion from ArrayDeque[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (arrayDeque: IterableOnceExtensionMethods[A]).toArray(arg0)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.toArray

  52. def toBuffer[B >: A]: Buffer[B]
    Implicit
    This member is added by an implicit conversion from ArrayDeque[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (arrayDeque: IterableOnceExtensionMethods[A]).toBuffer
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.to(ArrayBuffer) instead

  53. def toIndexedSeq: collection.IndexedSeq[A]
    Implicit
    This member is added by an implicit conversion from ArrayDeque[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (arrayDeque: IterableOnceExtensionMethods[A]).toIndexedSeq
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.toIndexedSeq instead

  54. final def toIterable: collection.Iterable[A]
    Implicit
    This member is added by an implicit conversion from ArrayDeque[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (arrayDeque: IterableOnceExtensionMethods[A]).toIterable
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.to(Iterable) instead

  55. final def toIterable: ArrayDeque.this.type

    returns

    This collection as an Iterable[A]. No new collection will be built if this is already an Iterable[A].

    Definition Classes
    IterableIterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.7) toIterable is internal and will be made protected; its name is similar to toList or toSeq, but it doesn't copy non-immutable collections

  56. def toIterator: Iterator[A]
    Implicit
    This member is added by an implicit conversion from ArrayDeque[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (arrayDeque: IterableOnceExtensionMethods[A]).toIterator
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator instead

  57. final def toIterator: Iterator[A]
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator instead of .toIterator

  58. def toList: immutable.List[A]
    Implicit
    This member is added by an implicit conversion from ArrayDeque[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (arrayDeque: IterableOnceExtensionMethods[A]).toList
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.to(List) instead

  59. def toMap[K, V](implicit ev: <:<[A, (K, V)]): immutable.Map[K, V]
    Implicit
    This member is added by an implicit conversion from ArrayDeque[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (arrayDeque: IterableOnceExtensionMethods[A]).toMap(ev)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.to(Map) instead

  60. def toSeq: immutable.Seq[A]
    Implicit
    This member is added by an implicit conversion from ArrayDeque[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (arrayDeque: IterableOnceExtensionMethods[A]).toSeq
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.to(Seq) instead

  61. def toSet[B >: A]: immutable.Set[B]
    Implicit
    This member is added by an implicit conversion from ArrayDeque[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (arrayDeque: IterableOnceExtensionMethods[A]).toSet
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.to(Set) instead

  62. def toStream: immutable.Stream[A]
    Implicit
    This member is added by an implicit conversion from ArrayDeque[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (arrayDeque: IterableOnceExtensionMethods[A]).toStream
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.to(LazyList) instead

  63. final def toStream: immutable.Stream[A]
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .to(LazyList) instead of .toStream

  64. final def toTraversable: collection.Traversable[A]
    Implicit
    This member is added by an implicit conversion from ArrayDeque[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (arrayDeque: IterableOnceExtensionMethods[A]).toTraversable
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.to(Iterable) instead

  65. final def toTraversable: collection.Traversable[A]

    Converts this array deque to an unspecified Iterable.

    Converts this array deque to an unspecified Iterable. Will return the same collection if this instance is already Iterable.

    returns

    An Iterable containing all elements of this array deque.

    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) toTraversable is internal and will be made protected; its name is similar to toList or toSeq, but it doesn't copy non-immutable collections

  66. def toVector: immutable.Vector[A]
    Implicit
    This member is added by an implicit conversion from ArrayDeque[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (arrayDeque: IterableOnceExtensionMethods[A]).toVector
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.to(Vector) instead

  67. final def transform(f: (A) => A): ArrayDeque.this.type
    Definition Classes
    SeqOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use mapInPlace on an IndexedSeq instead

  68. def trimEnd(n: Int): Unit

    Removes the last n elements of this buffer.

    Removes the last n elements of this buffer.

    n

    the number of elements to remove from the end of this buffer.

    Definition Classes
    Buffer
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.4) use dropRightInPlace instead

  69. def trimStart(n: Int): Unit

    Removes the first n elements of this buffer.

    Removes the first n elements of this buffer.

    n

    the number of elements to remove from the beginning of this buffer.

    Definition Classes
    Buffer
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.4) use dropInPlace instead

  70. final def union[B >: A](that: collection.Seq[B]): ArrayDeque[B]

    Produces a new sequence which contains all elements of this array deque and also all elements of a given sequence.

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

    B

    the element type of the returned array deque.

    that

    the sequence to add.

    returns

    a new collection which contains all elements of this array deque followed by all elements of that.

    Definition Classes
    SeqOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use concat instead

  71. def view(from: Int, until: Int): IndexedSeqView[A]

    A view over a slice of the elements of this collection.

    A view over a slice of the elements of this collection.

    Definition Classes
    IndexedSeqOpsIterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .view.slice(from, until) instead of .view(from, until)

  72. def withFilter(f: (A) => Boolean): Iterator[A]
    Implicit
    This member is added by an implicit conversion from ArrayDeque[A] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (arrayDeque: IterableOnceExtensionMethods[A]).withFilter(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.withFilter(...) instead

  73. def [B](y: B): (ArrayDeque[A], B)
    Implicit
    This member is added by an implicit conversion from ArrayDeque[A] toArrowAssoc[ArrayDeque[A]] performed by method ArrowAssoc in scala.Predef.This conversion will take place only if A is a subclass of Option[Nothing] (A <: Option[Nothing]).
    Definition Classes
    ArrowAssoc
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use -> instead. If you still wish to display it as one character, consider using a font with programming ligatures such as Fira Code.

Inherited from DefaultSerializable

Inherited from java.io.Serializable

Inherited from ArrayDequeOps[A, ArrayDeque, ArrayDeque[A]]

Inherited from IndexedBuffer[A]

Inherited from IndexedSeq[A]

Inherited from IndexedSeqOps[A, [_]ArrayDeque[_], ArrayDeque[A]]

Inherited from collection.IndexedSeq[A]

Inherited from collection.IndexedSeqOps[A, [_]ArrayDeque[_], ArrayDeque[A]]

Inherited from AbstractBuffer[A]

Inherited from Buffer[A]

Inherited from Shrinkable[A]

Inherited from Growable[A]

Inherited from Clearable

Inherited from AbstractSeq[A]

Inherited from Seq[A]

Inherited from SeqOps[A, [_]ArrayDeque[_], ArrayDeque[A]]

Inherited from Cloneable[ArrayDeque[A]]

Inherited from java.lang.Cloneable

Inherited from Iterable[A]

Inherited from collection.AbstractSeq[A]

Inherited from collection.Seq[A]

Inherited from Equals

Inherited from collection.SeqOps[A, [_]ArrayDeque[_], ArrayDeque[A]]

Inherited from PartialFunction[Int, A]

Inherited from (Int) => A

Inherited from collection.AbstractIterable[A]

Inherited from collection.Iterable[A]

Inherited from IterableFactoryDefaults[A, [x]ArrayDeque[x]]

Inherited from IterableOps[A, [_]ArrayDeque[_], ArrayDeque[A]]

Inherited from IterableOnceOps[A, [_]ArrayDeque[_], ArrayDeque[A]]

Inherited from IterableOnce[A]

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion UnliftOps fromArrayDeque[A] to UnliftOps[Int, B]

Inherited by implicit conversion iterableOnceExtensionMethods fromArrayDeque[A] to IterableOnceExtensionMethods[A]

Inherited by implicit conversion any2stringadd fromArrayDeque[A] to any2stringadd[ArrayDeque[A]]

Inherited by implicit conversion StringFormat fromArrayDeque[A] to StringFormat[ArrayDeque[A]]

Inherited by implicit conversion Ensuring fromArrayDeque[A] to Ensuring[ArrayDeque[A]]

Inherited by implicit conversion ArrowAssoc fromArrayDeque[A] to ArrowAssoc[ArrayDeque[A]]

Ungrouped