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

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

Scala Standard Library 2.13.10 - scala.collection.immutable.List



1. Alphabetic
2. By Inheritance

1. List
2. DefaultSerializable
3. Serializable
4. StrictOptimizedSeqOps
5. StrictOptimizedLinearSeqOps
6. StrictOptimizedSeqOps
7. StrictOptimizedIterableOps
8. LinearSeq
9. LinearSeqOps
10. LinearSeq
11. LinearSeqOps
12. AbstractSeq
13. Seq
14. SeqOps
15. Iterable
16. AbstractSeq
17. Seq
18. Equals
19. SeqOps
20. PartialFunction
21. Function1
22. AbstractIterable
23. Iterable
24. IterableFactoryDefaults
25. IterableOps
26. IterableOnceOps
27. IterableOnce
28. AnyRef
29. Any

1. by UnliftOps
2. by iterableOnceExtensionMethods
3. by any2stringadd
4. by StringFormat
5. by Ensuring
6. by ArrowAssoc

1. Public
2. Protected

1.  final def !=(arg0: Any): Boolean
2.  final def ##: Int
3.  def +(other: String): String
4.  final def ++[B >: A](suffix: IterableOnce[B]): List[B]
5.  final def ++:[B >: A](prefix: IterableOnce[B]): List[B]
6.  final def +:[B >: A](elem: B): List[B]
7.  def ->[B](y: B): (List[A], B)
8.  final def :+[B >: A](elem: B): List[B]
9.  final def :++[B >: A](suffix: IterableOnce[B]): List[B]
10.  def ::[B >: A](elem: B): List[B]
11.  def :::[B >: A](prefix: List[B]): List[B]
12.  final def ==(arg0: Any): Boolean
13.  final def addString(b: mutable.StringBuilder): b.type
14.  final def addString(b: mutable.StringBuilder, sep: String): b.type
15.  def addString(b: mutable.StringBuilder, start: String, sep: String, end: String): b.type
16.  def andThen[C](k: PartialFunction[A, C]): PartialFunction[Int, C]
17.  def andThen[C](k: (A) => C): PartialFunction[Int, C]
18.  def appended[B >: A](elem: B): List[B]
19.  def appendedAll[B >: A](suffix: IterableOnce[B]): List[B]
20.  def apply(n: Int): A
21.  def applyOrElse[A1 <: Int, B1 >: A](x: A1, default: (A1) => B1): B1
22.  final def asInstanceOf[T0]: T0
23.  def canEqual(that: Any): Boolean
24.  def className: String
25.  def clone(): AnyRef
26.  final def coll: List.this.type
27.  final def collect[B](pf: PartialFunction[A, B]): List[B]
28.  def collectFirst[B](pf: PartialFunction[A, B]): Option[B]
29.  def combinations(n: Int): Iterator[List[A]]
30.  def compose[R](k: PartialFunction[R, Int]): PartialFunction[R, A]
31.  def compose[A](g: (A) => Int): (A) => A
32.  final def concat[B >: A](suffix: IterableOnce[B]): List[B]
33.  final def contains[A1 >: A](elem: A1): Boolean
34.  def containsSlice[B >: A](that: collection.Seq[B]): Boolean
35.  def copyToArray[B >: A](xs: Array[B], start: Int, len: Int): Int
36.  def copyToArray[B >: A](xs: Array[B], start: Int): Int
37.  def copyToArray[B >: A](xs: Array[B]): Int
38.  def corresponds[B](that: collection.Seq[B])(p: (A, B) => Boolean): Boolean
39.  def corresponds[B](that: IterableOnce[B])(p: (A, B) => Boolean): Boolean
40.  def count(p: (A) => Boolean): Int
41.  def diff[B >: A](that: collection.Seq[B]): List[A]
42.  def distinct: List[A]
43.  def distinctBy[B](f: (A) => B): List[A]
44.  def drop(n: Int): List[A]
45.  def dropRight(n: Int): List[A]
46.  def dropWhile(p: (A) => Boolean): List[A]
47.  def elementWise: ElementWiseExtractor[Int, A]
48.  def empty: List[A]
49.  def endsWith[B >: A](that: collection.Iterable[B]): Boolean
50.  def ensuring(cond: (List[A]) => Boolean, msg: => Any): List[A]
51.  def ensuring(cond: (List[A]) => Boolean): List[A]
52.  def ensuring(cond: Boolean, msg: => Any): List[A]
53.  def ensuring(cond: Boolean): List[A]
54.  final def eq(arg0: AnyRef): Boolean
55.  def equals(o: Any): Boolean
56.  final def exists(p: (A) => Boolean): Boolean
57.  def filter(p: (A) => Boolean): List[A]
58.  def filterImpl(pred: (A) => Boolean, isFlipped: Boolean): List[A]
59.  def filterNot(p: (A) => Boolean): List[A]
60.  def finalize(): Unit
61.  final def find(p: (A) => Boolean): Option[A]
62.  def findLast(p: (A) => Boolean): Option[A]
63.  final def flatMap[B](f: (A) => IterableOnce[B]): List[B]
64.  def flatten[B](implicit toIterableOnce: (A) => IterableOnce[B]): List[B]
65.  def fold[A1 >: A](z: A1)(op: (A1, A1) => A1): A1
66.  def foldLeft[B](z: B)(op: (B, A) => B): B
67.  final def foldRight[B](z: B)(op: (A, B) => B): B
68.  final def forall(p: (A) => Boolean): Boolean
69.  final def foreach[U](f: (A) => U): Unit
70.  def fromSpecific(coll: IterableOnce[A]): List[A]
71.  final def getClass(): Class[_ <: AnyRef]
72.  def groupBy[K](f: (A) => K): Map[K, List[A]]
73.  def groupMap[K, B](key: (A) => K)(f: (A) => B): Map[K, List[B]]
74.  def groupMapReduce[K, B](key: (A) => K)(f: (A) => B)(reduce: (B, B) => B): Map[K, B]
75.  def grouped(size: Int): Iterator[List[A]]
76.  def hashCode(): Int
77.  def head: A
78.  def headOption: Option[A]
79.  def indexOf[B >: A](elem: B): Int
80.  def indexOf[B >: A](elem: B, from: Int): Int
81.  def indexOfSlice[B >: A](that: collection.Seq[B]): Int
82.  def indexOfSlice[B >: A](that: collection.Seq[B], from: Int): Int
83.  def indexWhere(p: (A) => Boolean, from: Int): Int
84.  def indexWhere(p: (A) => Boolean): Int
85.  def indices: Range
86.  def init: List[A]
87.  def inits: Iterator[List[A]]
88.  def intersect[B >: A](that: collection.Seq[B]): List[A]
89.  def isDefinedAt(x: Int): Boolean
90.  final def isEmpty: Boolean
91.  final def isInstanceOf[T0]: Boolean
92.  def isTraversableAgain: Boolean
93.  def iterableFactory: SeqFactory[List]
94.  def iterator: Iterator[A]
95.  def knownSize: Int
96.  def last: A
97.  def lastIndexOf[B >: A](elem: B, end: Int = length - 1): Int
98.  def lastIndexOfSlice[B >: A](that: collection.Seq[B]): Int
99.  def lastIndexOfSlice[B >: A](that: collection.Seq[B], end: Int): Int
100.  def lastIndexWhere(p: (A) => Boolean, end: Int): Int
101.  def lastIndexWhere(p: (A) => Boolean): Int
102.  def lastOption: Option[A]
103.  def lazyZip[B](that: collection.Iterable[B]): LazyZip2[A, B, List.this.type]
104.  final def length: Int
105.  final def lengthCompare(len: Int): Int
106.  def lengthCompare(that: collection.Iterable[_]): Int
107.  final def lengthIs: SizeCompareOps
108.  def lift: (Int) => Option[A]
109.  final def map[B](f: (A) => B): List[B]
110.  final def mapConserve[B >: A <: AnyRef](f: (A) => B): List[B]
111.  def max[B >: A](implicit ord: math.Ordering[B]): A
112.  def maxBy[B](f: (A) => B)(implicit cmp: math.Ordering[B]): A
113.  def maxByOption[B](f: (A) => B)(implicit cmp: math.Ordering[B]): Option[A]
114.  def maxOption[B >: A](implicit ord: math.Ordering[B]): Option[A]
115.  def min[B >: A](implicit ord: math.Ordering[B]): A
116.  def minBy[B](f: (A) => B)(implicit cmp: math.Ordering[B]): A
117.  def minByOption[B](f: (A) => B)(implicit cmp: math.Ordering[B]): Option[A]
118.  def minOption[B >: A](implicit ord: math.Ordering[B]): Option[A]
119.  final def mkString: String
120.  final def mkString(sep: String): String
121.  final def mkString(start: String, sep: String, end: String): String
122.  final def ne(arg0: AnyRef): Boolean
123.  def newSpecificBuilder: Builder[A, List[A]]
124.  def nonEmpty: Boolean
125.  final def notify(): Unit
126.  final def notifyAll(): Unit
127.  def occCounts[B](sq: collection.Seq[B]): mutable.Map[B, Int]
128.  def orElse[A1 <: Int, B1 >: A](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
129.  def padTo[B >: A](len: Int, elem: B): List[B]
130.  def partition(p: (A) => Boolean): (List[A], List[A])
131.  def partitionMap[A1, A2](f: (A) => Either[A1, A2]): (List[A1], List[A2])
132.  def patch[B >: A](from: Int, other: IterableOnce[B], replaced: Int): List[B]
133.  def permutations: Iterator[List[A]]
134.  def prepended[B >: A](elem: B): List[B]
135.  def prependedAll[B >: A](prefix: IterableOnce[B]): List[B]
136.  def product[B >: A](implicit num: math.Numeric[B]): B
137.  def reduce[B >: A](op: (B, B) => B): B
138.  def reduceLeft[B >: A](op: (B, A) => B): B
139.  def reduceLeftOption[B >: A](op: (B, A) => B): Option[B]
140.  def reduceOption[B >: A](op: (B, B) => B): Option[B]
141.  def reduceRight[B >: A](op: (A, B) => B): B
142.  def reduceRightOption[B >: A](op: (A, B) => B): Option[B]
143.  final def reverse: List[A]
144.  def reverseIterator: Iterator[A]
145.  def reverse_:::[B >: A](prefix: List[B]): List[B]
146.  def reversed: collection.Iterable[A]
147.  def runWith[U](action: (A) => U): (Int) => Boolean
148.  def sameElements[B >: A](that: IterableOnce[B]): Boolean
149.  def scan[B >: A](z: B)(op: (B, B) => B): List[B]
150.  def scanLeft[B](z: B)(op: (B, A) => B): List[B]
151.  def scanRight[B](z: B)(op: (A, B) => B): List[B]
152.  def search[B >: A](elem: B, from: Int, to: Int)(implicit ord: Ordering[B]): SearchResult
153.  def search[B >: A](elem: B)(implicit ord: Ordering[B]): SearchResult
154.  def segmentLength(p: (A) => Boolean, from: Int): Int
155.  final def segmentLength(p: (A) => Boolean): Int
156.  final def size: Int
157.  final def sizeCompare(that: collection.Iterable[_]): Int
158.  final def sizeCompare(otherSize: Int): Int
159.  final def sizeIs: SizeCompareOps
160.  def slice(from: Int, until: Int): List[A]
161.  def sliding(size: Int, step: Int): Iterator[List[A]]
162.  def sliding(size: Int): Iterator[List[A]]
163.  def sortBy[B](f: (A) => B)(implicit ord: Ordering[B]): List[A]
164.  def sortWith(lt: (A, A) => Boolean): List[A]
165.  def sorted[B >: A](implicit ord: Ordering[B]): List[A]
166.  final def span(p: (A) => Boolean): (List[A], List[A])
167.  def splitAt(n: Int): (List[A], List[A])
168.  def startsWith[B >: A](that: IterableOnce[B], offset: Int = 0): Boolean
169.  def stepper[S <: Stepper[_]](implicit shape: StepperShape[A, S]): S
170.  final def strictOptimizedCollect[B, C2](b: Builder[B, C2], pf: PartialFunction[A, B]): C2
171.  final def strictOptimizedConcat[B >: A, C2](that: IterableOnce[B], b: Builder[B, C2]): C2
172.  final def strictOptimizedFlatMap[B, C2](b: Builder[B, C2], f: (A) => IterableOnce[B]): C2
173.  final def strictOptimizedFlatten[B, C2](b: Builder[B, C2])(implicit toIterableOnce: (A) => IterableOnce[B]): C2
174.  final def strictOptimizedMap[B, C2](b: Builder[B, C2], f: (A) => B): C2
175.  final def strictOptimizedZip[B, C2](that: IterableOnce[B], b: Builder[(A, B), C2]): C2
176.  def stringPrefix: String
177.  def sum[B >: A](implicit num: math.Numeric[B]): B
178.  final def synchronized[T0](arg0: => T0): T0
179.  def tail: List[A]
180.  def tails: Iterator[List[A]]
181.  def take(n: Int): List[A]
182.  def takeRight(n: Int): List[A]
183.  final def takeWhile(p: (A) => Boolean): List[A]
184.  def tapEach[U](f: (A) => U): List[A]
185.  def to[C1](factory: Factory[A, C1]): C1
186.  def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
187.  final def toBuffer[B >: A]: Buffer[B]
188.  def toIndexedSeq: IndexedSeq[A]
189.  final def toList: List[A]
190.  def toMap[K, V](implicit ev: <:<[A, (K, V)]): Map[K, V]
191.  final def toSeq: List.this.type
192.  def toSet[B >: A]: Set[B]
193.  def toString(): String
194.  def toVector: Vector[A]
195.  def transpose[B](implicit asIterable: (A) => collection.Iterable[B]): List[List[B]]
196.  def unapply(a: Int): Option[A]
197.  def unlift: PartialFunction[Int, B]
198.  def unzip[A1, A2](implicit asPair: (A) => (A1, A2)): (List[A1], List[A2])
199.  def unzip3[A1, A2, A3](implicit asTriple: (A) => (A1, A2, A3)): (List[A1], List[A2], List[A3])
200.  def updated[B >: A](index: Int, elem: B): List[B]
201.  def view: SeqView[A]
202.  final def wait(): Unit
203.  final def wait(arg0: Long, arg1: Int): Unit
204.  final def wait(arg0: Long): Unit
205.  def withFilter(p: (A) => Boolean): WithFilter[A, [_]List[_]]
206.  def writeReplace(): AnyRef
207.  def zip[B](that: IterableOnce[B]): List[(A, B)]
208.  def zipAll[A1 >: A, B](that: collection.Iterable[B], thisElem: A1, thatElem: B): List[(A1, B)]
209.  def zipWithIndex: List[(A, Int)]

1.  def /:[B](z: B)(op: (B, A) => B): B
2.  final def /:[B](z: B)(op: (B, A) => B): B
3.  def :\[B](z: B)(op: (A, B) => B): B
4.  final def :\[B](z: B)(op: (A, B) => B): B
5.  def aggregate[B](z: => B)(seqop: (B, A) => B, combop: (B, B) => B): B
6.  def collectFirst[B](f: PartialFunction[A, B]): Option[B]
7.  def companion: IterableFactory[[_]List[_]]
8.  def copyToBuffer(dest: Buffer[A]): Unit
9.  final def copyToBuffer[B >: A](dest: Buffer[B]): Unit
10.  def count(f: (A) => Boolean): Int
11.  def exists(f: (A) => Boolean): Boolean
12.  def filter(f: (A) => Boolean): Iterator[A]
13.  def find(p: (A) => Boolean): Option[A]
14.  def flatMap[B](f: (A) => IterableOnce[B]): IterableOnce[B]
15.  def fold[A1 >: A](z: A1)(op: (A1, A1) => A1): A1
16.  def foldLeft[B](z: B)(op: (B, A) => B): B
17.  def foldRight[B](z: B)(op: (A, B) => B): B
18.  def forall(f: (A) => Boolean): Boolean
19.  def foreach[U](f: (A) => U): Unit
20.  def formatted(fmtstr: String): String
21.  def hasDefiniteSize: Boolean
22.  def isEmpty: Boolean
23.  def map[B](f: (A) => B): IterableOnce[B]
24.  def max(implicit ord: math.Ordering[A]): A
25.  def maxBy[B](f: (A) => B)(implicit cmp: math.Ordering[B]): A
26.  def min(implicit ord: math.Ordering[A]): A
27.  def minBy[B](f: (A) => B)(implicit cmp: math.Ordering[B]): A
28.  def mkString: String
29.  def mkString(sep: String): String
30.  def mkString(start: String, sep: String, end: String): String
31.  def nonEmpty: Boolean
32.  final def prefixLength(p: (A) => Boolean): Int
33.  def product(implicit num: math.Numeric[A]): A
34.  def reduce(f: (A, A) => A): A
35.  def reduceLeft(f: (A, A) => A): A
36.  def reduceLeftOption(f: (A, A) => A): Option[A]
37.  def reduceOption(f: (A, A) => A): Option[A]
38.  def reduceRight(f: (A, A) => A): A
39.  def reduceRightOption(f: (A, A) => A): Option[A]
40.  final def repr: List[A]
41.  def reverseMap[B](f: (A) => B): List[B]
42.  def sameElements[B >: A](that: IterableOnce[B]): Boolean
43.  def seq: List.this.type
44.  def size: Int
45.  def sum(implicit num: math.Numeric[A]): A
46.  def to[C1](factory: Factory[A, C1]): C1
47.  def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
48.  def toBuffer[B >: A]: Buffer[B]
49.  def toIndexedSeq: collection.IndexedSeq[A]
50.  final def toIterable: collection.Iterable[A]
51.  final def toIterable: List.this.type
52.  def toIterator: Iterator[A]
53.  final def toIterator: Iterator[A]
54.  def toList: List[A]
55.  def toMap[K, V](implicit ev: <:<[A, (K, V)]): Map[K, V]
56.  def toSeq: Seq[A]
57.  def toSet[B >: A]: Set[B]
58.  def toStream: Stream[A]
59.  final def toStream: Stream[A]
60.  final def toTraversable: collection.Traversable[A]
61.  final def toTraversable: collection.Traversable[A]
62.  def toVector: Vector[A]
63.  final def union[B >: A](that: collection.Seq[B]): List[B]
64.  def view(from: Int, until: Int): View[A]
65.  def withFilter(f: (A) => Boolean): Iterator[A]
66.  def →[B](y: B): (List[A], 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