1 /* 2 * Copyright (c) 2013, 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 8016081 8016178 27 * @summary structural most specific and stuckness 28 * @compile T8016177d.java 29 */ 30 import java.util.*; 31 32 class T8016177d { 33 34 interface UnaryOperator<X> { m(X x)35 X m(X x); 36 } 37 38 interface IntStream { sorted()39 IntStream sorted(); distinct()40 IntStream distinct(); limit(int i)41 IntStream limit(int i); 42 } 43 44 abstract class WrappingUnaryOperator<S> implements UnaryOperator<S> { } 45 wrap1(UnaryOperator<S1> uo)46 <S1> WrappingUnaryOperator<S1> wrap1(UnaryOperator<S1> uo) { return null; } wrap2(UnaryOperator<S2> uo)47 <S2> WrappingUnaryOperator<S2> wrap2(UnaryOperator<S2> uo) { return null; } wrap3(UnaryOperator<S3> uo)48 <S3> WrappingUnaryOperator<S3> wrap3(UnaryOperator<S3> uo) { return null; } 49 perm(List<P> l)50 <P> List<List<P>> perm(List<P> l) { return null; } 51 52 List<List<WrappingUnaryOperator<IntStream>>> intPermutationOfFunctions = 53 perm(Arrays.asList( 54 wrap1(s -> s.sorted()), 55 wrap2(s -> s.distinct()), 56 wrap3(s -> s.limit(5)) 57 )); 58 } 59