We would like to know how to create TreeSet(Sorted Set) with reversed order comparator.
import java.util.Collections; import java.util.Set; import java.util.TreeSet; /*w w w .j a va 2 s . c o m*/ public class Main { public static void main(String args[]) throws Exception { String elements[] = { "A", "C", "D", "G", "F" }; Set set = new TreeSet(Collections.reverseOrder()); for (int i = 0, n = elements.length; i < n; i++) { set.add(elements[i]); } System.out.println(set); System.out.println(((TreeSet) set).comparator()); } }
The code above generates the following result.