Cross Reference: /external/marisa-trie/tests/trie-test.cc

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