1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
|
/* __ *\
** ________ ___ / / ___ Scala API **
** / __/ __// _ | / / / _ | (c) 2006-2009, LAMP/EPFL **
** __\ \/ /__/ __ |/ /__/ __ | http://scala-lang.org/ **
** /____/\___/_/ |_/____/_/ | | **
** |/ **
\* */
// $Id$
package scala
import collection.immutable.Vector
import collection.generic.VectorView
/** <p>
* <code>GenericRange</code> is a generified version of the
* <code>Range</code> class which works with arbitrary types.
* It must be supplied with Integral and Ordering implementations
* of the range type.
*
* Built-in incarnations include BigIntRange and LongRange.
* </p><pre>
* <b>val</b> r1 = new Range(0, 100, 1)
* <b>val</b> veryBig = Math.MAX_INT.toLong + 1
* <b>val</b> r2 = new LongRange(veryBig, veryBig + 100, 1)
* assert(r1 sameElements r2.map(_ - veryBig))
* </pre>
*
* @author Paul Phillips
* @version 2.8
*/
class GenericRange[T]
(val start: T, val end: T, val step: T)
(implicit num: Integral[T], ord: Ordering[T])
extends VectorView[T, Vector[T]] with RangeToString[T] {
import num._
import ord._
// todo? - we could lift the length restriction by implementing a range as a sequence of
// subranges and limiting the subranges to MAX_INT. There's no other way around it because
// the generics we inherit assume integer-based indexing (as well they should.)
require(step !== zero)
require(genericLength <= fromInt(Math.MAX_INT), "Implementation restricts ranges to Math.MAX_INT elements.")
protected def underlying = Vector.empty[T]
/** Create a new range with the start and end values of this range and
* a new <code>step</code>.
*/
def by(step: T): GenericRange[T] = new GenericRange(start, end, step)
override def foreach[U](f: T => U) {
var i = start
if (step > zero) {
while (i < end) {
f(i)
i = i + step
}
} else {
while (i > end) {
f(i)
i = i + step
}
}
}
lazy val genericLength: T = {
def plen(start: T, end: T, step: T) =
if (end <= start) zero
else (end - start - one) / step + one
// if (lteq(end, start)) zero
// else plus(quot((minus(minus(end, start), one)), step), one)
if (step > zero) plen(start, end, step)
else plen(end, start, -step)
}
lazy val length: Int = toInt(genericLength)
// Since apply(Int) already exists, we are not allowed apply(T) since
// they erase to the same thing.
def apply(idx: Int): T = applyAt(fromInt(idx))
def applyAt(idx: T): T = {
if (idx < zero || idx >= genericLength) throw new IndexOutOfBoundsException(idx.toString)
start + idx * step
}
override def contains(_x: Any): Boolean = {
// XXX - can we avoid this cast and still have a contains method?
val x =
try { _x.asInstanceOf[T] }
catch { case _: ClassCastException => return false }
if (step > zero) start <= x && x < end
else start >= x && x > end
}
def inclusive = GenericRange.inclusive(start, end, step)
}
private[scala] trait RangeToString[T] extends VectorView[T, Vector[T]] {
// The default toString() tries to print every element and will exhaust memory
// if the Range is unduly large. This interacts poorly with the REPL.
override def toString() = {
val MAX_PRINT = 512 // some arbitrary value
val str = (this take MAX_PRINT).toString
if (length > MAX_PRINT) str.replaceAll("""\)$""", ", ...)")
else str
}
}
object GenericRange {
import Numeric._
import Ordering._
// This is very ugly, but modelled on the existing range class for now
private class Inclusive[T](start: T, end0: T, step: T)(implicit num: Integral[T], ord: Ordering[T])
extends GenericRange(
start,
if (ord.gt(step, num.zero)) num.plus(end0, num.one) else num.minus(end0, num.one),
step)
{
self =>
override def by(step: T): GenericRange[T] = new Inclusive(start, end0, step)
}
def apply[T](start: T, end: T, step: T)(implicit num: Integral[T], ord: Ordering[T]) =
new GenericRange(start, end, step)
def inclusive[T](start: T, end: T, step: T)(implicit num: Integral[T], ord: Ordering[T]): GenericRange[T] =
new GenericRange.Inclusive(start, end, step)
}
class BigIntRange(start: BigInt, end: BigInt, step: BigInt)
extends GenericRange(start, end, step)(Numeric.BigIntIsIntegral, Ordering.BigInt) {}
class LongRange(start: Long, end: Long, step: Long)
extends GenericRange(start, end, step)(Numeric.LongIsIntegral, Ordering.Long) {}
// Illustrating genericity with IntRange, which should have the same behavior
// as the original Range class. However we leave the original Range
// indefinitely, for performance and because the compiler seems to bootstrap
// off it and won't do so with our parameterized version without modifications.
class IntRange(start: Int, end: Int, step: Int)
extends GenericRange(start, end, step)(Numeric.IntIsIntegral, Ordering.Int) {}
/** <p>
* The <code>Range</code> class represents integer values in range
* <code>[start;end)</code> with non-zero step value <code>step</code>.
* Sort of acts like a sequence also (supports length and contains).
* For example:
* </p><pre>
* <b>val</b> r1 = 0 until 10
* <b>val</b> r2 = r1.start until r1.end by r1.step + 1
* println(r2.length) // = 5
* </pre>
*
* @author Martin Odersky
* @version 2.8
*/
class Range(val start: Int, val end: Int, val step: Int)
extends VectorView[Int, Vector[Int]] with RangeToString[Int]
{
require(step != 0)
protected def underlying = Vector.empty[Int]
/** Create a new range with the start and end values of this range and
* a new <code>step</code>.
*/
def by(step: Int): Range = new Range(start, end, step)
final override def foreach[U](f: Int => U) {
var i = start
if (step > 0) {
while (i < end) {
f(i)
i += step
}
} else {
while (i > end) {
f(i)
i += step
}
}
}
lazy val length: Int = {
def plen(start: Int, end: Int, step: Int) =
if (end <= start) 0 else (end - start - 1) / step + 1
if (step > 0) plen(start, end, step)
else plen(end, start, -step)
}
@inline
final def apply(idx: Int): Int = {
if (idx < 0 || idx >= length) throw new IndexOutOfBoundsException(idx.toString)
start + idx * step
}
def contains(x: Int): Boolean =
if (step > 0) start <= x && x < end
else start >= x && x > end
def inclusive = Range.inclusive(start, end, step)
}
object Range {
/** @deprecated use Range.inclusive instead */
final class Inclusive(start: Int, end0: Int, step: Int)
extends Range(start, if (step > 0) end0 + 1 else end0 - 1, step) { self =>
override def by(step: Int): Range = new Inclusive(start, end0, step)
}
def apply(start: Int, end: Int, step: Int) =
new Range(start, end, step)
def inclusive(start: Int, end: Int, step: Int): Range =
new Range.Inclusive(start, end, step)
}
|
