Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Showing content from https://www.scala-lang.org/api/2.13.10/scala/collection/mutable/ArrayDeque$.html below:

Scala Standard Library 2.13.10 - scala.collection.mutable.ArrayDeque



1. Alphabetic
2. By Inheritance

1. ArrayDeque
2. StrictOptimizedSeqFactory
3. SeqFactory
4. IterableFactory
5. Serializable
6. AnyRef
7. Any

1. Public
2. Protected

1.  final def !=(arg0: Any): Boolean
2.  final def ##: Int
3.  final def ==(arg0: Any): Boolean
4.  final val DefaultInitialSize: Int(16)
5.  def apply[A](elems: A*): ArrayDeque[A]
6.  final def asInstanceOf[T0]: T0
7.  def clone(): AnyRef
8.  def concat[A](xss: collection.Iterable[A]*): ArrayDeque[A]
9.  def empty[A]: ArrayDeque[A]
10.  final def eq(arg0: AnyRef): Boolean
11.  def equals(arg0: AnyRef): Boolean
12.  def fill[A](n: Int)(elem: => A): ArrayDeque[A]
13.  def fill[A](n1: Int, n2: Int, n3: Int, n4: Int, n5: Int)(elem: => A): ArrayDeque[ArrayDeque[ArrayDeque[ArrayDeque[ArrayDeque[A]]]]]
14.  def fill[A](n1: Int, n2: Int, n3: Int, n4: Int)(elem: => A): ArrayDeque[ArrayDeque[ArrayDeque[ArrayDeque[A]]]]
15.  def fill[A](n1: Int, n2: Int, n3: Int)(elem: => A): ArrayDeque[ArrayDeque[ArrayDeque[A]]]
16.  def fill[A](n1: Int, n2: Int)(elem: => A): ArrayDeque[ArrayDeque[A]]
17.  def finalize(): Unit
18.  def from[B](coll: IterableOnce[B]): ArrayDeque[B]
19.  final def getClass(): Class[_ <: AnyRef]
20.  def hashCode(): Int
21.  final def isInstanceOf[T0]: Boolean
22.  implicit def iterableFactory[A]: Factory[A, ArrayDeque[A]]
23.  def iterate[A](start: A, len: Int)(f: (A) => A): ArrayDeque[A]
24.  final def ne(arg0: AnyRef): Boolean
25.  def newBuilder[A]: Builder[A, ArrayDeque[A]]
26.  final def notify(): Unit
27.  final def notifyAll(): Unit
28.  def range[A](start: A, end: A, step: A)(implicit arg0: Integral[A]): ArrayDeque[A]
29.  def range[A](start: A, end: A)(implicit arg0: Integral[A]): ArrayDeque[A]
30.  final def synchronized[T0](arg0: => T0): T0
31.  def tabulate[A](n: Int)(f: (Int) => A): ArrayDeque[A]
32.  def tabulate[A](n1: Int, n2: Int, n3: Int, n4: Int, n5: Int)(f: (Int, Int, Int, Int, Int) => A): ArrayDeque[ArrayDeque[ArrayDeque[ArrayDeque[ArrayDeque[A]]]]]
33.  def tabulate[A](n1: Int, n2: Int, n3: Int, n4: Int)(f: (Int, Int, Int, Int) => A): ArrayDeque[ArrayDeque[ArrayDeque[ArrayDeque[A]]]]
34.  def tabulate[A](n1: Int, n2: Int, n3: Int)(f: (Int, Int, Int) => A): ArrayDeque[ArrayDeque[ArrayDeque[A]]]
35.  def tabulate[A](n1: Int, n2: Int)(f: (Int, Int) => A): ArrayDeque[ArrayDeque[A]]
36.  def toString(): String
37.  final def unapplySeq[A](x: ArrayDeque[A]): UnapplySeqWrapper[A]
38.  def unfold[A, S](init: S)(f: (S) => Option[(A, S)]): ArrayDeque[A]
39.  final def wait(): Unit
40.  final def wait(arg0: Long, arg1: Int): Unit
41.  final def wait(arg0: Long): Unit

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4