Java LinkedBlockingDeque offerFirst() Method

The offerFirst () method of LinkedBlockingDeque class adds the defined elements at the front of this deque.

Syntax:

public boolean offerFirst(E e)
public boolean offerFirst(E e, long timeout, TimeUnit unit) throws InterruptedException

Parameters:

e - It is the element to be added.

timeout - It is the time till the method has to wait before giving up, in units of unit.

unit - It is the TimeUnit that decides how to interpret the timeout parameter.

Specified By:

The offerFirst() method of LinkedBlockingDeque class is specified by:

offerFirst() method in interface Deque<E>.
offerFirst() method in interface BlockingDeque<E>.

Return Value:

The offerFirst() method returns true if the defined element is added to this deque, else returns false.

Throws:

The offerFirst() method throws:

NullPointerException - If the element defined holds null value.
InterruptedException - If method call is interrupted during wait.

Example 1

import java.util.concurrent.LinkedBlockingDeque;
public class LinkedBlockingDequeOfferFirstExample1 {
    public static void main(String[] args) {
        int capacity=100;
        LinkedBlockingDeque<Integer> deque = new LinkedBlockingDeque<Integer>(capacity);
        for (int i = 1; i <=5; i++) {
            //  Adding items at the tail of this deque
            deque.add(i);
        }
        System.out.println(deque);
        System.out.println("After inserting 10 at first position");
        deque.offerFirst(10);
        System.out.println(deque);
    }
}

Test it Now

Output:

[1, 2, 3, 4, 5]
After inserting 10 at first position
[10, 1, 2, 3, 4, 5]

Example 2

import java.util.concurrent.LinkedBlockingDeque;
public class LinkedBlockingDequeOfferFirstExample2 {
    static  int i=1;
    public static void main(String[] args) {
        int capacity=100;
        LinkedBlockingDeque<String> deque = new LinkedBlockingDeque<String>(capacity);
        deque.add("Rohit");
        deque.add("Ramesh");
        deque.add("Janak");
        deque.add("Vishal");
        deque.add("Yatin");
        for (String xyz : deque){
            System.out.println(i++ +". "+xyz);
        }int i=1;
        System.out.println("After adding string :");
        deque.offerFirst("Yogesh");
        for (String xyz : deque){
            System.out.println(i++ +". "+xyz);
        }
    }
}

Test it Now

Output:

1. Rohit
2. Ramesh
3. Janak
4. Vishal
5. Yatin
After adding string :
1. Yogesh
2. Rohit
3. Ramesh
4. Janak
5. Vishal
6. Yatin

Example 3

import java.util.concurrent.LinkedBlockingDeque;
public class LinkedBlockingDequeOfferFirstExample3 {
    static  int i=1;
    public static void main(String[] args) {
        int capacity=4;
        LinkedBlockingDeque<String> deque = new LinkedBlockingDeque<String>(capacity);
        deque.add("Harish");
        deque.add("Anjali");
        deque.add("Astha");
        deque.add("Anushtha");
        deque.addFirst("Arpit");
        for (String xyz : deque){
            System.out.println(i++ +". "+xyz);
        }
    }
}

Test it Now

Output:

Exception in thread "main" java.lang.IllegalStateException: Deque full
	at java.util.concurrent.LinkedBlockingDeque.addFirst(Unknown Source)
	at mypack1.LinkedBlockingDequeOfferFirstExample3.main(LinkedBlockingDequeOfferFirstExample3.java:13)

Next TopicJava Linkedblockingdeque

← prev next →