1 /*

     2  * Copyright (c) 2012, 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 8003280

    27  * @summary Add lambda tests

    28  *  check that an array type can be used as a qualifier of an unbound method reference

    29  * @run main MethodReference49

    30  */

    31 public class MethodReference49 {

    32 

    33     interface SAM {

    34        Object m(int[] i);

    35     }

    36 

    37     public static void main(String[] args) {

    38         SAM s = int[]::clone;

    39         int[] iarr = { 1, 2, 3 };

    40         int[] iarr2 = (int[])s.m(iarr);

    41         if (iarr == iarr2) {

    42             throw new AssertionError();

    43         }

    44         for (int i = 0 ; i < iarr.length ; i ++) {

    45             if (iarr[i] != iarr2[i]) {

    46                 throw new AssertionError();

    47             }

    48         }

    49     }

    50 }