装饰器模式融合责任链模式的组合模式

本文通过Java代码实现了一个基于责任链模式的费用计算系统,展示了如何通过链式调用处理不同类型的费用计算,包括普通费用计算和VIP费用计算。代码中定义了Param和Result类用于传递参数和结果,通过抽象类FeeCalcHandler和具体实现类NewFeeCalcHandler及VIPFeeCalcHandler演示了责任链模式的应用。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

public class Param {
    double number;

    public double getNumber() {
        return number;
    }

    public void setNumber(double number) {
        this.number = number;
    }
}
public class Result {

    private double result;

    public double getResult() {
        return result;
    }

    public void setResult(double result) {
        this.result = result;
    }
}
public abstract class FeeCalcHandler {

    protected FeeCalcHandler nextHandler;

    abstract Result calc(Param param);
}
public class NewFeeCalcHandler extends FeeCalcHandler{

    @Override
    Result calc(Param param) {
        Result result = new Result();
        if(nextHandler != null){
            result= nextHandler.calc(param);
        }
        result.setResult(param.getNumber() + 1);
        return result;
    }
}
public class VIPFeeCalcHandler extends FeeCalcHandler{
    @Override
    Result calc(Param param) {
        Result result = new Result();
        if(nextHandler != null){
            result = nextHandler.calc(param);
        }
        result.setResult(param.getNumber() * 10);
        return result;
    }
}
public class InitFeeCalcHandler {
    private  HandlerNode handlerNode = new HandlerNode();

    InitFeeCalcHandler addLeft(FeeCalcHandler handler){
        handlerNode.addLeft(new HandlerNode(handler));
        return this;
    }

    InitFeeCalcHandler addRight(FeeCalcHandler handler){
        handlerNode.addRight(new HandlerNode(handler));
        return this;
    }


    public Result calc(Param param) {
        return handlerNode.handler.calc(param);
    }

    public void getAll(Consumer<HandlerNode> consumer){
        HandlerNode temp = handlerNode;
        while (temp != null){
            consumer.accept(temp);
            temp = temp.next;
        }
    }
    class HandlerNode{

        HandlerNode next;

        FeeCalcHandler handler;

        public HandlerNode(){}

        private HandlerNode(FeeCalcHandler leaveHandler){
            this.handler = leaveHandler;
        }

        public void addRight(HandlerNode node){
            if(handlerNode.handler == null){
                handlerNode = node;
                return;
            }
            HandlerNode tailNode = getTail(handlerNode);
            tailNode.handler.nextHandler= node.handler;
            tailNode.next = node;
        }

        public HandlerNode getTail(HandlerNode node){
            if(node.next == null || node.next.handler == null){
                return node;
            }
            return getTail(node.next);
        }

        public void addLeft(HandlerNode node){
            if(handlerNode.handler == null){
                handlerNode = node;
                return;
            }
            HandlerNode temp = handlerNode;
            handlerNode = node;
            handlerNode.next = temp;
            handlerNode.handler.nextHandler = temp.handler;
        }
    }
}
public class HandlerV2Test {
    public static void main(String[] args) {
        Param param = new Param();
        param.setNumber(100);
        InitFeeCalcHandler initFeeCalcHandler = new InitFeeCalcHandler();
        initFeeCalcHandler
                .addRight(new NewFeeCalcHandler())
                .addRight(new VIPFeeCalcHandler());
        Result result = initFeeCalcHandler.calc(param);
        System.out.println(result.getResult());
    }
}

欢迎小伙伴一起探讨设计模式 

请大家关注下博客谢谢

源码已经提交到码云  https://gitee.com/tianji_luhaichuan/pay/tree/master/java-base 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值