Repository navigation
Expand file tree
/
Copy pathNodeTraverserTest.php
More file actions
145 lines (122 loc) · 5.19 KB
/
Copy pathNodeTraverserTest.php
File metadata and controls
145 lines (122 loc) · 5.19 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
132
133
134
135
136
137
138
139
140
141
142
143
144
145
<?php
/*
* This file is part of Twig.
*
* (c) Fabien Potencier
*
* For the full copyright and license information, please view the LICENSE
* file that was distributed with this source code.
*/
namespace Twig\Tests;
use PHPUnit\Framework\TestCase;
use Twig\Environment;
use Twig\Loader\ArrayLoader;
use Twig\Node\Node;
use Twig\NodeTraverser;
use Twig\NodeVisitor\NodeVisitorInterface;
class NodeTraverserTest extends TestCase
{
public function testVisitorsTraverseTheWholeTreeOneAfterTheOtherByPriority(): void
{
$log = [];
$tree = new NodeTraverserTestNode('root', [
'a' => new NodeTraverserTestNode('a'),
'b' => new NodeTraverserTestNode('b', [new NodeTraverserTestNode('c')]),
]);
$traverser = new NodeTraverser(new Environment(new ArrayLoader()), [
new NodeTraverserTestVisitor('late', 10, $log),
new NodeTraverserTestVisitor('early', -10, $log),
new NodeTraverserTestVisitor('middle', 0, $log),
]);
$this->assertSame($tree, $traverser->traverse($tree));
$this->assertSame([
'early enters root', 'early enters a', 'early leaves a', 'early enters b', 'early enters c', 'early leaves c', 'early leaves b', 'early leaves root',
'middle enters root', 'middle enters a', 'middle leaves a', 'middle enters b', 'middle enters c', 'middle leaves c', 'middle leaves b', 'middle leaves root',
'late enters root', 'late enters a', 'late leaves a', 'late enters b', 'late enters c', 'late leaves c', 'late leaves b', 'late leaves root',
], $log);
}
public function testVisitorsCanReplaceAndRemoveNodes(): void
{
$log = [];
$tree = new NodeTraverserTestNode('root', [
'replacedOnEnter' => new NodeTraverserTestNode('old', [new NodeTraverserTestNode('old child')]),
'removed' => new NodeTraverserTestNode('removed'),
'replacedOnLeave' => new NodeTraverserTestNode('leaving'),
]);
$visitor = new NodeTraverserTestVisitor('visitor', 0, $log);
$visitor->onEnter = static fn (Node $node) => 'old' === $node->getAttribute('name') ? new NodeTraverserTestNode('new', [new NodeTraverserTestNode('new child')]) : $node;
$visitor->onLeave = static fn (Node $node) => match ($node->getAttribute('name')) {
'removed' => null,
'leaving' => new NodeTraverserTestNode('left'),
default => $node,
};
(new NodeTraverser(new Environment(new ArrayLoader()), [$visitor]))->traverse($tree);
$this->assertSame([
'visitor enters root',
'visitor enters old', 'visitor enters new child', 'visitor leaves new child', 'visitor leaves new',
'visitor enters removed', 'visitor leaves removed',
'visitor enters leaving', 'visitor leaves leaving',
'visitor leaves root',
], $log);
$this->assertSame(['replacedOnEnter' => 'new', 'replacedOnLeave' => 'left'], array_map(static fn (Node $node) => $node->getAttribute('name'), iterator_to_array($tree)));
}
public function testChildrenAreTheOnesTheNodeHadAfterBeingEntered(): void
{
$log = [];
$tree = new NodeTraverserTestNode('root', [
'a' => new NodeTraverserTestNode('a'),
'b' => new NodeTraverserTestNode('b'),
]);
$visitor = new NodeTraverserTestVisitor('visitor', 0, $log);
$visitor->onEnter = static function (Node $node) use ($tree) {
if ($node === $tree) {
$tree->setNode('c', new NodeTraverserTestNode('c'));
} elseif ('a' === $node->getAttribute('name')) {
$tree->removeNode('b');
$tree->setNode('d', new NodeTraverserTestNode('d'));
}
return $node;
};
(new NodeTraverser(new Environment(new ArrayLoader()), [$visitor]))->traverse($tree);
$this->assertSame([
'visitor enters root',
'visitor enters a', 'visitor leaves a',
'visitor enters b', 'visitor leaves b',
'visitor enters c', 'visitor leaves c',
'visitor leaves root',
], $log);
$this->assertSame(['a', 'c', 'd'], array_keys(iterator_to_array($tree)));
}
}
class NodeTraverserTestNode extends Node
{
public function __construct(string $name, array $nodes = [])
{
parent::__construct($nodes, ['name' => $name]);
}
}
class NodeTraverserTestVisitor implements NodeVisitorInterface
{
public ?\Closure $onEnter = null;
public ?\Closure $onLeave = null;
public function __construct(
private string $name,
private int $priority,
private array &$log,
) {
}
public function enterNode(Node $node, Environment $env): Node
{
$this->log[] = $this->name.' enters '.$node->getAttribute('name');
return $this->onEnter ? ($this->onEnter)($node) : $node;
}
public function leaveNode(Node $node, Environment $env): ?Node
{
$this->log[] = $this->name.' leaves '.$node->getAttribute('name');
return $this->onLeave ? ($this->onLeave)($node) : $node;
}
public function getPriority(): int
{
return $this->priority;
}
}