rut-verifier/dist/index.js

chilean RUT verifier - verificador RUT chileno

"use strict";
var __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {
    return new (P || (P = Promise))(function (resolve, reject) {
        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
        function rejected(value) { try { step(generator["throw"](value)); } catch (e) { reject(e); } }
        function step(result) { result.done ? resolve(result.value) : new P(function (resolve) { resolve(result.value); }).then(fulfilled, rejected); }
        step((generator = generator.apply(thisArg, _arguments || [])).next());
    });
};
var __generator = (this && this.__generator) || function (thisArg, body) {
    var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;
    return g = { next: verb(0), "throw": verb(1), "return": verb(2) }, typeof Symbol === "function" && (g[Symbol.iterator] = function() { return this; }), g;
    function verb(n) { return function (v) { return step([n, v]); }; }
    function step(op) {
        if (f) throw new TypeError("Generator is already executing.");
        while (_) try {
            if (f = 1, y && (t = op[0] & 2 ? y["return"] : op[0] ? y["throw"] || ((t = y["return"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;
            if (y = 0, t) op = [op[0] & 2, t.value];
            switch (op[0]) {
                case 0: case 1: t = op; break;
                case 4: _.label++; return { value: op[1], done: false };
                case 5: _.label++; y = op[1]; op = [0]; continue;
                case 7: op = _.ops.pop(); _.trys.pop(); continue;
                default:
                    if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }
                    if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }
                    if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }
                    if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }
                    if (t[2]) _.ops.pop();
                    _.trys.pop(); continue;
            }
            op = body.call(thisArg, _);
        } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }
        if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };
    }
};
var _this = this;
Object.defineProperty(exports, "__esModule", { value: true });
var multipliers = [2, 3, 4, 5, 6, 7, 2, 3];
exports.verify = function (rut) { return __awaiter(_this, void 0, void 0, function () {
    var e_1;
    return __generator(this, function (_a) {
        switch (_a.label) {
            case 0:
                // trim and remove dots and dashes
                rut = format(rut);
                // check if rut only contains numbers
                if (!rut.match(/^([0-9]{7}|[0-9]{8})([0-9]|k)$/)) {
                    throw new Error('Input contains invalid characters');
                }
                if (!(rut.length !== 9 && rut.length !== 8)) return [3 /*break*/, 1];
                throw new Error('Invalid RUT length');
            case 1:
                _a.trys.push([1, 3, , 4]);
                return [4 /*yield*/, exports.getDigit(rut.slice(0, -1))];
            case 2: return [2 /*return*/, (_a.sent()) === rut[rut.length - 1]];
            case 3:
                e_1 = _a.sent();
                throw e_1;
            case 4: return [2 /*return*/];
        }
    });
}); };
var format = function (rut) {
    rut = rut
        .toString()
        .trim()
        .toLowerCase();
    rut = rut.replace(/\./g, '');
    rut = rut.replace(new RegExp('-', 'g'), '');
    return rut;
};
exports.getDigit = function (incompleteRut) { return __awaiter(_this, void 0, void 0, function () {
    var sum, revRut, i, value;
    return __generator(this, function (_a) {
        incompleteRut = format(incompleteRut);
        // check if incompleteRut only contains numbers
        if (!incompleteRut.match(/^[0-9]+$/)) {
            throw new Error('Input contains invalid characters');
        }
        if (incompleteRut.length !== 8 && incompleteRut.length !== 7) {
            throw new Error('Invalid RUT length');
        }
        else {
            sum = 0;
            revRut = incompleteRut
                .split('')
                .reverse()
                .join('');
            for (i = 0; i < incompleteRut.length; i++) {
                sum = sum + parseInt(revRut[i]) * multipliers[i];
            }
            value = 11 - (sum % 11);
            if (value > 0 && value <= 9) {
                return [2 /*return*/, value.toString()];
            }
            else if (value === 10) {
                return [2 /*return*/, 'k'];
            }
            else {
                //if value == 11
                return [2 /*return*/, '0'];
            }
        }
        return [2 /*return*/];
    });
}); };
exports.split = function (rut) { return __awaiter(_this, void 0, void 0, function () {
    var isValid, e_2, formatted;
    return __generator(this, function (_a) {
        switch (_a.label) {
            case 0:
                _a.trys.push([0, 2, , 3]);
                return [4 /*yield*/, exports.verify(rut)];
            case 1:
                isValid = _a.sent();
                if (!isValid) {
                    throw new Error('Invalid RUT');
                }
                return [3 /*break*/, 3];
            case 2:
                e_2 = _a.sent();
                throw e_2;
            case 3:
                formatted = format(rut);
                return [2 /*return*/, [
                        formatted.slice(0, formatted.length - 1),
                        formatted.slice(formatted.length - 1)
                    ]];
        }
    });
}); };