Java LinkedBlockingDeque offerLast() Method

The offerLast() method of LinkedBlockingDeque class adds the defined elements at the end of this deque, only if the deque's capacity allows so.

Syntax:

public boolean offerLast(E e)
public boolean offerLast(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 offerLast() method of LinkedBlockingDeque class is specified by:

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

Return Value:

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

Throws:

The offerLast() 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 LinkedBlockingDequeOfferLastExample1 {
    public static void main(String[] args) {
        int capacity=100;
        LinkedBlockingDeque<Integer> deque = new LinkedBlockingDeque<Integer>(capacity);
        for (int i = 15; i <=20; i++) {
            //  Adding items to the tail of this queue
            deque.add(i);
        }
        System.out.println(deque);
        System.out.println("After inserting 21 at Last position");
        deque.offerLast(21);
        System.out.println(deque);
    }
}

Test it Now

Output:

[15, 16, 17, 18, 19, 20]
After inserting 21 at Last position
[15, 16, 17, 18, 19, 20, 21]

Example 2

import java.util.concurrent.LinkedBlockingDeque;
public class LinkedBlockingDequeOfferLastExample2 {
    static  int i=1;
    public static void main(String[] args) {
        int capacity=100;
        LinkedBlockingDeque<String> deque = new LinkedBlockingDeque<String>(capacity);
        deque.add("Kapil");
        deque.add("Payal");
        deque.add("Diksha");
        deque.add("Nishank");
        for (String xyz : deque){
            System.out.println(i++ +". "+xyz);
        }int i=1;
        System.out.println("After adding string at last position :");
        deque.offerLast("Manav");
        for (String xyz : deque){
            System.out.println(i++ +". "+xyz);
        }
    }
}

Test it Now

Output:

1. Kapil
2. Payal
3. Diksha
4. Nishank
After adding string at last position :
1. Kapil
2. Payal
3. Diksha
4. Nishank
5. Manav

Next TopicJava Linkedblockingdeque

← prev next →

Latest Courses

We provides tutorials and interview questions of all technology like java tutorial, android, java frameworks

Contact info

G-13, 2nd Floor, Sec-3, Noida, UP, 201301, India

[email protected].

Python

AI, ML and Data Science

Java

B.Tech and MCA

Web Technology

Software Testing

Technical Interview

Java Interview

Web Interview

Database Interview

Company Interviews

Java Tutorial

Control Statements

Java Object Class

Java Inheritance

Java Polymorphism

Java Abstraction

Java Encapsulation

Java Array

Java OOPs Misc

Java String

Java String Methods

Java Regex

Exception Handling

Java Inner Class

Java Multithreading

Java Synchronization

Java Networking

Java Applet

Java Reflection

Java Conversion

Java JDBC

RMI

Internationalization

Java Array Class

Java AtomicInteger Class

Java AtomicLong Methods

Java Authenticator

Java BigDecimal class

Big Integer Class

Java Boolean class

Java Byte Class

Java Class

Java Collections class

Java Compiler Class

CopyOnWriteArrayList

Java Math Methods

LinkedBlockingDeque

Java Long class

LinkedTransferQueue

Java List

Java MulticastSocket

Java Number Class

Java Phaser Class

ArrayList Methods

Java Thread Methods

Java Projects

Java Programs

Java Misc

Java Date Class

Java ListIterator Class

Java NIO Tutorial

HttpURLConnection

Java Deque

Java HttpCookie Class

Java URL class

Java List Methods

Java Vector class

Java Collection Methods

Java Socket Class

Java Executors