Home
last modified time | relevance | path

Searched refs:ends_at (Results 1 – 9 of 9) sorted by relevance

/external/marisa-trie/v0_1_5/tests/
Dunit-test.cc343 ASSERT(!query.ends_at(0)); in TestQuery()
346 ASSERT(!query.ends_at(1)); in TestQuery()
349 ASSERT(!query.ends_at(2)); in TestQuery()
351 ASSERT(query.ends_at(3)); in TestQuery()
361 ASSERT(!cquery.ends_at(0)); in TestQuery()
364 ASSERT(!cquery.ends_at(1)); in TestQuery()
367 ASSERT(!cquery.ends_at(2)); in TestQuery()
369 ASSERT(cquery.ends_at(3)); in TestQuery()
/external/marisa-trie/tests/
Dunit-test.cc339 ASSERT(!query.ends_at(0)); in TestQuery()
342 ASSERT(!query.ends_at(1)); in TestQuery()
345 ASSERT(!query.ends_at(2)); in TestQuery()
347 ASSERT(query.ends_at(3)); in TestQuery()
357 ASSERT(!cquery.ends_at(0)); in TestQuery()
360 ASSERT(!cquery.ends_at(1)); in TestQuery()
363 ASSERT(!cquery.ends_at(2)); in TestQuery()
365 ASSERT(cquery.ends_at(3)); in TestQuery()
/external/marisa-trie/v0_1_5/lib/marisa_alpha/
Dquery.h23 bool ends_at(std::size_t i) const { in ends_at() function
48 bool ends_at(std::size_t i) const { in ends_at() function
Dtrie-search.cc391 while (!query.ends_at(pos)) { in lookup_()
420 if (query.ends_at(pos)) { in trie_match()
460 if (query.ends_at(pos + i) || (ptr[i] != query[pos + i])) { in tail_match()
467 if (query.ends_at(pos) || (*ptr != query[pos])) { in tail_match()
501 } while (!query.ends_at(pos) && find_child<T>(node, query, pos)); in find_()
520 } while (!query.ends_at(pos) && find_child<T>(node, query, pos)); in find_first_()
535 } while (!query.ends_at(pos) && find_child<T>(node, query, pos)); in find_last_()
553 while (!query.ends_at(pos)) { in predict_breadth_first_()
628 while (!query.ends_at(pos)) { in predict_depth_first_()
707 if (query.ends_at(pos)) { in trie_prefix_match()
[all …]
Dtrie-inline.h194 } while (!query.ends_at(pos) && find_child<T>(node, query, pos)); in find_callback_()
243 while (!query.ends_at(pos)) { in predict_callback_()
/external/marisa-trie/lib/marisa/
Dquery.h23 bool ends_at(std::size_t i) const { in ends_at() function
48 bool ends_at(std::size_t i) const { in ends_at() function
Dtrie-search.cc372 while (!query.ends_at(pos)) { in lookup_()
401 if (query.ends_at(pos)) { in trie_match()
441 if (query.ends_at(pos + i) || (ptr[i] != query[pos + i])) { in tail_match()
448 if (query.ends_at(pos) || (*ptr != query[pos])) { in tail_match()
482 } while (!query.ends_at(pos) && find_child<T>(node, query, pos)); in find_()
497 } while (!query.ends_at(pos) && find_child<T>(node, query, pos)); in find_first_()
512 } while (!query.ends_at(pos) && find_child<T>(node, query, pos)); in find_last_()
530 while (!query.ends_at(pos)) { in predict_breadth_first_()
601 while (!query.ends_at(pos)) { in predict_depth_first_()
676 if (query.ends_at(pos)) { in trie_prefix_match()
[all …]
Dtrie-inline.h193 } while (!query.ends_at(pos) && find_child<T>(node, query, pos)); in find_callback_()
238 while (!query.ends_at(pos)) { in predict_callback_()
/external/marisa-trie/
Dandroid_diff.txt369 } while (!query.ends_at(pos) && find_child<T>(node, query, pos));
457 } while (!query.ends_at(pos) && find_child<T>(node, query, pos));