util/Collection/IteratorAtEnd.java

/*
 * Copyright 2007 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 6529795
 * @summary next() does not change iterator state if throws NoSuchElementException
 * @author Martin Buchholz
 */

import java.util.*;
import java.util.concurrent.*;

@SuppressWarnings("unchecked")
public class IteratorAtEnd {
    private static final int SIZE = 6;

    static void realMain(String[] args) throws Throwable {
        testCollection(new ArrayList());
        testCollection(new Vector());
        testCollection(new LinkedList());
        testCollection(new ArrayDeque());
        testCollection(new TreeSet());
        testCollection(new CopyOnWriteArrayList());
        testCollection(new CopyOnWriteArraySet());
        testCollection(new ConcurrentSkipListSet());

        testCollection(new PriorityQueue());
        testCollection(new LinkedBlockingQueue());
        testCollection(new ArrayBlockingQueue(100));
        testCollection(new ConcurrentLinkedDeque());
        testCollection(new ConcurrentLinkedQueue());
        testCollection(new LinkedTransferQueue());

        testMap(new HashMap());
        testMap(new Hashtable());
        testMap(new LinkedHashMap());
        testMap(new WeakHashMap());
        testMap(new IdentityHashMap());
        testMap(new ConcurrentHashMap());
        testMap(new ConcurrentSkipListMap());
        testMap(new TreeMap());
    }

    static void testCollection(Collection c) {
        try {
            for (int i = 0; i < SIZE; i++)
                c.add(i);
            test(c);
        } catch (Throwable t) { unexpected(t); }
    }

    static void testMap(Map m) {
        try {
            for (int i = 0; i < 3*SIZE; i++)
                m.put(i, i);
            test(m.values());
            test(m.keySet());
            test(m.entrySet());
        } catch (Throwable t) { unexpected(t); }
    }

    static void test(Collection c) {
        try {
            final Iterator it = c.iterator();
            THROWS(NoSuchElementException.class,
                   new Fun() {void f() { while (true) it.next(); }});
            try { it.remove(); }
            catch (UnsupportedOperationException _) { return; }
            pass();
        } catch (Throwable t) { unexpected(t); }

        if (c instanceof List) {
            final List list = (List) c;
            try {
                final ListIterator it = list.listIterator(0);
                it.next();
                final Object x = it.previous();
                THROWS(NoSuchElementException.class,
                       new Fun() {void f() { it.previous(); }});
                try { it.remove(); }
                catch (UnsupportedOperationException _) { return; }
                pass();
                check(! list.get(0).equals(x));
            } catch (Throwable t) { unexpected(t); }

            try {
                final ListIterator it = list.listIterator(list.size());
                it.previous();
                final Object x = it.next();
                THROWS(NoSuchElementException.class,
                       new Fun() {void f() { it.next(); }});
                try { it.remove(); }
                catch (UnsupportedOperationException _) { return; }
                pass();
                check(! list.get(list.size()-1).equals(x));
            } catch (Throwable t) { unexpected(t); }
        }
    }

