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 method accepts a mandatory parameter e which is the element to be inserted at the end of the LinkedBlockingDeque.



Returns: This method does not return anything.

Exceptions: The program throws two exceptions as shown below:

  • NullPointerException – if the specified element is null
  • InterruptedException – if interrupted while waiting

Below programs illustrate put() method of LinkedBlockingDeque:

Program 1:

filter_none

edit
close

play_arrow

link
brightness_4
code

// Java Program Demonstrate put()
// 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.put(7855642);
        LBD.put(35658786);
        LBD.put(5278367);
        LBD.put(74381793);
  
        // print Dequeue
        System.out.println("Linked Blocking Deque: " + LBD);
    }
}

chevron_right


Output:

Linked Blocking Deque: [7855642, 35658786, 5278367, 74381793]

Program 2:

filter_none

edit
close

play_arrow

link
brightness_4
code

// Java Program Demonstrate put()
// method of LinkedBlockingDeque
// throwing NullPointerException
  
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.put(7855642);
        LBD.put(35658786);
        LBD.put(5278367);
  
        // throws an exception
        LBD.put(null);
  
        // print Dequeue
        System.out.println("Linked Blocking Deque: " + LBD);
    }
}

chevron_right


Output:

Exception in thread "main" java.lang.NullPointerException
    at java.util.concurrent.LinkedBlockingDeque.putLast(LinkedBlockingDeque.java:390)
    at java.util.concurrent.LinkedBlockingDeque.put(LinkedBlockingDeque.java:649)
    at GFG.main(GFG.java:22)

Program 3:

filter_none

edit
close

play_arrow

link
brightness_4
code

// Java Program Demonstrate put()
// method of LinkedBlockingDeque
// when capacity exceeded
  
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>(3);
  
        // Add numbers to end of LinkedBlockingDeque
        LBD.put(7855642);
        LBD.put(35658786);
        LBD.put(5278367);
  
        // throws an exception
        LBD.put(4356789);
  
        // print Dequeue
        System.out.println("Linked Blocking Deque: " + LBD);
    }
}

chevron_right


Output:

Runtime Errors:
Max real time limit exceeded due to either by heavy load on server or by using sleep function

Reference: https://docs.oracle.com/javase/8/docs/api/java/util/concurrent/LinkedBlockingDeque.html#put-E-



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.