用java实现阻塞队列_java实现一个阻塞队列

import java.util.concurrent.locks.Condition;

import java.util.concurrent.locks.Lock;

import java.util.concurrent.locks.ReentrantLock;

public class BlockQueue {

private int size;

private Object[] queue;

private Lock lock = new ReentrantLock();

private Condition full = lock.newCondition();

private Condition empty = lock.newCondition();

private int index;

private int removeIndex;

private int currLen;

public BlockQueue() {

this(10);

}

public BlockQueue(int size) {

this.index = 0;

this.removeIndex = 0;

this.currLen = 0;

this.size = size;

queue = new Object[size];

}

public void push(T element) throws InterruptedException {

lock.lock();

try {

while (currLen == size) {

System.out.println("队列满。。。");

full.await();

}

queue[index] = element;

if (++index == size) {

index = 0;

}

currLen++;

empty.signal();

} finally {

lock.unlock();

}

}

public T pop() throws InterruptedException {

lock.lock();

try {

while (currLen == 0) {

System.out.println("队列空。。。");

empty.await();

}

Object obj = queue[removeIndex];

if (++removeIndex == size) {

removeIndex = 0;

}

currLen--;

full.signal();

return (T) obj;

} finally {

lock.unlock();

}

}

public static void main(String[] args) throws InterruptedException {

BlockQueue blockQueue = new BlockQueue(3);

blockQueue.push(1);

System.out.println(blockQueue.pop());

blockQueue.push(2);

System.out.println(blockQueue.pop());

blockQueue.push(3);

System.out.println(blockQueue.pop());

blockQueue.push(5);

blockQueue.push(5);

System.out.println(blockQueue.pop());

}

}