Home
last modified time | relevance | path

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

/art/tools/dexanalyze/
Ddexanalyze_strings.cc185 class MatchTrie { class
187 MatchTrie* Add(const std::string& str) { in Add()
188 MatchTrie* node = this; in Add()
193 MatchTrie* new_node = new MatchTrie(); in Add()
208 MatchTrie* LongestPrefix(const std::string& str) { in LongestPrefix()
209 MatchTrie* node = this; in LongestPrefix()
220 for (const std::unique_ptr<MatchTrie>& cur_node : nodes_) { in IsLeaf()
235 for (MatchTrie* cur = parent_; cur != nullptr; cur = cur->parent_) { in Savings()
266 std::priority_queue<std::pair<int32_t, MatchTrie*>> queue; in ExtractPrefixes()
268 std::vector<MatchTrie*> work(1, this); in ExtractPrefixes()
[all …]