1 |
|
/* |
2 |
|
* Written by Josh Bloch and Doug Lea with assistance from members of |
3 |
|
* JCP JSR-166 Expert Group and released to the public domain, as |
4 |
< |
* explained at http://creativecommons.org/licenses/publicdomain |
4 |
> |
* explained at http://creativecommons.org/publicdomain/zero/1.0/ |
5 |
|
*/ |
6 |
|
|
7 |
|
import java.util.*; |
25 |
|
fail("Class " + args[0] + " not found."); |
26 |
|
} |
27 |
|
|
28 |
< |
synch = (args.length>3); |
28 |
> |
synch = (args.length > 3); |
29 |
|
oneRun(); |
30 |
|
oneRun(); |
31 |
|
oneRun(); |
33 |
|
|
34 |
|
static void oneRun() { |
35 |
|
long startTime = System.nanoTime(); |
36 |
< |
for (int i=0; i<numItr; i++) { |
36 |
> |
for (int i = 0; i < numItr; i++) { |
37 |
|
elementLoop(); |
38 |
|
} |
39 |
|
List<Integer> s = newList(cl, synch); |
40 |
< |
for (int i=0; i<listSize; i++) |
40 |
> |
for (int i = 0; i < listSize; i++) |
41 |
|
s.add(new Integer(i)); |
42 |
|
if (s.size() != listSize) |
43 |
|
fail("Size of [0..n-1] != n"); |
67 |
|
if (!(s1.equals(s2) && s2.equals(s1))) |
68 |
|
fail("addAll(int, Collection) doesn't work."); |
69 |
|
// Reverse List |
70 |
< |
for (int j=0, n=s1.size(); j<n; j++) |
70 |
> |
for (int j = 0, n = s1.size(); j < n; j++) |
71 |
|
s1.set(j, s1.set(n-j-1, s1.get(j))); |
72 |
|
// Reverse it again |
73 |
< |
for (int j=0, n=s1.size(); j<n; j++) |
73 |
> |
for (int j = 0, n = s1.size(); j < n; j++) |
74 |
|
s1.set(j, s1.set(n-j-1, s1.get(j))); |
75 |
|
if (!(s1.equals(s2) && s2.equals(s1))) |
76 |
|
fail("set(int, Object) doesn't work"); |
174 |
|
if (!all.equals(s)) |
175 |
|
fail("Failed to reconstruct ints from odds and evens."); |
176 |
|
|
177 |
< |
all = clone(odd, cl, synch); |
177 |
> |
all = clone(odd, cl, synch); |
178 |
|
ListIterator<Integer> itAll = all.listIterator(all.size()); |
179 |
|
ListIterator<Integer> itEven = even.listIterator(even.size()); |
180 |
|
while (itEven.hasPrevious()) { |
205 |
|
Object o = it.next(); |
206 |
|
if (all.indexOf(o) != all.lastIndexOf(o)) |
207 |
|
fail("Apparent duplicate detected."); |
208 |
< |
if (all.subList(i, all.size()).indexOf(o) != 0) { |
208 |
> |
if (all.subList(i, all.size()).indexOf(o) != 0) { |
209 |
|
System.out.println("s0: " + all.subList(i, all.size()).indexOf(o)); |
210 |
|
fail("subList/indexOf is screwy."); |
211 |
|
} |
272 |
|
} |
273 |
|
|
274 |
|
static void AddRandoms(List<Integer> s, int n) { |
275 |
< |
for (int i=0; i<n; i++) { |
275 |
> |
for (int i = 0; i < n; i++) { |
276 |
|
int r = rnd.nextInt() % n; |
277 |
|
Integer e = new Integer(r < 0 ? -r : r); |
278 |
|
|