| 1 |
jsr166 |
1.1 |
/* |
| 2 |
jsr166 |
1.2 |
* Copyright (c) 2003, Oracle and/or its affiliates. All rights reserved. |
| 3 |
jsr166 |
1.1 |
* 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 |
jsr166 |
1.2 |
* 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 |
jsr166 |
1.1 |
*/ |
| 23 |
|
|
|
| 24 |
|
|
/* |
| 25 |
|
|
* @test |
| 26 |
|
|
* @bug 4822887 |
| 27 |
|
|
* @summary Basic test for Collections.addAll |
| 28 |
|
|
* @author Josh Bloch |
| 29 |
|
|
* |
| 30 |
|
|
* @compile -source 1.5 AddAll.java |
| 31 |
|
|
* @run main AddAll |
| 32 |
|
|
*/ |
| 33 |
|
|
|
| 34 |
|
|
import java.util.*; |
| 35 |
|
|
|
| 36 |
|
|
public class AddAll { |
| 37 |
jsr166 |
1.3 |
static final int N = 100; |
| 38 |
jsr166 |
1.1 |
public static void main(String args[]) { |
| 39 |
|
|
test(new ArrayList<Integer>()); |
| 40 |
|
|
test(new LinkedList<Integer>()); |
| 41 |
|
|
test(new HashSet<Integer>()); |
| 42 |
|
|
test(new LinkedHashSet<Integer>()); |
| 43 |
|
|
} |
| 44 |
|
|
|
| 45 |
|
|
private static Random rnd = new Random(); |
| 46 |
|
|
|
| 47 |
|
|
static void test(Collection<Integer> c) { |
| 48 |
|
|
int x = 0; |
| 49 |
|
|
for (int i = 0; i < N; i++) { |
| 50 |
|
|
int rangeLen = rnd.nextInt(10); |
| 51 |
|
|
if (Collections.addAll(c, range(x, x + rangeLen)) != |
| 52 |
|
|
(rangeLen != 0)) |
| 53 |
|
|
throw new RuntimeException("" + rangeLen); |
| 54 |
|
|
x += rangeLen; |
| 55 |
|
|
} |
| 56 |
|
|
if (c instanceof List) { |
| 57 |
|
|
if (!c.equals(Arrays.asList(range(0, x)))) |
| 58 |
|
|
throw new RuntimeException(x +": "+c); |
| 59 |
|
|
} else { |
| 60 |
|
|
if (!c.equals(new HashSet<Integer>(Arrays.asList(range(0, x))))) |
| 61 |
|
|
throw new RuntimeException(x +": "+c); |
| 62 |
|
|
} |
| 63 |
|
|
} |
| 64 |
|
|
|
| 65 |
|
|
private static Integer[] range(int from, int to) { |
| 66 |
|
|
Integer[] result = new Integer[to - from]; |
| 67 |
|
|
for (int i = from, j=0; i < to; i++, j++) |
| 68 |
|
|
result[j] = new Integer(i); |
| 69 |
|
|
return result; |
| 70 |
|
|
} |
| 71 |
|
|
} |
