-
-
Notifications
You must be signed in to change notification settings - Fork 439
Expand file tree
/
Copy pathRepeatedOrEqualToInArrayRector.php
More file actions
179 lines (145 loc) · 5.3 KB
/
RepeatedOrEqualToInArrayRector.php
File metadata and controls
179 lines (145 loc) · 5.3 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
<?php
declare(strict_types=1);
namespace Rector\CodeQuality\Rector\BooleanOr;
use PhpParser\Node;
use PhpParser\Node\Arg;
use PhpParser\Node\Expr;
use PhpParser\Node\Expr\BinaryOp\BooleanOr;
use PhpParser\Node\Expr\BinaryOp\Equal;
use PhpParser\Node\Expr\BinaryOp\Identical;
use PhpParser\Node\Expr\ConstFetch;
use PhpParser\Node\Expr\FuncCall;
use PhpParser\Node\Name;
use Rector\CodeQuality\ValueObject\ComparedExprAndValueExpr;
use Rector\PhpParser\Node\BetterNodeFinder;
use Rector\Rector\AbstractRector;
use Symplify\RuleDocGenerator\ValueObject\CodeSample\CodeSample;
use Symplify\RuleDocGenerator\ValueObject\RuleDefinition;
/**
* @see \Rector\Tests\CodeQuality\Rector\BooleanOr\RepeatedOrEqualToInArrayRector\RepeatedOrEqualToInArrayRectorTest
*/
final class RepeatedOrEqualToInArrayRector extends AbstractRector
{
public function __construct(
private readonly BetterNodeFinder $betterNodeFinder,
) {
}
public function getRuleDefinition(): RuleDefinition
{
return new RuleDefinition(
'Simplify repeated || compare of same value, to in_array() class',
[
new CodeSample(
<<<'CODE_SAMPLE'
if ($value === 10 || $value === 20 || $value === 30) {
// ...
}
CODE_SAMPLE
,
<<<'CODE_SAMPLE'
if (in_array($value, [10, 20, 30], true)) {
// ...
}
CODE_SAMPLE
),
]
);
}
/**
* @return array<class-string<Node>>
*/
public function getNodeTypes(): array
{
return [BooleanOr::class];
}
/**
* @param BooleanOr $node
*/
public function refactor(Node $node): ?FuncCall
{
$identicals = $this->betterNodeFinder->findInstanceOf($node, Identical::class);
$equals = $this->betterNodeFinder->findInstanceOf($node, Equal::class);
if (! $this->isEqualOrIdentical($node->right)) {
return null;
}
// match compared variable and expr
if (! $node->left instanceof BooleanOr && ! $this->isEqualOrIdentical($node->left)) {
return null;
}
$comparedExprAndValueExprs = $this->matchComparedAndDesiredValues($node);
if ($comparedExprAndValueExprs === null) {
return null;
}
if (count($comparedExprAndValueExprs) < 3) {
return null;
}
// ensure all compared expr are the same
$valueExprs = $this->resolveValueExprs($comparedExprAndValueExprs);
/** @var ComparedExprAndValueExpr $firstComparedExprAndValue */
$firstComparedExprAndValue = array_pop($comparedExprAndValueExprs);
// all compared expr must be equal
foreach ($comparedExprAndValueExprs as $comparedExprAndValueExpr) {
if (! $this->nodeComparator->areNodesEqual(
$firstComparedExprAndValue->getComparedExpr(),
$comparedExprAndValueExpr->getComparedExpr()
)) {
return null;
}
}
$array = $this->nodeFactory->createArray($valueExprs);
$args = $this->nodeFactory->createArgs([$firstComparedExprAndValue->getComparedExpr(), $array]);
if ($identicals !== [] && $equals === []) {
$args[] = new Arg(new ConstFetch(new Name('true')));
}
return new FuncCall(new Name('in_array'), $args);
}
private function isEqualOrIdentical(Expr $expr): bool
{
if ($expr instanceof Identical) {
return true;
}
return $expr instanceof Equal;
}
private function matchComparedExprAndValueExpr(Identical|Equal $expr): ComparedExprAndValueExpr
{
return new ComparedExprAndValueExpr($expr->left, $expr->right);
}
/**
* @param ComparedExprAndValueExpr[] $comparedExprAndValueExprs
* @return Expr[]
*/
private function resolveValueExprs(array $comparedExprAndValueExprs): array
{
$valueExprs = [];
foreach ($comparedExprAndValueExprs as $comparedExprAndValueExpr) {
$valueExprs[] = $comparedExprAndValueExpr->getValueExpr();
}
return $valueExprs;
}
/**
* @return null|ComparedExprAndValueExpr[]
*/
private function matchComparedAndDesiredValues(BooleanOr $booleanOr): ?array
{
/** @var Identical|Equal $rightCompare */
$rightCompare = $booleanOr->right;
// match compared expr and desired value
$comparedExprAndValueExprs = [$this->matchComparedExprAndValueExpr($rightCompare)];
$currentBooleanOr = $booleanOr;
while ($currentBooleanOr->left instanceof BooleanOr) {
if (! $this->isEqualOrIdentical($currentBooleanOr->left->right)) {
return null;
}
$comparedExprAndValueExprs[] = $this->matchComparedExprAndValueExpr($currentBooleanOr->left->right);
$currentBooleanOr = $currentBooleanOr->left;
}
if (! $this->isEqualOrIdentical($currentBooleanOr->left)) {
return null;
}
/** @var Identical|Equal $leftCompare */
$leftCompare = $currentBooleanOr->left;
$comparedExprAndValueExprs[] = $this->matchComparedExprAndValueExpr($leftCompare);
// keep original natural order, as left/right goes from bottom up
return array_reverse($comparedExprAndValueExprs);
}
}