| OLD | NEW |
| 1 // Copyright (c) 2013 The Chromium Authors. All rights reserved. | 1 // Copyright (c) 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 <stddef.h> |
| 6 |
| 7 #include "base/macros.h" |
| 5 #include "testing/gtest/include/gtest/gtest.h" | 8 #include "testing/gtest/include/gtest/gtest.h" |
| 6 #include "tools/gn/pattern.h" | 9 #include "tools/gn/pattern.h" |
| 7 | 10 |
| 8 namespace { | 11 namespace { |
| 9 | 12 |
| 10 struct Case { | 13 struct Case { |
| 11 const char* pattern; | 14 const char* pattern; |
| 12 const char* candidate; | 15 const char* candidate; |
| 13 bool expected_match; | 16 bool expected_match; |
| 14 }; | 17 }; |
| (...skipping 37 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 52 { "*\\bfoo\\b*", "lala/foo/bar/baz", true }, | 55 { "*\\bfoo\\b*", "lala/foo/bar/baz", true }, |
| 53 }; | 56 }; |
| 54 for (size_t i = 0; i < arraysize(pattern_cases); i++) { | 57 for (size_t i = 0; i < arraysize(pattern_cases); i++) { |
| 55 const Case& c = pattern_cases[i]; | 58 const Case& c = pattern_cases[i]; |
| 56 Pattern pattern(c.pattern); | 59 Pattern pattern(c.pattern); |
| 57 bool result = pattern.MatchesString(c.candidate); | 60 bool result = pattern.MatchesString(c.candidate); |
| 58 EXPECT_EQ(c.expected_match, result) << i << ": \"" << c.pattern | 61 EXPECT_EQ(c.expected_match, result) << i << ": \"" << c.pattern |
| 59 << "\", \"" << c.candidate << "\""; | 62 << "\", \"" << c.candidate << "\""; |
| 60 } | 63 } |
| 61 } | 64 } |
| OLD | NEW |