Java 实现阻塞队列
@FunctionalInterface
interface RejectPolicy<T> {
void reject(BlockingQueue<T> queue, T task);
}
class Log {
public static void print(String s) {
System.out.print(s);
}
public static void println(String s) {
System.out.println(s);
}
}
class BlockingQueue<T> {
private Deque<T> queue = new ArrayDeque<>();
private ReentrantLock lock = new ReentrantLock();
private Condition fullWaitSet = lock.newCondition();
private Condition emptyWaitSet = lock.newCondition();
private int capacity;
public BlockingQueue(int capacity) {
Log.println("构造BlockingQueue");
this.capacity = capacity;
}
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.signalAll();
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.signalAll();
return t;
} finally {
lock.unlock();
}
}
public void put(T task) {
lock.lock();
try {
while (queue.size() == capacity) {
try {
Log.println("等待加入任务队列 {} ..." + task);
fullWaitSet.await();
} catch (InterruptedException e) {
e.printStackTrace();
}
}
Log.println("加入任务队列 {}" + task);
queue.addLast(task);
emptyWaitSet.signalAll();
} finally {
lock.unlock();
}
}
public boolean offer(T task, long timeout, TimeUnit unit) {
lock.lock();
try {
long nanos = unit.toNanos(timeout);
while (queue.size() == capacity) {
try {
if (nanos <= 0) {
return false;
}
nanos = fullWaitSet.awaitNanos(nanos);
} catch (InterruptedException e) {
e.printStackTrace();
}
}
queue.addLast(task);
emptyWaitSet.signalAll();
return true;
} finally {
lock.unlock();
}
}
public int size() {
lock.lock();
try {
return queue.size();
} finally {
lock.unlock();
}
}
public void tryPut(RejectPolicy<T> policy, T task) {
lock.lock();
try {
if (queue.size() == capacity) {
policy.reject(this, task);
} else {
queue.addLast(task);
emptyWaitSet.signalAll();
}
} finally {
lock.unlock();
}
}
}