Java ConcurrentLinkedDeque poll()用法及代码示例

ConcurrentLinkedDeque的poll()方法返回Deque容器中的front元素并将其删除。如果容器为空，则返回null。

用法:

public E poll()

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

返回值：如果容器不为空，则此方法返回Deque容器的front元素并将其删除。如果容器为空，则返回null。

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

示例1:

// Java Program Demonstrate poll() 
// method of ConcurrentLinkedDeque 
  
import java.util.concurrent.ConcurrentLinkedDeque; 
import java.util.*; 
  
public class GFG { 
    public static void main(String[] args) 
  
    { 
  
        // create object of ConcurrentLinkedDeque 
        ConcurrentLinkedDeque<Integer> CLD 
            = new ConcurrentLinkedDeque<Integer>(); 
  
        // Add numbers to end of ConcurrentLinkedDeque 
        CLD.add(7855642); 
        CLD.add(35658786); 
        CLD.add(5278367); 
        CLD.add(74381793); 
  
        // Print the queue 
        System.out.println("ConcurrentLinkedDeque: "
                           + CLD); 
  
        System.out.println("Front element in Deque: "
                           + CLD.poll()); 
  
        // One element is deleted as poll was called 
        System.out.println("ConcurrentLinkedDeque: "
                           + CLD); 
    } 
}

输出：

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

示例2:

// Java Program Demonstrate poll() 
// method of ConcurrentLinkedDeque 
// when Deque is empty 
  
import java.util.concurrent.ConcurrentLinkedDeque; 
import java.util.*; 
  
public class GFG { 
    public static void main(String[] args) 
  
    { 
  
        // create object of ConcurrentLinkedDeque 
        ConcurrentLinkedDeque<Integer> CLD 
            = new ConcurrentLinkedDeque<Integer>(); 
  
        // Add numbers to end of ConcurrentLinkedDeque 
        CLD.add(7855642); 
        CLD.add(35658786); 
        CLD.add(5278367); 
        CLD.add(74381793); 
  
        // Print the queue 
        System.out.println("ConcurrentLinkedDeque: "
                           + CLD); 
  
        // empty deque 
        CLD.clear(); 
  
        System.out.println("Front element in Deque: "
                           + CLD.poll()); 
    } 
}

输出：

ConcurrentLinkedDeque: [7855642, 35658786, 5278367, 74381793]
Front element in Deque: null

相关用法

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