MCPcopy Create free account
hub / github.com/davisking/dlib / dotest2

Function dotest2

dlib/test/parse.cpp:146–203  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

144// ----------------------------------------------------------------------------------------
145
146 void dotest2()
147 {
148 print_spinner();
149 dlog << LINFO << "in dotest2()";
150
151 std::vector<std::string> words;
152 std::vector<tags> sequence;
153 for (int i = 0; i < 8; ++i)
154 {
155 sequence.push_back(DET);
156 sequence.push_back(N);
157 sequence.push_back(V);
158 sequence.push_back(DET);
159 sequence.push_back(N);
160
161 words.push_back("The");
162 words.push_back("flight");
163 words.push_back("includes");
164 words.push_back("a");
165 words.push_back("meal");
166 }
167
168 std::vector<parse_tree_element<tags> > parse_tree;
169
170 find_max_parse_cky(sequence, user_defined_ruleset<false>, parse_tree);
171 DLIB_TEST(parse_tree.size() == 0);
172
173
174 std::vector<unsigned long> roots;
175 find_trees_not_rooted_with_tag(parse_tree, G, roots);
176 DLIB_TEST(roots.size() == 0);
177
178
179 words.clear();
180 sequence.clear();
181
182 for (int i = 0; i < 2; ++i)
183 {
184 sequence.push_back(DET);
185 sequence.push_back(N);
186 sequence.push_back(V);
187 sequence.push_back(DET);
188 sequence.push_back(N);
189
190 words.push_back("The");
191 words.push_back("flight");
192 words.push_back("includes");
193 words.push_back("a");
194 words.push_back("meal");
195 }
196
197 find_max_parse_cky(sequence, user_defined_ruleset<false>, parse_tree);
198 DLIB_TEST(parse_tree.size() == 0);
199
200 sequence.clear();
201 find_max_parse_cky(sequence, user_defined_ruleset<false>, parse_tree);
202 DLIB_TEST(parse_tree.size() == 0);
203 }

Callers 1

perform_testMethod · 0.70

Calls 6

print_spinnerFunction · 0.85
find_max_parse_ckyFunction · 0.85
push_backMethod · 0.45
sizeMethod · 0.45
clearMethod · 0.45

Tested by

no test coverage detected