Scala Standard Library 2.13.1 - 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 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

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

Shadowed Implicit Value Members

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

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 hasDefiniteSize: Boolean
21.  def isEmpty: Boolean
22.  def map[B](f: (T) => B): IterableOnce[B]
23.  def max(implicit ord: math.Ordering[T]): T
24.  def maxBy[B](f: (T) => B)(implicit cmp: math.Ordering[B]): T
25.  def min(implicit ord: math.Ordering[T]): T
26.  def minBy[B](f: (T) => B)(implicit cmp: math.Ordering[B]): T
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: (T) => Boolean): Int
32.  def product(implicit num: math.Numeric[T]): T
33.  def reduce(f: (T, T) => T): T
34.  def reduceLeft(f: (T, T) => T): T
35.  def reduceLeftOption(f: (T, T) => T): Option[T]
36.  def reduceOption(f: (T, T) => T): Option[T]
37.  def reduceRight(f: (T, T) => T): T
38.  def reduceRightOption(f: (T, T) => T): Option[T]
39.  final def repr: IndexedSeq[T]
40.  def reverseMap[B](f: (T) => B): IndexedSeq[B]
41.  def sameElements[B >: A](that: IterableOnce[B]): Boolean
42.  def seq: NumericRange.this.type
43.  def size: Int
44.  def sum(implicit num: math.Numeric[T]): T
45.  def to[C1](factory: Factory[T, C1]): C1
46.  def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
47.  def toBuffer[B >: A]: Buffer[B]
48.  def toIndexedSeq: collection.IndexedSeq[T]
49.  final def toIterable: collection.Iterable[T]
50.  def toIterator: Iterator[T]
51.  final def toIterator: Iterator[T]
52.  def toList: List[T]
53.  def toMap[K, V](implicit ev: <:<[T, (K, V)]): Map[K, V]
54.  def toSeq: Seq[T]
55.  def toSet[B >: A]: Set[B]
56.  def toStream: Stream[T]
57.  final def toStream: Stream[T]
58.  final def toTraversable: collection.Traversable[T]
59.  final def toTraversable: collection.Traversable[T]
60.  def toVector: Vector[T]
61.  final def union[B >: T](that: collection.Seq[B]): IndexedSeq[B]
62.  def view(from: Int, until: Int): IndexedSeqView[T]
63.  def withFilter(f: (T) => Boolean): Iterator[T]
64.  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 SeqCharSequence fromNumericRange[T] to SeqCharSequence

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