LinkedBlockingQueue
来源:互联网 发布:淘宝双11秒杀技巧 编辑:程序博客网 时间:2024/05/16 18:36
The LinkedBlockingQueue
class implements the BlockingQueue
interface. Read the BlockingQueue
text for more information about the interface.
The LinkedBlockingQueue
keeps the elements internally in a linked structure (linked nodes). This linked structure can optionally have an upper bound if desired. If no upper bound is specified, Integer.MAX_VALUE
is used as the upper bound.
The LinkedBlockingQueue
stores the elements internally in FIFO (First In, First Out) order. The head
of the queue is the element which has been in queue the longest time, and the tail
of the queue is the element which has been in the queue the shortest time.
Here is how to instantiate and use a LinkedBlockingQueue
:
BlockingQueue<String> unbounded = new LinkedBlockingQueue<String>();BlockingQueue<String> bounded = new LinkedBlockingQueue<String>(1024);bounded.put("Value");String value = bounded.take();
- LinkedBlockingQueue
- LinkedBlockingQueue
- LinkedBlockingQueue
- LinkedBlockingQueue
- LinkedBlockingQueue
- LinkedBlockingQueue
- LinkedBlockingQueue
- LinkedBlockingQueue
- LinkedBlockingQueue
- LinkedBlockingQueue
- LinkedBlockingQueue
- LinkedBlockingQueue
- LinkedBlockingQueue
- LinkedBlockingQueue
- linkedblockingqueue
- LinkedBlockingQueue
- LinkedBlockingQueue原理
- java LinkedBlockingQueue
- 单片机控制继电器 使LED灯交替闪烁
- DelayQueue
- servlet几种跳转方法的路径怎么写
- hive中启动metastore
- 微信开发--如何存储并定时更新access_token
- LinkedBlockingQueue
- String中的常用方法
- 二分查找 C 、C++STL
- PriorityBlockingQueue
- HBase的Block Cache实现机制分析
- Ubuntu常用命令
- 733A Grasshopper And the String codeforces(水题)
- Linux下Gcc生成和使用静态库和动态库详解(转)
- linux中top、du、df、netstat、date、grep、ps、find文件格式以及文件内容排序去重