0N/A/*
2362N/A * Copyright (c) 2002, Oracle and/or its affiliates. All rights reserved.
0N/A * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
0N/A *
0N/A * This code is free software; you can redistribute it and/or modify it
0N/A * under the terms of the GNU General Public License version 2 only, as
0N/A * published by the Free Software Foundation.
0N/A *
0N/A * This code is distributed in the hope that it will be useful, but WITHOUT
0N/A * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
0N/A * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
0N/A * version 2 for more details (a copy is included in the LICENSE file that
0N/A * accompanied this code).
0N/A *
0N/A * You should have received a copy of the GNU General Public License version
0N/A * 2 along with this work; if not, write to the Free Software Foundation,
0N/A * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
0N/A *
2362N/A * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
2362N/A * or visit www.oracle.com if you need additional information or have any
2362N/A * questions.
0N/A */
0N/A
0N/A/*
0N/A * @test
0N/A * @bug 4715206
0N/A * @summary Ensure that addAll method can cope with underestimate by size().
0N/A * @author Josh Bloch
0N/A */
0N/A
0N/Aimport java.util.*;
0N/A
0N/Apublic class AddAll {
0N/A public static void main(String[] args) {
0N/A for (int j = 0; j < 1; j++) {
0N/A Map m = new WeakHashMap(100000);
0N/A for (int i = 0; i < 100000; i++)
0N/A m.put(new Object(), Boolean.TRUE);
0N/A new ArrayList().addAll(m.keySet());
0N/A }
0N/A
0N/A for (int j = 0; j < 1; j++) {
0N/A Map m = new WeakHashMap(100000);
0N/A for (int i = 0; i < 100000; i++)
0N/A m.put(new Object(), Boolean.TRUE);
0N/A new LinkedList().addAll(m.keySet());
0N/A }
0N/A
0N/A for (int j = 0; j < 1; j++) {
0N/A Map m = new WeakHashMap(100000);
0N/A for (int i = 0; i < 100000; i++)
0N/A m.put(new Object(), Boolean.TRUE);
0N/A new Vector().addAll(m.keySet());
0N/A }
0N/A
0N/A for (int j = 0; j < 1; j++) {
0N/A Map m = new WeakHashMap(100000);
0N/A for (int i = 0; i < 100000; i++)
0N/A m.put(new Object(), Boolean.TRUE);
0N/A List list = new ArrayList();
0N/A list.add("inka"); list.add("dinka"); list.add("doo");
0N/A list.addAll(1, m.keySet());
0N/A }
0N/A
0N/A for (int j = 0; j < 1; j++) {
0N/A Map m = new WeakHashMap(100000);
0N/A for (int i = 0; i < 100000; i++)
0N/A m.put(new Object(), Boolean.TRUE);
0N/A List list = new LinkedList();
0N/A list.add("inka"); list.add("dinka"); list.add("doo");
0N/A list.addAll(1, m.keySet());
0N/A }
0N/A
0N/A for (int j = 0; j < 1; j++) {
0N/A Map m = new WeakHashMap(100000);
0N/A for (int i = 0; i < 100000; i++)
0N/A m.put(new Object(), Boolean.TRUE);
0N/A List list = new ArrayList();
0N/A list.add("inka"); list.add("dinka"); list.add("doo");
0N/A list.addAll(1, m.keySet());
0N/A }
0N/A }
0N/A}