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::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()
78 ASSERT(trie.num_tries() == 1); in TestTrie()
79 ASSERT(trie.num_keys() == 4); in TestTrie()
80 ASSERT(trie.num_nodes() == 11); in TestTrie()
82 ASSERT(key_ids.size() == 5); in TestTrie()
83 ASSERT(key_ids[0] == 3); in TestTrie()
84 ASSERT(key_ids[1] == 1); in TestTrie()
85 ASSERT(key_ids[2] == 0); in TestTrie()
86 ASSERT(key_ids[3] == 3); in TestTrie()
87 ASSERT(key_ids[4] == 2); in TestTrie()
94 ASSERT(trie[keys[i]] == key_ids[i]); in TestTrie()
95 ASSERT(trie[key_ids[i]] == keys[i]); in TestTrie()
96 ASSERT(key_length == keys[i].length()); in TestTrie()
97 ASSERT(keys[i] == key_buf); in TestTrie()
102 ASSERT(trie.num_tries() == 0); in TestTrie()
103 ASSERT(trie.num_keys() == 0); in TestTrie()
104 ASSERT(trie.num_nodes() == 0); in TestTrie()
105 ASSERT(trie.total_size() == (sizeof(marisa::UInt32) * 23)); in TestTrie()
109 ASSERT(trie.num_tries() == 1); in TestTrie()
110 ASSERT(trie.num_keys() == 4); in TestTrie()
111 ASSERT(trie.num_nodes() == 11); in TestTrie()
113 ASSERT(key_ids.size() == 5); in TestTrie()
114 ASSERT(key_ids[0] == 3); in TestTrie()
115 ASSERT(key_ids[1] == 1); in TestTrie()
116 ASSERT(key_ids[2] == 2); in TestTrie()
117 ASSERT(key_ids[3] == 3); in TestTrie()
118 ASSERT(key_ids[4] == 0); in TestTrie()
121 ASSERT(trie[keys[i]] == key_ids[i]); in TestTrie()
122 ASSERT(trie[key_ids[i]] == keys[i]); in TestTrie()
125 ASSERT(trie["appl"] == trie.notfound()); in TestTrie()
126 ASSERT(trie["applex"] == trie.notfound()); in TestTrie()
127 ASSERT(trie.find_first("ap") == trie.notfound()); in TestTrie()
128 ASSERT(trie.find_first("applex") == trie["app"]); in TestTrie()
129 ASSERT(trie.find_last("ap") == trie.notfound()); in TestTrie()
130 ASSERT(trie.find_last("applex") == trie["apple"]); in TestTrie()
133 ASSERT(trie.find("ap", &ids) == 0); in TestTrie()
134 ASSERT(trie.find("applex", &ids) == 2); in TestTrie()
135 ASSERT(ids.size() == 2); in TestTrie()
136 ASSERT(ids[0] == trie["app"]); in TestTrie()
137 ASSERT(ids[1] == trie["apple"]); in TestTrie()
140 ASSERT(trie.find("Baddie", &ids, &lengths) == 1); in TestTrie()
141 ASSERT(ids.size() == 3); in TestTrie()
142 ASSERT(ids[2] == trie["Bad"]); in TestTrie()
143 ASSERT(lengths.size() == 1); in TestTrie()
144 ASSERT(lengths[0] == 3); in TestTrie()
146 ASSERT(trie.find_callback("anderson", FindCallback(&ids, &lengths)) == 1); in TestTrie()
147 ASSERT(ids.size() == 4); in TestTrie()
148 ASSERT(ids[3] == trie["and"]); in TestTrie()
149 ASSERT(lengths.size() == 2); in TestTrie()
150 ASSERT(lengths[1] == 3); in TestTrie()
152 ASSERT(trie.predict("") == 4); in TestTrie()
153 ASSERT(trie.predict("a") == 3); in TestTrie()
154 ASSERT(trie.predict("ap") == 2); in TestTrie()
155 ASSERT(trie.predict("app") == 2); in TestTrie()
156 ASSERT(trie.predict("appl") == 1); in TestTrie()
157 ASSERT(trie.predict("apple") == 1); in TestTrie()
158 ASSERT(trie.predict("appleX") == 0); in TestTrie()
159 ASSERT(trie.predict("X") == 0); in TestTrie()
162 ASSERT(trie.predict("a", &ids) == 3); in TestTrie()
163 ASSERT(ids.size() == 3); in TestTrie()
164 ASSERT(ids[0] == trie["app"]); in TestTrie()
165 ASSERT(ids[1] == trie["and"]); in TestTrie()
166 ASSERT(ids[2] == trie["apple"]); in TestTrie()
169 ASSERT(trie.predict("a", &ids, &strs) == 3); in TestTrie()
170 ASSERT(ids.size() == 6); in TestTrie()
171 ASSERT(ids[3] == trie["app"]); in TestTrie()
172 ASSERT(ids[4] == trie["apple"]); in TestTrie()
173 ASSERT(ids[5] == trie["and"]); in TestTrie()
174 ASSERT(strs[0] == "app"); in TestTrie()
175 ASSERT(strs[1] == "apple"); in TestTrie()
176 ASSERT(strs[2] == "and"); in TestTrie()
195 ASSERT(trie.num_tries() == 1); in TestPrefixTrie()
196 ASSERT(trie.num_keys() == 4); in TestPrefixTrie()
197 ASSERT(trie.num_nodes() == 7); in TestPrefixTrie()
204 ASSERT(trie[keys[i]] == key_ids[i]); in TestPrefixTrie()
205 ASSERT(trie[key_ids[i]] == keys[i]); in TestPrefixTrie()
206 ASSERT(key_length == keys[i].length()); in TestPrefixTrie()
207 ASSERT(keys[i] == key_buf); in TestPrefixTrie()
212 ASSERT(key_length == keys[0].length()); in TestPrefixTrie()
217 ASSERT(key_length == keys[0].length()); in TestPrefixTrie()
221 ASSERT(key_length == keys[0].length()); in TestPrefixTrie()
226 ASSERT(trie.num_tries() == 2); in TestPrefixTrie()
227 ASSERT(trie.num_keys() == 4); in TestPrefixTrie()
228 ASSERT(trie.num_nodes() == 16); in TestPrefixTrie()
233 ASSERT(trie[keys[i]] == key_ids[i]); in TestPrefixTrie()
234 ASSERT(trie[key_ids[i]] == keys[i]); in TestPrefixTrie()
235 ASSERT(key_length == keys[i].length()); in TestPrefixTrie()
236 ASSERT(keys[i] == key_buf); in TestPrefixTrie()
241 ASSERT(key_length == keys[0].length()); in TestPrefixTrie()
246 ASSERT(key_length == keys[0].length()); in TestPrefixTrie()
250 ASSERT(key_length == keys[0].length()); in TestPrefixTrie()
255 ASSERT(trie.num_tries() == 2); in TestPrefixTrie()
256 ASSERT(trie.num_keys() == 4); in TestPrefixTrie()
257 ASSERT(trie.num_nodes() == 14); in TestPrefixTrie()
262 ASSERT(trie[keys[i]] == key_ids[i]); in TestPrefixTrie()
263 ASSERT(trie[key_ids[i]] == keys[i]); in TestPrefixTrie()
264 ASSERT(key_length == keys[i].length()); in TestPrefixTrie()
265 ASSERT(keys[i] == key_buf); in TestPrefixTrie()
273 ASSERT(mapper.is_open()); in TestPrefixTrie()
274 ASSERT(trie.num_tries() == 2); in TestPrefixTrie()
275 ASSERT(trie.num_keys() == 4); in TestPrefixTrie()
276 ASSERT(trie.num_nodes() == 14); in TestPrefixTrie()
281 ASSERT(trie[keys[i]] == key_ids[i]); in TestPrefixTrie()
282 ASSERT(trie[key_ids[i]] == keys[i]); in TestPrefixTrie()
283 ASSERT(key_length == keys[i].length()); in TestPrefixTrie()
284 ASSERT(keys[i] == key_buf); in TestPrefixTrie()
292 ASSERT(trie.num_tries() == 2); in TestPrefixTrie()
293 ASSERT(trie.num_keys() == 4); in TestPrefixTrie()
294 ASSERT(trie.num_nodes() == 14); in TestPrefixTrie()
299 ASSERT(trie[keys[i]] == key_ids[i]); in TestPrefixTrie()
300 ASSERT(trie[key_ids[i]] == keys[i]); in TestPrefixTrie()
301 ASSERT(key_length == keys[i].length()); in TestPrefixTrie()
302 ASSERT(keys[i] == key_buf); in TestPrefixTrie()
308 ASSERT(trie.num_tries() == 3); in TestPrefixTrie()
309 ASSERT(trie.num_keys() == 4); in TestPrefixTrie()
310 ASSERT(trie.num_nodes() == 19); in TestPrefixTrie()
315 ASSERT(trie[keys[i]] == key_ids[i]); in TestPrefixTrie()
316 ASSERT(trie[key_ids[i]] == keys[i]); in TestPrefixTrie()
317 ASSERT(key_length == keys[i].length()); in TestPrefixTrie()
318 ASSERT(keys[i] == key_buf); in TestPrefixTrie()
321 ASSERT(trie["ca"] == trie.notfound()); in TestPrefixTrie()
322 ASSERT(trie["card"] == trie.notfound()); in TestPrefixTrie()
325 ASSERT(trie.find_first("ca") == trie.notfound()); in TestPrefixTrie()
326 ASSERT(trie.find_first("car") == trie["car"]); in TestPrefixTrie()
327 ASSERT(trie.find_first("card", &length) == trie["car"]); in TestPrefixTrie()
328 ASSERT(length == 3); in TestPrefixTrie()
330 ASSERT(trie.find_last("afte") == trie.notfound()); in TestPrefixTrie()
331 ASSERT(trie.find_last("after") == trie["after"]); in TestPrefixTrie()
332 ASSERT(trie.find_last("afternoon", &length) == trie["after"]); in TestPrefixTrie()
333 ASSERT(length == 5); in TestPrefixTrie()
338 ASSERT(trie.find("card", &ids, &lengths) == 1); in TestPrefixTrie()
339 ASSERT(ids.size() == 1); in TestPrefixTrie()
340 ASSERT(ids[0] == trie["car"]); in TestPrefixTrie()
341 ASSERT(lengths.size() == 1); in TestPrefixTrie()
342 ASSERT(lengths[0] == 3); in TestPrefixTrie()
344 ASSERT(trie.predict("ca", &ids) == 2); in TestPrefixTrie()
345 ASSERT(ids.size() == 3); in TestPrefixTrie()
346 ASSERT(ids[1] == trie["car"]); in TestPrefixTrie()
347 ASSERT(ids[2] == trie["caster"]); in TestPrefixTrie()
349 ASSERT(trie.predict("ca", &ids, NULL, 1) == 1); in TestPrefixTrie()
350 ASSERT(ids.size() == 4); in TestPrefixTrie()
351 ASSERT(ids[3] == trie["car"]); in TestPrefixTrie()
354 ASSERT(trie.predict("ca", &ids, &strs, 1) == 1); in TestPrefixTrie()
355 ASSERT(ids.size() == 5); in TestPrefixTrie()
356 ASSERT(ids[4] == trie["car"]); in TestPrefixTrie()
357 ASSERT(strs.size() == 1); in TestPrefixTrie()
358 ASSERT(strs[0] == "car"); in TestPrefixTrie()
360 ASSERT(trie.predict_callback("", PredictCallback(&ids, &strs)) == 4); in TestPrefixTrie()
361 ASSERT(ids.size() == 9); in TestPrefixTrie()
362 ASSERT(ids[5] == trie["car"]); in TestPrefixTrie()
363 ASSERT(ids[6] == trie["caster"]); in TestPrefixTrie()
364 ASSERT(ids[7] == trie["after"]); in TestPrefixTrie()
365 ASSERT(ids[8] == trie["bar"]); in TestPrefixTrie()
366 ASSERT(strs.size() == 5); in TestPrefixTrie()
367 ASSERT(strs[1] == "car"); in TestPrefixTrie()
368 ASSERT(strs[2] == "caster"); in TestPrefixTrie()
369 ASSERT(strs[3] == "after"); in TestPrefixTrie()
370 ASSERT(strs[4] == "bar"); in TestPrefixTrie()
376 ASSERT(trie.find("card", ids, lengths, 10) == 1); in TestPrefixTrie()
377 ASSERT(ids[0] == trie["car"]); in TestPrefixTrie()
378 ASSERT(lengths[0] == 3); in TestPrefixTrie()
380 ASSERT(trie.predict("ca", ids, NULL, 10) == 2); in TestPrefixTrie()
381 ASSERT(ids[0] == trie["car"]); in TestPrefixTrie()
382 ASSERT(ids[1] == trie["caster"]); in TestPrefixTrie()
384 ASSERT(trie.predict("ca", ids, NULL, 1) == 1); in TestPrefixTrie()
385 ASSERT(ids[0] == trie["car"]); in TestPrefixTrie()
388 ASSERT(trie.predict("ca", ids, strs, 1) == 1); in TestPrefixTrie()
389 ASSERT(ids[0] == trie["car"]); in TestPrefixTrie()
390 ASSERT(strs[0] == "car"); in TestPrefixTrie()
392 ASSERT(trie.predict("", ids, strs, 10) == 4); in TestPrefixTrie()
393 ASSERT(ids[0] == trie["car"]); in TestPrefixTrie()
394 ASSERT(ids[1] == trie["caster"]); in TestPrefixTrie()
395 ASSERT(ids[2] == trie["after"]); in TestPrefixTrie()
396 ASSERT(ids[3] == trie["bar"]); in TestPrefixTrie()
397 ASSERT(strs[0] == "car"); in TestPrefixTrie()
398 ASSERT(strs[1] == "caster"); in TestPrefixTrie()
399 ASSERT(strs[2] == "after"); in TestPrefixTrie()
400 ASSERT(strs[3] == "bar"); in TestPrefixTrie()
420 ASSERT(trie.num_tries() == 1); in TestPatriciaTrie()
421 ASSERT(trie.num_keys() == 4); in TestPatriciaTrie()
422 ASSERT(trie.num_nodes() == 7); in TestPatriciaTrie()
424 ASSERT(key_ids.size() == 5); in TestPatriciaTrie()
425 ASSERT(key_ids[0] == 2); in TestPatriciaTrie()
426 ASSERT(key_ids[1] == 3); in TestPatriciaTrie()
427 ASSERT(key_ids[2] == 1); in TestPatriciaTrie()
428 ASSERT(key_ids[3] == 0); in TestPatriciaTrie()
429 ASSERT(key_ids[4] == 0); in TestPatriciaTrie()
436 ASSERT(trie[keys[i]] == key_ids[i]); in TestPatriciaTrie()
437 ASSERT(trie[key_ids[i]] == keys[i]); in TestPatriciaTrie()
438 ASSERT(key_length == keys[i].length()); in TestPatriciaTrie()
439 ASSERT(keys[i] == key_buf); in TestPatriciaTrie()
444 ASSERT(trie.num_tries() == 2); in TestPatriciaTrie()
445 ASSERT(trie.num_keys() == 4); in TestPatriciaTrie()
446 ASSERT(trie.num_nodes() == 17); in TestPatriciaTrie()
451 ASSERT(trie[keys[i]] == key_ids[i]); in TestPatriciaTrie()
452 ASSERT(trie[key_ids[i]] == keys[i]); in TestPatriciaTrie()
453 ASSERT(key_length == keys[i].length()); in TestPatriciaTrie()
454 ASSERT(keys[i] == key_buf); in TestPatriciaTrie()
459 ASSERT(trie.num_tries() == 2); in TestPatriciaTrie()
460 ASSERT(trie.num_keys() == 4); in TestPatriciaTrie()
461 ASSERT(trie.num_nodes() == 14); in TestPatriciaTrie()
466 ASSERT(trie[keys[i]] == key_ids[i]); in TestPatriciaTrie()
467 ASSERT(trie[key_ids[i]] == keys[i]); in TestPatriciaTrie()
468 ASSERT(key_length == keys[i].length()); in TestPatriciaTrie()
469 ASSERT(keys[i] == key_buf); in TestPatriciaTrie()
474 ASSERT(trie.num_tries() == 3); in TestPatriciaTrie()
475 ASSERT(trie.num_keys() == 4); in TestPatriciaTrie()
476 ASSERT(trie.num_nodes() == 20); in TestPatriciaTrie()
481 ASSERT(trie[keys[i]] == key_ids[i]); in TestPatriciaTrie()
482 ASSERT(trie[key_ids[i]] == keys[i]); in TestPatriciaTrie()
483 ASSERT(key_length == keys[i].length()); in TestPatriciaTrie()
484 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()
518 ASSERT(trie.num_tries() == 1); in TestEmptyString()
519 ASSERT(trie.num_keys() == 1); in TestEmptyString()
520 ASSERT(trie.num_nodes() == 1); in TestEmptyString()
522 ASSERT(key_ids.size() == 1); in TestEmptyString()
523 ASSERT(key_ids[0] == 0); in TestEmptyString()
525 ASSERT(trie[""] == 0); in TestEmptyString()
526 ASSERT(trie[(marisa::UInt32)0] == ""); in TestEmptyString()
528 ASSERT(trie["x"] == trie.notfound()); in TestEmptyString()
529 ASSERT(trie.find_first("") == 0); in TestEmptyString()
530 ASSERT(trie.find_first("x") == 0); in TestEmptyString()
531 ASSERT(trie.find_last("") == 0); in TestEmptyString()
532 ASSERT(trie.find_last("x") == 0); in TestEmptyString()
535 ASSERT(trie.find("xyz", &ids) == 1); in TestEmptyString()
536 ASSERT(ids.size() == 1); in TestEmptyString()
537 ASSERT(ids[0] == trie[""]); in TestEmptyString()
540 ASSERT(trie.find("xyz", &ids, &lengths) == 1); in TestEmptyString()
541 ASSERT(ids.size() == 2); in TestEmptyString()
542 ASSERT(ids[0] == trie[""]); in TestEmptyString()
543 ASSERT(ids[1] == trie[""]); in TestEmptyString()
544 ASSERT(lengths.size() == 1); in TestEmptyString()
545 ASSERT(lengths[0] == 0); in TestEmptyString()
547 ASSERT(trie.find_callback("xyz", FindCallback(&ids, &lengths)) == 1); in TestEmptyString()
548 ASSERT(ids.size() == 3); in TestEmptyString()
549 ASSERT(ids[2] == trie[""]); in TestEmptyString()
550 ASSERT(lengths.size() == 2); in TestEmptyString()
551 ASSERT(lengths[1] == 0); in TestEmptyString()
553 ASSERT(trie.predict("xyz", &ids) == 0); in TestEmptyString()
555 ASSERT(trie.predict("", &ids) == 1); in TestEmptyString()
556 ASSERT(ids.size() == 4); in TestEmptyString()
557 ASSERT(ids[3] == trie[""]); in TestEmptyString()
560 ASSERT(trie.predict("", &ids, &strs) == 1); in TestEmptyString()
561 ASSERT(ids.size() == 5); in TestEmptyString()
562 ASSERT(ids[4] == trie[""]); in TestEmptyString()
563 ASSERT(strs[0] == ""); in TestEmptyString()
582 ASSERT(trie.num_tries() == 1); in TestBinaryKey()
583 ASSERT(trie.num_keys() == 1); in TestBinaryKey()
584 ASSERT(trie.num_nodes() == 8); in TestBinaryKey()
585 ASSERT(key_ids.size() == 1); in TestBinaryKey()
591 ASSERT(trie[keys[0]] == key_ids[0]); in TestBinaryKey()
592 ASSERT(trie[key_ids[0]] == keys[0]); in TestBinaryKey()
593 ASSERT(std::string(key_buf, key_length) == keys[0]); in TestBinaryKey()
597 ASSERT(trie.num_tries() == 1); in TestBinaryKey()
598 ASSERT(trie.num_keys() == 1); in TestBinaryKey()
599 ASSERT(trie.num_nodes() == 2); in TestBinaryKey()
600 ASSERT(key_ids.size() == 1); in TestBinaryKey()
604 ASSERT(trie[keys[0]] == key_ids[0]); in TestBinaryKey()
605 ASSERT(trie[key_ids[0]] == keys[0]); in TestBinaryKey()
606 ASSERT(std::string(key_buf, key_length) == keys[0]); in TestBinaryKey()
610 ASSERT(trie.num_tries() == 1); in TestBinaryKey()
611 ASSERT(trie.num_keys() == 1); in TestBinaryKey()
612 ASSERT(trie.num_nodes() == 2); in TestBinaryKey()
613 ASSERT(key_ids.size() == 1); in TestBinaryKey()
617 ASSERT(trie[keys[0]] == key_ids[0]); in TestBinaryKey()
618 ASSERT(trie[key_ids[0]] == keys[0]); in TestBinaryKey()
619 ASSERT(std::string(key_buf, key_length) == keys[0]); in TestBinaryKey()
622 ASSERT(trie.predict_breadth_first("", &ids) == 1); in TestBinaryKey()
623 ASSERT(ids.size() == 1); in TestBinaryKey()
624 ASSERT(ids[0] == key_ids[0]); in TestBinaryKey()
627 ASSERT(trie.predict_depth_first("NP", &ids, &strs) == 1); in TestBinaryKey()
628 ASSERT(ids.size() == 2); in TestBinaryKey()
629 ASSERT(ids[1] == key_ids[0]); in TestBinaryKey()
630 ASSERT(strs[0] == keys[0]); in TestBinaryKey()