ConcurrentLinkedDeque descendingIterator() method in Java with Example
Last Updated :
24 Dec, 2018
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:
import java.util.concurrent.*;
import java.util.*;
public class ConcurrentLinkedDequeDemo {
public static void main(String args[])
{
ConcurrentLinkedDeque<String> de_que
= new ConcurrentLinkedDeque<String>();
de_que.add( "Welcome" );
de_que.add( "To" );
de_que.add( "Geeks" );
de_que.add( "4" );
de_que.add( "Geeks" );
System.out.println( "ConcurrentLinkedDeque: " + de_que);
Iterator value = de_que.descendingIterator();
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:
Geeks
4
Geeks
To
Welcome
Program 2:
import java.util.*;
import java.util.concurrent.*;
public class ConcurrentLinkedDequeDemo {
public static void main(String args[])
{
ConcurrentLinkedDeque<Integer> de_que
= new ConcurrentLinkedDeque<Integer>();
de_que.add( 10 );
de_que.add( 15 );
de_que.add( 30 );
de_que.add( 20 );
de_que.add( 5 );
System.out.println( "ConcurrentLinkedDeque: " + de_que);
Iterator value = de_que.descendingIterator();
System.out.println( "The iterator values are: " );
while (value.hasNext()) {
System.out.println(value.next());
}
}
}
|
Output:
ConcurrentLinkedDeque: [10, 15, 30, 20, 5]
The iterator values are:
5
20
30
15
10
Share your thoughts in the comments
Please Login to comment...