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