LinkedBlockingDeque size() method in Java Last Updated : 26 Nov, 2018 Comments Improve Suggest changes Like Article Like Report The size() method of LinkedBlockingDeque returns the current size of the Deque container. On calling the function the number of elements in the Deque container is returned. If the container is capacity restricted, then also it returns the number of elements which are present in the container at the time of function call. Syntax: public int size() Returns: This method returns an integer value which signifies the number of elements in the container. Below programs illustrate size() method of LinkedBlockingDeque: Program 1: Java // Java Program to demonstrate public int size() // 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.add(15); LBD.add(20); LBD.add(20); LBD.add(15); LBD.add(15); LBD.add(20); LBD.add(20); LBD.add(15); // print Dequeue System.out.println("Linked Blocking Deque: " + LBD); // prints the Deque after removal System.out.println("Size of Linked Blocking Deque: " + LBD.size()); } } Output: Linked Blocking Deque: [15, 20, 20, 15, 15, 20, 20, 15] Size of Linked Blocking Deque: 8 Program 2: Java // Java Program to demonstrate public int size() // 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<String> LBD = new LinkedBlockingDeque<String>(); // Add numbers to end of LinkedBlockingDeque LBD.add("geeks"); LBD.add("forGeeks"); LBD.add("A Computer"); LBD.add("Portal"); // print Dequeue System.out.println("Linked Blocking Deque: " + LBD); // prints the Deque after removal System.out.println("Size of Linked Blocking Deque: " + LBD.size()); } } Output: Linked Blocking Deque: [geeks, forGeeks, A Computer, Portal] Size of Linked Blocking Deque: 4 Reference: https://docs.oracle.com/javase/8/docs/api/java/util/concurrent/LinkedBlockingDeque.html#size-- Comment More infoAdvertise with us Next Article LinkedBlockingDeque size() method in Java 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 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 LinkedBlockingDeque offerLast() method in Java The offerLast(E e) method of LinkedBlockingDeque inserts the element passed in the parameter at the end of the Deque container. If the container's capacity has exceeded, then it does not returns an exception as in case of add() and addLast() function. Syntax: public boolean offerLast(E e) Parameters 2 min read LinkedBlockingDeque pollLast() method in Java The pollLast() method of LinkedBlockingDeque returns the last element in the Deque container, and deletes it. It returns null if the container is empty. Syntax: public E pollLast() Parameters: This method does not accept any parameters. Returns: This method returns last element in the Deque containe 2 min read LinkedBlockingDeque pollFirst() method in Java The pollFirst() 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 pollFirst() Parameters: This method does not accept any parameters. Returns: This method returns front element in the Deque cont 2 min read LinkedBlockingDeque addLast() method in Java 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 2 min read LinkedBlockingDeque removeLast() method in Java The removeLast() method of LinkedBlockingDeque returns and removes the element at tail of the Deque container. The method throws an NoSuchElementException if the Deque container is empty. Syntax: public E removeLast() Parameters: This method does not accepts any parameter. Returns: This method retur 2 min read LinkedBlockingDeque remove() method in Java The remove() method of LinkedBlockingDeque removes the head of the Deque container. The method throws a NoSuchElementException if the Deque container is empty. Syntax: public E remove() Parameters: This method does not accepts any parameter. Returns: This method does not returns anything. Exception: 2 min read 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 metho 2 min read Like