Home
last modified time | relevance | path

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

/external/marisa-trie/v0_1_5/lib/marisa_alpha/
Dtrie-search.cc400 std::size_t Trie::trie_match(UInt32 node, T query, in trie_match() function in marisa_alpha::Trie
405 next_pos = trie_->trie_match<T>(get_link(node), query, pos); in trie_match()
426 next_pos = trie_->trie_match<T>(get_link(node), query, pos); in trie_match()
444 template std::size_t Trie::trie_match<CQuery>(UInt32 node,
446 template std::size_t Trie::trie_match<const Query &>(UInt32 node,
Dtrie-inline.h164 trie_->trie_match<T>(get_link(node, link_id), query, pos) : in find_child()
Dtrie.h247 std::size_t trie_match(UInt32 node, T query, std::size_t pos) const;
/external/marisa-trie/lib/marisa/
Dtrie-search.cc381 std::size_t Trie::trie_match(UInt32 node, T query, in trie_match() function in marisa::Trie
386 next_pos = trie_->trie_match<T>(get_link(node), query, pos); in trie_match()
407 next_pos = trie_->trie_match<T>(get_link(node), query, pos); in trie_match()
425 template std::size_t Trie::trie_match<CQuery>(UInt32 node,
427 template std::size_t Trie::trie_match<const Query &>(UInt32 node,
Dtrie-inline.h163 trie_->trie_match<T>(get_link(node, link_id), query, pos) : in find_child()
Dtrie.h247 std::size_t trie_match(UInt32 node, T query, std::size_t pos) const;