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

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

 

Ordering

1. Alphabetic
2. By Inheritance

Inherited

1. SeqOps
2. Cloneable
3. Cloneable
4. SeqOps
5. IterableOps
6. IterableOnceOps
7. IterableOnce
8. AnyRef
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 iterableFactory: IterableFactory[CC]
5.  abstract def iterator: Iterator[A]
6.  abstract def length: Int
7.  abstract def newSpecificBuilder: Builder[A, C]
8.  abstract def update(idx: Int, elem: A): Unit
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): (SeqOps[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: (SeqOps[A, CC, C]) => Boolean, msg: => Any): SeqOps[A, CC, C]
39.  def ensuring(cond: (SeqOps[A, CC, C]) => Boolean): SeqOps[A, CC, C]
40.  def ensuring(cond: Boolean, msg: => Any): SeqOps[A, CC, C]
41.  def ensuring(cond: Boolean): SeqOps[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 knownSize: Int
80.  def last: A
81.  def lastIndexOf[B >: A](elem: B, end: Int = length - 1): Int
82.  def lastIndexOfSlice[B >: A](that: collection.Seq[B]): Int
83.  def lastIndexOfSlice[B >: A](that: collection.Seq[B], end: Int): Int
84.  def lastIndexWhere(p: (A) => Boolean): Int
85.  def lastIndexWhere(p: (A) => Boolean, end: Int): Int
86.  def lastOption: Option[A]
87.  def lengthCompare(that: collection.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.  final def ne(arg0: AnyRef): Boolean
103.  def nonEmpty: Boolean
104.  final def notify(): Unit
105.  final def notifyAll(): Unit
106.  def occCounts[B](sq: collection.Seq[B]): Map[B, Int]
107.  def padTo[B >: A](len: Int, elem: B): CC[B]
108.  def partition(p: (A) => Boolean): (C, C)
109.  def partitionMap[A1, A2](f: (A) => Either[A1, A2]): (CC[A1], CC[A2])
110.  def patch[B >: A](from: Int, other: IterableOnce[B], replaced: Int): CC[B]
111.  def permutations: Iterator[C]
112.  def prepended[B >: A](elem: B): CC[B]
113.  def prependedAll[B >: A](prefix: IterableOnce[B]): CC[B]
114.  def product[B >: A](implicit num: math.Numeric[B]): B
115.  def reduce[B >: A](op: (B, B) => B): B
116.  def reduceLeft[B >: A](op: (B, A) => B): B
117.  def reduceLeftOption[B >: A](op: (B, A) => B): Option[B]
118.  def reduceOption[B >: A](op: (B, B) => B): Option[B]
119.  def reduceRight[B >: A](op: (A, B) => B): B
120.  def reduceRightOption[B >: A](op: (A, B) => B): Option[B]
121.  def reverse: C
122.  def reverseIterator: Iterator[A]
123.  def reversed: collection.Iterable[A]
124.  def sameElements[B >: A](that: IterableOnce[B]): Boolean
125.  def scan[B >: A](z: B)(op: (B, B) => B): CC[B]
126.  def scanLeft[B](z: B)(op: (B, A) => B): CC[B]
127.  def scanRight[B](z: B)(op: (A, B) => B): CC[B]
128.  def search[B >: A](elem: B, from: Int, to: Int)(implicit ord: Ordering[B]): SearchResult
129.  def search[B >: A](elem: B)(implicit ord: Ordering[B]): SearchResult
130.  def segmentLength(p: (A) => Boolean, from: Int): Int
131.  final def segmentLength(p: (A) => Boolean): Int
132.  final def size: Int
133.  final def sizeCompare(that: collection.Iterable[_]): Int
134.  final def sizeCompare(otherSize: Int): Int
135.  final def sizeIs: SizeCompareOps
136.  def slice(from: Int, until: Int): C
137.  def sliding(size: Int, step: Int): Iterator[C]
138.  def sliding(size: Int): Iterator[C]
139.  def sortBy[B](f: (A) => B)(implicit ord: Ordering[B]): C
140.  def sortWith(lt: (A, A) => Boolean): C
141.  def sorted[B >: A](implicit ord: Ordering[B]): C
142.  def span(p: (A) => Boolean): (C, C)
143.  def splitAt(n: Int): (C, C)
144.  def startsWith[B >: A](that: IterableOnce[B], offset: Int = 0): Boolean
145.  def stepper[S <: Stepper[_]](implicit shape: StepperShape[A, S]): S
146.  def sum[B >: A](implicit num: math.Numeric[B]): B
147.  final def synchronized[T0](arg0: => T0): T0
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: immutable.IndexedSeq[A]
158.  def toList: immutable.List[A]
159.  def toMap[K, V](implicit ev: <:<[A, (K, V)]): immutable.Map[K, V]
160.  def toSeq: immutable.Seq[A]
161.  def toSet[B >: A]: immutable.Set[B]
162.  def toString(): String
163.  def toVector: immutable.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.  final def wait(): Unit
170.  final def wait(arg0: Long, arg1: Int): Unit
171.  final def wait(arg0: Long): Unit
172.  def withFilter(p: (A) => Boolean): WithFilter[A, CC]
173.  def zip[B](that: IterableOnce[B]): CC[(A, B)]
174.  def zipAll[A1 >: A, B](that: collection.Iterable[B], thisElem: A1, thatElem: B): CC[(A1, B)]
175.  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): SeqOps.this.type
62.  final def union[B >: A](that: collection.Seq[B]): CC[B]
63.  def view(from: Int, until: Int): View[A]
64.  def withFilter(f: (A) => Boolean): Iterator[A]
65.  def →[B](y: B): (SeqOps[A, CC, C], B)

Inherited from Cloneable[C]

Inherited from java.lang.Cloneable

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 AnyRef

Inherited from Any

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

Inherited by implicit conversion any2stringadd fromSeqOps[A, CC, C] to any2stringadd[SeqOps[A, CC, C]]

Inherited by implicit conversion StringFormat fromSeqOps[A, CC, C] to StringFormat[SeqOps[A, CC, C]]

Inherited by implicit conversion Ensuring fromSeqOps[A, CC, C] to Ensuring[SeqOps[A, CC, C]]

Inherited by implicit conversion ArrowAssoc fromSeqOps[A, CC, C] to ArrowAssoc[SeqOps[A, CC, C]]

Ungrouped