ConcurrentLinkedDeque iterator() method in Java with Example

Last Updated : 24 Dec, 2018

The Java.util.concurrent.ConcurrentLinkedDeque.iterator() method is used to return an iterator of the same elements as that of the ConcurrentLinkedDeque. The elements are returned in random order from what was present in the deque. Syntax:

  Iterator iterate_value = ConcurrentLinkedDeque.iterator();

Parameters: The function does not take any parameter. Return Value: The method iterates over the elements of the deque and returns the values(iterators). Below program illustrates the use of Java.util.concurrent.ConcurrentLinkedDeque.iterator() method: Example 1:

Java

// Java code to illustrate iterator()  import java.util.concurrent.*; import java.util.*;  public class ConcurrentLinkedDequeDemo {     public static void main(String args[])     {         // Creating an empty ConcurrentLinkedDeque         ConcurrentLinkedDeque<String> deque             = new ConcurrentLinkedDeque<String>();          // Use add() method to add elements         // into the ConcurrentLinkedDeque         deque.add("Welcome");         deque.add("To");         deque.add("Geeks");         deque.add("4");         deque.add("Geeks");          // Displaying the ConcurrentLinkedDeque         System.out.println("ConcurrentLinkedDeque: "                            + deque);          // Creating an iterator         Iterator value = deque.iterator();          // Displaying the values         // after iterating through the deque         System.out.println("The iterator values are: ");         while (value.hasNext()) {             System.out.println(value.next());         }     } }

Output:

  ConcurrentLinkedDeque: [Welcome, To, Geeks, 4, Geeks]  The iterator values are:   Welcome  To  Geeks  4  Geeks

Example 2: ConcurrentLinkedDeque with integer elements.

Java

// Java code to illustrate iterator()  import java.util.concurrent.*; import java.util.*;  public class ConcurrentLinkedDequeDemo {     public static void main(String args[])     {         // Creating an empty ConcurrentLinkedDeque         ConcurrentLinkedDeque<Integer> deque             = new ConcurrentLinkedDeque<Integer>();          // Use add() method         // to add elements into the ConcurrentLinkedDeque         deque.add(10);         deque.add(20);         deque.add(30);         deque.add(40);         deque.add(50);          // Displaying the ConcurrentLinkedDeque         System.out.println("ConcurrentLinkedDeque: "                            + deque);          // Creating an iterator         Iterator value = deque.iterator();          // Displaying the values         // after iterating through the deque         System.out.println("The iterator values are: ");         while (value.hasNext()) {             System.out.println(value.next());         }     } }

Output:

  ConcurrentLinkedDeque: [10, 20, 30, 40, 50]  The iterator values are:   10  20  30  40  50

ConcurrentLinkedDeque push() method in Java with Examples

MerlynShelley

Improve

Article Tags :

Practice Tags :

The Java.util.ConcurrentLinkedDeque.pop() method in Java is used to pop an element from the ConcurrentLinkedDeque. The element is popped from the top of the ConcurrentLinkedDeque and is removed from the same.Syntax: ConcurrentLinkedDeque.pop() Parameters: The method does not take any parameters.Retu

2 min read

ConcurrentLinkedDeque poll() method in Java with Example

The poll() method of ConcurrentLinkedDeque 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

2 min read

ConcurrentLinkedDeque peek() method in Java with Example

The java.util.ConcurrentLinkedDeque.peek() method in Java is used to retrieve or fetch the element at the head of the Deque. The element retrieved does not get deleted or removed from the Deque instead the method just returns it. If no element is present in the deque then Null is returned. Syntax: A

2 min read

ConcurrentLinkedDeque push() method in Java with Examples

The push() method of ConcurrentLinkedDeque class is an in-built function in Java which pushes an element onto the stack represented by this deque (in other words, at the head of this deque) if it is possible to do so immediately without violating capacity restrictions, returning true upon success an

2 min read

ConcurrentLinkedDeque equals() method in Java with Example

The equals() method of java.util.ConcurrentLinkedDeque class is used to compare the specified object with this ConcurrentLinkedDeque for equality. Returns true if and only if the specified object is also a ConcurrentLinkedDeque, both ConcurrentLinkedDeques have the same size, and all corresponding p

2 min read

ConcurrentLinkedDeque offer() method in Java with Examples

The java.util.concurrent.ConcurrentLinkedDeque.offer() method is an inbuilt method in Java which inserts the specified element, passed as a parameter, to the deque. Syntax: public boolean offer(E elem) Parameters: The method accepts a parameter elem which species the element to be inserted to the de

2 min read

ConcurrentLinkedQueue iterator() method in Java

The iterator() method of ConcurrentLinkedQueue is used to returns an iterator of the same elements as this ConcurrentLinkedQueue in a proper sequence. The elements returned from this method contains elements in order from first(head) to last(tail). The returned iterator is weakly consistent. Syntax:

2 min read

ConcurrentLinkedDeque addAll() method in Java with Examples

The addAll(Collection col) of ConcurrentLinkedDeque which takes col as a parameter, where col is a Collection of elements (List, ArrayList, LinkedList etc). This entire Collection gets appended or added to the end of the Dequeue. This method just like add() method returns true if the Collection gets

3 min read

ConcurrentLinkedDeque toArray() method in Java with Example

toArray() The Java.util.concurrent.ConcurrentLinkedDeque.toArray() method returns an array containing all the elements in the deque in proper sequence i.e. from first to last. The returned array will be safe as a new array is created (hence new memory is allocated). Thus the caller is free to modify

3 min read

ConcurrentLinkedDeque remove() method in Java with Examples

The java.util.concurrent.ConcurrentLinkedDeque.remove() is an in-built function in Java which is used to remove an element from this deque.Syntax: public E remove() or public boolean remove(Object o) Parameters: The first overload of this method does not accepts any parameter. However the second ove

2 min read

ConcurrentLinkedDeque iterator() method in Java with Example

Similar Reads