Java中的 ConcurrentLinkedDeque poll() 方法及示例

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

句法：

public E poll()

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

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

下面的程序说明了 ConcurrentLinkedDeque 的 poll() 方法：

方案一：

// 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 CLD
            = new ConcurrentLinkedDeque();
  
        // 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]

方案二：

// 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 CLD
            = new ConcurrentLinkedDeque();
  
        // 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