LinkedBlockingDeque removeFirstOccurrence() method in Java

Last Updated : 04 Aug, 2021

The removeFirstOccurrence() method of LinkedBlockingDeque removes the first 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 removeFirstOccurrence(Object o)

Parameters: This method accepts a mandatory parameter o which specifies the element to be removed from the Deque container.
Returns: This method returns true if the element is present and removed from the Deque container, else it returns false.
Below programs illustrate removeFirstOccurrence() method of LinkedBlockingDeque:
Program 1: When element is present

Java

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

Output

Linked Blocking Deque: [15, 20, 20, 15] First occurrence of 15 removed Linked Blocking Deque: [20, 20, 15]

Program 2: When element is not present

Java

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

Output:

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

Reference: https://docs.oracle.com/javase/8/docs/api/java/util/concurrent/LinkedBlockingDeque.html#removeFirstOccurrence-java.lang.Object-

LinkedBlockingDeque removeFirstOccurrence() method in Java

gopaldave

Improve

Article Tags :

Practice Tags :

The contains(Object o) method of LinkedBlockingDeque checks if the passed element in the parameter exists in the container or not. It returns true if the element exists in the container else it returns a false value. Syntax: public boolean contains(Object o) Parameters: This method accepts a mandato

2 min read

LinkedBlockingDeque offerLast() method in Java

The offerLast(E e) method of LinkedBlockingDeque inserts the element passed in the parameter at the end of the Deque container. If the container's capacity has exceeded, then it does not returns an exception as in case of add() and addLast() function. Syntax: public boolean offerLast(E e) Parameters

2 min read

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 containe

2 min read

LinkedBlockingDeque pollFirst() method in Java

The pollFirst() 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 pollFirst() Parameters: This method does not accept any parameters. Returns: This method returns front element in the Deque cont

2 min read

LinkedBlockingDeque addLast() method in Java

The addLast(E e) method of LinkedBlockingDeque inserts the element passed in the parameter to the end of the Deque if there is space. If the LinkedBlockingDeque is capacity restricted and no space is left for insertion, it returns an IllegalStateException. Syntax: public void addLast(E e) Parameters

2 min read

LinkedBlockingDeque removeLast() method in Java

The removeLast() method of LinkedBlockingDeque returns and removes the element at tail of the Deque container. The method throws an NoSuchElementException if the Deque container is empty. Syntax: public E removeLast() Parameters: This method does not accepts any parameter. Returns: This method retur

2 min read

LinkedBlockingDeque remove() method in Java

The remove() method of LinkedBlockingDeque removes the head of the Deque container. The method throws a NoSuchElementException if the Deque container is empty. Syntax: public E remove() Parameters: This method does not accepts any parameter. Returns: This method does not returns anything. Exception:

2 min read

LinkedBlockingDeque put() method in Java

The put(E e) method of LinkedBlockingDeque inserts the specified element into the queue represented by this deque (in other words, at the tail of this deque). If the Deque is capacity restricted, then it will wait for the space to become available. Syntax: public void put(E e) Parameters: This metho

2 min read

LinkedBlockingDeque putFirst() method in Java

The putFirst(E e) method of LinkedBlockingDeque inserts the specified element at the front of the queue represented by this deque. If the Deque is capacity restricted, then it will wait for the space to become available. Syntax: public void putFirst(E e) Parameters: This method accepts a mandatory p

2 min read

LinkedBlockingDeque removeFirst() method in Java

The removeFirst() method of LinkedBlockingDeque returns and removes the first element of the Deque container from it. The method throws an NoSuchElementException if the Deque container is empty. Syntax: public E removeFirst() Returns: This method returns the head of the Deque container, which is the

2 min read

LinkedBlockingDeque removeFirstOccurrence() method in Java

Similar Reads