Sorting TreeSet Using Comparator
From Java Example Source Code
Contents |
[edit] Overview - Sorting TreeSet Using Comparator
This Java example program introduces a sorting TreeSet using Comparator.
[edit] Java Source Code
- Package: example.set
- File: Comp.java
package example.set; import java.util.Collections; import java.util.Set; import java.util.TreeSet; public class Comp { public static void main(String args[]) throws Exception { String elements[] = { "Irish Setter", "Poodle", "English Setter", "Gordon Setter", "Pug" }; 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()); } }
[edit] What Result You Can Get
Run the program, you will get:
[Pug, Poodle, Irish Setter, Gordon Setter, English Setter] java.util.Collections$ReverseComparator@f62373
[edit] Required External Libraries and/or Files for this Java Example
Need nothing.
http://www.ase2009.com/ online casino 132 http://www.hellzyea.com/health health insurance 8DDD http://www.yourautoinsurancesite.com/ auto insurance quotes 135811 http://www.makemeasammich.com/ auto insurance mcnxu
[edit] Question & Answer
Any question?
Click edit and post your question or answer here.
