【JAVA】简单实现一个阻塞任务队列

package p18.juc;

import java.util.Queue;
import java.util.concurrent.ConcurrentLinkedQueue;
import java.util.concurrent.CountDownLatch;
import java.util.concurrent.locks.Condition;
import java.util.concurrent.locks.Lock;
import java.util.concurrent.locks.ReentrantLock;
import java.util.function.Consumer;

public class MyBlockingTaskQueen<T> {

    private ConcurrentLinkedQueue<T> queue = new ConcurrentLinkedQueue<>();
    private Lock lock = new ReentrantLock();
    private Condition cond = lock.newCondition();

    private int taskCapacity=10;
    public MyBlockingTaskQueen(int taskCapacity){
        this.taskCapacity = taskCapacity;
    }
    /*
     * 添加任务
     */
    public void put(T task) {
        try{
            lock.lock();
            while(queue.size()>taskCapacity) {
                System.out.println(Thread.currentThread().getName()+":任务数量达到上限,当前线程被挂起");
                cond.await();
            }
            queue.add(task);
            cond.signalAll();
        } catch (InterruptedException e) {
            e.printStackTrace();
        }finally {
            lock.unlock();
        }
    }
    /*
     * 处理任务
     */
    public void handle(Consumer<T>cons) {
        try {
            lock.lock();
            while(queue.size()<=0) {
                System.out.println(Thread.currentThread().getName()+":当前没有任务,线程被挂起");
                cond.await();
            }
            cons.accept(queue.poll());
            cond.signalAll();
        } catch (InterruptedException e) {
            e.printStackTrace();
        }finally {
            lock.unlock();
        }
    }


    /*
     * 测试
     */
    public static void main(String[] args) throws InterruptedException {
        CountDownLatch latch = new CountDownLatch(2);

        MyBlockingTaskQueen<Task> queue = new MyBlockingTaskQueen<>(1);
        /*
         * 模拟两个添加任务的线程,共添加2000条任务
         */
        Thread supplier1 = new Thread(()->{
            for (int i = 0; i < 1000; i++) {
                queue.put(new Task("task"+System.currentTimeMillis()));
            }
            System.out.println("===============");
        },"生产者1");
        Thread supplier2 = new Thread(()->{
            for (int i = 0; i < 1000; i++) {
                queue.put(new Task("task"+System.currentTimeMillis()));
            }
            System.out.println("======================");
        },"生产者2");
        /*
         * 模拟两个处理任务的线程,每个线程分1000条
         */
        Thread consumer = new Thread(()->{
            for (int i = 0; i < 1000; i++) {
                queue.handle((task)->System.out.println(Thread.currentThread().getName()+":处理"+task));
            }
            System.out.println("c1执行结束");
            latch.countDown();
        },"消费者1");
        Thread consumer2 = new Thread(()->{
            for (int i = 0; i < 1000; i++) {
                queue.handle((task)->System.out.println(Thread.currentThread().getName()+":处理"+task));
            }
            System.out.println("c2执行结束");
            System.out.println(consumer.getState());
            latch.countDown();
        },"消费者2");


        long startT = System.currentTimeMillis();

        consumer.start();
        consumer2.start();
        supplier1.start();
        supplier2.start();

        latch.await();
        long endT = System.currentTimeMillis();

        System.out.println("耗费时间:"+(endT-startT));
        System.out.println("c1:"+consumer.getState());
        System.out.println("c2:"+consumer2.getState());
        System.out.println("s1:"+supplier1.getState());
        System.out.println("s2:"+supplier2.getState());
        System.out.println("队列剩余数量:"+queue.size());

    }
}
class Task{
    private String name;
    public Task(String name) {
        this.name=name;
    }
    @Override
    public String toString() {
        return "Task [name=" + name + "]";
    }



}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值