Sorting a HashMap containing Pair/tuple

Question

Hi. I am trying to sort a HashMap looking like this:
Map<String,Pair<Double,Double>> For sorting it with the "key", all I needed to do was to make a TreeSet of it.
But any hints on how I can sort it on both my pair.getFirst() and another sort for pair.getSecond()?

Answer 1

Simplified and not compiled, just to give you a direction:
Collection<Pair<Double, Double>> col = hm.values();
List<Pair<Double, Double>> list = new ArrayList<Pair<Double, Double>>(col);
Comparator<Pair<Double, Double>> comp1 = new PairComparator1();
Collections.sort(list, comp1);
Comparator<Pair<Double, Double>> comp2 = new PairComparator2();
Collections.sort(list, comp2);Note that PairComparator1and PairComparator2 must implement Comparator<Pair> and you need to write these classes.
1 would compare based on the first value, 2 on the second value.
Check Comparator's javadoc.
Edited by: baftos on Jan 15, 2013 1:39 PM
Edited by: baftos on Jan 15, 2013 1:41 PM