Home
last modified time | relevance | path

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

/external/marisa-trie/lib/marisa/
Dtrie-inline.h147 inline bool Trie::find_child(UInt32 &node, T query, in find_child() function
193 } while (!query.ends_at(pos) && find_child<T>(node, query, pos)); in find_callback_()
Dtrie-search.cc373 if (!find_child<T>(node, query, pos)) { in lookup_()
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_()
Dtrie.h245 bool find_child(UInt32 &node, T query, std::size_t &pos) const;
/external/marisa-trie/v0_1_5/lib/marisa_alpha/
Dtrie-inline.h148 inline bool Trie::find_child(UInt32 &node, T query, in find_child() function
194 } while (!query.ends_at(pos) && find_child<T>(node, query, pos)); in find_callback_()
Dtrie-search.cc392 if (!find_child<T>(node, query, pos)) { in lookup_()
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_()
Dtrie.h245 bool find_child(UInt32 &node, T query, std::size_t &pos) const;
/external/marisa-trie/
Dandroid_diff.txt358 @@ -179,7 +179,7 @@ inline bool Trie::find_child(UInt32 &node, T query,
369 } while (!query.ends_at(pos) && find_child<T>(node, query, pos));
457 } while (!query.ends_at(pos) && find_child<T>(node, query, pos));