Java LinkedBlockingDeque removeFirstOccurrence()用法及代碼示例

LinkedBlockingDeque的removeFirstOccurrence()方法從此雙端隊列中刪除指定元素的首次出現。如果雙端隊列不包含元素，則它將保持不變。如果此雙端隊列包含指定的元素，則返回true，否則返回false。

用法:

public boolean removeFirstOccurrence(Object o)

參數：此方法接受必需的參數o，該參數指定要從Deque容器中刪除的元素。

返回值：如果該元素存在並且已從Deque容器中刪除，則此方法返回true，否則返回false。

以下示例程序旨在說明LinkedBlockingDeque的removeFirstOccurrence()方法：

示例1:當元素存在時

// Java Program to demonstrate removeFirstOccurrence() 
// method of LinkedBlockingDeque 
  
import java.util.concurrent.LinkedBlockingDeque; 
import java.util.*; 
  
public class GFG { 
    public static void main(String[] args) 
        throws InterruptedException 
    { 
  
        // create object of LinkedBlockingDeque 
        LinkedBlockingDeque<Integer> LBD 
            = new LinkedBlockingDeque<Integer>(); 
  
        // Add numbers to end of LinkedBlockingDeque 
        LBD.add(15); 
        LBD.add(20); 
        LBD.add(20); 
        LBD.add(15); 
  
        // print Dequeue 
        System.out.println("Linked Blocking Deque: " + LBD); 
  
        if (LBD.removeFirstOccurrence(15)) 
            System.out.println("Fist occurrence of 15 removed"); 
        else
            System.out.println("15 not present and not removed"); 
  
        // prints the Deque after removal 
        System.out.println("Linked Blocking Deque: " + LBD); 
    } 
}

輸出：

Linked Blocking Deque: [15, 20, 20, 15]
Fist occurrence of 15 removed
Linked Blocking Deque: [20, 20, 15]

示例2:當元素不存在時

// Java Program to demonstrate removeFirstOccurrence() 
// method of LinkedBlockingDeque 
  
import java.util.concurrent.LinkedBlockingDeque; 
import java.util.*; 
  
public class GFG { 
    public static void main(String[] args) 
        throws InterruptedException 
    { 
  
        // create object of LinkedBlockingDeque 
        LinkedBlockingDeque<Integer> LBD 
            = new LinkedBlockingDeque<Integer>(); 
  
        // Add numbers to end of LinkedBlockingDeque 
        LBD.add(15); 
        LBD.add(20); 
        LBD.add(20); 
        LBD.add(15); 
  
        // print Dequeue 
        System.out.println("Linked Blocking Deque: " + LBD); 
  
        if (LBD.removeFirstOccurrence(10)) 
            System.out.println("Fist occurrence of 10 removed"); 
        else
            System.out.println("10 not present and not removed"); 
  
        // prints the Deque after removal 
        System.out.println("Linked Blocking Deque: " + LBD); 
    } 
}

輸出：

Linked Blocking Deque: [15, 20, 20, 15]
10 not present and not removed
Linked Blocking Deque: [15, 20, 20, 15]

參考： https://docs.oracle.com/javase/8/docs/api/java/util/concurrent/LinkedBlockingDeque.html#removeFirstOccurrence-java.lang.Object-

相關用法

注：本文由純淨天空篩選整理自gopaldave大神的英文原創作品 LinkedBlockingDeque removeFirstOccurrence() method in Java。非經特殊聲明，原始代碼版權歸原作者所有，本譯文未經允許或授權，請勿轉載或複製。