Java 中的 LinkedBlockingDeque poll()方法
原文:https://www . geeksforgeeks . org/link edblockingeque-poll-method-in-Java/
的 poll() 方法 link edblockingrequest返回 Deque 容器中的 front 元素并将其删除。如果容器是空的，它将返回空值。
语法:
public E poll()
参数:此方法不接受任何参数。
返回:如果容器不是空的，这个方法返回前元素并删除它。如果容器是空的，它将返回空值。
以下程序说明了链接锁定请求的轮询()方法:
程序 1:
// Java Program Demonstrate poll()
// method of LinkedBlockingDeque
import java.util.concurrent.LinkedBlockingDeque;
import java.util.*;
public class GFG {
public static void main(String[] args)
{
// create object of LinkedBlockingDeque
LinkedBlockingDeque<Integer> LBD
= new LinkedBlockingDeque<Integer>();
// Add numbers to end of LinkedBlockingDeque
LBD.add(7855642);
LBD.add(35658786);
LBD.add(5278367);
LBD.add(74381793);
// Print the queue
System.out.println("Linked Blocking Deque: " + LBD);
System.out.println("Front element in Deque: " + LBD.poll());
// One element is deleted as poll was called
System.out.println("Linked Blocking Deque: " + LBD);
}
}
输出:
Linked Blocking Deque: [7855642, 35658786, 5278367, 74381793]
Front element in Deque: 7855642
Linked Blocking Deque: [35658786, 5278367, 74381793]
程序二:
// Java Program Demonstrate poll()
// method of LinkedBlockingDeque
// when Deque is empty
import java.util.concurrent.LinkedBlockingDeque;
import java.util.*;
public class GFG {
public static void main(String[] args)
{
// create object of LinkedBlockingDeque
LinkedBlockingDeque<Integer> LBD
= new LinkedBlockingDeque<Integer>();
// Add numbers to end of LinkedBlockingDeque
LBD.add(7855642);
LBD.add(35658786);
LBD.add(5278367);
LBD.add(74381793);
// Print the queue
System.out.println("Linked Blocking Deque: " + LBD);
// empty deque
LBD.clear();
System.out.println("Front element in Deque: " + LBD.poll());
}
}
输出:
Linked Blocking Deque: [7855642, 35658786, 5278367, 74381793]
Front element in Deque: null
版权属于：月萌API www.moonapi.com，转载请注明出处
