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
|
/*
* Copyright 2010-2018 JetBrains s.r.o. Use of this source code is governed by the Apache 2.0 license
* that can be found in the license/LICENSE.txt file.
*/
package test.ranges
import kotlin.test.*
class ProgressionLastElementTest {
private val MAX = Int.MAX_VALUE
private val MIN = Int.MIN_VALUE
private val INTERESTING = intArrayOf(MIN, MIN / 2, -239, -23, -1, 0, 1, 42, 239, MAX / 2, MAX)
private fun doTest(start: Int, end: Int, increment: Int, expected: Int) {
val actualInt = IntProgression.fromClosedRange(start, end, increment).last
assertEquals(expected, actualInt)
val actualLong = LongProgression.fromClosedRange(start.toLong(), end.toLong(), increment.toLong()).last
assertEquals(expected.toLong(), actualLong)
}
@Test fun calculateFinalElement() {
// start == end
for (x in INTERESTING) {
for (increment in INTERESTING)
if (increment != 0 && increment != MIN) {
doTest(x, x, increment, x)
}
}
// increment == 1
for (start in INTERESTING.indices) {
for (end in start..INTERESTING.size - 1) {
doTest(INTERESTING[start], INTERESTING[end], 1, INTERESTING[end])
}
}
// increment == -1
for (end in INTERESTING.indices) {
for (start in end..INTERESTING.size - 1) {
doTest(INTERESTING[start], INTERESTING[end], -1, INTERESTING[end])
}
}
// end == MAX
doTest(0, MAX, MAX, MAX)
doTest(0, MAX, MAX / 2, MAX - 1)
doTest(MIN + 1, MAX, MAX, MAX)
doTest(MAX - 7, MAX, 3, MAX - 1)
doTest(MAX - 7, MAX, MAX, MAX - 7)
doTest(0, MAX, -3, MAX)
// end == MIN
doTest(0, MIN, -MAX, -MAX)
doTest(0, MIN, MIN / 2, MIN)
doTest(MAX, MIN, -MAX, -MAX)
doTest(MIN + 7, MIN, -3, MIN + 1)
doTest(MIN + 7, MIN, -MAX, MIN + 7)
doTest(0, MIN, 3, MIN)
}
@Test fun iterateToFinalElement() {
// Small tests
for (start in -5..4) {
for (end in -5..4) {
for (increment in -10..9) {
// Cut down incorrect test data
if (increment == 0) continue
if (increment > 0 != start <= end) continue
// Iterate over the progression and obtain the expected result
// println("$start,$end,$increment")
var x = start
while (true) {
val next = x + increment
if (next !in minOf(start, end)..maxOf(start, end)) break
x = next
}
doTest(start, end, increment, x)
}
}
}
}
}
|
