A RetroSearch Logo

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

Search Query:

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

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

sealed abstract class Vector[+A] extends AbstractSeq[A] with IndexedSeq[A] with IndexedSeqOps[A, Vector, Vector[A]] with StrictOptimizedSeqOps[A, Vector, Vector[A]] with IterableFactoryDefaults[A, Vector] with DefaultSerializable



Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  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
Implicitly
  1. by UnliftOps
  2. by iterableOnceExtensionMethods
  3. by any2stringadd
  4. by StringFormat
  5. by Ensuring
  6. by ArrowAssoc
Visibility
  1. Public
  2. Protected
Concrete Value Members
  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 className: String
  24.  def clone(): AnyRef
  25.  final def coll: Vector.this.type
  26.  def collect[B](pf: PartialFunction[A, B]): Vector[B]
  27.  def collectFirst[B](pf: PartialFunction[A, B]): Option[B]
  28.  def combinations(n: Int): Iterator[Vector[A]]
  29.  def compose[R](k: PartialFunction[R, Int]): PartialFunction[R, A]
  30.  def compose[A](g: (A) => Int): (A) => A
  31.  final def concat[B >: A](suffix: IterableOnce[B]): Vector[B]
  32.  def contains[A1 >: A](elem: A1): Boolean
  33.  def containsSlice[B >: A](that: collection.Seq[B]): Boolean
  34.  def copyToArray[B >: A](xs: Array[B], start: Int, len: Int): Int
  35.  def copyToArray[B >: A](xs: Array[B], start: Int): Int
  36.  def copyToArray[B >: A](xs: Array[B]): Int
  37.  def corresponds[B](that: collection.Seq[B])(p: (A, B) => Boolean): Boolean
  38.  def corresponds[B](that: IterableOnce[B])(p: (A, B) => Boolean): Boolean
  39.  def count(p: (A) => Boolean): Int
  40.  def diff[B >: A](that: collection.Seq[B]): Vector[A]
  41.  def distinct: Vector[A]
  42.  def distinctBy[B](f: (A) => B): Vector[A]
  43.  final def drop(n: Int): Vector[A]
  44.  final def dropRight(n: Int): Vector[A]
  45.  def dropWhile(p: (A) => Boolean): Vector[A]
  46.  def elementWise: ElementWiseExtractor[Int, A]
  47.  def empty: Vector[A]
  48.  def endsWith[B >: A](that: collection.Iterable[B]): Boolean
  49.  def ensuring(cond: (Vector[A]) => Boolean, msg: => Any): Vector[A]
  50.  def ensuring(cond: (Vector[A]) => Boolean): Vector[A]
  51.  def ensuring(cond: Boolean, msg: => Any): Vector[A]
  52.  def ensuring(cond: Boolean): Vector[A]
  53.  final def eq(arg0: AnyRef): Boolean
  54.  def equals(o: Any): Boolean
  55.  def exists(p: (A) => Boolean): Boolean
  56.  def filter(pred: (A) => Boolean): Vector[A]
  57.  final def filterImpl(pred: (A) => Boolean, isFlipped: Boolean): Vector[A]
  58.  def filterNot(pred: (A) => Boolean): Vector[A]
  59.  def finalize(): Unit
  60.  def find(p: (A) => Boolean): Option[A]
  61.  def findLast(p: (A) => Boolean): Option[A]
  62.  def flatMap[B](f: (A) => IterableOnce[B]): Vector[B]
  63.  def flatten[B](implicit toIterableOnce: (A) => IterableOnce[B]): Vector[B]
  64.  def fold[A1 >: A](z: A1)(op: (A1, A1) => A1): A1
  65.  def foldLeft[B](z: B)(op: (B, A) => B): B
  66.  def foldRight[B](z: B)(op: (A, B) => B): B
  67.  def forall(p: (A) => Boolean): Boolean
  68.  final def foreach[U](f: (A) => U): Unit
  69.  def formatted(fmtstr: String): String
  70.  def fromSpecific(coll: IterableOnce[A]): Vector[A]
  71.  final def getClass(): Class[_ <: AnyRef]
  72.  def groupBy[K](f: (A) => K): Map[K, Vector[A]]
  73.  def groupMap[K, B](key: (A) => K)(f: (A) => B): Map[K, Vector[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[Vector[A]]
  76.  def hashCode(): Int
  77.  final 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): Int
  84.  def indexWhere(p: (A) => Boolean, from: Int): Int
  85.  def indices: Range
  86.  def init: Vector[A]
  87.  def inits: Iterator[Vector[A]]
  88.  def intersect[B >: A](that: collection.Seq[B]): Vector[A]
  89.  def ioob(index: Int): IndexOutOfBoundsException
  90.  def isDefinedAt(idx: Int): Boolean
  91.  def isEmpty: Boolean
  92.  final def isInstanceOf[T0]: Boolean
  93.  def isTraversableAgain: Boolean
  94.  def iterableFactory: SeqFactory[Vector]
  95.  final def iterator: Iterator[A]
  96.  def knownSize: Int
  97.  final def last: A
  98.  def lastIndexOf[B >: A](elem: B, end: Int = length - 1): Int
  99.  def lastIndexOfSlice[B >: A](that: collection.Seq[B]): Int
  100.  def lastIndexOfSlice[B >: A](that: collection.Seq[B], end: Int): Int
  101.  def lastIndexWhere(p: (A) => Boolean): Int
  102.  def lastIndexWhere(p: (A) => Boolean, end: Int): Int
  103.  def lastOption: Option[A]
  104.  def lazyZip[B](that: collection.Iterable[B]): LazyZip2[A, B, Vector.this.type]
  105.  final def length: Int
  106.  final def lengthCompare(that: collection.Iterable[_]): Int
  107.  final def lengthCompare(len: Int): Int
  108.  final def lengthIs: SizeCompareOps
  109.  def lift: (Int) => Option[A]
  110.  def map[B](f: (A) => B): Vector[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, Vector[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): Vector[B]
  130.  def partition(p: (A) => Boolean): (Vector[A], Vector[A])
  131.  def partitionMap[A1, A2](f: (A) => Either[A1, A2]): (Vector[A1], Vector[A2])
  132.  def patch[B >: A](from: Int, other: IterableOnce[B], replaced: Int): Vector[B]
  133.  def permutations: Iterator[Vector[A]]
  134.  def prepended[B >: A](elem: B): Vector[B]
  135.  def prependedAll[B >: A](prefix: IterableOnce[B]): Vector[B]
  136.  def prependedAll0[B >: A](prefix: IterableOnce[B], k: Int): Vector[B]
  137.  def product[B >: A](implicit num: math.Numeric[B]): B
  138.  def reduce[B >: A](op: (B, B) => B): B
  139.  def reduceLeft[B >: A](op: (B, A) => B): B
  140.  def reduceLeftOption[B >: A](op: (B, A) => B): Option[B]
  141.  def reduceOption[B >: A](op: (B, B) => B): Option[B]
  142.  def reduceRight[B >: A](op: (A, B) => B): B
  143.  def reduceRightOption[B >: A](op: (A, B) => B): Option[B]
  144.  def reverse: Vector[A]
  145.  def reverseIterator: Iterator[A]
  146.  def reversed: collection.Iterable[A]
  147.  def runWith[U](action: (A) => U): (Int) => Boolean
  148.  def sameElements[B >: A](o: IterableOnce[B]): Boolean
  149.  def scan[B >: A](z: B)(op: (B, B) => B): Vector[B]
  150.  def scanLeft[B](z: B)(op: (B, A) => B): Vector[B]
  151.  def scanRight[B](z: B)(op: (A, B) => B): Vector[B]
  152.  def search[B >: A](elem: B, from: Int, to: Int)(implicit ord: math.Ordering[B]): SearchResult
  153.  def search[B >: A](elem: B)(implicit ord: math.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): Vector[A]
  161.  def sliding(size: Int, step: Int): Iterator[Vector[A]]
  162.  def sliding(size: Int): Iterator[Vector[A]]
  163.  def sortBy[B](f: (A) => B)(implicit ord: Ordering[B]): Vector[A]
  164.  def sortWith(lt: (A, A) => Boolean): Vector[A]
  165.  def sorted[B >: A](implicit ord: Ordering[B]): Vector[A]
  166.  def span(p: (A) => Boolean): (Vector[A], Vector[A])
  167.  def splitAt(n: Int): (Vector[A], Vector[A])
  168.  def startsWith[B >: A](that: IterableOnce[B], offset: Int = 0): Boolean
  169.  def stepper[S <: Stepper[_]](implicit shape: StepperShape[A, S]): S with EfficientSplit
  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: Vector[A]
  180.  def tails: Iterator[Vector[A]]
  181.  final def take(n: Int): Vector[A]
  182.  final def takeRight(n: Int): Vector[A]
  183.  def takeWhile(p: (A) => Boolean): Vector[A]
  184.  def tapEach[U](f: (A) => U): Vector[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.  final def toIndexedSeq: IndexedSeq[A]
  189.  final def toIterable: Vector.this.type
  190.  def toList: List[A]
  191.  def toMap[K, V](implicit ev: <:<[A, (K, V)]): Map[K, V]
  192.  final def toSeq: Vector.this.type
  193.  def toSet[B >: A]: Set[B]
  194.  def toString(): String
  195.  def toVector: Vector[A]
  196.  def transpose[B](implicit asIterable: (A) => collection.Iterable[B]): Vector[Vector[B]]
  197.  def unapply(a: Int): Option[A]
  198.  def unlift: PartialFunction[Int, B]
  199.  def unzip[A1, A2](implicit asPair: (A) => (A1, A2)): (Vector[A1], Vector[A2])
  200.  def unzip3[A1, A2, A3](implicit asTriple: (A) => (A1, A2, A3)): (Vector[A1], Vector[A2], Vector[A3])
  201.  def updated[B >: A](index: Int, elem: B): Vector[B]
  202.  def view: IndexedSeqView[A]
  203.  final def wait(): Unit
  204.  final def wait(arg0: Long, arg1: Int): Unit
  205.  final def wait(arg0: Long): Unit
  206.  def withFilter(p: (A) => Boolean): WithFilter[A, [_]Vector[_]]
  207.  def writeReplace(): AnyRef
  208.  def zip[B](that: IterableOnce[B]): Vector[(A, B)]
  209.  def zipAll[A1 >: A, B](that: collection.Iterable[B], thisElem: A1, thatElem: B): Vector[(A1, B)]
  210.  def zipWithIndex: Vector[(A, Int)]
Deprecated Value Members
  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)
Inherited from (Int) => A

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