LinkedBlockingDeque iterator() method in Java Last Updated : 14 Sep, 2018 Comments Improve Suggest changes Like Article Like Report The iterator() method of LinkedBlockingDeque returns an iterator over the elements in this deque in a proper sequence. The elements will be returned in order from first (head) to last (tail). The returned iterator is a "weakly consistent" iterator. Syntax: public Iterator iterator() Parameters: This method does not accept any parameter. Returns: This method returns an iterator over the elements in this deque in a proper sequence. Below programs illustrate iterator() method of LinkedBlockingDeque: Program 1: Java // Java Program Demonstrate iterator() // method of LinkedBlockingDeque import java.util.concurrent.LinkedBlockingDeque; import java.util.*; public class GFG { public static void main(String[] args) { // create object of LinkedBlockingDeque LinkedBlockingDeque<Integer> LBD = new LinkedBlockingDeque<Integer>(); // Add numbers to front of LinkedBlockingDeque LBD.addFirst(7855642); LBD.addFirst(35658786); LBD.addFirst(5278367); LBD.addFirst(74381793); // Call iterator() method of LinkedBlockingDeque Iterator iteratorVals = LBD.iterator(); // Print elements of iterator // created from PriorityBlockingQueue System.out.println("The iterator values" + " of LinkedBlockingDeque are:"); // prints the elements using an iterator while (iteratorVals.hasNext()) { System.out.println(iteratorVals.next()); } } } Output: The iterator values of LinkedBlockingDeque are: 74381793 5278367 35658786 7855642 Program 2: Java // Java Program Demonstrate iterator() // method of LinkedBlockingDeque // when list is of strings import java.util.concurrent.LinkedBlockingDeque; import java.util.*; public class GFG { public static void main(String[] args) { // create object of LinkedBlockingDeque LinkedBlockingDeque<String> LBD = new LinkedBlockingDeque<String>(); // Add numbers to front of LinkedBlockingDeque LBD.add("Geeks"); LBD.add("forGeeks"); LBD.add("A"); LBD.add("Computer"); LBD.add("Portal"); // Call iterator() method of LinkedBlockingDeque Iterator iteratorVals = LBD.iterator(); // Print elements of iterator // created from PriorityBlockingQueue System.out.println("The iterator values" + " of LinkedBlockingDeque are:"); // prints the elements using an iterator while (iteratorVals.hasNext()) { System.out.println(iteratorVals.next()); } } } Output: The iterator values of LinkedBlockingDeque are: Geeks forGeeks A Computer Portal Reference: https://docs.oracle.com/javase/7/docs/api/java/util/concurrent/LinkedBlockingDeque.html#iterator() Comment More infoAdvertise with us Next Article LinkedBlockingDeque peekLast() 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 add() method in Java The add(E e) method of LinkedBlockingDeque inserts the element passed in the parameter to the end of the Deque is there is space. If the LinkedBlockingDeque is capacity restricted and no space is left for insertion, it returns an IllegalStateException. It works exactly in the same way as addLast() m 2 min read LinkedBlockingDeque in Java with Examples The LinkedBlockingDeque class in Java is a part of the Java Collection Framework. It was introduced in JDK 1.6 and it belongs to java.util.concurrent package. It is a Deque(Doubly Ended Queue) which blocks a thread if that thread tries to take elements out of it while the Deque is empty. It implemen 14 min read LinkedBlockingDeque iterator() method in Java The iterator() method of LinkedBlockingDeque returns an iterator over the elements in this deque in a proper sequence. The elements will be returned in order from first (head) to last (tail). The returned iterator is a "weakly consistent" iterator. Syntax: public Iterator iterator() Parameters: This 2 min read LinkedBlockingDeque peekLast() method in Java The peekLast() method of LinkedBlockingDeque returns the last element in the Deque container, but does not deletes it. It returns null if the container is empty. Syntax: public E peekLast() Parameters: This method does not accept any parameters. Returns: This method returns last element in the Deque 2 min read LinkedBlockingDeque offer() method in Java The offer(E e) method of LinkedBlockingDeque inserts the element passed in the parameter to the end of the Deque. 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 offer(E e) Parameters: This method acc 2 min read LinkedBlockingDeque element() method in Java The element() method of LinkedBlockingDeque returns the element at the front the container. It does not deletes the element in the container. This method returns the head of the queue represented by this deque. Syntax: public void element() Parameters: This method does not accept any parameter. Retu 2 min read LinkedBlockingDeque addFirst() method in Java The addFirst(E e) method of LinkedBlockingDeque 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 IllegalStateException. Syntax: public void addFirst(E e) Parame 2 min read LinkedBlockingDeque pop() method in Java The pop() method of LinkedBlockingDeque pops an element from the stack represented by this deque. In other words, it removes and returns the first element of this deque. It returns null if the container is empty. Syntax: public E pop() Parameters: This method does not accept any parameters. Returns: 2 min read 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 Like