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
|
/*
* 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;
import static org.junit.Assert.assertTrue;
import java.util.Random;
import org.junit.Test;
import it.unimi.dsi.fastutil.ints.IntArrays;
import it.unimi.dsi.fastutil.ints.IntArraysTest;
public class ArraysTest {
private static void testMergeSort(final int x[]) {
testMergeSort(x, 0, x.length);
}
private static void testMergeSort(final int x[], final int from, final int to) {
Arrays.mergeSort(from, to, (k1, k2) -> Integer.compare(x[k1], x[k2]), (k1, k2) -> {
final int t = x[k1];
x[k1] = x[k2];
x[k2] = t;
});
for(int i = to - 1; i-- != from;) assertTrue(x[i] <= x[i + 1]);
}
@Test
public void testMergeSort() {
testMergeSort(new int[] { 2, 1, 0, 4 });
testMergeSort(new int[] { 2, -1, 0, -4 });
testMergeSort(IntArrays.shuffle(IntArraysTest.identity(100), new Random(0)));
int[] t = new int[100];
Random random = new Random(0);
for(int i = t.length; i-- != 0;) t[i] = random.nextInt();
testMergeSort(t);
t = new int[100000];
random = new Random(0);
for(int i = t.length; i-- != 0;) t[i] = random.nextInt();
testMergeSort(t);
for(int i = 100; i-- != 10;) t[i] = random.nextInt();
testMergeSort(t, 10, 100);
for(int i = t.length; i-- != 0;) t[i] = random.nextInt() & 0xF;
testMergeSort(t);
t = new int[10000000];
random = new Random(0);
for(int i = t.length; i-- != 0;) t[i] = random.nextInt();
testMergeSort(t);
}
private static void testQuickSort(final int x[]) {
testQuickSort(x, 0, x.length);
}
private static void testQuickSort(final int x[], final int from, final int to) {
Arrays.quickSort(from, to, (k1, k2) -> Integer.compare(x[k1], x[k2]), (k1, k2) -> {
final int t = x[k1];
x[k1] = x[k2];
x[k2] = t;
});
for(int i = to - 1; i-- != from;) assertTrue(x[i] <= x[i + 1]);
}
@Test
public void testQuickSort() {
testQuickSort(new int[] { 2, 1, 0, 4 });
testQuickSort(new int[] { 2, -1, 0, -4 });
testQuickSort(IntArrays.shuffle(IntArraysTest.identity(100), new Random(0)));
int[] t = new int[100];
Random random = new Random(0);
for(int i = t.length; i-- != 0;) t[i] = random.nextInt();
testQuickSort(t);
t = new int[100000];
random = new Random(0);
for(int i = t.length; i-- != 0;) t[i] = random.nextInt();
testQuickSort(t);
for(int i = 100; i-- != 10;) t[i] = random.nextInt();
testQuickSort(t, 10, 100);
for(int i = t.length; i-- != 0;) t[i] = random.nextInt() & 0xF;
testQuickSort(t);
t = new int[10000000];
random = new Random(0);
for(int i = t.length; i-- != 0;) t[i] = random.nextInt();
testQuickSort(t);
}
private static void testParallelQuickSort(final int x[]) {
testParallelQuickSort(x, 0, x.length);
}
private static void testParallelQuickSort(final int x[], final int from, final int to) {
Arrays.parallelQuickSort(from, to, (k1, k2) -> Integer.compare(x[k1], x[k2]), (k1, k2) -> {
final int t = x[k1];
x[k1] = x[k2];
x[k2] = t;
});
for(int i = to - 1; i-- != from;) assertTrue(x[i] <= x[i + 1]);
}
@Test
public void testParallelQuickSort() {
testParallelQuickSort(new int[] { 2, 1, 0, 4 });
testParallelQuickSort(new int[] { 2, -1, 0, -4 });
testParallelQuickSort(IntArrays.shuffle(IntArraysTest.identity(100), new Random(0)));
int[] t = new int[100];
Random random = new Random(0);
for(int i = t.length; i-- != 0;) t[i] = random.nextInt();
testParallelQuickSort(t);
t = new int[100000];
random = new Random(0);
for(int i = t.length; i-- != 0;) t[i] = random.nextInt();
testParallelQuickSort(t);
for(int i = 100; i-- != 10;) t[i] = random.nextInt();
testParallelQuickSort(t, 10, 100);
for(int i = t.length; i-- != 0;) t[i] = random.nextInt() & 0xF;
testParallelQuickSort(t);
t = new int[10000000];
random = new Random(0);
for(int i = t.length; i-- != 0;) t[i] = random.nextInt();
testParallelQuickSort(t);
}
@Test(expected = ArrayIndexOutOfBoundsException.class)
public void testEnsureOffSetLength() {
Arrays.ensureOffsetLength(42, Integer.MAX_VALUE, 10);
}
}
|
