@@ -32,7 +32,7 @@ discard block |
||
32 | 32 | $number = substr($stringInput, 0, -1); |
33 | 33 | $digit = (int) substr($stringInput, -1); |
34 | 34 | return |
35 | - $digit === match ($this->algorithm) { |
|
35 | + $digit === match($this->algorithm) { |
|
36 | 36 | self::MOD11 => self::mod11($number), |
37 | 37 | self::MOD10 => self::mod10($number), |
38 | 38 | default => throw new InvalidArgumentException('Algoritmo de cálculo de dígito inválido') |
@@ -49,7 +49,7 @@ discard block |
||
49 | 49 | $sum += $number * $factor[$i++ % $size]; |
50 | 50 | } |
51 | 51 | |
52 | - $mod11 = ($sum * 10 ) % 11; |
|
52 | + $mod11 = ($sum * 10) % 11; |
|
53 | 53 | if (array_key_exists($mod11, $modReturn)) { |
54 | 54 | return $modReturn[$mod11]; |
55 | 55 | } |
@@ -79,8 +79,8 @@ discard block |
||
79 | 79 | |
80 | 80 | $modReturn = [0 => 0, 1 => 0]; |
81 | 81 | $digit1 = DigitoVerificador::mod11($number, $modReturn); |
82 | - $digit2 = DigitoVerificador::mod11($number . $digit1, $modReturn); |
|
82 | + $digit2 = DigitoVerificador::mod11($number.$digit1, $modReturn); |
|
83 | 83 | |
84 | - return $digits === ($digit1 . $digit2); |
|
84 | + return $digits === ($digit1.$digit2); |
|
85 | 85 | } |
86 | 86 | } |