Scala Standard Library 2.13.1 - scala.collection.immutable.StrictOptimizedSeqOps (original) (raw)

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

  6. Hide All

  7. Show All

Visibility

  1. Public
  2. Protected

Abstract Value Members

  1. abstract def apply(i: Int): A
  2. abstract def coll: C
  3. abstract def fromSpecific(coll: IterableOnce[A]): C
  4. abstract def getClass(): Class[_ <: AnyRef]
  5. abstract def iterableFactory: IterableFactory[CC]
  6. abstract def iterator: Iterator[A]
  7. abstract def length: Int
  8. abstract def newSpecificBuilder: Builder[A, C]
  9. abstract def toIterable: collection.Iterable[A]

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): 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 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](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 formatted(fmtstr: String): String
  56. def groupBy[K](f: (A) => K): Map[K, C]
  57. def groupMap[K, B](key: (A) => K)(f: (A) => B): Map[K, CC[B]]
  58. def groupMapReduce[K, B](key: (A) => K)(f: (A) => B)(reduce: (B, B) => B): Map[K, B]
  59. def grouped(size: Int): Iterator[C]
  60. def hashCode(): Int
  61. def head: A
  62. def headOption: Option[A]
  63. def indexOf[B >: A](elem: B): Int
  64. def indexOf[B >: A](elem: B, from: Int): Int
  65. def indexOfSlice[B >: A](that: collection.Seq[B]): Int
  66. def indexOfSlice[B >: A](that: collection.Seq[B], from: Int): Int
  67. def indexWhere(p: (A) => Boolean): Int
  68. def indexWhere(p: (A) => Boolean, from: Int): Int
  69. def indices: Range
  70. def init: C
  71. def inits: Iterator[C]
  72. def intersect[B >: A](that: collection.Seq[B]): C
  73. def isDefinedAt(idx: Int): Boolean
  74. def isEmpty: Boolean
  75. final def isInstanceOf[T0]: Boolean
  76. def isTraversableAgain: Boolean
  77. def knownSize: Int
  78. def last: A
  79. def lastIndexOf[B >: A](elem: B, end: Int = length - 1): Int
  80. def lastIndexOfSlice[B >: A](that: collection.Seq[B]): Int
  81. def lastIndexOfSlice[B >: A](that: collection.Seq[B], end: Int): Int
  82. def lastIndexWhere(p: (A) => Boolean): Int
  83. def lastIndexWhere(p: (A) => Boolean, end: Int): Int
  84. def lastOption: Option[A]
  85. def lengthCompare(that: collection.Iterable[_]): Int
  86. def lengthCompare(len: Int): Int
  87. final def lengthIs: SizeCompareOps
  88. def map[B](f: (A) => B): CC[B]
  89. def max[B >: A](implicit ord: math.Ordering[B]): A
  90. def maxBy[B](f: (A) => B)(implicit cmp: math.Ordering[B]): A
  91. def maxByOption[B](f: (A) => B)(implicit cmp: math.Ordering[B]): Option[A]
  92. def maxOption[B >: A](implicit ord: math.Ordering[B]): Option[A]
  93. def min[B >: A](implicit ord: math.Ordering[B]): A
  94. def minBy[B](f: (A) => B)(implicit cmp: math.Ordering[B]): A
  95. def minByOption[B](f: (A) => B)(implicit cmp: math.Ordering[B]): Option[A]
  96. def minOption[B >: A](implicit ord: math.Ordering[B]): Option[A]
  97. final def mkString: String
  98. final def mkString(sep: String): String
  99. final def mkString(start: String, sep: String, end: String): String
  100. def nonEmpty: Boolean
  101. def occCounts[B](sq: collection.Seq[B]): mutable.Map[B, Int]
  102. def padTo[B >: A](len: Int, elem: B): CC[B]
  103. def partition(p: (A) => Boolean): (C, C)
  104. def partitionMap[A1, A2](f: (A) => Either[A1, A2]): (CC[A1], CC[A2])
  105. def patch[B >: A](from: Int, other: IterableOnce[B], replaced: Int): CC[B]
  106. def permutations: Iterator[C]
  107. def prepended[B >: A](elem: B): CC[B]
  108. def prependedAll[B >: A](prefix: IterableOnce[B]): CC[B]
  109. def product[B >: A](implicit num: math.Numeric[B]): B
  110. def reduce[B >: A](op: (B, B) => B): B
  111. def reduceLeft[B >: A](op: (B, A) => B): B
  112. def reduceLeftOption[B >: A](op: (B, A) => B): Option[B]
  113. def reduceOption[B >: A](op: (B, B) => B): Option[B]
  114. def reduceRight[B >: A](op: (A, B) => B): B
  115. def reduceRightOption[B >: A](op: (A, B) => B): Option[B]
  116. def reverse: C
  117. def reverseIterator: Iterator[A]
  118. def reversed: collection.Iterable[A]
  119. def sameElements[B >: A](that: IterableOnce[B]): Boolean
  120. def scan[B >: A](z: B)(op: (B, B) => B): CC[B]
  121. def scanLeft[B](z: B)(op: (B, A) => B): CC[B]
  122. def scanRight[B](z: B)(op: (A, B) => B): CC[B]
  123. def search[B >: A](elem: B, from: Int, to: Int)(implicit ord: Ordering[B]): SearchResult
  124. def search[B >: A](elem: B)(implicit ord: Ordering[B]): SearchResult
  125. def segmentLength(p: (A) => Boolean, from: Int): Int
  126. final def segmentLength(p: (A) => Boolean): Int
  127. final def size: Int
  128. final def sizeCompare(that: collection.Iterable[_]): Int
  129. final def sizeCompare(otherSize: Int): Int
  130. final def sizeIs: SizeCompareOps
  131. def slice(from: Int, until: Int): C
  132. def sliding(size: Int, step: Int): Iterator[C]
  133. def sliding(size: Int): Iterator[C]
  134. def sortBy[B](f: (A) => B)(implicit ord: Ordering[B]): C
  135. def sortWith(lt: (A, A) => Boolean): C
  136. def sorted[B >: A](implicit ord: Ordering[B]): C
  137. def span(p: (A) => Boolean): (C, C)
  138. def splitAt(n: Int): (C, C)
  139. def startsWith[B >: A](that: IterableOnce[B], offset: Int = 0): Boolean
  140. def stepper[S <: Stepper[_]](implicit shape: StepperShape[A, S]): S
  141. final def strictOptimizedCollect[B, C2](b: Builder[B, C2], pf: PartialFunction[A, B]): C2
  142. final def strictOptimizedConcat[B >: A, C2](that: IterableOnce[B], b: Builder[B, C2]): C2
  143. final def strictOptimizedFlatMap[B, C2](b: Builder[B, C2], f: (A) => IterableOnce[B]): C2
  144. final def strictOptimizedFlatten[B, C2](b: Builder[B, C2])(implicit toIterableOnce: (A) => IterableOnce[B]): C2
  145. final def strictOptimizedMap[B, C2](b: Builder[B, C2], f: (A) => B): C2
  146. final def strictOptimizedZip[B, C2](that: IterableOnce[B], b: Builder[(A, B), C2]): C2
  147. def sum[B >: A](implicit num: math.Numeric[B]): B
  148. def tail: C
  149. def tails: Iterator[C]
  150. def take(n: Int): C
  151. def takeRight(n: Int): C
  152. def takeWhile(p: (A) => Boolean): C
  153. def tapEach[U](f: (A) => U): C
  154. def to[C1](factory: Factory[A, C1]): C1
  155. def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
  156. final def toBuffer[B >: A]: Buffer[B]
  157. def toIndexedSeq: IndexedSeq[A]
  158. def toList: List[A]
  159. def toMap[K, V](implicit ev: <:<[A, (K, V)]): Map[K, V]
  160. def toSeq: Seq[A]
  161. def toSet[B >: A]: Set[B]
  162. def toString(): String
  163. def toVector: Vector[A]
  164. def transpose[B](implicit asIterable: (A) => collection.Iterable[B]): CC[CC[B]]
  165. def unzip[A1, A2](implicit asPair: (A) => (A1, A2)): (CC[A1], CC[A2])
  166. def unzip3[A1, A2, A3](implicit asTriple: (A) => (A1, A2, A3)): (CC[A1], CC[A2], CC[A3])
  167. def updated[B >: A](index: Int, elem: B): CC[B]
  168. def view: SeqView[A]
  169. def withFilter(p: (A) => Boolean): WithFilter[A, CC]
  170. def zip[B](that: IterableOnce[B]): CC[(A, B)]
  171. def zipAll[A1 >: A, B](that: collection.Iterable[B], thisElem: A1, thatElem: B): CC[(A1, B)]
  172. 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 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: C
  40. def reverseMap[B](f: (A) => B): CC[B]
  41. def sameElements[B >: A](that: IterableOnce[B]): Boolean
  42. def size: Int
  43. def sum(implicit num: math.Numeric[A]): A
  44. def to[C1](factory: Factory[A, C1]): C1
  45. def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
  46. def toBuffer[B >: A]: Buffer[B]
  47. def toIndexedSeq: collection.IndexedSeq[A]
  48. final def toIterable: collection.Iterable[A]
  49. def toIterator: Iterator[A]
  50. final def toIterator: Iterator[A]
  51. def toList: List[A]
  52. def toMap[K, V](implicit ev: <:<[A, (K, V)]): Map[K, V]
  53. def toSeq: Seq[A]
  54. def toSet[B >: A]: Set[B]
  55. def toStream: Stream[A]
  56. final def toStream: Stream[A]
  57. final def toTraversable: collection.Traversable[A]
  58. final def toTraversable: collection.Traversable[A]
  59. def toVector: Vector[A]
  60. final def union[B >: A](that: collection.Seq[B]): CC[B]
  61. def view(from: Int, until: Int): View[A]
  62. def withFilter(f: (A) => Boolean): Iterator[A]
  63. def →[B](y: B): (StrictOptimizedSeqOps[A, CC, C], B)

Inherited from collection.StrictOptimizedSeqOps[A, CC, C]

Inherited from StrictOptimizedIterableOps[A, CC, C]

Inherited from SeqOps[A, CC, C]

Inherited from collection.SeqOps[A, CC, C]

Inherited from IterableOps[A, CC, C]

Inherited from IterableOnceOps[A, CC, C]

Inherited from IterableOnce[A]

Inherited from Any

Inherited by implicit conversion iterableOnceExtensionMethods fromStrictOptimizedSeqOps[A, CC, C] to IterableOnceExtensionMethods[A]

Inherited by implicit conversion any2stringadd fromStrictOptimizedSeqOps[A, CC, C] to any2stringadd[StrictOptimizedSeqOps[A, CC, C]]

Inherited by implicit conversion StringFormat fromStrictOptimizedSeqOps[A, CC, C] to StringFormat[StrictOptimizedSeqOps[A, CC, C]]

Inherited by implicit conversion Ensuring fromStrictOptimizedSeqOps[A, CC, C] to Ensuring[StrictOptimizedSeqOps[A, CC, C]]

Inherited by implicit conversion ArrowAssoc fromStrictOptimizedSeqOps[A, CC, C] to ArrowAssoc[StrictOptimizedSeqOps[A, CC, C]]

Ungrouped