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

sealed abstract class Range extends AbstractSeq[Int] with IndexedSeq[Int] with IndexedSeqOps[Int, IndexedSeq, IndexedSeq[Int]] with StrictOptimizedSeqOps[Int, IndexedSeq, IndexedSeq[Int]] with IterableFactoryDefaults[Int, IndexedSeq] with Serializable

 

Ordering

1. Alphabetic
2. By Inheritance

Inherited

1. Range
2. Serializable
3. StrictOptimizedSeqOps
4. StrictOptimizedSeqOps
5. StrictOptimizedIterableOps
6. IndexedSeq
7. IndexedSeqOps
8. IndexedSeq
9. IndexedSeqOps
10. AbstractSeq
11. Seq
12. SeqOps
13. Iterable
14. AbstractSeq
15. Seq
16. Equals
17. SeqOps
18. PartialFunction
19. Function1
20. AbstractIterable
21. Iterable
22. IterableFactoryDefaults
23. IterableOps
24. IterableOnceOps
25. IterableOnce
26. AnyRef
27. 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 isInclusive: Boolean

Concrete Value Members

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

Deprecated Value Members

1.  def /:[B](z: B)(op: (B, Int) => B): B
2.  final def /:[B](z: B)(op: (B, Int) => B): B
3.  def :\[B](z: B)(op: (Int, B) => B): B
4.  final def :\[B](z: B)(op: (Int, B) => B): B
5.  def aggregate[B](z: => B)(seqop: (B, Int) => B, combop: (B, B) => B): B
6.  def collectFirst[B](f: PartialFunction[Int, B]): Option[B]
7.  def companion: IterableFactory[[_]IndexedSeq[_]]
8.  def copyToBuffer(dest: Buffer[Int]): Unit
9.  final def copyToBuffer[B >: Int](dest: Buffer[B]): Unit
10.  def count(f: (Int) => Boolean): Int
11.  def exists(f: (Int) => Boolean): Boolean
12.  def filter(f: (Int) => Boolean): Iterator[Int]
13.  def find(p: (Int) => Boolean): Option[Int]
14.  def flatMap[B](f: (Int) => IterableOnce[B]): IterableOnce[B]
15.  def fold[A1 >: A](z: A1)(op: (A1, A1) => A1): A1
16.  def foldLeft[B](z: B)(op: (B, Int) => B): B
17.  def foldRight[B](z: B)(op: (Int, B) => B): B
18.  def forall(f: (Int) => Boolean): Boolean
19.  def foreach[U](f: (Int) => U): Unit
20.  def formatted(fmtstr: String): String
21.  def hasDefiniteSize: Boolean
22.  def isEmpty: Boolean
23.  def map[B](f: (Int) => B): IterableOnce[B]
24.  def max(implicit ord: math.Ordering[Int]): Int
25.  def maxBy[B](f: (Int) => B)(implicit cmp: math.Ordering[B]): Int
26.  def min(implicit ord: math.Ordering[Int]): Int
27.  def minBy[B](f: (Int) => B)(implicit cmp: math.Ordering[B]): Int
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: (Int) => Boolean): Int
33.  def product(implicit num: math.Numeric[Int]): Int
34.  def reduce(f: (Int, Int) => Int): Int
35.  def reduceLeft(f: (Int, Int) => Int): Int
36.  def reduceLeftOption(f: (Int, Int) => Int): Option[Int]
37.  def reduceOption(f: (Int, Int) => Int): Option[Int]
38.  def reduceRight(f: (Int, Int) => Int): Int
39.  def reduceRightOption(f: (Int, Int) => Int): Option[Int]
40.  final def repr: IndexedSeq[Int]
41.  def reverseMap[B](f: (Int) => B): IndexedSeq[B]
42.  def sameElements[B >: A](that: IterableOnce[B]): Boolean
43.  def seq: Range.this.type
44.  def size: Int
45.  def sum(implicit num: math.Numeric[Int]): Int
46.  def to[C1](factory: Factory[Int, C1]): C1
47.  def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
48.  def toBuffer[B >: A]: Buffer[B]
49.  def toIndexedSeq: collection.IndexedSeq[Int]
50.  final def toIterable: collection.Iterable[Int]
51.  final def toIterable: Range.this.type
52.  def toIterator: Iterator[Int]
53.  final def toIterator: Iterator[Int]
54.  def toList: List[Int]
55.  def toMap[K, V](implicit ev: <:<[Int, (K, V)]): Map[K, V]
56.  def toSeq: Seq[Int]
57.  def toSet[B >: A]: Set[B]
58.  def toStream: Stream[Int]
59.  final def toStream: Stream[Int]
60.  final def toTraversable: collection.Traversable[Int]
61.  final def toTraversable: collection.Traversable[Int]
62.  def toVector: Vector[Int]
63.  final def union[B >: Int](that: collection.Seq[B]): IndexedSeq[B]
64.  def view(from: Int, until: Int): IndexedSeqView[Int]
65.  def withFilter(f: (Int) => Boolean): Iterator[Int]
66.  def →[B](y: B): (Range, B)

Inherited from java.io.Serializable

Inherited from StrictOptimizedSeqOps[Int, IndexedSeq, IndexedSeq[Int]]

Inherited from collection.StrictOptimizedSeqOps[Int, IndexedSeq, IndexedSeq[Int]]

Inherited from StrictOptimizedIterableOps[Int, IndexedSeq, IndexedSeq[Int]]

Inherited from IndexedSeq[Int]

Inherited from IndexedSeqOps[Int, IndexedSeq, IndexedSeq[Int]]

Inherited from collection.IndexedSeq[Int]

Inherited from collection.IndexedSeqOps[Int, [_]IndexedSeq[_], IndexedSeq[Int]]

Inherited from AbstractSeq[Int]

Inherited from Seq[Int]

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

Inherited from Iterable[Int]

Inherited from collection.AbstractSeq[Int]

Inherited from collection.Seq[Int]

Inherited from Equals

Inherited from collection.SeqOps[Int, [_]IndexedSeq[_], IndexedSeq[Int]]

Inherited from PartialFunction[Int, Int]

Inherited from (Int) => Int

Inherited from AbstractIterable[Int]

Inherited from collection.Iterable[Int]

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

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

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

Inherited from IterableOnce[Int]

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion iterableOnceExtensionMethods fromRange to IterableOnceExtensionMethods[Int]

Inherited by implicit conversion any2stringadd fromRange to any2stringadd[Range]

Inherited by implicit conversion StringFormat fromRange to StringFormat[Range]

Inherited by implicit conversion Ensuring fromRange to Ensuring[Range]

Inherited by implicit conversion ArrowAssoc fromRange to ArrowAssoc[Range]

Ungrouped