mirror of
https://github.com/rectorphp/rector.git
synced 2024-06-02 17:30:50 +00:00
7e7a2f067a
476cfb00cb
disable fallback for now
96 lines
2.9 KiB
PHP
96 lines
2.9 KiB
PHP
<?php
|
|
|
|
declare (strict_types=1);
|
|
namespace Rector\PhpParser\Comparing;
|
|
|
|
use PhpParser\Node;
|
|
use Rector\Comments\CommentRemover;
|
|
use Rector\PhpParser\Printer\BetterStandardPrinter;
|
|
final class NodeComparator
|
|
{
|
|
/**
|
|
* @readonly
|
|
* @var \Rector\Comments\CommentRemover
|
|
*/
|
|
private $commentRemover;
|
|
/**
|
|
* @readonly
|
|
* @var \Rector\PhpParser\Printer\BetterStandardPrinter
|
|
*/
|
|
private $betterStandardPrinter;
|
|
public function __construct(CommentRemover $commentRemover, BetterStandardPrinter $betterStandardPrinter)
|
|
{
|
|
$this->commentRemover = $commentRemover;
|
|
$this->betterStandardPrinter = $betterStandardPrinter;
|
|
}
|
|
/**
|
|
* Removes all comments from both nodes
|
|
* @param Node|Node[]|null $node
|
|
*/
|
|
public function printWithoutComments($node) : string
|
|
{
|
|
$node = $this->commentRemover->removeFromNode($node);
|
|
$content = $this->betterStandardPrinter->print($node);
|
|
return \trim($content);
|
|
}
|
|
/**
|
|
* @param Node|Node[]|null $firstNode
|
|
* @param Node|Node[]|null $secondNode
|
|
*/
|
|
public function areNodesEqual($firstNode, $secondNode) : bool
|
|
{
|
|
if ($firstNode instanceof Node && !$secondNode instanceof Node) {
|
|
return \false;
|
|
}
|
|
if (!$firstNode instanceof Node && $secondNode instanceof Node) {
|
|
return \false;
|
|
}
|
|
if (\is_array($firstNode) && !\is_array($secondNode)) {
|
|
return \false;
|
|
}
|
|
if (!\is_array($secondNode)) {
|
|
return $this->printWithoutComments($firstNode) === $this->printWithoutComments($secondNode);
|
|
}
|
|
if (\is_array($firstNode)) {
|
|
return $this->printWithoutComments($firstNode) === $this->printWithoutComments($secondNode);
|
|
}
|
|
return \false;
|
|
}
|
|
/**
|
|
* @api
|
|
* @param Node[] $availableNodes
|
|
*/
|
|
public function isNodeEqual(Node $singleNode, array $availableNodes) : bool
|
|
{
|
|
foreach ($availableNodes as $availableNode) {
|
|
if ($this->areNodesEqual($singleNode, $availableNode)) {
|
|
return \true;
|
|
}
|
|
}
|
|
return \false;
|
|
}
|
|
/**
|
|
* Checks even clone nodes
|
|
*/
|
|
public function areSameNode(Node $firstNode, Node $secondNode) : bool
|
|
{
|
|
if ($firstNode === $secondNode) {
|
|
return \true;
|
|
}
|
|
$firstClass = \get_class($firstNode);
|
|
$secondClass = \get_class($secondNode);
|
|
if ($firstClass !== $secondClass) {
|
|
return \false;
|
|
}
|
|
if ($firstNode->getStartTokenPos() !== $secondNode->getStartTokenPos()) {
|
|
return \false;
|
|
}
|
|
if ($firstNode->getEndTokenPos() !== $secondNode->getEndTokenPos()) {
|
|
return \false;
|
|
}
|
|
$printFirstNode = $this->betterStandardPrinter->print($firstNode);
|
|
$printSecondNode = $this->betterStandardPrinter->print($secondNode);
|
|
return $printFirstNode === $printSecondNode;
|
|
}
|
|
}
|