util/LinkedHashSet/Basic.java

/*
 * Copyright (c) 2000, Oracle and/or its affiliates. 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 Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
 * or visit www.oracle.com if you need additional information or have any
 * questions.
 */

/**
 * @test
 * @bug 4245809
 * @summary Basic test for LinkedHashSet.  (Based on SetBash)
 */

import java.util.*;
import java.io.*;

public class Basic {
    static Random rnd = new Random(666);

    public static void main(String[] args) throws Exception {
        int numItr =  500;
        int setSize = 500;

        for (int i=0; i<numItr; i++) {
            Set s1 = new LinkedHashSet();
            AddRandoms(s1, setSize);

            Set s2 = new LinkedHashSet();
            AddRandoms(s2, setSize);

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

            if (diff1.removeAll(diff2))
                throw new Exception("Set algebra identity 2 failed");
            if (diff1.removeAll(intersection))
                throw new Exception("Set algebra identity 3 failed");
            if (diff2.removeAll(diff1))
                throw new Exception("Set algebra identity 4 failed");
            if (diff2.removeAll(intersection))
                throw new Exception("Set algebra identity 5 failed");
            if (intersection.removeAll(diff1))
                throw new Exception("Set algebra identity 6 failed");
            if (intersection.removeAll(diff1))
                throw new Exception("Set algebra identity 7 failed");

            intersection.addAll(diff1); intersection.addAll(diff2);
            if (!intersection.equals(union))
                throw new Exception("Set algebra identity 1 failed");

            if (new LinkedHashSet(union).hashCode() != union.hashCode())
                throw new Exception("Incorrect hashCode computation.");

            Iterator e = union.iterator();
            while (e.hasNext())
                if (!intersection.remove(e.next()))
                    throw new Exception("Couldn't remove element from copy.");
            if (!intersection.isEmpty())
                throw new Exception("Copy nonempty after deleting all elements.");

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

            s1.clear();
            if (!s1.isEmpty())
                throw new Exception("Set nonempty after clear.");
        }
        System.err.println("Success.");
    }

    static Set clone(Set s) throws Exception {
        Set clone;
        int method = rnd.nextInt(3);
        clone = (method==0 ?  (Set) ((LinkedHashSet)s).clone() :
                 (method==1 ? new LinkedHashSet(Arrays.asList(s.toArray())) :
                  serClone(s)));
        if (!s.equals(clone))
            throw new Exception("Set not equal to copy: "+method);
        if (!s.containsAll(clone))
            throw new Exception("Set does not contain copy.");
        if (!clone.containsAll(s))
            throw new Exception("Copy does not contain set.");
        return clone;
    }

    private static Set serClone(Set m) {
        Set result = null;
        try {
            // Serialize
            ByteArrayOutputStream bos = new ByteArrayOutputStream();
            ObjectOutputStream out = new ObjectOutputStream(bos);
            out.writeObject(m);
            out.flush();

            // Deserialize
            ByteArrayInputStream bis = new ByteArrayInputStream(bos.toByteArray());
            out.close();
            ObjectInputStream in = new ObjectInputStream(bis);
            result = (Set)in.readObject();
            in.close();
        } catch (Exception e) {
            e.printStackTrace();
        }
        return result;
    }

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

