| 12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758 |
- <?php
- /*
- * Copyright (c) Alexandre Gomes Gaigalas <alganet@gmail.com>
- * SPDX-License-Identifier: MIT
- */
- declare(strict_types=1);
- namespace Respect\Validation\Rules;
- use function array_map;
- use function count;
- use function str_split;
- /**
- * Validate whether a given input is a Luhn number.
- *
- * @see https://en.wikipedia.org/wiki/Luhn_algorithm
- *
- * @author Alexander Gorshkov <mazanax@yandex.ru>
- * @author Danilo Correa <danilosilva87@gmail.com>
- * @author Henrique Moody <henriquemoody@gmail.com>
- */
- final class Luhn extends AbstractRule
- {
- /**
- * {@inheritDoc}
- */
- public function validate($input): bool
- {
- if (!(new Digit())->validate($input)) {
- return false;
- }
- return $this->isValid((string) $input);
- }
- private function isValid(string $input): bool
- {
- $sum = 0;
- $digits = array_map('intval', str_split($input));
- $numDigits = count($digits);
- $parity = $numDigits % 2;
- for ($i = 0; $i < $numDigits; ++$i) {
- $digit = $digits[$i];
- if ($parity == $i % 2) {
- $digit <<= 1;
- if (9 < $digit) {
- $digit = $digit - 9;
- }
- }
- $sum += $digit;
- }
- return $sum % 10 == 0;
- }
- }
|