The descendingIterator() method of LinkedBlockingDeque returns an iterator over the elements in this deque in a reverse sequential order. The elements will be returned in order from last(tail) to first(head). The returned iterator is a “weakly consistent” iterator.
Syntax:
public Iterator descendingIterator()
Parameters: This method does not accept any parameter.
Returns: This method returns an iterator over the elements in this deque in a reverse sequential order.
Below programs illustrate descendingIterator() method of LinkedBlockingDeque:
Program 1:
import java.util.concurrent.LinkedBlockingDeque;
import java.util.*;
public class GFG {
public static void main(String[] args)
{
LinkedBlockingDeque<Integer> LBD
= new LinkedBlockingDeque<Integer>();
LBD.addFirst( 7855642 );
LBD.addFirst( 35658786 );
LBD.addFirst( 5278367 );
LBD.addFirst( 74381793 );
Iterator iteratorVals = LBD.descendingIterator();
System.out.println( "The iterator values"
+ " of LinkedBlockingDeque are:" );
while (iteratorVals.hasNext()) {
System.out.println(iteratorVals.next());
}
}
}
|
Output:
The iterator values of LinkedBlockingDeque are:
7855642
35658786
5278367
74381793
Program 2:
import java.util.concurrent.LinkedBlockingDeque;
import java.util.*;
public class GFG {
public static void main(String[] args)
{
LinkedBlockingDeque<String> LBD
= new LinkedBlockingDeque<String>();
LBD.add( "Geeks" );
LBD.add( "forGeeks" );
LBD.add( "A" );
LBD.add( "Computer" );
LBD.add( "Portal" );
Iterator iteratorVals = LBD.descendingIterator();
System.out.println( "The iterator values"
+ " of LinkedBlockingDeque are:" );
while (iteratorVals.hasNext()) {
System.out.println(iteratorVals.next());
}
}
}
|
Output:
The iterator values of LinkedBlockingDeque are:
Portal
Computer
A
forGeeks
Geeks
Reference: https://docs.oracle.com/javase/7/docs/api/java/util/concurrent/LinkedBlockingDeque.html#descendingIterator()