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);
|
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
31 import java.util.*;
32
33 public class Disjoint {
34 final static int N = 20;
35
36 public static void main(String args[]) {
37 // Make an array of lists each of which shares a single element
38 // with its "neighbors," and no elements with other lists in the array
39 Random rnd = new Random();
40 List[] lists = new List[N];
41 int x = 0;
42 for (int i = 0; i < N; i++) {
43 int size = rnd.nextInt(10) + 2;
44 List<Integer> list = new ArrayList<Integer>(size);
45 for (int j = 1; j < size; j++)
46 list.add(x++);
47 list.add(x);
48 Collections.shuffle(list);
|