mirror of
https://github.com/Respect/Validation.git
synced 2024-06-03 06:12:17 +02:00
Apply "SlevomatCodingStandard.PHP.UselessParentheses"
Signed-off-by: Henrique Moody <henriquemoody@gmail.com>
This commit is contained in:
parent
751e08c9f0
commit
44f4d65a3d
|
@ -40,7 +40,7 @@ final class Cnh extends AbstractRule
|
|||
$input = preg_replace('{\D}', '', (string) $input);
|
||||
|
||||
// Validate length and invalid numbers
|
||||
if ((11 != mb_strlen($input)) || (0 === (int) $input)) {
|
||||
if (11 != mb_strlen($input) || (0 === (int) $input)) {
|
||||
return false;
|
||||
}
|
||||
|
||||
|
@ -55,8 +55,8 @@ final class Cnh extends AbstractRule
|
|||
return false;
|
||||
}
|
||||
|
||||
$dv2 = ($s2 % 11) - (($dv1 > 9) ? 2 : 0);
|
||||
if ($input[10] != ((($dv2 < 0) ? $dv2 + 11 : $dv2) > 9) ? 0 : $dv2) {
|
||||
$dv2 = $s2 % 11 - ($dv1 > 9 ? 2 : 0);
|
||||
if ($input[10] != (($dv2 < 0 ? $dv2 + 11 : $dv2) > 9) ? 0 : $dv2) {
|
||||
return false;
|
||||
}
|
||||
|
||||
|
|
|
@ -57,7 +57,7 @@ final class Cnpj extends AbstractRule
|
|||
$n += $digits[$i] * $bases[$i + 1];
|
||||
}
|
||||
|
||||
if ($digits[12] != ((($n %= 11) < 2) ? 0 : 11 - $n)) {
|
||||
if ($digits[12] != (($n %= 11) < 2 ? 0 : 11 - $n)) {
|
||||
return false;
|
||||
}
|
||||
|
||||
|
@ -66,7 +66,7 @@ final class Cnpj extends AbstractRule
|
|||
$n += $digits[$i] * $bases[$i];
|
||||
}
|
||||
|
||||
if ($digits[13] != ((($n %= 11) < 2) ? 0 : 11 - $n)) {
|
||||
if ($digits[13] != (($n %= 11) < 2 ? 0 : 11 - $n)) {
|
||||
return false;
|
||||
}
|
||||
|
||||
|
|
|
@ -46,7 +46,7 @@ final class Cpf extends AbstractRule
|
|||
$n += $c[$i] * $s;
|
||||
}
|
||||
|
||||
if ($c[9] != ((($n %= 11) < 2) ? 0 : 11 - $n)) {
|
||||
if ($c[9] != (($n %= 11) < 2 ? 0 : 11 - $n)) {
|
||||
return false;
|
||||
}
|
||||
|
||||
|
@ -55,7 +55,7 @@ final class Cpf extends AbstractRule
|
|||
$n += $c[$i] * $s;
|
||||
}
|
||||
|
||||
if ($c[10] != ((($n %= 11) < 2) ? 0 : 11 - $n)) {
|
||||
if ($c[10] != (($n %= 11) < 2 ? 0 : 11 - $n)) {
|
||||
return false;
|
||||
}
|
||||
|
||||
|
|
|
@ -41,7 +41,7 @@ class NfeAccessKey extends AbstractRule
|
|||
$digits = array_map('intval', str_split($input));
|
||||
$w = [];
|
||||
for ($i = 0, $z = 5, $m = 43; $i <= $m; ++$i) {
|
||||
$z = ($i < $m) ? 1 == ($z - 1) ? 9 : ($z - 1) : 0;
|
||||
$z = $i < $m ? 1 == ($z - 1) ? 9 : ($z - 1) : 0;
|
||||
$w[] = $z;
|
||||
}
|
||||
|
||||
|
@ -49,8 +49,8 @@ class NfeAccessKey extends AbstractRule
|
|||
$s += $digits[$i] * $w[$i];
|
||||
}
|
||||
|
||||
$s -= (11 * floor($s / 11));
|
||||
$v = (0 == $s || 1 == $s) ? 0 : (11 - $s);
|
||||
$s -= 11 * floor($s / 11);
|
||||
$v = 0 == $s || 1 == $s ? 0 : (11 - $s);
|
||||
|
||||
return $v == $digits[43];
|
||||
}
|
||||
|
|
|
@ -52,6 +52,6 @@ final class Pis extends AbstractRule
|
|||
|
||||
$modulo = $summation % 11;
|
||||
|
||||
return $checkDigit === (($modulo < 2) ? 0 : 11 - $modulo);
|
||||
return $checkDigit === ($modulo < 2 ? 0 : 11 - $modulo);
|
||||
}
|
||||
}
|
||||
|
|
|
@ -67,6 +67,7 @@
|
|||
<rule ref="SlevomatCodingStandard.Namespaces.UseFromSameNamespace" />
|
||||
<rule ref="SlevomatCodingStandard.Namespaces.UselessAlias" />
|
||||
<rule ref="SlevomatCodingStandard.PHP.TypeCast" />
|
||||
<rule ref="SlevomatCodingStandard.PHP.UselessParentheses" />
|
||||
<rule ref="SlevomatCodingStandard.PHP.UselessSemicolon" />
|
||||
<rule ref="SlevomatCodingStandard.TypeHints.ParameterTypeHintSpacing" />
|
||||
<rule ref="SlevomatCodingStandard.TypeHints.ReturnTypeHintSpacing" />
|
||||
|
|
Loading…
Reference in a new issue