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
|
// Copyright (c) 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 "testing/gtest/include/gtest/gtest.h"
#include "tools/gn/pattern.h"
namespace {
struct Case {
const char* pattern;
const char* candidate;
bool expected_match;
};
} // namespace
TEST(Pattern, Matches) {
Case pattern_cases[] = {
// Empty pattern matches only empty string.
{ "", "", true },
{ "", "foo", false },
// Exact matches.
{ "foo", "foo", true },
{ "foo", "bar", false },
// Path boundaries.
{ "\\b", "", true },
{ "\\b", "/", true },
{ "\\b\\b", "/", true },
{ "\\b\\b\\b", "", false },
{ "\\b\\b\\b", "/", true },
{ "\\b", "//", false },
{ "\\bfoo\\b", "foo", true },
{ "\\bfoo\\b", "/foo/", true },
{ "\\b\\bfoo", "/foo", true },
// *
{ "*", "", true },
{ "*", "foo", true },
{ "*foo", "foo", true },
{ "*foo", "gagafoo", true },
{ "*foo", "gagafoob", false },
{ "foo*bar", "foobar", true },
{ "foo*bar", "foo-bar", true },
{ "foo*bar", "foolalalalabar", true },
{ "foo*bar", "foolalalalabaz", false },
{ "*a*b*c*d*", "abcd", true },
{ "*a*b*c*d*", "1a2b3c4d5", true },
{ "*a*b*c*d*", "1a2b3c45", false },
{ "*\\bfoo\\b*", "foo", true },
{ "*\\bfoo\\b*", "/foo/", true },
{ "*\\bfoo\\b*", "foob", false },
{ "*\\bfoo\\b*", "lala/foo/bar/baz", true },
};
for (size_t i = 0; i < arraysize(pattern_cases); i++) {
const Case& c = pattern_cases[i];
Pattern pattern(c.pattern);
bool result = pattern.MatchesString(c.candidate);
EXPECT_EQ(c.expected_match, result) << i << ": \"" << c.pattern
<< "\", \"" << c.candidate << "\"";
}
}
|
