SynchronizedAndReentranLockDemo

package test1;

import java.util.concurrent.locks.Condition;
import java.util.concurrent.locks.Lock;
import java.util.concurrent.locks.ReentrantLock;

class Resource{
int number = 1;//A 1 B 2 C 3
private Lock lock = new ReentrantLock();
private Condition condition1 = lock.newCondition();
private Condition condition2 = lock.newCondition();
private Condition condition3 = lock.newCondition();
public void print5(){
lock.lock();
try {
//1.判断
while (number != 1){
//不该我干,我不干
condition1.await();
}
//干活
for (int i = 1; i <=5; i++) {
System.out.println(Thread.currentThread().getName() + “\t” + i);
}
number = 2;
condition2.signalAll();
//通知

    }catch (Exception e){
        e.printStackTrace();
    }finally {
        lock.unlock();
    }
}

public void print10(){
    lock.lock();
    try {
        //1.判断
        while (number != 2){
            //不该我干,我不干
            condition2.await();
        }
        //干活
        for (int i = 1; i <=10; i++) {
            System.out.println(Thread.currentThread().getName() + "\t" + i);
        }
        number = 3;
        condition3.signalAll();
        //通知

    }catch (Exception e){
        e.printStackTrace();
    }finally {
        lock.unlock();
    }
}

public void print15(){
    lock.lock();
    try {
        //1.判断
        while (number != 3){
            //不该我干,我不干
            condition3.await();
        }
        //干活
        for (int i = 1; i <=15; i++) {
            System.out.println(Thread.currentThread().getName() + "\t" + i);
        }
        number = 1;
        condition1.signalAll();
        //通知

    }catch (Exception e){
        e.printStackTrace();
    }finally {
        lock.unlock();
    }
}

}

public class SynchronizedAndReentranLockDemo {
public static void main(String[] args) {
Resource resource = new Resource();

    new Thread(()->{
        for (int i = 1; i <=10 ; i++) {
            resource.print5();
        }
    },"A").start();

    new Thread(()->{
        for (int i = 1; i <=10 ; i++) {
            resource.print10();
        }
    },"B").start();

    new Thread(()->{
        for (int i = 1; i <=10 ; i++) {
            resource.print15();
        }
    },"C").start();
}

}

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

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

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值