BlockingDeque removeLastOccurrence() method in Java with Examples

The removeLastOccurrence() method of BlockingDeque removes the last occurrence of the specified element from this deque. If the deque does not contain the element, it remains unchanged. It returns true if this deque contained the specified element, else it returns false.

Syntax:

public boolean removeLastOccurrence(Object o)

Parameters: This method accepts a mandatory parameter o which specifies the element whose last occurrence is to be removed from the Dequeue container.



Returns: This method returns true if the element is present and removed from the Deque container, else it returns false.

Note: The removeLastOccurrence() method of BlockingDeque has been inherited from the LinkedBlockingDeque class in Java.

Below programs illustrate removeLastOccurrence() method of BlockingDeque:

Program 1: When element is present.

filter_none

edit
close

play_arrow

link
brightness_4
code

// Java Program to demonstrate removeLastOccurrence()
// 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)
        throws InterruptedException
    {
  
        // create object of BlockingDeque
        BlockingDeque<Integer> BD
            = new LinkedBlockingDeque<Integer>();
  
        // Add numbers to end of BlockingDeque
        BD.add(15);
        BD.add(20);
        BD.add(20);
        BD.add(15);
  
        // print Dequeue
        System.out.println("Blocking Deque: " + BD);
  
        if (BD.removeLastOccurrence(15))
            System.out.println("Last occurrence of 15 removed");
        else
            System.out.println("15 not present and not removed");
  
        // prints the Deque after removal
        System.out.println("Blocking Deque: " + BD);
    }
}

chevron_right


Output:

Blocking Deque: [15, 20, 20, 15]
Last occurrence of 15 removed
Blocking Deque: [15, 20, 20]

Program 2: When element is not present.

filter_none

edit
close

play_arrow

link
brightness_4
code

// Java Program to demonstrate removeLastOccurrence()
// method of BlockingDeque
  
import java.util.concurrent.BlockingDeque;
import java.util.concurrent.LinkedBlockingDeque;
import java.util.*;
  
public class GFG {
    public static void main(String[] args)
        throws InterruptedException
    {
  
        // create object of BlockingDeque
        BlockingDeque<Integer> BD
            = new LinkedBlockingDeque<Integer>();
  
        // Add numbers to end of BlockingDeque
        BD.add(15);
        BD.add(20);
        BD.add(20);
        BD.add(15);
  
        // print Deque
        System.out.println("Blocking Deque: " + BD);
  
        if (BD.removeLastOccurrence(10))
            System.out.println("Last occurrence of 10 removed");
        else
            System.out.println("10 not present and not removed");
  
        // prints the Deque after removal
        System.out.println("Blocking Deque: " + BD);
    }
}

chevron_right


Output:

Blocking Deque: [15, 20, 20, 15]
10 not present and not removed
Blocking Deque: [15, 20, 20, 15]

Reference: https://docs.oracle.com/javase/7/docs/api/java/util/concurrent/BlockingDeque.html#removeLastOccurrence(java.lang.Object)



My Personal Notes arrow_drop_up

The function of education is to teach one to think intensively and to think critically

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.