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

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

Scala Standard Library 2.13.10 - scala.collection.SeqFactory



1. Alphabetic
2. By Inheritance

1. SeqFactory
2. IterableFactory
3. Serializable
4. AnyRef
5. Any

1. by any2stringadd
2. by StringFormat
3. by Ensuring
4. by ArrowAssoc

1. Public
2. Protected

1.  abstract def empty[A]: CC[A]
2.  abstract def from[A](source: IterableOnce[A]): CC[A]
3.  abstract def newBuilder[A]: Builder[A, CC[A]]

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