    //--------------------- Infrastructure ---------------------------
    static volatile int passed = 0, failed = 0;
    static void pass() {passed++;}
    static void fail() {failed++; Thread.dumpStack();}
    static void fail(String msg) {System.out.println(msg); fail();}
    static void unexpected(Throwable t) {failed++; t.printStackTrace();}
    static void check(boolean cond) {if (cond) pass(); else fail();}
    static void equal(Object x, Object y) {
        if (x == null ? y == null : x.equals(y)) pass();
        else fail(x + " not equal to " + y);}
    public static void main(String[] args) throws Throwable {
        try {realMain(args);} catch (Throwable t) {unexpected(t);}
        System.out.printf("%nPassed = %d, failed = %d%n%n", passed, failed);
        if (failed > 0) throw new AssertionError("Some tests failed");}
    private static abstract class Fun {abstract void f() throws Throwable;}
    static void THROWS(Class<? extends Throwable> k, Fun... fs) {
        for (Fun f : fs)
            try { f.f(); fail("Expected " + k.getName() + " not thrown"); }
            catch (Throwable t) {
                if (k.isAssignableFrom(t.getClass())) pass();
                else unexpected(t);}}
}
Revision:	1.2
Committed:	Wed Aug 25 21:40:03 2010 UTC (13 years, 9 months ago) by jsr166
Branch:	MAIN
Changes since 1.1:	+1 -0 lines
Log Message:	Finish ConcurrentLinkedDeque feature
#	User	Rev	Content
1	jsr166	1.1	/*
2			* Copyright 2007 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 6529795
27			* @summary next() does not change iterator state if throws NoSuchElementException
28			* @author Martin Buchholz
29			*/
30
31			import java.util.*;
32			import java.util.concurrent.*;
33
34			@SuppressWarnings("unchecked")
35			public class IteratorAtEnd {
36			private static final int SIZE = 6;
37
38			static void realMain(String[] args) throws Throwable {
39			testCollection(new ArrayList());
40			testCollection(new Vector());
41			testCollection(new LinkedList());
42			testCollection(new ArrayDeque());
43			testCollection(new TreeSet());
44			testCollection(new CopyOnWriteArrayList());
45			testCollection(new CopyOnWriteArraySet());
46			testCollection(new ConcurrentSkipListSet());
47
48			testCollection(new PriorityQueue());
49			testCollection(new LinkedBlockingQueue());
50			testCollection(new ArrayBlockingQueue(100));
51	jsr166	1.2	testCollection(new ConcurrentLinkedDeque());
52	jsr166	1.1	testCollection(new ConcurrentLinkedQueue());
53			testCollection(new LinkedTransferQueue());
54
55			testMap(new HashMap());
56			testMap(new Hashtable());
57			testMap(new LinkedHashMap());
58			testMap(new WeakHashMap());
59			testMap(new IdentityHashMap());
60			testMap(new ConcurrentHashMap());
61			testMap(new ConcurrentSkipListMap());
62			testMap(new TreeMap());
63			}
64
65			static void testCollection(Collection c) {
66			try {
67			for (int i = 0; i < SIZE; i++)
68			c.add(i);
69			test(c);
70			} catch (Throwable t) { unexpected(t); }
71			}
72
73			static void testMap(Map m) {
74			try {
75			for (int i = 0; i < 3*SIZE; i++)
76			m.put(i, i);
77			test(m.values());
78			test(m.keySet());
79			test(m.entrySet());
80			} catch (Throwable t) { unexpected(t); }
81			}
82
83			static void test(Collection c) {
84			try {
85			final Iterator it = c.iterator();
86			THROWS(NoSuchElementException.class,
87			new Fun() {void f() { while (true) it.next(); }});
88			try { it.remove(); }
89			catch (UnsupportedOperationException _) { return; }
90			pass();
91			} catch (Throwable t) { unexpected(t); }
92
93			if (c instanceof List) {
94			final List list = (List) c;
95			try {
96			final ListIterator it = list.listIterator(0);
97			it.next();
98			final Object x = it.previous();
99			THROWS(NoSuchElementException.class,
100			new Fun() {void f() { it.previous(); }});
101			try { it.remove(); }
102			catch (UnsupportedOperationException _) { return; }
103			pass();
104			check(! list.get(0).equals(x));
105			} catch (Throwable t) { unexpected(t); }
106
107			try {
108			final ListIterator it = list.listIterator(list.size());
109			it.previous();
110			final Object x = it.next();
111			THROWS(NoSuchElementException.class,
112			new Fun() {void f() { it.next(); }});
113			try { it.remove(); }
114			catch (UnsupportedOperationException _) { return; }
115			pass();
116			check(! list.get(list.size()-1).equals(x));
117			} catch (Throwable t) { unexpected(t); }
118			}
119			}
120
121			//--------------------- Infrastructure ---------------------------
122			static volatile int passed = 0, failed = 0;
123			static void pass() {passed++;}
124			static void fail() {failed++; Thread.dumpStack();}
125			static void fail(String msg) {System.out.println(msg); fail();}
126			static void unexpected(Throwable t) {failed++; t.printStackTrace();}
127			static void check(boolean cond) {if (cond) pass(); else fail();}
128			static void equal(Object x, Object y) {
129			if (x == null ? y == null : x.equals(y)) pass();
130			else fail(x + " not equal to " + y);}
131			public static void main(String[] args) throws Throwable {
132			try {realMain(args);} catch (Throwable t) {unexpected(t);}
133			System.out.printf("%nPassed = %d, failed = %d%n%n", passed, failed);
134			if (failed > 0) throw new AssertionError("Some tests failed");}
135			private static abstract class Fun {abstract void f() throws Throwable;}
136			static void THROWS(Class<? extends Throwable> k, Fun... fs) {
137			for (Fun f : fs)
138			try { f.f(); fail("Expected " + k.getName() + " not thrown"); }
139			catch (Throwable t) {
140			if (k.isAssignableFrom(t.getClass())) pass();
141			else unexpected(t);}}
142			}