Scala Standard Library 2.13.3 - scala.collection.IndexedSeq (original) (raw)

trait IndexedSeq[+A] extends Seq[A] with IndexedSeqOps[A, IndexedSeq, IndexedSeq[A]] with IterableFactoryDefaults[A, IndexedSeq]

 

Ordering

1. Alphabetic
2. By Inheritance

Inherited

1. IndexedSeq
2. IndexedSeqOps
3. Seq
4. Equals
5. SeqOps
6. PartialFunction
7. Function1
8. Iterable
9. IterableFactoryDefaults
10. IterableOps
11. IterableOnceOps
12. IterableOnce
13. AnyRef
14. Any

Implicitly

1. by SeqCharSequence

2. by UnliftOps

3. by iterableOnceExtensionMethods

4. by any2stringadd

5. by StringFormat

6. by Ensuring

7. by ArrowAssoc

8. Hide All

9. Show All

Visibility

1. Public
2. Protected

Abstract Value Members

1.  abstract def apply(i: Int): A
2.  abstract def length: Int

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]): IndexedSeq[B]
5.  final def ++:[B >: A](prefix: IterableOnce[B]): IndexedSeq[B]
6.  final def +:[B >: A](elem: B): IndexedSeq[B]
7.  def ->[B](y: B): (IndexedSeq[A], B)
8.  final def :+[B >: A](elem: B): IndexedSeq[B]
9.  final def :++[B >: A](suffix: IterableOnce[B]): IndexedSeq[B]
10.  final def ==(arg0: Any): Boolean
11.  final def addString(b: mutable.StringBuilder): mutable.StringBuilder
12.  final def addString(b: mutable.StringBuilder, sep: String): mutable.StringBuilder
13.  def addString(b: mutable.StringBuilder, start: String, sep: String, end: String): mutable.StringBuilder
14.  def andThen[C](k: PartialFunction[A, C]): PartialFunction[Int, C]
15.  def andThen[C](k: (A) => C): PartialFunction[Int, C]
16.  def appended[B >: A](elem: B): IndexedSeq[B]
17.  def appendedAll[B >: A](suffix: IterableOnce[B]): IndexedSeq[B]
18.  def applyOrElse[A1 <: Int, B1 >: A](x: A1, default: (A1) => B1): B1
19.  final def asInstanceOf[T0]: T0
20.  def canEqual(that: Any): Boolean
21.  def charAt(index: Int): Char
22.  def chars(): IntStream
23.  def className: String
24.  def clone(): AnyRef
25.  def codePoints(): IntStream
26.  final def coll: IndexedSeq.this.type
27.  def collect[B](pf: PartialFunction[A, B]): IndexedSeq[B]
28.  def collectFirst[B](pf: PartialFunction[A, B]): Option[B]
29.  def combinations(n: Int): Iterator[IndexedSeq[A]]
30.  def compose[R](k: PartialFunction[R, Int]): PartialFunction[R, A]
31.  def compose[A](g: (A) => Int): (A) => A
32.  final def concat[B >: A](suffix: IterableOnce[B]): IndexedSeq[B]
33.  def contains[A1 >: A](elem: A1): Boolean
34.  def containsSlice[B](that: Seq[B]): Boolean
35.  def copyToArray[B >: A](xs: Array[B], start: Int, len: Int): Int
36.  def copyToArray[B >: A](xs: Array[B], start: Int): Int
37.  def copyToArray[B >: A](xs: Array[B]): Int
38.  def corresponds[B](that: Seq[B])(p: (A, B) => Boolean): Boolean
39.  def corresponds[B](that: IterableOnce[B])(p: (A, B) => Boolean): Boolean
40.  def count(p: (A) => Boolean): Int
41.  def diff[B >: A](that: Seq[B]): IndexedSeq[A]
42.  def distinct: IndexedSeq[A]
43.  def distinctBy[B](f: (A) => B): IndexedSeq[A]
44.  def drop(n: Int): IndexedSeq[A]
45.  def dropRight(n: Int): IndexedSeq[A]
46.  def dropWhile(p: (A) => Boolean): IndexedSeq[A]
47.  def elementWise: ElementWiseExtractor[Int, A]
48.  def empty: IndexedSeq[A]
49.  def endsWith[B >: A](that: Iterable[B]): Boolean
50.  def ensuring(cond: (IndexedSeq[A]) => Boolean, msg: => Any): IndexedSeq[A]
51.  def ensuring(cond: (IndexedSeq[A]) => Boolean): IndexedSeq[A]
52.  def ensuring(cond: Boolean, msg: => Any): IndexedSeq[A]
53.  def ensuring(cond: Boolean): IndexedSeq[A]
54.  final def eq(arg0: AnyRef): Boolean
55.  def equals(o: Any): Boolean
56.  def exists(p: (A) => Boolean): Boolean
57.  def filter(pred: (A) => Boolean): IndexedSeq[A]
58.  def filterNot(pred: (A) => Boolean): IndexedSeq[A]
59.  def finalize(): Unit
60.  def find(p: (A) => Boolean): Option[A]
61.  def findLast(p: (A) => Boolean): Option[A]
62.  def flatMap[B](f: (A) => IterableOnce[B]): IndexedSeq[B]
63.  def flatten[B](implicit asIterable: (A) => IterableOnce[B]): IndexedSeq[B]
64.  def fold[A1 >: A](z: A1)(op: (A1, A1) => A1): A1
65.  def foldLeft[B](z: B)(op: (B, A) => B): B
66.  def foldRight[B](z: B)(op: (A, B) => B): B
67.  def forall(p: (A) => Boolean): Boolean
68.  def foreach[U](f: (A) => U): Unit
69.  def formatted(fmtstr: String): String
70.  def fromSpecific(coll: IterableOnce[A]): IndexedSeq[A]
71.  final def getClass(): Class[_ <: AnyRef]
72.  def groupBy[K](f: (A) => K): immutable.Map[K, IndexedSeq[A]]
73.  def groupMap[K, B](key: (A) => K)(f: (A) => B): immutable.Map[K, IndexedSeq[B]]
74.  def groupMapReduce[K, B](key: (A) => K)(f: (A) => B)(reduce: (B, B) => B): immutable.Map[K, B]
75.  def grouped(size: Int): Iterator[IndexedSeq[A]]
76.  def hashCode(): Int
77.  def head: A
78.  def headOption: Option[A]
79.  def indexOf[B >: A](elem: B): Int
80.  def indexOf[B >: A](elem: B, from: Int): Int
81.  def indexOfSlice[B >: A](that: Seq[B]): Int
82.  def indexOfSlice[B >: A](that: Seq[B], from: Int): Int
83.  def indexWhere(p: (A) => Boolean): Int
84.  def indexWhere(p: (A) => Boolean, from: Int): Int
85.  def indices: immutable.Range
86.  def init: IndexedSeq[A]
87.  def inits: Iterator[IndexedSeq[A]]
88.  def intersect[B >: A](that: Seq[B]): IndexedSeq[A]
89.  def isDefinedAt(idx: Int): Boolean
90.  def isEmpty: Boolean
91.  final def isInstanceOf[T0]: Boolean
92.  def isTraversableAgain: Boolean
93.  def iterableFactory: SeqFactory[IndexedSeq]
94.  def iterator: Iterator[A]
95.  def knownSize: Int
96.  def last: A
97.  def lastIndexOf[B >: A](elem: B, end: Int = length - 1): Int
98.  def lastIndexOfSlice[B >: A](that: Seq[B]): Int
99.  def lastIndexOfSlice[B >: A](that: Seq[B], end: Int): Int
100.  def lastIndexWhere(p: (A) => Boolean): Int
101.  def lastIndexWhere(p: (A) => Boolean, end: Int): Int
102.  def lastOption: Option[A]
103.  def lazyZip[B](that: Iterable[B]): LazyZip2[A, B, IndexedSeq.this.type]
104.  final def lengthCompare(that: Iterable[_]): Int
105.  final def lengthCompare(len: Int): Int
106.  final def lengthIs: SizeCompareOps
107.  def lift: (Int) => Option[A]
108.  def map[B](f: (A) => B): IndexedSeq[B]
109.  def max[B >: A](implicit ord: math.Ordering[B]): A
110.  def maxBy[B](f: (A) => B)(implicit cmp: math.Ordering[B]): A
111.  def maxByOption[B](f: (A) => B)(implicit cmp: math.Ordering[B]): Option[A]
112.  def maxOption[B >: A](implicit ord: math.Ordering[B]): Option[A]
113.  def min[B >: A](implicit ord: math.Ordering[B]): A
114.  def minBy[B](f: (A) => B)(implicit cmp: math.Ordering[B]): A
115.  def minByOption[B](f: (A) => B)(implicit cmp: math.Ordering[B]): Option[A]
116.  def minOption[B >: A](implicit ord: math.Ordering[B]): Option[A]
117.  final def mkString: String
118.  final def mkString(sep: String): String
119.  final def mkString(start: String, sep: String, end: String): String
120.  final def ne(arg0: AnyRef): Boolean
121.  def newSpecificBuilder: Builder[A, IndexedSeq[A]]
122.  def nonEmpty: Boolean
123.  final def notify(): Unit
124.  final def notifyAll(): Unit
125.  def occCounts[B](sq: Seq[B]): mutable.Map[B, Int]
126.  def orElse[A1 <: Int, B1 >: A](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
127.  def padTo[B >: A](len: Int, elem: B): IndexedSeq[B]
128.  def partition(p: (A) => Boolean): (IndexedSeq[A], IndexedSeq[A])
129.  def partitionMap[A1, A2](f: (A) => Either[A1, A2]): (IndexedSeq[A1], IndexedSeq[A2])
130.  def patch[B >: A](from: Int, other: IterableOnce[B], replaced: Int): IndexedSeq[B]
131.  def permutations: Iterator[IndexedSeq[A]]
132.  def prepended[B >: A](elem: B): IndexedSeq[B]
133.  def prependedAll[B >: A](prefix: IterableOnce[B]): IndexedSeq[B]
134.  def product[B >: A](implicit num: math.Numeric[B]): B
135.  def reduce[B >: A](op: (B, B) => B): B
136.  def reduceLeft[B >: A](op: (B, A) => B): B
137.  def reduceLeftOption[B >: A](op: (B, A) => B): Option[B]
138.  def reduceOption[B >: A](op: (B, B) => B): Option[B]
139.  def reduceRight[B >: A](op: (A, B) => B): B
140.  def reduceRightOption[B >: A](op: (A, B) => B): Option[B]
141.  def reverse: IndexedSeq[A]
142.  def reverseIterator: Iterator[A]
143.  def reversed: Iterable[A]
144.  def runWith[U](action: (A) => U): (Int) => Boolean
145.  def sameElements[B >: A](that: IterableOnce[B]): Boolean
146.  def scan[B >: A](z: B)(op: (B, B) => B): IndexedSeq[B]
147.  def scanLeft[B](z: B)(op: (B, A) => B): IndexedSeq[B]
148.  def scanRight[B](z: B)(op: (A, B) => B): IndexedSeq[B]
149.  def search[B >: A](elem: B, from: Int, to: Int)(implicit ord: math.Ordering[B]): SearchResult
150.  def search[B >: A](elem: B)(implicit ord: math.Ordering[B]): SearchResult
151.  def segmentLength(p: (A) => Boolean, from: Int): Int
152.  final def segmentLength(p: (A) => Boolean): Int
153.  final def size: Int
154.  final def sizeCompare(that: Iterable[_]): Int
155.  final def sizeCompare(otherSize: Int): Int
156.  final def sizeIs: SizeCompareOps
157.  def slice(from: Int, until: Int): IndexedSeq[A]
158.  def sliding(size: Int, step: Int): Iterator[IndexedSeq[A]]
159.  def sliding(size: Int): Iterator[IndexedSeq[A]]
160.  def sortBy[B](f: (A) => B)(implicit ord: Ordering[B]): IndexedSeq[A]
161.  def sortWith(lt: (A, A) => Boolean): IndexedSeq[A]
162.  def sorted[B >: A](implicit ord: Ordering[B]): IndexedSeq[A]
163.  def span(p: (A) => Boolean): (IndexedSeq[A], IndexedSeq[A])
164.  def splitAt(n: Int): (IndexedSeq[A], IndexedSeq[A])
165.  def startsWith[B >: A](that: IterableOnce[B], offset: Int = 0): Boolean
166.  def stepper[S <: Stepper[_]](implicit shape: StepperShape[A, S]): S with EfficientSplit
167.  def stringPrefix: String
168.  def subSequence(start: Int, end: Int): CharSequence
169.  def sum[B >: A](implicit num: math.Numeric[B]): B
170.  final def synchronized[T0](arg0: => T0): T0
171.  def tail: IndexedSeq[A]
172.  def tails: Iterator[IndexedSeq[A]]
173.  def take(n: Int): IndexedSeq[A]
174.  def takeRight(n: Int): IndexedSeq[A]
175.  def takeWhile(p: (A) => Boolean): IndexedSeq[A]
176.  def tapEach[U](f: (A) => U): IndexedSeq[A]
177.  def to[C1](factory: Factory[A, C1]): C1
178.  def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
179.  final def toBuffer[B >: A]: Buffer[B]
180.  def toIndexedSeq: immutable.IndexedSeq[A]
181.  final def toIterable: IndexedSeq.this.type
182.  def toList: immutable.List[A]
183.  def toMap[K, V](implicit ev: <:<[A, (K, V)]): immutable.Map[K, V]
184.  def toSeq: immutable.Seq[A]
185.  def toSet[B >: A]: immutable.Set[B]
186.  def toString(): String
187.  def toVector: immutable.Vector[A]
188.  def transpose[B](implicit asIterable: (A) => Iterable[B]): IndexedSeq[IndexedSeq[B]]
189.  def unapply(a: Int): Option[A]
190.  def unlift: PartialFunction[Int, B]
191.  def unzip[A1, A2](implicit asPair: (A) => (A1, A2)): (IndexedSeq[A1], IndexedSeq[A2])
192.  def unzip3[A1, A2, A3](implicit asTriple: (A) => (A1, A2, A3)): (IndexedSeq[A1], IndexedSeq[A2], IndexedSeq[A3])
193.  def updated[B >: A](index: Int, elem: B): IndexedSeq[B]
194.  def view: IndexedSeqView[A]
195.  final def wait(): Unit
196.  final def wait(arg0: Long, arg1: Int): Unit
197.  final def wait(arg0: Long): Unit
198.  def withFilter(p: (A) => Boolean): WithFilter[A, [_]IndexedSeq[_]]
199.  def zip[B](that: IterableOnce[B]): IndexedSeq[(A, B)]
200.  def zipAll[A1 >: A, B](that: Iterable[B], thisElem: A1, thatElem: B): IndexedSeq[(A1, B)]
201.  def zipWithIndex: IndexedSeq[(A, Int)]

Shadowed Implicit Value Members

1.  def length(): Int
2.  def toString(): String

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[[_]IndexedSeq[_]]
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: IndexedSeq[A]
40.  def reverseMap[B](f: (A) => B): IndexedSeq[B]
41.  def sameElements[B >: A](that: IterableOnce[B]): Boolean
42.  def seq: IndexedSeq.this.type
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]): IndexedSeq[B]
62.  def view(from: Int, until: Int): IndexedSeqView[A]
63.  def withFilter(f: (A) => Boolean): Iterator[A]
64.  def →[B](y: B): (IndexedSeq[A], B)

