手写线程池

package com.juc.pool;

import lombok.extern.slf4j.Slf4j;

import java.util.ArrayDeque;
import java.util.Deque;
import java.util.HashMap;
import java.util.HashSet;
import java.util.concurrent.TimeUnit;
import java.util.concurrent.locks.Condition;
import java.util.concurrent.locks.ReentrantLock;

/**
 * @author zzyuan
 * @create 2022-04-07 21:04
 */
@Slf4j(topic = "c.TestPool")
public class TestPool {
    public static void main(String[] args) {

        ThreadPool threadPool = new ThreadPool(1,
                1000, TimeUnit.MILLISECONDS, 1, (queue , task) -> {
            //1)死等
//                    queue.put(task);
            //2)带超时时间的等待
//            queue.offer(task,1500,TimeUnit.MILLISECONDS);
            //3)让调用者线程放弃执行
//            log.debug("放弃{}",task);
            //4)抛出线程
//            throw new RuntimeException("任务执行失败" + task);
            //5)让调用着自己执行任务
            task.run();
                });
        for (int i = 0; i < 3; i++) {
            int j = i;
            threadPool.execute(()->{
                try {
                    Thread.sleep(1000L);
                } catch (InterruptedException e) {
                    e.printStackTrace();
                }
                log.debug("{}",j);
            });
        }

    }
}

//拒绝策略
@FunctionalInterface
interface RejectPolicy<T>{
    void reject(BlockingQueue<T> queue , T task);
}

@Slf4j(topic = "c.ThreadPool")
class ThreadPool{

    //任务队列
    private BlockingQueue<Runnable> taskQueue;

    //线程集合
    private HashSet<Worker> workers = new HashSet();

    //核心线程数
    private int coreSize;

    //获取任务的超时时间
    private long timeout;

    //时间单位
    private TimeUnit timeUnit;

    private RejectPolicy<Runnable> rejectPolicy;

    class Worker extends Thread{
        private Runnable task;

        public Worker(Runnable task){
            this.task = task;
        }

        @Override
        public void run() {
            //执行任务
            //1)当task不为null ,执行任务
            //2)当task执行完毕，从任务队列中执行任务
//            while (task != null || (task = taskQueue.take()) != null){//没有超时
            while (task != null || (task = taskQueue.poll(timeout,timeUnit)) != null){//有超时
                try {
                    log.debug("正在执行...{}",task);
                    task.run();
                }catch (Exception e){
                    e.printStackTrace();
                }finally {
                    task = null;
                }
            }

            synchronized (workers){
                log.debug("worker 被移除{}" ,this);
                workers.remove(this);
            }
        }

    }

    public ThreadPool(int coreSize, long timeout, TimeUnit timeUnit , int queueCapcity ,RejectPolicy<Runnable> rejectPolicy) {
        this.coreSize = coreSize;
        this.timeout = timeout;
        this.timeUnit = timeUnit;
        this.taskQueue = new BlockingQueue<>(queueCapcity);
        this.rejectPolicy = rejectPolicy;
    }

    //执行任务
    public void execute(Runnable task){
       //sync保证的是HashSet的线程安全
       synchronized (workers){
           //当任务数没有超过coreSize 时，直接交给worker对象执行
           if(workers.size() < coreSize){
               Worker worker = new Worker(task);
               log.debug("新增worker{},{}",worker,task);
               workers.add(worker);
               worker.start();
           }else {
               //当任务数超过coreSize 时，加入任务队列
//               taskQueue.put(task);
               //策略者模式
               //1)死等
               taskQueue.tryPut(rejectPolicy , task);
               //2)带超时时间的等待
               //3)让调用者线程放弃执行
               //4)抛出线程
               //5)让调用着自己执行任务



           }
       }
    }
}

@Slf4j(topic = "c.BlockingQueue")
class BlockingQueue<T>{
    //1.任务队列
    private Deque<T> queue = new ArrayDeque<>();

    //2.锁
    private ReentrantLock lock = new ReentrantLock();

    //3.生产者条件变量
    private Condition fullWaitSet = lock.newCondition();

    //4.消费者条件变量
    private Condition emptyWaitSet = lock.newCondition();

    //5.容量
    private int capcity;

    public BlockingQueue(int capcity) {
        this.capcity = capcity;
    }

    /**
     * 带超时的阻塞获取
     * @return
     */
    public T poll(long timeout , TimeUnit unit){
        lock.lock();
        try {
            //将超时时间统一转换成纳秒
            long nanos = unit.toNanos(timeout);
            while (queue.isEmpty()){
                try {
                    //返回的是剩余的时间
                    if(nanos <= 0)  return null;
                    nanos = emptyWaitSet.awaitNanos(nanos);
                } catch (InterruptedException e) {
                    e.printStackTrace();
                }
            }
            T t = queue.removeFirst();
            fullWaitSet.signal();
            return t;
        }finally {
            lock.unlock();
        }

    }

    //阻塞获取
    public T take(){
        lock.lock();
        try {
            while (queue.isEmpty()){
                try {
                    emptyWaitSet.await();
                } catch (InterruptedException e) {
                    e.printStackTrace();
                }
            }
            T t = queue.removeFirst();
            fullWaitSet.signal();
            return t;
        }finally {
            lock.unlock();
        }
    }

    //阻塞添加
    public void put(T task){
        lock.lock();
        try {
            while (queue.size() == capcity){
                try {
                    log.debug("等待加入任务队列{} ...",task);
                    fullWaitSet.await();
                } catch (InterruptedException e) {
                    e.printStackTrace();
                }
            }
            log.debug("加入任务队列{}",task);
            queue.addLast(task);
            emptyWaitSet.signal();//唤醒
        }finally {
            lock.unlock();
        }
    }

    //带超时时间的阻塞添加
    public boolean offer(T task , long timeout ,TimeUnit timeUnit){
        lock.lock();
        try {
            long nanos = timeUnit.toNanos(timeout);
            while (queue.size() == capcity){
                try {
                    log.debug("等待加入任务队列{} ...",task);
                    if(nanos <= 0){
                        return false;
                    }
                    nanos = fullWaitSet.awaitNanos(nanos);
                } catch (InterruptedException e) {
                    e.printStackTrace();
                }
            }
            log.debug("加入任务队列{}",task);
            queue.addLast(task);
            emptyWaitSet.signal();
            return  true;
        }finally {
            lock.unlock();
        }
    }


    //获取大小
    public int size(){
        lock.lock();
        try {
            return queue.size();
        }finally {
            lock.unlock();
        }
    }

    public void tryPut(RejectPolicy<T> rejectPolicy, T task) {
        lock.lock();
        try {
            //判断队列是否已满
            if(queue.size() == capcity){
                rejectPolicy.reject(this,task);
            }else{//有空闲
                log.debug("加入任务队列{}",task);
                queue.addLast(task);
                emptyWaitSet.signal();
            }
        }finally {
            lock.unlock();
        }
    }
}