The most efficient way if you need to sort the table more than once is to maintain a Hashtable and a Vector of keys.

My coworker emily suggested this:

java.util.SortedMap myMap = new

java.util.TreeMap(new

java.util.Comparator() {

public int compare(Object o1, Object o2) {

return 1;

}

public boolean equals(Object o1, Object o2) {

return o1.equals(o2);

}

}

);
Any thoughts?

I think what you are after is the LinkedHashMap / LinkedHashSet classes, new to the Java 1.4 release. This maintains insertion order.

If all you want to do is sort them based on some key, use a TreeMap.

Hello there!!


I believe you can sort the Hashtable. Use the following sample code from me to sort and print the Hashtable

  public Hashtable htobject = new Hashtable();
............
............

     SortedSet sortedKeys = new TreeSet(htobject.keySet());
     Iterator it = sortedKeys.iterator();
     while ( it.hasNext() ) {
        NaveedClass temp = (NaveedClass)htobject.get((String)it.next());
        System.out.println(temp.toString());
     }

(Replace NaveedClass with your class )


Naveed Azhar

naveed@hotmail.com