| /aosp12/frameworks/base/core/java/com/google/android/util/ |
| H A D | SmileyResources.java | 19 import com.google.android.util.AbstractMessageParser.TrieNode;
37 TrieNode.addToTrie(smileys, smilies[i], ""); in SmileyResources()
56 private final TrieNode smileys = new TrieNode();
62 public TrieNode getDomainSuffixes() { in getDomainSuffixes()
66 public TrieNode getSmileys() { in getSmileys()
70 public TrieNode getAcronyms() { in getAcronyms()
|
| H A D | AbstractMessageParser.java | 53 public TrieNode getDomainSuffixes(); in getDomainSuffixes()
56 public TrieNode getSmileys(); in getSmileys()
59 public TrieNode getAcronyms(); in getAcronyms()
1352 public static class TrieNode { class in AbstractMessageParser
1358 public TrieNode() { this(""); } in TrieNode() method in AbstractMessageParser.TrieNode
1359 public TrieNode(String text) { in TrieNode() method in AbstractMessageParser.TrieNode
1368 public TrieNode getChild(char ch) { in getChild()
1374 TrieNode node = children.get(key); in getOrCreateChild()
1412 private static TrieNode longestMatch( in longestMatch()
1422 private static TrieNode longestMatch( in longestMatch()
[all …]
|
| /aosp12/hardware/interfaces/tests/trie/1.0/default/ |
| H A D | Trie.cpp | 35 TrieNode ret; in newTrie()
41 Return<void> Trie::addStrings(const TrieNode& trie, const hidl_vec<hidl_string>& strings, in addStrings()
46 TrieNode newTrie = trie; in addStrings()
55 Return<void> Trie::containsStrings(const TrieNode& trie, const hidl_vec<hidl_string>& strings, in containsStrings()
67 void Trie::addString(TrieNode* trieRoot, const std::string& str) { in addString()
68 TrieNode* currNode = trieRoot; in addString()
89 bool Trie::containsString(const TrieNode* trieRoot, const std::string& str) { in containsString()
90 const TrieNode* currNode = trieRoot; in containsString()
|
| H A D | Trie.h | 37 using ::android::hardware::tests::trie::V1_0::TrieNode;
42 virtual Return<void> addStrings(const TrieNode& trie, const hidl_vec<hidl_string>& strings,
44 virtual Return<void> containsStrings(const TrieNode& trie, const hidl_vec<hidl_string>& strings,
48 void addString(TrieNode* trieRoot, const std::string& str);
49 bool containsString(const TrieNode* trieRoot, const std::string& str);
|
| /aosp12/system/core/property_service/libpropertyinfoparser/include/property_info_parser/ |
| H A D | property_info_parser.h | 95 class TrieNode {
97 TrieNode() : serialized_data_(nullptr), trie_node_base_(nullptr) {} in TrieNode() function
98 TrieNode(const SerializedData* data_base, const TrieNodeInternal* trie_node_base) in TrieNode() function
109 TrieNode child_node(int n) const { in child_node()
113 return TrieNode(serialized_data_, trie_node_base); in child_node()
116 bool FindChildForString(const char* input, uint32_t namelen, TrieNode* child) const;
172 TrieNode root_node() const { return trie(header()->root_offset); } in root_node()
175 void CheckPrefixMatch(const char* remaining_name, const TrieNode& trie_node,
186 TrieNode trie(uint32_t offset) const { in trie()
187 if (offset != 0 && offset > size()) return TrieNode(); in trie()
[all …]
|
| /aosp12/hardware/interfaces/tests/trie/1.0/ |
| H A D | ITrie.hal | 20 newTrie() generates (TrieNode trie);
21 addStrings(TrieNode trie, vec<string> strings) generates (TrieNode trie);
22 containsStrings(TrieNode trie, vec<string> strings) generates (vec<bool> contains);
|
| H A D | types.hal | 21 TrieNode node; // Requires reordering.
24 struct TrieNode {
|
| /aosp12/system/core/property_service/libpropertyinfoparser/ |
| H A D | property_info_parser.cpp | 70 bool TrieNode::FindChildForString(const char* name, uint32_t namelen, TrieNode* child) const { in FindChildForString()
91 void PropertyInfoArea::CheckPrefixMatch(const char* remaining_name, const TrieNode& trie_node, in CheckPrefixMatch()
136 TrieNode child_node; in GetPropertyInfoIndexes()
|
| /aosp12/system/core/property_service/libpropertyinfoserializer/ |
| H A D | property_info_serializer_test.cpp | 57 TrieNode test_node; in TEST()
102 TrieNode long_string_node; in TEST()
|
| /aosp12/system/tools/hidl/test/hidl_test/ |
| H A D | hidl_test_client.cpp | 137 using ::android::hardware::tests::trie::V1_0::TrieNode;
501 trie::V1_0::TrieNode trieNode; in TEST_F()
1951 trieInterface->newTrie([&](const TrieNode& trie) { in TEST_F()
1952 trieInterface->addStrings(trie, {"a", "ba"}, [&](const TrieNode& trie) { in TEST_F()
1959 trieInterface->addStrings(trie, {"", "ab", "bab"}, [&](const TrieNode& trie) { in TEST_F()
1989 trieInterface->newTrie([&](const TrieNode& trie) { in TEST_F()
1996 trie, hidl_vec<hidl_string>(strings.begin(), strings.end()), [&](const TrieNode& trie) { in TEST_F()
|