| 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/browser/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" |
| 11 | 11 |
| 12 using base::ASCIIToUTF16; | 12 using base::ASCIIToUTF16; |
| 13 | 13 |
| 14 namespace autofill { | 14 namespace autofill { |
| 15 | 15 |
| (...skipping 41 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 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(autofill::MatchesPattern(ASCIIToUTF16(test_case.input), | 61 EXPECT_FALSE(autofill::MatchesPattern(ASCIIToUTF16(test_case.input), |
| 62 ASCIIToUTF16(test_case.pattern))); | 62 ASCIIToUTF16(test_case.pattern))); |
| 63 } | 63 } |
| 64 } | 64 } |
| 65 | 65 |
| 66 } // namespace autofill | 66 } // namespace autofill |
| OLD | NEW |