util/Collections/CheckedListBash.java

/*
 * Copyright 2003 Sun Microsystems, Inc.  All Rights Reserved.
 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
 *
 * This code is free software; you can redistribute it and/or modify it
 * under the terms of the GNU General Public License version 2 only, as
 * published by the Free Software Foundation.
 *
 * This code is distributed in the hope that it will be useful, but WITHOUT
 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
 * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
 * version 2 for more details (a copy is included in the LICENSE file that
 * accompanied this code).
 *
 * You should have received a copy of the GNU General Public License version
 * 2 along with this work; if not, write to the Free Software Foundation,
 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
 *
 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
 * CA 95054 USA or visit www.sun.com if you need additional information or
 * have any questions.
 */

/*
 * @test
 * @bug     4904067
 * @summary Unit test for Collections.checkedList
 * @author  Josh Bloch
 */

import java.util.*;

public class CheckedListBash {
    static Random rnd = new Random();

    public static void main(String[] args) {
        int numItr = 100;
        int listSize = 100;

        for (int i=0; i<numItr; i++) {
            List s1 = newList();
            AddRandoms(s1, listSize);

            List s2 = newList();
            AddRandoms(s2, listSize);

            List intersection = clone(s1); intersection.retainAll(s2);
            List diff1 = clone(s1); diff1.removeAll(s2);
            List diff2 = clone(s2); diff2.removeAll(s1);
            List union = clone(s1); union.addAll(s2);

            if (diff1.removeAll(diff2))
                fail("List algebra identity 2 failed");
            if (diff1.removeAll(intersection))
                fail("List algebra identity 3 failed");
            if (diff2.removeAll(diff1))
                fail("List algebra identity 4 failed");
            if (diff2.removeAll(intersection))
                fail("List algebra identity 5 failed");
            if (intersection.removeAll(diff1))
                fail("List algebra identity 6 failed");
            if (intersection.removeAll(diff1))
                fail("List algebra identity 7 failed");

            intersection.addAll(diff1); intersection.addAll(diff2);
            if (!(intersection.containsAll(union) &&
                  union.containsAll(intersection)))
                fail("List algebra identity 1 failed");

            Iterator e = union.iterator();
            while (e.hasNext())
                intersection.remove(e.next());
            if (!intersection.isEmpty())
                fail("Copy nonempty after deleting all elements.");

            e = union.iterator();
            while (e.hasNext()) {
                Object o = e.next();
                if (!union.contains(o))
                    fail("List doesn't contain one of its elements.");
                e.remove();
            }
            if (!union.isEmpty())
                fail("List nonempty after deleting all elements.");

            s1.clear();
            if (s1.size() != 0)
                fail("Clear didn't reduce size to zero.");

            s1.addAll(0, s2);
            if (!(s1.equals(s2) && s2.equals(s1)))
                fail("addAll(int, Collection) doesn't work.");
            // Reverse List
            for (int j=0, n=s1.size(); j<n; j++)
                s1.set(j, s1.set(n-j-1, s1.get(j)));
            // Reverse it again
            for (int j=0, n=s1.size(); j<n; j++)
                s1.set(j, s1.set(n-j-1, s1.get(j)));
            if (!(s1.equals(s2) && s2.equals(s1)))
                fail("set(int, Object) doesn't work");
        }

        List s = newList();
        for (int i=0; i<listSize; i++)
            s.add(new Integer(i));
        if (s.size() != listSize)
            fail("Size of [0..n-1] != n");

        List even = clone(s);
        Iterator it = even.iterator();
        while(it.hasNext())
            if(((Integer)it.next()).intValue() % 2 == 1)
                it.remove();
        it = even.iterator();
        while(it.hasNext())
            if(((Integer)it.next()).intValue() % 2 == 1)
                fail("Failed to remove all odd nubmers.");

        List odd = clone(s);
        for (int i=0; i<(listSize/2); i++)
            odd.remove(i);
        for (int i=0; i<(listSize/2); i++)
            if(((Integer)odd.get(i)).intValue() % 2 != 1)
                fail("Failed to remove all even nubmers.");

        List all = clone(odd);
        for (int i=0; i<(listSize/2); i++)
            all.add(2*i, even.get(i));
        if (!all.equals(s))
            fail("Failed to reconstruct ints from odds and evens.");

        all = clone(odd);
        ListIterator itAll = all.listIterator(all.size());
        ListIterator itEven = even.listIterator(even.size());
        while (itEven.hasPrevious()) {
            itAll.previous();
            itAll.add(itEven.previous());
            itAll.previous(); // ???
        }
        itAll = all.listIterator();
        while (itAll.hasNext()) {
            Integer i = (Integer)itAll.next();
            itAll.set(new Integer(i.intValue()));
        }
        itAll = all.listIterator();
        it = s.iterator();
        while(it.hasNext())
            if(it.next()==itAll.next())
                fail("Iterator.set failed to change value.");
        if (!all.equals(s))
            fail("Failed to reconstruct ints with ListIterator.");

        it = all.listIterator();
        int i=0;
        while (it.hasNext()) {
            Object o = it.next();
            if (all.indexOf(o) != all.lastIndexOf(o))
                fail("Apparent duplicate detected.");
            if (all.subList(i,   all.size()).indexOf(o) != 0 ||
                all.subList(i+1, all.size()).indexOf(o) != -1)
                fail("subList/indexOf is screwy.");
            if (all.subList(0,i+1).lastIndexOf(o) != i)
                fail("subList/lastIndexOf is screwy.");
            i++;
        }

        List l = newList();
        AddRandoms(l, listSize);
        Integer[] ia = (Integer[]) l.toArray(new Integer[0]);
        if (!l.equals(Arrays.asList(ia)))
            fail("toArray(Object[]) is hosed (1)");
        ia = new Integer[listSize];
        Integer[] ib = (Integer[]) l.toArray(ia);
        if (ia != ib || !l.equals(Arrays.asList(ia)))
            fail("toArray(Object[]) is hosed (2)");
        ia = new Integer[listSize+1];
        ia[listSize] = new Integer(69);
        ib = (Integer[]) l.toArray(ia);
        if (ia != ib || ia[listSize] != null
            || !l.equals(Arrays.asList(ia).subList(0, listSize)))
            fail("toArray(Object[]) is hosed (3)");

    }

