BlockingDeque pollLast() method in Java with examples
The pollLast() method of BlockingDeque returns the last element in the Deque container, and deletes it. It returns null if the container is empty.
Syntax:
public E pollLast()
Parameters: This method does not accept any parameters.
Returns: This method returns last element in the Deque container if the container is not empty and deletes the element also. It returns null if the container is empty.
Note: The pollLast() method of BlockingDeque has been inherited from the LinkedBlockingDeque class in Java.
Below programs illustrate pollLast() method of BlockingDeque:
Program 1:
// Java Program Demonstrate pollLast() // method of BlockingDeque import java.util.concurrent.LinkedBlockingDeque; import java.util.concurrent.BlockingDeque; import java.util.*; public class GFG { public static void main(String[] args) { // create object of BlockingDeque BlockingDeque<Integer> BD = new LinkedBlockingDeque<Integer>(); // Add numbers to end of BlockingDeque BD.addFirst( 7855642 ); BD.addFirst( 35658786 ); BD.addFirst( 5278367 ); BD.addFirst( 74381793 ); // Print the queue System.out.println( "Blocking Deque: " + BD); // prints and deletes the last element System.out.println( "Front element in Deque: " + BD.pollLast()); // prints the Deque after deletion of last element System.out.println( "Blocking Deque: " + BD); } } |
Blocking Deque: [74381793, 5278367, 35658786, 7855642] Front element in Deque: 7855642 Blocking Deque: [74381793, 5278367, 35658786]
Program 2:
// Java Program Demonstrate pollLast() // method of BlockingDeque // when Deque is empty import java.util.concurrent.LinkedBlockingDeque; import java.util.concurrent.BlockingDeque; import java.util.*; public class GFG { public static void main(String[] args) { // create object of BlockingDeque BlockingDeque<Integer> BD = new LinkedBlockingDeque<Integer>(); // Add numbers to end of BlockingDeque BD.add( 7855642 ); BD.add( 35658786 ); BD.add( 5278367 ); BD.add( 74381793 ); // Print the queue System.out.println( "Blocking Deque: " + BD); // empty deque BD.clear(); System.out.println( "Front element in Deque: " + BD.pollLast()); } } |
Blocking Deque: [7855642, 35658786, 5278367, 74381793] Front element in Deque: null
Recommended Posts:
- BlockingDeque contains() method in Java with Examples
- BlockingDeque add() method in Java with Examples
- BlockingDeque take() method in Java with Examples
- BlockingDeque put() method in Java with Examples
- BlockingDeque peek() method in Java with examples
- BlockingDeque push() method in Java with examples
- BlockingDeque putFirst() method in Java with Examples
- BlockingDeque poll() method in Java with examples
- BlockingDeque offerLast() method in Java with examples
- BlockingDeque pollFirst() method in Java with examples
- BlockingDeque element() method in java with examples
- BlockingDeque iterator() method in Java with examples
- BlockingDeque offerFirst() method in Java with Examples
- BlockingDeque addFirst() method in Java with Examples
- BlockingDeque addLast() method in Java with Examples
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.