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) 2018 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.
*/
#include <vector>
#include "gmock/gmock.h"
#include "gtest/gtest.h"
#include "utils/base/integral_types.h"
#include "utils/sentencepiece/sorted_strings_table.h"
namespace libtextclassifier3 {
namespace {
TEST(SortedStringsTest, Lookup) {
const char pieces[] = "hell\0hello\0o\0there\0";
const uint32 offsets[] = {0, 5, 11, 13};
SortedStringsTable table(/*num_pieces=*/4, offsets, StringPiece(pieces, 18),
/*use_linear_scan_threshold=*/1);
{
std::vector<TrieMatch> matches;
EXPECT_TRUE(table.FindAllPrefixMatches("hello there", &matches));
EXPECT_EQ(matches.size(), 2);
EXPECT_EQ(matches[0].id, 0 /*hell*/);
EXPECT_EQ(matches[0].match_length, 4 /*hell*/);
EXPECT_EQ(matches[1].id, 1 /*hello*/);
EXPECT_EQ(matches[1].match_length, 5 /*hello*/);
}
{
std::vector<TrieMatch> matches;
EXPECT_TRUE(table.FindAllPrefixMatches("he", &matches));
EXPECT_THAT(matches, testing::IsEmpty());
}
{
std::vector<TrieMatch> matches;
EXPECT_TRUE(table.FindAllPrefixMatches("he", &matches));
EXPECT_THAT(matches, testing::IsEmpty());
}
{
std::vector<TrieMatch> matches;
EXPECT_TRUE(table.FindAllPrefixMatches("abcd", &matches));
EXPECT_THAT(matches, testing::IsEmpty());
}
{
std::vector<TrieMatch> matches;
EXPECT_TRUE(table.FindAllPrefixMatches("", &matches));
EXPECT_THAT(matches, testing::IsEmpty());
}
{
std::vector<TrieMatch> matches;
EXPECT_TRUE(table.FindAllPrefixMatches("hi there", &matches));
EXPECT_THAT(matches, testing::IsEmpty());
}
{
std::vector<TrieMatch> matches;
EXPECT_TRUE(table.FindAllPrefixMatches(StringPiece("\0", 1), &matches));
EXPECT_THAT(matches, testing::IsEmpty());
}
{
std::vector<TrieMatch> matches;
EXPECT_TRUE(
table.FindAllPrefixMatches(StringPiece("\xff, \xfe", 2), &matches));
EXPECT_THAT(matches, testing::IsEmpty());
}
{
TrieMatch match;
EXPECT_TRUE(table.LongestPrefixMatch("hella there", &match));
EXPECT_EQ(match.id, 0 /*hell*/);
}
{
TrieMatch match;
EXPECT_TRUE(table.LongestPrefixMatch("hello there", &match));
EXPECT_EQ(match.id, 1 /*hello*/);
}
{
TrieMatch match;
EXPECT_TRUE(table.LongestPrefixMatch("abcd", &match));
EXPECT_EQ(match.id, -1);
}
{
TrieMatch match;
EXPECT_TRUE(table.LongestPrefixMatch("", &match));
EXPECT_EQ(match.id, -1);
}
}
} // namespace
} // namespace libtextclassifier3
|
