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
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
|
package bjc.utils.esodata;
import bjc.utils.funcdata.FunctionalMap;
import bjc.utils.funcdata.IMap;
import com.google.common.collect.HashMultimap;
import com.google.common.collect.SetMultimap;
import java.util.Arrays;
import java.util.HashSet;
import java.util.Set;
/**
* Represents a mapping from a set of strings to a mapping of all unambiguous
* prefixes of their respective strings.
*
* This works the same as Ruby's Abbrev.
*
* @author EVE
*
*/
public class AbbrevMap {
/*
* All of the words we have abbreviations for.
*/
private Set<String> wrds;
/*
* Maps abbreviations to their strings.
*/
private IMap<String, String> abbrevMap;
/*
* Counts how many times we've seen a substring.
*/
private Set<String> seen;
/*
* Maps ambiguous abbreviations to the strings they could be.
*/
private SetMultimap<String, String> ambMap;
/**
* Create a new abbreviation map.
*
* @param words
* The initial set of words to put in the map.
*/
public AbbrevMap(String... words) {
wrds = new HashSet<>(Arrays.asList(words));
recalculate();
}
/**
* Recalculate all the abbreviations in this map.
*/
public void recalculate() {
abbrevMap = new FunctionalMap<>();
ambMap = HashMultimap.create();
seen = new HashSet<>();
for(String word : wrds) {
/*
* A word always abbreviates to itself.
*/
abbrevMap.put(word, word);
intAddWord(word);
}
}
/**
* Adds words to the abbreviation map.
*
* @param words
* The words to add to the abbreviation map.
*/
public void addWords(String... words) {
wrds.addAll(Arrays.asList(words));
for(String word : words) {
/*
* A word always abbreviates to itself.
*/
abbrevMap.put(word, word);
intAddWord(word);
}
}
/*
* Actually add abbreviations of a word.
*/
private void intAddWord(String word) {
/*
* Skip blank words.
*/
if(word.equals("")) return;
/*
* Handle each possible abbreviation.
*/
for(int i = word.length(); i > 0; i--) {
String subword = word.substring(0, i);
if(seen.contains(subword)) {
/*
* Remove a mapping if its ambiguous and not a
* whole word.
*/
if(abbrevMap.containsKey(subword) && !wrds.contains(subword)) {
String oldword = abbrevMap.remove(subword);
ambMap.put(subword, oldword);
ambMap.put(subword, word);
} else if(!wrds.contains(subword)) {
ambMap.put(subword, word);
}
} else {
seen.add(subword);
abbrevMap.put(subword, word);
}
}
}
/**
* Removes words from the abbreviation map.
*
* NOTE: There may be inconsistent behavior. Use
* {@link AbbrevMap#recalculate()} to fix it if it occurs.
*
* @param words
* The words to remove.
*/
public void removeWords(String... words) {
wrds.removeAll(Arrays.asList(words));
for(String word : words) {
intRemoveWord(word);
}
}
/*
* Actually remove a word.
*/
private void intRemoveWord(String word) {
/*
* Skip blank words.
*/
if(word.equals("")) return;
/*
* Handle each possible abbreviation.
*/
for(int i = word.length(); i > 0; i--) {
String subword = word.substring(0, i);
if(abbrevMap.containsKey(subword))
abbrevMap.remove(subword);
else {
ambMap.remove(subword, word);
Set<String> possWords = ambMap.get(subword);
if(possWords.size() == 0) {
seen.remove(subword);
} else if(possWords.size() == 1) {
String newWord = possWords.iterator().next();
abbrevMap.put(subword, newWord);
ambMap.remove(subword, newWord);
}
}
}
}
/**
* Convert an abbreviation into all the strings it could abbreviate
* into.
*
* @param abbrev
* The abbreviation to convert.
*
* @return All the expansions for the provided abbreviation.
*/
public String[] deabbrev(String abbrev) {
if(abbrevMap.containsKey(abbrev))
return new String[] { abbrevMap.get(abbrev) };
else
return ambMap.get(abbrev).toArray(new String[0]);
}
@Override
public int hashCode() {
final int prime = 31;
int result = 1;
result = prime * result + ((wrds == null) ? 0 : wrds.hashCode());
return result;
}
@Override
public boolean equals(Object obj) {
if(this == obj) return true;
if(obj == null) return false;
if(getClass() != obj.getClass()) return false;
AbbrevMap other = (AbbrevMap) obj;
if(wrds == null) {
if(other.wrds != null) return false;
} else if(!wrds.equals(other.wrds)) return false;
return true;
}
@Override
public String toString() {
StringBuilder builder = new StringBuilder();
builder.append("AbbrevMap [wrds=");
builder.append(wrds);
builder.append("\n\t, abbrevMap=");
builder.append(abbrevMap);
builder.append("\n\t, seen=");
builder.append(seen);
builder.append("\n\t, ambMap=");
builder.append(ambMap);
builder.append("]");
return builder.toString();
}
}
|
