@Testpublic void queuedemo(){ConcurrentLinkedQueue<Integer> queue = new ConcurrentLinkedQueue();for (int i = 0; i < 5; i++){queue.add(i);}//獲取元素 不移除頭結(jié)點(diǎn)for (int i =0; i < 3; i++){System.out.println("peek: " + queue.peek());}//返回在此隊(duì)列元素上以恰當(dāng)順序進(jìn)行迭代的迭代器Iterator<Integer> iterator = queue.iterator();while (iterator.hasNext()){System.out.println("iterator: " + iterator.next());}//獲取元素并且在隊(duì)列中移除，如果隊(duì)列為空返回nullSystem.out.println("poll: " + queue.poll());//刪除隊(duì)首元素，如果隊(duì)列為空返回NoSuchElementExceptionInteger remove = queue.remove();System.out.println("remove: " + remove);System.out.println(queue.peek());remove = queue.remove();System.out.println("remove: " + remove);System.out.println(queue.peek());}

控制臺(tái)打印：

peek: 0
peek: 0
peek: 0
iterator: 0
iterator: 1
iterator: 2
iterator: 3
iterator: 4
poll: 0
remove: 1
2
remove: 2
3

Process finished with exit code 0
?

總結(jié)

以上是生活随笔為你收集整理的ConcurrentLinkedQueue常用方法的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問(wèn)題。

如果覺(jué)得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。