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

sealed class NumericRange[T] extends AbstractSeq[T] with IndexedSeq[T] with IndexedSeqOps[T, IndexedSeq, IndexedSeq[T]] with StrictOptimizedSeqOps[T, IndexedSeq, IndexedSeq[T]] with IterableFactoryDefaults[T, IndexedSeq] with Serializable

 

Ordering

1. Alphabetic
2. By Inheritance

Inherited

1. NumericRange
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 UnliftOps

2. by iterableOnceExtensionMethods

3. by any2stringadd

4. by StringFormat

5. by Ensuring

6. by ArrowAssoc

7. Hide All

8. Show All

Visibility

1. Public
2. Protected

Instance Constructors

1.  new NumericRange(start: T, end: T, step: T, isInclusive: Boolean)(implicit num: Integral[T])

Value Members

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

Deprecated Value Members

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

Inherited from java.io.Serializable

Inherited from StrictOptimizedSeqOps[T, IndexedSeq, IndexedSeq[T]]

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

Inherited from StrictOptimizedIterableOps[T, IndexedSeq, IndexedSeq[T]]

Inherited from IndexedSeq[T]

Inherited from IndexedSeqOps[T, IndexedSeq, IndexedSeq[T]]

Inherited from collection.IndexedSeq[T]

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

Inherited from AbstractSeq[T]

Inherited from Seq[T]

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

Inherited from Iterable[T]

Inherited from collection.AbstractSeq[T]

Inherited from collection.Seq[T]

Inherited from Equals

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

Inherited from PartialFunction[Int, T]

Inherited from (Int) => T

Inherited from AbstractIterable[T]

Inherited from collection.Iterable[T]

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

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

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

Inherited from IterableOnce[T]

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion UnliftOps fromNumericRange[T] to UnliftOps[Int, B]

Inherited by implicit conversion iterableOnceExtensionMethods fromNumericRange[T] to IterableOnceExtensionMethods[T]

Inherited by implicit conversion any2stringadd fromNumericRange[T] to any2stringadd[NumericRange[T]]

Inherited by implicit conversion StringFormat fromNumericRange[T] to StringFormat[NumericRange[T]]

Inherited by implicit conversion Ensuring fromNumericRange[T] to Ensuring[NumericRange[T]]

Inherited by implicit conversion ArrowAssoc fromNumericRange[T] to ArrowAssoc[NumericRange[T]]

Ungrouped