2011-07-12 17:58:59 +02:00
|
|
|
<?php
|
|
|
|
|
|
|
|
class PHPParser_NodeTraverser
|
|
|
|
{
|
2011-08-09 09:27:47 +02:00
|
|
|
/**
|
|
|
|
* @var PHPParser_NodeVisitorInterface[] Visitors
|
|
|
|
*/
|
|
|
|
protected $visitors;
|
2011-07-12 17:58:59 +02:00
|
|
|
|
|
|
|
/**
|
|
|
|
* Constructs a node traverser.
|
|
|
|
*/
|
|
|
|
public function __construct() {
|
2011-08-09 09:27:47 +02:00
|
|
|
$this->visitors = array();
|
2011-07-12 17:58:59 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
2011-08-09 09:27:47 +02:00
|
|
|
* Adds a visitor.
|
2011-07-12 17:58:59 +02:00
|
|
|
*
|
2011-08-09 09:27:47 +02:00
|
|
|
* @param PHPParser_NodeVisitorInterface $visitor Visitor to add
|
2011-07-12 17:58:59 +02:00
|
|
|
*/
|
2011-08-09 09:27:47 +02:00
|
|
|
public function addVisitor(PHPParser_NodeVisitorInterface $visitor) {
|
|
|
|
$this->visitors[] = $visitor;
|
2011-07-12 17:58:59 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Traverses a node or an array using the registered visitors.
|
|
|
|
*
|
2011-07-13 23:07:05 +02:00
|
|
|
* @param PHPParser_NodeAbstract|array $node Node or array
|
2011-07-12 17:58:59 +02:00
|
|
|
*/
|
2011-08-09 09:27:47 +02:00
|
|
|
public function traverse(&$node) {
|
|
|
|
foreach ($this->visitors as $visitor) {
|
|
|
|
$visitor->beforeTraverse($node);
|
|
|
|
}
|
|
|
|
|
|
|
|
$this->_traverse($node);
|
|
|
|
|
|
|
|
foreach ($this->visitors as $visitor) {
|
|
|
|
$visitor->afterTraverse($node);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
protected function _traverse(&$node) {
|
2011-08-09 12:32:18 +02:00
|
|
|
if (!is_array($node) && !$node instanceof Traversable) {
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2011-08-19 17:19:27 +02:00
|
|
|
$doNodes = array();
|
2011-08-09 12:32:18 +02:00
|
|
|
|
|
|
|
foreach ($node as $subNodeKey => &$subNode) {
|
|
|
|
if ($subNode instanceof PHPParser_NodeAbstract) {
|
|
|
|
foreach ($this->visitors as $visitor) {
|
|
|
|
$visitor->enterNode($subNode);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
$this->_traverse($subNode);
|
|
|
|
|
|
|
|
if ($subNode instanceof PHPParser_NodeAbstract) {
|
|
|
|
foreach ($this->visitors as $visitor) {
|
|
|
|
$return = $visitor->leaveNode($subNode);
|
|
|
|
|
|
|
|
if (false === $return) {
|
2011-08-19 17:19:27 +02:00
|
|
|
$doNodes[] = array($subNodeKey, array());
|
|
|
|
break;
|
2011-08-09 12:32:18 +02:00
|
|
|
} elseif (is_array($return)) {
|
2011-08-19 17:19:27 +02:00
|
|
|
$doNodes[] = array($subNodeKey, $return);
|
|
|
|
break;
|
2011-08-09 12:32:18 +02:00
|
|
|
}
|
|
|
|
}
|
2011-07-12 17:58:59 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-08-19 17:19:27 +02:00
|
|
|
if (!empty($doNodes)) {
|
2011-08-09 12:32:18 +02:00
|
|
|
if (is_array($node)) {
|
2011-08-19 17:19:27 +02:00
|
|
|
while (list($key, $replace) = array_pop($doNodes)) {
|
|
|
|
array_splice($node, $key, 1, $replace);
|
2011-08-09 12:32:18 +02:00
|
|
|
}
|
|
|
|
} else {
|
2011-08-19 17:19:27 +02:00
|
|
|
while (list($key, $replace) = array_pop($doNodes)) {
|
|
|
|
if (!empty($replace)) {
|
|
|
|
throw new Exception('Nodes can only be merged if the parent is an array');
|
|
|
|
}
|
2011-07-12 17:58:59 +02:00
|
|
|
|
2011-08-19 17:19:27 +02:00
|
|
|
unset($node[$key]);
|
2011-08-09 12:32:18 +02:00
|
|
|
}
|
2011-07-12 17:58:59 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|