0N/A/*
553N/A * Copyright (c) 2005, 2006, 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 *
553N/A * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
553N/A * or visit www.oracle.com if you need additional information or have any
553N/A * questions.
0N/A */
0N/A
0N/A/*
0N/A * @test
0N/A * @bug 5070671
0N/A * @summary Arrays.binarySearch can't infer int[]
0N/A * @compile T5070671.java
0N/A */
0N/A
0N/Aimport java.util.*;
0N/A
0N/Apublic class T5070671 {
0N/A void foo1() {
0N/A Comparator<int[]> c = new Comparator<int[]>() {
0N/A public int compare(int[] c1, int[] c2) { return 0; }
0N/A };
0N/A int[][] arr = { { 1 } };
0N/A int[] elem = arr[0];
0N/A Arrays.sort(arr, c);
0N/A Arrays.binarySearch(arr, elem, c);
0N/A Arrays.<int[]>binarySearch(arr, elem, c);
0N/A }
0N/A void foo2() {
0N/A Comparator<Integer[]> c = new Comparator<Integer[]>() {
0N/A public int compare(Integer[] c1, Integer[] c2) { return 0; }
0N/A };
0N/A Integer[][] arr = { { 1 } };
0N/A Integer[] elem = arr[0];
0N/A Arrays.sort(arr, c);
0N/A Arrays.binarySearch(arr, elem, c);
0N/A }
0N/A}