责任链模式仿照了netty责任链

public class Leave {

    private String userName;

    private int  leaveDays;

    public String getUserName() {
        return userName;
    }

    public void setUserName(String userName) {
        this.userName = userName;
    }

    public int getLeaveDays() {
        return leaveDays;
    }

    public void setLeaveDays(int leaveDays) {
        this.leaveDays = leaveDays;
    }
}
public abstract class LeaveHandler {

    protected static final int MIN = 1;

    protected static final int MIDDLE = 3;

    protected LeaveHandler nextHandler;

    public abstract void execute(Leave leave);

}
public class HeadLeaveHandler extends LeaveHandler{
    @Override
    public void execute(Leave leave) {
        System.out.println("HeadLeaveHandler 开始流程处理..........");
        nextHandler.execute(leave);
    }
}
public class LeaderLeaveHandler extends LeaveHandler{

    @Override
    public void execute(Leave leave) {
        System.out.println("LeaderLeaveHandler 流程已处理.....");
        if(leave.getLeaveDays() <=  MIN){
            System.out.println("LeaderLeaveHandler 流程已完结.....");
            return;
        }
        nextHandler.execute(leave);
    }
}
public class DeptLeaveHandler extends LeaveHandler{

    @Override
    public void execute(Leave leave) {
        System.out.println("DeptLeaveHandler 流程已处理.....");
        if(leave.getLeaveDays() <= MIDDLE){
            System.out.println("DeptLeaveHandler 流程已完结.....");
            return;
        }
        nextHandler.execute(leave);
    }
}
public class BossLeaveHandler extends LeaveHandler{

    @Override
    public void execute(Leave leave) {
        System.out.println("BossLeaveHandler 流程已处理....");
        System.out.println("BossLeaveHandler 流程已完结....");
        return;
    }
}
public  class InitLeaveHandler{

    private  HandlerNode handlerNode = new HandlerNode();

    InitLeaveHandler addLeft(LeaveHandler handler){
        handlerNode.addLeft(new HandlerNode(handler));
        return this;
    }

    InitLeaveHandler addRight(LeaveHandler handler){
        handlerNode.addRight(new HandlerNode(handler));
        return this;
    }


    public void execute(Leave leave) {
        handlerNode.handler.execute(leave);
    }

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

        HandlerNode next;

        LeaveHandler handler;

        public HandlerNode(){}

        private HandlerNode(LeaveHandler 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;
        }
    }
}
public class HandlerV1Test {
    public static void main(String[] args) {
        Leave leave = new Leave();
        leave.setUserName("张三");
        leave.setLeaveDays(10);
        InitLeaveHandler initLeaveHandler = new InitLeaveHandler()
                .addRight(new HeadLeaveHandler())
                .addRight(new LeaderLeaveHandler())
                .addRight(new DeptLeaveHandler())
                .addRight(new BossLeaveHandler());
        initLeaveHandler.getAll(h -> System.out.println(h.handler));
        initLeaveHandler.execute(leave);

    }
}

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

请大家关注下博客谢谢

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

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值