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.10/scala/collection/immutable/StrictOptimizedSeqOps.html below:

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

trait StrictOptimizedSeqOps[+A, +CC[_], +C] extends SeqOps[A, CC, C] with collection.StrictOptimizedSeqOps[A, CC, C] with StrictOptimizedIterableOps[A, CC, C]



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