java.util.concurrent.ConcurrentLinkedDeque.removeFirstOccurrence()方法是Java中的內置方法,該方法接受參數並刪除此雙端隊列中該元素的首次出現。因此,在雙端隊列中不存在該元素的情況下,它保持不變。
用法:
public boolean removeFirstOccurrence(Object o)
參數:該函數接受一個對象elem作為參數,該參數表示要刪除從雙端隊列開始的第一個外觀的對象。
返回值:如果edeque中存在elem,則該函數返回true,否則返回false。
異常:如果作為參數傳遞給函數的指定元素為null,則該函數將引發NullPointerException。
以下示例程序旨在說明removeFirstOccurrence()方法的使用:
示例1:
/* Java program to demonstrate
removeFirstOccurrence() method
of ConcurrentLinkedDeque */
import java.util.concurrent.*;
class ConcurrentLinkedDequeDemo {
public static void main(String[] args)
{
ConcurrentLinkedDeque<String> cld = new ConcurrentLinkedDeque<String>();
cld.addFirst("GFG");
cld.addFirst("Geeks");
cld.addFirst("Gfg");
cld.addFirst("gfg");
cld.addFirst("Geeks");
// Displaying the existing LinkedDeque
System.out.println("Elements in "
+ "the LinkedDeque: " + cld);
// Remove first occurrence of element
cld.removeFirstOccurrence("Geeks");
// Displaying the modified LinkedDeque
System.out.println("Elements in "
+ "the LinkedDeque: " + cld);
}
}
輸出:
Elements in the LinkedDeque: [Geeks, gfg, Gfg, Geeks, GFG] Elements in the LinkedDeque: [gfg, Gfg, Geeks, GFG]
示例2:
/* Java program to demonstrate
removeFirstOccurrence() method
of ConcurrentLinkedDeque */
import java.util.concurrent.*;
class ConcurrentLinkedDequeDemo {
public static void main(String[] args)
{
ConcurrentLinkedDeque<Integer> cld = new ConcurrentLinkedDeque<Integer>();
cld.addFirst(12);
cld.addFirst(280);
cld.addFirst(1008);
cld.addFirst(1050);
cld.addFirst(379);
// Displaying the existing LinkedDeque
System.out.println("Elements in "
+ "the LinkedDeque: " + cld);
try {
// Remove first occurrence of element
cld.removeFirstOccurrence(null);
}
catch (Exception e) {
System.out.println(e);
}
}
}
輸出:
Elements in the LinkedDeque: [379, 1050, 1008, 280, 12] java.lang.NullPointerException
相關用法
- Java ArrayDeque removeFirstOccurrence()用法及代碼示例
- Java LinkedList removeFirstOccurrence()用法及代碼示例
- Java LinkedBlockingDeque removeFirstOccurrence()用法及代碼示例
- Java BlockingDeque removeFirstOccurrence()用法及代碼示例
- Java ConcurrentLinkedDeque add()用法及代碼示例
- Java ConcurrentLinkedDeque removeFirst()用法及代碼示例
- Java ConcurrentLinkedDeque pollFirst()用法及代碼示例
- Java ConcurrentLinkedDeque size()用法及代碼示例
- Java ConcurrentLinkedDeque getLast()用法及代碼示例
- Java ConcurrentLinkedDeque descendingIterator()用法及代碼示例
- Java ConcurrentLinkedDeque hashCode()用法及代碼示例
- Java ConcurrentLinkedDeque equals()用法及代碼示例
- Java ConcurrentLinkedDeque addLast()用法及代碼示例
- Java ConcurrentLinkedDeque peekFirst()用法及代碼示例
- Java ConcurrentLinkedDeque addFirst()用法及代碼示例
注:本文由純淨天空篩選整理自RICHIK BHATTACHARJEE大神的英文原創作品 ConcurrentLinkedDeque removeFirstOccurrence() method in Java。非經特殊聲明,原始代碼版權歸原作者所有,本譯文未經允許或授權,請勿轉載或複製。