并发库锁条件替代互斥锁


package com.test;

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

public class ThreadTest9
{

/**
* @param args
*/
public static void main(String[] args)
{
final Utils9 ts = new Utils9();
new Thread(){
@Override
public void run()
{
for (int i = 0; i < 30; i++)
{
ts.sub(i);
}
}
}.start();

new Thread(){
@Override
public void run()
{
for (int i = 0; i < 30; i++)
{
ts.sub2(i);
}
}
}.start();

for (int i = 0; i < 30; i++)
{
ts.main(i);
}
}



}

class Utils9{

private int who = 1;

Lock lock = new ReentrantLock();
Condition condition1 = lock.newCondition();
Condition condition2 = lock.newCondition();
Condition condition3 = lock.newCondition();

public void main(int j){
lock.lock();
try{
if(who != 1){
try
{
condition1.await();
}
catch (InterruptedException e)
{
e.printStackTrace();
}
}
for (int i = 1; i <= 5; i++)
{
System.out.println("this's main "+j+" runnig is "+i);
}
this.who = 2;
condition2.signal();
}finally{
lock.unlock();
}
}

public void sub(int j){
lock.lock();
try{
if(who != 2){
try
{
condition2.await();
}
catch (InterruptedException e)
{
e.printStackTrace();
}
}
for (int i = 1; i <= 10; i++)
{
System.out.println("this's sub "+j+" runnig is "+i);
}
this.who = 3;
condition3.signal();
}finally{
lock.unlock();
}
}

public void sub2(int j){
lock.lock();
try{
if(who != 3){
try
{
condition3.await();
}
catch (InterruptedException e)
{
e.printStackTrace();
}
}
for (int i = 1; i <= 6; i++)
{
System.out.println("this's sub2 "+j+" runnig is "+i);
}
this.who = 1;
condition1.signal();
}finally{
lock.unlock();
}
}
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

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

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值