OLD | NEW |
1 // Copyright 2013 The Chromium Authors. All rights reserved. | 1 // Copyright 2013 The Chromium Authors. All rights reserved. |
2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
4 | 4 |
5 #include "components/autofill/core/common/autofill_regexes.h" | 5 #include "components/autofill/core/common/autofill_regexes.h" |
6 | 6 |
7 #include "base/strings/string16.h" | 7 #include "base/strings/string16.h" |
8 #include "base/strings/utf_string_conversions.h" | 8 #include "base/strings/utf_string_conversions.h" |
9 #include "components/autofill/core/browser/autofill_regex_constants.h" | 9 #include "components/autofill/core/browser/autofill_regex_constants.h" |
10 #include "testing/gtest/include/gtest/gtest.h" | 10 #include "testing/gtest/include/gtest/gtest.h" |
(...skipping 20 matching lines...) Expand all Loading... |
31 // Substring at end | 31 // Substring at end |
32 {"string", "ring"}, | 32 {"string", "ring"}, |
33 {"string", "ring$"}, | 33 {"string", "ring$"}, |
34 // Case-insensitive | 34 // Case-insensitive |
35 {"StRiNg", "string"}, | 35 {"StRiNg", "string"}, |
36 }; | 36 }; |
37 for (size_t i = 0; i < arraysize(kPositiveCases); ++i) { | 37 for (size_t i = 0; i < arraysize(kPositiveCases); ++i) { |
38 const TestCase& test_case = kPositiveCases[i]; | 38 const TestCase& test_case = kPositiveCases[i]; |
39 SCOPED_TRACE(test_case.input); | 39 SCOPED_TRACE(test_case.input); |
40 SCOPED_TRACE(test_case.pattern); | 40 SCOPED_TRACE(test_case.pattern); |
41 EXPECT_TRUE(MatchesPattern(ASCIIToUTF16(test_case.input), | 41 EXPECT_TRUE( |
42 ASCIIToUTF16(test_case.pattern))); | 42 MatchesPattern(ASCIIToUTF16(test_case.input), test_case.pattern)); |
43 } | 43 } |
44 | 44 |
45 const TestCase kNegativeCases[] = { | 45 const TestCase kNegativeCases[] = { |
46 // Empty string | 46 // Empty string |
47 {"", "Look, ma' -- a non-empty pattern!"}, | 47 {"", "Look, ma' -- a non-empty pattern!"}, |
48 // Substring | 48 // Substring |
49 {"string", "trn"}, | 49 {"string", "trn"}, |
50 // Substring at beginning | 50 // Substring at beginning |
51 {"string", " str"}, | 51 {"string", " str"}, |
52 {"string", "^tri"}, | 52 {"string", "^tri"}, |
53 // Substring at end | 53 // Substring at end |
54 {"string", "ring "}, | 54 {"string", "ring "}, |
55 {"string", "rin$"}, | 55 {"string", "rin$"}, |
56 }; | 56 }; |
57 for (size_t i = 0; i < arraysize(kNegativeCases); ++i) { | 57 for (size_t i = 0; i < arraysize(kNegativeCases); ++i) { |
58 const TestCase& test_case = kNegativeCases[i]; | 58 const TestCase& test_case = kNegativeCases[i]; |
59 SCOPED_TRACE(test_case.input); | 59 SCOPED_TRACE(test_case.input); |
60 SCOPED_TRACE(test_case.pattern); | 60 SCOPED_TRACE(test_case.pattern); |
61 EXPECT_FALSE(MatchesPattern(ASCIIToUTF16(test_case.input), | 61 EXPECT_FALSE( |
62 ASCIIToUTF16(test_case.pattern))); | 62 MatchesPattern(ASCIIToUTF16(test_case.input), test_case.pattern)); |
63 } | 63 } |
64 } | 64 } |
65 | 65 |
66 } // namespace autofill | 66 } // namespace autofill |
OLD | NEW |