util/Collections/Disjoint.java

/*
 * Copyright (c) 2003, 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     4339792
 * @summary Basic test for Collections.disjoint
 * @author  Josh Bloch
 * @key randomness
 */

import java.util.ArrayList;
import java.util.Collections;
import java.util.HashSet;
import java.util.List;
import java.util.Random;

public class Disjoint {
    static final int N = 20;

    public static void main(String[] args) {
        // Make an array of lists each of which shares a single element
        // with its "neighbors," and no elements with other lists in the array
        Random rnd = new Random();
        List[] lists = new List[N];
        int x = 0;
        for (int i = 0; i < N; i++) {
            int size = rnd.nextInt(10) + 2;
            List<Integer> list = new ArrayList<>(size);
            for (int j = 1; j < size; j++)
                list.add(x++);
            list.add(x);
            Collections.shuffle(list);

            lists[i] = list;
        }

        for (int i = 0; i < N; i++) {
            for (int j = 0; j < N; j++) {
                boolean disjoint = (Math.abs(i - j) > 1);
                List<Integer> a = (List<Integer>) lists[i];
                List<Integer> b = (List<Integer>) lists[j];

                if (Collections.disjoint(a, b) != disjoint)
                    throw new RuntimeException("A: " + i + ", " + j);
                if (Collections.disjoint(new HashSet<Integer>(a), b)
                    != disjoint)
                    throw new RuntimeException("B: " + i + ", " + j);
                if (Collections.disjoint(new HashSet<Integer>(a),
                                         new HashSet<Integer>(b)) != disjoint)
                    throw new RuntimeException("C: " + i + ", " + j);
            }
        }
    }
}
Revision:	1.8
Committed:	Mon Jan 8 03:12:03 2018 UTC (6 years, 4 months ago) by jsr166
Branch:	MAIN
CVS Tags:	HEAD
Changes since 1.7:	+5 -1 lines
Log Message:	organize imports
#	User	Rev	Content
1	jsr166	1.1	/*
2	jsr166	1.2	* Copyright (c) 2003, 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.2	* 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 4339792
27			* @summary Basic test for Collections.disjoint
28			* @author Josh Bloch
29	jsr166	1.5	* @key randomness
30	jsr166	1.1	*/
31
32	jsr166	1.8	import java.util.ArrayList;
33			import java.util.Collections;
34			import java.util.HashSet;
35			import java.util.List;
36			import java.util.Random;
37	jsr166	1.1
38			public class Disjoint {
39	jsr166	1.3	static final int N = 20;
40	jsr166	1.1
41	jsr166	1.7	public static void main(String[] args) {
42	jsr166	1.1	// Make an array of lists each of which shares a single element
43			// with its "neighbors," and no elements with other lists in the array
44			Random rnd = new Random();
45			List[] lists = new List[N];
46			int x = 0;
47			for (int i = 0; i < N; i++) {
48			int size = rnd.nextInt(10) + 2;
49	jsr166	1.6	List<Integer> list = new ArrayList<>(size);
50	jsr166	1.1	for (int j = 1; j < size; j++)
51			list.add(x++);
52			list.add(x);
53			Collections.shuffle(list);
54
55			lists[i] = list;
56			}
57
58			for (int i = 0; i < N; i++) {
59			for (int j = 0; j < N; j++) {
60			boolean disjoint = (Math.abs(i - j) > 1);
61			List<Integer> a = (List<Integer>) lists[i];
62			List<Integer> b = (List<Integer>) lists[j];
63
64			if (Collections.disjoint(a, b) != disjoint)
65			throw new RuntimeException("A: " + i + ", " + j);
66			if (Collections.disjoint(new HashSet<Integer>(a), b)
67			!= disjoint)
68			throw new RuntimeException("B: " + i + ", " + j);
69			if (Collections.disjoint(new HashSet<Integer>(a),
70			new HashSet<Integer>(b)) != disjoint)
71			throw new RuntimeException("C: " + i + ", " + j);
72			}
73			}
74			}
75			}