31903
|
1 |
/*
|
|
2 |
* Copyright (c) 2003, 2015, Oracle and/or its affiliates. All rights reserved.
|
|
3 |
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
|
|
4 |
*
|
|
5 |
* This code is free software; you can redistribute it and/or modify it
|
|
6 |
* under the terms of the GNU General Public License version 2 only, as
|
|
7 |
* published by the Free Software Foundation.
|
|
8 |
*
|
|
9 |
* This code is distributed in the hope that it will be useful, but WITHOUT
|
|
10 |
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
|
11 |
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
|
12 |
* version 2 for more details (a copy is included in the LICENSE file that
|
|
13 |
* accompanied this code).
|
|
14 |
*
|
|
15 |
* You should have received a copy of the GNU General Public License version
|
|
16 |
* 2 along with this work; if not, write to the Free Software Foundation,
|
|
17 |
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
|
|
18 |
*
|
|
19 |
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
|
|
20 |
* or visit www.oracle.com if you need additional information or have any
|
|
21 |
* questions.
|
|
22 |
*/
|
|
23 |
|
|
24 |
/**
|
|
25 |
* @test
|
|
26 |
* @bug 4313885 4926319 4927634 5032610 5032622 5049968 5059533 6223711 6277261 6269946 6288823
|
|
27 |
* @summary Basic tests of java.util.Scanner methods
|
|
28 |
* @key randomness
|
|
29 |
*/
|
|
30 |
|
|
31 |
import java.util.*;
|
|
32 |
import java.text.*;
|
|
33 |
import java.io.*;
|
|
34 |
import java.nio.*;
|
|
35 |
import java.util.regex.*;
|
|
36 |
import java.math.*;
|
|
37 |
|
|
38 |
public class ScanTest {
|
|
39 |
|
|
40 |
private static boolean failure = false;
|
|
41 |
private static int failCount = 0;
|
|
42 |
private static int NUM_SOURCE_TYPES = 2;
|
|
43 |
|
|
44 |
public static void main(String[] args) throws Exception {
|
|
45 |
Locale reservedLocale = Locale.getDefault();
|
|
46 |
String lang = reservedLocale.getLanguage();
|
|
47 |
try {
|
|
48 |
if (!"en".equals(lang) &&
|
|
49 |
!"zh".equals(lang) &&
|
|
50 |
!"ko".equals(lang) &&
|
|
51 |
!"ja".equals(lang)) {
|
|
52 |
//Before we have resource to improve the test to be ready for
|
|
53 |
//arbitrary locale, force the default locale to be "English"
|
|
54 |
//for now.
|
|
55 |
Locale.setDefault(Locale.ENGLISH);
|
|
56 |
}
|
|
57 |
skipTest();
|
|
58 |
findInLineTest();
|
|
59 |
findWithinHorizonTest();
|
|
60 |
findInEmptyLineTest();
|
|
61 |
removeTest();
|
|
62 |
fromFileTest();
|
|
63 |
ioExceptionTest();
|
|
64 |
matchTest();
|
|
65 |
delimiterTest();
|
|
66 |
useLocaleTest();
|
|
67 |
closeTest();
|
|
68 |
cacheTest();
|
|
69 |
cacheTest2();
|
|
70 |
nonASCIITest();
|
|
71 |
resetTest();
|
|
72 |
|
|
73 |
for (int j=0; j<NUM_SOURCE_TYPES; j++) {
|
|
74 |
hasNextTest(j);
|
|
75 |
nextTest(j);
|
|
76 |
hasNextPatternTest(j);
|
|
77 |
nextPatternTest(j);
|
|
78 |
booleanTest(j);
|
|
79 |
byteTest(j);
|
|
80 |
shortTest(j);
|
|
81 |
intTest(j);
|
|
82 |
longTest(j);
|
|
83 |
floatTest(j);
|
|
84 |
doubleTest(j);
|
|
85 |
integerPatternTest(j);
|
|
86 |
floatPatternTest(j);
|
|
87 |
bigIntegerPatternTest(j);
|
|
88 |
bigDecimalPatternTest(j);
|
|
89 |
hasNextLineTest(j);
|
|
90 |
nextLineTest(j);
|
|
91 |
singleDelimTest(j);
|
|
92 |
}
|
|
93 |
|
|
94 |
// Examples
|
|
95 |
//example1();
|
|
96 |
//example2();
|
|
97 |
//example3();
|
|
98 |
|
|
99 |
// Usage cases
|
|
100 |
useCase1();
|
|
101 |
useCase2();
|
|
102 |
useCase3();
|
|
103 |
useCase4();
|
|
104 |
useCase5();
|
|
105 |
|
|
106 |
if (failure)
|
|
107 |
throw new RuntimeException("Failure in the scanning tests.");
|
|
108 |
else
|
|
109 |
System.err.println("OKAY: All tests passed.");
|
|
110 |
} finally {
|
|
111 |
// restore the default locale
|
|
112 |
Locale.setDefault(reservedLocale);
|
|
113 |
}
|
|
114 |
}
|
|
115 |
|
|
116 |
public static void useCase1() throws Exception {
|
|
117 |
File f = new File(System.getProperty("test.src", "."), "input.txt");
|
|
118 |
Scanner sc = new Scanner(f);
|
|
119 |
sc.findWithinHorizon("usage case 1", 0);
|
|
120 |
String[] names = new String[4];
|
|
121 |
for (int i=0; i<4; i++) {
|
|
122 |
while(sc.hasNextFloat())
|
|
123 |
sc.nextFloat();
|
|
124 |
names[i] = sc.next();
|
|
125 |
sc.nextLine();
|
|
126 |
}
|
|
127 |
if (!names[0].equals("Frank"))
|
|
128 |
failCount++;
|
|
129 |
if (!names[1].equals("Joe"))
|
|
130 |
failCount++;
|
|
131 |
if (!names[2].equals("Mary"))
|
|
132 |
failCount++;
|
|
133 |
if (!names[3].equals("Michelle"))
|
|
134 |
failCount++;
|
|
135 |
sc.close();
|
|
136 |
report("Use case 1");
|
|
137 |
}
|
|
138 |
|
|
139 |
public static void useCase2() throws Exception {
|
|
140 |
File f = new File(System.getProperty("test.src", "."), "input.txt");
|
|
141 |
Scanner sc = new Scanner(f).useDelimiter("-");
|
|
142 |
String testDataTag = sc.findWithinHorizon("usage case 2\n", 0);
|
|
143 |
if (!testDataTag.equals("usage case 2\n"))
|
|
144 |
failCount++;
|
|
145 |
if (!sc.next().equals("cat"))
|
|
146 |
failCount++;
|
|
147 |
if (sc.nextInt() != 9)
|
|
148 |
failCount++;
|
|
149 |
if (!sc.next().equals("dog"))
|
|
150 |
failCount++;
|
|
151 |
if (sc.nextInt() != 6)
|
|
152 |
failCount++;
|
|
153 |
if (!sc.next().equals("pig"))
|
|
154 |
failCount++;
|
|
155 |
if (sc.nextInt() != 2)
|
|
156 |
failCount++;
|
|
157 |
if (!sc.next().equals(""))
|
|
158 |
failCount++;
|
|
159 |
if (sc.nextInt() != 5)
|
|
160 |
failCount++;
|
|
161 |
sc.close();
|
|
162 |
report("Use case 2");
|
|
163 |
}
|
|
164 |
|
|
165 |
public static void useCase3() throws Exception {
|
|
166 |
File f = new File(System.getProperty("test.src", "."), "input.txt");
|
|
167 |
Scanner sc = new Scanner(f);
|
|
168 |
String testDataTag = sc.findWithinHorizon("usage case 3\n", 0);
|
|
169 |
if (!testDataTag.equals("usage case 3\n"))
|
|
170 |
failCount++;
|
|
171 |
Pattern tagPattern = Pattern.compile("@[a-z]+");
|
|
172 |
Pattern endPattern = Pattern.compile("\\*\\/");
|
|
173 |
String tag;
|
|
174 |
String end = sc.findInLine(endPattern);
|
|
175 |
|
|
176 |
while (end == null) {
|
|
177 |
if ((tag = sc.findInLine(tagPattern)) != null) {
|
|
178 |
String text = sc.nextLine();
|
|
179 |
text = text.substring(0, text.length() - 1);
|
|
180 |
//System.out.println(text);
|
|
181 |
} else {
|
|
182 |
sc.nextLine();
|
|
183 |
}
|
|
184 |
end = sc.findInLine(endPattern);
|
|
185 |
}
|
|
186 |
report("Use case 3");
|
|
187 |
}
|
|
188 |
|
|
189 |
public static void useCase4() throws Exception {
|
|
190 |
File f = new File(System.getProperty("test.src", "."), "input.txt");
|
|
191 |
Scanner sc = new Scanner(f);
|
|
192 |
String testDataTag = sc.findWithinHorizon("usage case 4\n", 0);
|
|
193 |
if (!testDataTag.equals("usage case 4\n"))
|
|
194 |
failCount++;
|
|
195 |
|
|
196 |
// Read some text parts of four hrefs
|
|
197 |
String[] expected = { "Diffs", "Sdiffs", "Old", "New" };
|
|
198 |
for (int i=0; i<4; i++) {
|
|
199 |
sc.findWithinHorizon("<a href", 1000);
|
|
200 |
sc.useDelimiter("[<>\n]+");
|
|
201 |
sc.next();
|
|
202 |
String textOfRef = sc.next();
|
|
203 |
if (!textOfRef.equals(expected[i]))
|
|
204 |
failCount++;
|
|
205 |
}
|
|
206 |
// Read some html tags using < and > as delimiters
|
|
207 |
if (!sc.next().equals("/a"))
|
|
208 |
failCount++;
|
|
209 |
if (!sc.next().equals("b"))
|
|
210 |
failCount++;
|
|
211 |
|
|
212 |
// Scan some html tags using skip and next
|
|
213 |
Pattern nonTagStart = Pattern.compile("[^<]+");
|
|
214 |
Pattern tag = Pattern.compile("<[^>]+?>");
|
|
215 |
Pattern spotAfterTag = Pattern.compile("(?<=>)");
|
|
216 |
String[] expected2 = { "</b>", "<p>", "<ul>", "<li>" };
|
|
217 |
sc.useDelimiter(spotAfterTag);
|
|
218 |
int tagsFound = 0;
|
|
219 |
while(tagsFound < 4) {
|
|
220 |
if (!sc.hasNext(tag)) {
|
|
221 |
// skip text between tags
|
|
222 |
sc.skip(nonTagStart);
|
|
223 |
}
|
|
224 |
String tagContents = sc.next(tag);
|
|
225 |
if (!tagContents.equals(expected2[tagsFound]))
|
|
226 |
failCount++;
|
|
227 |
tagsFound++;
|
|
228 |
}
|
|
229 |
|
|
230 |
report("Use case 4");
|
|
231 |
}
|
|
232 |
|
|
233 |
public static void useCase5() throws Exception {
|
|
234 |
File f = new File(System.getProperty("test.src", "."), "input.txt");
|
|
235 |
Scanner sc = new Scanner(f);
|
|
236 |
String testDataTag = sc.findWithinHorizon("usage case 5\n", 0);
|
|
237 |
if (!testDataTag.equals("usage case 5\n"))
|
|
238 |
failCount++;
|
|
239 |
|
|
240 |
sc.findWithinHorizon("Share Definitions", 0);
|
|
241 |
sc.nextLine();
|
|
242 |
sc.next("\\[([a-z]+)\\]");
|
|
243 |
String shareName = sc.match().group(1);
|
|
244 |
if (!shareName.equals("homes"))
|
|
245 |
failCount++;
|
|
246 |
|
|
247 |
String[] keys = { "comment", "browseable", "writable", "valid users" };
|
|
248 |
String[] vals = { "Home Directories", "no", "yes", "%S" };
|
|
249 |
for (int i=0; i<4; i++) {
|
|
250 |
sc.useDelimiter("=");
|
|
251 |
String key = sc.next().trim();
|
|
252 |
if (!key.equals(keys[i]))
|
|
253 |
failCount++;
|
|
254 |
sc.skip("[ =]+");
|
|
255 |
sc.useDelimiter("\n");
|
|
256 |
String value = sc.next();
|
|
257 |
if (!value.equals(vals[i]))
|
|
258 |
failCount++;
|
|
259 |
sc.nextLine();
|
|
260 |
}
|
|
261 |
|
|
262 |
report("Use case 5");
|
|
263 |
}
|
|
264 |
|
|
265 |
public static void nonASCIITest() throws Exception {
|
|
266 |
String yourBasicTibetanNumberZero = "\u0f20";
|
|
267 |
String yourBasicTibetanFloatingNumber = "\u0f23.\u0f27";
|
|
268 |
String weirdMixtureOfTibetanAndASCII = "\u0f23.7";
|
|
269 |
String weirdMixtureOfASCIIAndTibetan = "3.\u0f27";
|
|
270 |
Scanner sc = new Scanner(yourBasicTibetanNumberZero);
|
|
271 |
int i = sc.nextInt();
|
|
272 |
if (i != 0)
|
|
273 |
failCount++;
|
|
274 |
sc = new Scanner(yourBasicTibetanFloatingNumber);
|
|
275 |
float f = sc.nextFloat();
|
|
276 |
if (f != Float.parseFloat("3.7"))
|
|
277 |
failCount++;
|
|
278 |
sc = new Scanner(weirdMixtureOfTibetanAndASCII);
|
|
279 |
f = sc.nextFloat();
|
|
280 |
if (f != Float.parseFloat("3.7"))
|
|
281 |
failCount++;
|
|
282 |
sc = new Scanner(weirdMixtureOfASCIIAndTibetan);
|
|
283 |
f = sc.nextFloat();
|
|
284 |
if (f != Float.parseFloat("3.7"))
|
|
285 |
failCount++;
|
|
286 |
report("Scanning non ASCII digits");
|
|
287 |
}
|
|
288 |
|
|
289 |
public static void findWithinHorizonTest() throws Exception {
|
|
290 |
// Test with a string source
|
|
291 |
Scanner sc = new Scanner("dog cat cat dog cat");
|
|
292 |
try {
|
|
293 |
sc.findWithinHorizon("dog", -1);
|
|
294 |
failCount++;
|
|
295 |
} catch (IllegalArgumentException iae) {
|
|
296 |
// Correct result
|
|
297 |
}
|
|
298 |
if (sc.findWithinHorizon("dog", 2) != null)
|
|
299 |
failCount++;
|
|
300 |
if (!sc.findWithinHorizon("dog", 3).equals("dog"))
|
|
301 |
failCount++;
|
|
302 |
if (sc.findWithinHorizon("cat", 4) != null)
|
|
303 |
failCount++;
|
|
304 |
if (!sc.findWithinHorizon("cat", 5).equals("cat"))
|
|
305 |
failCount++;
|
|
306 |
if (sc.findWithinHorizon("cat", 7) != null)
|
|
307 |
failCount++;
|
|
308 |
if (sc.findWithinHorizon("dog", 7) != null)
|
|
309 |
failCount++;
|
|
310 |
if (!sc.findWithinHorizon("cat", 0).equals("cat"))
|
|
311 |
failCount++;
|
|
312 |
if (!sc.findWithinHorizon("dog", 0).equals("dog"))
|
|
313 |
failCount++;
|
|
314 |
if (!sc.findWithinHorizon("cat", 0).equals("cat"))
|
|
315 |
failCount++;
|
|
316 |
|
|
317 |
// Test with a stream source
|
|
318 |
StutteringInputStream stutter = new StutteringInputStream();
|
|
319 |
for (int index=0; index<stutter.length(); index++) {
|
|
320 |
//System.out.println("index is now "+index);
|
|
321 |
sc = new Scanner(stutter);
|
|
322 |
String word = stutter.wordInIndex(index);
|
|
323 |
if (word != null) {
|
|
324 |
String result = sc.findWithinHorizon(word, index);
|
|
325 |
if ((result == null) || (!result.equals(word)))
|
|
326 |
failCount++;
|
|
327 |
}
|
|
328 |
stutter.reset();
|
|
329 |
word = stutter.wordBeyondIndex(index);
|
|
330 |
sc = new Scanner(stutter);
|
|
331 |
String result = sc.findWithinHorizon(word, index);
|
|
332 |
if ((result != null) && (index > 0))
|
|
333 |
failCount++;
|
|
334 |
stutter.reset();
|
|
335 |
}
|
|
336 |
|
|
337 |
// We must loop to let StutteringInputStream do its magic
|
|
338 |
for (int j=0; j<10; j++) {
|
|
339 |
// An anchor at the end of stream should work
|
|
340 |
stutter.reset();
|
|
341 |
sc = new Scanner(stutter);
|
|
342 |
String result = sc.findWithinHorizon("phant$", 0);
|
|
343 |
if (!result.equals("phant"))
|
|
344 |
failCount++;
|
|
345 |
stutter.reset();
|
|
346 |
sc = new Scanner(stutter);
|
|
347 |
result = sc.findWithinHorizon("phant$", 54);
|
|
348 |
if (!result.equals("phant"))
|
|
349 |
failCount++;
|
|
350 |
// An anchor at the end of horizon should not
|
|
351 |
stutter.reset();
|
|
352 |
sc = new Scanner(stutter);
|
|
353 |
result = sc.findWithinHorizon("brummer$", 7);
|
|
354 |
if (result != null)
|
|
355 |
failCount++;
|
|
356 |
// An anchor at start should work
|
|
357 |
stutter.reset();
|
|
358 |
sc = new Scanner(stutter);
|
|
359 |
result = sc.findWithinHorizon("^brummer", 0);
|
|
360 |
if (!result.equals("brummer"))
|
|
361 |
failCount++;
|
|
362 |
}
|
|
363 |
|
|
364 |
report("Find to horizon test");
|
|
365 |
}
|
|
366 |
|
|
367 |
// StutteringInputStream returns 1 to 3 characters at a time
|
|
368 |
static class StutteringInputStream implements Readable {
|
|
369 |
StutteringInputStream() {
|
|
370 |
text = "brummer hisser tort zardzard rantrant caimagator phant";
|
|
371 |
datalen = 54;
|
|
372 |
}
|
|
373 |
StutteringInputStream(String text) {
|
|
374 |
this.text = text;
|
|
375 |
datalen = text.length();
|
|
376 |
}
|
|
377 |
Random generator = new Random();
|
|
378 |
String text;
|
|
379 |
int datalen;
|
|
380 |
int index = 0;
|
|
381 |
public int length() {
|
|
382 |
return datalen;
|
|
383 |
}
|
|
384 |
public void reset() {
|
|
385 |
index = 0;
|
|
386 |
}
|
|
387 |
public String wordInIndex(int index) {
|
|
388 |
if (index < 7) return null;
|
|
389 |
if (index < 14) return "brummer";
|
|
390 |
if (index < 19) return "hisser";
|
|
391 |
if (index < 28) return "tort";
|
|
392 |
if (index < 37) return "zardzard";
|
|
393 |
if (index < 48) return "rantrant";
|
|
394 |
return "caimagator";
|
|
395 |
}
|
|
396 |
public String wordBeyondIndex(int index) {
|
|
397 |
if (index < 7) return "brummer";
|
|
398 |
if (index < 14) return "hisser";
|
|
399 |
if (index < 19) return "tort";
|
|
400 |
if (index < 28) return "zardzard";
|
|
401 |
if (index < 37) return "rantrant";
|
|
402 |
if (index < 48) return "caimagator";
|
|
403 |
return "phantphant";
|
|
404 |
}
|
|
405 |
public int read(java.nio.CharBuffer target) throws IOException {
|
|
406 |
if (index > datalen-1)
|
|
407 |
return -1; // EOS
|
|
408 |
int len = target.remaining();
|
|
409 |
if (len > 4) // return 1 to 3 characters
|
|
410 |
len = generator.nextInt(3) + 1;
|
|
411 |
while ((index + len) > datalen)
|
|
412 |
len--;
|
|
413 |
for (int i=0; i<len; i++)
|
|
414 |
target.put(text.charAt(index++));
|
|
415 |
return len;
|
|
416 |
}
|
|
417 |
}
|
|
418 |
|
|
419 |
public static void hasNextLineTest(int sourceType) throws Exception {
|
|
420 |
Scanner sc = scannerFor("1\n2\n3 3\r\n4 4 4\r5", sourceType);
|
|
421 |
if (!sc.hasNextLine()) failCount++;
|
|
422 |
if (!sc.nextLine().equals("1")) failCount++;
|
|
423 |
if (!sc.hasNextLine()) failCount++;
|
|
424 |
if (sc.nextInt() != 2) failCount++;
|
|
425 |
if (!sc.hasNextLine()) failCount++;
|
|
426 |
if (!sc.nextLine().equals("")) failCount++;
|
|
427 |
if (!sc.hasNextLine()) failCount++;
|
|
428 |
if (sc.nextInt() != 3) failCount++;
|
|
429 |
if (!sc.hasNextLine()) failCount++;
|
|
430 |
if (!sc.nextLine().equals(" 3")) failCount++;
|
|
431 |
if (!sc.hasNextLine()) failCount++;
|
|
432 |
if (sc.nextInt() != 4) failCount++;
|
|
433 |
if (!sc.hasNextLine()) failCount++;
|
|
434 |
if (sc.nextInt() != 4) failCount++;
|
|
435 |
if (!sc.hasNextLine()) failCount++;
|
|
436 |
if (!sc.nextLine().equals(" 4")) failCount++;
|
|
437 |
if (!sc.hasNextLine()) failCount++;
|
|
438 |
if (!sc.nextLine().equals("5")) failCount++;
|
|
439 |
if (sc.hasNextLine()) failCount++;
|
|
440 |
sc = new Scanner("blah blah blah blah blah blah");
|
|
441 |
if (!sc.hasNextLine()) failCount++;
|
|
442 |
if (!sc.nextLine().equals("blah blah blah blah blah blah"))
|
|
443 |
failCount++;
|
|
444 |
if (sc.hasNextLine()) failCount++;
|
|
445 |
|
|
446 |
// Go through all the lines in a file
|
|
447 |
File f = new File(System.getProperty("test.src", "."), "input.txt");
|
|
448 |
sc = new Scanner(f);
|
|
449 |
String lastLine = "blah";
|
|
450 |
while(sc.hasNextLine())
|
|
451 |
lastLine = sc.nextLine();
|
|
452 |
if (!lastLine.equals("# Data for usage case 6")) failCount++;
|
|
453 |
|
|
454 |
report("Has next line test");
|
|
455 |
}
|
|
456 |
|
|
457 |
public static void nextLineTest(int sourceType) throws Exception {
|
|
458 |
Scanner sc = scannerFor("1\n2\n3 3\r\n4 4 4\r5", sourceType);
|
|
459 |
if (!sc.nextLine().equals("1"))
|
|
460 |
failCount++;
|
|
461 |
if (sc.nextInt() != 2)
|
|
462 |
failCount++;
|
|
463 |
if (!sc.nextLine().equals(""))
|
|
464 |
failCount++;
|
|
465 |
if (sc.nextInt() != 3)
|
|
466 |
failCount++;
|
|
467 |
if (!sc.nextLine().equals(" 3"))
|
|
468 |
failCount++;
|
|
469 |
if (sc.nextInt() != 4)
|
|
470 |
failCount++;
|
|
471 |
if (sc.nextInt() != 4)
|
|
472 |
failCount++;
|
|
473 |
if (!sc.nextLine().equals(" 4"))
|
|
474 |
failCount++;
|
|
475 |
if (!sc.nextLine().equals("5"))
|
|
476 |
failCount++;
|
|
477 |
sc = new Scanner("blah blah blah blah blah blah");
|
|
478 |
if (!sc.nextLine().equals("blah blah blah blah blah blah"))
|
|
479 |
failCount++;
|
|
480 |
report("Next line test");
|
|
481 |
}
|
|
482 |
|
|
483 |
public static void singleDelimTest(int sourceType) throws Exception {
|
|
484 |
Scanner sc = scannerFor("12 13 14 15 16 17 ",
|
|
485 |
sourceType);
|
|
486 |
sc.useDelimiter(" ");
|
|
487 |
for (int i=0; i<6; i++) {
|
|
488 |
int j = sc.nextInt();
|
|
489 |
if (j != 12 + i)
|
|
490 |
failCount++;
|
|
491 |
for (int k=0; k<i; k++) {
|
|
492 |
String empty = sc.next();
|
|
493 |
if (!empty.equals(""))
|
|
494 |
failCount++;
|
|
495 |
}
|
|
496 |
}
|
|
497 |
report("Single delim test");
|
|
498 |
}
|
|
499 |
|
|
500 |
/*
|
|
501 |
* The hasNextPattern caches a match of a pattern called the regular cache
|
|
502 |
* The hasNextType caches a match of that type called the type cache
|
|
503 |
* Any next must clear the caches whether it uses them or not, because
|
|
504 |
* it advances past a token thus invalidating any cached token; any
|
|
505 |
* hasNext must set a cache to what it finds.
|
|
506 |
*/
|
|
507 |
public static void cacheTest() throws Exception {
|
|
508 |
// Test clearing of the type cache
|
|
509 |
Scanner scanner = new Scanner("777 dog");
|
|
510 |
scanner.hasNextInt();
|
|
511 |
scanner.findInLine("777");
|
|
512 |
try {
|
|
513 |
scanner.nextInt();
|
|
514 |
System.out.println("type cache not cleared by find");
|
|
515 |
failCount++;
|
|
516 |
} catch (InputMismatchException ime) {
|
|
517 |
// Correct
|
|
518 |
}
|
|
519 |
|
|
520 |
scanner = new Scanner("777 dog");
|
|
521 |
scanner.hasNextInt();
|
|
522 |
scanner.skip("777");
|
|
523 |
try {
|
|
524 |
scanner.nextInt();
|
|
525 |
System.out.println("type cache not cleared by skip");
|
|
526 |
failCount++;
|
|
527 |
} catch (InputMismatchException ime) {
|
|
528 |
// Correct
|
|
529 |
}
|
|
530 |
|
|
531 |
// Test clearing of the regular cache
|
|
532 |
scanner = new Scanner("777 dog");
|
|
533 |
scanner.hasNext("777");
|
|
534 |
scanner.findInLine("777");
|
|
535 |
try {
|
|
536 |
scanner.next("777");
|
|
537 |
System.out.println("regular cache not cleared by find");
|
|
538 |
failCount++;
|
|
539 |
} catch (InputMismatchException ime) {
|
|
540 |
// Correct
|
|
541 |
}
|
|
542 |
|
|
543 |
// Test two primitive next clearing of type cache
|
|
544 |
scanner = new Scanner("777 dog");
|
|
545 |
scanner.hasNextInt();
|
|
546 |
scanner.nextLong();
|
|
547 |
try {
|
|
548 |
scanner.nextInt();
|
|
549 |
System.out.println("type cache not cleared by primitive next");
|
|
550 |
failCount++;
|
|
551 |
} catch (InputMismatchException ime) {
|
|
552 |
// Correct
|
|
553 |
}
|
|
554 |
|
|
555 |
// Test using both of them, type first
|
|
556 |
scanner = new Scanner("777 dog");
|
|
557 |
scanner.hasNext("777");
|
|
558 |
scanner.nextInt();
|
|
559 |
try {
|
|
560 |
scanner.next("777");
|
|
561 |
System.out.println("regular cache not cleared by primitive next");
|
|
562 |
failCount++;
|
|
563 |
} catch (InputMismatchException ime) {
|
|
564 |
// Correct
|
|
565 |
}
|
|
566 |
|
|
567 |
// Test using both of them, regular first
|
|
568 |
scanner = new Scanner("777 dog");
|
|
569 |
scanner.hasNext("777");
|
|
570 |
scanner.hasNextInt();
|
|
571 |
scanner.next("777");
|
|
572 |
try {
|
|
573 |
scanner.nextInt();
|
|
574 |
System.out.println("type cache not cleared by regular next");
|
|
575 |
failCount++;
|
|
576 |
} catch (InputMismatchException ime) {
|
|
577 |
// Correct
|
|
578 |
}
|
|
579 |
report("Cache test");
|
|
580 |
}
|
|
581 |
|
|
582 |
/*
|
|
583 |
* The hasNext<IntegerType>(radix) method caches a matched integer type
|
|
584 |
* with specified radix for the next next<IntegerType>(radix) invoke.
|
|
585 |
* The cache value should not be used if the next<IntegerType>(radix)
|
|
586 |
* has different radix value with the last hasNext<IntegerType>(radix).
|
|
587 |
*/
|
|
588 |
public static void cacheTest2() throws Exception {
|
|
589 |
// Test clearing of the type cache
|
|
590 |
Scanner scanner = new Scanner("10");
|
|
591 |
scanner.hasNextByte(16);
|
|
592 |
if (scanner.nextByte(10) != 10) {
|
|
593 |
System.out.println("wrong radix cache is used");
|
|
594 |
failCount++;
|
|
595 |
}
|
|
596 |
scanner = new Scanner("10");
|
|
597 |
scanner.hasNextShort(16);
|
|
598 |
if (scanner.nextShort(10) != 10) {
|
|
599 |
System.out.println("wrong radix cache is used");
|
|
600 |
failCount++;
|
|
601 |
}
|
|
602 |
scanner = new Scanner("10");
|
|
603 |
scanner.hasNextInt(16);
|
|
604 |
if (scanner.nextInt(10) != 10) {
|
|
605 |
System.out.println("wrong radix cache is used");
|
|
606 |
failCount++;
|
|
607 |
}
|
|
608 |
scanner = new Scanner("10");
|
|
609 |
scanner.hasNextLong(16);
|
|
610 |
if (scanner.nextLong(10) != 10) {
|
|
611 |
System.out.println("wrong radix cache is used");
|
|
612 |
failCount++;
|
|
613 |
}
|
|
614 |
scanner = new Scanner("10");
|
|
615 |
scanner.hasNextBigInteger(16);
|
|
616 |
if (scanner.nextBigInteger(10).intValue() != 10) {
|
|
617 |
System.out.println("wrong radix cache is used");
|
|
618 |
failCount++;
|
|
619 |
}
|
|
620 |
report("Cache test2");
|
|
621 |
}
|
|
622 |
|
|
623 |
|
|
624 |
public static void closeTest() throws Exception {
|
|
625 |
Scanner sc = new Scanner("testing");
|
|
626 |
sc.close();
|
|
627 |
sc.ioException();
|
|
628 |
sc.delimiter();
|
|
629 |
sc.useDelimiter("blah");
|
|
630 |
sc.useDelimiter(Pattern.compile("blah"));
|
|
631 |
for (int i=0; i<NUM_METHODS; i++) {
|
|
632 |
try {
|
|
633 |
methodCall(sc, i);
|
|
634 |
failCount++;
|
|
635 |
} catch (IllegalStateException ise) {
|
|
636 |
// Correct
|
|
637 |
}
|
|
638 |
}
|
|
639 |
report("Close test");
|
|
640 |
}
|
|
641 |
|
|
642 |
private static int NUM_METHODS = 23;
|
|
643 |
|
|
644 |
private static void methodCall(Scanner sc, int i) {
|
|
645 |
switch(i) {
|
|
646 |
case 0: sc.hasNext(); break;
|
|
647 |
case 1: sc.next(); break;
|
|
648 |
case 2: sc.hasNext(Pattern.compile("blah")); break;
|
|
649 |
case 3: sc.next(Pattern.compile("blah")); break;
|
|
650 |
case 4: sc.hasNextBoolean(); break;
|
|
651 |
case 5: sc.nextBoolean(); break;
|
|
652 |
case 6: sc.hasNextByte(); break;
|
|
653 |
case 7: sc.nextByte(); break;
|
|
654 |
case 8: sc.hasNextShort(); break;
|
|
655 |
case 9: sc.nextShort(); break;
|
|
656 |
case 10: sc.hasNextInt(); break;
|
|
657 |
case 11: sc.nextInt(); break;
|
|
658 |
case 12: sc.hasNextLong(); break;
|
|
659 |
case 13: sc.nextLong(); break;
|
|
660 |
case 14: sc.hasNextFloat(); break;
|
|
661 |
case 15: sc.nextFloat(); break;
|
|
662 |
case 16: sc.hasNextDouble(); break;
|
|
663 |
case 17: sc.nextDouble(); break;
|
|
664 |
case 18: sc.hasNextBigInteger(); break;
|
|
665 |
case 19: sc.nextBigInteger(); break;
|
|
666 |
case 20: sc.hasNextBigDecimal(); break;
|
|
667 |
case 21: sc.nextBigDecimal(); break;
|
|
668 |
case 22: sc.hasNextLine(); break;
|
|
669 |
default:
|
|
670 |
break;
|
|
671 |
}
|
|
672 |
}
|
|
673 |
|
|
674 |
public static void removeTest() throws Exception {
|
|
675 |
Scanner sc = new Scanner("testing");
|
|
676 |
try {
|
|
677 |
sc.remove();
|
|
678 |
failCount++;
|
|
679 |
} catch (UnsupportedOperationException uoe) {
|
|
680 |
// Correct result
|
|
681 |
}
|
|
682 |
report("Remove test");
|
|
683 |
}
|
|
684 |
|
|
685 |
public static void delimiterTest() throws Exception {
|
|
686 |
Scanner sc = new Scanner("blah");
|
|
687 |
Pattern test = sc.delimiter();
|
|
688 |
if (!test.toString().equals("\\p{javaWhitespace}+"))
|
|
689 |
failCount++;
|
|
690 |
sc.useDelimiter("a");
|
|
691 |
test = sc.delimiter();
|
|
692 |
if (!test.toString().equals("a"))
|
|
693 |
failCount++;
|
|
694 |
sc.useDelimiter(Pattern.compile("b"));
|
|
695 |
test = sc.delimiter();
|
|
696 |
if (!test.toString().equals("b"))
|
|
697 |
failCount++;
|
|
698 |
report("Delimiter test");
|
|
699 |
}
|
|
700 |
|
|
701 |
public static void ioExceptionTest() throws Exception {
|
|
702 |
Readable thrower = new ThrowingReadable();
|
|
703 |
Scanner sc = new Scanner(thrower);
|
|
704 |
try {
|
|
705 |
sc.nextInt();
|
|
706 |
failCount++;
|
|
707 |
} catch (NoSuchElementException nsee) {
|
|
708 |
// Correct result
|
|
709 |
}
|
|
710 |
Exception thrown = sc.ioException();
|
|
711 |
String detail = thrown.getMessage();
|
|
712 |
if (!detail.equals("ThrowingReadable always throws"))
|
|
713 |
failCount++;
|
|
714 |
|
|
715 |
report("IOException test");
|
|
716 |
}
|
|
717 |
|
|
718 |
public static void bigIntegerPatternTest(int sourceType) throws Exception {
|
|
719 |
Scanner sc = scannerFor("23 9223372036854775817", sourceType);
|
|
720 |
if (!sc.nextBigInteger().equals(BigInteger.valueOf(23)))
|
|
721 |
failCount++;
|
|
722 |
if (!sc.nextBigInteger().equals(new BigInteger(
|
|
723 |
"9223372036854775817", 10)))
|
|
724 |
failCount++;
|
|
725 |
|
|
726 |
// Test another radix
|
|
727 |
sc = new Scanner("4a4 4A4").useRadix(16);
|
|
728 |
if (!sc.nextBigInteger().equals(new BigInteger("4a4", 16)))
|
|
729 |
failCount++;
|
|
730 |
if (!sc.nextBigInteger().equals(new BigInteger("4A4", 16)))
|
|
731 |
failCount++;
|
|
732 |
|
|
733 |
// Test alternating radices
|
|
734 |
sc = new Scanner("12 4a4 14 4f4");
|
|
735 |
if (!sc.nextBigInteger(10).equals(new BigInteger("12", 10)))
|
|
736 |
failCount++;
|
|
737 |
if (!sc.nextBigInteger(16).equals(new BigInteger("4a4", 16)))
|
|
738 |
failCount++;
|
|
739 |
if (!sc.nextBigInteger(10).equals(new BigInteger("14", 10)))
|
|
740 |
failCount++;
|
|
741 |
if (!sc.nextBigInteger(16).equals(new BigInteger("4f4", 16)))
|
|
742 |
failCount++;
|
|
743 |
|
|
744 |
// Test use of a lot of radices
|
|
745 |
for (int i=2; i<17; i++) {
|
|
746 |
sc = new Scanner("1111");
|
|
747 |
if (!sc.nextBigInteger(i).equals(new BigInteger("1111", i)))
|
|
748 |
failCount++;
|
|
749 |
}
|
|
750 |
|
|
751 |
report("BigInteger pattern");
|
|
752 |
}
|
|
753 |
|
|
754 |
public static void bigDecimalPatternTest(int sourceType) throws Exception {
|
|
755 |
Scanner sc = scannerFor("23 45.99 -45,067.444 3.4e10", sourceType);
|
|
756 |
if (!sc.nextBigDecimal().equals(BigDecimal.valueOf(23)))
|
|
757 |
failCount++;
|
|
758 |
if (!sc.nextBigDecimal().equals(new BigDecimal("45.99")))
|
|
759 |
failCount++;
|
|
760 |
if (!sc.nextBigDecimal().equals(new BigDecimal("-45067.444")))
|
|
761 |
failCount++;
|
|
762 |
if (!sc.nextBigDecimal().equals(new BigDecimal("3.4e10")))
|
|
763 |
failCount++;
|
|
764 |
report("BigDecimal pattern");
|
|
765 |
}
|
|
766 |
|
|
767 |
public static void integerPatternTest(int sourceType) throws Exception {
|
|
768 |
String input =
|
|
769 |
"1 22 f FF Z -3 -44 123 1,200 -123 -3,400,000 5,40 ,500 ";
|
|
770 |
Scanner sc = scannerFor(input, sourceType);
|
|
771 |
integerPatternBody(sc);
|
|
772 |
CharBuffer cb = CharBuffer.wrap(input);
|
|
773 |
sc = new Scanner(cb);
|
|
774 |
integerPatternBody(sc);
|
|
775 |
report("Integer pattern");
|
|
776 |
}
|
|
777 |
|
|
778 |
public static void integerPatternBody(Scanner sc) throws Exception {
|
|
779 |
if (sc.nextInt() != 1) failCount++;
|
|
780 |
if (sc.nextShort() != 22) failCount++;
|
|
781 |
if (sc.nextShort(16) != 15) failCount++;
|
|
782 |
if (sc.nextShort(16) != 255) failCount++;
|
|
783 |
if (sc.nextShort(36) != 35) failCount++;
|
|
784 |
if (!sc.hasNextInt()) failCount++;
|
|
785 |
if (sc.nextInt() != -3) failCount++;
|
|
786 |
if (sc.nextInt() != -44) failCount++;
|
|
787 |
if (sc.nextLong() != 123) failCount++;
|
|
788 |
if (!sc.hasNextInt()) failCount++;
|
|
789 |
if (sc.nextInt() != 1200) failCount++;
|
|
790 |
if (sc.nextInt() != -123) failCount++;
|
|
791 |
if (sc.nextInt() != -3400000) failCount++;
|
|
792 |
try {
|
|
793 |
sc.nextInt();
|
|
794 |
failCount++;
|
|
795 |
} catch (InputMismatchException ime) {
|
|
796 |
// Correct result
|
|
797 |
}
|
|
798 |
sc.next();
|
|
799 |
try {
|
|
800 |
sc.nextLong();
|
|
801 |
failCount++;
|
|
802 |
} catch (InputMismatchException ime) {
|
|
803 |
// Correct result
|
|
804 |
}
|
|
805 |
sc.next();
|
|
806 |
try {
|
|
807 |
sc.next();
|
|
808 |
failCount++;
|
|
809 |
} catch (InputMismatchException ime) {
|
|
810 |
failCount++;
|
|
811 |
} catch (NoSuchElementException nse) {
|
|
812 |
// Correct result
|
|
813 |
}
|
|
814 |
}
|
|
815 |
|
|
816 |
public static void floatPatternTest(int sourceType) throws Exception {
|
|
817 |
String input =
|
|
818 |
"090.090 1 22.0 -3 -44.05 +.123 -.1234 -3400000 56,566.6 " +
|
|
819 |
"Infinity +Infinity -Infinity NaN -NaN +NaN 5.4.0 5-.00 ++6.07";
|
|
820 |
Scanner sc = scannerFor(input, sourceType);
|
|
821 |
floatPatternBody(sc);
|
|
822 |
CharBuffer cb = CharBuffer.wrap(input);
|
|
823 |
sc = new Scanner(cb);
|
|
824 |
floatPatternBody(sc);
|
|
825 |
report("Float pattern");
|
|
826 |
}
|
|
827 |
|
|
828 |
public static void floatPatternBody(Scanner sc) throws Exception {
|
|
829 |
if (sc.nextFloat() != 090.090f) failCount++;
|
|
830 |
if (sc.nextFloat() != 1f) failCount++;
|
|
831 |
if (sc.nextFloat() != 22.0f) failCount++;
|
|
832 |
if (sc.nextDouble() != -3d) failCount++;
|
|
833 |
if (sc.nextDouble() != -44.05d) failCount++;
|
|
834 |
if (sc.nextFloat() != .123f) failCount++;
|
|
835 |
if (sc.nextFloat() != -.1234f) failCount++;
|
|
836 |
if (sc.nextDouble() != -3400000d) failCount++;
|
|
837 |
if (sc.nextDouble() != 56566.6d) failCount++;
|
|
838 |
if (sc.nextDouble() != Double.POSITIVE_INFINITY) failCount++;
|
|
839 |
if (sc.nextDouble() != Double.POSITIVE_INFINITY) failCount++;
|
|
840 |
if (sc.nextDouble() != Double.NEGATIVE_INFINITY) failCount++;
|
|
841 |
if (!Double.valueOf(sc.nextDouble()).isNaN()) failCount++;
|
|
842 |
if (!Double.valueOf(sc.nextDouble()).isNaN()) failCount++;
|
|
843 |
if (!Double.valueOf(sc.nextDouble()).isNaN()) failCount++;
|
|
844 |
try {
|
|
845 |
sc.nextFloat();
|
|
846 |
failCount++;
|
|
847 |
} catch (NoSuchElementException nse) {
|
|
848 |
// Correct result
|
|
849 |
}
|
|
850 |
try {
|
|
851 |
sc.nextDouble();
|
|
852 |
failCount++;
|
|
853 |
} catch (NoSuchElementException nse) {
|
|
854 |
// Correct result
|
|
855 |
}
|
|
856 |
try {
|
|
857 |
sc.nextDouble();
|
|
858 |
failCount++;
|
|
859 |
} catch (NoSuchElementException nse) {
|
|
860 |
// Correct result
|
|
861 |
}
|
|
862 |
}
|
|
863 |
|
|
864 |
public static void fromFileTest() throws Exception {
|
|
865 |
File f = new File(System.getProperty("test.src", "."), "input.txt");
|
|
866 |
Scanner sc = new Scanner(f).useDelimiter("\n+");
|
|
867 |
String testDataTag = sc.findWithinHorizon("fromFileTest", 0);
|
|
868 |
if (!testDataTag.equals("fromFileTest"))
|
|
869 |
failCount++;
|
|
870 |
|
|
871 |
int count = 0;
|
|
872 |
while (sc.hasNextLong()) {
|
|
873 |
long blah = sc.nextLong();
|
|
874 |
count++;
|
|
875 |
}
|
|
876 |
if (count != 7)
|
|
877 |
failCount++;
|
|
878 |
sc.close();
|
|
879 |
report("From file");
|
|
880 |
}
|
|
881 |
|
|
882 |
private static void example1() throws Exception {
|
|
883 |
Scanner s = new Scanner("1 fish 2 fish red fish blue fish");
|
|
884 |
s.useDelimiter("\\s*fish\\s*");
|
|
885 |
List <String> results = new ArrayList<String>();
|
|
886 |
while(s.hasNext())
|
|
887 |
results.add(s.next());
|
|
888 |
System.out.println(results);
|
|
889 |
}
|
|
890 |
|
|
891 |
private static void example2() throws Exception {
|
|
892 |
Scanner s = new Scanner("1 fish 2 fish red fish blue fish");
|
|
893 |
s.useDelimiter("\\s*fish\\s*");
|
|
894 |
System.out.println(s.nextInt());
|
|
895 |
System.out.println(s.nextInt());
|
|
896 |
System.out.println(s.next());
|
|
897 |
System.out.println(s.next());
|
|
898 |
}
|
|
899 |
|
|
900 |
private static void example3() throws Exception {
|
|
901 |
Scanner s = new Scanner("1 fish 2 fish red fish blue fish");
|
|
902 |
s.findInLine("(\\d+) fish (\\d+) fish (\\w+) fish (\\w+)");
|
|
903 |
for (int i=1; i<=s.match().groupCount(); i++)
|
|
904 |
System.out.println(s.match().group(i));
|
|
905 |
}
|
|
906 |
|
|
907 |
private static void findInLineTest() throws Exception {
|
|
908 |
Scanner s = new Scanner("abc def ghi jkl mno");
|
|
909 |
Pattern letters = Pattern.compile("[a-z]+");
|
|
910 |
Pattern frogs = Pattern.compile("frogs");
|
|
911 |
String str = s.findInLine(letters);
|
|
912 |
if (!str.equals("abc"))
|
|
913 |
failCount++;
|
|
914 |
if (!s.hasNext(letters))
|
|
915 |
failCount++;
|
|
916 |
try {
|
|
917 |
str = s.findInLine(frogs);
|
|
918 |
} catch (NoSuchElementException nsee) {
|
|
919 |
// Correct
|
|
920 |
}
|
|
921 |
if (!s.hasNext())
|
|
922 |
failCount++;
|
|
923 |
if (!s.hasNext(letters))
|
|
924 |
failCount++;
|
|
925 |
str = s.findInLine(letters);
|
|
926 |
if (!str.equals("def"))
|
|
927 |
failCount++;
|
|
928 |
|
|
929 |
report("Find patterns");
|
|
930 |
}
|
|
931 |
|
|
932 |
private static void findInEmptyLineTest() throws Exception {
|
|
933 |
String eol = System.getProperty("line.separator");
|
|
934 |
Scanner s = new Scanner("line 1" + eol + "" + eol + "line 3" + eol);
|
|
935 |
int lineNo = 0;
|
|
936 |
while (s.hasNextLine()) {
|
|
937 |
lineNo++;
|
|
938 |
s.findInLine("3");
|
|
939 |
s.nextLine();
|
|
940 |
}
|
|
941 |
if (lineNo != 3)
|
|
942 |
failCount++;
|
|
943 |
report("findInEmptyLine test");
|
|
944 |
}
|
|
945 |
|
|
946 |
private static void matchTest() throws Exception {
|
|
947 |
Scanner s = new Scanner("1 fish 2 fish red fish blue fish");
|
|
948 |
s.findInLine("(\\d+) fish (\\d+) fish (\\w+) fish (\\w+)");
|
|
949 |
|
|
950 |
MatchResult result = s.match();
|
|
951 |
if (!result.group(1).equals("1"))
|
|
952 |
failCount++;
|
|
953 |
if (!result.group(2).equals("2"))
|
|
954 |
failCount++;
|
|
955 |
if (!result.group(3).equals("red"))
|
|
956 |
failCount++;
|
|
957 |
if (!result.group(4).equals("blue"))
|
|
958 |
failCount++;
|
|
959 |
|
|
960 |
report("Match patterns");
|
|
961 |
}
|
|
962 |
|
|
963 |
private static void skipTest() throws Exception {
|
|
964 |
Scanner s = new Scanner("abc def ghi jkl mno");
|
|
965 |
Pattern letters = Pattern.compile("[a-z]+");
|
|
966 |
Pattern spaceLetters = Pattern.compile(" [a-z]+");
|
|
967 |
Pattern frogs = Pattern.compile("frogs");
|
|
968 |
try {
|
|
969 |
s.skip(letters);
|
|
970 |
} catch (NoSuchElementException ime) {
|
|
971 |
failCount++;
|
|
972 |
}
|
|
973 |
String token = s.next(letters);
|
|
974 |
if (!token.equals("def")) {
|
|
975 |
System.out.println("expected def");
|
|
976 |
System.out.println("I found "+token);
|
|
977 |
failCount++;
|
|
978 |
}
|
|
979 |
try {
|
|
980 |
s.skip(letters);
|
|
981 |
failCount++;
|
|
982 |
} catch (NoSuchElementException ime) {
|
|
983 |
// Correct result
|
|
984 |
}
|
|
985 |
token = s.next(letters);
|
|
986 |
if (!token.equals("ghi")) {
|
|
987 |
System.out.println("expected ghi");
|
|
988 |
System.out.println("I found "+token);
|
|
989 |
failCount++;
|
|
990 |
}
|
|
991 |
try {
|
|
992 |
s.skip(letters);
|
|
993 |
failCount++;
|
|
994 |
} catch (NoSuchElementException ime) {
|
|
995 |
// Correct result because skip ignores delims
|
|
996 |
}
|
|
997 |
try {
|
|
998 |
s.skip(spaceLetters);
|
|
999 |
} catch (NoSuchElementException ime) {
|
|
1000 |
failCount++;
|
|
1001 |
}
|
|
1002 |
token = s.next(letters);
|
|
1003 |
if (!token.equals("mno")) {
|
|
1004 |
System.out.println("expected mno");
|
|
1005 |
System.out.println("I found "+token);
|
|
1006 |
failCount++;
|
|
1007 |
}
|
|
1008 |
try {
|
|
1009 |
s.skip(letters);
|
|
1010 |
failCount++;
|
|
1011 |
} catch (NoSuchElementException ime) {
|
|
1012 |
// Correct result
|
|
1013 |
}
|
|
1014 |
report("Skip patterns");
|
|
1015 |
}
|
|
1016 |
|
|
1017 |
private static void byteTest(int sourceType) throws Exception {
|
|
1018 |
String input = " 3 0 00 b -B 012 44 -55 12 127 129 -131 dog 0x12";
|
|
1019 |
Scanner s = scannerFor(input, sourceType);
|
|
1020 |
if (!s.hasNextByte()) failCount++;
|
|
1021 |
if (s.nextByte() != (byte)3) failCount++;
|
|
1022 |
if (!s.hasNextByte()) failCount++;
|
|
1023 |
if (s.nextByte() != (byte)0) failCount++;
|
|
1024 |
if (!s.hasNextByte()) failCount++;
|
|
1025 |
if (s.nextByte() != (byte)0) failCount++;
|
|
1026 |
if (!s.hasNextByte(16)) failCount++;
|
|
1027 |
if (s.nextByte(16) != (byte)11)failCount++;
|
|
1028 |
if (!s.hasNextByte(16)) failCount++;
|
|
1029 |
if (s.nextByte(16) != (byte)-11) failCount++;
|
|
1030 |
if (!s.hasNextByte()) failCount++;
|
|
1031 |
if (s.nextByte() != (byte)12) failCount++;
|
|
1032 |
if (!s.hasNextByte()) failCount++;
|
|
1033 |
if (s.nextByte() != (byte)44) failCount++;
|
|
1034 |
if (!s.hasNextByte()) failCount++;
|
|
1035 |
if (s.nextByte() != (byte)-55) failCount++;
|
|
1036 |
if (!s.hasNextByte()) failCount++;
|
|
1037 |
if (s.nextByte() != (byte)12) failCount++;
|
|
1038 |
if (!s.hasNextByte()) failCount++;
|
|
1039 |
if (s.nextByte() != (byte)127) failCount++;
|
|
1040 |
if (s.hasNextByte()) failCount++;
|
|
1041 |
|
|
1042 |
try {
|
|
1043 |
s.nextByte();
|
|
1044 |
failCount++;
|
|
1045 |
} catch (InputMismatchException ime) {
|
|
1046 |
// Correct result
|
|
1047 |
}
|
|
1048 |
if (s.hasNextByte()) failCount++;
|
|
1049 |
if (s.nextInt() != 129) failCount++;
|
|
1050 |
if (s.hasNextByte()) failCount++;
|
|
1051 |
try {
|
|
1052 |
s.nextByte();
|
|
1053 |
failCount++;
|
|
1054 |
} catch (InputMismatchException ime) {
|
|
1055 |
// Correct result
|
|
1056 |
}
|
|
1057 |
if (s.nextInt() != -131) failCount++;
|
|
1058 |
if (s.hasNextByte()) failCount++;
|
|
1059 |
try {
|
|
1060 |
s.nextByte();
|
|
1061 |
failCount++;
|
|
1062 |
} catch (InputMismatchException ime) {
|
|
1063 |
// Correct result
|
|
1064 |
}
|
|
1065 |
s.next(Pattern.compile("\\w+"));
|
|
1066 |
if (s.hasNextByte())
|
|
1067 |
failCount++;
|
|
1068 |
try {
|
|
1069 |
s.nextByte();
|
|
1070 |
failCount++;
|
|
1071 |
} catch (NoSuchElementException nsee) {
|
|
1072 |
// Correct result
|
|
1073 |
}
|
|
1074 |
s.next();
|
|
1075 |
if (s.hasNextByte())
|
|
1076 |
failCount++;
|
|
1077 |
try {
|
|
1078 |
byte bb = s.nextByte();
|
|
1079 |
failCount++;
|
|
1080 |
} catch (NoSuchElementException nsee) {
|
|
1081 |
// Correct result
|
|
1082 |
}
|
|
1083 |
report("Scan bytes");
|
|
1084 |
}
|
|
1085 |
|
|
1086 |
private static void shortTest(int sourceType) throws Exception {
|
|
1087 |
String input = " 017 22 00E -34 44,333 -53999 0x19 dog";
|
|
1088 |
Scanner s = scannerFor(input, sourceType);
|
|
1089 |
if (!s.hasNextShort()) failCount++;
|
|
1090 |
if (s.nextShort() != (short)17) failCount++;
|
|
1091 |
if (!s.hasNextShort()) failCount++;
|
|
1092 |
if (s.nextShort() != (short)22) failCount++;
|
|
1093 |
if (!s.hasNextShort(16)) failCount++;
|
|
1094 |
if (s.nextShort(16) != (short)14) failCount++;
|
|
1095 |
if (!s.hasNextShort()) failCount++;
|
|
1096 |
if (s.nextShort() != (short)-34) failCount++;
|
|
1097 |
for (int i=0; i<4; i++) {
|
|
1098 |
if (s.hasNextShort())
|
|
1099 |
failCount++;
|
|
1100 |
try {
|
|
1101 |
s.nextShort();
|
|
1102 |
failCount++;
|
|
1103 |
} catch (InputMismatchException ime) {
|
|
1104 |
// Correct result
|
|
1105 |
}
|
|
1106 |
s.next();
|
|
1107 |
}
|
|
1108 |
try {
|
|
1109 |
s.next();
|
|
1110 |
failCount++;
|
|
1111 |
} catch (InputMismatchException ime) {
|
|
1112 |
failCount++;
|
|
1113 |
} catch (NoSuchElementException nse) {
|
|
1114 |
// Correct result
|
|
1115 |
}
|
|
1116 |
report("Scan shorts");
|
|
1117 |
}
|
|
1118 |
|
|
1119 |
private static void intTest(int sourceType) throws Exception {
|
|
1120 |
Scanner s = scannerFor(
|
|
1121 |
"22 022 C -34 0x80000000 -2147483649 dog ", sourceType);
|
|
1122 |
if (!s.hasNextInt()) failCount++;
|
|
1123 |
if (s.nextInt() != 22) failCount++;
|
|
1124 |
if (!s.hasNextInt()) failCount++;
|
|
1125 |
if (s.nextInt() != 22) failCount++;
|
|
1126 |
if (!s.hasNextInt(16)) failCount++;
|
|
1127 |
if (s.nextInt(16) != 12) failCount++;
|
|
1128 |
if (!s.hasNextInt()) failCount++;
|
|
1129 |
if (s.nextInt() != -34) failCount++;
|
|
1130 |
for (int i=0; i<3; i++) {
|
|
1131 |
if (s.hasNextInt())
|
|
1132 |
failCount++;
|
|
1133 |
try {
|
|
1134 |
s.nextInt();
|
|
1135 |
failCount++;
|
|
1136 |
} catch (InputMismatchException ime) {
|
|
1137 |
// Correct result
|
|
1138 |
}
|
|
1139 |
s.next();
|
|
1140 |
}
|
|
1141 |
try {
|
|
1142 |
s.next();
|
|
1143 |
failCount++;
|
|
1144 |
} catch (InputMismatchException ime) {
|
|
1145 |
failCount++;
|
|
1146 |
} catch (NoSuchElementException nse) {
|
|
1147 |
// Correct result
|
|
1148 |
}
|
|
1149 |
report("Scan ints");
|
|
1150 |
}
|
|
1151 |
|
|
1152 |
private static void longTest(int sourceType) throws Exception {
|
|
1153 |
Scanner s = scannerFor(
|
|
1154 |
"022 9223372036854775807 0x8000000000000000 9223372036854775808 dog ",
|
|
1155 |
sourceType);
|
|
1156 |
if (!s.hasNextLong()) failCount++;
|
|
1157 |
if (s.nextLong() != (long)22) failCount++;
|
|
1158 |
if (!s.hasNextLong()) failCount++;
|
|
1159 |
if (s.nextLong() != 9223372036854775807L) failCount++;
|
|
1160 |
for (int i=0; i<3; i++) {
|
|
1161 |
if (s.hasNextLong())
|
|
1162 |
failCount++;
|
|
1163 |
try {
|
|
1164 |
s.nextLong();
|
|
1165 |
failCount++;
|
|
1166 |
} catch (InputMismatchException ime) {
|
|
1167 |
// Correct result
|
|
1168 |
}
|
|
1169 |
s.next();
|
|
1170 |
}
|
|
1171 |
try {
|
|
1172 |
s.next();
|
|
1173 |
failCount++;
|
|
1174 |
} catch (InputMismatchException ime) {
|
|
1175 |
failCount++;
|
|
1176 |
} catch (NoSuchElementException nse) {
|
|
1177 |
// Correct result
|
|
1178 |
}
|
|
1179 |
report("Scan longs");
|
|
1180 |
}
|
|
1181 |
|
|
1182 |
private static void floatTest(int sourceType) throws Exception {
|
|
1183 |
Scanner s = scannerFor(
|
|
1184 |
"0 0. 0.0 2 2. 2.0 2.3 -2 -2.0 -2.3 -. 2-. 2..3", sourceType);
|
|
1185 |
if (!s.hasNextFloat()) failCount++;
|
|
1186 |
if (s.nextFloat() != 0f) failCount++;
|
|
1187 |
if (!s.hasNextFloat()) failCount++;
|
|
1188 |
if (s.nextFloat() != 0f) failCount++;
|
|
1189 |
if (!s.hasNextFloat()) failCount++;
|
|
1190 |
if (s.nextFloat() != 0f) failCount++;
|
|
1191 |
if (!s.hasNextFloat()) failCount++;
|
|
1192 |
if (s.nextFloat() != 2f) failCount++;
|
|
1193 |
if (!s.hasNextFloat()) failCount++;
|
|
1194 |
if (s.nextFloat() != 2f) failCount++;
|
|
1195 |
if (!s.hasNextFloat()) failCount++;
|
|
1196 |
if (s.nextFloat() != 2f) failCount++;
|
|
1197 |
if (!s.hasNextFloat()) failCount++;
|
|
1198 |
if (s.nextFloat() != 2.3f) failCount++;
|
|
1199 |
if (!s.hasNextFloat()) failCount++;
|
|
1200 |
if (s.nextFloat() != -2f) failCount++;
|
|
1201 |
if (!s.hasNextFloat()) failCount++;
|
|
1202 |
if (s.nextFloat() != -2f) failCount++;
|
|
1203 |
if (!s.hasNextFloat()) failCount++;
|
|
1204 |
if (s.nextFloat() != -2.3f) failCount++;
|
|
1205 |
for (int i=0; i<3; i++) {
|
|
1206 |
if (s.hasNextLong())
|
|
1207 |
failCount++;
|
|
1208 |
try {
|
|
1209 |
s.nextFloat();
|
|
1210 |
failCount++;
|
|
1211 |
} catch (InputMismatchException ime) {
|
|
1212 |
// Correct result
|
|
1213 |
}
|
|
1214 |
s.next();
|
|
1215 |
}
|
|
1216 |
try {
|
|
1217 |
s.next();
|
|
1218 |
failCount++;
|
|
1219 |
} catch (InputMismatchException ime) {
|
|
1220 |
failCount++;
|
|
1221 |
} catch (NoSuchElementException nse) {
|
|
1222 |
// Correct result
|
|
1223 |
}
|
|
1224 |
report("Scan floats");
|
|
1225 |
}
|
|
1226 |
|
|
1227 |
private static void doubleTest(int sourceType) throws Exception {
|
|
1228 |
Scanner s = scannerFor(
|
|
1229 |
"0 0. 0.0 2 2. 2.0 2.3 -2 -2.0 -2.3 -. 2-. 2..3", sourceType);
|
|
1230 |
if (!s.hasNextDouble()) failCount++;
|
|
1231 |
if (s.nextDouble() != 0d) failCount++;
|
|
1232 |
if (!s.hasNextDouble()) failCount++;
|
|
1233 |
if (s.nextDouble() != 0d) failCount++;
|
|
1234 |
if (!s.hasNextDouble()) failCount++;
|
|
1235 |
if (s.nextDouble() != 0d) failCount++;
|
|
1236 |
if (!s.hasNextDouble()) failCount++;
|
|
1237 |
if (s.nextDouble() != 2d) failCount++;
|
|
1238 |
if (!s.hasNextDouble()) failCount++;
|
|
1239 |
if (s.nextDouble() != 2d) failCount++;
|
|
1240 |
if (!s.hasNextDouble()) failCount++;
|
|
1241 |
if (s.nextDouble() != 2d) failCount++;
|
|
1242 |
if (!s.hasNextDouble()) failCount++;
|
|
1243 |
if (s.nextDouble() != 2.3d) failCount++;
|
|
1244 |
if (!s.hasNextDouble()) failCount++;
|
|
1245 |
if (s.nextDouble() != -2d) failCount++;
|
|
1246 |
if (!s.hasNextDouble()) failCount++;
|
|
1247 |
if (s.nextDouble() != -2d) failCount++;
|
|
1248 |
if (!s.hasNextDouble()) failCount++;
|
|
1249 |
if (s.nextDouble() != -2.3d) failCount++;
|
|
1250 |
for (int i=0; i<3; i++) {
|
|
1251 |
if (s.hasNextLong())
|
|
1252 |
failCount++;
|
|
1253 |
try {
|
|
1254 |
s.nextDouble();
|
|
1255 |
failCount++;
|
|
1256 |
} catch (InputMismatchException ime) {
|
|
1257 |
// Correct result
|
|
1258 |
}
|
|
1259 |
s.next();
|
|
1260 |
}
|
|
1261 |
try {
|
|
1262 |
s.next();
|
|
1263 |
failCount++;
|
|
1264 |
} catch (InputMismatchException ime) {
|
|
1265 |
failCount++;
|
|
1266 |
} catch (NoSuchElementException nse) {
|
|
1267 |
// Correct result
|
|
1268 |
}
|
|
1269 |
report("Scan doubles");
|
|
1270 |
}
|
|
1271 |
|
|
1272 |
private static void booleanTest(int sourceType) throws Exception {
|
|
1273 |
Scanner s = scannerFor(
|
|
1274 |
" true false\t \r\n true FaLse \n True Tru", sourceType);
|
|
1275 |
if (!s.nextBoolean()) failCount++;
|
|
1276 |
if (!s.hasNextBoolean()) failCount++;
|
|
1277 |
if (s.nextBoolean()) failCount++;
|
|
1278 |
if (!s.nextBoolean()) failCount++;
|
|
1279 |
if (s.nextBoolean()) failCount++;
|
|
1280 |
if (!s.nextBoolean()) failCount++;
|
|
1281 |
if (s.hasNextBoolean()) failCount++;
|
|
1282 |
try {
|
|
1283 |
s.nextBoolean();
|
|
1284 |
failCount++;
|
|
1285 |
} catch (NoSuchElementException nsee) {
|
|
1286 |
// Expected result
|
|
1287 |
}
|
|
1288 |
report("Scan booleans");
|
|
1289 |
}
|
|
1290 |
|
|
1291 |
private static void hasNextTest(int sourceType) throws Exception {
|
|
1292 |
Scanner s = scannerFor(
|
|
1293 |
" blah blech\t blather alongblatherindeed", sourceType);
|
|
1294 |
if (!s.hasNext()) failCount++;
|
|
1295 |
if (!s.hasNext()) failCount++;
|
|
1296 |
String result = s.next();
|
|
1297 |
if (!result.equals("blah")) failCount++;
|
|
1298 |
if (!s.hasNext()) failCount++;
|
|
1299 |
if (!s.hasNext()) failCount++;
|
|
1300 |
result = s.next();
|
|
1301 |
if (!result.equals("blech")) failCount++;
|
|
1302 |
if (!s.hasNext()) failCount++;
|
|
1303 |
result = s.next();
|
|
1304 |
if (!result.equals("blather")) failCount++;
|
|
1305 |
if (!s.hasNext()) failCount++;
|
|
1306 |
if (!s.hasNext()) failCount++;
|
|
1307 |
result = s.next();
|
|
1308 |
if (!result.equals("alongblatherindeed")) failCount++;
|
|
1309 |
if (s.hasNext()) failCount++;
|
|
1310 |
try {
|
|
1311 |
result = s.next();
|
|
1312 |
failCount++;
|
|
1313 |
} catch (NoSuchElementException nsee) {
|
|
1314 |
// Correct result
|
|
1315 |
}
|
|
1316 |
report("Has next test");
|
|
1317 |
}
|
|
1318 |
|
|
1319 |
private static void nextTest(int sourceType) throws Exception {
|
|
1320 |
Scanner s = scannerFor(
|
|
1321 |
" blah blech\t blather alongblatherindeed", sourceType);
|
|
1322 |
String result = (String)s.next();
|
|
1323 |
if (!result.equals("blah")) failCount++;
|
|
1324 |
result = (String)s.next();
|
|
1325 |
if (!result.equals("blech")) failCount++;
|
|
1326 |
result = (String)s.next();
|
|
1327 |
if (!result.equals("blather")) failCount++;
|
|
1328 |
result = (String)s.next();
|
|
1329 |
if (!result.equals("alongblatherindeed"))
|
|
1330 |
failCount++;
|
|
1331 |
try {
|
|
1332 |
result = (String)s.next();
|
|
1333 |
failCount++;
|
|
1334 |
} catch (NoSuchElementException nsee) {
|
|
1335 |
// Correct result
|
|
1336 |
}
|
|
1337 |
report("Next test");
|
|
1338 |
}
|
|
1339 |
|
|
1340 |
private static void hasNextPatternTest(int sourceType) throws Exception {
|
|
1341 |
Scanner s = scannerFor(
|
|
1342 |
" blah blech\t blather alongblatherindeed", sourceType);
|
|
1343 |
Pattern p1 = Pattern.compile("\\w+");
|
|
1344 |
Pattern p2 = Pattern.compile("blech");
|
|
1345 |
if (!s.hasNext(p1)) failCount++;
|
|
1346 |
if (!s.hasNext(p1)) failCount++;
|
|
1347 |
if (s.hasNext(p2)) failCount++;
|
|
1348 |
String result = (String)s.next();
|
|
1349 |
if (!result.equals("blah")) failCount++;
|
|
1350 |
if (!s.hasNext(p1)) failCount++;
|
|
1351 |
if (!s.hasNext(p2)) failCount++;
|
|
1352 |
result = (String)s.next();
|
|
1353 |
if (!result.equals("blech")) failCount++;
|
|
1354 |
if (!s.hasNext(p1)) failCount++;
|
|
1355 |
if (s.hasNext(p2)) failCount++;
|
|
1356 |
result = (String)s.next();
|
|
1357 |
if (!result.equals("blather")) failCount++;
|
|
1358 |
if (!s.hasNext(p1)) failCount++;
|
|
1359 |
if (s.hasNext(p2)) failCount++;
|
|
1360 |
result = (String)s.next();
|
|
1361 |
if (!result.equals("alongblatherindeed")) failCount++;
|
|
1362 |
if (s.hasNext(p1)) failCount++;
|
|
1363 |
if (s.hasNext(p2)) failCount++;
|
|
1364 |
report("Has Next Pattern test");
|
|
1365 |
}
|
|
1366 |
|
|
1367 |
private static void nextPatternTest(int sourceType) throws Exception {
|
|
1368 |
Scanner s = scannerFor(
|
|
1369 |
" blah blech\t blather alongblatherindeed", sourceType);
|
|
1370 |
Pattern p1 = Pattern.compile("blah");
|
|
1371 |
Pattern p2 = Pattern.compile("blech");
|
|
1372 |
Pattern p3 = Pattern.compile("blather");
|
|
1373 |
Pattern p4 = Pattern.compile("alongblatherindeed");
|
|
1374 |
String result = null;
|
|
1375 |
try {
|
|
1376 |
result = (String)s.next(p2);
|
|
1377 |
failCount++;
|
|
1378 |
} catch (NoSuchElementException nsee) {
|
|
1379 |
// Correct result
|
|
1380 |
}
|
|
1381 |
result = (String)s.next(p1);
|
|
1382 |
if (!result.equals("blah"))
|
|
1383 |
failCount++;
|
|
1384 |
try {
|
|
1385 |
result = (String)s.next(p1);
|
|
1386 |
failCount++;
|
|
1387 |
} catch (NoSuchElementException nsee) {
|
|
1388 |
// Correct result
|
|
1389 |
}
|
|
1390 |
result = (String)s.next(p2);
|
|
1391 |
if (!result.equals("blech"))
|
|
1392 |
failCount++;
|
|
1393 |
try {
|
|
1394 |
result = (String)s.next(p4);
|
|
1395 |
failCount++;
|
|
1396 |
} catch (NoSuchElementException nsee) {
|
|
1397 |
// Correct result
|
|
1398 |
}
|
|
1399 |
result = (String)s.next(p3);
|
|
1400 |
if (!result.equals("blather"))
|
|
1401 |
failCount++;
|
|
1402 |
try {
|
|
1403 |
result = (String)s.next(p3);
|
|
1404 |
failCount++;
|
|
1405 |
} catch (NoSuchElementException nsee) {
|
|
1406 |
// Correct result
|
|
1407 |
}
|
|
1408 |
result = (String)s.next(p4);
|
|
1409 |
if (!result.equals("alongblatherindeed"))
|
|
1410 |
failCount++;
|
|
1411 |
try {
|
|
1412 |
result = (String)s.next();
|
|
1413 |
failCount++;
|
|
1414 |
} catch (NoSuchElementException nsee) {
|
|
1415 |
// Correct result
|
|
1416 |
}
|
|
1417 |
report("Next pattern test");
|
|
1418 |
}
|
|
1419 |
|
|
1420 |
private static void useLocaleTest() throws Exception {
|
|
1421 |
Scanner s = new Scanner("334.65").useLocale(Locale.ENGLISH);
|
|
1422 |
if (!s.hasNextFloat()) failCount++;
|
|
1423 |
if (s.nextFloat() != 334.65f) failCount++;
|
|
1424 |
|
|
1425 |
s = new Scanner("334,65").useLocale(Locale.FRENCH);
|
|
1426 |
if (!s.hasNextFloat()) failCount++;
|
|
1427 |
if (s.nextFloat() != 334.65f) failCount++;
|
|
1428 |
|
|
1429 |
s = new Scanner("4.334,65").useLocale(Locale.GERMAN);
|
|
1430 |
if (!s.hasNextFloat()) failCount++;
|
|
1431 |
if (s.nextFloat() != 4334.65f) failCount++;
|
|
1432 |
|
|
1433 |
// Test case reported from India
|
|
1434 |
try {
|
|
1435 |
String Message = "123978.90 $";
|
|
1436 |
Locale locale = new Locale("hi","IN");
|
|
1437 |
NumberFormat form = NumberFormat.getInstance(locale);
|
|
1438 |
double myNumber = 1902.09;
|
|
1439 |
Scanner scanner = new Scanner(form.format(myNumber).toString());
|
|
1440 |
scanner.useLocale(locale);
|
|
1441 |
double d = scanner.nextDouble();
|
|
1442 |
} catch (InputMismatchException ime) {
|
|
1443 |
failCount++;
|
|
1444 |
}
|
|
1445 |
report("Use locale test");
|
|
1446 |
}
|
|
1447 |
|
|
1448 |
public static void resetTest() throws Exception {
|
|
1449 |
Scanner sc = new Scanner("");
|
|
1450 |
int radix = sc.radix();
|
|
1451 |
Locale locale = sc.locale();
|
|
1452 |
Pattern delimiter = sc.delimiter();
|
|
1453 |
Pattern a = Pattern.compile("A");
|
|
1454 |
sc.useDelimiter(a);
|
|
1455 |
Locale dummy = new Locale("en", "US", "dummy");
|
|
1456 |
sc.useLocale(dummy);
|
|
1457 |
sc.useRadix(16);
|
|
1458 |
if (sc.radix() != 16 ||
|
|
1459 |
!sc.locale().equals(dummy) ||
|
|
1460 |
!sc.delimiter().pattern().equals(a.pattern())) {
|
|
1461 |
failCount++;
|
|
1462 |
} else {
|
|
1463 |
sc.reset();
|
|
1464 |
if (sc.radix() != radix ||
|
|
1465 |
!sc.locale().equals(locale) ||
|
|
1466 |
!sc.delimiter().pattern().equals(delimiter.pattern())) {
|
|
1467 |
failCount++;
|
|
1468 |
}
|
|
1469 |
}
|
|
1470 |
sc.close();
|
|
1471 |
report("Reset test");
|
|
1472 |
}
|
|
1473 |
|
|
1474 |
private static void report(String testName) {
|
|
1475 |
int spacesToAdd = 30 - testName.length();
|
|
1476 |
StringBuffer paddedNameBuffer = new StringBuffer(testName);
|
|
1477 |
for (int i=0; i<spacesToAdd; i++)
|
|
1478 |
paddedNameBuffer.append(" ");
|
|
1479 |
String paddedName = paddedNameBuffer.toString();
|
|
1480 |
System.err.println(paddedName + ": " +
|
|
1481 |
(failCount==0 ? "Passed":"Failed("+failCount+")"));
|
|
1482 |
if (failCount > 0)
|
|
1483 |
failure = true;
|
|
1484 |
failCount = 0;
|
|
1485 |
}
|
|
1486 |
|
|
1487 |
static Scanner scannerFor(String input, int sourceType) {
|
|
1488 |
if (sourceType == 1)
|
|
1489 |
return new Scanner(input);
|
|
1490 |
else
|
|
1491 |
return new Scanner(new StutteringInputStream(input));
|
|
1492 |
}
|
|
1493 |
|
|
1494 |
static class ThrowingReadable implements Readable {
|
|
1495 |
ThrowingReadable() {
|
|
1496 |
}
|
|
1497 |
public int read(java.nio.CharBuffer cb) throws IOException {
|
|
1498 |
throw new IOException("ThrowingReadable always throws");
|
|
1499 |
}
|
|
1500 |
}
|
|
1501 |
}
|