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 package test.java.util.Collections;
33 
34 import java.util.ArrayList;
35 import java.util.Arrays;
36 import java.util.Collection;
37 import java.util.Collections;
38 import java.util.HashSet;
39 import java.util.LinkedHashSet;
40 import java.util.LinkedList;
41 import java.util.List;
42 import java.util.Random;
43 
44 public class AddAll {
45     static final int N = 100;
main(String[] args)46     public static void main(String[] args) {
47         test(new ArrayList<Integer>());
48         test(new LinkedList<Integer>());
49         test(new HashSet<Integer>());
50         test(new LinkedHashSet<Integer>());
51     }
52 
53     private static Random rnd = new Random();
54 
test(Collection<Integer> c)55     static void test(Collection<Integer> c) {
56         int x = 0;
57         for (int i = 0; i < N; i++) {
58             int rangeLen = rnd.nextInt(10);
59             if (Collections.addAll(c, range(x, x + rangeLen)) !=
60                 (rangeLen != 0))
61                 throw new RuntimeException("" + rangeLen);
62             x += rangeLen;
63         }
64         if (c instanceof List) {
65             if (!c.equals(Arrays.asList(range(0, x))))
66                 throw new RuntimeException(x +": "+c);
67         } else {
68             if (!c.equals(new HashSet<Integer>(Arrays.asList(range(0, x)))))
69                 throw new RuntimeException(x +": "+c);
70         }
71     }
72 
range(int from, int to)73     private static Integer[] range(int from, int to) {
74         Integer[] result = new Integer[to - from];
75         for (int i = from, j=0; i < to; i++, j++)
76             result[j] = new Integer(i);
77         return result;
78     }
79 }
80