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

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

 

Ordering

1. Alphabetic
2. By Inheritance

Inherited

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

Inherited from StrictOptimizedSeqOps[A, CC, C]

Inherited from StrictOptimizedIterableOps[A, CC, C]

Inherited from LinearSeqOps[A, CC, C]

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

Inherited by implicit conversion any2stringadd fromStrictOptimizedLinearSeqOps[A, CC, C] to any2stringadd[StrictOptimizedLinearSeqOps[A, CC, C]]

Inherited by implicit conversion StringFormat fromStrictOptimizedLinearSeqOps[A, CC, C] to StringFormat[StrictOptimizedLinearSeqOps[A, CC, C]]

Inherited by implicit conversion Ensuring fromStrictOptimizedLinearSeqOps[A, CC, C] to Ensuring[StrictOptimizedLinearSeqOps[A, CC, C]]

Inherited by implicit conversion ArrowAssoc fromStrictOptimizedLinearSeqOps[A, CC, C] to ArrowAssoc[StrictOptimizedLinearSeqOps[A, CC, C]]

Ungrouped