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

37 lines (27 loc) 1.33 kB
'use strict'; require('../shim')(); var test = require('tape'); var defineProperties = require('define-properties'); var bind = require('function-bind'); var isEnumerable = Object.prototype.propertyIsEnumerable; var functionsHaveNames = require('functions-have-names')(); var runTests = require('./tests'); test('shimmed', function (t) { t.equal(Array.prototype.includes.length, 1, 'Array#includes has a length of 1'); t.test('Function name', { skip: !functionsHaveNames }, function (st) { st.equal(Array.prototype.includes.name, 'includes', 'Array#includes has name "includes"'); st.end(); }); t.test('enumerability', { skip: !defineProperties.supportsDescriptors }, function (et) { et.equal(false, isEnumerable.call(Array.prototype, 'includes'), 'Array#includes is not enumerable'); et.end(); }); var supportsStrictMode = (function () { return typeof this === 'undefined'; }()); t.test('bad array/this value', { skip: !supportsStrictMode }, function (st) { st['throws'](function () { return Array.prototype.includes.call(undefined, 'a'); }, TypeError, 'undefined is not an object'); st['throws'](function () { return Array.prototype.includes.call(null, 'a'); }, TypeError, 'null is not an object'); st.end(); }); runTests(bind.call(Function.call, Array.prototype.includes), t); t.end(); });