多个线程按顺序循环打印线程独有的字符串

package multithreading.analysis;

import java.util.LinkedList;
import java.util.Queue;
import java.util.concurrent.ExecutorService;
import java.util.concurrent.Executors;
import java.util.concurrent.LinkedBlockingQueue;
import java.util.concurrent.TimeUnit;
import java.util.concurrent.locks.Condition;
import java.util.concurrent.locks.ReentrantLock;

import org.junit.Test;

/**
 * n个线程,每个线程打印的数字不一样,必须按顺序打印
 * @author mxipjs
 *
 */
public class AQSTest {
    private static ReentrantLock rtl = new ReentrantLock(); 
    private static Queue<Condition> queue = new LinkedList<Condition>();

    @Test
    public void test() throws InterruptedException{
        ExecutorService exec = Executors.newCachedThreadPool();
        for(int i=0;i<20;i++){
            Condition con = rtl.newCondition();
            queue.offer(con);
            exec.execute(new PrintC(con,i+""));
        }
        TimeUnit.SECONDS.sleep(1);
        rtl.lock();
        try {
            PrintC.signal(queue); //开始通知第一个打印线程
        }finally {
            rtl.unlock();
        }
        exec.shutdown();
        while(Thread.activeCount()>2){
            Thread.yield();
        }
        System.out.println("over");
    }

    static class PrintC implements Runnable {
        private String printStr;
        private static ThreadLocal<Integer> count = new ThreadLocal<Integer>(){
            protected Integer initialValue() {
                return new Integer(3);
            };
        };
        private Condition con;
        public PrintC(Condition con,String str) {
            this.con = con;
            this.printStr = str;
        }
        @Override
        public void run() {
            while(count.get()>0){
                rtl.lock();
                try {
                    con.await();
                    System.out.println(printStr);
                    signal(queue);
                    count.set(count.get()-1);
                } catch (InterruptedException e) {
                    e.printStackTrace();
                } finally{
                    rtl.unlock();
                }
            }
        }
        public static void signal(Queue<Condition> queue){
            Condition tempCondition = queue.poll();
            tempCondition.signal();
            queue.offer(tempCondition);
        }

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

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

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值