-
Notifications
You must be signed in to change notification settings - Fork 10
/
Copy pathPairContainer.java
111 lines (56 loc) · 1.68 KB
/
PairContainer.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
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
105
106
107
108
109
110
111
import java.util.HashMap;
import java.util.HashSet;
/*Used to get pairs of words
* Handles storage of pairs
*/
public class PairContainer {
private HashMap<String, HashMap<String, Integer>> wordMap = new HashMap(); //Maps word to a hashmap of words to occ rate
//Has occ rates
public HashSet<Pair> getPairs() {
HashSet<Pair> pairs = new HashSet();
for (String word1: wordMap.keySet()) {
for (String word2: wordMap.get(word1).keySet()) {
if (word1.compareTo(word2) < 0) {
Pair newPair = new Pair(word1, word2, wordMap.get(word1).get(word2));
pairs.add(newPair);
}
}
}
return pairs;
}
public void addPair(Pair pair) {
String word1 = pair.getWord1();
String word2 = pair.getWord2();
//Adds a mapping from both word1 to word2 and word2 to word1
//No point in mapping a word to itself
if (word1.equals(word2)) {
return;
}
if (!wordMap.containsKey(word1)) {
HashMap<String, Integer> tempMap = new HashMap();
tempMap.put(word2, 1);
wordMap.put(word1, tempMap);
} else {
HashMap<String, Integer> oldMap = wordMap.get(word1);
if (oldMap.containsKey(word2)) {
oldMap.put(word2, oldMap.get(word2) + 1);
} else {
oldMap.put(word2, 1);
}
wordMap.put(word1, oldMap);
}
if (!wordMap.containsKey(word2)) {
HashMap<String, Integer> tempMap = new HashMap();
tempMap.put(word1, 1);
wordMap.put(word2, tempMap);
} else {
HashMap<String, Integer> oldMap = wordMap.get(word2);
if (oldMap.containsKey(word1)) {
oldMap.put(word1, oldMap.get(word1) + 1);
} else {
oldMap.put(word1, 1);
}
wordMap.put(word2, oldMap);
}
}
}