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

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

Scala Standard Library 2.13.2 - scala.collection.immutable.Vector



1. Alphabetic
2. By Inheritance

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

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

1.  def length(): Int
2.  def toString(): String

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[[_]Vector[_]]
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 hasDefiniteSize: Boolean
21.  def isEmpty: Boolean
22.  def map[B](f: (A) => B): IterableOnce[B]
23.  def max(implicit ord: math.Ordering[A]): A
24.  def maxBy[B](f: (A) => B)(implicit cmp: math.Ordering[B]): A
25.  def min(implicit ord: math.Ordering[A]): A
26.  def minBy[B](f: (A) => B)(implicit cmp: math.Ordering[B]): A
27.  def mkString: String
28.  def mkString(sep: String): String
29.  def mkString(start: String, sep: String, end: String): String
30.  def nonEmpty: Boolean
31.  final def prefixLength(p: (A) => Boolean): Int
32.  def product(implicit num: math.Numeric[A]): A
33.  def reduce(f: (A, A) => A): A
34.  def reduceLeft(f: (A, A) => A): A
35.  def reduceLeftOption(f: (A, A) => A): Option[A]
36.  def reduceOption(f: (A, A) => A): Option[A]
37.  def reduceRight(f: (A, A) => A): A
38.  def reduceRightOption(f: (A, A) => A): Option[A]
39.  final def repr: Vector[A]
40.  def reverseMap[B](f: (A) => B): Vector[B]
41.  def sameElements[B >: A](that: IterableOnce[B]): Boolean
42.  def seq: Vector.this.type
43.  def size: Int
44.  def sum(implicit num: math.Numeric[A]): A
45.  def to[C1](factory: Factory[A, C1]): C1
46.  def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
47.  def toBuffer[B >: A]: Buffer[B]
48.  def toIndexedSeq: collection.IndexedSeq[A]
49.  final def toIterable: collection.Iterable[A]
50.  def toIterator: Iterator[A]
51.  final def toIterator: Iterator[A]
52.  def toList: List[A]
53.  def toMap[K, V](implicit ev: <:<[A, (K, V)]): Map[K, V]
54.  def toSeq: Seq[A]
55.  def toSet[B >: A]: Set[B]
56.  def toStream: Stream[A]
57.  final def toStream: Stream[A]
58.  final def toTraversable: collection.Traversable[A]
59.  final def toTraversable: collection.Traversable[A]
60.  def toVector: Vector[A]
61.  final def union[B >: A](that: collection.Seq[B]): Vector[B]
62.  def view(from: Int, until: Int): IndexedSeqView[A]
63.  def withFilter(f: (A) => Boolean): Iterator[A]
64.  def →[B](y: B): (Vector[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