|
25 | 25 | * - no leaveNode(), as we do all in enterNode() that calls refactor() method |
26 | 26 | * - cached visitors per node class for performance, e.g. when we find rules for Class_ node, they're cached for next time |
27 | 27 | * - immutability features, register Rector rules once, then use; no changes on the fly |
| 28 | + * @see \Rector\Tests\PhpParser\NodeTraverser\RectorNodeTraverserTest |
28 | 29 | */ |
29 | 30 | final class RectorNodeTraverser implements NodeTraverserInterface |
30 | 31 | { |
@@ -100,16 +101,16 @@ public function getVisitorsForNode(Node $node): array |
100 | 101 | if (! isset($this->visitorsPerNodeClass[$nodeClass])) { |
101 | 102 | $this->visitorsPerNodeClass[$nodeClass] = []; |
102 | 103 |
|
103 | | - foreach ($this->rectors as $visitor) { |
104 | | - foreach ($visitor->getNodeTypes() as $nodeType) { |
| 104 | + foreach ($this->rectors as $rector) { |
| 105 | + foreach ($rector->getNodeTypes() as $nodeType) { |
105 | 106 | // BC layer matching |
106 | 107 | if ($nodeType === FileWithoutNamespace::class && $nodeClass === FileNode::class) { |
107 | | - $this->visitorsPerNodeClass[$nodeClass][] = $visitor; |
| 108 | + $this->visitorsPerNodeClass[$nodeClass][] = $rector; |
108 | 109 | continue; |
109 | 110 | } |
110 | 111 |
|
111 | 112 | if (is_a($nodeClass, $nodeType, true)) { |
112 | | - $this->visitorsPerNodeClass[$nodeClass][] = $visitor; |
| 113 | + $this->visitorsPerNodeClass[$nodeClass][] = $rector; |
113 | 114 | continue 2; |
114 | 115 | } |
115 | 116 | } |
@@ -241,7 +242,7 @@ private function traverseNode(Node $node): void |
241 | 242 |
|
242 | 243 | /** |
243 | 244 | * @param Node[] $nodes |
244 | | - * @return \PhpParser\Node[] Result of traversal (may be original array or changed one) |
| 245 | + * @return Node[] Result of traversal (may be original array or changed one) |
245 | 246 | */ |
246 | 247 | private function traverseArray(array $nodes): array |
247 | 248 | { |
|
0 commit comments