LinkedBlockingDeque的poll()方法返回Deque容器中的front元素并将其删除。如果容器为空,则返回null。
用法:
public E poll()
参数:此方法不接受任何参数。
返回值:如果容器不为空,则此方法返回Deque容器的front元素并将其删除。如果容器为空,则返回null。
以下示例程序旨在说明LinkedBlockingDeque的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]
示例2:
// 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
参考: https://docs.oracle.com/javase/7/docs/api/java/util/concurrent/LinkedBlockingDeque.html#poll()
相关用法
- Java PriorityQueue poll()用法及代码示例
- Java PriorityBlockingQueue poll()用法及代码示例
- Java LinkedTransferQueue poll()用法及代码示例
- Java ArrayBlockingQueue poll()用法及代码示例
- Java LinkedBlockingQueue poll()用法及代码示例
- Java ArrayDeque poll()用法及代码示例
- Java Queue poll()用法及代码示例
- Java ConcurrentLinkedQueue poll()用法及代码示例
- Java ConcurrentLinkedDeque poll()用法及代码示例
- Java DelayQueue poll()用法及代码示例
- Java BlockingDeque poll()用法及代码示例
- Java BlockingQueue poll()用法及代码示例
- Java LinkedBlockingDeque contains()用法及代码示例
- Java LinkedBlockingDeque put()用法及代码示例
- Java LinkedBlockingDeque pop()用法及代码示例
注:本文由纯净天空筛选整理自gopaldave大神的英文原创作品 LinkedBlockingDeque poll() method in Java。非经特殊声明,原始代码版权归原作者所有,本译文未经允许或授权,请勿转载或复制。