Condition条件阻塞的应用

Condition的功能类似传统技术中Obect.wait和Obect.notify的功能

/**
 * 应用场景:三个线程,第一个线程循环10次之后,接着回到第二个线程也循环10次,
 * 紧接着第三个线程也循环10次,最后又回到第一个线程。如此循环50次!
 * */
import java.util.concurrent.locks.Condition;
import java.util.concurrent.locks.Lock;
import java.util.concurrent.locks.ReentrantLock;
public class ThreeConditionComuiciton {
    
	public static void main(String[] args) {
		final ThreeComuiction threeComuiction = new ThreeComuiction();
        //one线程
		new Thread(new Runnable() {
			@Override
			public void run() {
				for(int n = 0;n < 50;n++){
					threeComuiction.One(n);
				}
			}
		}).start();
		//two线程
		new Thread(new Runnable() {
			@Override
			public void run() {
				for(int n = 0;n < 50;n++){
					threeComuiction.Two(n);
				}
				
			}
		}).start();
		//three线程
		for(int n = 0;n < 50;n++){
        	threeComuiction.Three(n);
        }		
	}
	
	static class ThreeComuiction{
		 Lock lock = new ReentrantLock();
		 Condition condition1 = lock.newCondition();
		 Condition condition2 = lock.newCondition(); 
		 Condition condition3 = lock.newCondition(); 
	     private int fagle = 1;
		public void One(int n){
			lock.lock();
			try {
				while(fagle != 1){
					try {
						condition1.await();
					} catch (InterruptedException e) {
						e.printStackTrace();
					}
				}
				for(int i = 0;i < 10;i++){
					System.out.println("one===="+i+"===循环到==="+n);
				}
				fagle = 2;
				condition2.signal();
			} finally {
               lock.unlock();
			}
		}
		
		public void Two(int n){
			lock.lock();
			try {
				while(fagle != 2){
					try {
						condition2.await();
					} catch (InterruptedException e) {
						e.printStackTrace();
					}
				}
				for(int i = 0;i < 10;i++){
					System.out.println("two===="+i+"===循环到==="+n);
				}
				fagle = 3;
				condition3.signal();
			} finally {
               lock.unlock();
			}
		}
		public void Three(int n){
			lock.lock();
			try {
				while(fagle != 3){
					try {
						condition3.await();
					} catch (InterruptedException e) {
						e.printStackTrace();
					}
				}
				for(int i = 0;i < 10;i++){
					System.out.println("three===="+i+"===循环到==="+n);
				}
				fagle = 1;
				condition1.signal();
			} finally {
               lock.unlock();
			}
		}
	}
	
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值