Home
last modified time | relevance | path

Searched refs:tail_match (Results 1 – 7 of 7) sorted by relevance

/external/marisa-trie/v0_1_5/lib/marisa_alpha/
Dtrie-search.cc407 next_pos = tail_match<T>(node, get_link_id(node), query, pos); in trie_match()
428 next_pos = tail_match<T>(node, get_link_id(node), query, pos); in trie_match()
450 std::size_t Trie::tail_match(UInt32 node, UInt32 link_id, in tail_match() function in marisa_alpha::Trie
475 template std::size_t Trie::tail_match<CQuery>(UInt32 node,
477 template std::size_t Trie::tail_match<const Query &>(UInt32 node,
Dtrie-inline.h165 tail_match<T>(node, link_id, query, pos); in find_child()
Dtrie.h249 std::size_t tail_match(UInt32 node, UInt32 link_id,
/external/marisa-trie/lib/marisa/
Dtrie-search.cc388 next_pos = tail_match<T>(node, get_link_id(node), query, pos); in trie_match()
409 next_pos = tail_match<T>(node, get_link_id(node), query, pos); in trie_match()
431 std::size_t Trie::tail_match(UInt32 node, UInt32 link_id, in tail_match() function in marisa::Trie
456 template std::size_t Trie::tail_match<CQuery>(UInt32 node,
458 template std::size_t Trie::tail_match<const Query &>(UInt32 node,
Dtrie-inline.h164 tail_match<T>(node, link_id, query, pos); in find_child()
Dtrie.h249 std::size_t tail_match(UInt32 node, UInt32 link_id,
/external/marisa-trie/
Dandroid_diff.txt446 @@ -468,7 +460,7 @@ template std::size_t Trie::tail_match<const Query &>(UInt32 node,