Java LinkedBlockingDeque pollLast()用法及代码示例

LinkedBlockingDeque的pollLast()方法返回Deque容器中的最后一个元素，并将其删除。如果容器为空，则返回null。

用法:

public E pollLast()

参数：此方法不接受任何参数。

返回值：如果容器不为空，则此方法返回Deque容器中的最后一个元素，并删除该元素。如果容器为空，则返回null。

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

示例1:

// Java Program Demonstrate pollLast() 
// 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.addFirst(7855642); 
        LBD.addFirst(35658786); 
        LBD.addFirst(5278367); 
        LBD.addFirst(74381793); 
  
        // Print the queue 
        System.out.println("Linked Blocking Deque: " + LBD); 
  
        // prints and deletes the last element 
        System.out.println("Front element in Deque: " +  
                                             LBD.pollLast()); 
  
        // prints the Deque after deletion of last element 
        System.out.println("Linked Blocking Deque: " + LBD); 
    } 
}

输出：

Linked Blocking Deque: [74381793, 5278367, 35658786, 7855642]
Front element in Deque: 7855642
Linked Blocking Deque: [74381793, 5278367, 35658786]

示例2:

// Java Program Demonstrate pollLast() 
// 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.pollLast()); 
    } 
}

输出：

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#pollLast()

相关用法

注：本文由纯净天空筛选整理自gopaldave大神的英文原创作品 LinkedBlockingDeque pollLast() method in Java。非经特殊声明，原始代码版权归原作者所有，本译文未经允许或授权，请勿转载或复制。