Java中的LinkedBlockingDeque poll()方法

这个 投票 方法 LinkedBlockingDeque 返回Deque容器中的front元素并将其删除。它回来了 无效的 如果容器是空的。

null

语法:

public E poll()

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

返回: 此方法返回 前元素 如果容器不是空的,则删除Deque容器。它回来了 无效的 如果容器是空的。

下面的程序演示了LinkedBlockingDeque的poll()方法:

项目1:

// Java Program Demonstrate poll()
// 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.add( 7855642 );
LBD.add( 35658786 );
LBD.add( 5278367 );
LBD.add( 74381793 );
// Print the queue
System.out.println( "Linked Blocking Deque: " + LBD);
System.out.println( "Front element in Deque: " + LBD.poll());
// One element is deleted as poll was called
System.out.println( "Linked Blocking Deque: " + LBD);
}
}


输出:

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

项目2:

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


输出:

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

© 版权声明
THE END
喜欢就支持一下吧
点赞8 分享