Searched refs:TrieMatch (Results 1 – 9 of 9) sorted by relevance
| /external/libtextclassifier/utils/sentencepiece/ |
| D | sorted_strings_table_test.cc | 36 std::vector<TrieMatch> matches; in TEST()
46 std::vector<TrieMatch> matches; in TEST()
52 std::vector<TrieMatch> matches; in TEST()
58 std::vector<TrieMatch> matches; in TEST()
64 std::vector<TrieMatch> matches; in TEST()
70 std::vector<TrieMatch> matches; in TEST()
76 std::vector<TrieMatch> matches; in TEST()
82 std::vector<TrieMatch> matches; in TEST()
89 TrieMatch match; in TEST()
95 TrieMatch match; in TEST()
[all …]
|
| D | double_array_trie_test.cc | 42 std::vector<TrieMatch> matches; in TEST()
52 std::vector<TrieMatch> matches; in TEST()
58 std::vector<TrieMatch> matches; in TEST()
64 std::vector<TrieMatch> matches; in TEST()
70 std::vector<TrieMatch> matches; in TEST()
76 std::vector<TrieMatch> matches; in TEST()
82 std::vector<TrieMatch> matches; in TEST()
89 TrieMatch match; in TEST()
95 TrieMatch match; in TEST()
101 TrieMatch match; in TEST()
[all …]
|
| D | sorted_strings_table.cc | 25 StringPiece input, const std::function<void(TrieMatch)>& update_fn) const { in GatherPrefixMatches()
68 update_fn(TrieMatch(/*id=*/left, in GatherPrefixMatches()
89 update_fn(TrieMatch(/*id=*/i, in GatherPrefixMatches()
96 StringPiece input, std::vector<TrieMatch>* matches) const { in FindAllPrefixMatches()
98 input, [matches](const TrieMatch match) { matches->push_back(match); }); in FindAllPrefixMatches()
103 TrieMatch* longest_match) const { in LongestPrefixMatch()
104 *longest_match = TrieMatch(); in LongestPrefixMatch()
105 GatherPrefixMatches(input, [longest_match](const TrieMatch match) { in LongestPrefixMatch()
|
| D | double_array_trie.cc | 23 StringPiece input, const std::function<void(TrieMatch)>& update_fn) const { in GatherPrefixMatches()
49 update_fn(TrieMatch(/*id=*/value(pos), /*match_length=*/i + 1)); in GatherPrefixMatches()
56 StringPiece input, std::vector<TrieMatch>* matches) const { in FindAllPrefixMatches()
58 input, [matches](const TrieMatch match) { matches->push_back(match); }); in FindAllPrefixMatches()
62 TrieMatch* longest_match) const { in LongestPrefixMatch()
63 *longest_match = TrieMatch(); in LongestPrefixMatch()
64 return GatherPrefixMatches(input, [longest_match](const TrieMatch match) { in LongestPrefixMatch()
|
| D | matcher.h | 25 struct TrieMatch { struct
26 TrieMatch() {} in TrieMatch() function
27 TrieMatch(int id, int match_length) : id(id), match_length(match_length) {} in TrieMatch() argument
38 std::vector<TrieMatch>* matches) const = 0; argument
42 TrieMatch* longest_match) const = 0;
|
| D | sorted_strings_table.h | 50 std::vector<TrieMatch>* matches) const override;
53 TrieMatch* longest_match) const override;
57 StringPiece input, const std::function<void(TrieMatch)>& update_fn) const;
|
| D | double_array_trie.h | 50 std::vector<TrieMatch>* matches) const override;
53 TrieMatch* longest_match) const override;
77 StringPiece input, const std::function<void(TrieMatch)>& update_fn) const;
|
| D | encoder.cc | 60 std::vector<TrieMatch> matches; in Encode()
|
| D | normalizer.cc | 120 TrieMatch match; in NormalizePrefix()
|