Table of Contents
ToggleJava ConcurrentLinkedQueue Methods
並發鏈結佇列是一個無界、執行緒安全且非阻塞的佇列,當佇列為空時,不會阻塞執行緒,會傳回 null 值,由於是無界的,如果沒有額外的記憶體,來增加新元素時,將會拋出 OutOfMemoryError , ConcurrentLinkedQueue Java Methods 介紹常見的 add 、 peek 、 remove 、 clear 、 size 等方法,本篇增加了範例,並透過單元測試來驗證產出結果。
檔案目錄
./
+- src
+- test
| +- org
| +- ruoxue
| +- java_147
| +- queue
| +- concurrentlinkedqueue
| +- ConcurrentLinkedQueueMethodsTest.java
單元測試
ConcurrentLinkedQueue Methods Java 提供新增、取得、刪除等操作佇列中的元素。
add
建立一個 ConcurrentLinkedQueue ,增加三個元素。
@Test
public void add() {
int expectedSize = 3;
Queue<String> queue = new ConcurrentLinkedQueue<String>();
queue.add("Papaya");
queue.add("Strawberry");
queue.add("Watermelon");
System.out.println(queue);
assertEquals(expectedSize, queue.size());
}
[Papaya, Strawberry, Watermelon]
addAll
建立兩個 ConcurrentLinkedQueue ,內各有三個元素,合併成為一個 Queue 。
@Test
public void addAll() {
int expectedSize = 6;
Queue<String> queue = new ConcurrentLinkedQueue<String>();
queue.add("Papaya");
queue.add("Strawberry");
queue.add("Watermelon");
Queue<String> queue2 = new ConcurrentLinkedQueue<String>();
queue2.add("Durian");
queue2.add("Guava");
queue2.add("Pitaya");
queue.addAll(queue2);
System.out.println(queue);
assertEquals(expectedSize, queue.size());
}
[Papaya, Strawberry, Watermelon, Durian, Guava, Pitaya]
peek
ConcurrentLinkedQueue Methods Java 建立一個 ConcurrentLinkedQueue 若無元素,則傳回 null ,若加入三個元素,則會取得第一個位置元素,元素並無移出佇列。
@Test
public void peek() {
String expected = "Papaya";
int expectedSize = 3;
Queue<String> queue = new ConcurrentLinkedQueue<String>();
String value = queue.peek();
System.out.println(value);
assertEquals(null, value);
queue.add("Papaya");
queue.add("Strawberry");
queue.add("Watermelon");
value = queue.peek();
System.out.println(value);
assertEquals(expected, value);
assertEquals(expectedSize, queue.size());
}
null
Papaya
element
ConcurrentLinkedQueue Methods Java 建立一個 ConcurrentLinkedQueue ,內有三個元素,取得第一個位置元素,元素並無移出佇列。
@Test
public void element() {
String expected = "Papaya";
int expectedSize = 3;
Queue<String> queue = new ConcurrentLinkedQueue<String>();
queue.add("Papaya");
queue.add("Strawberry");
queue.add("Watermelon");
String value = queue.element();
System.out.println(value);
assertEquals(expected, value);
assertEquals(expectedSize, queue.size());
}
Papaya
elementWhenEmpty
ConcurrentLinkedQueue Methods Java 建立一個 ConcurrentLinkedQueue ,當佇列為空,沒有任何元素時,取得第一個位置元素,會拋出例外。
@Test(expected = NoSuchElementException.class)
public void elementWhenEmpty() {
int expectedSize = 0;
Queue<String> queue = new ConcurrentLinkedQueue<String>();
String value = queue.element();
System.out.println(value);
assertEquals(expectedSize, queue.size());
}
java.util.NoSuchElementException
at java.util.AbstractQueue.element(AbstractQueue.java:136)
at org.ruoxue.java_147.queue.ConcurrentLinkedQueueMethodsTest.elementWhenEmpty(ConcurrentLinkedQueueMethodsTest.java:78)
remove
ConcurrentLinkedQueue Methods in Java 建立一個 ConcurrentLinkedQueue ,內有三個元素,刪除第一個元素及指定位置元素。
@Test
public void remove() {
int expectedSize = 2;
Queue<String> queue = new ConcurrentLinkedQueue<String>();
queue.add("Papaya");
queue.add("Strawberry");
queue.add("Watermelon");
queue.remove();
System.out.println(queue);
assertEquals(expectedSize, queue.size());
queue.remove("Watermelon");
System.out.println(queue);
assertEquals(1, queue.size());
}
[Strawberry, Watermelon]
[Strawberry]
removeWhenEmpty
ConcurrentLinkedQueue Methods in Java 建立一個 ConcurrentLinkedQueue ,當佇列為空,沒有任何元素時,移除第一個位置元素,會拋出例外。
@Test(expected = NoSuchElementException.class)
public void removeWhenEmpty() {
int expectedSize = 0;
Queue<String> queue = new ConcurrentLinkedQueue<String>();
queue.remove();
System.out.println(queue);
assertEquals(expectedSize, queue.size());
}
java.util.NoSuchElementException
at java.util.AbstractQueue.remove(AbstractQueue.java:117)
at org.ruoxue.java_147.queue.ConcurrentLinkedQueueMethodsTest.removeWhenEmpty(ConcurrentLinkedQueueMethodsTest.java:102)
removeAll
ConcurrentLinkedQueue Methods in Java 建立一個 ConcurrentLinkedQueue ,內有三個元素,刪除來自另一個 Queue 中的元素。
@Test
public void removeAll() {
int expectedSize = 1;
Queue<String> queue = new ConcurrentLinkedQueue<String>();
queue.add("Papaya");
queue.add("Strawberry");
queue.add("Watermelon");
Queue<String> queue2 = new ConcurrentLinkedQueue<String>();
queue2.add("Papaya");
queue2.add("Strawberry");
queue2.add("Pitaya");
queue.removeAll(queue2);
System.out.println(queue);
assertEquals(expectedSize, queue.size());
}
[Watermelon]
clear
ConcurrentLinkedQueue Methods in Java 建立一個 ConcurrentLinkedQueue ,內有三個元素,刪除所有元素。
@Test
public void clear() {
int expectedSize = 0;
Queue<String> queue = new ConcurrentLinkedQueue<String>();
queue.add("Papaya");
queue.add("Strawberry");
queue.add("Watermelon");
queue.clear();
System.out.println(queue);
assertEquals(expectedSize, queue.size());
}
[]
size
建立一個 ConcurrentLinkedQueue ,內有三個元素,取得佇列大小。
@Test
public void size() {
int expectedSize = 3;
Queue<String> queue = new ConcurrentLinkedQueue<String>();
queue.add("Papaya");
queue.add("Strawberry");
queue.add("Watermelon");
System.out.println(queue.size());
assertEquals(expectedSize, queue.size());
}
3
isEmpty
建立一個 ConcurrentLinkedQueue ,檢查是否為空 Queue 。
@Test
public void isEmpty() {
Queue<String> queue = new ConcurrentLinkedQueue<String>();
System.out.println(queue.isEmpty());
assertTrue(queue.isEmpty());
queue.add("Papaya");
queue.add("Strawberry");
queue.add("Watermelon");
System.out.println(queue.isEmpty());
assertFalse(queue.isEmpty());
}
true
false
ConcurrentLinkedQueueMethodsTest.java
ConcurrentLinkedQueue Methods in Java 新增單元測試,驗證是否符合預期。
package org.ruoxue.java_147.queue.concurrentlinkedqueue;
import static org.junit.Assert.*;
import java.util.NoSuchElementException;
import java.util.Queue;
import java.util.concurrent.ConcurrentLinkedQueue;
import org.junit.Test;
public class ConcurrentLinkedQueueMethodsTest {
@Test
public void add() {
int expectedSize = 3;
Queue<String> queue = new ConcurrentLinkedQueue<String>();
queue.add("Papaya");
queue.add("Strawberry");
queue.add("Watermelon");
System.out.println(queue);
assertEquals(expectedSize, queue.size());
}
@Test
public void addAll() {
int expectedSize = 6;
Queue<String> queue = new ConcurrentLinkedQueue<String>();
queue.add("Papaya");
queue.add("Strawberry");
queue.add("Watermelon");
Queue<String> queue2 = new ConcurrentLinkedQueue<String>();
queue2.add("Durian");
queue2.add("Guava");
queue2.add("Pitaya");
queue.addAll(queue2);
System.out.println(queue);
assertEquals(expectedSize, queue.size());
}
@Test
public void peek() {
String expected = "Papaya";
int expectedSize = 3;
Queue<String> queue = new ConcurrentLinkedQueue<String>();
String value = queue.peek();
System.out.println(value);
assertEquals(null, value);
queue.add("Papaya");
queue.add("Strawberry");
queue.add("Watermelon");
value = queue.peek();
System.out.println(value);
assertEquals(expected, value);
assertEquals(expectedSize, queue.size());
}
@Test
public void element() {
String expected = "Papaya";
int expectedSize = 3;
Queue<String> queue = new ConcurrentLinkedQueue<String>();
queue.add("Papaya");
queue.add("Strawberry");
queue.add("Watermelon");
String value = queue.element();
System.out.println(value);
assertEquals(expected, value);
assertEquals(expectedSize, queue.size());
}
@Test(expected = NoSuchElementException.class)
public void elementWhenEmpty() {
int expectedSize = 0;
Queue<String> queue = new ConcurrentLinkedQueue<String>();
String value = queue.element();
System.out.println(value);
assertEquals(expectedSize, queue.size());
}
@Test
public void remove() {
int expectedSize = 2;
Queue<String> queue = new ConcurrentLinkedQueue<String>();
queue.add("Papaya");
queue.add("Strawberry");
queue.add("Watermelon");
queue.remove();
System.out.println(queue);
assertEquals(expectedSize, queue.size());
queue.remove("Watermelon");
System.out.println(queue);
assertEquals(1, queue.size());
}
@Test(expected = NoSuchElementException.class)
public void removeWhenEmpty() {
int expectedSize = 0;
Queue<String> queue = new ConcurrentLinkedQueue<String>();
queue.remove();
System.out.println(queue);
assertEquals(expectedSize, queue.size());
}
@Test
public void removeAll() {
int expectedSize = 1;
Queue<String> queue = new ConcurrentLinkedQueue<String>();
queue.add("Papaya");
queue.add("Strawberry");
queue.add("Watermelon");
Queue<String> queue2 = new ConcurrentLinkedQueue<String>();
queue2.add("Papaya");
queue2.add("Strawberry");
queue2.add("Pitaya");
queue.removeAll(queue2);
System.out.println(queue);
assertEquals(expectedSize, queue.size());
}
@Test
public void clear() {
int expectedSize = 0;
Queue<String> queue = new ConcurrentLinkedQueue<String>();
queue.add("Papaya");
queue.add("Strawberry");
queue.add("Watermelon");
queue.clear();
System.out.println(queue);
assertEquals(expectedSize, queue.size());
}
@Test
public void size() {
int expectedSize = 3;
Queue<String> queue = new ConcurrentLinkedQueue<String>();
queue.add("Papaya");
queue.add("Strawberry");
queue.add("Watermelon");
System.out.println(queue.size());
assertEquals(expectedSize, queue.size());
}
@Test
public void isEmpty() {
Queue<String> queue = new ConcurrentLinkedQueue<String>();
System.out.println(queue.isEmpty());
assertTrue(queue.isEmpty());
queue.add("Papaya");
queue.add("Strawberry");
queue.add("Watermelon");
System.out.println(queue.isEmpty());
assertFalse(queue.isEmpty());
}
}
心得分享
Java Queue 佇列的頭部,是最舊的元素,而佇列的尾部,是最新元素,也就是採用 FIFO 先進先出的策略,檢索操作取得佇列頭部的元素, ConcurrentLinkedQueue Methods Java 提供了幾種 ConcurrentLinkedQueue 常見方法的操作範例。