java 使用ReentrantLock与Condition实现简单的消息队列

import java.util.LinkedList;
import java.util.Queue;
import java.util.Random;
import java.util.Scanner;
import java.util.concurrent.locks.Condition;
import java.util.concurrent.locks.ReentrantLock;

/**
 * @author luocc
 */
public class ConditionTest {

    private  ReentrantLock lock = new ReentrantLock();
    private  Condition c1 = lock.newCondition(); // 单数队列
    private  Condition c2 = lock.newCondition(); // 双数队列
    private Queue<Integer> q1 = new LinkedList();
    private Queue<Integer> q2 = new LinkedList();

    public void addTask(int i){
        lock.lock();
        try {
            if(i % 2 == 0){
                q2.offer(i);
                c2.signal();
                System.out.println(String.format("双数队列 添加数字:%d,唤醒双数",i));
            }else{
                q1.offer(i);
                c1.signal();
                System.out.println(String.format("单数队列 添加数字:%d,唤醒单数",i));
            }

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

    public Integer readSignTask(){
        lock.lock();
        try {
            while (q1.isEmpty()){
                c1.await();
            }
            return q1.poll();
        }catch (Exception e){
            e.printStackTrace();
        }finally {
            lock.unlock();
        }
        return -1;
    }

    public Integer readDobTask(){
        lock.lock();
        try {
            while (q2.isEmpty()){
                c2.await();
            }
            return q2.poll();
        }catch (Exception e){
            e.printStackTrace();
        }finally {
            lock.unlock();
        }
        return -1;
    }

    public static void main(String[] args) {
        ConditionTest test = new ConditionTest();
        Random random = new Random();
//        Thread addTask = new Thread(() -> {
//            int i = 0;
//            while (i++ < 10) {
//                try {
//                    Thread.sleep(3000);
//                    test.addTask(random.nextInt(100));
//                } catch (InterruptedException e) {
//                    e.printStackTrace();
//                }
//            }
//        });
        Thread readSignTask = new Thread(() -> {
            while (true) {
                try {
                    Thread.sleep(5000);
                    Integer integer = test.readSignTask();
                    System.out.println(String.format("读取单数:%d",integer));
                } catch (InterruptedException e) {
                    e.printStackTrace();
                }
            }
        });
        Thread readDobTask = new Thread(() -> {
            while (true) {
                try {
                    Thread.sleep(5000);
                    Integer integer = test.readDobTask();
                    System.out.println(String.format("读取双数:%d",integer));
                } catch (InterruptedException e) {
                    e.printStackTrace();
                }
            }
        });
//        addTask.start();
        readSignTask.start();
        readDobTask.start();
//
        Scanner scanner = new Scanner(System.in);
        while (true){
            String next = scanner.next();
            try {
                int i = Integer.parseInt(next);
                test.addTask(i);
            }catch (NumberFormatException e){
                if("exit".equals(next)){
                    readDobTask.interrupt();
                    readSignTask.interrupt();
                    break;
                }else{
                    System.out.println(next + " : is not a integer");
                }
            }
        }
        System.out.println("main 结束");
        System.exit(0);
    }
}

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

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

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值