ConcurrentLinkedDeque descendingIterator() method in Java with Example

The Java.util.concurrent.ConcurrentLinkedDeque.descendingIterator() method is used to return an iterator of the same elements as the ConcurrentLinkedDeque but in the reverse order.

Syntax:

Iterator iterate_value = Array_Deque.descendingIterator();

Parameters: The method does not take any parameter.



Return Value: The method iterates over the elements of the deque and returns the values(iterators) in reverse order.

Below programs illustrate the Java.util.concurrent.ConcurrentLinkedDeque.descendingIterator() method:

Program 1:

filter_none

edit
close

play_arrow

link
brightness_4
code

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

chevron_right


Output:

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

Program 2:

filter_none

edit
close

play_arrow

link
brightness_4
code

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

chevron_right


Output:

ConcurrentLinkedDeque: [10, 15, 30, 20, 5]
The iterator values are: 
5
20
30
15
10


My Personal Notes arrow_drop_up

Check out this Author's contributed articles.

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.