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 4822887
27 * @summary Basic test for Collections.addAll
28 * @author Josh Bloch
29 * @key randomness
30 */
31
32 import java.util.ArrayList;
33 import java.util.Arrays;
34 import java.util.Collection;
35 import java.util.Collections;
36 import java.util.HashSet;
37 import java.util.LinkedHashSet;
38 import java.util.LinkedList;
39 import java.util.List;
40 import java.util.Random;
41
42 public class AddAll {
43 static final int N = 100;
44 public static void main(String[] args) {
45 test(new ArrayList<Integer>());
46 test(new LinkedList<Integer>());
47 test(new HashSet<Integer>());
48 test(new LinkedHashSet<Integer>());
49 }
50
51 private static Random rnd = new Random();
52
53 static void test(Collection<Integer> c) {
54 int x = 0;
55 for (int i = 0; i < N; i++) {
56 int rangeLen = rnd.nextInt(10);
57 if (Collections.addAll(c, range(x, x + rangeLen)) !=
58 (rangeLen != 0))
59 throw new RuntimeException("" + rangeLen);
60 x += rangeLen;
61 }
62 if (c instanceof List) {
63 if (!c.equals(Arrays.asList(range(0, x))))
64 throw new RuntimeException(x +": "+c);
65 } else {
66 if (!c.equals(new HashSet<Integer>(Arrays.asList(range(0, x)))))
67 throw new RuntimeException(x +": "+c);
68 }
69 }
70
71 private static Integer[] range(int from, int to) {
72 Integer[] result = new Integer[to - from];
73 for (int i = from, j=0; i < to; i++, j++)
74 result[j] = new Integer(i);
75 return result;
76 }
77 }
|
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 4822887
27 * @summary Basic test for Collections.addAll
28 * @author Josh Bloch
29 * @key randomness
30 * @library /test/lib
31 */
32
33 import jdk.test.lib.valueclass.VClass;
34 import java.io.IOException;
35 import java.util.ArrayList;
36 import java.util.Arrays;
37 import java.util.Collection;
38 import java.util.Collections;
39 import java.util.HashSet;
40 import java.util.LinkedHashSet;
41 import java.util.LinkedList;
42 import java.util.List;
43 import java.util.Random;
44
45 public class AddAll {
46 static final int N = 100;
47 public static void main(String[] args) {
48 test(new ArrayList<Integer>());
49 test(new LinkedList<Integer>());
50 test(new HashSet<Integer>());
51 test(new LinkedHashSet<Integer>());
52
53 testTuple(new ArrayList<VClass>());
54 testTuple(new LinkedList<VClass>());
55 testTuple(new HashSet<VClass>());
56 testTuple(new LinkedHashSet<VClass>());
57 }
58
59 private static Random rnd = new Random();
60
61 static void test(Collection<Integer> c) {
62 int x = 0;
63 for (int i = 0; i < N; i++) {
64 int rangeLen = rnd.nextInt(10);
65 if (Collections.addAll(c, range(x, x + rangeLen)) !=
66 (rangeLen != 0))
67 throw new RuntimeException("" + rangeLen);
68 x += rangeLen;
69 }
70 if (c instanceof List) {
71 if (!c.equals(Arrays.asList(range(0, x))))
72 throw new RuntimeException(x +": "+c);
73 } else {
74 if (!c.equals(new HashSet<Integer>(Arrays.asList(range(0, x)))))
75 throw new RuntimeException(x +": "+c);
76 }
77 }
78
79 private static Integer[] range(int from, int to) {
80 Integer[] result = new Integer[to - from];
81 for (int i = from, j=0; i < to; i++, j++)
82 result[j] = new Integer(i);
83 return result;
84 }
85
86 static void testTuple(Collection<VClass> c) {
87 int x = 0;
88 for (int i = 0; i < N; i++) {
89 int rangeLen = rnd.nextInt(10);
90 if (Collections.addAll(c, rangeTuple(x, x + rangeLen)) !=
91 (rangeLen != 0))
92 throw new RuntimeException("" + rangeLen);
93 x += rangeLen;
94 }
95 if (c instanceof List) {
96 if (!c.equals(Arrays.asList(rangeTuple(0, x))))
97 throw new RuntimeException(x + ": " + c);
98 } else {
99 if (!c.equals(new HashSet<VClass>(Arrays.asList(rangeTuple(0, x)))))
100 throw new RuntimeException(x + ": " + c);
101 }
102 }
103
104 private static VClass[] rangeTuple(int from, int to) {
105 VClass[] result = new VClass[to - from];
106 for (int i = from, j = 0; i < to; i++, j++)
107 result[j] = new VClass(i, new int[] { i });
108 return result;
109 }
110 }
|