| 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); |
| 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 |
} |
