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
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
|
<?php declare(strict_types=1);
/*
* This file is part of sebastian/complexity.
*
* (c) Sebastian Bergmann <sebastian@phpunit.de>
*
* For the full copyright and license information, please view the LICENSE
* file that was distributed with this source code.
*/
namespace SebastianBergmann\Complexity;
use function file_get_contents;
use PhpParser\Node;
use PhpParser\NodeTraverser;
use PhpParser\NodeVisitor\NameResolver;
use PhpParser\NodeVisitor\ParentConnectingVisitor;
use PhpParser\NodeVisitorAbstract;
use PhpParser\ParserFactory;
use PHPUnit\Framework\Attributes\CoversClass;
use PHPUnit\Framework\Attributes\DataProvider;
use PHPUnit\Framework\Attributes\Small;
use PHPUnit\Framework\Attributes\UsesClass;
use PHPUnit\Framework\TestCase;
#[CoversClass(ComplexityCalculatingVisitor::class)]
#[UsesClass(Complexity::class)]
#[UsesClass(ComplexityCollection::class)]
#[UsesClass(ComplexityCollectionIterator::class)]
#[UsesClass(CyclomaticComplexityCalculatingVisitor::class)]
#[Small]
final class ComplexityCalculatingVisitorTest extends TestCase
{
/**
* @return array<string, array{0: bool}>
*/
public static function shortCircuitTraversalProvider(): array
{
return [
'short-circuit traversal' => [true],
'no short-circuit traversal' => [false],
];
}
#[DataProvider('shortCircuitTraversalProvider')]
public function testCalculatesComplexityForAbstractSyntaxTreeOfClass(bool $shortCircuitTraversal): void
{
$source = file_get_contents(__DIR__ . '/../_fixture/ExampleClass.php');
$this->assertIsString($source);
$nodes = (new ParserFactory)->createForHostVersion()->parse($source);
$this->assertNotNull($nodes);
$traverser = new NodeTraverser;
$complexityCalculatingVisitor = new ComplexityCalculatingVisitor($shortCircuitTraversal);
$shortCircuitVisitor = new class extends NodeVisitorAbstract
{
private int $numberOfNodesVisited = 0;
public function enterNode(Node $node): void
{
$this->numberOfNodesVisited++;
}
public function numberOfNodesVisited(): int
{
return $this->numberOfNodesVisited;
}
};
$traverser->addVisitor(new NameResolver);
$traverser->addVisitor(new ParentConnectingVisitor);
$traverser->addVisitor($complexityCalculatingVisitor);
$traverser->addVisitor($shortCircuitVisitor);
/* @noinspection UnusedFunctionResultInspection */
$traverser->traverse($nodes);
$this->assertSame(14, $complexityCalculatingVisitor->result()->cyclomaticComplexity());
if ($shortCircuitTraversal) {
$this->assertSame(12, $shortCircuitVisitor->numberOfNodesVisited());
} else {
$this->assertSame(73, $shortCircuitVisitor->numberOfNodesVisited());
}
}
#[DataProvider('shortCircuitTraversalProvider')]
public function testCalculatesComplexityForAbstractSyntaxTreeOfAnonymousClass(bool $shortCircuitTraversal): void
{
$source = file_get_contents(__DIR__ . '/../_fixture/anonymous_class.php');
$this->assertIsString($source);
$nodes = (new ParserFactory)->createForHostVersion()->parse($source);
$this->assertNotNull($nodes);
$traverser = new NodeTraverser;
$complexityCalculatingVisitor = new ComplexityCalculatingVisitor($shortCircuitTraversal);
$shortCircuitVisitor = new class extends NodeVisitorAbstract
{
private int $numberOfNodesVisited = 0;
public function enterNode(Node $node): void
{
$this->numberOfNodesVisited++;
}
public function numberOfNodesVisited(): int
{
return $this->numberOfNodesVisited;
}
};
$traverser->addVisitor(new NameResolver);
$traverser->addVisitor(new ParentConnectingVisitor);
$traverser->addVisitor($complexityCalculatingVisitor);
$traverser->addVisitor($shortCircuitVisitor);
/* @noinspection UnusedFunctionResultInspection */
$traverser->traverse($nodes);
$this->assertSame(14, $complexityCalculatingVisitor->result()->cyclomaticComplexity());
if ($shortCircuitTraversal) {
$this->assertSame(12, $shortCircuitVisitor->numberOfNodesVisited());
} else {
$this->assertSame(73, $shortCircuitVisitor->numberOfNodesVisited());
}
}
#[DataProvider('shortCircuitTraversalProvider')]
public function testCalculatesComplexityForAbstractSyntaxTreeOfInterface(bool $shortCircuitTraversal): void
{
$source = file_get_contents(__DIR__ . '/../_fixture/ExampleInterface.php');
$this->assertIsString($source);
$nodes = (new ParserFactory)->createForHostVersion()->parse($source);
$this->assertNotNull($nodes);
$traverser = new NodeTraverser;
$complexityCalculatingVisitor = new ComplexityCalculatingVisitor($shortCircuitTraversal);
$shortCircuitVisitor = new class extends NodeVisitorAbstract
{
private int $numberOfNodesVisited = 0;
public function enterNode(Node $node): void
{
$this->numberOfNodesVisited++;
}
public function numberOfNodesVisited(): int
{
return $this->numberOfNodesVisited;
}
};
$traverser->addVisitor(new NameResolver);
$traverser->addVisitor(new ParentConnectingVisitor);
$traverser->addVisitor($complexityCalculatingVisitor);
$traverser->addVisitor($shortCircuitVisitor);
/* @noinspection UnusedFunctionResultInspection */
$traverser->traverse($nodes);
$this->assertSame(0, $complexityCalculatingVisitor->result()->cyclomaticComplexity());
$this->assertSame(11, $shortCircuitVisitor->numberOfNodesVisited());
}
}
|
