Scala Standard Library 2.13.15 - scala.collection.LinearSeqOps (original) (raw)

trait LinearSeqOps[+A, +CC[X] <: LinearSeq[X], +C <: LinearSeq[A] with LinearSeqOps[A, CC, C]] extends SeqOps[A, CC, C]

Ordering

  1. Alphabetic
  2. By Inheritance

Inherited

  1. LinearSeqOps
  2. SeqOps
  3. IterableOps
  4. IterableOnceOps
  5. IterableOnce
  6. 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 coll: C
  2. abstract def fromSpecific(coll: IterableOnce[A]): C
  3. abstract def getClass(): Class[_ <: AnyRef]
  4. abstract def iterableFactory: IterableFactory[CC]
  5. abstract def newSpecificBuilder: Builder[A, C]
  6. abstract def toIterable: 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): (LinearSeqOps[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. def apply(n: Int): A
  17. final def asInstanceOf[T0]: T0
  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: 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: 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: 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: Iterable[B]): Boolean
  38. def ensuring(cond: (LinearSeqOps[A, CC, C]) => Boolean, msg: => Any): LinearSeqOps[A, CC, C]
  39. def ensuring(cond: (LinearSeqOps[A, CC, C]) => Boolean): LinearSeqOps[A, CC, C]
  40. def ensuring(cond: Boolean, msg: => Any): LinearSeqOps[A, CC, C]
  41. def ensuring(cond: Boolean): LinearSeqOps[A, CC, C]
  42. def equals(arg0: Any): Boolean
  43. def exists(p: (A) => Boolean): Boolean
  44. def filter(pred: (A) => 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 asIterable: (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): immutable.Map[K, C]
  56. def groupMap[K, B](key: (A) => K)(f: (A) => B): immutable.Map[K, CC[B]]
  57. def groupMapReduce[K, B](key: (A) => K)(f: (A) => B)(reduce: (B, B) => B): immutable.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: Seq[B]): Int
  65. def indexOfSlice[B >: A](that: Seq[B], from: Int): Int
  66. def indexWhere(p: (A) => Boolean, from: Int): Int
  67. def indexWhere(p: (A) => Boolean): Int
  68. def indices: immutable.Range
  69. def init: C
  70. def inits: Iterator[C]
  71. def intersect[B >: A](that: Seq[B]): C
  72. def isDefinedAt(x: Int): Boolean
  73. def isEmpty: Boolean
  74. final def isInstanceOf[T0]: Boolean
  75. def isTraversableAgain: Boolean
  76. def iterator: Iterator[A]
  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: Seq[B]): Int
  81. def lastIndexOfSlice[B >: A](that: Seq[B], end: Int): Int
  82. def lastIndexWhere(p: (A) => Boolean, end: Int): Int
  83. def lastIndexWhere(p: (A) => Boolean): Int
  84. def lastOption: Option[A]
  85. def length: Int
  86. def lengthCompare(that: Iterable[_]): Int
  87. def lengthCompare(len: Int): Int
  88. final def lengthIs: SizeCompareOps
  89. def map[B](f: (A) => B): CC[B]
  90. def max[B >: A](implicit ord: math.Ordering[B]): A
  91. def maxBy[B](f: (A) => B)(implicit ord: math.Ordering[B]): A
  92. def maxByOption[B](f: (A) => B)(implicit ord: math.Ordering[B]): Option[A]
  93. def maxOption[B >: A](implicit ord: math.Ordering[B]): Option[A]
  94. def min[B >: A](implicit ord: math.Ordering[B]): A
  95. def minBy[B](f: (A) => B)(implicit ord: math.Ordering[B]): A
  96. def minByOption[B](f: (A) => B)(implicit ord: math.Ordering[B]): Option[A]
  97. def minOption[B >: A](implicit ord: math.Ordering[B]): Option[A]
  98. final def mkString: String
  99. final def mkString(sep: String): String
  100. final def mkString(start: String, sep: String, end: String): String
  101. def nonEmpty: Boolean
  102. def occCounts[B](sq: Seq[B]): mutable.Map[B, Int]
  103. def padTo[B >: A](len: Int, elem: B): CC[B]
  104. def partition(p: (A) => Boolean): (C, C)
  105. def partitionMap[A1, A2](f: (A) => Either[A1, A2]): (CC[A1], CC[A2])
  106. def patch[B >: A](from: Int, other: IterableOnce[B], replaced: Int): CC[B]
  107. def permutations: Iterator[C]
  108. def prepended[B >: A](elem: B): CC[B]
  109. def prependedAll[B >: A](prefix: IterableOnce[B]): CC[B]
  110. def product[B >: A](implicit num: math.Numeric[B]): B
  111. def reduce[B >: A](op: (B, B) => B): B
  112. def reduceLeft[B >: A](op: (B, A) => B): B
  113. def reduceLeftOption[B >: A](op: (B, A) => B): Option[B]
  114. def reduceOption[B >: A](op: (B, B) => B): Option[B]
  115. def reduceRight[B >: A](op: (A, B) => B): B
  116. def reduceRightOption[B >: A](op: (A, B) => B): Option[B]
  117. def reverse: C
  118. def reverseIterator: Iterator[A]
  119. def reversed: Iterable[A]
  120. def sameElements[B >: A](that: IterableOnce[B]): Boolean
  121. def scan[B >: A](z: B)(op: (B, B) => B): CC[B]
  122. def scanLeft[B](z: B)(op: (B, A) => B): CC[B]
  123. def scanRight[B](z: B)(op: (A, B) => B): CC[B]
  124. def search[B >: A](elem: B, from: Int, to: Int)(implicit ord: Ordering[B]): SearchResult
  125. def search[B >: A](elem: B)(implicit ord: Ordering[B]): SearchResult
  126. def segmentLength(p: (A) => Boolean, from: Int): Int
  127. final def segmentLength(p: (A) => Boolean): Int
  128. final def size: Int
  129. final def sizeCompare(that: Iterable[_]): Int
  130. final def sizeCompare(otherSize: Int): Int
  131. final def sizeIs: SizeCompareOps
  132. def slice(from: Int, until: Int): C
  133. def sliding(size: Int, step: Int): Iterator[C]
  134. def sliding(size: Int): Iterator[C]
  135. def sortBy[B](f: (A) => B)(implicit ord: Ordering[B]): C
  136. def sortWith(lt: (A, A) => Boolean): C
  137. def sorted[B >: A](implicit ord: Ordering[B]): C
  138. def span(p: (A) => Boolean): (C, C)
  139. def splitAt(n: Int): (C, C)
  140. def startsWith[B >: A](that: IterableOnce[B], offset: Int = 0): Boolean
  141. def stepper[S <: Stepper[_]](implicit shape: StepperShape[A, S]): S
  142. def sum[B >: A](implicit num: math.Numeric[B]): B
  143. def tail: C
  144. def tails: Iterator[C]
  145. def take(n: Int): C
  146. def takeRight(n: Int): C
  147. def takeWhile(p: (A) => Boolean): C
  148. def tapEach[U](f: (A) => U): C
  149. def to[C1](factory: Factory[A, C1]): C1
  150. def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
  151. final def toBuffer[B >: A]: Buffer[B]
  152. def toIndexedSeq: immutable.IndexedSeq[A]
  153. def toList: immutable.List[A]
  154. def toMap[K, V](implicit ev: <:<[A, (K, V)]): immutable.Map[K, V]
  155. def toSeq: immutable.Seq[A]
  156. def toSet[B >: A]: immutable.Set[B]
  157. def toString(): String
  158. def toVector: immutable.Vector[A]
  159. def transpose[B](implicit asIterable: (A) => Iterable[B]): CC[CC[B]]
  160. def unzip[A1, A2](implicit asPair: (A) => (A1, A2)): (CC[A1], CC[A2])
  161. def unzip3[A1, A2, A3](implicit asTriple: (A) => (A1, A2, A3)): (CC[A1], CC[A2], CC[A3])
  162. def updated[B >: A](index: Int, elem: B): CC[B]
  163. def view: SeqView[A]
  164. def withFilter(p: (A) => Boolean): WithFilter[A, CC]
  165. def zip[B](that: IterableOnce[B]): CC[(A, B)]
  166. def zipAll[A1 >: A, B](that: Iterable[B], thisElem: A1, thatElem: B): CC[(A1, B)]
  167. 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: IndexedSeq[A]
  49. final def toIterable: 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: Traversable[A]
  59. final def toTraversable: Traversable[A]
  60. def toVector: immutable.Vector[A]
  61. final def union[B >: A](that: 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): (LinearSeqOps[A, CC, C], B)

Inherited from 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 fromLinearSeqOps[A, CC, C] to IterableOnceExtensionMethods[A]

Inherited by implicit conversion any2stringadd fromLinearSeqOps[A, CC, C] to any2stringadd[LinearSeqOps[A, CC, C]]

Inherited by implicit conversion StringFormat fromLinearSeqOps[A, CC, C] to StringFormat[LinearSeqOps[A, CC, C]]

Inherited by implicit conversion Ensuring fromLinearSeqOps[A, CC, C] to Ensuring[LinearSeqOps[A, CC, C]]

Inherited by implicit conversion ArrowAssoc fromLinearSeqOps[A, CC, C] to ArrowAssoc[LinearSeqOps[A, CC, C]]

Ungrouped