Home
last modified time | relevance | path

Searched refs:trie_prefix_match (Results 1 – 6 of 6) sorted by relevance

/external/marisa-trie/lib/marisa/
Dtrie-search.cc655 std::size_t Trie::trie_prefix_match(UInt32 node, T query, in trie_prefix_match() function in marisa::Trie
660 next_pos = trie_->trie_prefix_match<T>(get_link(node), query, pos, key); in trie_prefix_match()
685 next_pos = trie_->trie_prefix_match<T>( in trie_prefix_match()
705 template std::size_t Trie::trie_prefix_match<CQuery>(UInt32 node,
707 template std::size_t Trie::trie_prefix_match<const Query &>(UInt32 node,
Dtrie-inline.h214 trie_->trie_prefix_match<T>( in predict_child()
Dtrie.h275 std::size_t trie_prefix_match(UInt32 node, T query,
/external/marisa-trie/v0_1_5/lib/marisa_alpha/
Dtrie-search.cc686 std::size_t Trie::trie_prefix_match(UInt32 node, T query, in trie_prefix_match() function in marisa_alpha::Trie
691 next_pos = trie_->trie_prefix_match<T>(get_link(node), query, pos, key); in trie_prefix_match()
716 next_pos = trie_->trie_prefix_match<T>( in trie_prefix_match()
736 template std::size_t Trie::trie_prefix_match<CQuery>(UInt32 node,
738 template std::size_t Trie::trie_prefix_match<const Query &>(UInt32 node,
Dtrie-inline.h219 trie_->trie_prefix_match<T>( in predict_child()
Dtrie.h275 std::size_t trie_prefix_match(UInt32 node, T query,