LinkedBlockingDeque addLast() method in Java Last Updated : 14 Sep, 2018 Comments Improve Suggest changes Like Article Like Report 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: This method accepts a mandatory parameter e which is the element to be inserted in the end of the LinkedBlockingDeque. Returns: This method does not returns anything. Exception: IllegalStateException: if the element cannot be added at this time due to capacity restrictions NullPointerException: if the specified element is null Below programs illustrate addLast() method of LinkedBlockingDeque: Program 1: Java // Java Program Demonstrate addLast() // method of LinkedBlockingDeque import java.util.concurrent.LinkedBlockingDeque; import java.util.*; public class GFG { public static void main(String[] args) throws IllegalStateException { // create object of LinkedBlockingDeque LinkedBlockingDeque<Integer> LBD = new LinkedBlockingDeque<Integer>(); // Add numbers to end of LinkedBlockingDeque LBD.addLast(7855642); LBD.addLast(35658786); LBD.addLast(5278367); LBD.addLast(74381793); // before removing print queue System.out.println("Linked Blocking Deque: " + LBD); } } Output: Linked Blocking Deque: [7855642, 35658786, 5278367, 74381793] Program 2: Java // Java Program Demonstrate addLast() // method of LinkedBlockingDeque // when it is Full import java.util.concurrent.LinkedBlockingDeque; import java.util.*; public class GFG { public static void main(String[] args) throws IllegalStateException { // create object of LinkedBlockingDeque // size of list LinkedBlockingDeque<Integer> LBD = new LinkedBlockingDeque<Integer>(3); // Add numbers to end of LinkedBlockingDeque LBD.addLast(7855642); LBD.addLast(35658786); LBD.addLast(5278367); // it is full LBD.addLast(74381793); // before removing print queue System.out.println("Linked Blocking Deque: " + LBD); } } Output: Exception in thread "main" java.lang.IllegalStateException: Deque full at java.util.concurrent.LinkedBlockingDeque.addLast(LinkedBlockingDeque.java:335) at GFG.main(GFG.java:23) Program 3: Java // Java Program Demonstrate addLast() // method of LinkedBlockingDeque // when nill is inserted import java.util.concurrent.LinkedBlockingDeque; import java.util.*; public class GFG { public static void main(String[] args) throws IllegalStateException { // create object of LinkedBlockingDeque LinkedBlockingDeque<Integer> LBD = new LinkedBlockingDeque<Integer>(); // Add numbers to end of LinkedBlockingDeque LBD.addLast(7855642); LBD.addLast(35658786); LBD.addLast(5278367); // NULL LBD.addLast(null); // before removing print queue System.out.println("Linked Blocking Deque: " + LBD); } } 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 GFG.main(GFG.java:23) Reference: https://docs.oracle.com/javase/7/docs/api/java/util/concurrent/LinkedBlockingDeque.html#addLast(E) Comment More infoAdvertise with us Next Article LinkedBlockingDeque addLast() method in Java G gopaldave Follow Improve Article Tags : Misc Java Java-Collections Java - util package Java-Functions Java-LinkedBlockingDeque +2 More Practice Tags : JavaJava-CollectionsMisc Similar Reads LinkedBlockingDeque getFirst() method in Java The getFirst() method of LinkedBlockingDeque returns the front most element in the Deque container. If the LinkedBlockingDeque is empty, then on function call it returns a NoSuchElementException. Syntax: public E getLast() Parameters: This method does not accept any parameters. Returns: This method 2 min read LinkedBlockingDeque clear() method in Java The clear() method of LinkedBlockingDeque erases all the elements that are present in the LinkedBlockingDeque container. The container becomes empty after the function is called. Syntax: public void clear() Parameters: This method does not accepts any parameters Returns: This method does not returns 2 min read LinkedBlockingDeque getLast() method in Java The getLast() method of LinkedBlockingDeque returns the last element in the Deque container. If the LinkedBlockingDeque is empty, then on function call it returns a NoSuchElementException. Syntax: public E getLast() Parameters: This method does not accept any parameters. Returns: This method returns 2 min read LinkedBlockingDeque descendingIterator() method in Java The descendingIterator() method of LinkedBlockingDeque returns an iterator over the elements in this deque in a reverse sequential order. The elements will be returned in order from last(tail) to first(head). The returned iterator is a "weakly consistent" iterator. Syntax: public Iterator descending 2 min read LinkedBlockingDeque peekFirst() method in Java The peekFirst() method of LinkedBlockingDeque returns the front element in the Deque container, but does not deletes it. It returns null if the container is empty. Syntax: public E peekFirst() Parameters: This method does not accept any parameters. Returns: This method returns front element in the D 2 min read LinkedBlockingDeque offerFirst() method in Java The offerFirst(E e) method of LinkedBlockingDeque inserts the element passed in the parameter at the front of the Deque container. If the container's capacity has exceeded, then it does not returns an exception as in case of add() and addFirst() function. Syntax: public boolean offerFirst(E e) Param 2 min read LinkedBlockingDeque push() method in Java The push(E e) method of LinkedBlockingDeque pushes an element onto the stack represented by this deque. It inserts the element passed in the parameter to the front of the Deque if there is space. If the LinkedBlockingDeque is capacity restricted and no space is left for insertion, it returns an Ille 2 min read LinkedBlockingDeque peek() method in Java The peek() method of LinkedBlockingDeque returns the front element in the Deque container. It returns null if the container is empty. Syntax: public E peek() Parameters: This method does not accept any parameters. Returns: This method returns front element in the Deque container if the container is 2 min read LinkedBlockingDeque poll() method in Java The poll() 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 poll() Parameters: This method does not accept any parameters. Returns: This method returns front element of the Deque container if th 2 min read LinkedBlockingDeque contains() method in Java 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 Like