Lines Matching refs:ASSERT
5 #include "assert.h"
58 ASSERT(trie.num_tries() == 0);
59 ASSERT(trie.num_keys() == 0);
60 ASSERT(trie.num_nodes() == 0);
61 ASSERT(trie.total_size() == (sizeof(marisa_alpha::UInt32) * 23));
65 ASSERT(trie.num_tries() == 1);
66 ASSERT(trie.num_keys() == 0);
67 ASSERT(trie.num_nodes() == 1);
79 ASSERT(trie.num_tries() == 1);
80 ASSERT(trie.num_keys() == 4);
81 ASSERT(trie.num_nodes() == 11);
83 ASSERT(key_ids.size() == 5);
84 ASSERT(key_ids[0] == 3);
85 ASSERT(key_ids[1] == 1);
86 ASSERT(key_ids[2] == 0);
87 ASSERT(key_ids[3] == 3);
88 ASSERT(key_ids[4] == 2);
95 ASSERT(trie[keys[i]] == key_ids[i]);
96 ASSERT(trie[key_ids[i]] == keys[i]);
97 ASSERT(key_length == keys[i].length());
98 ASSERT(keys[i] == key_buf);
103 ASSERT(trie.num_tries() == 0);
104 ASSERT(trie.num_keys() == 0);
105 ASSERT(trie.num_nodes() == 0);
106 ASSERT(trie.total_size() == (sizeof(marisa_alpha::UInt32) * 23));
111 ASSERT(trie.num_tries() == 1);
112 ASSERT(trie.num_keys() == 4);
113 ASSERT(trie.num_nodes() == 11);
115 ASSERT(key_ids.size() == 5);
116 ASSERT(key_ids[0] == 3);
117 ASSERT(key_ids[1] == 1);
118 ASSERT(key_ids[2] == 2);
119 ASSERT(key_ids[3] == 3);
120 ASSERT(key_ids[4] == 0);
123 ASSERT(trie[keys[i]] == key_ids[i]);
124 ASSERT(trie[key_ids[i]] == keys[i]);
127 ASSERT(trie["appl"] == trie.notfound());
128 ASSERT(trie["applex"] == trie.notfound());
129 ASSERT(trie.find_first("ap") == trie.notfound());
130 ASSERT(trie.find_first("applex") == trie["app"]);
131 ASSERT(trie.find_last("ap") == trie.notfound());
132 ASSERT(trie.find_last("applex") == trie["apple"]);
135 ASSERT(trie.find("ap", &ids) == 0);
136 ASSERT(trie.find("applex", &ids) == 2);
137 ASSERT(ids.size() == 2);
138 ASSERT(ids[0] == trie["app"]);
139 ASSERT(ids[1] == trie["apple"]);
142 ASSERT(trie.find("Baddie", &ids, &lengths) == 1);
143 ASSERT(ids.size() == 3);
144 ASSERT(ids[2] == trie["Bad"]);
145 ASSERT(lengths.size() == 1);
146 ASSERT(lengths[0] == 3);
148 ASSERT(trie.find_callback("anderson", FindCallback(&ids, &lengths)) == 1);
149 ASSERT(ids.size() == 4);
150 ASSERT(ids[3] == trie["and"]);
151 ASSERT(lengths.size() == 2);
152 ASSERT(lengths[1] == 3);
154 ASSERT(trie.predict("") == 4);
155 ASSERT(trie.predict("a") == 3);
156 ASSERT(trie.predict("ap") == 2);
157 ASSERT(trie.predict("app") == 2);
158 ASSERT(trie.predict("appl") == 1);
159 ASSERT(trie.predict("apple") == 1);
160 ASSERT(trie.predict("appleX") == 0);
161 ASSERT(trie.predict("X") == 0);
164 ASSERT(trie.predict("a", &ids) == 3);
165 ASSERT(ids.size() == 3);
166 ASSERT(ids[0] == trie["app"]);
167 ASSERT(ids[1] == trie["and"]);
168 ASSERT(ids[2] == trie["apple"]);
171 ASSERT(trie.predict("a", &ids, &strs) == 3);
172 ASSERT(ids.size() == 6);
173 ASSERT(ids[3] == trie["app"]);
174 ASSERT(ids[4] == trie["apple"]);
175 ASSERT(ids[5] == trie["and"]);
176 ASSERT(strs[0] == "app");
177 ASSERT(strs[1] == "apple");
178 ASSERT(strs[2] == "and");
197 ASSERT(trie.num_tries() == 1);
198 ASSERT(trie.num_keys() == 4);
199 ASSERT(trie.num_nodes() == 7);
206 ASSERT(trie[keys[i]] == key_ids[i]);
207 ASSERT(trie[key_ids[i]] == keys[i]);
208 ASSERT(key_length == keys[i].length());
209 ASSERT(keys[i] == key_buf);
214 ASSERT(key_length == keys[0].length());
219 ASSERT(key_length == keys[0].length());
223 ASSERT(key_length == keys[0].length());
228 ASSERT(trie.num_tries() == 2);
229 ASSERT(trie.num_keys() == 4);
230 ASSERT(trie.num_nodes() == 16);
235 ASSERT(trie[keys[i]] == key_ids[i]);
236 ASSERT(trie[key_ids[i]] == keys[i]);
237 ASSERT(key_length == keys[i].length());
238 ASSERT(keys[i] == key_buf);
243 ASSERT(key_length == keys[0].length());
248 ASSERT(key_length == keys[0].length());
252 ASSERT(key_length == keys[0].length());
257 ASSERT(trie.num_tries() == 2);
258 ASSERT(trie.num_keys() == 4);
259 ASSERT(trie.num_nodes() == 14);
264 ASSERT(trie[keys[i]] == key_ids[i]);
265 ASSERT(trie[key_ids[i]] == keys[i]);
266 ASSERT(key_length == keys[i].length());
267 ASSERT(keys[i] == key_buf);
275 ASSERT(mapper.is_open());
276 ASSERT(trie.num_tries() == 2);
277 ASSERT(trie.num_keys() == 4);
278 ASSERT(trie.num_nodes() == 14);
283 ASSERT(trie[keys[i]] == key_ids[i]);
284 ASSERT(trie[key_ids[i]] == keys[i]);
285 ASSERT(key_length == keys[i].length());
286 ASSERT(keys[i] == key_buf);
294 ASSERT(trie.num_tries() == 2);
295 ASSERT(trie.num_keys() == 4);
296 ASSERT(trie.num_nodes() == 14);
301 ASSERT(trie[keys[i]] == key_ids[i]);
302 ASSERT(trie[key_ids[i]] == keys[i]);
303 ASSERT(key_length == keys[i].length());
304 ASSERT(keys[i] == key_buf);
310 ASSERT(trie.num_tries() == 3);
311 ASSERT(trie.num_keys() == 4);
312 ASSERT(trie.num_nodes() == 19);
317 ASSERT(trie[keys[i]] == key_ids[i]);
318 ASSERT(trie[key_ids[i]] == keys[i]);
319 ASSERT(key_length == keys[i].length());
320 ASSERT(keys[i] == key_buf);
323 ASSERT(trie["ca"] == trie.notfound());
324 ASSERT(trie["card"] == trie.notfound());
327 ASSERT(trie.find_first("ca") == trie.notfound());
328 ASSERT(trie.find_first("car") == trie["car"]);
329 ASSERT(trie.find_first("card", &length) == trie["car"]);
330 ASSERT(length == 3);
332 ASSERT(trie.find_last("afte") == trie.notfound());
333 ASSERT(trie.find_last("after") == trie["after"]);
334 ASSERT(trie.find_last("afternoon", &length) == trie["after"]);
335 ASSERT(length == 5);
340 ASSERT(trie.find("card", &ids, &lengths) == 1);
341 ASSERT(ids.size() == 1);
342 ASSERT(ids[0] == trie["car"]);
343 ASSERT(lengths.size() == 1);
344 ASSERT(lengths[0] == 3);
346 ASSERT(trie.predict("ca", &ids) == 2);
347 ASSERT(ids.size() == 3);
348 ASSERT(ids[1] == trie["car"]);
349 ASSERT(ids[2] == trie["caster"]);
351 ASSERT(trie.predict("ca", &ids, NULL, 1) == 1);
352 ASSERT(ids.size() == 4);
353 ASSERT(ids[3] == trie["car"]);
356 ASSERT(trie.predict("ca", &ids, &strs, 1) == 1);
357 ASSERT(ids.size() == 5);
358 ASSERT(ids[4] == trie["car"]);
359 ASSERT(strs.size() == 1);
360 ASSERT(strs[0] == "car");
362 ASSERT(trie.predict_callback("", PredictCallback(&ids, &strs)) == 4);
363 ASSERT(ids.size() == 9);
364 ASSERT(ids[5] == trie["car"]);
365 ASSERT(ids[6] == trie["caster"]);
366 ASSERT(ids[7] == trie["after"]);
367 ASSERT(ids[8] == trie["bar"]);
368 ASSERT(strs.size() == 5);
369 ASSERT(strs[1] == "car");
370 ASSERT(strs[2] == "caster");
371 ASSERT(strs[3] == "after");
372 ASSERT(strs[4] == "bar");
378 ASSERT(trie.find("card", ids, lengths, 10) == 1);
379 ASSERT(ids[0] == trie["car"]);
380 ASSERT(lengths[0] == 3);
382 ASSERT(trie.predict("ca", ids, NULL, 10) == 2);
383 ASSERT(ids[0] == trie["car"]);
384 ASSERT(ids[1] == trie["caster"]);
386 ASSERT(trie.predict("ca", ids, NULL, 1) == 1);
387 ASSERT(ids[0] == trie["car"]);
390 ASSERT(trie.predict("ca", ids, strs, 1) == 1);
391 ASSERT(ids[0] == trie["car"]);
392 ASSERT(strs[0] == "car");
394 ASSERT(trie.predict("", ids, strs, 10) == 4);
395 ASSERT(ids[0] == trie["car"]);
396 ASSERT(ids[1] == trie["caster"]);
397 ASSERT(ids[2] == trie["after"]);
398 ASSERT(ids[3] == trie["bar"]);
399 ASSERT(strs[0] == "car");
400 ASSERT(strs[1] == "caster");
401 ASSERT(strs[2] == "after");
402 ASSERT(strs[3] == "bar");
408 ASSERT(trie.num_tries() == 2);
409 ASSERT(trie.num_keys() == 4);
410 ASSERT(trie.num_nodes() == 14);
415 ASSERT(trie[keys[i]] == key_ids[i]);
416 ASSERT(trie[key_ids[i]] == keys[i]);
417 ASSERT(key_length == keys[i].length());
418 ASSERT(keys[i] == key_buf);
438 ASSERT(trie.num_tries() == 1);
439 ASSERT(trie.num_keys() == 4);
440 ASSERT(trie.num_nodes() == 7);
442 ASSERT(key_ids.size() == 5);
443 ASSERT(key_ids[0] == 2);
444 ASSERT(key_ids[1] == 3);
445 ASSERT(key_ids[2] == 1);
446 ASSERT(key_ids[3] == 0);
447 ASSERT(key_ids[4] == 0);
454 ASSERT(trie[keys[i]] == key_ids[i]);
455 ASSERT(trie[key_ids[i]] == keys[i]);
456 ASSERT(key_length == keys[i].length());
457 ASSERT(keys[i] == key_buf);
462 ASSERT(trie.num_tries() == 2);
463 ASSERT(trie.num_keys() == 4);
464 ASSERT(trie.num_nodes() == 17);
469 ASSERT(trie[keys[i]] == key_ids[i]);
470 ASSERT(trie[key_ids[i]] == keys[i]);
471 ASSERT(key_length == keys[i].length());
472 ASSERT(keys[i] == key_buf);
477 ASSERT(trie.num_tries() == 2);
478 ASSERT(trie.num_keys() == 4);
479 ASSERT(trie.num_nodes() == 14);
484 ASSERT(trie[keys[i]] == key_ids[i]);
485 ASSERT(trie[key_ids[i]] == keys[i]);
486 ASSERT(key_length == keys[i].length());
487 ASSERT(keys[i] == key_buf);
492 ASSERT(trie.num_tries() == 3);
493 ASSERT(trie.num_keys() == 4);
494 ASSERT(trie.num_nodes() == 20);
499 ASSERT(trie[keys[i]] == key_ids[i]);
500 ASSERT(trie[key_ids[i]] == keys[i]);
501 ASSERT(key_length == keys[i].length());
502 ASSERT(keys[i] == key_buf);
510 ASSERT(trie.num_tries() == 3);
511 ASSERT(trie.num_keys() == 4);
512 ASSERT(trie.num_nodes() == 20);
517 ASSERT(trie[keys[i]] == key_ids[i]);
518 ASSERT(trie[key_ids[i]] == keys[i]);
519 ASSERT(key_length == keys[i].length());
520 ASSERT(keys[i] == key_buf);
536 ASSERT(trie.num_tries() == 1);
537 ASSERT(trie.num_keys() == 1);
538 ASSERT(trie.num_nodes() == 1);
540 ASSERT(key_ids.size() == 1);
541 ASSERT(key_ids[0] == 0);
543 ASSERT(trie[""] == 0);
544 ASSERT(trie[(marisa_alpha::UInt32)0] == "");
546 ASSERT(trie["x"] == trie.notfound());
547 ASSERT(trie.find_first("") == 0);
548 ASSERT(trie.find_first("x") == 0);
549 ASSERT(trie.find_last("") == 0);
550 ASSERT(trie.find_last("x") == 0);
553 ASSERT(trie.find("xyz", &ids) == 1);
554 ASSERT(ids.size() == 1);
555 ASSERT(ids[0] == trie[""]);
558 ASSERT(trie.find("xyz", &ids, &lengths) == 1);
559 ASSERT(ids.size() == 2);
560 ASSERT(ids[0] == trie[""]);
561 ASSERT(ids[1] == trie[""]);
562 ASSERT(lengths.size() == 1);
563 ASSERT(lengths[0] == 0);
565 ASSERT(trie.find_callback("xyz", FindCallback(&ids, &lengths)) == 1);
566 ASSERT(ids.size() == 3);
567 ASSERT(ids[2] == trie[""]);
568 ASSERT(lengths.size() == 2);
569 ASSERT(lengths[1] == 0);
571 ASSERT(trie.predict("xyz", &ids) == 0);
573 ASSERT(trie.predict("", &ids) == 1);
574 ASSERT(ids.size() == 4);
575 ASSERT(ids[3] == trie[""]);
578 ASSERT(trie.predict("", &ids, &strs) == 1);
579 ASSERT(ids.size() == 5);
580 ASSERT(ids[4] == trie[""]);
581 ASSERT(strs[0] == "");
600 ASSERT(trie.num_tries() == 1);
601 ASSERT(trie.num_keys() == 1);
602 ASSERT(trie.num_nodes() == 8);
603 ASSERT(key_ids.size() == 1);
609 ASSERT(trie[keys[0]] == key_ids[0]);
610 ASSERT(trie[key_ids[0]] == keys[0]);
611 ASSERT(std::string(key_buf, key_length) == keys[0]);
616 ASSERT(trie.num_tries() == 1);
617 ASSERT(trie.num_keys() == 1);
618 ASSERT(trie.num_nodes() == 2);
619 ASSERT(key_ids.size() == 1);
623 ASSERT(trie[keys[0]] == key_ids[0]);
624 ASSERT(trie[key_ids[0]] == keys[0]);
625 ASSERT(std::string(key_buf, key_length) == keys[0]);
630 ASSERT(trie.num_tries() == 1);
631 ASSERT(trie.num_keys() == 1);
632 ASSERT(trie.num_nodes() == 2);
633 ASSERT(key_ids.size() == 1);
637 ASSERT(trie[keys[0]] == key_ids[0]);
638 ASSERT(trie[key_ids[0]] == keys[0]);
639 ASSERT(std::string(key_buf, key_length) == keys[0]);
642 ASSERT(trie.predict_breadth_first("", &ids) == 1);
643 ASSERT(ids.size() == 1);
644 ASSERT(ids[0] == key_ids[0]);
647 ASSERT(trie.predict_depth_first("NP", &ids, &strs) == 1);
648 ASSERT(ids.size() == 2);
649 ASSERT(ids[1] == key_ids[0]);
650 ASSERT(strs[0] == keys[0]);
