spqr/vendor/workerman/validation/library/Rules/Cnpj.php
2024-11-05 12:10:06 +08:00

84 lines
1.9 KiB
PHP

<?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 array_sum;
use function count;
use function is_scalar;
use function preg_replace;
use function str_split;
/**
* Validates if the input is a Brazilian National Registry of Legal Entities (CNPJ) number.
*
* @author Alexandre Gomes Gaigalas <alganet@gmail.com>
* @author Henrique Moody <henriquemoody@gmail.com>
* @author Jayson Reis <santosdosreis@gmail.com>
* @author Nick Lombard <github@jigsoft.co.za>
* @author Renato Moura <renato@naturalweb.com.br>
* @author William Espindola <oi@williamespindola.com.br>
*/
final class Cnpj extends AbstractRule
{
/**
* {@inheritDoc}
*/
public function validate($input): bool
{
if (!is_scalar($input)) {
return false;
}
// Code ported from jsfromhell.com
$bases = [6, 5, 4, 3, 2, 9, 8, 7, 6, 5, 4, 3, 2];
$digits = $this->getDigits((string) $input);
if (array_sum($digits) < 1) {
return false;
}
if (count($digits) !== 14) {
return false;
}
$n = 0;
for ($i = 0; $i < 12; ++$i) {
$n += $digits[$i] * $bases[$i + 1];
}
if ($digits[12] != (($n %= 11) < 2 ? 0 : 11 - $n)) {
return false;
}
$n = 0;
for ($i = 0; $i <= 12; ++$i) {
$n += $digits[$i] * $bases[$i];
}
$check = ($n %= 11) < 2 ? 0 : 11 - $n;
return $digits[13] == $check;
}
/**
* @return int[]
*/
private function getDigits(string $input): array
{
return array_map(
'intval',
str_split(
(string) preg_replace('/\D/', '', $input)
)
);
}
}