mirror of https://github.com/rectorphp/rector.git
101 lines
3.8 KiB
PHP
101 lines
3.8 KiB
PHP
<?php
|
|
|
|
declare (strict_types=1);
|
|
namespace Rector\Php80\MatchAndRefactor\StrStartsWithMatchAndRefactor;
|
|
|
|
use PhpParser\Node;
|
|
use PhpParser\Node\Expr\BinaryOp;
|
|
use PhpParser\Node\Expr\BinaryOp\Equal;
|
|
use PhpParser\Node\Expr\BinaryOp\Identical;
|
|
use PhpParser\Node\Expr\BinaryOp\NotEqual;
|
|
use PhpParser\Node\Expr\BinaryOp\NotIdentical;
|
|
use PhpParser\Node\Expr\BooleanNot;
|
|
use PhpParser\Node\Expr\FuncCall;
|
|
use PhpParser\Node\Name;
|
|
use Rector\Core\PhpParser\Node\Value\ValueResolver;
|
|
use Rector\NodeNameResolver\NodeNameResolver;
|
|
use Rector\Php80\Contract\StrStartWithMatchAndRefactorInterface;
|
|
use Rector\Php80\NodeFactory\StrStartsWithFuncCallFactory;
|
|
use Rector\Php80\ValueObject\StrStartsWith;
|
|
final class StrposMatchAndRefactor implements StrStartWithMatchAndRefactorInterface
|
|
{
|
|
/**
|
|
* @readonly
|
|
* @var \Rector\NodeNameResolver\NodeNameResolver
|
|
*/
|
|
private $nodeNameResolver;
|
|
/**
|
|
* @readonly
|
|
* @var \Rector\Core\PhpParser\Node\Value\ValueResolver
|
|
*/
|
|
private $valueResolver;
|
|
/**
|
|
* @readonly
|
|
* @var \Rector\Php80\NodeFactory\StrStartsWithFuncCallFactory
|
|
*/
|
|
private $strStartsWithFuncCallFactory;
|
|
public function __construct(NodeNameResolver $nodeNameResolver, ValueResolver $valueResolver, StrStartsWithFuncCallFactory $strStartsWithFuncCallFactory)
|
|
{
|
|
$this->nodeNameResolver = $nodeNameResolver;
|
|
$this->valueResolver = $valueResolver;
|
|
$this->strStartsWithFuncCallFactory = $strStartsWithFuncCallFactory;
|
|
}
|
|
/**
|
|
* @param \PhpParser\Node\Expr\BinaryOp\Identical|\PhpParser\Node\Expr\BinaryOp\NotIdentical|\PhpParser\Node\Expr\BinaryOp\Equal|\PhpParser\Node\Expr\BinaryOp\NotEqual $binaryOp
|
|
*/
|
|
public function match($binaryOp) : ?StrStartsWith
|
|
{
|
|
$isPositive = $binaryOp instanceof Identical || $binaryOp instanceof Equal;
|
|
if ($binaryOp->left instanceof FuncCall && $this->nodeNameResolver->isName($binaryOp->left, 'strpos')) {
|
|
return $this->processBinaryOpLeft($binaryOp, $isPositive);
|
|
}
|
|
if (!$binaryOp->right instanceof FuncCall) {
|
|
return null;
|
|
}
|
|
if (!$this->nodeNameResolver->isName($binaryOp->right, 'strpos')) {
|
|
return null;
|
|
}
|
|
return $this->processBinaryOpRight($binaryOp, $isPositive);
|
|
}
|
|
/**
|
|
* @return FuncCall|BooleanNot
|
|
*/
|
|
public function refactorStrStartsWith(StrStartsWith $strStartsWith) : Node
|
|
{
|
|
$strposFuncCall = $strStartsWith->getFuncCall();
|
|
$strposFuncCall->name = new Name('str_starts_with');
|
|
return $this->strStartsWithFuncCallFactory->createStrStartsWith($strStartsWith);
|
|
}
|
|
private function processBinaryOpLeft(BinaryOp $binaryOp, bool $isPositive) : ?StrStartsWith
|
|
{
|
|
if (!$this->valueResolver->isValue($binaryOp->right, 0)) {
|
|
return null;
|
|
}
|
|
/** @var FuncCall $funcCall */
|
|
$funcCall = $binaryOp->left;
|
|
if ($funcCall->isFirstClassCallable()) {
|
|
return null;
|
|
}
|
|
if (\count($funcCall->getArgs()) < 2) {
|
|
return null;
|
|
}
|
|
$haystack = $funcCall->getArgs()[0]->value;
|
|
$needle = $funcCall->getArgs()[1]->value;
|
|
return new StrStartsWith($funcCall, $haystack, $needle, $isPositive);
|
|
}
|
|
private function processBinaryOpRight(BinaryOp $binaryOp, bool $isPositive) : ?StrStartsWith
|
|
{
|
|
if (!$this->valueResolver->isValue($binaryOp->left, 0)) {
|
|
return null;
|
|
}
|
|
/** @var FuncCall $funcCall */
|
|
$funcCall = $binaryOp->right;
|
|
if (\count($funcCall->getArgs()) < 2) {
|
|
return null;
|
|
}
|
|
$haystack = $funcCall->getArgs()[0]->value;
|
|
$needle = $funcCall->getArgs()[1]->value;
|
|
return new StrStartsWith($funcCall, $haystack, $needle, $isPositive);
|
|
}
|
|
}
|