1 /*
2 * Copyright (c) 2003, Oracle and/or its affiliates. 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 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 */
23
24 /*
25 * @test
26 * @bug 4339792
27 * @summary Basic test for Collections.disjoint
28 * @author Josh Bloch
29 * @key randomness
30 */
31
32 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
38 public class Disjoint {
39 static final int N = 20;
40
41 public static void main(String[] args) {
42 // 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 List<Integer> list = new ArrayList<>(size);
50 for (int j = 1; j < size; j++)
51 list.add(x++);
52 list.add(x);
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 }
|
1 /*
2 * Copyright (c) 2003, 2026, Oracle and/or its affiliates. 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 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 */
23
24 /*
25 * @test
26 * @bug 4339792
27 * @summary Basic test for Collections.disjoint
28 * @author Josh Bloch
29 * @key randomness
30 * @library /test/lib
31 */
32
33 import jdk.test.lib.valueclass.VClass;
34 import java.util.ArrayList;
35 import java.util.Arrays;
36 import java.util.Collections;
37 import java.util.HashSet;
38 import java.util.List;
39 import java.util.Random;
40
41 public class Disjoint {
42 static final int N = 20;
43
44 public static void main(String[] args) {
45 // Make an array of lists each of which shares a single element
46 // with its "neighbors," and no elements with other lists in the array
47 Random rnd = new Random();
48 List[] lists = new List[N];
49 int x = 0;
50 for (int i = 0; i < N; i++) {
51 int size = rnd.nextInt(10) + 2;
52 List<Integer> list = new ArrayList<>(size);
53 for (int j = 1; j < size; j++)
54 list.add(x++);
55 list.add(x);
57
58 lists[i] = list;
59 }
60
61 for (int i = 0; i < N; i++) {
62 for (int j = 0; j < N; j++) {
63 boolean disjoint = (Math.abs(i - j) > 1);
64 List<Integer> a = (List<Integer>) lists[i];
65 List<Integer> b = (List<Integer>) lists[j];
66
67 if (Collections.disjoint(a, b) != disjoint)
68 throw new RuntimeException("A: " + i + ", " + j);
69 if (Collections.disjoint(new HashSet<Integer>(a), b)
70 != disjoint)
71 throw new RuntimeException("B: " + i + ", " + j);
72 if (Collections.disjoint(new HashSet<Integer>(a),
73 new HashSet<Integer>(b)) != disjoint)
74 throw new RuntimeException("C: " + i + ", " + j);
75 }
76 }
77
78 List<VClass> va = Arrays.asList(new VClass(1, new int[] { 1 }), new VClass(2, new int[] { 2 }));
79 List<VClass> vb = Arrays.asList(new VClass(3, new int[] { 3 }), new VClass(4, new int[] { 4 }));
80 List<VClass> vc = Arrays.asList(new VClass(2, new int[] { 2 }), new VClass(5, new int[] { 5 }));
81 if (!Collections.disjoint(va, vb)) throw new RuntimeException("value disjoint failed");
82 if (Collections.disjoint(va, vc)) throw new RuntimeException("value non-disjoint failed");
83 }
84 }
|