JUC买票案例

一、原始方法



/**
 * 题目:三个搜票员   卖出   30张票
 * 多线程编程的企业级套路+模板
 * 1    在高内聚低耦合的前提下,线程      操作(对外暴露的调用方法)      资源类
 */
public class SaleTicket {
    public static void main(String[] args) {
        Ticket ticket = new Ticket();
        new Thread(new Runnable() {
            @Override
            public void run() {
                for (int i = 0; i < 40; i++) {
                    ticket.saleTicket();
                }
            }
        },"A").start();

        new Thread(new Runnable() {
            @Override
            public void run() {
                for (int i = 0; i < 40; i++) {
                    ticket.saleTicket();
                }
            }
        },"B").start();

        new Thread(new Runnable() {
            @Override
            public void run() {
                for (int i = 0; i < 40; i++) {
                    ticket.saleTicket();
                }
            }
        },"c").start();

    }
}

//资源类
class Ticket{
    private int number = 30;
    public synchronized void saleTicket(){
        //对外暴露的调用方法
        if (number > 0) {
            System.out.println(Thread.currentThread().getName()+"卖出第:"+number--+"、还剩下:"+number);
        }
    }
}

二、JUC方法


public class SaleTicket {
    public static void main(String[] args) {
        Ticket ticket = new Ticket();
        new Thread(new Runnable() {
            @Override
            public void run() {
                for (int i = 0; i < 40; i++) {
                    ticket.saleTicket();
                }
            }
        },"A").start();

        new Thread(new Runnable() {
            @Override
            public void run() {
                for (int i = 0; i < 40; i++) {
                    ticket.saleTicket();
                }
            }
        },"B").start();

        new Thread(new Runnable() {
            @Override
            public void run() {
                for (int i = 0; i < 40; i++) {
                    ticket.saleTicket();
                }
            }
        },"c").start();

    }
}

//资源类  原始方法
class Ticket{

    private int number = 30;
    private Lock lock = new ReentrantLock();
    public void saleTicket(){
        lock.lock();
        try {
            if (number > 0) {
                System.out.println(Thread.currentThread().getName() + "卖出第:" + number-- + "、还剩下:" + number);
            }
        } finally {
            lock.unlock();
        }
    }
}

三、Lamba表达式改进

public class SaleTicket {
    public static void main(String[] args) {
       Ticket ticket = new Ticket();
        new Thread(()->{for (int i = 0; i < 40; i++)ticket.saleTicket();},"A").start();
        new Thread(()->{for (int i = 0; i < 40; i++)ticket.saleTicket();},"B").start();
        new Thread(()->{for (int i = 0; i < 40; i++)ticket.saleTicket();},"C").start();

    }
}

//资源类  原始方法
class Ticket{

    private int number = 30;
    private Lock lock = new ReentrantLock();
    public void saleTicket(){
        lock.lock();
        try {
            if (number > 0) {
                System.out.println(Thread.currentThread().getName() + "卖出第:" + number-- + "、还剩下:" + number);
            }
        } finally {
            lock.unlock();
        }
    }
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

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

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值