mirror of https://github.com/rectorphp/rector.git
104 lines
2.9 KiB
PHP
104 lines
2.9 KiB
PHP
<?php
|
|
|
|
declare (strict_types=1);
|
|
namespace Rector\DeadCode\Rector\Switch_;
|
|
|
|
use PhpParser\Node;
|
|
use PhpParser\Node\Stmt\Break_;
|
|
use PhpParser\Node\Stmt\Case_;
|
|
use PhpParser\Node\Stmt\Return_;
|
|
use PhpParser\Node\Stmt\Switch_;
|
|
use Rector\Core\Rector\AbstractRector;
|
|
use Symplify\RuleDocGenerator\ValueObject\CodeSample\CodeSample;
|
|
use Symplify\RuleDocGenerator\ValueObject\RuleDefinition;
|
|
/**
|
|
* @see \Rector\Tests\DeadCode\Rector\Switch_\RemoveDuplicatedCaseInSwitchRector\RemoveDuplicatedCaseInSwitchRectorTest
|
|
*/
|
|
final class RemoveDuplicatedCaseInSwitchRector extends AbstractRector
|
|
{
|
|
public function getRuleDefinition() : RuleDefinition
|
|
{
|
|
return new RuleDefinition('2 following switch keys with identical will be reduced to one result', [new CodeSample(<<<'CODE_SAMPLE'
|
|
class SomeClass
|
|
{
|
|
public function run()
|
|
{
|
|
switch ($name) {
|
|
case 'clearHeader':
|
|
return $this->modifyHeader($node, 'remove');
|
|
case 'clearAllHeaders':
|
|
return $this->modifyHeader($node, 'replace');
|
|
case 'clearRawHeaders':
|
|
return $this->modifyHeader($node, 'replace');
|
|
case '...':
|
|
return 5;
|
|
}
|
|
}
|
|
}
|
|
CODE_SAMPLE
|
|
, <<<'CODE_SAMPLE'
|
|
class SomeClass
|
|
{
|
|
public function run()
|
|
{
|
|
switch ($name) {
|
|
case 'clearHeader':
|
|
return $this->modifyHeader($node, 'remove');
|
|
case 'clearAllHeaders':
|
|
case 'clearRawHeaders':
|
|
return $this->modifyHeader($node, 'replace');
|
|
case '...':
|
|
return 5;
|
|
}
|
|
}
|
|
}
|
|
CODE_SAMPLE
|
|
)]);
|
|
}
|
|
/**
|
|
* @return array<class-string<Node>>
|
|
*/
|
|
public function getNodeTypes() : array
|
|
{
|
|
return [Switch_::class];
|
|
}
|
|
/**
|
|
* @param Switch_ $node
|
|
*/
|
|
public function refactor(Node $node) : ?Node
|
|
{
|
|
if (\count($node->cases) < 2) {
|
|
return null;
|
|
}
|
|
/** @var Case_|null $previousCase */
|
|
$previousCase = null;
|
|
$hasChanged = \false;
|
|
foreach ($node->cases as $case) {
|
|
if ($previousCase instanceof Case_ && $this->areSwitchStmtsEqualsAndWithBreak($case, $previousCase)) {
|
|
$previousCase->stmts = [];
|
|
$hasChanged = \true;
|
|
}
|
|
$previousCase = $case;
|
|
}
|
|
if (!$hasChanged) {
|
|
return null;
|
|
}
|
|
return $node;
|
|
}
|
|
private function areSwitchStmtsEqualsAndWithBreak(Case_ $currentCase, Case_ $previousCase) : bool
|
|
{
|
|
if (!$this->nodeComparator->areNodesEqual($currentCase->stmts, $previousCase->stmts)) {
|
|
return \false;
|
|
}
|
|
foreach ($currentCase->stmts as $stmt) {
|
|
if ($stmt instanceof Break_) {
|
|
return \true;
|
|
}
|
|
if ($stmt instanceof Return_) {
|
|
return \true;
|
|
}
|
|
}
|
|
return \false;
|
|
}
|
|
}
|