使用jdk8 Function 函数式接口实现方法的链式编程

最新推荐文章于 2024-04-02 15:23:36 发布

Quella9002

最新推荐文章于 2024-04-02 15:23:36 发布

阅读量969

点赞数

分类专栏： # java8新特性文章标签： java

本文链接：https://blog.csdn.net/Quella9002/article/details/104073849

版权

java8新特性专栏收录该内容

6 篇文章 0 订阅

订阅专栏

Function函数提供了 compost 和 andThen 两个方法，来实现方法的链式编程

     // 将参数Function的计算结构作为入参
     default <V> Function<V, R> compose(Function<? super V, ? extends T> before) {
        Objects.requireNonNull(before);
        return (V v) -> apply(before.apply(v));
    }
    //跟compose刚好相反
    default <V> Function<T, V> andThen(Function<? super R, ? extends V> after) {
    Objects.requireNonNull(after);
    return (T t) -> after.apply(apply(t));
    }

public class FunctionTest {

    private static List<Function<Integer,Integer>> list = new ArrayList<>();
    private static Function<Integer,Integer> a = value -> value + 10 ;
    private static Function<Integer,Integer> b = value -> value + 20 ;
    private static Function<Integer,Integer> c = value -> value + 30 ;
    private static Function<Integer,Integer> d = value -> value * 2 ;


    static {
        list = Arrays.asList(a,b,c,d);
    }
    
    public static void main(String[] args) {
        FunctionTest functionTest = new FunctionTest();
        System.out.println(functionTest.computeByDESC(2, list));// 64
        System.out.println(functionTest.computeByASC(2, list)); // 124


    }

    /**
     *  倒叙执行
     */
    public int computeByDESC(int a, List<Function<Integer,Integer>> list){
        Function<Integer,Integer> result = list.get(0);
        for (int i = 0; i < list.size(); i++) {
            if(i+1<list.size()){
                result =  result.compose(list.get(i+1));
            }
        }
        return result.apply(a);
    }

    /**
     *  正序执行
     */
    public int computeByASC(int a, List<Function<Integer,Integer>> list){
        Function<Integer,Integer> result = list.get(0);
        for (int i = 0; i < list.size(); i++) {
            if(i+1<list.size()){
                result =  result.andThen(list.get(i+1));
            }
        }
        return result.apply(a);
    }
}