Inherited from IndexedSeqOps[A, IndexedSeq, IndexedSeq[A]]

Inherited from Seq[A]

Inherited from Equals

Inherited from SeqOps[A, [_]IndexedSeq[_], IndexedSeq[A]]

Inherited from PartialFunction[Int, A]

Inherited from (Int) => A

Inherited from Iterable[A]

Inherited from IterableFactoryDefaults[A, [x]IndexedSeq[x]]

Inherited from IterableOps[A, [_]IndexedSeq[_], IndexedSeq[A]]

Inherited from IterableOnceOps[A, [_]IndexedSeq[_], IndexedSeq[A]]

Inherited from IterableOnce[A]

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion SeqCharSequence fromIndexedSeq[A] to SeqCharSequence

Inherited by implicit conversion UnliftOps fromIndexedSeq[A] to UnliftOps[Int, B]

Inherited by implicit conversion iterableOnceExtensionMethods fromIndexedSeq[A] to IterableOnceExtensionMethods[A]

Inherited by implicit conversion any2stringadd fromIndexedSeq[A] to any2stringadd[IndexedSeq[A]]

Inherited by implicit conversion StringFormat fromIndexedSeq[A] to StringFormat[IndexedSeq[A]]

Inherited by implicit conversion Ensuring fromIndexedSeq[A] to Ensuring[IndexedSeq[A]]

Inherited by implicit conversion ArrowAssoc fromIndexedSeq[A] to ArrowAssoc[IndexedSeq[A]]

Ungrouped