java线程排队执行

package htr;

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

public class ConditionTest {
	public static void main(String[] args) {
		final Shar shar=new Shar();
		new Thread(){
			@Override
			public void run() {
				while(true){
					try {
						//Thread.sleep(1);
					} catch (Exception e) {
						e.printStackTrace();
					}
					shar.say1();
				}
			}
		}.start();
		new Thread(){
			@Override
			public void run() {
				while(true){
					try {
						Thread.sleep(100);
					} catch (Exception e) {
						e.printStackTrace();
					}
					shar.say2();
				}
			}
		}.start();
		new Thread(){
			@Override
			public void run() {
				while(true){
					try {
						//Thread.sleep(100);
					} catch (Exception e) {
						e.printStackTrace();
					}
					shar.say3();
				}
			}
		}.start();
	}
	

}
class Shar{
	Lock lock=new ReentrantLock();
	Condition cd1=lock.newCondition();
	Condition cd2=lock.newCondition();
	Condition cd3=lock.newCondition();
	java.util.concurrent.atomic.AtomicInteger next=new AtomicInteger(1);
	public void say1(){
		try {
			lock.lock();
			while(next.get()!=1){
				try {
					cd1.await();
				} catch (InterruptedException e) {
					e.printStackTrace();
				}
			}
			next.getAndSet(2);
			System.out.println("111111111");
		}catch(Exception s){
			s.printStackTrace();
		} finally{
			cd1.signal();
			lock.unlock();
		}
	}
	public void say2(){
		try{
		lock.lock();
		while(next.get()!=2){
			try {
				cd2.await();
			} catch (InterruptedException e) {
				e.printStackTrace();
			}
		}
		next.getAndSet(3);
		System.out.println("22222222222222222222");
	    }
		catch(Exception s){
			s.printStackTrace();
		}finally{
	    	cd3.signal();
			lock.unlock();
		}
	}
	public void say3(){
		try{
		lock.lock();
		while(next.get()!=3){
			try {
				cd3.await();
			} catch (InterruptedException e) {
				e.printStackTrace();
			}
		}
		next.getAndSet(1);
		System.out.println("333333333");
		}catch(Exception s){
			s.printStackTrace();
		} finally{
			cd1.signal();
			lock.unlock();
		}
	}
}

  • 0
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值