add 在添加元素的时候,若超出了度列的长度会直接抛出异常:
java.lang.IllegalStateException: Queue full
at java.util.AbstractQueue.add(Unknown Source)
at com.wjy.test.GrandPather.main(GrandPather.java:12)
put 若向队尾添加元素的时候发现队列已经满了会发生阻塞一直等待空间,以加入元素。
offer 在添加元素时,如果发现队列已满无法添加的话,会直接返回false。
LinkedBlockingQueue的poll,remove跟take的区别:
poll: 若队列为空,返回null
remove:若队列为空,抛出NoSuchElementException异常。
take:若队列为空,发生阻塞,等待有元素。
案例:
package com.cfcc.job.executor.utils;
import java.util.ArrayList;
import java.util.List;
import java.util.Random;
import java.util.concurrent.*;
/**
* @author gzy
* @version : 1.0
* @date : 2018/12/28 0028
*/
public class TestQuery {
LinkedBlockingQueue<Integer> queue = new LinkedBlockingQueue(10);
public static void main(String[] args) throws ExecutionException, InterruptedException {
TestQuery testQuery = new TestQuery();
new Thread(testQuery.new MyThread()).start();
new Thread(testQuery.new MyThread1()).start();
}
class MyThread implements Runnable {
@Override
public void run() {
for (;;) {
try {
queue.put(new Random(50).nextInt());
System.out.println("put: " + queue);
Thread.sleep(2);
} catch (InterruptedException e) {
e.printStackTrace();
}
}
}
}
class MyThread1 implements Runnable {
@Override
public void run() {
for (;;) {
try {
queue.take();
System.out.println("take :" + queue);
Thread.sleep(2000);
} catch (InterruptedException e) {
e.printStackTrace();
}
}
}
}
}