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
|
// Copyright 2015 Google Inc. All rights reserved
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
// +build ignore
#include "strutil.h"
#include <assert.h>
#include <string>
#include <vector>
#include "string_piece.h"
#include "testutil.h"
using namespace std;
namespace {
void TestWordScanner() {
vector<StringPiece> ss;
for (StringPiece tok : WordScanner("foo bar baz")) {
ss.push_back(tok);
}
assert(ss.size() == 3LU);
ASSERT_EQ(ss[0], "foo");
ASSERT_EQ(ss[1], "bar");
ASSERT_EQ(ss[2], "baz");
}
void TestHasPrefix() {
assert(HasPrefix("foo", "foo"));
assert(HasPrefix("foo", "fo"));
assert(HasPrefix("foo", ""));
assert(!HasPrefix("foo", "fooo"));
}
void TestHasSuffix() {
assert(HasSuffix("bar", "bar"));
assert(HasSuffix("bar", "ar"));
assert(HasSuffix("bar", ""));
assert(!HasSuffix("bar", "bbar"));
}
string SubstPattern(StringPiece str, StringPiece pat, StringPiece subst) {
string r;
Pattern(pat).AppendSubst(str, subst, &r);
return r;
}
void TestSubstPattern() {
ASSERT_EQ(SubstPattern("x.c", "%.c", "%.o"), "x.o");
ASSERT_EQ(SubstPattern("c.x", "c.%", "o.%"), "o.x");
ASSERT_EQ(SubstPattern("x.c.c", "%.c", "%.o"), "x.c.o");
ASSERT_EQ(SubstPattern("x.x y.c", "%.c", "%.o"), "x.x y.o");
ASSERT_EQ(SubstPattern("x.%.c", "%.%.c", "OK"), "OK");
ASSERT_EQ(SubstPattern("x.c", "x.c", "OK"), "OK");
ASSERT_EQ(SubstPattern("x.c.c", "x.c", "XX"), "x.c.c");
ASSERT_EQ(SubstPattern("x.x.c", "x.c", "XX"), "x.x.c");
}
void TestNoLineBreak() {
assert(NoLineBreak("a\nb") == "a\\nb");
assert(NoLineBreak("a\nb\nc") == "a\\nb\\nc");
}
void TestHasWord() {
assert(HasWord("foo bar baz", "bar"));
assert(HasWord("foo bar baz", "foo"));
assert(HasWord("foo bar baz", "baz"));
assert(!HasWord("foo bar baz", "oo"));
assert(!HasWord("foo bar baz", "ar"));
assert(!HasWord("foo bar baz", "ba"));
assert(!HasWord("foo bar baz", "az"));
assert(!HasWord("foo bar baz", "ba"));
assert(!HasWord("foo bar baz", "fo"));
}
static string NormalizePath(string s) {
::NormalizePath(&s);
return s;
}
void TestNormalizePath() {
ASSERT_EQ(NormalizePath(""), "");
ASSERT_EQ(NormalizePath("."), "");
ASSERT_EQ(NormalizePath("/"), "/");
ASSERT_EQ(NormalizePath("/tmp"), "/tmp");
ASSERT_EQ(NormalizePath("////tmp////"), "/tmp");
ASSERT_EQ(NormalizePath("a////b"), "a/b");
ASSERT_EQ(NormalizePath("a//.//b"), "a/b");
ASSERT_EQ(NormalizePath("a////b//../c/////"), "a/c");
ASSERT_EQ(NormalizePath("../foo"), "../foo");
ASSERT_EQ(NormalizePath("./foo"), "foo");
ASSERT_EQ(NormalizePath("x/y/..//../foo"), "foo");
ASSERT_EQ(NormalizePath("x/../../foo"), "../foo");
ASSERT_EQ(NormalizePath("/../foo"), "/foo");
ASSERT_EQ(NormalizePath("/../../foo"), "/foo");
ASSERT_EQ(NormalizePath("/a/../../foo"), "/foo");
ASSERT_EQ(NormalizePath("/a/b/.."), "/a");
ASSERT_EQ(NormalizePath("../../a/b"), "../../a/b");
ASSERT_EQ(NormalizePath("../../../a/b"), "../../../a/b");
ASSERT_EQ(NormalizePath(".././../a/b"), "../../a/b");
ASSERT_EQ(NormalizePath("./../../a/b"), "../../a/b");
}
} // namespace
int main() {
TestWordScanner();
TestHasPrefix();
TestHasSuffix();
TestSubstPattern();
TestNoLineBreak();
TestHasWord();
TestNormalizePath();
assert(!g_failed);
}
|
