author | martin |
Tue, 15 Sep 2015 21:56:04 -0700 | |
changeset 32649 | 2ee9017c7597 |
parent 30046 | cf2c86e1819e |
permissions | -rw-r--r-- |
2 | 1 |
/* |
5506 | 2 |
* Copyright (c) 2003, Oracle and/or its affiliates. All rights reserved. |
2 | 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 |
* |
|
5506 | 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. |
|
2 | 22 |
*/ |
23 |
||
24 |
/* |
|
25 |
* @test |
|
26 |
* @bug 4822887 |
|
27 |
* @summary Basic test for Collections.addAll |
|
28 |
* @author Josh Bloch |
|
30046 | 29 |
* @key randomness |
2 | 30 |
*/ |
31 |
||
32 |
import java.util.*; |
|
33 |
||
34 |
public class AddAll { |
|
32649
2ee9017c7597
8136583: Core libraries should use blessed modifier order
martin
parents:
30046
diff
changeset
|
35 |
static final int N = 100; |
2 | 36 |
public static void main(String args[]) { |
37 |
test(new ArrayList<Integer>()); |
|
38 |
test(new LinkedList<Integer>()); |
|
39 |
test(new HashSet<Integer>()); |
|
40 |
test(new LinkedHashSet<Integer>()); |
|
41 |
} |
|
42 |
||
43 |
private static Random rnd = new Random(); |
|
44 |
||
45 |
static void test(Collection<Integer> c) { |
|
46 |
int x = 0; |
|
47 |
for (int i = 0; i < N; i++) { |
|
48 |
int rangeLen = rnd.nextInt(10); |
|
49 |
if (Collections.addAll(c, range(x, x + rangeLen)) != |
|
50 |
(rangeLen != 0)) |
|
51 |
throw new RuntimeException("" + rangeLen); |
|
52 |
x += rangeLen; |
|
53 |
} |
|
54 |
if (c instanceof List) { |
|
55 |
if (!c.equals(Arrays.asList(range(0, x)))) |
|
56 |
throw new RuntimeException(x +": "+c); |
|
57 |
} else { |
|
58 |
if (!c.equals(new HashSet<Integer>(Arrays.asList(range(0, x))))) |
|
59 |
throw new RuntimeException(x +": "+c); |
|
60 |
} |
|
61 |
} |
|
62 |
||
63 |
private static Integer[] range(int from, int to) { |
|
64 |
Integer[] result = new Integer[to - from]; |
|
65 |
for (int i = from, j=0; i < to; i++, j++) |
|
66 |
result[j] = new Integer(i); |
|
67 |
return result; |
|
68 |
} |
|
69 |
} |