Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Showing content from https://www.geeksforgeeks.org/java/navigableset-descendingiterator-method-in-java/ below:

NavigableSet descendingIterator() method in Java

Last Updated : 11 Jul, 2025

The descendingIterator() method of

is used to return an iterator over the elements in this set, in descending order. This iterator can be then used to iterate over the elements of the set. The iterator returned by this set is also equivalent to descendingSet().iterator().

:

Iterator<E> descendingIterator()

Where, E is the type of elements maintained by this Set container.

: This function does not accepts any parameter.

: It returns an iterator over the set of elements contained in this set container in descending order. Below programs illustrate the descendingIterator() method in Java:

: NavigableSet with integer elements.

// A Java program to demonstrate
// descendingIterator() method of NavigableSet

import java.util.NavigableSet;
import java.util.TreeSet;
import java.util.*;

public class GFG {
    public static void main(String[] args)
    {
        NavigableSet<Integer> ns = new TreeSet<>();
        ns.add(0);
        ns.add(1);
        ns.add(2);
        ns.add(3);
        ns.add(4);
        ns.add(5);
        ns.add(6);

        Iterator<Integer> itr = ns.descendingIterator();

        // Iterate over the elements using itr
        while (itr.hasNext()) {
            System.out.println("Value: " + itr.next() + " ");
        }
    }
}

Value: 6 
Value: 5 
Value: 4 
Value: 3 
Value: 2 
Value: 1 
Value: 0

NavigableSet with string elements.

// A Java program to illustrate iterator()
// method of NavigableSet
import java.util.NavigableSet;
import java.util.TreeSet;
import java.util.*;

public class GFG {
    public static void main(String[] args)
    {
        NavigableSet<String> ns = new TreeSet<>();
        ns.add("A");
        ns.add("B");
        ns.add("C");
        ns.add("D");
        ns.add("E");
        ns.add("F");
        ns.add("G");

        Iterator<String> itr = ns.descendingIterator();

        // Iterate over the elements using itr
        while (itr.hasNext()) {
            System.out.println("Value: " + itr.next() + " ");
        }
    }
}

Value: G 
Value: F 
Value: E 
Value: D 
Value: C 
Value: B 
Value: A

:

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4