实现接口:BlockingQueue<E>
常用实现类:
ArrayBlockingQueue<E>(int)固定长度
LinkedBlockingQueue<E>不固定长度
方法:
入队列:add(队列满时抛异常) offer(队列满时返回false)
put(队列满时阻塞不放。直到队列有空位才放入)
出队列:remove(队列空时取则抛异常) poll(
队列空时取则返回null)
take(
队列空时取则阻塞,直到队列有元素才取出
)
应用场景:
生产者消费者模型
产品类:
Basket.java
1
public class Basket{
2
//产生阻塞队列
3
BlockingQueue<String> blockingQueue = new ArrayBlockingQueue<String>(10);
4
5
//生产鸡蛋
6
public void product(){
7
blockingQueue.put("egg");
8
}
9
//消费鸡蛋
10
public void consume(){
11
blockingQueue.take("egg");
12
}
13
}
生产者类:
Producer.java
1
public class Producer implements Runnable{
2
3
Basket basket = null;
4
public Producer(Basket basket){
5
this.basket = basket;
6
}
7
@Override
8
public void run(){
9
while(true){
10
//try-catch异常
11
basket.product();//生产鸡蛋,往篮子队列里放
12
}
13
14
}
15
}
消费者类:
Consumer.java
1
public class Consumer implements Runnable{
2
Basket basket = null;
3
4
public Consumer(Basket basket){
5
this.basket = basket;
6
}
7
@Override
8
public void run(){
9
while(true){
10
//try-catch异常
11
basket.consume();//消费鸡蛋,往篮子队列里取
12
}
13
}
14
}
测试类:
TestBlockingQueue.java
1
public class void TestBlockingQueue{
2
3
public static void main(String[] args){
4
Basket basket = new Basket();//新建篮子
5
Producer producer = new Producer(basket);
6
Consumer consumer = new Consumer(basket);
7
new Thread(producer).start();//开始生产
8
new Thread(consumer).start;//开始消费
9
}
10
11
}