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
|
// Copyright 2020 The Chromium Authors
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "chromeos/ash/components/local_search_service/linear_map_search.h"
#include <optional>
#include <utility>
#include <vector>
#include "base/strings/string_split.h"
#include "base/strings/string_util.h"
#include "base/time/time.h"
#include "chromeos/ash/components/local_search_service/search_utils.h"
#include "chromeos/ash/components/string_matching/fuzzy_tokenized_string_match.h"
#include "chromeos/ash/components/string_matching/tokenized_string.h"
namespace ash::local_search_service {
namespace {
using string_matching::FuzzyTokenizedStringMatch;
using string_matching::TokenizedString;
using Positions = std::vector<local_search_service::Position>;
using TokenizedStringWithId =
std::pair<std::string, std::unique_ptr<TokenizedString>>;
void TokenizeSearchTags(const std::vector<Content>& contents,
std::vector<TokenizedStringWithId>* tokenized) {
DCHECK(tokenized);
for (const auto& content : contents) {
tokenized->push_back(std::make_pair(
content.id, std::make_unique<TokenizedString>(content.content)));
}
}
// Returns whether a given item with |search_tags| is relevant to |query| using
// fuzzy string matching.
bool IsItemRelevant(const TokenizedString& query,
const std::vector<TokenizedStringWithId>& search_tags,
double relevance_threshold,
double* relevance_score,
Positions* positions) {
DCHECK(relevance_score);
DCHECK(positions);
if (search_tags.empty())
return false;
for (const auto& tag : search_tags) {
FuzzyTokenizedStringMatch match;
const double relevance =
match.Relevance(query, *(tag.second), true /* use_weighted_ratio */);
if (relevance >= relevance_threshold) {
*relevance_score = relevance;
// Initialize the `length` and `start` to 0, as they are currently not
// in-use by linear map search.
Position position(tag.first, 0, 0);
positions->push_back(position);
return true;
}
}
return false;
}
// Updates data given |id| and |contents|. If |id| already exists, it will
// overwrite earlier data.
void UpdateData(const std::string& id,
const std::vector<Content>& contents,
KeyToTagVector* data) {
DCHECK(data);
(*data)[id] = std::vector<TokenizedStringWithId>();
TokenizeSearchTags(contents, &((*data)[id]));
}
} // namespace
LinearMapSearch::LinearMapSearch(IndexId index_id)
: Index(index_id, Backend::kLinearMap) {}
LinearMapSearch::~LinearMapSearch() = default;
void LinearMapSearch::GetSize(GetSizeCallback callback) {
std::move(callback).Run(data_.size());
}
void LinearMapSearch::AddOrUpdate(const std::vector<Data>& data,
AddOrUpdateCallback callback) {
for (const auto& item : data) {
const auto& id = item.id;
DCHECK(!id.empty());
UpdateData(id, item.contents, &data_);
}
MaybeLogIndexSize();
std::move(callback).Run();
}
void LinearMapSearch::Delete(const std::vector<std::string>& ids,
DeleteCallback callback) {
uint32_t num_deleted = 0u;
for (const auto& id : ids) {
DCHECK(!id.empty());
num_deleted += data_.erase(id);
}
MaybeLogIndexSize();
std::move(callback).Run(num_deleted);
}
void LinearMapSearch::UpdateDocuments(const std::vector<Data>& data,
UpdateDocumentsCallback callback) {
uint32_t num_deleted = 0u;
for (const auto& item : data) {
const auto& id = item.id;
DCHECK(!id.empty());
if (item.contents.empty()) {
num_deleted += data_.erase(id);
} else {
UpdateData(id, item.contents, &data_);
}
}
MaybeLogIndexSize();
std::move(callback).Run(num_deleted);
}
void LinearMapSearch::Find(const std::u16string& query,
uint32_t max_results,
FindCallback callback) {
const base::TimeTicks start = base::TimeTicks::Now();
if (query.empty()) {
const ResponseStatus status = ResponseStatus::kEmptyQuery;
MaybeLogSearchResultsStats(status, 0u, base::TimeDelta());
std::move(callback).Run(status, std::nullopt);
return;
}
if (data_.empty()) {
const ResponseStatus status = ResponseStatus::kEmptyIndex;
MaybeLogSearchResultsStats(status, 0u, base::TimeDelta());
std::move(callback).Run(status, std::nullopt);
return;
}
std::vector<Result> results = GetSearchResults(query, max_results);
const ResponseStatus status = ResponseStatus::kSuccess;
const base::TimeTicks end = base::TimeTicks::Now();
MaybeLogSearchResultsStats(status, results.size(), end - start);
std::move(callback).Run(status, std::move(results));
}
void LinearMapSearch::ClearIndex(ClearIndexCallback callback) {
data_.clear();
std::move(callback).Run();
}
uint32_t LinearMapSearch::GetIndexSize() const {
return data_.size();
}
std::vector<Result> LinearMapSearch::GetSearchResults(
const std::u16string& query,
uint32_t max_results) const {
std::vector<Result> results;
const TokenizedString tokenized_query(query);
for (const auto& item : data_) {
double relevance_score = 0.0;
Positions positions;
if (IsItemRelevant(tokenized_query, item.second,
search_params_.relevance_threshold, &relevance_score,
&positions)) {
Result result;
result.id = item.first;
result.score = relevance_score;
result.positions = positions;
results.push_back(result);
}
}
std::sort(results.begin(), results.end(), CompareResults);
if (results.size() > max_results && max_results > 0u) {
results.resize(max_results);
}
return results;
}
} // namespace ash::local_search_service
|
