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
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
|
// Copyright 2019 The Chromium Authors
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include <map>
#include <memory>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
#include "base/strings/utf_string_conversions.h"
#include "chromeos/ash/components/local_search_service/linear_map_search.h"
#include "chromeos/ash/components/local_search_service/shared_structs.h"
#include "chromeos/ash/components/local_search_service/test_utils.h"
#include "testing/gtest/include/gtest/gtest.h"
namespace ash::local_search_service {
namespace {
// This is (data-id, content-ids).
using ResultWithIds = std::pair<std::string, std::vector<std::string>>;
using ContentWithId = std::pair<std::string, std::string>;
void CheckSearchParams(const SearchParams& actual,
const SearchParams& expected) {
EXPECT_DOUBLE_EQ(actual.relevance_threshold, expected.relevance_threshold);
EXPECT_DOUBLE_EQ(actual.prefix_threshold, expected.prefix_threshold);
EXPECT_DOUBLE_EQ(actual.fuzzy_threshold, expected.fuzzy_threshold);
}
void GetSizeAndCheckResults(LinearMapSearch* index,
uint32_t expectd_num_items) {
bool callback_done = false;
uint32_t num_items = 0;
index->GetSize(base::BindOnce(
[](bool* callback_done, uint32_t* num_items, uint64_t size) {
*callback_done = true;
*num_items = size;
},
&callback_done, &num_items));
ASSERT_TRUE(callback_done);
EXPECT_EQ(num_items, expectd_num_items);
}
void AddOrUpdate(LinearMapSearch* index, const std::vector<Data>& data) {
bool callback_done = false;
index->AddOrUpdate(
data, base::BindOnce([](bool* callback_done) { *callback_done = true; },
&callback_done));
ASSERT_TRUE(callback_done);
}
void UpdateDocumentsAndCheckResults(LinearMapSearch* index,
const std::vector<Data>& data,
uint32_t expect_num_deleted) {
bool callback_done = false;
uint32_t num_deleted = 0u;
index->UpdateDocuments(data,
base::BindOnce(
[](bool* callback_done, uint32_t* num_deleted,
uint32_t num_deleted_callback) {
*callback_done = true;
*num_deleted = num_deleted_callback;
},
&callback_done, &num_deleted));
ASSERT_TRUE(callback_done);
EXPECT_EQ(num_deleted, expect_num_deleted);
}
void FindAndCheckResults(LinearMapSearch* index,
std::string query,
int32_t max_results,
ResponseStatus expected_status,
const std::vector<ResultWithIds>& expected_results) {
DCHECK(index);
bool callback_done = false;
ResponseStatus status;
std::vector<Result> results;
index->Find(
base::UTF8ToUTF16(query), max_results,
base::BindOnce(
[](bool* callback_done, ResponseStatus* status,
std::vector<Result>* results, ResponseStatus status_callback,
const std::optional<std::vector<Result>>& results_callback) {
*callback_done = true;
*status = status_callback;
if (results_callback.has_value())
*results = results_callback.value();
},
&callback_done, &status, &results));
ASSERT_TRUE(callback_done);
EXPECT_EQ(status, expected_status);
if (!results.empty()) {
// If results are returned, check size and values match the expected.
EXPECT_EQ(results.size(), expected_results.size());
for (size_t i = 0; i < results.size(); ++i) {
EXPECT_EQ(results[i].id, expected_results[i].first);
EXPECT_EQ(results[i].positions.size(), expected_results[i].second.size());
for (size_t j = 0; j < results[i].positions.size(); ++j) {
EXPECT_EQ(results[i].positions[j].content_id,
expected_results[i].second[j]);
}
// Scores should be non-increasing.
if (i < results.size() - 1) {
EXPECT_GE(results[i].score, results[i + 1].score);
}
}
return;
}
// If no results are returned, expected ids should be empty.
EXPECT_TRUE(expected_results.empty());
}
} // namespace
class LinearMapSearchTest : public testing::Test {
void SetUp() override {
index_ = std::make_unique<LinearMapSearch>(IndexId::kCrosSettings);
}
protected:
std::unique_ptr<LinearMapSearch> index_;
};
TEST_F(LinearMapSearchTest, SetSearchParams) {
{
// No params are specified so default values are used.
const SearchParams used_params = index_->GetSearchParamsForTesting();
CheckSearchParams(used_params, SearchParams());
}
{
// Params are specified and are used.
SearchParams search_params;
const SearchParams default_params;
search_params.relevance_threshold = default_params.relevance_threshold / 2;
search_params.prefix_threshold = default_params.prefix_threshold / 2;
search_params.fuzzy_threshold = default_params.fuzzy_threshold / 2;
index_->SetSearchParams(search_params);
const SearchParams used_params = index_->GetSearchParamsForTesting();
CheckSearchParams(used_params, search_params);
}
}
TEST_F(LinearMapSearchTest, RelevanceThreshold) {
const std::map<std::string, std::vector<ContentWithId>> data_to_register = {
{"id1", {{"tag1", "Wi-Fi"}}}, {"id2", {{"tag2", "famous"}}}};
std::vector<Data> data = CreateTestData(data_to_register);
AddOrUpdate(index_.get(), data);
GetSizeAndCheckResults(index_.get(), 2u);
{
SearchParams search_params;
search_params.relevance_threshold = 0.0;
index_->SetSearchParams(search_params);
const std::vector<ResultWithIds> expected_results = {{"id1", {"tag1"}},
{"id2", {"tag2"}}};
FindAndCheckResults(index_.get(), "wifi",
/*max_results=*/-1, ResponseStatus::kSuccess,
expected_results);
}
{
SearchParams search_params;
search_params.relevance_threshold = 0.3;
index_->SetSearchParams(search_params);
const std::vector<ResultWithIds> expected_results = {{"id1", {"tag1"}}};
FindAndCheckResults(index_.get(), "wifi",
/*max_results=*/-1, ResponseStatus::kSuccess,
expected_results);
}
{
SearchParams search_params;
search_params.relevance_threshold = 0.95;
index_->SetSearchParams(search_params);
FindAndCheckResults(index_.get(), "wifi",
/*max_results=*/-1, ResponseStatus::kSuccess, {});
}
}
TEST_F(LinearMapSearchTest, MaxResults) {
const std::map<std::string, std::vector<ContentWithId>> data_to_register = {
{"id1", {{"tag1", "abcde"}, {"tag2", "Wi-Fi"}}},
{"id2", {{"tag3", "wifi"}}}};
std::vector<Data> data = CreateTestData(data_to_register);
AddOrUpdate(index_.get(), data);
GetSizeAndCheckResults(index_.get(), 2u);
SearchParams search_params;
search_params.relevance_threshold = 0.3;
index_->SetSearchParams(search_params);
{
const std::vector<ResultWithIds> expected_results = {{"id2", {"tag3"}},
{"id1", {"tag2"}}};
FindAndCheckResults(index_.get(), "wifi",
/*max_results=*/-1, ResponseStatus::kSuccess,
expected_results);
}
{
const std::vector<ResultWithIds> expected_results = {{"id2", {"tag3"}}};
FindAndCheckResults(index_.get(), "wifi",
/*max_results=*/1, ResponseStatus::kSuccess,
expected_results);
}
}
TEST_F(LinearMapSearchTest, ResultFound) {
const std::map<std::string, std::vector<ContentWithId>> data_to_register = {
{"id1", {{"cid1", "id1"}, {"cid2", "tag1a"}, {"cid3", "tag1b"}}},
{"xyz", {{"cid4", "xyz"}}}};
std::vector<Data> data = CreateTestData(data_to_register);
EXPECT_EQ(data.size(), 2u);
AddOrUpdate(index_.get(), data);
GetSizeAndCheckResults(index_.get(), 2u);
// Find result with query "id1". It returns an exact match.
const std::vector<ResultWithIds> expected_results = {{"id1", {"cid1"}}};
FindAndCheckResults(index_.get(), "id1",
/*max_results=*/-1, ResponseStatus::kSuccess,
expected_results);
FindAndCheckResults(index_.get(), "abc",
/*max_results=*/-1, ResponseStatus::kSuccess, {});
}
TEST_F(LinearMapSearchTest, ClearIndex) {
const std::map<std::string, std::vector<ContentWithId>> data_to_register = {
{"id1", {{"cid1", "id1"}, {"cid2", "tag1a"}, {"cid3", "tag1b"}}},
{"xyz", {{"cid4", "xyz"}}}};
std::vector<Data> data = CreateTestData(data_to_register);
EXPECT_EQ(data.size(), 2u);
AddOrUpdate(index_.get(), data);
GetSizeAndCheckResults(index_.get(), 2u);
bool callback_done = false;
index_->ClearIndex(base::BindOnce(
[](bool* callback_done) { *callback_done = true; }, &callback_done));
ASSERT_TRUE(callback_done);
GetSizeAndCheckResults(index_.get(), 0u);
}
TEST_F(LinearMapSearchTest, UpdateDocuments) {
const std::map<std::string, std::vector<ContentWithId>> data_to_register = {
{"id1", {{"cid1", "id1"}, {"cid2", "tag1a"}, {"cid3", "tag1b"}}},
{"xyz", {{"cid4", "xyz"}}}};
std::vector<Data> data = CreateTestData(data_to_register);
EXPECT_EQ(data.size(), 2u);
AddOrUpdate(index_.get(), data);
GetSizeAndCheckResults(index_.get(), 2u);
const std::map<std::string, std::vector<ContentWithId>>
update_data_to_register = {{"id1",
{{"update cid1", "update id1"},
{"update cid2", "update tag1a"},
{"update cid3", "update tag1b"}}},
{"xyz", {}},
{"nonexistid", {}}};
std::vector<Data> update_data = CreateTestData(update_data_to_register);
EXPECT_EQ(update_data.size(), 3u);
UpdateDocumentsAndCheckResults(index_.get(), update_data, 1u);
GetSizeAndCheckResults(index_.get(), 1u);
}
} // namespace ash::local_search_service
|
