Java ConcurrentLinkedDeque poll()方法及示例

Java ConcurrentLinkedDeque poll()方法及示例

ConcurrentLinkedDequepoll() 方法返回Deque容器中的前端元素,并将其删除。如果容器是空的,它将返回 null

语法

public E poll()

参数: 该方法不接受任何参数。

返回: 如果Deque容器不是空的,该方法返回该容器的前部元素,并将其删除。如果容器是空的,则返回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

Python教程

Java教程

Web教程

数据库教程

图形图像教程

大数据教程

开发工具教程

计算机教程