            int preSize = s.size();
            boolean prePresent = s.contains(e);
            boolean added = s.add(e);
            if (!s.contains(e))
                throw new Exception("Element not present after addition.");
            if (added == prePresent)
                throw new Exception("added == alreadyPresent");
            int postSize = s.size();
            if (added && preSize == postSize)
                throw new Exception("Add returned true, but size didn't change.");
            if (!added && preSize != postSize)
                throw new Exception("Add returned false, but size changed.");
        }
    }
}
Revision:	1.3
Committed:	Sun Sep 5 21:32:19 2010 UTC (13 years, 8 months ago) by jsr166
Branch:	MAIN
CVS Tags:	release-1_7_0
Changes since 1.2:	+4 -4 lines
Log Message:	Update legal notices to Oracle wording
#	User	Rev	Content
1	jsr166	1.1	/*
2	jsr166	1.3	* Copyright (c) 2000, Oracle and/or its affiliates. All rights reserved.
3	jsr166	1.1	* 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	jsr166	1.3	* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20			* or visit www.oracle.com if you need additional information or have any
21			* questions.
22	jsr166	1.1	*/
23
24			/**
25			* @test
26			* @bug 4245809
27			* @summary Basic test for LinkedHashSet. (Based on SetBash)
28			*/
29
30			import java.util.*;
31			import java.io.*;
32
33			public class Basic {
34			static Random rnd = new Random(666);
35
36			public static void main(String[] args) throws Exception {
37			int numItr = 500;
38			int setSize = 500;
39
40			for (int i=0; i<numItr; i++) {
41			Set s1 = new LinkedHashSet();
42			AddRandoms(s1, setSize);
43
44			Set s2 = new LinkedHashSet();
45			AddRandoms(s2, setSize);
46
47			Set intersection = clone(s1);
48			intersection.retainAll(s2);
49			Set diff1 = clone(s1); diff1.removeAll(s2);
50			Set diff2 = clone(s2); diff2.removeAll(s1);
51			Set union = clone(s1); union.addAll(s2);
52
53			if (diff1.removeAll(diff2))
54			throw new Exception("Set algebra identity 2 failed");
55			if (diff1.removeAll(intersection))
56			throw new Exception("Set algebra identity 3 failed");
57			if (diff2.removeAll(diff1))
58			throw new Exception("Set algebra identity 4 failed");
59			if (diff2.removeAll(intersection))
60			throw new Exception("Set algebra identity 5 failed");
61			if (intersection.removeAll(diff1))
62			throw new Exception("Set algebra identity 6 failed");
63			if (intersection.removeAll(diff1))
64			throw new Exception("Set algebra identity 7 failed");
65
66			intersection.addAll(diff1); intersection.addAll(diff2);
67			if (!intersection.equals(union))
68			throw new Exception("Set algebra identity 1 failed");
69
70			if (new LinkedHashSet(union).hashCode() != union.hashCode())
71			throw new Exception("Incorrect hashCode computation.");
72
73			Iterator e = union.iterator();
74			while (e.hasNext())
75			if (!intersection.remove(e.next()))
76			throw new Exception("Couldn't remove element from copy.");
77			if (!intersection.isEmpty())
78			throw new Exception("Copy nonempty after deleting all elements.");
79
80			e = union.iterator();
81			while (e.hasNext()) {
82			Object o = e.next();
83			if (!union.contains(o))
84			throw new Exception("Set doesn't contain one of its elements.");
85			e.remove();
86			if (union.contains(o))
87			throw new Exception("Set contains element after deletion.");
88			}
89			if (!union.isEmpty())
90			throw new Exception("Set nonempty after deleting all elements.");
91
92			s1.clear();
93			if (!s1.isEmpty())
94			throw new Exception("Set nonempty after clear.");
95			}
96			System.err.println("Success.");
97			}
98
99			static Set clone(Set s) throws Exception {
100			Set clone;
101			int method = rnd.nextInt(3);
102			clone = (method==0 ? (Set) ((LinkedHashSet)s).clone() :
103			(method==1 ? new LinkedHashSet(Arrays.asList(s.toArray())) :
104			serClone(s)));
105			if (!s.equals(clone))
106			throw new Exception("Set not equal to copy: "+method);
107			if (!s.containsAll(clone))
108			throw new Exception("Set does not contain copy.");
109			if (!clone.containsAll(s))
110			throw new Exception("Copy does not contain set.");
111			return clone;
112			}
113
114			private static Set serClone(Set m) {
115			Set result = null;
116			try {
117			// Serialize
118			ByteArrayOutputStream bos = new ByteArrayOutputStream();
119			ObjectOutputStream out = new ObjectOutputStream(bos);
120			out.writeObject(m);
121			out.flush();
122
123			// Deserialize
124			ByteArrayInputStream bis = new ByteArrayInputStream(bos.toByteArray());
125			out.close();
126			ObjectInputStream in = new ObjectInputStream(bis);
127			result = (Set)in.readObject();
128			in.close();
129	jsr166	1.2	} catch (Exception e) {
130	jsr166	1.1	e.printStackTrace();
131			}
132			return result;
133			}
134
135			static void AddRandoms(Set s, int n) throws Exception {
136			for (int i=0; i<n; i++) {
137			int r = rnd.nextInt() % n;
138			Integer e = new Integer(r < 0 ? -r : r);
139
140			int preSize = s.size();
141			boolean prePresent = s.contains(e);
142			boolean added = s.add(e);
143			if (!s.contains(e))
144			throw new Exception("Element not present after addition.");
145			if (added == prePresent)
146			throw new Exception("added == alreadyPresent");
147			int postSize = s.size();
148			if (added && preSize == postSize)
149			throw new Exception("Add returned true, but size didn't change.");
150			if (!added && preSize != postSize)
151			throw new Exception("Add returned false, but size changed.");
152			}
153			}
154			}