claudsonm /
boleto-winner
| 1 | <?php |
||
| 2 | |||
| 3 | if (! function_exists('starts_with')) { |
||
| 4 | /** |
||
| 5 | * Checks if a string starts with a given substring. |
||
| 6 | */ |
||
| 7 | function starts_with(string $needle, string $haystack): bool |
||
| 8 | { |
||
| 9 | 3 | return substr($haystack, 0, strlen($needle)) === $needle; |
|
| 10 | } |
||
| 11 | } |
||
| 12 | |||
| 13 | if (! function_exists('module10')) { |
||
| 14 | /** |
||
| 15 | * Calculates the module 10 for the given input. |
||
| 16 | */ |
||
| 17 | function module10(string $input): string |
||
| 18 | { |
||
| 19 | 72 | $reversedInput = strrev($input); |
|
| 20 | 72 | $sum = 0; |
|
| 21 | |||
| 22 | 72 | for ($inputSize = strlen($reversedInput), $i = 0; $i < $inputSize; $i++) { |
|
| 23 | 72 | $value = (int) (substr($reversedInput, $i, 1)); |
|
| 24 | 72 | $productResult = $value * (0 == $i % 2 ? 2 : 1); |
|
| 25 | |||
| 26 | 72 | if ($productResult > 9) { |
|
| 27 | // Sum the number digits before add to the total sum. |
||
| 28 | 72 | $sum += array_sum(str_split($productResult)); |
|
|
0 ignored issues
–
show
Bug
introduced
by
Loading history...
|
|||
| 29 | } else { |
||
| 30 | 72 | $sum += $productResult; |
|
| 31 | } |
||
| 32 | } |
||
| 33 | |||
| 34 | 72 | return (ceil($sum / 10) * 10) - $sum; |
|
| 35 | } |
||
| 36 | } |
||
| 37 | |||
| 38 | if (! function_exists('module11')) { |
||
| 39 | /** |
||
| 40 | * Calculates the module 11 for the given input. |
||
| 41 | * |
||
| 42 | * @example CPF: module11('input', 2, 12, true) |
||
| 43 | * @example CNPJ: module11('input', 2, 9, true) |
||
| 44 | * @example PIS,C/C,Age: module11('input', 1, 9, true) |
||
| 45 | * @example RG SSP-SP: module11('input', 1, 9, false) |
||
| 46 | * |
||
| 47 | * @param string $input Input numbers without the verification digit |
||
| 48 | * @param int $amountOfDigits Amount of verification digits to calculate |
||
| 49 | * @param int $multiplicationThreshold The max weight to multiply the numbers |
||
| 50 | * @param bool $timesTen Whether or not multiply the sum by ten. True returns the digit, false the rest of the division |
||
| 51 | */ |
||
| 52 | function module11(string $input, int $amountOfDigits = 1, int $multiplicationThreshold = 9, bool $timesTen = true): string |
||
| 53 | { |
||
| 54 | 49 | if (! $timesTen) { |
|
| 55 | $amountOfDigits = 1; |
||
| 56 | } |
||
| 57 | |||
| 58 | 49 | for ($n = 1; $n <= $amountOfDigits; $n++) { |
|
| 59 | 49 | $sum = 0; |
|
| 60 | 49 | $weight = 2; |
|
| 61 | 49 | for ($i = strlen($input) - 1; $i >= 0; $i--) { |
|
| 62 | 49 | $sum += $weight * (int) (substr($input, $i, 1)); |
|
| 63 | 49 | if (++$weight > $multiplicationThreshold) { |
|
| 64 | 48 | $weight = 2; |
|
| 65 | } |
||
| 66 | } |
||
| 67 | |||
| 68 | 49 | if ($timesTen) { |
|
| 69 | 49 | $digit = fmod(fmod(($sum * 10), 11), 10); |
|
| 70 | } else { |
||
| 71 | $digit = fmod($sum, 11); |
||
| 72 | } |
||
| 73 | 49 | $input .= (string) $digit; |
|
| 74 | } |
||
| 75 | |||
| 76 | 49 | return substr($input, strlen($input) - $amountOfDigits); |
|
| 77 | } |
||
| 78 | } |
||
| 79 |