1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
|
/*
* Copyright (C) 2017 The Android Open Source Project
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#define LOG_TAG "hidl_test"
#include "Trie.h"
#include <android-base/logging.h>
#include <inttypes.h>
#include <string>
namespace android {
namespace hardware {
namespace tests {
namespace trie {
namespace V1_0 {
namespace implementation {
// Methods from ::android::hardware::tests::trie::V1_0::ITrie follow.
Return<void> Trie::newTrie(newTrie_cb _hidl_cb) {
LOG(INFO) << "SERVER(Trie) newTrie()";
TrieNode ret;
ret.isTerminal = false;
_hidl_cb(ret);
return Void();
}
Return<void> Trie::addStrings(const TrieNode& trie, const hidl_vec<hidl_string>& strings,
addStrings_cb _hidl_cb) {
LOG(INFO) << "SERVER(Trie) addStrings(trie, " << strings.size() << " strings)";
// Make trie modifiable.
TrieNode newTrie = trie;
for (const auto& str : strings) {
addString(&newTrie, str);
}
_hidl_cb(newTrie);
return Void();
}
Return<void> Trie::containsStrings(const TrieNode& trie, const hidl_vec<hidl_string>& strings,
containsStrings_cb _hidl_cb) {
LOG(INFO) << "SERVER(Trie) containsStrings(trie, " << strings.size() << " strings)";
std::vector<bool> ret(strings.size());
for (size_t i = 0; i != strings.size(); ++i) {
ret[i] = containsString(&trie, strings[i]);
}
_hidl_cb(ret);
return Void();
}
void Trie::addString(TrieNode* trieRoot, const std::string& str) {
TrieNode* currNode = trieRoot;
for (char ch : str) {
auto& vec = currNode->next;
auto it = std::find_if(vec.begin(), vec.end(),
[&](const TrieEdge& edge) { return ch == edge.character; });
if (it == vec.end()) {
vec.resize(vec.size() + 1);
it = vec.end() - 1;
it->character = ch;
it->node.isTerminal = false;
}
currNode = &(it->node);
}
currNode->isTerminal = true;
}
bool Trie::containsString(const TrieNode* trieRoot, const std::string& str) {
const TrieNode* currNode = trieRoot;
for (char ch : str) {
const auto& vec = currNode->next;
auto it = std::find_if(vec.begin(), vec.end(),
[&](const TrieEdge& edge) { return ch == edge.character; });
if (it == vec.end()) return false;
currNode = &(it->node);
}
return currNode->isTerminal;
}
ITrie* HIDL_FETCH_ITrie(const char* /* name */) {
return new Trie();
}
} // namespace implementation
} // namespace V1_0
} // namespace trie
} // namespace tests
} // namespace hardware
} // namespace android
|
