/
MapTest.java
43 lines (36 loc) · 1.32 KB
/
MapTest.java
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
import java.util.HashMap;
import java.util.Map;
import java.util.Set;
import java.util.stream.Collectors;
import java.util.stream.IntStream;
public class MapTest {
private void initial(Map<String, Integer> m, int v1, int v2) {
m.put("Key1", v1);
m.put("Key2", v2);
}
private void show_map(Map<String, Integer> m, String name) {
System.out.println("Map - " + name + " : ");
for (String key : m.keySet())
System.out.println(key + " - " + m.get(key));
}
private void show_lack(Map<String, Integer> m, String name) {
Set<Integer> s = IntStream.rangeClosed(1, 3).boxed().collect(Collectors.toSet());
s.removeAll(m.values());
System.out.println("Map " + name + " is lack of values : " + s);
}
public static void main(String[] args) {
MapTest mt = new MapTest();
Map<String, Integer> m1 = new HashMap<String, Integer>();
Map<String, Integer> m2 = new HashMap<String, Integer>();
Map<String, Integer> m3 = new HashMap<String, Integer>();
mt.initial(m1, 1, 2);
mt.initial(m2, 1, 3);
mt.initial(m3, 2, 3);
mt.show_map(m1, "M1");
mt.show_map(m2, "M2");
mt.show_map(m3, "M3");
mt.show_lack(m1, "M1");
mt.show_lack(m2, "M2");
mt.show_lack(m3, "M3");
}
}