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
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
|
// Copyright 2013 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "components/autofill/core/common/autofill_regexes.h"
#include <stddef.h>
#include "base/macros.h"
#include "base/strings/string16.h"
#include "base/strings/utf_string_conversions.h"
#include "components/autofill/core/browser/autofill_regex_constants.h"
#include "testing/gtest/include/gtest/gtest.h"
using base::ASCIIToUTF16;
namespace autofill {
TEST(AutofillRegexesTest, SampleRegexes) {
struct TestCase {
const char* const input;
const char* const pattern;
};
const TestCase kPositiveCases[] = {
// Empty pattern
{"", ""},
{"Look, ma' -- a non-empty string!", ""},
// Substring
{"string", "tri"},
// Substring at beginning
{"string", "str"},
{"string", "^str"},
// Substring at end
{"string", "ring"},
{"string", "ring$"},
// Case-insensitive
{"StRiNg", "string"},
};
for (const auto& test_case : kPositiveCases) {
SCOPED_TRACE(test_case.input);
SCOPED_TRACE(test_case.pattern);
EXPECT_TRUE(MatchesPattern(ASCIIToUTF16(test_case.input),
ASCIIToUTF16(test_case.pattern)));
}
const TestCase kNegativeCases[] = {
// Empty string
{"", "Look, ma' -- a non-empty pattern!"},
// Substring
{"string", "trn"},
// Substring at beginning
{"string", " str"},
{"string", "^tri"},
// Substring at end
{"string", "ring "},
{"string", "rin$"},
};
for (const auto& test_case : kNegativeCases) {
SCOPED_TRACE(test_case.input);
SCOPED_TRACE(test_case.pattern);
EXPECT_FALSE(MatchesPattern(ASCIIToUTF16(test_case.input),
ASCIIToUTF16(test_case.pattern)));
}
}
TEST(AutofillRegexesTest, ExpirationDate2DigitYearRegexes) {
struct TestCase {
const char* const input;
};
const base::string16 pattern = ASCIIToUTF16(kExpirationDate2DigitYearRe);
const TestCase kPositiveCases[] = {
// Simple two year cases
{"mm / yy"},
{"mm/ yy"},
{"mm /yy"},
{"mm/yy"},
{"mm - yy"},
{"mm- yy"},
{"mm -yy"},
{"mm-yy"},
{"mmyy"},
// Complex two year cases
{"Expiration Date (MM / YY)"},
{"Expiration Date (MM/YY)"},
{"Expiration Date (MM - YY)"},
{"Expiration Date (MM-YY)"},
{"Expiration Date MM / YY"},
{"Expiration Date MM/YY"},
{"Expiration Date MM - YY"},
{"Expiration Date MM-YY"},
{"expiration date yy"},
{"Exp Date (MM / YY)"},
};
for (const auto& test_case : kPositiveCases) {
SCOPED_TRACE(test_case.input);
EXPECT_TRUE(MatchesPattern(ASCIIToUTF16(test_case.input),pattern));
}
const TestCase kNegativeCases[] = {
{""},
{"Look, ma' -- an invalid string!"},
{"mmfavouritewordyy"},
{"mm a yy"},
{"mm a yyyy"},
// Simple four year cases
{"mm / yyyy"},
{"mm/ yyyy"},
{"mm /yyyy"},
{"mm/yyyy"},
{"mm - yyyy"},
{"mm- yyyy"},
{"mm -yyyy"},
{"mm-yyyy"},
{"mmyyyy"},
// Complex four year cases
{"Expiration Date (MM / YYYY)"},
{"Expiration Date (MM/YYYY)"},
{"Expiration Date (MM - YYYY)"},
{"Expiration Date (MM-YYYY)"},
{"Expiration Date MM / YYYY"},
{"Expiration Date MM/YYYY"},
{"Expiration Date MM - YYYY"},
{"Expiration Date MM-YYYY"},
{"expiration date yyyy"},
{"Exp Date (MM / YYYY)"},
};
for (const auto& test_case : kNegativeCases) {
SCOPED_TRACE(test_case.input);
EXPECT_FALSE(MatchesPattern(ASCIIToUTF16(test_case.input), pattern));
}
}
TEST(AutofillRegexesTest, ExpirationDate4DigitYearRegexes) {
struct TestCase {
const char* const input;
};
const base::string16 pattern = ASCIIToUTF16(kExpirationDate4DigitYearRe);
const TestCase kPositiveCases[] = {
// Simple four year cases
{"mm / yyyy"},
{"mm/ yyyy"},
{"mm /yyyy"},
{"mm/yyyy"},
{"mm - yyyy"},
{"mm- yyyy"},
{"mm -yyyy"},
{"mm-yyyy"},
{"mmyyyy"},
// Complex four year cases
{"Expiration Date (MM / YYYY)"},
{"Expiration Date (MM/YYYY)"},
{"Expiration Date (MM - YYYY)"},
{"Expiration Date (MM-YYYY)"},
{"Expiration Date MM / YYYY"},
{"Expiration Date MM/YYYY"},
{"Expiration Date MM - YYYY"},
{"Expiration Date MM-YYYY"},
{"expiration date yyyy"},
{"Exp Date (MM / YYYY)"},
};
for (const auto& test_case : kPositiveCases) {
SCOPED_TRACE(test_case.input);
EXPECT_TRUE(MatchesPattern(ASCIIToUTF16(test_case.input),pattern));
}
const TestCase kNegativeCases[] = {
{""},
{"Look, ma' -- an invalid string!"},
{"mmfavouritewordyy"},
{"mm a yy"},
{"mm a yyyy"},
// Simple two year cases
{"mm / yy"},
{"mm/ yy"},
{"mm /yy"},
{"mm/yy"},
{"mm - yy"},
{"mm- yy"},
{"mm -yy"},
{"mm-yy"},
{"mmyy"},
// Complex two year cases
{"Expiration Date (MM / YY)"},
{"Expiration Date (MM/YY)"},
{"Expiration Date (MM - YY)"},
{"Expiration Date (MM-YY)"},
{"Expiration Date MM / YY"},
{"Expiration Date MM/YY"},
{"Expiration Date MM - YY"},
{"Expiration Date MM-YY"},
{"expiration date yy"},
{"Exp Date (MM / YY)"},
};
for (const auto& test_case : kNegativeCases) {
SCOPED_TRACE(test_case.input);
EXPECT_FALSE(MatchesPattern(ASCIIToUTF16(test_case.input), pattern));
}
}
} // namespace autofill
|
