UNPKG

luhn-alg

Version:

Fastest implementation of the Luhn algorithm

16 lines (12 loc) 330 B
'use strict'; export default function(array) { return function (number) { let len = number ? number.length : 0, bit = 1, sum = 0; while (len--) { sum += !(bit ^= 1) ? parseInt(number[len], 10) : array[number[len]]; } return sum % 10 === 0 && sum > 0; }; }([0, 2, 4, 6, 8, 1, 3, 5, 7, 9]);