Java 中的 linkedblockingrequeremovefirst occurrence()方法
原文:https://www . geeksforgeeks . org/link edblockingeque-removefirst occurrence-method-in-Java/
的 removeFirstOccurrence() 方法链接锁定命令从该命令中删除指定元素的第一次出现。如果 deque 不包含该元素，它将保持不变。如果这个 deque 包含指定的元素，则返回 true，否则返回 false。 语法:
public boolean removeFirstOccurrence(Object o)
参数:该方法接受一个强制参数 o ，该参数指定要从德克尔容器中移除的元素。 返回:此方法返回 true 如果元素存在并从德格容器中移除，否则返回 false 。 下面的程序说明了当元素存在时链接锁定的 removeFirstOccurrence()方法: 程序 1:
Java 语言(一种计算机语言，尤用于创建网站)
// 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("First 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);
}
}
Output
Linked Blocking Deque: [15, 20, 20, 15]
First occurrence of 15 removed
Linked Blocking Deque: [20, 20, 15]
程序 2: 当元素不存在时
Java 语言(一种计算机语言，尤用于创建网站)
// 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("First 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);
}
}
Output:
Linked Blocking Deque: [15, 20, 20, 15]
10 not present and not removed
Linked Blocking Deque: [15, 20, 20, 15]
版权属于：月萌API www.moonapi.com，转载请注明出处
