ViewVC Help

View File | Revision Log | Show Annotations | Download File | Root Listing

root/jsr166/jsr166/src/test/loops/ListBash.java

Comparing jsr166/src/test/loops/ListBash.java (file contents):
Revision 1.2 by dl, Mon May 9 19:33:30 2005 UTC vs.
Revision 1.5 by dl, Mon Nov 28 15:40:56 2005 UTC

#	Line 7 | Line 7
7		import java.util.*;
8
9		public class ListBash {
10	<	static Random rnd = new Random();
10	>	static boolean canRemove = true;
11	>	static final Random rnd = new Random();
12	>	static int numItr;
13	>	static int listSize;
14	>	static boolean synch;
15	>	static Class cl;
16
17		public static void main(String[] args) {
18	<	int numItr = Integer.parseInt(args[1]);
19	<	int listSize = Integer.parseInt(args[2]);
20	<	Class cl = null;
18	>	numItr = Integer.parseInt(args[1]);
19	>	listSize = Integer.parseInt(args[2]);
20	>	cl = null;
21
22		try {
23		cl = Class.forName(args[0]);
#	Line 20 | Line 25 | public class ListBash {
25		fail("Class " + args[0] + " not found.");
26		}
27
28	<	boolean synch = (args.length>3);
28	>	synch = (args.length>3);
29	>	oneRun();
30	>	oneRun();
31	>	oneRun();
32	>	}
33
34	+	static void oneRun() {
35	+	long startTime = System.nanoTime();
36		for (int i=0; i<numItr; i++) {
37	<	List s1 = newList(cl, synch);
27	<	AddRandoms(s1, listSize);
28	<
29	<	List s2 = newList(cl, synch);
30	<	AddRandoms(s2, listSize);
31	<
32	<	List intersection = clone(s1, cl,synch);intersection.retainAll(s2);
33	<	List diff1 = clone(s1, cl, synch); diff1.removeAll(s2);
34	<	List diff2 = clone(s2, cl, synch); diff2.removeAll(s1);
35	<	List union = clone(s1, cl, synch); union.addAll(s2);
36	<
37	<	if (diff1.removeAll(diff2))
38	<	fail("List algebra identity 2 failed");
39	<	if (diff1.removeAll(intersection))
40	<	fail("List algebra identity 3 failed");
41	<	if (diff2.removeAll(diff1))
42	<	fail("List algebra identity 4 failed");
43	<	if (diff2.removeAll(intersection))
44	<	fail("List algebra identity 5 failed");
45	<	if (intersection.removeAll(diff1))
46	<	fail("List algebra identity 6 failed");
47	<	if (intersection.removeAll(diff1))
48	<	fail("List algebra identity 7 failed");
49	<
50	<	intersection.addAll(diff1); intersection.addAll(diff2);
51	<	if (!(intersection.containsAll(union) &&
52	<	union.containsAll(intersection)))
53	<	fail("List algebra identity 1 failed");
54	<
55	<	Iterator e = union.iterator();
56	<	while (e.hasNext())
57	<	intersection.remove(e.next());
58	<	if (!intersection.isEmpty())
59	<	fail("Copy nonempty after deleting all elements.");
60	<
61	<	e = union.iterator();
62	<	while (e.hasNext()) {
63	<	Object o = e.next();
64	<	if (!union.contains(o))
65	<	fail("List doesn't contain one of its elements.");
66	<	e.remove();
67	<	}
68	<	if (!union.isEmpty())
69	<	fail("List nonempty after deleting all elements.");
70	<
71	<	s1.clear();
72	<	if (s1.size() != 0)
73	<	fail("Clear didn't reduce size to zero.");
74	<
75	<	s1.addAll(0, s2);
76	<	if (!(s1.equals(s2) && s2.equals(s1)))
77	<	fail("addAll(int, Collection) doesn't work.");
78	<	// Reverse List
79	<	for (int j=0, n=s1.size(); j<n; j++)
80	<	s1.set(j, s1.set(n-j-1, s1.get(j)));
81	<	// Reverse it again
82	<	for (int j=0, n=s1.size(); j<n; j++)
83	<	s1.set(j, s1.set(n-j-1, s1.get(j)));
84	<	if (!(s1.equals(s2) && s2.equals(s1)))
85	<	fail("set(int, Object) doesn't work");
37	>	elementLoop();
38		}
39	<
88	<	List s = newList(cl, synch);
39	>	List<Integer> s = newList(cl, synch);
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");
44	+	evenOdd(s);
45	+	sublists(s);
46	+	arrays();
47	+	long elapsed = System.nanoTime() - startTime;
48	+	System.out.println("Time: " + (elapsed/1000000000.0) + "s");
49	+	}
50
51	<	List even = clone(s, cl, synch);
52	<	Iterator it = even.iterator();
53	<	while(it.hasNext())
54	<	if(((Integer)it.next()).intValue() % 2 == 1)
55	<	it.remove();
56	<	it = even.iterator();
57	<	while(it.hasNext())
58	<	if(((Integer)it.next()).intValue() % 2 == 1)
59	<	fail("Failed to remove all odd nubmers.");
60	<
61	<	List odd = clone(s, cl, synch);
62	<	for (int i=0; i<(listSize/2); i++)
63	<	odd.remove(i);
64	<	for (int i=0; i<(listSize/2); i++) {
65	<	int ii = ((Integer)odd.get(i)).intValue();
66	<	if(ii % 2 != 1)
67	<	fail("Failed to remove all even nubmers. " + ii);
68	<	}
69	<
70	<	List all = clone(odd, cl, synch);
71	<	for (int i=0; i<(listSize/2); i++)
72	<	all.add(2*i, even.get(i));
73	<	if (!all.equals(s))
74	<	fail("Failed to reconstruct ints from odds and evens.");
75	<
76	<	all = clone(odd,  cl, synch);
77	<	ListIterator itAll = all.listIterator(all.size());
78	<	ListIterator itEven = even.listIterator(even.size());
79	<	while (itEven.hasPrevious()) {
80	<	itAll.previous();
81	<	itAll.add(itEven.previous());
82	<	itAll.previous(); // ???
83	<	}
84	<	itAll = all.listIterator();
85	<	while (itAll.hasNext()) {
86	<	Integer i = (Integer)itAll.next();
87	<	itAll.set(new Integer(i.intValue()));
88	<	}
89	<	itAll = all.listIterator();
90	<	it = s.iterator();
91	<	while(it.hasNext())
92	<	if(it.next()==itAll.next())
93	<	fail("Iterator.set failed to change value.");
94	<
95	<	if (!all.equals(s))
96	<	fail("Failed to reconstruct ints with ListIterator.");
97	<
98	<	it = all.listIterator();
99	<	int i=0;
100	<	while (it.hasNext()) {
101	<	Object o = it.next();
102	<	if (all.indexOf(o) != all.lastIndexOf(o))
103	<	fail("Apparent duplicate detected.");
104	<	if (all.subList(i,   all.size()).indexOf(o) != 0) {
51	>
52	>
53	>	static void elementLoop() {
54	>	List<Integer> s1 = newList(cl, synch);
55	>	AddRandoms(s1, listSize);
56	>
57	>	List<Integer> s2 = newList(cl, synch);
58	>	AddRandoms(s2, listSize);
59	>
60	>	sets(s1, s2);
61	>
62	>	s1.clear();
63	>	if (s1.size() != 0)
64	>	fail("Clear didn't reduce size to zero.");
65	>
66	>	s1.addAll(0, s2);
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++)
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++)
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");
77	>	sums(s1, s2);
78	>	}
79	>
80	>	static void sums(List<Integer> s1, List<Integer> s2) {
81	>	int sum = 0;
82	>	for (int k = 0; k < listSize; ++k) {
83	>	sum += (s1.get(k)).intValue();
84	>	sum -= (s2.get(k)).intValue();
85	>	}
86	>	for (int k = 0; k < listSize; ++k) {
87	>	sum += (s1.get(k)).intValue();
88	>	s1.set(k, sum);
89	>	sum -= (s2.get(k)).intValue();
90	>	s1.set(k, -sum);
91	>	}
92	>	for (int k = 0; k < listSize; ++k) {
93	>	sum += (s1.get(k)).intValue();
94	>	sum -= (s2.get(k)).intValue();
95	>	}
96	>	if (sum == 0) System.out.print(" ");
97	>	}
98	>
99	>	static void sets(List<Integer> s1, List<Integer> s2) {
100	>	List<Integer> intersection = clone(s1, cl,synch);intersection.retainAll(s2);
101	>	List<Integer> diff1 = clone(s1, cl, synch); diff1.removeAll(s2);
102	>	List<Integer> diff2 = clone(s2, cl, synch); diff2.removeAll(s1);
103	>	List<Integer> union = clone(s1, cl, synch); union.addAll(s2);
104	>
105	>	if (diff1.removeAll(diff2))
106	>	fail("List algebra identity 2 failed");
107	>	if (diff1.removeAll(intersection))
108	>	fail("List algebra identity 3 failed");
109	>	if (diff2.removeAll(diff1))
110	>	fail("List algebra identity 4 failed");
111	>	if (diff2.removeAll(intersection))
112	>	fail("List algebra identity 5 failed");
113	>	if (intersection.removeAll(diff1))
114	>	fail("List algebra identity 6 failed");
115	>	if (intersection.removeAll(diff1))
116	>	fail("List algebra identity 7 failed");
117	>
118	>	intersection.addAll(diff1); intersection.addAll(diff2);
119	>	if (!(intersection.containsAll(union) &&
120	>	union.containsAll(intersection)))
121	>	fail("List algebra identity 1 failed");
122	>
123	>	Iterator e = union.iterator();
124	>	while (e.hasNext())
125	>	intersection.remove(e.next());
126	>	if (!intersection.isEmpty())
127	>	fail("Copy nonempty after deleting all elements.");
128	>
129	>	e = union.iterator();
130	>	while (e.hasNext()) {
131	>	Object o = e.next();
132	>	if (!union.contains(o))
133	>	fail("List doesn't contain one of its elements.");
134	>	if (canRemove) {
135	>	try { e.remove();
136	>	} catch (UnsupportedOperationException uoe) {
137	>	canRemove = false;
138	>	}
139	>	}
140	>	}
141	>	if (canRemove && !union.isEmpty())
142	>	fail("List nonempty after deleting all elements.");
143	>	}
144	>
145	>	static void evenOdd(List<Integer> s) {
146	>	List<Integer> even = clone(s, cl, synch);
147	>	List<Integer> odd = clone(s, cl, synch);
148	>	List<Integer> all;
149	>	Iterator<Integer> it;
150	>
151	>	if (!canRemove)
152	>	all = clone(s, cl, synch);
153	>	else {
154	>	it = even.iterator();
155	>	while(it.hasNext())
156	>	if((it.next()).intValue() % 2 == 1)
157	>	it.remove();
158	>	it = even.iterator();
159	>	while(it.hasNext())
160	>	if((it.next()).intValue() % 2 == 1)
161	>	fail("Failed to remove all odd nubmers.");
162	>
163	>	for (int i=0; i<(listSize/2); i++)
164	>	odd.remove(i);
165	>	for (int i=0; i<(listSize/2); i++) {
166	>	int ii = (odd.get(i)).intValue();
167	>	if(ii % 2 != 1)
168	>	fail("Failed to remove all even nubmers. " + ii);
169	>	}
170	>
171	>	all = clone(odd, cl, synch);
172	>	for (int i=0; i<(listSize/2); i++)
173	>	all.add(2*i, even.get(i));
174	>	if (!all.equals(s))
175	>	fail("Failed to reconstruct ints from odds and evens.");
176	>
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()) {
181	>	itAll.previous();
182	>	itAll.add(itEven.previous());
183	>	itAll.previous(); // ???
184	>	}
185	>	itAll = all.listIterator();
186	>	while (itAll.hasNext()) {
187	>	Integer i = itAll.next();
188	>	itAll.set(new Integer(i.intValue()));
189	>	}
190	>	itAll = all.listIterator();
191	>	it = s.iterator();
192	>	while(it.hasNext())
193	>	if(it.next()==itAll.next())
194	>	fail("Iterator.set failed to change value.");
195	>	}
196	>	if (!all.equals(s))
197	>	fail("Failed to reconstruct ints with ListIterator.");
198	>	}
199	>
200	>	static void sublists(List<Integer> s) {
201	>	List<Integer> all = clone(s, cl, synch);
202	>	Iterator it = all.listIterator();
203	>	int i=0;
204	>	while (it.hasNext()) {
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) {
209		System.out.println("s0: " + all.subList(i,   all.size()).indexOf(o));
210		fail("subList/indexOf is screwy.");
211		}
212		if (all.subList(i+1, all.size()).indexOf(o) != -1) {
213		System.out.println("s-1: " + all.subList(i+1, all.size()).indexOf(o));
214	<	fail("subList/indexOf is screwy.");
214	>	fail("subList/indexOf is screwy.");
215		}
216		if (all.subList(0,i+1).lastIndexOf(o) != i) {
217		System.out.println("si" + all.subList(0,i+1).lastIndexOf(o));
218	<	fail("subList/lastIndexOf is screwy.");
218	>	fail("subList/lastIndexOf is screwy.");
219		}
220	<	i++;
221	<	}
220	>	i++;
221	>	}
222	>	}
223
224	<	List l = newList(cl, synch);
224	>	static void arrays() {
225	>	List<Integer> l = newList(cl, synch);
226		AddRandoms(l, listSize);
227		Integer[] ia = (Integer[]) l.toArray(new Integer[0]);
228		if (!l.equals(Arrays.asList(ia)))
#	Line 174 | Line 237 | public class ListBash {
237		if (ia != ib || ia[listSize] != null
238		|| !l.equals(Arrays.asList(ia).subList(0, listSize)))
239		fail("toArray(Object[]) is hosed (3)");
177	–
178	–	System.out.println("Success.");
240		}
241
242		// Done inefficiently so as to exercise toArray
243	<	static List clone(List s, Class cl, boolean synch) {
243	>	static List<Integer> clone(List s, Class cl, boolean synch) {
244		List a = Arrays.asList(s.toArray());
245		if (s.hashCode() != a.hashCode())
246		fail("Incorrect hashCode computation.");
#	Line 193 | Line 254 | public class ListBash {
254		if (!clone.containsAll(s))
255		fail("Copy does not contain list.");
256
257	<	return clone;
257	>	return (List<Integer>)clone;
258		}
259
260	<	static List newList(Class cl, boolean synch) {
260	>	static List<Integer> newList(Class cl, boolean synch) {
261		try {
262	<	List s = (List)cl.newInstance();
262	>	List<Integer> s = (List<Integer>)cl.newInstance();
263		if (synch)
264		s = Collections.synchronizedList(s);
265		if (!s.isEmpty())
#	Line 210 | Line 271 | public class ListBash {
271		return null; //Shut up compiler.
272		}
273
274	<	static void AddRandoms(List s, int n) {
274	>	static void AddRandoms(List<Integer> s, int n) {
275		for (int i=0; i<n; i++) {
276		int r = rnd.nextInt() % n;
277		Integer e = new Integer(r < 0 ? -r : r);

Diff Legend

–	Removed lines
+	Added lines
<	Changed lines
>	Changed lines