-
Notifications
You must be signed in to change notification settings - Fork 64
/
Copy pathNodeTraverserTest.php
411 lines (357 loc) · 12.7 KB
/
NodeTraverserTest.php
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
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
<?php declare(strict_types = 1);
namespace PHPStan\PhpDocParser\Ast;
use LogicException;
use PHPStan\PhpDocParser\Ast\ConstExpr\ConstExprFloatNode;
use PHPStan\PhpDocParser\Ast\ConstExpr\ConstExprIntegerNode;
use PHPStan\PhpDocParser\Ast\ConstExpr\ConstExprStringNode;
use PHPStan\PhpDocParser\Ast\PhpDoc\ReturnTagValueNode;
use PHPStan\PhpDocParser\Ast\Type\ConstTypeNode;
use PHPStan\PhpDocParser\Ast\Type\IdentifierTypeNode;
use PHPStan\PhpDocParser\Ast\Type\IntersectionTypeNode;
use PHPStan\PhpDocParser\Ast\Type\NullableTypeNode;
use PHPStan\PhpDocParser\Ast\Type\ThisTypeNode;
use PHPStan\PhpDocParser\Ast\Type\UnionTypeNode;
use PHPUnit\Framework\TestCase;
/**
* Inspired by https://github.com/nikic/PHP-Parser/tree/36a6dcd04e7b0285e8f0868f44bd4927802f7df1
*
* Copyright (c) 2011, Nikita Popov
* All rights reserved.
*/
class NodeTraverserTest extends TestCase
{
public function testNonModifying(): void
{
$str1Node = new IdentifierTypeNode('Foo');
$str2Node = new IdentifierTypeNode('Bar');
$echoNode = new UnionTypeNode([$str1Node, $str2Node]);
$nodes = [$echoNode];
$visitor = new NodeVisitorForTesting();
$traverser = new NodeTraverser([$visitor]);
$this->assertEquals($nodes, $traverser->traverse($nodes));
$this->assertEquals([
['beforeTraverse', $nodes],
['enterNode', $echoNode],
['enterNode', $str1Node],
['leaveNode', $str1Node],
['enterNode', $str2Node],
['leaveNode', $str2Node],
['leaveNode', $echoNode],
['afterTraverse', $nodes],
], $visitor->trace);
}
public function testModifying(): void
{
$str1Node = new IdentifierTypeNode('Foo');
$str2Node = new IdentifierTypeNode('Bar');
$printNode = new NullableTypeNode($str1Node);
// first visitor changes the node, second verifies the change
$visitor1 = new NodeVisitorForTesting([
['beforeTraverse', [], [$str1Node]],
['enterNode', $str1Node, $printNode],
['enterNode', $str1Node, $str2Node],
['leaveNode', $str2Node, $str1Node],
['leaveNode', $printNode, $str1Node],
['afterTraverse', [$str1Node], []],
]);
$visitor2 = new NodeVisitorForTesting();
$traverser = new NodeTraverser([$visitor1, $visitor2]);
// as all operations are reversed we end where we start
$this->assertEquals([], $traverser->traverse([]));
$this->assertEquals([
['beforeTraverse', [$str1Node]],
['enterNode', $printNode],
['enterNode', $str2Node],
['leaveNode', $str1Node],
['leaveNode', $str1Node],
['afterTraverse', []],
], $visitor2->trace);
}
public function testRemoveFromLeave(): void
{
$str1Node = new IdentifierTypeNode('Foo');
$str2Node = new IdentifierTypeNode('Bar');
$visitor = new NodeVisitorForTesting([
['leaveNode', $str1Node, NodeTraverser::REMOVE_NODE],
]);
$visitor2 = new NodeVisitorForTesting();
$traverser = new NodeTraverser([$visitor, $visitor2]);
$nodes = [$str1Node, $str2Node];
$this->assertEquals([$str2Node], $traverser->traverse($nodes));
$this->assertEquals([
['beforeTraverse', $nodes],
['enterNode', $str1Node],
['enterNode', $str2Node],
['leaveNode', $str2Node],
['afterTraverse', [$str2Node]],
], $visitor2->trace);
}
public function testRemoveFromEnter(): void
{
$str1Node = new IdentifierTypeNode('Foo');
$str2Node = new IdentifierTypeNode('Bar');
$visitor = new NodeVisitorForTesting([
['enterNode', $str1Node, NodeTraverser::REMOVE_NODE],
]);
$visitor2 = new NodeVisitorForTesting();
$traverser = new NodeTraverser([$visitor, $visitor2]);
$nodes = [$str1Node, $str2Node];
$this->assertEquals([$str2Node], $traverser->traverse($nodes));
$this->assertEquals([
['beforeTraverse', $nodes],
['enterNode', $str2Node],
['leaveNode', $str2Node],
['afterTraverse', [$str2Node]],
], $visitor2->trace);
}
public function testReturnArrayFromEnter(): void
{
$str1Node = new IdentifierTypeNode('Str1');
$str2Node = new IdentifierTypeNode('Str2');
$str3Node = new IdentifierTypeNode('Str3');
$str4Node = new IdentifierTypeNode('Str4');
$visitor = new NodeVisitorForTesting([
['enterNode', $str1Node, [$str3Node, $str4Node]],
]);
$visitor2 = new NodeVisitorForTesting();
$traverser = new NodeTraverser([$visitor, $visitor2]);
$nodes = [$str1Node, $str2Node];
$this->assertEquals([$str3Node, $str4Node, $str2Node], $traverser->traverse($nodes));
$this->assertEquals([
['beforeTraverse', $nodes],
['enterNode', $str2Node],
['leaveNode', $str2Node],
['afterTraverse', [$str3Node, $str4Node, $str2Node]],
], $visitor2->trace);
}
public function testMerge(): void
{
$strStart = new IdentifierTypeNode('Start');
$strMiddle = new IdentifierTypeNode('End');
$strEnd = new IdentifierTypeNode('Middle');
$strR1 = new IdentifierTypeNode('Replacement 1');
$strR2 = new IdentifierTypeNode('Replacement 2');
$visitor = new NodeVisitorForTesting([
['leaveNode', $strMiddle, [$strR1, $strR2]],
]);
$traverser = new NodeTraverser([$visitor]);
$this->assertEquals(
[$strStart, $strR1, $strR2, $strEnd],
$traverser->traverse([$strStart, $strMiddle, $strEnd]),
);
}
public function testInvalidDeepArray(): void
{
$this->expectException(LogicException::class);
$this->expectExceptionMessage('Invalid node structure: Contains nested arrays');
$strNode = new IdentifierTypeNode('Foo');
$nodes = [[[$strNode]]];
$traverser = new NodeTraverser([]);
// @phpstan-ignore-next-line
$this->assertEquals($nodes, $traverser->traverse($nodes));
}
public function testDontTraverseChildren(): void
{
$strNode = new IdentifierTypeNode('str');
$printNode = new NullableTypeNode($strNode);
$varNode = new ThisTypeNode();
$mulNode = new UnionTypeNode([$varNode, $varNode]);
$negNode = new NullableTypeNode($mulNode);
$nodes = [$printNode, $negNode];
$visitor1 = new NodeVisitorForTesting([
['enterNode', $printNode, NodeTraverser::DONT_TRAVERSE_CHILDREN],
]);
$visitor2 = new NodeVisitorForTesting([
['enterNode', $mulNode, NodeTraverser::DONT_TRAVERSE_CHILDREN],
]);
$expectedTrace = [
['beforeTraverse', $nodes],
['enterNode', $printNode],
['leaveNode', $printNode],
['enterNode', $negNode],
['enterNode', $mulNode],
['leaveNode', $mulNode],
['leaveNode', $negNode],
['afterTraverse', $nodes],
];
$traverser = new NodeTraverser([$visitor1, $visitor2]);
$this->assertEquals($nodes, $traverser->traverse($nodes));
$this->assertEquals($expectedTrace, $visitor1->trace);
$this->assertEquals($expectedTrace, $visitor2->trace);
}
public function testDontTraverseCurrentAndChildren(): void
{
$strNode = new IdentifierTypeNode('str');
$printNode = new NullableTypeNode($strNode);
$varNode = new IdentifierTypeNode('foo');
$mulNode = new UnionTypeNode([$varNode, $varNode]);
$divNode = new IntersectionTypeNode([$varNode, $varNode]);
$negNode = new NullableTypeNode($mulNode);
$nodes = [$printNode, $negNode];
$visitor1 = new NodeVisitorForTesting([
['enterNode', $printNode, NodeTraverser::DONT_TRAVERSE_CURRENT_AND_CHILDREN],
['enterNode', $mulNode, NodeTraverser::DONT_TRAVERSE_CURRENT_AND_CHILDREN],
['leaveNode', $mulNode, $divNode],
]);
$visitor2 = new NodeVisitorForTesting();
$traverser = new NodeTraverser([$visitor1, $visitor2]);
$resultNodes = $traverser->traverse($nodes);
$this->assertInstanceOf(NullableTypeNode::class, $resultNodes[1]);
$this->assertInstanceOf(IntersectionTypeNode::class, $resultNodes[1]->type);
$this->assertEquals([
['beforeTraverse', $nodes],
['enterNode', $printNode],
['leaveNode', $printNode],
['enterNode', $negNode],
['enterNode', $mulNode],
['leaveNode', $mulNode],
['leaveNode', $negNode],
['afterTraverse', $resultNodes],
], $visitor1->trace);
$this->assertEquals([
['beforeTraverse', $nodes],
['enterNode', $negNode],
['leaveNode', $negNode],
['afterTraverse', $resultNodes],
], $visitor2->trace);
}
public function testStopTraversal(): void
{
$varNode1 = new IdentifierTypeNode('a');
$varNode2 = new IdentifierTypeNode('b');
$varNode3 = new IdentifierTypeNode('c');
$mulNode = new UnionTypeNode([$varNode1, $varNode2]);
$printNode = new NullableTypeNode($varNode3);
$nodes = [$mulNode, $printNode];
// From enterNode() with array parent
$visitor = new NodeVisitorForTesting([
['enterNode', $mulNode, NodeTraverser::STOP_TRAVERSAL],
]);
$traverser = new NodeTraverser([$visitor]);
$this->assertEquals($nodes, $traverser->traverse($nodes));
$this->assertEquals([
['beforeTraverse', $nodes],
['enterNode', $mulNode],
['afterTraverse', $nodes],
], $visitor->trace);
// From enterNode with Node parent
$visitor = new NodeVisitorForTesting([
['enterNode', $varNode1, NodeTraverser::STOP_TRAVERSAL],
]);
$traverser = new NodeTraverser([$visitor]);
$this->assertEquals($nodes, $traverser->traverse($nodes));
$this->assertEquals([
['beforeTraverse', $nodes],
['enterNode', $mulNode],
['enterNode', $varNode1],
['afterTraverse', $nodes],
], $visitor->trace);
// From leaveNode with Node parent
$visitor = new NodeVisitorForTesting([
['leaveNode', $varNode1, NodeTraverser::STOP_TRAVERSAL],
]);
$traverser = new NodeTraverser([$visitor]);
$this->assertEquals($nodes, $traverser->traverse($nodes));
$this->assertEquals([
['beforeTraverse', $nodes],
['enterNode', $mulNode],
['enterNode', $varNode1],
['leaveNode', $varNode1],
['afterTraverse', $nodes],
], $visitor->trace);
// From leaveNode with array parent
$visitor = new NodeVisitorForTesting([
['leaveNode', $mulNode, NodeTraverser::STOP_TRAVERSAL],
]);
$traverser = new NodeTraverser([$visitor]);
$this->assertEquals($nodes, $traverser->traverse($nodes));
$this->assertEquals([
['beforeTraverse', $nodes],
['enterNode', $mulNode],
['enterNode', $varNode1],
['leaveNode', $varNode1],
['enterNode', $varNode2],
['leaveNode', $varNode2],
['leaveNode', $mulNode],
['afterTraverse', $nodes],
], $visitor->trace);
// Check that pending array modifications are still carried out
$visitor = new NodeVisitorForTesting([
['leaveNode', $mulNode, NodeTraverser::REMOVE_NODE],
['enterNode', $printNode, NodeTraverser::STOP_TRAVERSAL],
]);
$traverser = new NodeTraverser([$visitor]);
$this->assertEquals([$printNode], $traverser->traverse($nodes));
$this->assertEquals([
['beforeTraverse', $nodes],
['enterNode', $mulNode],
['enterNode', $varNode1],
['leaveNode', $varNode1],
['enterNode', $varNode2],
['leaveNode', $varNode2],
['leaveNode', $mulNode],
['enterNode', $printNode],
['afterTraverse', [$printNode]],
], $visitor->trace);
}
public function testNoCloneNodes(): void
{
$nodes = [new UnionTypeNode([new IdentifierTypeNode('Foo'), new IdentifierTypeNode('Bar')])];
$traverser = new NodeTraverser([]);
$this->assertSame($nodes, $traverser->traverse($nodes));
}
/**
* @dataProvider provideTestInvalidReturn
* @param Node[] $nodes
*/
public function testInvalidReturn(array $nodes, NodeVisitor $visitor, string $message): void
{
$this->expectException(LogicException::class);
$this->expectExceptionMessage($message);
$traverser = new NodeTraverser([$visitor]);
$traverser->traverse($nodes);
}
/**
* @return list<list<mixed>>
*/
public function provideTestInvalidReturn(): array
{
$num = new ConstExprIntegerNode('42');
$expr = new ConstTypeNode($num);
$nodes = [$expr];
$visitor1 = new NodeVisitorForTesting([
['enterNode', $expr, 'foobar'],
]);
$visitor2 = new NodeVisitorForTesting([
['enterNode', $num, 'foobar'],
]);
$visitor3 = new NodeVisitorForTesting([
['leaveNode', $num, 'foobar'],
]);
$visitor4 = new NodeVisitorForTesting([
['leaveNode', $expr, 'foobar'],
]);
$visitor5 = new NodeVisitorForTesting([
['leaveNode', $num, [new ConstExprFloatNode('42.0')]],
]);
$visitor6 = new NodeVisitorForTesting([
['leaveNode', $expr, false],
]);
$visitor7 = new NodeVisitorForTesting([
['enterNode', $expr, new ConstExprIntegerNode('42')],
]);
$visitor8 = new NodeVisitorForTesting([
['enterNode', $num, new ReturnTagValueNode(new ConstTypeNode(new ConstExprStringNode('foo', ConstExprStringNode::SINGLE_QUOTED)), '')],
]);
return [
[$nodes, $visitor1, 'enterNode() returned invalid value of type string'],
[$nodes, $visitor2, 'enterNode() returned invalid value of type string'],
[$nodes, $visitor3, 'leaveNode() returned invalid value of type string'],
[$nodes, $visitor4, 'leaveNode() returned invalid value of type string'],
[$nodes, $visitor5, 'leaveNode() may only return an array if the parent structure is an array'],
[$nodes, $visitor6, 'leaveNode() returned invalid value of type bool'],
[$nodes, $visitor7, 'Trying to replace TypeNode with PHPStan\PhpDocParser\Ast\ConstExpr\ConstExprIntegerNode'],
[$nodes, $visitor8, 'Trying to replace ConstExprNode with PHPStan\PhpDocParser\Ast\PhpDoc\ReturnTagValueNode'],
];
}
}