Repository navigation
Expand file tree
/
Copy pathtesttokenrange.cpp
More file actions
131 lines (116 loc) · 4.84 KB
/
Copy pathtesttokenrange.cpp
File metadata and controls
131 lines (116 loc) · 4.84 KB
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
130
131
/*
* Cppcheck - A tool for static C/C++ code analysis
* Copyright (C) 2007-2026 Cppcheck team.
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#include "fixture.h"
#include "helpers.h"
#include "token.h"
#include "tokenrange.h"
#include "symboldatabase.h"
#include <algorithm>
#include <iterator>
#include <list>
#include <sstream>
#include <string>
class TestTokenRange : public TestFixture {
public:
TestTokenRange() : TestFixture("TestTokenRange") {}
private:
void run() override {
TEST_CASE(enumerationToEnd);
TEST_CASE(untilHelperToEnd);
TEST_CASE(untilHelperPartWay);
TEST_CASE(partialEnumeration);
TEST_CASE(scopeExample);
TEST_CASE(exampleAlgorithms);
}
static std::string testTokenRange(ConstTokenRange range, const Token* start, const Token* end) {
auto tokenToString = [](const Token* t) {
return t ? t->str() : "<null>";
};
int index = 0;
const Token* expected = start;
for (const Token* t : range) {
if (expected != t) {
std::ostringstream message;
message << "Failed to match token " << tokenToString(expected) << " at position " << index << ". Got " << tokenToString(t) << " instead";
return message.str();
}
index++;
expected = expected->next();
}
if (expected != end) {
std::ostringstream message;
message << "Failed to terminate on " << tokenToString(end) << ". Instead terminated on " << tokenToString(expected) << " at position " << index << ".";
return message.str();
}
return "";
}
void enumerationToEnd() const {
const char code[] = "void a(){} void main(){ if(true){a();} }\n";
const SimpleTokenList tokenList(code);
ASSERT_EQUALS("", testTokenRange(ConstTokenRange{ tokenList.front(), nullptr }, tokenList.front(), nullptr));
}
void untilHelperToEnd() const {
const char code[] = "void a(){} void main(){ if(true){a();} }\n";
const SimpleTokenList tokenList(code);
ASSERT_EQUALS("", testTokenRange(tokenList.front()->until(nullptr), tokenList.front(), nullptr));
}
void untilHelperPartWay() const {
const char code[] = "void a(){} void main(){ if(true){a();} }\n";
const SimpleTokenList tokenList(code);
const Token* start = tokenList.front()->tokAt(4);
const Token* end = start->tokAt(8);
ASSERT_EQUALS("", testTokenRange(start->until(end), start, end));
}
void partialEnumeration() const {
const char code[] = "void a(){} void main(){ if(true){a();} }\n";
const SimpleTokenList tokenList(code);
const Token* start = tokenList.front()->tokAt(4);
const Token* end = tokenList.front()->tokAt(10);
ASSERT_EQUALS("", testTokenRange(ConstTokenRange{ start, end }, start, end));
}
void scopeExample() {
SimpleTokenizer tokenizer(settingsDefault, *this);
const char code[] = "void a(){} void main(){ if(true){a();} }\n";
ASSERT(tokenizer.tokenize(code));
const SymbolDatabase* sd = tokenizer.getSymbolDatabase();
const Scope& scope = *std::next(sd->scopeList.cbegin(), 3); //The scope of the if block
std::string contents;
for (const Token* t : ConstTokenRange{ scope.bodyStart->next(), scope.bodyEnd }) {
contents += t->str();
}
ASSERT_EQUALS("a();", contents);
}
void exampleAlgorithms() const {
const char code[] = "void a(){} void main(){ if(true){a();} }\n";
const SimpleTokenList tokenList(code);
ConstTokenRange range{ tokenList.front(), nullptr };
ASSERT_EQUALS(true, std::all_of(range.begin(), range.end(), [](const Token*) {
return true;
}));
ASSERT_EQUALS(true, std::any_of(range.begin(), range.end(), [](const Token* t) {
return t->str() == "true";
}));
ASSERT_EQUALS("true", (*std::find_if(range.begin(), range.end(), [](const Token* t) {
return t->str() == "true";
}))->str());
ASSERT_EQUALS(3, std::count_if(range.begin(), range.end(), [](const Token* t) {
return t->str() == "{";
}));
}
};
REGISTER_TEST(TestTokenRange)