25 blockingQueue.add(2);
26 System.out.println(blockingQueue.remove());
27 System.out.println(blockingQueue.remove());
28 System.out.println(blockingQueue.remove());
29 }
30
31 /**
32 *element方法是返回队列的头部节点,但是并不删除。如果队列为空,抛出异常
33 */
34 privatestaticvoidelementTest(){
35 ArrayBlockingQueue<Integer>blockingQueue=newArrayBlockingQueue<Integer>
(2);
36 blockingQueue.element();
37 }
38
39 /**
40 *offer方法用来插入一个元素。如果添加成功会返回true,而如果队列已经满了,返回fals
e
41 */
42 privatestaticvoidofferTest(){
43 ArrayBlockingQueue<Integer>blockingQueue=newArrayBlockingQueue<Integer>
(2);
44 System.out.println(blockingQueue.offer(1));
45 System.out.println(blockingQueue.offer(2));
46 System.out.println(blockingQueue.offer(3));
47 }
48
49 /**
50 *poll方法作用也是移除并返回队列的头节点。如果队列为空,返回null
51 */
52 privatestaticvoidpollTest(){
53 ArrayBlockingQueue<Integer>blockingQueue=newArrayBlockingQueue<Integer>
(3);
54 blockingQueue.offer(1);
55 blockingQueue.offer(2);
56 blockingQueue.offer(3);
57 System.out.println(blockingQueue.poll());
58 System.out.println(blockingQueue.poll());
59 System.out.println(blockingQueue.poll());
60 System.out.println(blockingQueue.poll());
61 }
62
63 /**
64 *peek方法返回队列的头元素但并不删除。如果队列为空,返回null