redux-freeform 6.2.0-beta.1 → 6.2.0

package/dist/redux-freeform.cjs.js

@@ -155,38 +155,38 @@ function luhnValid(string) {
     return false;
   }
 
+  // Extract all digit characters from the string.
   const digits = string.match(/\d/g);
   if (!digits) {
     return false;
   }
 
-  const digitArray = digits.map(Number);
   let totalSum = 0;
-
-  // Start from the right.
-  for (let i = digitArray.length - 1; i >= 0; i -= 2) {
-    const lastDigit = digitArray[i];
-    const secondToLastDigit = digitArray[i - 1];
-
-    if (secondToLastDigit !== undefined) {
-      // Double the value of the second-to-last digit and continue doing the same for every second digit.
-      let secondToLastDigitDoubled = secondToLastDigit * 2;
-
-      // If the result of any doubling operation is greater than nine,
-      // then add the digits of the result together to obtain a single-digit number.
-      if (secondToLastDigitDoubled > 9) {
-        secondToLastDigitDoubled -= 9;
+  let shouldDouble = false;
+
+  // Process digits from right to left
+  for (let i = digits.length - 1; i >= 0; i--) {
+    // Convert the current character to a number.
+    let digit = parseInt(digits[i], 10);
+
+    // Double the digit and adjust if it exceeds 9.
+    if (shouldDouble) {
+      digit *= 2;
+      if (digit > 9) {
+        // If the result of any doubling operation is greater than nine,
+        // then add the digits of the result together to obtain a single-digit number.
+        // This is equivalent to adding the digits together (e.g. 16: 1 + 6 = 7 = 16 - 9).
+        digit -= 9;
       }
-
-      totalSum += secondToLastDigitDoubled;
     }
 
-    // Find the sum of all the digits that you didn't double and the new values that you got from doubling.
-    totalSum += lastDigit;
+    // Add the processed digit to the total sum.
+    totalSum += digit;
+    // After doubling the value of the second-to-last digit, continue doing the same for every other digit.
+    shouldDouble = !shouldDouble;
   }
 
-  // Determine if the total sum is a multiple of ten.
-  // According to the Luhn algorithm, the number is considered to be valid if the total ends in zero.
+  // The number is valid if totalSum is divisible by 10.
   return totalSum % 10 === 0;
 }
 

package/dist/redux-freeform.esm.js

@@ -151,38 +151,38 @@ function luhnValid(string) {
     return false;
   }
 
+  // Extract all digit characters from the string.
   const digits = string.match(/\d/g);
   if (!digits) {
     return false;
   }
 
-  const digitArray = digits.map(Number);
   let totalSum = 0;
-
-  // Start from the right.
-  for (let i = digitArray.length - 1; i >= 0; i -= 2) {
-    const lastDigit = digitArray[i];
-    const secondToLastDigit = digitArray[i - 1];
-
-    if (secondToLastDigit !== undefined) {
-      // Double the value of the second-to-last digit and continue doing the same for every second digit.
-      let secondToLastDigitDoubled = secondToLastDigit * 2;
-
-      // If the result of any doubling operation is greater than nine,
-      // then add the digits of the result together to obtain a single-digit number.
-      if (secondToLastDigitDoubled > 9) {
-        secondToLastDigitDoubled -= 9;
+  let shouldDouble = false;
+
+  // Process digits from right to left
+  for (let i = digits.length - 1; i >= 0; i--) {
+    // Convert the current character to a number.
+    let digit = parseInt(digits[i], 10);
+
+    // Double the digit and adjust if it exceeds 9.
+    if (shouldDouble) {
+      digit *= 2;
+      if (digit > 9) {
+        // If the result of any doubling operation is greater than nine,
+        // then add the digits of the result together to obtain a single-digit number.
+        // This is equivalent to adding the digits together (e.g. 16: 1 + 6 = 7 = 16 - 9).
+        digit -= 9;
       }
-
-      totalSum += secondToLastDigitDoubled;
     }
 
-    // Find the sum of all the digits that you didn't double and the new values that you got from doubling.
-    totalSum += lastDigit;
+    // Add the processed digit to the total sum.
+    totalSum += digit;
+    // After doubling the value of the second-to-last digit, continue doing the same for every other digit.
+    shouldDouble = !shouldDouble;
   }
 
-  // Determine if the total sum is a multiple of ten.
-  // According to the Luhn algorithm, the number is considered to be valid if the total ends in zero.
+  // The number is valid if totalSum is divisible by 10.
   return totalSum % 10 === 0;
 }
 

package/dist/redux-freeform.umd.js

@@ -157,38 +157,38 @@
       return false;
     }
 
+    // Extract all digit characters from the string.
     const digits = string.match(/\d/g);
     if (!digits) {
       return false;
     }
 
-    const digitArray = digits.map(Number);
     let totalSum = 0;
-
-    // Start from the right.
-    for (let i = digitArray.length - 1; i >= 0; i -= 2) {
-      const lastDigit = digitArray[i];
-      const secondToLastDigit = digitArray[i - 1];
-
-      if (secondToLastDigit !== undefined) {
-        // Double the value of the second-to-last digit and continue doing the same for every second digit.
-        let secondToLastDigitDoubled = secondToLastDigit * 2;
-
-        // If the result of any doubling operation is greater than nine,
-        // then add the digits of the result together to obtain a single-digit number.
-        if (secondToLastDigitDoubled > 9) {
-          secondToLastDigitDoubled -= 9;
+    let shouldDouble = false;
+
+    // Process digits from right to left
+    for (let i = digits.length - 1; i >= 0; i--) {
+      // Convert the current character to a number.
+      let digit = parseInt(digits[i], 10);
+
+      // Double the digit and adjust if it exceeds 9.
+      if (shouldDouble) {
+        digit *= 2;
+        if (digit > 9) {
+          // If the result of any doubling operation is greater than nine,
+          // then add the digits of the result together to obtain a single-digit number.
+          // This is equivalent to adding the digits together (e.g. 16: 1 + 6 = 7 = 16 - 9).
+          digit -= 9;
         }
-
-        totalSum += secondToLastDigitDoubled;
       }
 
-      // Find the sum of all the digits that you didn't double and the new values that you got from doubling.
-      totalSum += lastDigit;
+      // Add the processed digit to the total sum.
+      totalSum += digit;
+      // After doubling the value of the second-to-last digit, continue doing the same for every other digit.
+      shouldDouble = !shouldDouble;
     }
 
-    // Determine if the total sum is a multiple of ten.
-    // According to the Luhn algorithm, the number is considered to be valid if the total ends in zero.
+    // The number is valid if totalSum is divisible by 10.
     return totalSum % 10 === 0;
   }
 

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "redux-freeform",
-  "version": "6.2.0-beta.1",
+  "version": "6.2.0",
   "description": "A small Redux form library that supports purely functional apps, without magic",
   "main": "dist/redux-freeform.cjs.js",
   "module": "dist/redux-freeform.esm.js",