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
|
/*
* Copyright (C) 2017-2022 Sebastiano Vigna
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package it.unimi.dsi.fastutil.shorts;
import static org.junit.Assert.assertTrue;
import java.util.Random;
import org.junit.Test;
import it.unimi.dsi.fastutil.MainRunner;
public class ShortArraysTest {
private static short[] castIdentity(int n) {
final short[] a = new short[n];
while(n-- != 0) a[n] = (short)n;
return a;
}
@Test
public void testRadixSort1() {
short[] t = { 2, 1, 0, 4 };
ShortArrays.radixSort(t);
for(int i = t.length - 1; i-- != 0;) assertTrue(t[i] <= t[i + 1]);
t = new short[] { 2, -1, 0, -4 };
ShortArrays.radixSort(t);
for(int i = t.length - 1; i-- != 0;) assertTrue(t[i] <= t[i + 1]);
t = ShortArrays.shuffle(castIdentity(100), new Random(0));
ShortArrays.radixSort(t);
for(int i = t.length - 1; i-- != 0;) assertTrue(t[i] <= t[i + 1]);
t = new short[100];
Random random = new Random(0);
for(int i = t.length; i-- != 0;) t[i] = (short)random.nextInt();
ShortArrays.radixSort(t);
for(int i = t.length - 1; i-- != 0;) assertTrue(t[i] <= t[i + 1]);
t = new short[100000];
random = new Random(0);
for(int i = t.length; i-- != 0;) t[i] = (short)random.nextInt();
ShortArrays.radixSort(t);
for(int i = t.length - 1; i-- != 0;) assertTrue(t[i] <= t[i + 1]);
t = new short[10000000];
random = new Random(0);
for(int i = t.length; i-- != 0;) t[i] = (short)random.nextInt();
ShortArrays.radixSort(t);
for(int i = t.length - 1; i-- != 0;) assertTrue(t[i] <= t[i + 1]);
}
@Test
public void testRadixSort2() {
final short[][] d = new short[2][];
d[0] = new short[10];
for(int i = d[0].length; i-- != 0;) d[0][i] = (short)(3 - i % 3);
d[1] = ShortArrays.shuffle(castIdentity(10), new Random(0));
ShortArrays.radixSort(d[0], d[1]);
for(int i = d[0].length - 1; i-- != 0;) assertTrue(Integer.toString(i) + ": <" + d[0][i] + ", " + d[1][i] + ">, <" + d[0][i + 1] + ", " + d[1][i + 1] + ">", d[0][i] < d[0][i + 1] || d[0][i] == d[0][i + 1] && d[1][i] <= d[1][i + 1]);
d[0] = new short[100000];
for(int i = d[0].length; i-- != 0;) d[0][i] = (short)(100 - i % 100);
d[1] = ShortArrays.shuffle(castIdentity(100000), new Random(6));
ShortArrays.radixSort(d[0], d[1]);
for(int i = d[0].length - 1; i-- != 0;) assertTrue(Integer.toString(i) + ": <" + d[0][i] + ", " + d[1][i] + ">, <" + d[0][i + 1] + ", " + d[1][i + 1] + ">", d[0][i] < d[0][i + 1] || d[0][i] == d[0][i + 1] && d[1][i] <= d[1][i + 1]);
d[0] = new short[10];
for(int i = d[0].length; i-- != 0;) d[0][i] = (short)(i % 3 - 2);
Random random = new Random(0);
d[1] = new short[d[0].length];
for(int i = d.length; i-- != 0;) d[1][i] = (short)random.nextInt();
ShortArrays.radixSort(d[0], d[1]);
for(int i = d[0].length - 1; i-- != 0;) assertTrue(Integer.toString(i) + ": <" + d[0][i] + ", " + d[1][i] + ">, <" + d[0][i + 1] + ", " + d[1][i + 1] + ">", d[0][i] < d[0][i + 1] || d[0][i] == d[0][i + 1] && d[1][i] <= d[1][i + 1]);
d[0] = new short[100000];
random = new Random(0);
for(int i = d[0].length; i-- != 0;) d[0][i] = (short)random.nextInt();
d[1] = new short[d[0].length];
for(int i = d.length; i-- != 0;) d[1][i] = (short)random.nextInt();
ShortArrays.radixSort(d[0], d[1]);
for(int i = d[0].length - 1; i-- != 0;) assertTrue(Integer.toString(i) + ": <" + d[0][i] + ", " + d[1][i] + ">, <" + d[0][i + 1] + ", " + d[1][i + 1] + ">", d[0][i] < d[0][i + 1] || d[0][i] == d[0][i + 1] && d[1][i] <= d[1][i + 1]);
d[0] = new short[10000000];
random = new Random(0);
for(int i = d[0].length; i-- != 0;) d[0][i] = (short)random.nextInt();
d[1] = new short[d[0].length];
for(int i = d.length; i-- != 0;) d[1][i] = (short)random.nextInt();
ShortArrays.radixSort(d[0], d[1]);
for(int i = d[0].length - 1; i-- != 0;) assertTrue(Integer.toString(i) + ": <" + d[0][i] + ", " + d[1][i] + ">, <" + d[0][i + 1] + ", " + d[1][i + 1] + ">", d[0][i] < d[0][i + 1] || d[0][i] == d[0][i + 1] && d[1][i] <= d[1][i + 1]);
}
@Test
public void testRadixSort() {
final short[][] t = { { 2, 1, 0, 4 } };
ShortArrays.radixSort(t);
for(int i = t[0].length - 1; i-- != 0;) assertTrue(t[0][i] <= t[0][i + 1]);
t[0] = ShortArrays.shuffle(castIdentity(100), new Random(0));
ShortArrays.radixSort(t);
for(int i = t[0].length - 1; i-- != 0;) assertTrue(t[0][i] <= t[0][i + 1]);
final short[][] d = new short[2][];
d[0] = new short[10];
for(int i = d[0].length; i-- != 0;) d[0][i] = (short)(3 - i % 3);
d[1] = ShortArrays.shuffle(castIdentity(10), new Random(0));
ShortArrays.radixSort(d);
for(int i = d[0].length - 1; i-- != 0;) assertTrue(Integer.toString(i) + ": <" + d[0][i] + ", " + d[1][i] + ">, <" + d[0][i + 1] + ", " + d[1][i + 1] + ">", d[0][i] < d[0][i + 1] || d[0][i] == d[0][i + 1] && d[1][i] <= d[1][i + 1]);
d[0] = new short[100000];
for(int i = d[0].length; i-- != 0;) d[0][i] = (short)(100 - i % 100);
d[1] = ShortArrays.shuffle(castIdentity(100000), new Random(6));
ShortArrays.radixSort(d);
for(int i = d[0].length - 1; i-- != 0;) assertTrue(Integer.toString(i) + ": <" + d[0][i] + ", " + d[1][i] + ">, <" + d[0][i + 1] + ", " + d[1][i + 1] + ">", d[0][i] < d[0][i + 1] || d[0][i] == d[0][i + 1] && d[1][i] <= d[1][i + 1]);
d[0] = new short[10];
Random random = new Random(0);
for(int i = d[0].length; i-- != 0;) d[0][i] = (short)random.nextInt();
d[1] = new short[d[0].length];
for(int i = d.length; i-- != 0;) d[1][i] = (short)random.nextInt();
ShortArrays.radixSort(d);
for(int i = d[0].length - 1; i-- != 0;) assertTrue(Integer.toString(i) + ": <" + d[0][i] + ", " + d[1][i] + ">, <" + d[0][i + 1] + ", " + d[1][i + 1] + ">", d[0][i] < d[0][i + 1] || d[0][i] == d[0][i + 1] && d[1][i] <= d[1][i + 1]);
d[0] = new short[100000];
random = new Random(0);
for(int i = d[0].length; i-- != 0;) d[0][i] = (short)random.nextInt();
d[1] = new short[d[0].length];
for(int i = d.length; i-- != 0;) d[1][i] = (short)random.nextInt();
ShortArrays.radixSort(d);
for(int i = d[0].length - 1; i-- != 0;) assertTrue(Integer.toString(i) + ": <" + d[0][i] + ", " + d[1][i] + ">, <" + d[0][i + 1] + ", " + d[1][i + 1] + ">", d[0][i] < d[0][i + 1] || d[0][i] == d[0][i + 1] && d[1][i] <= d[1][i + 1]);
d[0] = new short[10000000];
random = new Random(0);
for(int i = d[0].length; i-- != 0;) d[0][i] = (short)random.nextInt();
d[1] = new short[d[0].length];
for(int i = d.length; i-- != 0;) d[1][i] = (short)random.nextInt();
ShortArrays.radixSort(d);
for(int i = d[0].length - 1; i-- != 0;) assertTrue(Integer.toString(i) + ": <" + d[0][i] + ", " + d[1][i] + ">, <" + d[0][i + 1] + ", " + d[1][i + 1] + ">", d[0][i] < d[0][i + 1] || d[0][i] == d[0][i + 1] && d[1][i] <= d[1][i + 1]);
}
@Test
public void testLegacyMainMethodTests() throws Exception {
MainRunner.callMainIfExists(ShortArrays.class, "test", /*num=*/"1000", /*seed=*/"848747");
}
}
|
