BlockingQueue是FIFO(先进先出)型队列,他很好的解决了多线程中,如何高效安全“传输”数据的问题。本文会介绍BlockingQueue常用的四组api以及他们之间的不同之处。
方式 | 返回布尔,抛出异常 | 返回布尔,不抛出异常 | 阻塞,一直等待 | 阻塞,超时等待 |
---|---|---|---|---|
添加 | add(e) | offer(e) | put(e) | offer(e, timeout, unit) |
移出 | remove( ) | poll( ) | take( ) | poll(timeout, unit) |
返回队首元素 | element( ) | peek( ) | – | – |
返回布尔,抛出异常:
// 容量大小为3
ArrayBlockingQueue<String> blockingQueue = new ArrayBlockingQueue<String>(3);
// add() 向队列添加元素,返回布尔值
System.out.println(blockingQueue.add("a"));
System.out.println(blockingQueue.add("b"));
System.out.println(blockingQueue.add("c"));
// 超过容量,抛异常 IllegalStateException: Queue full
//System.out.println(blockingQueue.add("d"));
// 返回队首元素
System.out.println("top = " + blockingQueue.element());
System.out.println("-------------");
System.out.println(blockingQueue.remove());
System.out.println(blockingQueue.remove());
System.out.println(blockingQueue.remove());
// 无元素,抛异常 NoSuchElementException
//System.out.println(blockingQueue.remove());
// 返回队首元素,抛异常 NoSuchElementException
//System.out.println("top = " + blockingQueue.element());
运行结果:
add(e)异常:
remove( )异常:
element( )异常
返回布尔,不抛异常:
// 容量大小为3
ArrayBlockingQueue<String> blockingQueue = new ArrayBlockingQueue<String>(3);
// offer() 向队列添加元素,返回布尔值
System.out.println(blockingQueue.offer("a"));
System.out.println(blockingQueue.offer("b"));
System.out.println(blockingQueue.offer("c"));
// 不抛异常,返回false
System.out.println(blockingQueue.offer("d"));
// 返回队首元素
System.out.println("top = " + blockingQueue.peek());
System.out.println("-------------");
System.out.println(blockingQueue.poll());
System.out.println(blockingQueue.poll());
System.out.println(blockingQueue.poll());
// 无元素,不抛异常 返回null
System.out.println(blockingQueue.poll());
// 返回队首元素,不抛异常
System.out.println("top = " + blockingQueue.peek());
运行结果:
阻塞,一直等待:
// 容量大小为3
ArrayBlockingQueue<String> blockingQueue = new ArrayBlockingQueue<String>(3);
blockingQueue.put("a");
blockingQueue.put("b");
blockingQueue.put("c");
// 队列没有位置了,一直阻塞
//blockingQueue.put("d");
System.out.println(blockingQueue.take());
System.out.println(blockingQueue.take());
System.out.println(blockingQueue.take());
// 队列没有元素了,一直阻塞
//System.out.println(blockingQueue.take());
运行结果:
当队列没有剩余位置可以插入元素,或没有元素可以取出时,会一直阻塞。
阻塞,超时等待:
// 容量大小为3
ArrayBlockingQueue<String> blockingQueue = new ArrayBlockingQueue<String>(3);
// offer() 向队列添加元素,返回布尔值
System.out.println(blockingQueue.offer("a"));
System.out.println(blockingQueue.offer("b"));
System.out.println(blockingQueue.offer("c"));
// 等待2s,超时取消阻塞
System.out.println(blockingQueue.offer("d", 2, TimeUnit.SECONDS));
System.out.println("-------------");
System.out.println(blockingQueue.poll());
System.out.println(blockingQueue.poll());
System.out.println(blockingQueue.poll());
// 等待2s,超时取消阻塞
System.out.println(blockingQueue.poll(2, TimeUnit.SECONDS));
运行结果:
带参数的offer(e, timeout, unit):
带参数的poll(timeout, unit):