Mercurial > jdk8-mips64-public > langtools / annotate
test/tools/javac/generics/inference/5070671/T5070671.java@349160289ba2 (annotated)
test/tools/javac/generics/inference/5070671/T5070671.java
Thu, 06 Jun 2013 15:33:40 +0100
- author
- mcimadamore
- date
- Thu, 06 Jun 2013 15:33:40 +0100
- changeset 1811
- 349160289ba2
- parent 554
- 9d9f26857129
- child 2525
- 2eb010b6cb22
- permissions
- -rw-r--r--
8008627: Compiler mishandles three-way return-type-substitutability
Summary: Compiler should not enforce an order in how ambiguous methods should be resolved
Reviewed-by: jjg, vromero
| duke@1 | 1 | /* |
| ohair@554 | 2 | * Copyright (c) 2005, 2006, 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 5070671 |
| duke@1 | 27 | * @summary Arrays.binarySearch can't infer int[] |
| duke@1 | 28 | * @compile T5070671.java |
| duke@1 | 29 | */ |
| duke@1 | 30 | |
| duke@1 | 31 | import java.util.*; |
| duke@1 | 32 | |
| duke@1 | 33 | public class T5070671 { |
| duke@1 | 34 | void foo1() { |
| duke@1 | 35 | Comparator<int[]> c = new Comparator<int[]>() { |
| duke@1 | 36 | public int compare(int[] c1, int[] c2) { return 0; } |
| duke@1 | 37 | }; |
| duke@1 | 38 | int[][] arr = { { 1 } }; |
| duke@1 | 39 | int[] elem = arr[0]; |
| duke@1 | 40 | Arrays.sort(arr, c); |
| duke@1 | 41 | Arrays.binarySearch(arr, elem, c); |
| duke@1 | 42 | Arrays.<int[]>binarySearch(arr, elem, c); |
| duke@1 | 43 | } |
| duke@1 | 44 | void foo2() { |
| duke@1 | 45 | Comparator<Integer[]> c = new Comparator<Integer[]>() { |
| duke@1 | 46 | public int compare(Integer[] c1, Integer[] c2) { return 0; } |
| duke@1 | 47 | }; |
| duke@1 | 48 | Integer[][] arr = { { 1 } }; |
| duke@1 | 49 | Integer[] elem = arr[0]; |
| duke@1 | 50 | Arrays.sort(arr, c); |
| duke@1 | 51 | Arrays.binarySearch(arr, elem, c); |
| duke@1 | 52 | } |
| duke@1 | 53 | } |
