ACIL FM

Nama	Ukuran	Aksi
AssignManipulator.php	2.92 MB	View DL Edit
BinaryOpManipulator.php	4.83 MB	View DL Edit
ClassConstManipulator.php	2.61 MB	View DL Edit
ClassDependencyManipulator.php	9.08 MB	View DL Edit
ClassInsertManipulator.php	2.61 MB	View DL Edit
ClassManipulator.php	1.79 MB	View DL Edit
ClassMethodAssignManipulator.php	1.85 MB	View DL Edit
ClassMethodManipulator.php	2.18 MB	View DL Edit
ClassMethodPropertyFetchManipulator.php	4.25 MB	View DL Edit
FuncCallManipulator.php	1.08 MB	View DL Edit
FunctionLikeManipulator.php	755 B	View DL Edit
IfManipulator.php	6.19 MB	View DL Edit
PropertyFetchAssignManipulator.php	2.46 MB	View DL Edit
PropertyManipulator.php	8.65 MB	View DL Edit
StmtsManipulator.php	3.08 MB	View DL Edit

Edit file: /opt/cpanel/ea-wappspector/vendor/rector/rector/src/NodeManipulator/BinaryOpManipulator.php

<?php

declare (strict_types=1);
namespace Rector\NodeManipulator;

use PhpParser\Node;
use PhpParser\Node\Expr;
use PhpParser\Node\Expr\BinaryOp;
use PhpParser\Node\Expr\BinaryOp\BooleanAnd;
use PhpParser\Node\Expr\BinaryOp\BooleanOr;
use PhpParser\Node\Expr\BooleanNot;
use Rector\Exception\ShouldNotHappenException;
use Rector\Php71\ValueObject\TwoNodeMatch;
use Rector\PhpParser\Node\AssignAndBinaryMap;
final class BinaryOpManipulator
{
    /**
     * @readonly
     * @var \Rector\PhpParser\Node\AssignAndBinaryMap
     */
    private $assignAndBinaryMap;
    public function __construct(AssignAndBinaryMap $assignAndBinaryMap)
    {
        $this->assignAndBinaryMap = $assignAndBinaryMap;
    }
    /**
     * Tries to match left or right parts (xor),
     * returns null or match on first condition and then second condition. No matter what the origin order is.
     *
     * @param callable(Node $firstNode, Node $secondNode): bool|class-string<Node> $firstCondition
     * @param callable(Node $firstNode, Node $secondNode): bool|class-string<Node> $secondCondition
     */
    public function matchFirstAndSecondConditionNode(BinaryOp $binaryOp, $firstCondition, $secondCondition) : ?TwoNodeMatch
    {
        $this->validateCondition($firstCondition);
        $this->validateCondition($secondCondition);
        $firstCondition = $this->normalizeCondition($firstCondition);
        $secondCondition = $this->normalizeCondition($secondCondition);
        if ($firstCondition($binaryOp->left, $binaryOp->right) && $secondCondition($binaryOp->right, $binaryOp->left)) {
            return new TwoNodeMatch($binaryOp->left, $binaryOp->right);
        }
        if (!$firstCondition($binaryOp->right, $binaryOp->left)) {
            return null;
        }
        if (!$secondCondition($binaryOp->left, $binaryOp->right)) {
            return null;
        }
        return new TwoNodeMatch($binaryOp->right, $binaryOp->left);
    }
    public function inverseBooleanOr(BooleanOr $booleanOr) : ?BinaryOp
    {
        // no nesting
        if ($booleanOr->left instanceof BooleanOr) {
            return null;
        }
        if ($booleanOr->right instanceof BooleanOr) {
            return null;
        }
        $inversedNodeClass = $this->resolveInversedNodeClass($booleanOr);
        if ($inversedNodeClass === null) {
            return null;
        }
        $firstInversedExpr = $this->inverseNode($booleanOr->left);
        $secondInversedExpr = $this->inverseNode($booleanOr->right);
        return new $inversedNodeClass($firstInversedExpr, $secondInversedExpr);
    }
    public function invertCondition(BinaryOp $binaryOp) : ?BinaryOp
    {
        // no nesting
        if ($binaryOp->left instanceof BooleanOr) {
            return null;
        }
        if ($binaryOp->right instanceof BooleanOr) {
            return null;
        }
        $inversedNodeClass = $this->resolveInversedNodeClass($binaryOp);
        if ($inversedNodeClass === null) {
            return null;
        }
        return new $inversedNodeClass($binaryOp->left, $binaryOp->right);
    }
    /**
     * @return \PhpParser\Node\Expr\BinaryOp|\PhpParser\Node\Expr|\PhpParser\Node\Expr\BooleanNot
     */
    public function inverseNode(Expr $expr)
    {
        if ($expr instanceof BinaryOp) {
            $inversedBinaryOp = $this->assignAndBinaryMap->getInversed($expr);
            if ($inversedBinaryOp !== null) {
                return new $inversedBinaryOp($expr->left, $expr->right);
            }
        }
        if ($expr instanceof BooleanNot) {
            return $expr->expr;
        }
        return new BooleanNot($expr);
    }
    /**
     * @param callable(Node $firstNode, Node $secondNode): bool|class-string<Node> $firstCondition
     */
    private function validateCondition($firstCondition) : void
    {
        if (\is_callable($firstCondition)) {
            return;
        }
        if (\is_a($firstCondition, Node::class, \true)) {
            return;
        }
        throw new ShouldNotHappenException();
    }
    /**
     * @param callable(Node $firstNode, Node $secondNode): bool|class-string<Node> $condition
     * @return callable(Node $firstNode, Node $secondNode): bool
     */
    private function normalizeCondition($condition) : callable
    {
        if (\is_callable($condition)) {
            return $condition;
        }
        return static function (Node $node) use($condition) : bool {
            return $node instanceof $condition;
        };
    }
    /**
     * @return class-string<BinaryOp>|null
     */
    private function resolveInversedNodeClass(BinaryOp $binaryOp) : ?string
    {
        $inversedNodeClass = $this->assignAndBinaryMap->getInversed($binaryOp);
        if ($inversedNodeClass !== null) {
            return $inversedNodeClass;
        }
        if ($binaryOp instanceof BooleanOr) {
            return BooleanAnd::class;
        }
        return null;
    }
}

Batal