-
Notifications
You must be signed in to change notification settings - Fork 11
/
Assignment6-WordNet-DirectedGraph.txt
689 lines (533 loc) · 21.9 KB
/
Assignment6-WordNet-DirectedGraph.txt
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
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
See the Assessment Guide for information on how to interpret this report.
ASSESSMENT SUMMARY
Compilation: PASSED
API: PASSED
Spotbugs: PASSED
PMD: PASSED
Checkstyle: FAILED (0 errors, 11 warnings)
Correctness: 36/36 tests passed
Memory: 4/4 tests passed
Timing: 33/27 tests passed
Aggregate score: 104.44%
[Compilation: 5%, API: 5%, Spotbugs: 0%, PMD: 0%, Checkstyle: 0%, Correctness: 60%, Memory: 10%, Timing: 20%]
ASSESSMENT DETAILS
The following files were submitted:
----------------------------------
1.1K Jan 25 08:13 Outcast.java
8.6K Jan 25 08:13 SAP.java
4.8K Jan 25 08:13 WordNet.java
********************************************************************************
* COMPILING
********************************************************************************
% javac SAP.java
*-----------------------------------------------------------
% javac WordNet.java
*-----------------------------------------------------------
% javac Outcast.java
*-----------------------------------------------------------
================================================================
Checking the APIs of your programs.
*-----------------------------------------------------------
SAP:
WordNet:
Outcast:
================================================================
********************************************************************************
* CHECKING STYLE AND COMMON BUG PATTERNS
********************************************************************************
% spotbugs *.class
*-----------------------------------------------------------
================================================================
% pmd .
*-----------------------------------------------------------
================================================================
% checkstyle *.java
*-----------------------------------------------------------
[WARN] SAP.java:12:23: The instance variable 'V' must start with a lowercase letter and use camelCase. [MemberName]
[WARN] SAP.java:177:43: The local (or parameter) variable 'q1' has the same name as an instance variable. Use a different name. [HiddenField]
[WARN] SAP.java:177:53: The local (or parameter) variable 'distTo1' has the same name as an instance variable. Use a different name. [HiddenField]
[WARN] SAP.java:177:68: The local (or parameter) variable 'distTo2' has the same name as an instance variable. Use a different name. [HiddenField]
[WARN] SAP.java:177:87: The local (or parameter) variable 'marked1' has the same name as an instance variable. Use a different name. [HiddenField]
[WARN] SAP.java:177:106: The local (or parameter) variable 'marked2' has the same name as an instance variable. Use a different name. [HiddenField]
[WARN] SAP.java:177:130: The local (or parameter) variable 'visited1' has the same name as an instance variable. Use a different name. [HiddenField]
[WARN] SAP.java:239:35: The local (or parameter) variable 'G' has the same name as an instance variable. Use a different name. [HiddenField]
[WARN] WordNet.java:128:45: The local (or parameter) variable 'ids' has the same name as an instance variable. Use a different name. [HiddenField]
Checkstyle ends with 0 errors and 9 warnings.
% custom checkstyle checks for SAP.java
*-----------------------------------------------------------
[WARN] SAP.java:9:49: The numeric literal '17' appears to be unnecessary. [NumericLiteral]
[WARN] SAP.java:10:52: The numeric literal '31' appears to be unnecessary. [NumericLiteral]
Checkstyle ends with 0 errors and 2 warnings.
% custom checkstyle checks for WordNet.java
*-----------------------------------------------------------
[INFO] WordNet.java:1: The program uses neither 'DirectedCycle' nor 'Topological' to check whether the digraph is a DAG. [Design]
% custom checkstyle checks for Outcast.java
*-----------------------------------------------------------
================================================================
********************************************************************************
* TESTING CORRECTNESS
********************************************************************************
Testing correctness of SAP
*-----------------------------------------------------------
Running 20 total tests.
Test 1: check length() and ancestor() on fixed digraphs
* digraph1.txt
* digraph2.txt
* digraph3.txt
* digraph4.txt
* digraph5.txt
* digraph6.txt
* digraph9.txt
==> passed
Test 2: check length() and ancestor() on WordNet digraph
* 100 random vertex pairs in digraph-wordnet.txt
==> passed
Test 3: check length() and ancestor() on directed paths
* 5
* 10
* 20
* 50
* 100
==> passed
Test 4: check length() and ancestor() on directed cycles
* 5
* 10
* 20
* 50
* 100
==> passed
Test 5: check length() and ancestor() on complete graphs
* 5
* 10
* 20
* 50
==> passed
Test 6: check length() and ancestor() on tournament digraphs
* 5
* 10
* 20
* 50
==> passed
Test 7: check length() and ancestor() on complete binary trees
* 5
* 10
* 20
* 50
* 100
==> passed
Test 8: check length() and ancestor() on random DAGs
* 5 vertices, 8 edges
* 10 vertices, 40 edges
* 20 vertices, 100 edges
==> passed
Test 9: check length() and ancestor() on random rooted-in DAGs
* 5 vertices, 8 edges
* 10 vertices, 40 edges
* 20 vertices, 100 edges
==> passed
Test 10: check length() and ancestor() on random rooted-out DAGs
* 5 vertices, 8 edges
* 10 vertices, 40 edges
* 20 vertices, 100 edges
==> passed
Test 11: check length() and ancestor() on random rooted-in trees
* 5 vertices
* 10 vertices
* 20 vertices
==> passed
Test 12: check length() and ancestor() on random rooted-out trees
* 5 vertices
* 10 vertices
* 20 vertices
==> passed
Test 13: check length() and ancestor() on random simple digraphs
* 5 vertices, 8 edges
* 10 vertices, 40 edges
* 20 vertices, 100 edges
==> passed
Test 14: check whether two SAP objects can be created at the same time
* digraph1.txt and digraph2.txt
* digraph3.txt and digraph4.txt
* digraph5.txt and digraph6.txt
* digraph2.txt and digraph1.txt
==> passed
Test 15: check whether SAP is immutable
* digraph1.txt
* digraph2.txt
* digraph3.txt
* digraph4.txt
* digraph5.txt
* digraph6.txt
* digraph-ambiguous-ancestor.txt
==> passed
Test 16: check length() and ancestor() with iterable arguments
* 100 random subsets of 1 and 1 vertices in digraph-wordnet.txt
* 100 random subsets of 1 and 2 vertices in digraph-wordnet.txt
* 100 random subsets of 2 and 1 vertices in digraph-wordnet.txt
* 100 random subsets of 2 and 2 vertices in digraph-wordnet.txt
* 100 random subsets of 3 and 11 vertices in digraph-wordnet.txt
* 100 random subsets of 11 and 3 vertices in digraph-wordnet.txt
==> passed
Test 17: check length() and ancestor() with zero-length iterable arguments
* 100 random subsets of 0 and 5 vertices in digraph-wordnet.txt
* 100 random subsets of 5 and 0 vertices in digraph-wordnet.txt
* 100 random subsets of 0 and 0 vertices in digraph-wordnet.txt
==> passed
Test 18: check length() and ancestor() with invalid arguments
* G = digraph1.txt v = -1, w = 0
* G = digraph1.txt v = 0, w = -1
* G = digraph1.txt v = 13, w = 0
* G = digraph1.txt v = 0, w = 13
==> passed
Test 19: check iterable versions of length() and ancestor() with invalid arguments
* G = digraph1.txt, v = { 0, 7, 9, 12 }, w = null
* G = digraph1.txt, v = null, w = { 1, 2, 4, 5, 10 }
* G = digraph1.txt, v = null, w = null
* G = digraph1.txt, v = { 0, 7, 9, 12, -1 }, w = { 1, 2, 4, 5, 10 }
* G = digraph1.txt, v = { 0, 7, 9, 12 }, w = { 1, 2, -1, 4, 5, 10 }
* G = digraph1.txt, v = { 13, 0, 7, 9, 12 }, w = { 1, 2, 4, 5, 10 }
* G = digraph1.txt, v = { 0, 7, 9, 12 }, w = { 1, 2, 4, 5, 13, 10 }
* G = digraph1.txt, v = { 0, null, 7, 9, 12 }, w = { 1, 2, 4, 5, 10 }
* G = digraph1.txt, v = { 0, 7, 9, 12 }, w = { 1, 2, 4, null, 5, 10 }
==> passed
Test 20: random calls to both version of length() and ancestor(),
with probabilities p1 and p2, respectively
* random calls in a random rooted DAG (20 vertices, 100 edges)
(p1 = 0.5, p2 = 0.5)
* random calls in a random digraph (20 vertices, 100 edges)
(p1 = 0.5, p2 = 0.5)
==> passed
Total: 20/20 tests passed!
================================================================
********************************************************************************
* TESTING CORRECTNESS (substituting reference SAP)
********************************************************************************
Testing correctness of WordNet
*-----------------------------------------------------------
Running 14 total tests.
Test 1: check distance() with random noun pairs
* 1000 pairs using synsets = synsets.txt; hypernyms = hypernyms.txt
==> passed
Test 2: check distance() with all noun pairs
* synsets = synsets15.txt; hypernyms = hypernyms15Path.txt
* synsets = synsets15.txt; hypernyms = hypernyms15Tree.txt
* synsets = synsets6.txt; hypernyms = hypernyms6TwoAncestors.txt
* synsets = synsets11.txt; hypernyms = hypernyms11AmbiguousAncestor.txt
* synsets = synsets8.txt; hypernyms = hypernyms8ModTree.txt
* synsets = synsets8.txt; hypernyms = hypernyms8WrongBFS.txt
* synsets = synsets11.txt; hypernyms = hypernyms11ManyPathsOneAncestor.txt
* synsets = synsets8.txt; hypernyms = hypernyms8ManyAncestors.txt
==> passed
Test 3: check distance() with random noun pairs
* 1000 pairs using synsets = synsets100-subgraph.txt; hypernyms = hypernyms100-subgraph.txt
* 1000 pairs using synsets = synsets500-subgraph.txt; hypernyms = hypernyms500-subgraph.txt
* 1000 pairs using synsets = synsets1000-subgraph.txt; hypernyms = hypernyms1000-subgraph.txt
==> passed
Test 4: check sap() with random noun pairs
* 1000 pairs using synsets = synsets.txt; hypernyms = hypernyms.txt
==> passed
Test 5: check sap() with all noun pairs
* synsets = synsets15.txt; hypernyms = hypernyms15Path.txt
* synsets = synsets15.txt; hypernyms = hypernyms15Tree.txt
* synsets = synsets6.txt; hypernyms = hypernyms6TwoAncestors.txt
* synsets = synsets11.txt; hypernyms = hypernyms11AmbiguousAncestor.txt
* synsets = synsets8.txt; hypernyms = hypernyms8ModTree.txt
* synsets = synsets8.txt; hypernyms = hypernyms8WrongBFS.txt
* synsets = synsets11.txt; hypernyms = hypernyms11ManyPathsOneAncestor.txt
* synsets = synsets8.txt; hypernyms = hypernyms8ManyAncestors.txt
==> passed
Test 6: check sap() with random noun pairs
* 1000 pairs using synsets = synsets100-subgraph.txt; hypernyms = hypernyms100-subgraph.txt
* 1000 pairs using synsets = synsets500-subgraph.txt; hypernyms = hypernyms500-subgraph.txt
* 1000 pairs using synsets = synsets1000-subgraph.txt; hypernyms = hypernyms1000-subgraph.txt
==> passed
Test 7: check whether WordNet is immutable
* synsets = synsets.txt; hypernyms = hypernyms.txt
==> passed
Test 8: check constructor when input is not a rooted DAG
* synsets3.txt, hypernyms3InvalidTwoRoots.txt
* synsets3.txt, hypernyms3InvalidCycle.txt
* synsets6.txt, hypernyms6InvalidTwoRoots.txt
* synsets6.txt, hypernyms6InvalidCycle.txt
* synsets6.txt, hypernyms6InvalidCycle+Path.txt
==> passed
Test 9: check isNoun()
* synsets = synsets.txt; hypernyms = hypernyms.txt
* synsets = synsets15.txt; hypernyms = hypernyms15Path.txt
* synsets = synsets8.txt; hypernyms = hypernyms8ModTree.txt
==> passed
Test 10: check nouns()
* synsets = synsets.txt; hypernyms = hypernyms.txt
* synsets = synsets15.txt; hypernyms = hypernyms15Path.txt
* synsets = synsets8.txt; hypernyms = hypernyms8ModTree.txt
==> passed
Test 11: check whether two WordNet objects can be created at the same time
* synsets1 = synsets15.txt; hypernyms1 = hypernyms15Tree.txt
synsets2 = synsets15.txt; hypernyms2 = hypernyms15Path.txt
* synsets1 = synsets.txt; hypernyms1 = hypernyms.txt
synsets2 = synsets15.txt; hypernyms2 = hypernyms15Path.txt
==> passed
Test 12: call distance() and sap() with invalid arguments
* synsets15.txt, hypernyms15Tree.txt, nounA = "x", nounB = "b"
* synsets15.txt, hypernyms15Tree.txt, nounA = "b", nounB = "x"
* synsets15.txt, hypernyms15Tree.txt, nounA = "x", nounB = "a"
* synsets15.txt, hypernyms15Tree.txt, nounA = "x", nounB = "x"
* synsets15.txt, hypernyms15Tree.txt, nounA = "a", nounB = null
* synsets15.txt, hypernyms15Tree.txt, nounA = null, nounB = "a"
* synsets15.txt, hypernyms15Tree.txt, nounA = null, nounB = null
* synsets15.txt, hypernyms15Tree.txt, nounA = "x", nounB = null
* synsets15.txt, hypernyms15Tree.txt, nounA = null, nounB = "x"
==> passed
Test 13: call isNoun() with a null argument
* synsets15.txt, hypernyms15Path.txt
==> passed
Test 14: random calls to isNoun(), distance(), and sap(), with
probabilities p1, p2, and p3, respectively
* 100 random calls (p1 = 0.5, p2 = 0.5, p3 = 0.0)
* 100 random calls (p1 = 0.5, p2 = 0.0, p3 = 0.5)
* 100 random calls (p1 = 0.0, p2 = 0.5, p3 = 0.5)
* 100 random calls (p1 = 0.2, p2 = 0.4, p3 = 0.4)
==> passed
Total: 14/14 tests passed!
================================================================
********************************************************************************
* TESTING CORRECTNESS (substituting reference SAP and WordNet)
********************************************************************************
Testing correctness of Outcast
*-----------------------------------------------------------
Running 2 total tests.
Test 1: check outcast() on WordNet digraph
(synsets.txt and hypernyms.txt)
* outcast2.txt
* outcast3.txt
* outcast4.txt
* outcast5.txt
* outcast5a.txt
* outcast7.txt
* outcast8.txt
* outcast8a.txt
* outcast8b.txt
* outcast8c.txt
* outcast9.txt
* outcast9a.txt
* outcast10.txt
* outcast10a.txt
* outcast11.txt
* outcast12.txt
* outcast12a.txt
* outcast17.txt
* outcast20.txt
* outcast29.txt
==> passed
Test 2: check outcast() on WordNet subgraph
(synsets50000-subgraph.txt and hypernyms50000-subgraph.txt)
* outcast2.txt
* outcast3.txt
* outcast5.txt
* outcast5a.txt
* outcast7.txt
* outcast8.txt
* outcast8b.txt
* outcast8c.txt
* outcast9.txt
* outcast10.txt
* outcast11.txt
==> passed
Total: 2/2 tests passed!
================================================================
********************************************************************************
* MEMORY
********************************************************************************
Analyzing memory of SAP
*-----------------------------------------------------------
Running 1 total tests.
digraph G = digraph-wordnet.txt
vertices in G = 82192
edges in G = 84505
student memory = 9170144 bytes
reference memory = 10320368 bytes
ratio = 0.89
maximum allowed ratio = 2.50
Total: 1/1 tests passed!
================================================================
Analyzing memory of WordNet
*-----------------------------------------------------------
Running 3 total tests.
Test 1a: check memory of WordNet object
* synsets = synsets1000-subgraph.txt; hypernyms = hypernyms1000-subgraph.txt
- number of vertices in digraph = 1000
- number of edges in digraph = 1008
- student memory = 607416 bytes
- reference memory = 1494080 bytes
- student / reference ratio = 0.4
- maximum allowed rato = 2.0
==> passed
Test 1b: check memory of WordNet object
* synsets = synsets5000-subgraph.txt; hypernyms = hypernyms5000-subgraph.txt
- number of vertices in digraph = 5000
- number of edges in digraph = 5059
- student memory = 2975856 bytes
- reference memory = 7296408 bytes
- student / reference ratio = 0.4
- maximum allowed rato = 2.0
==> passed
Test 1c: check memory of WordNet object
* synsets = synsets10000-subgraph.txt; hypernyms = hypernyms10000-subgraph.txt
- number of vertices in digraph = 10000
- number of edges in digraph = 10087
- student memory = 7223968 bytes
- reference memory = 16931256 bytes
- student / reference ratio = 0.4
- maximum allowed rato = 2.0
==> passed
Total: 3/3 tests passed!
================================================================
********************************************************************************
* TIMING
********************************************************************************
Timing SAP
*-----------------------------------------------------------
Running 14 total tests.
Test 1: time SAP constructor
* digraph-wordnet.txt
- student solution time = 0.03 seconds
- maximum allowed time = 1.00 seconds
==> passed
Test 2a-c: time length() and ancestor() with random pairs of vertices
* digraph-wordnet.txt
- reference solution calls per second: 512414.00
- student solution calls per second: 523036.00
- reference / student ratio: 0.98
=> passed student <= 50000x reference
=> passed student <= 10000x reference
=> passed student <= 5000x reference
=> passed student <= 1000x reference
=> BONUS student <= 100x reference
=> BONUS student <= 10x reference
=> BONUS student <= 2x reference
Test 3a-c: time length() and ancestor() with random subsets of 5 vertices
* digraph-wordnet.txt
- reference solution calls per second: 182070.00
- student solution calls per second: 198014.00
- reference / student ratio: 0.92
=> passed student <= 10000x reference
=> passed student <= 5000x reference
=> passed student <= 1000x reference
=> passed student <= 500x reference
=> BONUS student <= 10x reference
=> BONUS student <= 2x reference
Test 4a-c: time length() and ancestor() with random subsets of 100 vertices
* digraph-wordnet.txt
- reference solution calls per second: 11797.00
- student solution calls per second: 23223.00
- reference / student ratio: 0.51
=> passed student <= 10000x reference
=> passed student <= 5000x reference
=> passed student <= 1000x reference
=> passed student <= 500x reference
=> BONUS student <= 2x reference
Test 5: Time 10 calls to length() and ancestor() on random path graphs
(must handle V = 65536 in under 2 seconds)
V seconds
---------------
65536 0.06
==> passed
Total: 20/14 tests passed!
================================================================
********************************************************************************
* TIMING (substituting reference SAP)
********************************************************************************
Timing WordNet
*-----------------------------------------------------------
Running 11 total tests.
Test 1: check that exactly two In object created
(one for synsets file and one for hypernyms file)
==> passed
Test 2: count number of SAP operations when constructing a WordNet object
and calling distance() and sap() three times each
* calls to constructor = 1
* calls to length() = 3
* calls to ancestor() = 6
==> passed
Test 3: count Digraph operations during WordNet constructor
* synsets = synsets.txt; hypernyms = hypernyms.txt
* number of synsets = 82192
* number of hypernyms = 84505
* calls to constructor = 2
* calls to addEdge() = 84505
* calls to adj() = 0
* calls to outdegree() = 82192
* calls to indegree() = 0
* calls to reverse() = 0
* calls to toString() = 0
==> passed
Test 4: count Digraph operations during 1000 calls each
to distance() and sap()
* synsets = synsets.txt; hypernyms = hypernyms.txt
* calls to constructor = 0
* calls to addEdge() = 0
* calls to adj() = 45638
* calls to reverse() = 0
* calls to toString() = 0
==> passed
Test 5: time WordNet constructor
* synsets = synsets.txt; hypernyms = hypernyms.txt
- student constructor time = 0.37 seconds
- maximum allowed time = 10.00 seconds
==> passed
Test 6a-e: time sap() and distance() with random nouns
* synsets = synsets.txt; hypernyms = hypernyms.txt
- reference solution calls per second: 169332.00
- student solution calls per second: 195243.75
- reference / student ratio: 0.87
=> passed student <= 10000x reference
=> passed student <= 1000x reference
=> passed student <= 100x reference
=> passed student <= 10x reference
=> passed student <= 5x reference
Test 7: time isNoun() with random nouns
* synsets = synsets.txt; hypernyms = hypernyms.txt
- reference solution calls per second: 446448.00
- student solution calls per second: 429425.00
- reference / student ratio: 1.04
- allowed ratio: 4.00
==> passed
Total: 11/11 tests passed!
================================================================
********************************************************************************
* TIMING (substituting reference SAP and WordNet)
********************************************************************************
Timing Outcast
*-----------------------------------------------------------
Running 2 total tests.
Test 1: count calls to methods in WordNet
* outcast4.txt
* outcast10.txt
* outcast29.txt
==> passed
Test 2: timing calls to outcast() for various outcast files
Total time must not exceed 1.0 seconds.
filename n time
-----------------------------
outcast4.txt 4 0.00
outcast5.txt 5 0.00
outcast5a.txt 5 0.00
outcast5.txt 5 0.00
outcast7.txt 7 0.00
outcast8.txt 8 0.00
outcast8a.txt 8 0.00
outcast8b.txt 8 0.00
outcast8c.txt 8 0.00
outcast9.txt 9 0.00
outcast9a.txt 9 0.00
outcast10.txt 10 0.00
outcast10a.txt 10 0.00
outcast11.txt 11 0.00
outcast12.txt 12 0.00
outcast12a.txt 12 0.00
outcast20.txt 20 0.00
outcast29.txt 29 0.01
Total elapsed time: 0.02 seconds
==> passed
Total: 2/2 tests passed!
================================================================