Java LinkedBlockingDeque add() method

The add() method of LinkedBlockingDeque class inserts the specified element at the tail of this LinkedBlockingDeque. The add() method overrides the add in class AbstractQueue<E>

Syntax:

Parameters:

e- It is the element to add

Specified By:

The add() method of ConcurrentLinkedQueue class is specified by:

add in interface BlockingDeque<E>
add in interface BlockingQueue<E>
add in interface Queue<E>.
add in interface Collection<E>.
add ininterface Deque<E>.

Return Value:

The add() method returns a Boolean value true, if the specified element is not null.

Throws:

NullPointerException: This exception will throw if the specified element e, is null.

IllegalStateException: This exception will throw if this deque is full

Example 1

import java.util.concurrent.LinkedBlockingDeque;
public class LinkedBlockingDequeAddExample1 {
public static void main(String[] args) {
int j =1;
int capacity=10;
LinkedBlockingDeque<Integer>deque = new LinkedBlockingDeque<Integer>(capacity);
for (int i = 1; i <=5; i++) {
//  Adding items to the tail of this queue
deque.add(i);
System.out.println("After adding "+ j++ +" to the deque :");
System.out.println(deque);
        }
    }
}

Test it Now

Output:

After adding 1 to the deque :
[1]
After adding 2 to the deque :
[1, 2]
After adding 3 to the deque :
[1, 2, 3]
After adding 4 to the deque :
[1, 2, 3, 4]
After adding 5 to the deque :
[1, 2, 3, 4, 5]

Example 2

import java.util.concurrent.LinkedBlockingDeque;
public class LinkedBlockingDequeAddExample2 {
static int i=1;
public static void main(String[] args) {
int capacity=100;
LinkedBlockingDeque<Name>deque = new LinkedBlockingDeque<Name>(capacity);
        Name s1 = new Name("Himanshu");
        Name s2 = new Name("Jyoti");
        Name s3 = new Name("Rahul");
deque.add(s1);
deque.add(s2);
deque.add(s3);
for (Name xyz : deque){
System.out.println(i++ + ". "+xyz);
        }
    }
}
class Name{
private String name;
public Name(String name) {
this.name = name;
    }
public String toString(){
return "Name = "+ this.name;
    }
}

Test it Now

Output:

1. Name = Himanshu
2. Name = Jyoti
3. Name = Rahul

Example 3

import java.util.Collections;
import java.util.concurrent.LinkedBlockingDeque;
public class LinkedBlockingDequeAddExample3 {
public static void main(String[] args) {
        Integer[] val = {0, 1};
int capacity=100;
LinkedBlockingDeque<Integer>deque = new LinkedBlockingDeque<Integer>(capacity);
deque.add(71);
deque.add(8);
deque.add(18);
deque.add(19);
System.out.println("Deque : ");
for (Integer n : deque) {
System.out.println(n);
val[0] = Collections.max(deque);
val[1] = Collections.min(deque);
        }
System.out.println("Max number = "+ val[0]);
System.out.println("Min number = "+ val[1]);
    }
}

Test it Now

Output:

Deque :
71
8
18
19
Max number = 71
Min number = 8

Example 4

import java.util.concurrent.LinkedBlockingDeque;
public class LinkedBlockingDequeAddExample4 {
public static void main(String[] args) {
int capacity=100;
LinkedBlockingDeque<Integer>deque = new LinkedBlockingDeque<Integer>(capacity);
deque.add(71);
deque.add(8);
deque.add(18);
deque.add(null);
System.out.println(deque);
    }
}

Test it Now

Output:

Exception in thread "main" java.lang.NullPointerException
	at java.util.concurrent.LinkedBlockingDeque.offerLast(LinkedBlockingDeque.java:357)
	at java.util.concurrent.LinkedBlockingDeque.addLast(LinkedBlockingDeque.java:334)
	at java.util.concurrent.LinkedBlockingDeque.add(LinkedBlockingDeque.java:633)
	at com.javaTpoint.LinkedBlockingDequeAddExample4.main(LinkedBlockingDequeAddExample4.java:11)

Next TopicJava LinkedBlockingDeque

← prev next →