Scala Standard Library 2.13.1 - scala.collection.mutable.IndexedSeqOps (original) (raw)

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

 

Ordering

1. Alphabetic
2. By Inheritance

Inherited

1. IndexedSeqOps
2. SeqOps
3. Cloneable
4. Cloneable
5. IndexedSeqOps
6. SeqOps
7. IterableOps
8. IterableOnceOps
9. IterableOnce
10. AnyRef
11. 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 length: Int
6.  abstract def newSpecificBuilder: Builder[A, C]
7.  abstract def toIterable: collection.Iterable[A]
8.  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): (IndexedSeqOps[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: (IndexedSeqOps[A, CC, C]) => Boolean, msg: => Any): IndexedSeqOps[A, CC, C]
39.  def ensuring(cond: (IndexedSeqOps[A, CC, C]) => Boolean): IndexedSeqOps[A, CC, C]
40.  def ensuring(cond: Boolean, msg: => Any): IndexedSeqOps[A, CC, C]
41.  def ensuring(cond: Boolean): IndexedSeqOps[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 iterator: Iterator[A]
81.  def knownSize: Int
82.  def last: A
83.  def lastIndexOf[B >: A](elem: B, end: Int = length - 1): Int
84.  def lastIndexOfSlice[B >: A](that: collection.Seq[B]): Int
85.  def lastIndexOfSlice[B >: A](that: collection.Seq[B], end: Int): Int
86.  def lastIndexWhere(p: (A) => Boolean): Int
87.  def lastIndexWhere(p: (A) => Boolean, end: Int): Int
88.  def lastOption: Option[A]
89.  final def lengthCompare(that: collection.Iterable[_]): Int
90.  final def lengthCompare(len: Int): Int
91.  final def lengthIs: SizeCompareOps
92.  def map[B](f: (A) => B): CC[B]
93.  def mapInPlace(f: (A) => A): IndexedSeqOps.this.type
94.  def max[B >: A](implicit ord: math.Ordering[B]): A
95.  def maxBy[B](f: (A) => B)(implicit cmp: math.Ordering[B]): A
96.  def maxByOption[B](f: (A) => B)(implicit cmp: math.Ordering[B]): Option[A]
97.  def maxOption[B >: A](implicit ord: math.Ordering[B]): Option[A]
98.  def min[B >: A](implicit ord: math.Ordering[B]): A
99.  def minBy[B](f: (A) => B)(implicit cmp: math.Ordering[B]): A
100.  def minByOption[B](f: (A) => B)(implicit cmp: math.Ordering[B]): Option[A]
101.  def minOption[B >: A](implicit ord: math.Ordering[B]): Option[A]
102.  final def mkString: String
103.  final def mkString(sep: String): String
104.  final def mkString(start: String, sep: String, end: String): String
105.  final def ne(arg0: AnyRef): Boolean
106.  def nonEmpty: Boolean
107.  final def notify(): Unit
108.  final def notifyAll(): Unit
109.  def occCounts[B](sq: collection.Seq[B]): Map[B, Int]
110.  def padTo[B >: A](len: Int, elem: B): CC[B]
111.  def partition(p: (A) => Boolean): (C, C)
112.  def partitionMap[A1, A2](f: (A) => Either[A1, A2]): (CC[A1], CC[A2])
113.  def patch[B >: A](from: Int, other: IterableOnce[B], replaced: Int): CC[B]
114.  def permutations: Iterator[C]
115.  def prepended[B >: A](elem: B): CC[B]
116.  def prependedAll[B >: A](prefix: IterableOnce[B]): CC[B]
117.  def product[B >: A](implicit num: math.Numeric[B]): B
118.  def reduce[B >: A](op: (B, B) => B): B
119.  def reduceLeft[B >: A](op: (B, A) => B): B
120.  def reduceLeftOption[B >: A](op: (B, A) => B): Option[B]
121.  def reduceOption[B >: A](op: (B, B) => B): Option[B]
122.  def reduceRight[B >: A](op: (A, B) => B): B
123.  def reduceRightOption[B >: A](op: (A, B) => B): Option[B]
124.  def reverse: C
125.  def reverseIterator: Iterator[A]
126.  def reversed: collection.Iterable[A]
127.  def sameElements[B >: A](that: IterableOnce[B]): Boolean
128.  def scan[B >: A](z: B)(op: (B, B) => B): CC[B]
129.  def scanLeft[B](z: B)(op: (B, A) => B): CC[B]
130.  def scanRight[B](z: B)(op: (A, B) => B): CC[B]
131.  def search[B >: A](elem: B, from: Int, to: Int)(implicit ord: math.Ordering[B]): SearchResult
132.  def search[B >: A](elem: B)(implicit ord: math.Ordering[B]): SearchResult
133.  def segmentLength(p: (A) => Boolean, from: Int): Int
134.  final def segmentLength(p: (A) => Boolean): Int
135.  final def size: Int
136.  final def sizeCompare(that: collection.Iterable[_]): Int
137.  final def sizeCompare(otherSize: Int): Int
138.  final def sizeIs: SizeCompareOps
139.  def slice(from: Int, until: Int): C
140.  def sliding(size: Int, step: Int): Iterator[C]
141.  def sliding(size: Int): Iterator[C]
142.  def sortBy[B](f: (A) => B)(implicit ord: Ordering[B]): C
143.  def sortInPlace[B >: A]()(implicit ord: Ordering[B]): IndexedSeqOps.this.type
144.  def sortInPlaceBy[B](f: (A) => B)(implicit ord: Ordering[B]): IndexedSeqOps.this.type
145.  def sortInPlaceWith(lt: (A, A) => Boolean): IndexedSeqOps.this.type
146.  def sortWith(lt: (A, A) => Boolean): C
147.  def sorted[B >: A](implicit ord: Ordering[B]): C
148.  def span(p: (A) => Boolean): (C, C)
149.  def splitAt(n: Int): (C, C)
150.  def startsWith[B >: A](that: IterableOnce[B], offset: Int = 0): Boolean
151.  def stepper[S <: Stepper[_]](implicit shape: StepperShape[A, S]): S with EfficientSplit
152.  def sum[B >: A](implicit num: math.Numeric[B]): B
153.  final def synchronized[T0](arg0: => T0): T0
154.  def tail: C
155.  def tails: Iterator[C]
156.  def take(n: Int): C
157.  def takeRight(n: Int): C
158.  def takeWhile(p: (A) => Boolean): C
159.  def tapEach[U](f: (A) => U): C
160.  def to[C1](factory: Factory[A, C1]): C1
161.  def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
162.  final def toBuffer[B >: A]: Buffer[B]
163.  def toIndexedSeq: immutable.IndexedSeq[A]
164.  def toList: immutable.List[A]
165.  def toMap[K, V](implicit ev: <:<[A, (K, V)]): immutable.Map[K, V]
166.  def toSeq: immutable.Seq[A]
167.  def toSet[B >: A]: immutable.Set[B]
168.  def toString(): String
169.  def toVector: immutable.Vector[A]
170.  def transpose[B](implicit asIterable: (A) => collection.Iterable[B]): CC[CC[B]]
171.  def unzip[A1, A2](implicit asPair: (A) => (A1, A2)): (CC[A1], CC[A2])
172.  def unzip3[A1, A2, A3](implicit asTriple: (A) => (A1, A2, A3)): (CC[A1], CC[A2], CC[A3])
173.  def updated[B >: A](index: Int, elem: B): CC[B]
174.  def view: IndexedSeqView[A]
175.  final def wait(): Unit
176.  final def wait(arg0: Long, arg1: Int): Unit
177.  final def wait(arg0: Long): Unit
178.  def withFilter(p: (A) => Boolean): WithFilter[A, CC]
179.  def zip[B](that: IterableOnce[B]): CC[(A, B)]
180.  def zipAll[A1 >: A, B](that: collection.Iterable[B], thisElem: A1, thatElem: B): CC[(A1, B)]
181.  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): IndexedSeqOps.this.type
61.  final def union[B >: A](that: collection.Seq[B]): CC[B]
62.  def view(from: Int, until: Int): IndexedSeqView[A]
63.  def withFilter(f: (A) => Boolean): Iterator[A]
64.  def →[B](y: B): (IndexedSeqOps[A, CC, C], B)

Inherited from SeqOps[A, CC, C]

Inherited from Cloneable[C]

Inherited from java.lang.Cloneable

Inherited from collection.IndexedSeqOps[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 AnyRef

Inherited from Any

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

Inherited by implicit conversion any2stringadd fromIndexedSeqOps[A, CC, C] to any2stringadd[IndexedSeqOps[A, CC, C]]

Inherited by implicit conversion StringFormat fromIndexedSeqOps[A, CC, C] to StringFormat[IndexedSeqOps[A, CC, C]]

Inherited by implicit conversion Ensuring fromIndexedSeqOps[A, CC, C] to Ensuring[IndexedSeqOps[A, CC, C]]

Inherited by implicit conversion ArrowAssoc fromIndexedSeqOps[A, CC, C] to ArrowAssoc[IndexedSeqOps[A, CC, C]]

Ungrouped