help please! sorting hashmap

hi thanks for your advice. here is what ive compiled from forum sources.

HashMap map = new LinkedHashMap();

List mapKeys = new ArrayList(hmap.keySet());

List mapValues = new ArrayList(hmap.values());

hmap.clear();

TreeSet sortedSet = new TreeSet(mapValues);

Object[] sortedArray = sortedSet.toArray();

int size = sortedArray.length;

// a) Ascending sort

for (int i=0; i<size; i++) {

map.put(mapKeys.get(mapValues.indexOf(sortedArray[i])),

sortedArray[i]);

}

i dont think that is the right way to go about returning to a JList

Regards>

sarahsmitha at 2007-7-10 12:14:15 >

Are you trying to make your code as complicated and convoluted as possible? [edit: was referring to OP's code here]

Suppose you have a map "myMap":

Vector data = new ArrayList(myMap.values());

Collections.sort(data, new Comparator() {

public int compare(Object o1, Object o2) {

return ((Comparable)o2).compareTo(o1);

}

});

JList = new JList(data);

I'm pretty certain that'll do it.

Message was edited by:

paulcw

paulcwa at 2007-7-10 12:14:15 >