Mon, 26 Oct 2015 13:23:30 -0700
Added tag jdk8u76-b00 for changeset 10ffafaf5340
duke@1 | 1 | /* |
ohair@554 | 2 | * Copyright (c) 2006, 2007, Oracle and/or its affiliates. All rights reserved. |
duke@1 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
duke@1 | 4 | * |
duke@1 | 5 | * This code is free software; you can redistribute it and/or modify it |
duke@1 | 6 | * under the terms of the GNU General Public License version 2 only, as |
duke@1 | 7 | * published by the Free Software Foundation. |
duke@1 | 8 | * |
duke@1 | 9 | * This code is distributed in the hope that it will be useful, but WITHOUT |
duke@1 | 10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
duke@1 | 11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
duke@1 | 12 | * version 2 for more details (a copy is included in the LICENSE file that |
duke@1 | 13 | * accompanied this code). |
duke@1 | 14 | * |
duke@1 | 15 | * You should have received a copy of the GNU General Public License version |
duke@1 | 16 | * 2 along with this work; if not, write to the Free Software Foundation, |
duke@1 | 17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
duke@1 | 18 | * |
ohair@554 | 19 | * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
ohair@554 | 20 | * or visit www.oracle.com if you need additional information or have any |
ohair@554 | 21 | * questions. |
duke@1 | 22 | */ |
duke@1 | 23 | |
duke@1 | 24 | /* |
duke@1 | 25 | * @test |
duke@1 | 26 | * @bug 6468384 6278587 |
duke@1 | 27 | * @summary Problem with underconstrained type variables |
duke@1 | 28 | * @compile T6468384.java |
duke@1 | 29 | */ |
duke@1 | 30 | |
duke@1 | 31 | import java.util.*; |
duke@1 | 32 | |
duke@1 | 33 | public class T6468384 { |
duke@1 | 34 | |
duke@1 | 35 | public class A {}; |
duke@1 | 36 | |
duke@1 | 37 | public class B extends A {}; |
duke@1 | 38 | |
duke@1 | 39 | public <T, V extends T> Set<T> newSet(V... objects) { |
duke@1 | 40 | Set<T> set = new LinkedHashSet<T>(); |
duke@1 | 41 | for (T t : objects) { |
duke@1 | 42 | set.add(t); |
duke@1 | 43 | } |
duke@1 | 44 | return set; |
duke@1 | 45 | } |
duke@1 | 46 | |
duke@1 | 47 | public static void main(String... args) { |
duke@1 | 48 | T6468384 g = new T6468384(); |
duke@1 | 49 | |
duke@1 | 50 | // B << V => V :> B |
duke@1 | 51 | // so B is inferred for V |
duke@1 | 52 | |
duke@1 | 53 | // Then consider the return type: |
duke@1 | 54 | // Set<A> >> Set<T> => A = T |
duke@1 | 55 | // So A is inferred for T |
duke@1 | 56 | Set<A> set1 = g.newSet(g.new B()); |
duke@1 | 57 | |
duke@1 | 58 | Set<A> set2 = g.<A,B>newSet(g.new B()); |
duke@1 | 59 | } |
duke@1 | 60 | |
duke@1 | 61 | } |