Scala Standard Library 2.13.1 - scala.collection.IndexedSeqView.Slice (original) (raw)

class Slice[A] extends AbstractIndexedSeqView[A]

 

Ordering

1. Alphabetic
2. By Inheritance

Inherited

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

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

Ungrouped