多线程 - 阻塞栈blockingDeque
2016-06-13 15:01
671 查看
import java.util.concurrent.BlockingDeque; import java.util.concurrent.LinkedBlockingDeque; /** * 阻塞栈的特点是后入先出,每次操作都在栈顶 * * @author zhen.l * */ public class BlockingDequeTest { public static void main(String[] args) { BlockingDeque<Integer> blockingDeque = new LinkedBlockingDeque<Integer>( 10); for (int i = 0; i < 5; i++) { try { blockingDeque.putFirst(i); } catch (InterruptedException e) { e.printStackTrace(); } } for (int i = 0; i < 5; i++) { System.out.println(blockingDeque.getFirst()); blockingDeque.removeFirst(); } } }
相关文章推荐
- Handler,MessageQueue,Runnable,Looper
- 【iOS】UIButton 常用属性
- 如何通过java代码对kylin进行cube build
- 可扩展的事件复用技术:epoll和kqueue
- ReflectUitls类的编写和对反射机制的解析
- 多线程 - 阻塞队列blockingQueue用法
- hdu1005 Number Sequence
- java quick guide
- kendo ui简介
- Value stored to 'recordView' during its initialization is never read
- UINavigationBar颜色设置 用色码设置有误差
- 点击UITableviewCell中的Button打印cell属于的section和row
- JavaServer Faces 2.2 requires Dynamic Web Module 2.5 or newer
- confluence-5.4.4安装、破解、汉化
- Failed to create 'build\outputs\apk\watch-debug-unaligned.apks': 拒绝访问。
- 解决UITexFiled,UITableView与手势冲突
- 命名空间中的“MvcBuildViews”。 无效
- HADOOP- BUILD FAILURE
- uitableview grouped 顶端多出一块
- [leetcode] 357. Count Numbers with Unique Digits 解题报告