package com.kang.multithread;


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

/**
 * @author klr
 * @create 2020-09-17-13:32
 */
public class ThreadPoolTest {

    public static void main(String[] args) {
        ThreadPool threadPool = new ThreadPool(2, 1000, TimeUnit.MILLISECONDS, 10,(queue,task)->{
            //1.死等
//            queue.put(task);
            //2.帶超時(shí)的等待
//            queue.offer(task, 500, TimeUnit.MILLISECONDS);
            //3.放棄任務(wù)
//            System.out.println("放棄任務(wù)");
            //4.讓調(diào)用者拋出異常
//            throw new RuntimeException("任務(wù)執(zhí)行失敗" + task);
            //5.讓調(diào)用者自己執(zhí)行任務(wù)
            task.run();//被主線程調(diào)用
        });
        for (int i = 0; i < 5; i++) {
            int j = i;
            threadPool.execute(()->{
                System.out.println(j);
            });
        }
    }
}

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

//線程池
class ThreadPool{
    //處理策略
    private RejectPolicy<Runnable> rejectPolicy;

    //任務(wù)隊(duì)列
    private BlockingQueue<Runnable> taskQueue;

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

    //線程池大小
    private int coreSize;

    //獲取任務(wù)時(shí)的超時(shí)事件
    private long timeout;

    private TimeUnit unit;

    //執(zhí)行任務(wù)
    public void execute(Runnable task) {
        synchronized (workers) {
            if (workers.size() < coreSize) {
                Worker worker = new Worker(task);
                workers.add(worker);
                worker.start();
            } else {
//                taskQueue.put(task);
                //1.死等  2.帶超時(shí)等待 3.放棄任務(wù)執(zhí)行    4.拋出異常  5.調(diào)用這自己執(zhí)行任務(wù)
                taskQueue.tryPut(rejectPolicy, task);
            }
        }
    }

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

    class Worker extends Thread{
        private Runnable task;

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

        @Override
        public void run() {
            //task不為空，執(zhí)行任務(wù)

            //當(dāng)task執(zhí)行完畢，從任務(wù)隊(duì)列獲取任務(wù)執(zhí)行

//            while (task!=null||(task=taskQueue.take())!=null){
            while (task!=null||(task=taskQueue.poll(timeout,TimeUnit.MILLISECONDS))!=null){

                try {
                    task.run();
                }finally {
                    task = null;
                }
            }
            synchronized (workers) {
                workers.remove(this);
            }
        }
    }


}

class BlockingQueue<T> {
    //任務(wù)隊(duì)列，是雙端的
    private Deque<T> queue = new ArrayDeque<>();

    //鎖
    private ReentrantLock lock = new ReentrantLock();

    //隊(duì)列滿(mǎn)，生產(chǎn)者阻塞
    private Condition fullWaitSet = lock.newCondition();

    //隊(duì)列空，消費(fèi)者阻塞
    private Condition emptyWaitSet = lock.newCondition();

    //隊(duì)列大小
    private int size;

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

    //帶超時(shí)的阻塞獲取
    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() {
        //消費(fèi)者取任務(wù)
        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 value) {
        lock.lock();
        try {
            while (queue.size()==size) {
                try {
                    fullWaitSet.await();
                } catch (InterruptedException e) {
                    e.printStackTrace();
                }
            }
            queue.addLast(value);
            emptyWaitSet.signal();
        } finally {
            lock.unlock();
        }
    }

    //帶超時(shí)時(shí)間阻塞添加，避免任務(wù)超過(guò)size，導(dǎo)致阻塞
    public boolean offer(T task, long timeout, TimeUnit timeUnit) {
        lock.lock();
        try {
            long nanos = timeUnit.toNanos(timeout);
            while (queue.size()==size) {
                try {
                    if (nanos <= 0) {
                        return false;
                    }
                    nanos = fullWaitSet.awaitNanos(nanos);
                } catch (InterruptedException e) {
                    e.printStackTrace();
                }
            }
            queue.addLast(task);
            emptyWaitSet.signal();
            return true;
        } finally {
            lock.unlock();
        }
    }


    //獲取大小
    public int size() {
        lock.lock();
        try {
            return queue.size();
        }
        finally {
            lock.unlock();
        }
    }
    //    在try…catch語(yǔ)句中，當(dāng)程序執(zhí)行完return后的表達(dá)式后，會(huì)轉(zhuǎn)而執(zhí)行finally語(yǔ)句塊，最后再繼續(xù)執(zhí)行return。


    public  void tryPut(RejectPolicy<T> rejectPolicy, T task) {
        lock.lock();
        try {
            if (queue.size() == size) {

                rejectPolicy.reject(this,task);

            } else {//有空閑
                queue.addLast(task);
                emptyWaitSet.signal();
            }
        }
        finally {
            lock.unlock();
        }
    }
}