sorting hashmap values

[shankar vembu]

Hi,
I need a sort a few float values but at the same time keep track of their ids. So i use a hashmap and store id,value pairs. I tried sorting this way :

HashMap results = new HashMap();
// fill up the hashmap.....
SortedSet entrySet = new TreeSet(new _Comparator());
entrySet.addAll(results.entrySet());
Iterator itr = entrySet.iterator();        
while(itr.hasNext()){
   Map.Entry entry = (Map.Entry)itr.next();
   System.out.println(entry.getValue());
}
class _Comparator implements Comparator{        
        public int compare(Object o1, Object o2) {
            Float f1 = (Float)((Map.Entry)o1).getValue();
            Float f2 = (Float)((Map.Entry)o1).getValue();
            return f1.compareTo(f2);
        }        
 }

Is my approach correct?? I only get one element in the iterator eventually wherease my hashmap has around 800 entrries.. Whats wrong with this code. Thanx,
shankar

[Ernest Friedman-Hill]

        public int compare(Object o1, Object o2) {
            Float f1 = (Float)((Map.Entry)o1).getValue();
            Float f2 = (Float)((Map.Entry)o1).getValue();
  typo! **********************************^^
            return f1.compareTo(f2);
        }        

Cut and paste error -- you're comparing o1 to o1, not to o2!
[ October 13, 2003: Message edited by: Ernest Friedman-Hill ]

[shankar vembu]

Originally posted by Ernest Friedman-Hill:
[code]
public int compare(Object o1, Object o2) {
Float f1 = (Float)((Map.Entry)o1).getValue();
Float f2 = (Float)((Map.Entry)o1).getValue();
typo! **********************************^^
return f1.compareTo(f2);
}
[code]
Cut and paste error -- you're comparing o1 to o1, not to o2!

huh, i spent the afternoon learning how to do this and eventually end up making such silly mistakes. thanx a lot anyways, shud have been more careful.it works now.
shankar