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

abstract class AbstractIndexedSeqView[+A] extends AbstractSeqView[A] with IndexedSeqView[A]

 

Ordering

1. Alphabetic
2. By Inheritance

Inherited

1. AbstractIndexedSeqView
2. IndexedSeqView
3. IndexedSeqOps
4. AbstractSeqView
5. SeqView
6. SeqOps
7. AbstractView
8. View
9. Serializable
10. AbstractIterable
11. Iterable
12. IterableFactoryDefaults
13. IterableOps
14. IterableOnceOps
15. IterableOnce
16. AnyRef
17. 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

Instance Constructors

1.  new AbstractIndexedSeqView()

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

Ungrouped