Respect /
Validation
We could not synchronize checks via GitHub's checks API since Scrutinizer's GitHub App is not installed for this repository.
| Conditions | 11 |
| Paths | 8 |
| Total Lines | 30 |
| Code Lines | 14 |
| Lines | 0 |
| Ratio | 0 % |
| Tests | 13 |
| CRAP Score | 11.2865 |
| Changes | 0 | ||
Small methods make your code easier to understand, in particular if combined with a good name. Besides, if your method is small, finding a good name is usually much easier.
For example, if you find yourself adding comments to a method's body, this is usually a good sign to extract the commented part to a new method, and use the comment as a starting point when coming up with a good name for this new method.
Commonly applied refactorings include:
If many parameters/temporary variables are present:
| 1 | <?php |
||
| 33 | 100 | public function isValid($input): bool |
|
| 34 | { |
||
| 35 | 100 | if (!is_scalar($input)) { |
|
| 36 | 2 | return false; |
|
| 37 | } |
||
| 38 | |||
| 39 | // Canonicalize input |
||
| 40 | 98 | $input = preg_replace('{\D}', '', (string) $input); |
|
| 41 | |||
| 42 | // Validate length and invalid numbers |
||
| 43 | 98 | if ((11 != mb_strlen($input)) || (0 === (int) $input)) { |
|
| 44 | 74 | return false; |
|
| 45 | } |
||
| 46 | |||
| 47 | // Validate check digits using a modulus 11 algorithm |
||
| 48 | 25 | for ($c = $s1 = $s2 = 0, $p = 9; $c < 9; $c++, $p--) { |
|
| 49 | 25 | $s1 += (int) $input[$c] * $p; |
|
| 50 | 25 | $s2 += (int) $input[$c] * (10 - $p); |
|
| 51 | } |
||
| 52 | |||
| 53 | 25 | if ($input[9] != (($dv1 = $s1 % 11) > 9) ? 0 : $dv1) { |
|
| 54 | return false; |
||
| 55 | } |
||
| 56 | |||
| 57 | 25 | if ($input[10] != (((($dv2 = ($s2 % 11) - (($dv1 > 9) ? 2 : 0)) < 0) |
|
| 58 | 25 | ? $dv2 + 11 : $dv2) > 9) ? 0 : $dv2) { |
|
| 59 | return false; |
||
| 60 | } |
||
| 61 | |||
| 62 | 25 | return true; |
|
| 63 | } |
||
| 65 |