    // Done inefficiently so as to exercise toArray
    static List clone(List s) {
        List a = Arrays.asList(s.toArray());
        if (s.hashCode() != a.hashCode())
            fail("Incorrect hashCode computation.");

        List clone = newList();
        clone.addAll(a);
        if (!s.equals(clone))
            fail("List not equal to copy.");
        if (!s.containsAll(clone))
            fail("List does not contain copy.");
        if (!clone.containsAll(s))
            fail("Copy does not contain list.");

        return clone;
    }

    static List newList() {
        List s =  Collections.checkedList(new ArrayList(), Integer.class);
        if (!s.isEmpty())
            fail("New instance non empty.");
        return s;
    }

    static void AddRandoms(List s, int n) {
        for (int i=0; i<n; i++) {
            int r = rnd.nextInt() % n;
            Integer e = new Integer(r < 0 ? -r : r);

            int preSize = s.size();
            if (!s.add(e))
                fail("Add failed.");
            int postSize = s.size();
            if (postSize-preSize != 1)
                fail("Add didn't increase size by 1.");
        }
    }

    static void fail(String s) {
        throw new RuntimeException(s);
    }
}
Revision:	1.2
Committed:	Wed Sep 1 07:47:27 2010 UTC (13 years, 8 months ago) by jsr166
Branch:	MAIN
Changes since 1.1:	+2 -2 lines
Log Message:	whitespace
#	User	Rev	Content
1	jsr166	1.1	/*
2			* Copyright 2003 Sun Microsystems, Inc. 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 Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
20			* CA 95054 USA or visit www.sun.com if you need additional information or
21			* have any questions.
22			*/
23
24			/*
25			* @test
26			* @bug 4904067
27			* @summary Unit test for Collections.checkedList
28			* @author Josh Bloch
29			*/
30
31			import java.util.*;
32
33			public class CheckedListBash {
34			static Random rnd = new Random();
35
36			public static void main(String[] args) {
37			int numItr = 100;
38			int listSize = 100;
39
40			for (int i=0; i<numItr; i++) {
41			List s1 = newList();
42			AddRandoms(s1, listSize);
43
44			List s2 = newList();
45			AddRandoms(s2, listSize);
46
47			List intersection = clone(s1); intersection.retainAll(s2);
48			List diff1 = clone(s1); diff1.removeAll(s2);
49			List diff2 = clone(s2); diff2.removeAll(s1);
50			List union = clone(s1); union.addAll(s2);
51
52			if (diff1.removeAll(diff2))
53			fail("List algebra identity 2 failed");
54			if (diff1.removeAll(intersection))
55			fail("List algebra identity 3 failed");
56			if (diff2.removeAll(diff1))
57			fail("List algebra identity 4 failed");
58			if (diff2.removeAll(intersection))
59			fail("List algebra identity 5 failed");
60			if (intersection.removeAll(diff1))
61			fail("List algebra identity 6 failed");
62			if (intersection.removeAll(diff1))
63			fail("List algebra identity 7 failed");
64
65			intersection.addAll(diff1); intersection.addAll(diff2);
66			if (!(intersection.containsAll(union) &&
67			union.containsAll(intersection)))
68			fail("List algebra identity 1 failed");
69
70			Iterator e = union.iterator();
71			while (e.hasNext())
72			intersection.remove(e.next());
73			if (!intersection.isEmpty())
74			fail("Copy nonempty after deleting all elements.");
75
76			e = union.iterator();
77			while (e.hasNext()) {
78			Object o = e.next();
79			if (!union.contains(o))
80			fail("List doesn't contain one of its elements.");
81			e.remove();
82			}
83			if (!union.isEmpty())
84			fail("List nonempty after deleting all elements.");
85
86			s1.clear();
87			if (s1.size() != 0)
88			fail("Clear didn't reduce size to zero.");
89
90			s1.addAll(0, s2);
91			if (!(s1.equals(s2) && s2.equals(s1)))
92			fail("addAll(int, Collection) doesn't work.");
93			// Reverse List
94			for (int j=0, n=s1.size(); j<n; j++)
95			s1.set(j, s1.set(n-j-1, s1.get(j)));
96			// Reverse it again
97			for (int j=0, n=s1.size(); j<n; j++)
98			s1.set(j, s1.set(n-j-1, s1.get(j)));
99			if (!(s1.equals(s2) && s2.equals(s1)))
100			fail("set(int, Object) doesn't work");
101			}
102
103			List s = newList();
104			for (int i=0; i<listSize; i++)
105			s.add(new Integer(i));
106			if (s.size() != listSize)
107			fail("Size of [0..n-1] != n");
108
109			List even = clone(s);
110			Iterator it = even.iterator();
111			while(it.hasNext())
112			if(((Integer)it.next()).intValue() % 2 == 1)
113			it.remove();
114			it = even.iterator();
115			while(it.hasNext())
116			if(((Integer)it.next()).intValue() % 2 == 1)
117			fail("Failed to remove all odd nubmers.");
118
119			List odd = clone(s);
120			for (int i=0; i<(listSize/2); i++)
121			odd.remove(i);
122			for (int i=0; i<(listSize/2); i++)
123			if(((Integer)odd.get(i)).intValue() % 2 != 1)
124			fail("Failed to remove all even nubmers.");
125
126			List all = clone(odd);
127			for (int i=0; i<(listSize/2); i++)
128			all.add(2*i, even.get(i));
129			if (!all.equals(s))
130			fail("Failed to reconstruct ints from odds and evens.");
131
132			all = clone(odd);
133			ListIterator itAll = all.listIterator(all.size());
134			ListIterator itEven = even.listIterator(even.size());
135			while (itEven.hasPrevious()) {
136			itAll.previous();
137			itAll.add(itEven.previous());
138			itAll.previous(); // ???
139			}
140			itAll = all.listIterator();
141			while (itAll.hasNext()) {
142			Integer i = (Integer)itAll.next();
143			itAll.set(new Integer(i.intValue()));
144			}
145			itAll = all.listIterator();
146			it = s.iterator();
147			while(it.hasNext())
148			if(it.next()==itAll.next())
149			fail("Iterator.set failed to change value.");
150			if (!all.equals(s))
151			fail("Failed to reconstruct ints with ListIterator.");
152
153			it = all.listIterator();
154			int i=0;
155			while (it.hasNext()) {
156			Object o = it.next();
157			if (all.indexOf(o) != all.lastIndexOf(o))
158			fail("Apparent duplicate detected.");
159			if (all.subList(i, all.size()).indexOf(o) != 0 \|\|
160			all.subList(i+1, all.size()).indexOf(o) != -1)
161			fail("subList/indexOf is screwy.");
162			if (all.subList(0,i+1).lastIndexOf(o) != i)
163			fail("subList/lastIndexOf is screwy.");
164			i++;
165			}
166
167			List l = newList();
168			AddRandoms(l, listSize);
169			Integer[] ia = (Integer[]) l.toArray(new Integer[0]);
170			if (!l.equals(Arrays.asList(ia)))
171			fail("toArray(Object[]) is hosed (1)");
172			ia = new Integer[listSize];
173			Integer[] ib = (Integer[]) l.toArray(ia);
174			if (ia != ib \|\| !l.equals(Arrays.asList(ia)))
175			fail("toArray(Object[]) is hosed (2)");
176			ia = new Integer[listSize+1];
177			ia[listSize] = new Integer(69);
178			ib = (Integer[]) l.toArray(ia);
179			if (ia != ib \|\| ia[listSize] != null
180			\|\| !l.equals(Arrays.asList(ia).subList(0, listSize)))
181			fail("toArray(Object[]) is hosed (3)");
182
183			}
184
185			// Done inefficiently so as to exercise toArray
186			static List clone(List s) {
187			List a = Arrays.asList(s.toArray());
188			if (s.hashCode() != a.hashCode())
189			fail("Incorrect hashCode computation.");
190
191			List clone = newList();
192			clone.addAll(a);
193			if (!s.equals(clone))
194			fail("List not equal to copy.");
195			if (!s.containsAll(clone))
196			fail("List does not contain copy.");
197			if (!clone.containsAll(s))
198			fail("Copy does not contain list.");
199
200			return clone;
201			}
202
203			static List newList() {
204			List s = Collections.checkedList(new ArrayList(), Integer.class);
205			if (!s.isEmpty())
206			fail("New instance non empty.");
207			return s;
208			}
209
210			static void AddRandoms(List s, int n) {
211			for (int i=0; i<n; i++) {
212			int r = rnd.nextInt() % n;
213			Integer e = new Integer(r < 0 ? -r : r);
214
215			int preSize = s.size();
216			if (!s.add(e))
217	jsr166	1.2	fail("Add failed.");
218	jsr166	1.1	int postSize = s.size();
219			if (postSize-preSize != 1)
220	jsr166	1.2	fail("Add didn't increase size by 1.");
221	jsr166	1.1	}
222			}
223
224			static void fail(String s) {
225			throw new RuntimeException(s);
226			}
227			}