Example of the java.util.TreeSet.descendingSet() method

In this article we will see how to sort a TreeSet in descending order using the java.util.TreeSet.descendingSet().

The descendingSet() is used to return a view of the elements contained in that Set in reverse order. The descending order of the set is returned by this method.

This example shows the implementation of the descendingSet():

import java.util.Iterator; 
import java.util.TreeSet; 

public class Tri_decroissant {
 public static void main(String[] args) {
 // create a TreeSet
 TreeSet  tset = new TreeSet(); 
 TreeSet  tsetreverse = new TreeSet(); 
 
 // add elements
 tset.add(10); 
 tset.add(3); 
 tset.add(18); 
 tset.add(7); 
 
 // creating the inverse tsetreverse 
 tsetreverse=(TreeSet)tset.descendingSet(); 
 
 // browse in descending order
 Iterator iterator = tsetreverse.iterator(); 
 
 // display data from TreeSet
 System.out.println("TreeSet elements in descending order: "); 
 while (iterator.hasNext()){
 System.out.println(iterator.next() + " "); 
 }
 } 
}

After this code is compiled and executed, this is what will happen in output:

TreeSet elements in descending order:  
18 
10 
7 
3 

Reference:
Javadoc: descendingSet() TreeSet method