Newer
Older
package tests.gitlab.ckpt1;
import java.util.Arrays;
import java.util.Comparator;
import java.util.HashMap;
import java.util.Map;
import java.util.function.Supplier;
import cse332.datastructures.containers.Item;
import cse332.interfaces.misc.Dictionary;
import cse332.types.AlphabeticString;
import cse332.types.NGram;
import cse332.datastructures.trees.BinarySearchTree;
import p2.wordsuggestor.NGramToNextChoicesMap;
import tests.TestsUtility;
public class NGramToNextChoicesMapTests extends TestsUtility {
private static Supplier<Dictionary<NGram, Dictionary<AlphabeticString, Integer>>> newOuter =
() -> new BinarySearchTree();
private static Supplier<Dictionary<AlphabeticString, Integer>> newInner =
() -> new BinarySearchTree();
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
public static void main(String[] args) {
new NGramToNextChoicesMapTests().run();
}
@Override
protected void run() {
SHOW_TESTS = true;
PRINT_TESTERR = true;
DEBUG = true;
test("testOneWordPerNGram");
test("testMultipleWordsPerNGram");
test("testGetNonexistentNGram");
test("testRepeatedWordsPerNGram");
finish();
}
protected static NGramToNextChoicesMap init() {
return new NGramToNextChoicesMap(newOuter, newInner);
}
public static int testOneWordPerNGram() {
NGramToNextChoicesMap map = init();
NGram[] ngrams = new NGram[]{
new NGram(new String[]{"foo", "bar", "baz"}),
new NGram(new String[]{"fee", "fi", "fo"}),
new NGram(new String[]{"a", "s", "d"})
};
String[] words = new String[]{"bop", "fum", "f"};
for (int i = 0; i < ngrams.length; i++) {
map.seenWordAfterNGram(ngrams[i], words[i]);
}
for (int i = 0; i < ngrams.length; i++) {
Item<String, Integer>[] items = map.getCountsAfter(ngrams[i]);
if (items.length != 1) return 0;
Item<String, Integer> item = items[0];
if (!item.key.equals(words[i])) return 0;
if (!item.value.equals(1)) return 0;
}
return 1;
}
public static int testMultipleWordsPerNGram() {
NGramToNextChoicesMap map = init();
NGram[] ngrams = new NGram[]{
new NGram(new String[]{"foo", "bar", "baz"}),
new NGram(new String[]{"fee", "fi", "fo"}),
new NGram(new String[]{"four", "score", "and"}),
new NGram(new String[]{"3", "2", "2"}),
new NGram(new String[]{"a", "s", "d"})
};
String[][] words = new String[][] {
new String[]{"bip", "bop", "bzp"},
new String[]{"fum", "giants"},
new String[]{"ago", "seven", "years"},
new String[]{"new", "thrown", "uuu", "zzz"},
new String[]{"do", "for", "while"}
};
for (int i = 0; i < ngrams.length; i++) {
for (int j = 0; j < words[i].length; j++) {
map.seenWordAfterNGram(ngrams[i], words[i][j]);
}
}
for (int i = 0; i < ngrams.length; i++) {
Item<String, Integer>[] items = map.getCountsAfter(ngrams[i]);
String[] answer = words[i];
if (items.length != answer.length) return 0;
String[] itemsWithoutCounts = new String[items.length];
for (int j = 0; j < answer.length; j++) {
if (items[j].value != 1) return 0;
itemsWithoutCounts[j] = items[j].key;
}
Arrays.sort(itemsWithoutCounts);
for (int j = 0; j < answer.length; j++) {
if (!itemsWithoutCounts[j].equals(answer[j])) return 0;
}
}
return 1;
}
public static int testGetNonexistentNGram() {
NGramToNextChoicesMap map = init();
NGram[] ngrams = new NGram[]{
new NGram(new String[]{"foo", "bar", "baz"}),
new NGram(new String[]{"fee", "fi", "fo"}),
new NGram(new String[]{"a", "s", "d"})
};
String[] words = new String[]{"bop", "fum", "f"};
for (int i = 0; i < ngrams.length; i++) {
map.seenWordAfterNGram(ngrams[i], words[i]);
}
Item<String, Integer>[] items = map.getCountsAfter(new NGram(new String[] { "yo" }));
if (items == null || items.length != 0) {
return 0;
}
return 1;
}
// TODO: Not finished yet
@SuppressWarnings("unchecked")
public static int testRepeatedWordsPerNGram() {
NGramToNextChoicesMap map = init();
NGram[] ngrams = new NGram[]{
new NGram(new String[]{"foo", "bar", "baz"}),
new NGram(new String[]{"fee", "fi", "fo"}),
new NGram(new String[]{"four", "score", "and"}),
new NGram(new String[]{"3", "2", "2"}),
new NGram(new String[]{"a", "s", "d"})
};
String[][] words = new String[][] {
new String[]{"bop", "bip", "boop", "bop", "bop"},
new String[]{"fum", "giants", "giants"},
new String[]{"seven", "years", "years", "ago", "ago"},
new String[]{"throw", "throw", "throw", "throw", "throw"},
new String[]{"for", "while", "do", "do", "while", "for"}
};
// yes this is awful, but i can't think of a better way to do it atm
Map<NGram, Item<String, Integer>[]> answers = new HashMap<>();
answers.put(ngrams[0], (Item<String, Integer>[]) new Item[3]);
answers.get(ngrams[0])[0] = new Item<String, Integer>("bip", 1);
answers.get(ngrams[0])[1] = new Item<String, Integer>("boop", 1);
answers.get(ngrams[0])[2] = new Item<String, Integer>("bop", 3);
answers.put(ngrams[1], (Item<String, Integer>[]) new Item[2]);
answers.get(ngrams[1])[0] = new Item<String, Integer>("fum", 1);
answers.get(ngrams[1])[1] = new Item<String, Integer>("giants", 2);
answers.put(ngrams[2], (Item<String, Integer>[]) new Item[3]);
answers.get(ngrams[2])[0] = new Item<String, Integer>("ago", 2);
answers.get(ngrams[2])[1] = new Item<String, Integer>("seven", 1);
answers.get(ngrams[2])[2] = new Item<String, Integer>("years", 2);
answers.put(ngrams[3], (Item<String, Integer>[]) new Item[1]);
answers.get(ngrams[3])[0] = new Item<String, Integer>("throw", 5);
answers.put(ngrams[4], (Item<String, Integer>[]) new Item[3]);
answers.get(ngrams[4])[0] = new Item<String, Integer>("do", 2);
answers.get(ngrams[4])[1] = new Item<String, Integer>("for", 2);
answers.get(ngrams[4])[2] = new Item<String, Integer>("while", 2);
for (int i = 0; i < ngrams.length; i++) {
for (int j = 0; j < words[i].length; j++) {
map.seenWordAfterNGram(ngrams[i], words[i][j]);
}
}
for (int i = 0; i < ngrams.length; i++) {
NGram ngram = ngrams[i];
Item<String, Integer>[] results = map.getCountsAfter(ngram);
Arrays.sort(results, new Comparator<Object>() {
@Override
public int compare(Object o1, Object o2) {
Item<String, Integer> r1 = (Item<String, Integer>)o1;
Item<String, Integer> r2 = (Item<String, Integer>)o2;
return r1.key.compareTo(r2.key);
}
});
Item<String, Integer>[] expected = answers.get(ngram);
if (results.length != expected.length) return 0;
for (int j = 0; j < expected.length; j++) {
if (!expected[j].key.equals(results[j].key)) {
return 0;
}
if (expected[j].value != results[j].value) {
return 0;
}
}
}
return 1;
}
}