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
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
|
//Tags: JDK1.2
//Copyright (C) 2004 David Gilbert <david.gilbert@object-refinery.com>
//This file is part of Mauve.
//Mauve is free software; you can redistribute it and/or modify
//it under the terms of the GNU General Public License as published by
//the Free Software Foundation; either version 2, or (at your option)
//any later version.
//Mauve is distributed in the hope that it will be useful,
//but WITHOUT ANY WARRANTY; without even the implied warranty of
//MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
//GNU General Public License for more details.
//You should have received a copy of the GNU General Public License
//along with Mauve; see the file COPYING. If not, write to
//the Free Software Foundation, 59 Temple Place - Suite 330,
//Boston, MA 02111-1307, USA.
package gnu.testlet.java.util.Arrays;
import gnu.testlet.TestHarness;
import gnu.testlet.Testlet;
import java.util.Arrays;
import java.util.Comparator;
/**
* Some tests for the binarySearch() method in the {@link Arrays} class.
*/
public class binarySearch implements Testlet
{
/**
* Runs the test using the specified harness.
*
* @param harness the test harness (<code>null</code> not permitted).
*/
public void test(TestHarness harness) {
testByte(harness);
testChar(harness);
testDouble(harness);
testFloat(harness);
testInt(harness);
testLong(harness);
testObject(harness);
testShort(harness);
}
private void testByte(TestHarness harness)
{
harness.checkPoint("Arrays.binarySearch(byte[], byte)");
byte[] b1 = new byte[] {1, 2, 3};
harness.check(Arrays.binarySearch(b1, (byte) 0) == -1);
harness.check(Arrays.binarySearch(b1, (byte) 1) == 0);
harness.check(Arrays.binarySearch(b1, (byte) 2) == 1);
harness.check(Arrays.binarySearch(b1, (byte) 3) == 2);
harness.check(Arrays.binarySearch(b1, (byte) 4) == -4);
boolean pass = false;
try
{
Arrays.binarySearch((byte[]) null, (byte) 0);
}
catch (NullPointerException e)
{
pass = true;
}
harness.check(pass);
b1 = new byte[0];
harness.check(Arrays.binarySearch(b1, (byte)0), -1);
}
private void testChar(TestHarness harness)
{
harness.checkPoint("Arrays.binarySearch(char[], char)");
char[] b1 = new char[] {'1', '2', '3'};
harness.check(Arrays.binarySearch(b1, '0') == -1);
harness.check(Arrays.binarySearch(b1, '1') == 0);
harness.check(Arrays.binarySearch(b1, '2') == 1);
harness.check(Arrays.binarySearch(b1, '3') == 2);
harness.check(Arrays.binarySearch(b1, '4') == -4);
boolean pass = false;
try
{
Arrays.binarySearch((char[]) null, '0');
}
catch (NullPointerException e)
{
pass = true;
}
harness.check(pass);
b1 = new char[0];
harness.check(Arrays.binarySearch(b1, '0'), -1);
}
private void testDouble(TestHarness harness)
{
harness.checkPoint("Arrays.binarySearch(double[], double)");
double[] b1 = new double[] {1.0, 2.0, 3.0};
harness.check(Arrays.binarySearch(b1, 0.0) == -1);
harness.check(Arrays.binarySearch(b1, 1.0) == 0);
harness.check(Arrays.binarySearch(b1, 2.0) == 1);
harness.check(Arrays.binarySearch(b1, 3.0) == 2);
harness.check(Arrays.binarySearch(b1, 4.0) == -4);
boolean pass = false;
try
{
Arrays.binarySearch((double[]) null, 0.0);
}
catch (NullPointerException e)
{
pass = true;
}
harness.check(pass);
b1 = new double[0];
harness.check(Arrays.binarySearch(b1, 0.0), -1);
}
private void testFloat(TestHarness harness)
{
harness.checkPoint("Arrays.binarySearch(float[], float)");
float[] b1 = new float[] {1.0f, 2.0f, 3.0f};
harness.check(Arrays.binarySearch(b1, 0.0f) == -1);
harness.check(Arrays.binarySearch(b1, 1.0f) == 0);
harness.check(Arrays.binarySearch(b1, 2.0f) == 1);
harness.check(Arrays.binarySearch(b1, 3.0f) == 2);
harness.check(Arrays.binarySearch(b1, 4.0f) == -4);
boolean pass = false;
try
{
Arrays.binarySearch((float[]) null, 0.0f);
}
catch (NullPointerException e)
{
pass = true;
}
harness.check(pass);
b1 = new float[0];
harness.check(Arrays.binarySearch(b1, 0.0f), -1);
}
private void testInt(TestHarness harness)
{
harness.checkPoint("Arrays.binarySearch(int[], int)");
int[] b1 = new int[] {1, 2, 3};
harness.check(Arrays.binarySearch(b1, 0) == -1);
harness.check(Arrays.binarySearch(b1, 1) == 0);
harness.check(Arrays.binarySearch(b1, 2) == 1);
harness.check(Arrays.binarySearch(b1, 3) == 2);
harness.check(Arrays.binarySearch(b1, 4) == -4);
boolean pass = false;
try
{
Arrays.binarySearch((int[]) null, 0);
}
catch (NullPointerException e)
{
pass = true;
}
harness.check(pass);
b1 = new int[0];
harness.check(Arrays.binarySearch(b1, 0), -1);
}
private void testLong(TestHarness harness)
{
harness.checkPoint("Arrays.binarySearch(long[], long)");
long[] b1 = new long[] {1, 2, 3};
harness.check(Arrays.binarySearch(b1, 0) == -1);
harness.check(Arrays.binarySearch(b1, 1) == 0);
harness.check(Arrays.binarySearch(b1, 2) == 1);
harness.check(Arrays.binarySearch(b1, 3) == 2);
harness.check(Arrays.binarySearch(b1, 4) == -4);
boolean pass = false;
try
{
Arrays.binarySearch((long[]) null, 0);
}
catch (NullPointerException e)
{
pass = true;
}
harness.check(pass);
b1 = new long[0];
harness.check(Arrays.binarySearch(b1, 0), -1);
}
private void testObject(TestHarness harness)
{
harness.checkPoint("Arrays.binarySearch(Object[], Object)");
Object[] b1 = new Object[] {"1", "2", "3"};
harness.check(Arrays.binarySearch(b1, "0") == -1);
harness.check(Arrays.binarySearch(b1, "1") == 0);
harness.check(Arrays.binarySearch(b1, "2") == 1);
harness.check(Arrays.binarySearch(b1, "3") == 2);
harness.check(Arrays.binarySearch(b1, "4") == -4);
// searching for null throws NullPointerException
boolean pass = false;
try
{
Arrays.binarySearch(b1, null);
}
catch (NullPointerException e)
{
pass = true;
}
harness.check(pass);
pass = false;
try
{
Arrays.binarySearch((Object[]) null, "0");
}
catch (NullPointerException e)
{
pass = true;
}
harness.check(pass);
harness.checkPoint("Arrays.binarySearch(Object[], Object, Comparator)");
harness.check(Arrays.binarySearch(b1, "0", (Comparator) null) == -1);
harness.check(Arrays.binarySearch(b1, "1", (Comparator) null) == 0);
harness.check(Arrays.binarySearch(b1, "2", (Comparator) null) == 1);
harness.check(Arrays.binarySearch(b1, "3", (Comparator) null) == 2);
harness.check(Arrays.binarySearch(b1, "4", (Comparator) null) == -4);
Arrays.sort(b1, new ReverseComparator());
harness.check(Arrays.binarySearch(b1, "0", new ReverseComparator()) == -4);
harness.check(Arrays.binarySearch(b1, "1", new ReverseComparator()) == 2);
harness.check(Arrays.binarySearch(b1, "2", new ReverseComparator()) == 1);
harness.check(Arrays.binarySearch(b1, "3", new ReverseComparator()) == 0);
harness.check(Arrays.binarySearch(b1, "4", new ReverseComparator()) == -1);
b1 = new Object[0];
harness.check(Arrays.binarySearch(b1, ""), -1);
}
private void testShort(TestHarness harness)
{
harness.checkPoint("Arrays.binarySearch(short[], short)");
short[] b1 = new short[] {1, 2, 3};
harness.check(Arrays.binarySearch(b1, (short) 0) == -1);
harness.check(Arrays.binarySearch(b1, (short) 1) == 0);
harness.check(Arrays.binarySearch(b1, (short) 2) == 1);
harness.check(Arrays.binarySearch(b1, (short) 3) == 2);
harness.check(Arrays.binarySearch(b1, (short) 4) == -4);
boolean pass = false;
try
{
Arrays.binarySearch((short[]) null, (short) 0);
}
catch (NullPointerException e)
{
pass = true;
}
harness.check(pass);
b1 = new short[0];
harness.check(Arrays.binarySearch(b1, (short)0), -1);
}
static class ReverseComparator implements Comparator {
public int compare(Object o1, Object o2) {
int i1 = Integer.valueOf(o1.toString()).intValue();
int i2 = Integer.valueOf(o2.toString()).intValue();
return (i2 - i1);
}
}
}
|
