LinkedBlockingDeque poll() method in Java
Last Updated :
14 Sep, 2018
The poll() method of LinkedBlockingDeque returns the front element in the Deque container and deletes it. It returns null if the container is empty.
Syntax:
public E poll()
Parameters: This method does not accept any parameters.
Returns: This method returns front element of the Deque container if the container is not empty and deletes it. It returns null if the container is empty.
Below programs illustrate poll() method of LinkedBlockingDeque:
Program 1:
import java.util.concurrent.LinkedBlockingDeque;
import java.util.*;
public class GFG {
public static void main(String[] args)
{
LinkedBlockingDeque<Integer> LBD
= new LinkedBlockingDeque<Integer>();
LBD.add( 7855642 );
LBD.add( 35658786 );
LBD.add( 5278367 );
LBD.add( 74381793 );
System.out.println( "Linked Blocking Deque: " + LBD);
System.out.println( "Front element in Deque: " + LBD.poll());
System.out.println( "Linked Blocking Deque: " + LBD);
}
}
|
Output:
Linked Blocking Deque: [7855642, 35658786, 5278367, 74381793]
Front element in Deque: 7855642
Linked Blocking Deque: [35658786, 5278367, 74381793]
Program 2:
import java.util.concurrent.LinkedBlockingDeque;
import java.util.*;
public class GFG {
public static void main(String[] args)
{
LinkedBlockingDeque<Integer> LBD
= new LinkedBlockingDeque<Integer>();
LBD.add( 7855642 );
LBD.add( 35658786 );
LBD.add( 5278367 );
LBD.add( 74381793 );
System.out.println( "Linked Blocking Deque: " + LBD);
LBD.clear();
System.out.println( "Front element in Deque: " + LBD.poll());
}
}
|
Output:
Linked Blocking Deque: [7855642, 35658786, 5278367, 74381793]
Front element in Deque: null
Reference: https://docs.oracle.com/javase/7/docs/api/java/util/concurrent/LinkedBlockingDeque.html#poll()
Like Article
Suggest improvement
Share your thoughts in the comments
Please Login to comment...