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

Showing content from http://www.scala-lang.org/api/2.12.15/scala/Array.html below:

Scala Standard Library 2.12.15 - scala.Array

 

1. Alphabetic
2. By Inheritance

1. Array
2. Cloneable
3. Serializable
4. AnyRef
5. Any

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

1.  new Array(_length: Int)

1.  final def !=(arg0: Any): Boolean
2.  final def ##(): Int
3.  def +(other: String): String
4.  def ++[B >: A, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Array[T], B, That]): That
5.  def ++:[B >: A, That](that: collection.Traversable[B])(implicit bf: CanBuildFrom[Array[T], B, That]): That
6.  def ++:[B](that: collection.TraversableOnce[B]): Array[B]
7.  def +:[B >: T](elem: B)(implicit arg0: ClassTag[B]): Array[B]
8.  def +:(elem: A): Array[A]
9.  def ->[B](y: B): (Array[T], B)
10.  def :+[B >: T](elem: B)(implicit arg0: ClassTag[B]): Array[B]
11.  def :+(elem: A): Array[A]
12.  final def ==(arg0: Any): Boolean
13.  def addString(b: StringBuilder): StringBuilder
14.  def addString(b: StringBuilder, sep: String): StringBuilder
15.  def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
16.  def aggregate[B](z: ⇒ B)(seqop: (B, T) ⇒ B, combop: (B, B) ⇒ B): B
17.  def apply(i: Int): T
18.  final def asInstanceOf[T0]: T0
19.  def canEqual(that: Any): Boolean
20.  def clone(): Array[T]
21.  def collect[B](pf: PartialFunction[A, B]): Array[B]
22.  def collectFirst[B](pf: PartialFunction[T, B]): Option[B]
23.  def combinations(n: Int): collection.Iterator[Array[T]]
24.  def contains[A1 >: A](elem: A1): Boolean
25.  def containsSlice[B](that: GenSeq[B]): Boolean
26.  def copyToArray(xs: Array[A], start: Int, len: Int): Unit
27.  def copyToArray(xs: Array[A]): Unit
28.  def copyToArray(xs: Array[A], start: Int): Unit
29.  def copyToBuffer[B >: A](dest: Buffer[B]): Unit
30.  def corresponds[B](that: GenSeq[B])(p: (T, B) ⇒ Boolean): Boolean
31.  def count(p: (T) ⇒ Boolean): Int
32.  def deep: collection.IndexedSeq[Any]
33.  def diff(that: collection.Seq[T]): Array[T]
34.  def distinct: Array[T]
35.  def drop(n: Int): Array[T]
36.  def dropRight(n: Int): Array[T]
37.  def dropWhile(p: (T) ⇒ Boolean): Array[T]
38.  def endsWith[B](that: GenSeq[B]): Boolean
39.  def ensuring(cond: (Array[T]) ⇒ Boolean, msg: ⇒ Any): Array[T]
40.  def ensuring(cond: (Array[T]) ⇒ Boolean): Array[T]
41.  def ensuring(cond: Boolean, msg: ⇒ Any): Array[T]
42.  def ensuring(cond: Boolean): Array[T]
43.  final def eq(arg0: AnyRef): Boolean
44.  def equals(arg0: Any): Boolean
45.  def exists(p: (T) ⇒ Boolean): Boolean
46.  def filter(p: (T) ⇒ Boolean): Array[T]
47.  def filterNot(p: (T) ⇒ Boolean): Array[T]
48.  def finalize(): Unit
49.  def find(p: (T) ⇒ Boolean): Option[T]
50.  def flatMap[B](f: (A) ⇒ GenTraversableOnce[B]): Array[B]
51.  def flatten[U](implicit asTrav: (T) ⇒ collection.Traversable[U], m: ClassTag[U]): Array[U]
52.  def fold[A1 >: A](z: A1)(op: (A1, A1) ⇒ A1): A1
53.  def foldLeft[B](z: B)(op: (B, T) ⇒ B): B
54.  def foldRight[B](z: B)(op: (T, B) ⇒ B): B
55.  def forall(p: (T) ⇒ Boolean): Boolean
56.  def foreach(f: (A) ⇒ Unit): Unit
57.  def formatted(fmtstr: String): String
58.  final def getClass(): Class[_]
59.  def groupBy[K](f: (T) ⇒ K): Map[K, Array[T]]
60.  def grouped(size: Int): collection.Iterator[Array[T]]
61.  def hasDefiniteSize: Boolean
62.  def hashCode(): Int
63.  def head: T
64.  def headOption: Option[T]
65.  def indexOf(elem: T, from: Int): Int
66.  def indexOf(elem: T): Int
67.  def indexOfSlice[B >: A](that: GenSeq[B], from: Int): Int
68.  def indexOfSlice[B >: A](that: GenSeq[B]): Int
69.  def indexWhere(p: (T) ⇒ Boolean, from: Int): Int
70.  def indexWhere(p: (T) ⇒ Boolean): Int
71.  def indices: collection.immutable.Range
72.  def init: Array[T]
73.  def inits: collection.Iterator[Array[T]]
74.  def intersect(that: collection.Seq[T]): Array[T]
75.  def isDefinedAt(idx: Int): Boolean
76.  def isEmpty: Boolean
77.  final def isInstanceOf[T0]: Boolean
78.  final def isTraversableAgain: Boolean
79.  def iterator: collection.Iterator[T]
80.  def last: T
81.  def lastIndexOf(elem: T, end: Int): Int
82.  def lastIndexOf(elem: T): Int
83.  def lastIndexOfSlice[B >: A](that: GenSeq[B], end: Int): Int
84.  def lastIndexOfSlice[B >: A](that: GenSeq[B]): Int
85.  def lastIndexWhere(p: (T) ⇒ Boolean, end: Int): Int
86.  def lastIndexWhere(p: (T) ⇒ Boolean): Int
87.  def lastOption: Option[T]
88.  def length: Int
89.  def lengthCompare(len: Int): Int
90.  def map[B](f: (A) ⇒ B): Array[B]
91.  def max: A
92.  def maxBy[B](f: (A) ⇒ B): A
93.  def min: A
94.  def minBy[B](f: (A) ⇒ B): A
95.  def mkString: String
96.  def mkString(sep: String): String
97.  def mkString(start: String, sep: String, end: String): String
98.  final def ne(arg0: AnyRef): Boolean
99.  def nonEmpty: Boolean
100.  final def notify(): Unit
101.  final def notifyAll(): Unit
102.  def padTo(len: Int, elem: A): Array[A]
103.  def par: ParArray[T]
104.  def partition(p: (T) ⇒ Boolean): (Array[T], Array[T])
105.  def patch(from: Int, that: GenSeq[A], replaced: Int): Array[A]
106.  def permutations: collection.Iterator[Array[T]]
107.  def prefixLength(p: (T) ⇒ Boolean): Int
108.  def product: A
109.  def reduce[A1 >: A](op: (A1, A1) ⇒ A1): A1
110.  def reduceLeft[B >: A](op: (B, T) ⇒ B): B
111.  def reduceLeftOption[B >: A](op: (B, T) ⇒ B): Option[B]
112.  def reduceOption[A1 >: A](op: (A1, A1) ⇒ A1): Option[A1]
113.  def reduceRight[B >: A](op: (T, B) ⇒ B): B
114.  def reduceRightOption[B >: A](op: (T, B) ⇒ B): Option[B]
115.  def repr: Array[T]
116.  def reverse: Array[T]
117.  def reverseIterator: collection.Iterator[T]
118.  def reverseMap[B](f: (A) ⇒ B): Array[B]
119.  def sameElements(that: GenIterable[A]): Boolean
120.  def scan[B >: A, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Array[T], B, That]): That
121.  def scanLeft[B, That](z: B)(op: (B, T) ⇒ B)(implicit bf: CanBuildFrom[Array[T], B, That]): That
122.  def scanRight[B, That](z: B)(op: (T, B) ⇒ B)(implicit bf: CanBuildFrom[Array[T], B, That]): That
123.  def segmentLength(p: (T) ⇒ Boolean, from: Int): Int
124.  def seq: collection.mutable.IndexedSeq[T]
125.  def size: Int
126.  def slice(from: Int, until: Int): Array[T]
127.  def sliding(size: Int, step: Int): collection.Iterator[Array[T]]
128.  def sliding(size: Int): collection.Iterator[Array[T]]
129.  def sortBy[B](f: (T) ⇒ B)(implicit ord: math.Ordering[B]): Array[T]
130.  def sortWith(lt: (T, T) ⇒ Boolean): Array[T]
131.  def sorted[B >: A](implicit ord: math.Ordering[B]): Array[T]
132.  def span(p: (T) ⇒ Boolean): (Array[T], Array[T])
133.  def splitAt(n: Int): (Array[T], Array[T])
134.  def startsWith[B](that: GenSeq[B], offset: Int): Boolean
135.  def startsWith[B](that: GenSeq[B]): Boolean
136.  def stringPrefix: String
137.  def sum: A
138.  final def synchronized[T0](arg0: ⇒ T0): T0
139.  def tail: Array[T]
140.  def tails: collection.Iterator[Array[T]]
141.  def take(n: Int): Array[T]
142.  def takeRight(n: Int): Array[T]
143.  def takeWhile(p: (T) ⇒ Boolean): Array[T]
144.  def to[Col[_]]: Col[A]
145.  def toArray: Array[A]
146.  def toBuffer[A1 >: A]: Buffer[A1]
147.  def toIndexedSeq: collection.immutable.IndexedSeq[T]
148.  def toIterable: collection.Iterable[T]
149.  def toIterator: collection.Iterator[T]
150.  def toList: List[T]
151.  def toMap[T, U]: Map[T, U]
152.  def toSeq: collection.Seq[T]
153.  def toSet[B >: A]: Set[B]
154.  def toStream: collection.immutable.Stream[T]
155.  def toString(): String
156.  def toTraversable: collection.Traversable[T]
157.  def toVector: Vector[T]
158.  def transpose[U](implicit asArray: (T) ⇒ Array[U]): Array[Array[U]]
159.  def union(that: collection.Seq[T]): Array[T]
160.  def unzip[T1, T2](implicit asPair: (T) ⇒ (T1, T2), ct1: ClassTag[T1], ct2: ClassTag[T2]): (Array[T1], Array[T2])
161.  def unzip3[T1, T2, T3](implicit asTriple: (T) ⇒ (T1, T2, T3), ct1: ClassTag[T1], ct2: ClassTag[T2], ct3: ClassTag[T3]): (Array[T1], Array[T2], Array[T3])
162.  def update(i: Int, x: T): Unit
163.  def updated(index: Int, elem: A): Array[A]
164.  def view(from: Int, until: Int): IndexedSeqView[T, Array[T]]
165.  def view: IndexedSeqView[T, Array[T]]
166.  final def wait(): Unit
167.  final def wait(arg0: Long, arg1: Int): Unit
168.  final def wait(arg0: Long): Unit
169.  def withFilter(p: (T) ⇒ Boolean): FilterMonadic[T, Array[T]]
170.  def zip[B](that: GenIterable[B]): Array[(A, B)]
171.  def zipAll[B](that: collection.Iterable[B], thisElem: A, thatElem: B): Array[(A, B)]
172.  def zipWithIndex: Array[(A, Int)]
173.  def →[B](y: B): (Array[T], B)

1.  def /:[B](z: B)(op: (B, T) ⇒ B): B
2.  def :\[B](z: B)(op: (T, B) ⇒ B): B

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