java pollfirst_Java LinkedBlockingDeque pollFirst()用法及代码示例

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

用法:

public E pollFirst()

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

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

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

示例1:

// Java Program Demonstrate pollFirst()

// 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 LBD

= new LinkedBlockingDeque();

// 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.pollFirst());

// 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 pollFirst()

// 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 LBD

= new LinkedBlockingDeque();

// 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.pollFirst());

}

}

输出：

Linked Blocking Deque: [7855642, 35658786, 5278367, 74381793]

Front element in Deque: null