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
|
// Copyright 2008, Google Inc.
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
//
// * Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
// * Redistributions in binary form must reproduce the above
// copyright notice, this list of conditions and the following disclaimer
// in the documentation and/or other materials provided with the
// distribution.
// * Neither the name of Google Inc. nor the names of its
// contributors may be used to endorse or promote products derived from
// this software without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
#include "chrome/browser/history/query_parser.h"
#include "base/logging.h"
#include "chrome/common/scoped_vector.h"
#include "testing/gtest/include/gtest/gtest.h"
namespace {
class QueryParserTest : public testing::Test {
public:
struct TestData {
const std::wstring input;
const int expected_word_count;
};
std::wstring QueryToString(const std::wstring& query);
protected:
QueryParser query_parser_;
};
}; // namespace
// Test helper: Convert a user query string to a SQLite query string.
std::wstring QueryParserTest::QueryToString(const std::wstring& query) {
std::wstring sqlite_query;
query_parser_.ParseQuery(query, &sqlite_query);
return sqlite_query;
}
// Basic multi-word queries, including prefix matching.
TEST_F(QueryParserTest, SimpleQueries) {
EXPECT_EQ(L"", QueryToString(L" "));
EXPECT_EQ(L"singleword*", QueryToString(L"singleword"));
EXPECT_EQ(L"spacedout*", QueryToString(L" spacedout "));
EXPECT_EQ(L"foo* bar*", QueryToString(L"foo bar"));
// Short words aren't prefix matches. For Korean Hangul
// the minimum is 2 while for other scripts, it's 3.
EXPECT_EQ(L"f b", QueryToString(L" f b"));
// KA JANG
EXPECT_EQ(L"\xAC00 \xC7A5", QueryToString(L" \xAC00 \xC7A5"));
EXPECT_EQ(L"foo* bar*", QueryToString(L" foo bar "));
// KA-JANG BICH-GO
EXPECT_EQ(L"\xAC00\xC7A5* \xBE5B\xACE0*",
QueryToString(L"\xAC00\xC7A5 \xBE5B\xACE0"));
}
// Quoted substring parsing.
TEST_F(QueryParserTest, Quoted) {
EXPECT_EQ(L"\"Quoted\"", QueryToString(L"\"Quoted\"")); // ASCII quotes
EXPECT_EQ(L"\"miss end\"", QueryToString(L"\"miss end")); // Missing end quotes
EXPECT_EQ(L"miss* beg*", QueryToString(L"miss beg\"")); // Missing begin quotes
EXPECT_EQ(L"\"Many\" \"quotes\"", QueryToString(L"\"Many \"\"quotes")); // Weird formatting
}
// Apostrophes within words should be preserved, but otherwise stripped.
TEST_F(QueryParserTest, Apostrophes) {
EXPECT_EQ(L"foo* bar's*", QueryToString(L"foo bar's"));
EXPECT_EQ(L"l'foo*", QueryToString(L"l'foo"));
EXPECT_EQ(L"foo*", QueryToString(L"'foo"));
}
// Special characters.
TEST_F(QueryParserTest, SpecialChars) {
EXPECT_EQ(L"foo* the* bar*", QueryToString(L"!#:/*foo#$*;'* the!#:/*bar"));
}
TEST_F(QueryParserTest, NumWords) {
TestData data[] = {
{ L"blah", 1 },
{ L"foo \"bar baz\"", 3 },
{ L"foo \"baz\"", 2 },
{ L"foo \"bar baz\" blah", 4 },
};
for (int i = 0; i < arraysize(data); ++i) {
std::wstring query_string;
EXPECT_EQ(data[i].expected_word_count,
query_parser_.ParseQuery(data[i].input, &query_string));
}
}
TEST_F(QueryParserTest, ParseQueryNodesAndMatch) {
struct TestData2 {
const std::wstring query;
const std::wstring text;
const bool matches;
} data[] = {
{ L"blah", L"blah", true },
{ L"blah", L"foo", false },
{ L"blah", L"blahblah", true },
{ L"blah", L"foo blah", true },
{ L"foo blah", L"blah", false },
{ L"foo blah", L"blahx foobar", true },
{ L"\"foo blah\"", L"foo blah", true },
{ L"\"foo blah\"", L"foox blahx", false },
{ L"\"foo blah\"", L"foo blah", true },
{ L"\"foo blah\"", L"\"foo blah\"", true },
{ L"foo blah", L"\"foo bar blah\"", true },
};
for (int i = 0; i < arraysize(data); ++i) {
std::vector<std::wstring> results;
QueryParser parser;
ScopedVector<QueryNode> query_nodes;
parser.ParseQuery(data[i].query, &query_nodes.get());
ASSERT_EQ(data[i].matches,
parser.DoesQueryMatch(data[i].text, query_nodes.get()));
}
}
|
