-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSortMap.java
More file actions
104 lines (99 loc) · 2.88 KB
/
SortMap.java
File metadata and controls
104 lines (99 loc) · 2.88 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
package resourceCode.map.test;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;
import java.util.Iterator;
import java.util.LinkedHashMap;
import java.util.List;
import java.util.Map;
import java.util.TreeMap;
import java.util.Map.Entry;
/**
* Map排序
*
* @author ken 2017-6-8 上午11:36:17
*/
class Sorted implements Comparator<String> {
@Override
public int compare(String o1, String o2) {
return o1.compareToIgnoreCase(o2);
}
}
public class SortMap {
/**
* key值忽略大小排序
* @param map
* @return
* @throws InstantiationException
* @throws IllegalAccessException
* 2017-6-8 下午12:01:44
*/
static Map<String, Object> keySortedMap(Map<String, Object> map)
throws InstantiationException, IllegalAccessException {
/*
* Map<String, Object> storedMap = new TreeMap<String, Object>(
* Sorted.class.newInstance());
*/
Map<String, Object> storedMap = new TreeMap<String, Object>(
new Comparator<String>() {
@Override
public int compare(String o1, String o2) {
return o1.compareToIgnoreCase(o2);
}
});
storedMap.putAll(map);
return storedMap;
}
/**
* value忽略大小排序
* @param originalMap
* @return
* 2017-6-8 下午12:01:56
*/
static Map<String,Object> valueSortedMap(Map<String, Object> originalMap){
Map<String, Object> storedMap = new LinkedHashMap<String, Object>();
List<Map.Entry<String, Object>> entryList = new ArrayList<Map.Entry<String, Object>>(
originalMap.entrySet());
Collections.sort(entryList, new Comparator<Entry<String, Object>>() {
@Override
public int compare(Entry<String, Object> o1,
Entry<String, Object> o2) {
return ((String) o1.getValue()).compareToIgnoreCase((String) o2.getValue());
}
});
Iterator<Entry<String, Object>> set = entryList.iterator();
while (set.hasNext()) {
Entry<String, Object> m = set.next();
storedMap.put(m.getKey(), m.getValue());
}
return storedMap;
}
/**
* 测试方法
* @param args
* 2017-6-8 下午12:02:13
*/
public static void main(String[] args) {
Map<String, Object> map = new TreeMap<String, Object>();
map.put("KFC", "kfc");
map.put("WNBA", "wnba");
map.put("NBA", "nba");
map.put("CBA", "cba");
map.put("ACB", "dCB");
try {
Map<String, Object> resultMap = keySortedMap(map);
for (Entry<String,Object> en : resultMap.entrySet()) {
System.out.println("key="+en.getKey()+",value="+en.getValue());
}
} catch (InstantiationException e) {
e.printStackTrace();
} catch (IllegalAccessException e) {
e.printStackTrace();
}
System.out.println("value 排序");
Map<String, Object> resultMap = valueSortedMap(map);
for (Entry<String,Object> en : resultMap.entrySet()) {
System.out.println("key="+en.getKey()+",value="+en.getValue());
}
}
}