UNPKG

luhn-generator

Version:

A generator of numbers that passes the validation of Luhn algorithm or Luhn formula, also known as the 'modulus 10' or 'mod 10' algorithm

50 lines (44 loc) 1.34 kB
'use strict'; var define = require('define-properties'); var hasSymbols = require('has-symbols')(); var getPolyfill = require('./polyfill'); var regexpMatchAllPolyfill = require('./polyfill-regexp-matchall'); var defineP = Object.defineProperty; var gOPD = Object.getOwnPropertyDescriptor; module.exports = function shimMatchAll() { var polyfill = getPolyfill(); define( String.prototype, { matchAll: polyfill }, { matchAll: function () { return String.prototype.matchAll !== polyfill; } } ); if (hasSymbols) { // eslint-disable-next-line no-restricted-properties var symbol = Symbol.matchAll || (Symbol['for'] ? Symbol['for']('Symbol.matchAll') : Symbol('Symbol.matchAll')); define( Symbol, { matchAll: symbol }, { matchAll: function () { return Symbol.matchAll !== symbol; } } ); if (defineP && gOPD) { var desc = gOPD(Symbol, symbol); if (!desc || desc.configurable) { defineP(Symbol, symbol, { configurable: false, enumerable: false, value: symbol, writable: false }); } } var regexpMatchAll = regexpMatchAllPolyfill(); var func = {}; func[symbol] = regexpMatchAll; var predicate = {}; predicate[symbol] = function () { return RegExp.prototype[symbol] !== regexpMatchAll; }; define(RegExp.prototype, func, predicate); } return polyfill; };