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
|
// 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.
#ifndef CHROMEOS_ASH_COMPONENTS_STRING_MATCHING_TOKENIZED_STRING_MATCH_H_
#define CHROMEOS_ASH_COMPONENTS_STRING_MATCHING_TOKENIZED_STRING_MATCH_H_
#include <string>
#include <vector>
#include "ui/gfx/range/range.h"
namespace ash::string_matching {
class TokenizedString;
// TokenizedStringMatch takes two tokenized strings: one as the text and
// the other one as the query. It matches the query against the text,
// calculates a relevance score between [0, 1] and records the matched portions
// of text ("hits").
//
// A relevance score of zero means the two are completely different to each
// other. The higher the relevance score, the better the two strings are
// matched. Matched portions of text are stored as index ranges.
class TokenizedStringMatch {
public:
typedef std::vector<gfx::Range> Hits;
TokenizedStringMatch();
TokenizedStringMatch(const TokenizedStringMatch&) = delete;
TokenizedStringMatch& operator=(const TokenizedStringMatch&) = delete;
~TokenizedStringMatch();
// Calculates the relevance and hits, and returns the relevance score.
double Calculate(const TokenizedString& query, const TokenizedString& text);
// Convenience wrapper to calculate match from raw string input.
double Calculate(const std::u16string& query, const std::u16string& text);
double relevance() const { return relevance_; }
const Hits& hits() const { return hits_; }
private:
// Score in range of [0,1] representing how well the query matches the text.
double relevance_;
// Char index ranges in |text| of where matches are found.
Hits hits_;
};
} // namespace ash::string_matching
#endif // CHROMEOS_ASH_COMPONENTS_STRING_MATCHING_TOKENIZED_STRING_MATCH_H_
|
