2
|
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 4339792
|
|
27 |
* @summary Basic test for Collections.disjoint
|
|
28 |
* @author Josh Bloch
|
|
29 |
*
|
|
30 |
* @compile -source 1.5 Disjoint.java
|
|
31 |
* @run main Disjoint
|
|
32 |
*/
|
|
33 |
|
|
34 |
import java.util.*;
|
|
35 |
|
|
36 |
public class Disjoint {
|
|
37 |
final static int N = 20;
|
|
38 |
|
|
39 |
public static void main(String args[]) {
|
|
40 |
// Make an array of lists each of which shares a single element
|
|
41 |
// with its "neighbors," and no elements with other lists in the array
|
|
42 |
Random rnd = new Random();
|
|
43 |
List[] lists = new List[N];
|
|
44 |
int x = 0;
|
|
45 |
for (int i = 0; i < N; i++) {
|
|
46 |
int size = rnd.nextInt(10) + 2;
|
|
47 |
List<Integer> list = new ArrayList<Integer>(size);
|
|
48 |
for (int j = 1; j < size; j++)
|
|
49 |
list.add(x++);
|
|
50 |
list.add(x);
|
|
51 |
Collections.shuffle(list);
|
|
52 |
|
|
53 |
lists[i] = list;
|
|
54 |
}
|
|
55 |
|
|
56 |
for (int i = 0; i < N; i++) {
|
|
57 |
for (int j = 0; j < N; j++) {
|
|
58 |
boolean disjoint = (Math.abs(i - j) > 1);
|
|
59 |
List<Integer> a = (List<Integer>) lists[i];
|
|
60 |
List<Integer> b = (List<Integer>) lists[j];
|
|
61 |
|
|
62 |
if (Collections.disjoint(a, b) != disjoint)
|
|
63 |
throw new RuntimeException("A: " + i + ", " + j);
|
|
64 |
if (Collections.disjoint(new HashSet<Integer>(a), b)
|
|
65 |
!= disjoint)
|
|
66 |
throw new RuntimeException("B: " + i + ", " + j);
|
|
67 |
if (Collections.disjoint(new HashSet<Integer>(a),
|
|
68 |
new HashSet<Integer>(b)) != disjoint)
|
|
69 |
throw new RuntimeException("C: " + i + ", " + j);
|
|
70 |
}
|
|
71 |
}
|
|
72 |
}
|
|
73 |
}
|