Put the values in an array or an array list and just sort it.

An arrayList can't be sorted, and if i sort a normal array then i don't know which string value belonged to them.

i have values like this:

Ne    146
Na    131
a     588
 n    12324
 o    11671
i     110
ge    890
ga    562
fl    200
ff    237
fi    531

and i would like it to be this:

 n    12324
 o    11671
ge    890
a     588
ga    562
fi    531
ff    237
fl    200
Ne    146
Na    131
i     110

I found this, it's for java and atm it doesnt work in processing but i think it's close to working, if someone can take a look then that would be nice.

http://www.lampos.net/sort-hashmap

1. public LinkedHashMap sortHashMapByValuesD(HashMap passedMap) {
       List mapKeys = new ArrayList(passedMap.keySet());
       List mapValues = new ArrayList(passedMap.values());
       Collections.sort(mapValues);
       Collections.sort(mapKeys);
           
       LinkedHashMap sortedMap = 
           new LinkedHashMap();
       
       Iterator valueIt = mapValues.iterator();
       while (valueIt.hasNext()) {
           Object val = valueIt.next();
           Iterator keyIt = mapKeys.iterator();
           
           while (keyIt.hasNext()) {
               Object key = keyIt.next();
               String comp1 = passedMap.get(key).toString();
               String comp2 = val.toString();
               
               if (comp1.equals(comp2)){
                   passedMap.remove(key);
                   mapKeys.remove(key);
                   sortedMap.put((String)key, (Double)val);
                   break;
               }
   
           }
   
       }
       return sortedMap;
   }
   

An arrayList can't be sorted

That's a rather bold statement!  Google seems to have plenty of examples of ArrayList sorting; though admittedly there doesn't appear to be a specific ArrayList.sort() method.

Mind you if sorting is important then it sounds like a TreeMap might be a better option than a HashMap for your purposes anyway ;)

That's a rather bold statement!  Google seems to have plenty of examples of ArrayList sorting; though admittedly there doesn't appear to be a specific ArrayList.sort() method.

I didn't think about that, i only thought of the sort() method for it.

I solved the problem now by looping 659 times over a hashmap with the size of 659.
Not the cleanest method but atleast it works.

I don't want to dive into a treeMap yet.

thx

An array list can be sorted, although the Collection.sort() isn't so obvious to know (except by a little Web search...).
And you mentioned only values, so I supposed the keys weren't important: often they are used only to eliminate duplicates entries (same key).
Indeed, there is the TreeMap, but it sorts on the keys, not on the values.
Once the HashMap is filled, you can iterate on its entries to fill an ArrayList (or a simple array) with objects holding both the key and the value, and that are Comparable (by the value) to allow sorting.

i had this problem too while ago

thanks phil.lho

about
http://stackoverflow.com/questions/109383/how-to-sort-a-mapkey-value-on-the-values-in-java

i get this error:

ClassCastException: letter_kombinaties03$Bigram cannot be cast to java.lang.Comparable

letter_kombinaties03 is the file name
Bigram is a class i use.

I finally start to understand something which i really looked over.
I thought the value was a int or a float but it can also be a object... and i used an object (and still use).

anyway i use this to sort (i only need it printed once):

1. void printSorted() {
   
     int maxValue = MIN_INT;
   
     Iterator i = hm.values().iterator();
     while (i.hasNext()) {
       Bigram w = (Bigram) i.next();
       if (w.count > maxValue) {
         maxValue = w.count;
       }
     }
   
     for(int counter = maxValue; counter > 0; counter--) {
       i = hm.values().iterator();
       while (i.hasNext()) {
         Bigram w = (Bigram) i.next();
         if (w.count == counter) {
           println(w.bigram+"\t"+w.count);
         }
       }
     }
   }