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.13/scala/collection/mutable/IndexedSeqOps.html below:

Scala Standard Library 2.13.13 - scala.collection.mutable.IndexedSeqOps

trait IndexedSeqOps[A, +CC[_], +C <: AnyRef] extends collection.IndexedSeqOps[A, CC, C] with SeqOps[A, CC, C]



Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. IndexedSeqOps
  2. SeqOps
  3. Cloneable
  4. Cloneable
  5. IndexedSeqOps
  6. SeqOps
  7. IterableOps
  8. IterableOnceOps
  9. IterableOnce
  10. AnyRef
  11. Any
Implicitly
  1. by iterableOnceExtensionMethods
  2. by any2stringadd
  3. by StringFormat
  4. by Ensuring
  5. 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]): CC[B]
  5.  final def ++:[B >: A](prefix: IterableOnce[B]): CC[B]
  6.  final def +:[B >: A](elem: B): CC[B]
  7.  def ->[B](y: B): (IndexedSeqOps[A, CC, C], B)
  8.  final def :+[B >: A](elem: B): CC[B]
  9.  final def :++[B >: A](suffix: IterableOnce[B]): CC[B]
  10.  final def ==(arg0: Any): Boolean
  11.  final def addString(b: StringBuilder): b.type
  12.  final def addString(b: StringBuilder, sep: String): b.type
  13.  def addString(b: StringBuilder, start: String, sep: String, end: String): b.type
  14.  def appended[B >: A](elem: B): CC[B]
  15.  def appendedAll[B >: A](suffix: IterableOnce[B]): CC[B]
  16.  final def asInstanceOf[T0]: T0
  17.  def clone(): C
  18.  def collect[B](pf: PartialFunction[A, B]): CC[B]
  19.  def collectFirst[B](pf: PartialFunction[A, B]): Option[B]
  20.  def combinations(n: Int): Iterator[C]
  21.  final def concat[B >: A](suffix: IterableOnce[B]): CC[B]
  22.  def contains[A1 >: A](elem: A1): Boolean
  23.  def containsSlice[B >: A](that: collection.Seq[B]): Boolean
  24.  def copyToArray[B >: A](xs: Array[B], start: Int, len: Int): Int
  25.  def copyToArray[B >: A](xs: Array[B], start: Int): Int
  26.  def copyToArray[B >: A](xs: Array[B]): Int
  27.  def corresponds[B](that: collection.Seq[B])(p: (A, B) => Boolean): Boolean
  28.  def corresponds[B](that: IterableOnce[B])(p: (A, B) => Boolean): Boolean
  29.  def count(p: (A) => Boolean): Int
  30.  def diff[B >: A](that: collection.Seq[B]): C
  31.  def distinct: C
  32.  def distinctBy[B](f: (A) => B): C
  33.  def drop(n: Int): C
  34.  def dropRight(n: Int): C
  35.  def dropWhile(p: (A) => Boolean): C
  36.  def empty: C
  37.  def endsWith[B >: A](that: collection.Iterable[B]): Boolean
  38.  def ensuring(cond: (IndexedSeqOps[A, CC, C]) => Boolean, msg: => Any): IndexedSeqOps[A, CC, C]
  39.  def ensuring(cond: (IndexedSeqOps[A, CC, C]) => Boolean): IndexedSeqOps[A, CC, C]
  40.  def ensuring(cond: Boolean, msg: => Any): IndexedSeqOps[A, CC, C]
  41.  def ensuring(cond: Boolean): IndexedSeqOps[A, CC, C]
  42.  final def eq(arg0: AnyRef): Boolean
  43.  def equals(arg0: AnyRef): Boolean
  44.  def exists(p: (A) => Boolean): Boolean
  45.  def filter(pred: (A) => Boolean): C
  46.  def filterNot(pred: (A) => Boolean): C
  47.  def finalize(): Unit
  48.  def find(p: (A) => Boolean): Option[A]
  49.  def findLast(p: (A) => Boolean): Option[A]
  50.  def flatMap[B](f: (A) => IterableOnce[B]): CC[B]
  51.  def flatten[B](implicit asIterable: (A) => IterableOnce[B]): CC[B]
  52.  def fold[A1 >: A](z: A1)(op: (A1, A1) => A1): A1
  53.  def foldLeft[B](z: B)(op: (B, A) => B): B
  54.  def foldRight[B](z: B)(op: (A, B) => B): B
  55.  def forall(p: (A) => Boolean): Boolean
  56.  def foreach[U](f: (A) => U): Unit
  57.  final def getClass(): Class[_ <: AnyRef]
  58.  def groupBy[K](f: (A) => K): immutable.Map[K, C]
  59.  def groupMap[K, B](key: (A) => K)(f: (A) => B): immutable.Map[K, CC[B]]
  60.  def groupMapReduce[K, B](key: (A) => K)(f: (A) => B)(reduce: (B, B) => B): immutable.Map[K, B]
  61.  def grouped(size: Int): Iterator[C]
  62.  def hashCode(): Int
  63.  def head: A
  64.  def headOption: Option[A]
  65.  def indexOf[B >: A](elem: B): Int
  66.  def indexOf[B >: A](elem: B, from: Int): Int
  67.  def indexOfSlice[B >: A](that: collection.Seq[B]): Int
  68.  def indexOfSlice[B >: A](that: collection.Seq[B], from: Int): Int
  69.  def indexWhere(p: (A) => Boolean): Int
  70.  def indexWhere(p: (A) => Boolean, from: Int): Int
  71.  def indices: immutable.Range
  72.  def init: C
  73.  def inits: Iterator[C]
  74.  def intersect[B >: A](that: collection.Seq[B]): C
  75.  def isDefinedAt(idx: Int): Boolean
  76.  def isEmpty: Boolean
  77.  final def isInstanceOf[T0]: Boolean
  78.  def isTraversableAgain: Boolean
  79.  def iterator: Iterator[A]
  80.  def knownSize: Int
  81.  def last: A
  82.  def lastIndexOf[B >: A](elem: B, end: Int = length - 1): Int
  83.  def lastIndexOfSlice[B >: A](that: collection.Seq[B]): Int
  84.  def lastIndexOfSlice[B >: A](that: collection.Seq[B], end: Int): Int
  85.  def lastIndexWhere(p: (A) => Boolean): Int
  86.  def lastIndexWhere(p: (A) => Boolean, end: Int): Int
  87.  def lastOption: Option[A]
  88.  final def lengthCompare(that: collection.Iterable[_]): Int
  89.  final def lengthCompare(len: Int): Int
  90.  final def lengthIs: SizeCompareOps
  91.  def map[B](f: (A) => B): CC[B]
  92.  def mapInPlace(f: (A) => A): IndexedSeqOps.this.type
  93.  def max[B >: A](implicit ord: math.Ordering[B]): A
  94.  def maxBy[B](f: (A) => B)(implicit ord: math.Ordering[B]): A
  95.  def maxByOption[B](f: (A) => B)(implicit ord: math.Ordering[B]): Option[A]
  96.  def maxOption[B >: A](implicit ord: math.Ordering[B]): Option[A]
  97.  def min[B >: A](implicit ord: math.Ordering[B]): A
  98.  def minBy[B](f: (A) => B)(implicit ord: math.Ordering[B]): A
  99.  def minByOption[B](f: (A) => B)(implicit ord: math.Ordering[B]): Option[A]
  100.  def minOption[B >: A](implicit ord: math.Ordering[B]): Option[A]
  101.  final def mkString: String
  102.  final def mkString(sep: String): String
  103.  final def mkString(start: String, sep: String, end: String): String
  104.  final def ne(arg0: AnyRef): Boolean
  105.  def nonEmpty: Boolean
  106.  final def notify(): Unit
  107.  final def notifyAll(): Unit
  108.  def occCounts[B](sq: collection.Seq[B]): Map[B, Int]
  109.  def padTo[B >: A](len: Int, elem: B): CC[B]
  110.  def partition(p: (A) => Boolean): (C, C)
  111.  def partitionMap[A1, A2](f: (A) => Either[A1, A2]): (CC[A1], CC[A2])
  112.  def patch[B >: A](from: Int, other: IterableOnce[B], replaced: Int): CC[B]
  113.  def permutations: Iterator[C]
  114.  def prepended[B >: A](elem: B): CC[B]
  115.  def prependedAll[B >: A](prefix: IterableOnce[B]): CC[B]
  116.  def product[B >: A](implicit num: math.Numeric[B]): B
  117.  def reduce[B >: A](op: (B, B) => B): B
  118.  def reduceLeft[B >: A](op: (B, A) => B): B
  119.  def reduceLeftOption[B >: A](op: (B, A) => B): Option[B]
  120.  def reduceOption[B >: A](op: (B, B) => B): Option[B]
  121.  def reduceRight[B >: A](op: (A, B) => B): B
  122.  def reduceRightOption[B >: A](op: (A, B) => B): Option[B]
  123.  def reverse: C
  124.  def reverseIterator: Iterator[A]
  125.  def reversed: collection.Iterable[A]
  126.  def sameElements[B >: A](that: IterableOnce[B]): Boolean
  127.  def scan[B >: A](z: B)(op: (B, B) => B): CC[B]
  128.  def scanLeft[B](z: B)(op: (B, A) => B): CC[B]
  129.  def scanRight[B](z: B)(op: (A, B) => B): CC[B]
  130.  def search[B >: A](elem: B, from: Int, to: Int)(implicit ord: math.Ordering[B]): SearchResult
  131.  def search[B >: A](elem: B)(implicit ord: math.Ordering[B]): SearchResult
  132.  def segmentLength(p: (A) => Boolean, from: Int): Int
  133.  final def segmentLength(p: (A) => Boolean): Int
  134.  final def size: Int
  135.  final def sizeCompare(that: collection.Iterable[_]): Int
  136.  final def sizeCompare(otherSize: Int): Int
  137.  final def sizeIs: SizeCompareOps
  138.  def slice(from: Int, until: Int): C
  139.  def sliding(size: Int, step: Int): Iterator[C]
  140.  def sliding(size: Int): Iterator[C]
  141.  def sortBy[B](f: (A) => B)(implicit ord: Ordering[B]): C
  142.  def sortInPlace[B >: A]()(implicit ord: Ordering[B]): IndexedSeqOps.this.type
  143.  def sortInPlaceBy[B](f: (A) => B)(implicit ord: Ordering[B]): IndexedSeqOps.this.type
  144.  def sortInPlaceWith(lt: (A, A) => Boolean): IndexedSeqOps.this.type
  145.  def sortWith(lt: (A, A) => Boolean): C
  146.  def sorted[B >: A](implicit ord: Ordering[B]): C
  147.  def span(p: (A) => Boolean): (C, C)
  148.  def splitAt(n: Int): (C, C)
  149.  def startsWith[B >: A](that: IterableOnce[B], offset: Int = 0): Boolean
  150.  def stepper[S <: Stepper[_]](implicit shape: StepperShape[A, S]): S with EfficientSplit
  151.  def sum[B >: A](implicit num: math.Numeric[B]): B
  152.  final def synchronized[T0](arg0: => T0): T0
  153.  def tail: C
  154.  def tails: Iterator[C]
  155.  def take(n: Int): C
  156.  def takeRight(n: Int): C
  157.  def takeWhile(p: (A) => Boolean): C
  158.  def tapEach[U](f: (A) => U): C
  159.  def to[C1](factory: Factory[A, C1]): C1
  160.  def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
  161.  final def toBuffer[B >: A]: Buffer[B]
  162.  def toIndexedSeq: immutable.IndexedSeq[A]
  163.  def toList: immutable.List[A]
  164.  def toMap[K, V](implicit ev: <:<[A, (K, V)]): immutable.Map[K, V]
  165.  def toSeq: immutable.Seq[A]
  166.  def toSet[B >: A]: immutable.Set[B]
  167.  def toString(): String
  168.  def toVector: immutable.Vector[A]
  169.  def transpose[B](implicit asIterable: (A) => collection.Iterable[B]): CC[CC[B]]
  170.  def unzip[A1, A2](implicit asPair: (A) => (A1, A2)): (CC[A1], CC[A2])
  171.  def unzip3[A1, A2, A3](implicit asTriple: (A) => (A1, A2, A3)): (CC[A1], CC[A2], CC[A3])
  172.  def updated[B >: A](index: Int, elem: B): CC[B]
  173.  def view: IndexedSeqView[A]
  174.  final def wait(): Unit
  175.  final def wait(arg0: Long, arg1: Int): Unit
  176.  final def wait(arg0: Long): Unit
  177.  def withFilter(p: (A) => Boolean): WithFilter[A, CC]
  178.  def zip[B](that: IterableOnce[B]): CC[(A, B)]
  179.  def zipAll[A1 >: A, B](that: collection.Iterable[B], thisElem: A1, thatElem: B): CC[(A1, B)]
  180.  def zipWithIndex: CC[(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[CC]
  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: C
  41.  def reverseMap[B](f: (A) => B): CC[B]
  42.  def sameElements[B >: A](that: IterableOnce[B]): Boolean
  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: immutable.List[A]
  53.  def toMap[K, V](implicit ev: <:<[A, (K, V)]): immutable.Map[K, V]
  54.  def toSeq: immutable.Seq[A]
  55.  def toSet[B >: A]: immutable.Set[B]
  56.  def toStream: immutable.Stream[A]
  57.  final def toStream: immutable.Stream[A]
  58.  final def toTraversable: collection.Traversable[A]
  59.  final def toTraversable: collection.Traversable[A]
  60.  def toVector: immutable.Vector[A]
  61.  final def transform(f: (A) => A): IndexedSeqOps.this.type
  62.  final def union[B >: A](that: collection.Seq[B]): CC[B]
  63.  def view(from: Int, until: Int): IndexedSeqView[A]
  64.  def withFilter(f: (A) => Boolean): Iterator[A]
  65.  def →[B](y: B): (IndexedSeqOps[A, CC, C], B)
Inherited from SeqOps[A, CC, C]

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