LinkedBlockingDeque pollLast() method in Java
The pollLast() method of LinkedBlockingDeque 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.
Below programs illustrate pollLast() method of LinkedBlockingDeque:
Program 1:
// Java Program Demonstrate pollLast() // 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.addFirst( 7855642 ); LBD.addFirst( 35658786 ); LBD.addFirst( 5278367 ); LBD.addFirst( 74381793 ); // Print the queue System.out.println( "Linked Blocking Deque: " + LBD); // prints and deletes the last element System.out.println( "Front element in Deque: " + LBD.pollLast()); // prints the Deque after deletion of last element System.out.println( "Linked Blocking Deque: " + LBD); } } |
Linked Blocking Deque: [74381793, 5278367, 35658786, 7855642] Front element in Deque: 7855642 Linked Blocking Deque: [74381793, 5278367, 35658786]
Program 2:
// Java Program Demonstrate pollLast() // 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.pollLast()); } } |
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#pollLast()
Recommended Posts:
- ConcurrentSkipListSet pollLast() method in Java
- NavigableSet pollLast() method in Java
- ArrayDeque pollLast() Method in Java
- TreeSet pollLast() method in Java with Example
- ConcurrentLinkedDeque pollLast() method in Java
- BlockingDeque pollLast() method in Java with examples
- LinkedBlockingDeque contains() method in Java
- LinkedBlockingDeque put() method in Java
- LinkedBlockingDeque add() method in Java
- LinkedBlockingDeque pop() method in Java
- LinkedBlockingDeque take() method in Java
- LinkedBlockingDeque peekLast() method in Java
- LinkedBlockingDeque offerLast() method in Java
- LinkedBlockingDeque poll() method in Java
- LinkedBlockingDeque pollFirst() method in Java
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.