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