Scala Standard Library 2.13.1 - 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 toIterable: collection.Iterable[A]
9.  abstract def update(idx: Int, elem: A): Unit

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