LinkedBlockingDeque的pop()方法从此双端队列表示的堆栈中弹出一个元素。换句话说,它将删除并返回此双端队列的第一个元素。如果容器为空,则返回null。
用法:
public E pop()
参数:此方法不接受任何参数。
返回值:此方法返回此双端队列的最前面的元素(此双端队列表示的堆栈的顶部)。如果双端队列为空,则抛出NoSuchElementException。
以下示例程序旨在说明LinkedBlockingDeque的pop()方法:
示例1:
// Java Program to demonstrate pop()
// method of LinkedBlockingDeque
import java.util.concurrent.LinkedBlockingDeque;
import java.util.*;
public class GFG {
public static void main(String[] args)
throws NoSuchElementException
{
// create object of LinkedBlockingDeque
LinkedBlockingDeque<Integer> LBD
= new LinkedBlockingDeque<Integer>();
// Add numbers to end of LinkedBlockingDeque
LBD.addFirst(7855642);
LBD.addFirst(35658786);
LBD.addFirst(5278367);
LBD.addFirst(74381793);
// Print the queue
System.out.println("Linked Blocking Deque: " + LBD);
// prints and deletes
System.out.println("Front element in Deque: " + LBD.pop());
// Deque after deletion of front element
System.out.println("Linked Blocking Deque: " + LBD);
}
}
输出:
Linked Blocking Deque: [74381793, 5278367, 35658786, 7855642] Front element in Deque: 74381793 Linked Blocking Deque: [5278367, 35658786, 7855642]
示例2:
// Java Program Demonstrate pop()
// 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);
// empty deque
LBD.clear();
System.out.println("Front element in Deque: " + LBD.pop());
}
}
输出:
Exception in thread "main" java.util.NoSuchElementException at java.util.concurrent.LinkedBlockingDeque.removeFirst(LinkedBlockingDeque.java:453) at java.util.concurrent.LinkedBlockingDeque.pop(LinkedBlockingDeque.java:777) at GFG.main(GFG.java:27)
参考: https://docs.oracle.com/javase/7/docs/api/java/util/concurrent/LinkedBlockingDeque.html#pop()
相关用法
- Java LinkedBlockingDeque put()用法及代码示例
- Java LinkedBlockingDeque take()用法及代码示例
- Java LinkedBlockingDeque contains()用法及代码示例
- Java LinkedBlockingDeque add()用法及代码示例
- Java LinkedBlockingDeque peekFirst()用法及代码示例
- Java LinkedBlockingDeque addFirst()用法及代码示例
- Java LinkedBlockingDeque element()用法及代码示例
- Java LinkedBlockingDeque putLast()用法及代码示例
- Java LinkedBlockingDeque remainingCapacity()用法及代码示例
- Java LinkedBlockingDeque removeLast()用法及代码示例
- Java LinkedBlockingDeque putFirst()用法及代码示例
- Java LinkedBlockingDeque removeFirst()用法及代码示例
- Java LinkedBlockingDeque getFirst()用法及代码示例
- Java LinkedBlockingDeque toString()用法及代码示例
- Java LinkedBlockingDeque spliterator()用法及代码示例
注:本文由纯净天空筛选整理自gopaldave大神的英文原创作品 LinkedBlockingDeque pop() method in Java。非经特殊声明,原始代码版权归原作者所有,本译文未经允许或授权,请勿转载或复制。