nhb-toolbox 4.29.0 → 4.29.1

package/CHANGELOG.md

@@ -4,6 +4,10 @@
 
 All notable changes to the package will be documented here.
 
+## [4.29.1] - 2026-03-27
+
+- **Updated** `getLevenshteinDistance` utility to be more *efficient* by using a *single-dimensional array* instead of a *matrix* for storing intermediate distances.
+
 ## [4.29.0] - 2026-03-26
 
 - **Added** new *string utilities* `computeTextDiff` and `getCharacterDifferences` for computing differences between two strings at both *line* and *character* levels.

package/dist/cjs/string/helpers.js

@@ -3,28 +3,14 @@ Object.defineProperty(exports, "__esModule", { value: true });
 exports._calculateSimilarity = _calculateSimilarity;
 exports._buildCharLcsTable = _buildCharLcsTable;
 exports._getLcsIndices = _getLcsIndices;
+const utilities_1 = require("./utilities");
 function _calculateSimilarity(str1, str2) {
-    const len1 = str1.length;
-    const len2 = str2.length;
-    const maxLen = Math.max(len1, len2);
-    if (maxLen === 0)
-        return 1;
     if (str1 === str2)
         return 1;
-    const matrix = Array(len1 + 1)
-        .fill(null)
-        .map(() => Array(len2 + 1).fill(0));
-    for (let i = 0; i <= len1; i++)
-        matrix[i][0] = i;
-    for (let j = 0; j <= len2; j++)
-        matrix[0][j] = j;
-    for (let i = 1; i <= len1; i++) {
-        for (let j = 1; j <= len2; j++) {
-            const cost = str1[i - 1] === str2[j - 1] ? 0 : 1;
-            matrix[i][j] = Math.min(matrix[i - 1][j] + 1, matrix[i][j - 1] + 1, matrix[i - 1][j - 1] + cost);
-        }
-    }
-    const distance = matrix[len1][len2];
+    const maxLen = Math.max(str1.length, str2.length);
+    if (maxLen === 0)
+        return 1;
+    const distance = (0, utilities_1.getLevenshteinDistance)(str1, str2);
     return 1 - distance / maxLen;
 }
 function _buildCharLcsTable(original, modified) {

package/dist/cjs/string/utilities.js

@@ -6,19 +6,27 @@ const extractNumbersFromString = (input) => {
     return (input.match(/\d+/g) || [])?.map(Number);
 };
 exports.extractNumbersFromString = extractNumbersFromString;
-const getLevenshteinDistance = (a, b) => {
-    const lenA = a?.length;
-    const lenB = b?.length;
-    const dp = Array.from({ length: lenA + 1 }, (_, i) => Array.from({ length: lenB + 1 }, (_, j) => (i === 0 ? j : j === 0 ? i : 0)));
+const getLevenshteinDistance = (str1, str2) => {
+    if (str1 === str2)
+        return 0;
+    const lenA = str1?.length;
+    const lenB = str2?.length;
+    if (lenA < lenB) {
+        return (0, exports.getLevenshteinDistance)(str2, str1);
+    }
+    let prev = Array.from({ length: lenB + 1 }, (_, j) => j);
+    let curr = new Array(lenB + 1);
     for (let i = 1; i <= lenA; i++) {
+        curr[0] = i;
         for (let j = 1; j <= lenB; j++) {
-            dp[i][j] =
-                a[i - 1] === b[j - 1]
-                    ? dp[i - 1][j - 1]
-                    : 1 + Math.min(dp[i - 1][j], dp[i][j - 1], dp[i - 1][j - 1]);
+            curr[j] =
+                str1[i - 1] === str2[j - 1]
+                    ? prev[j - 1]
+                    : 1 + Math.min(prev[j], curr[j - 1], prev[j - 1]);
         }
+        [prev, curr] = [curr, prev];
     }
-    return dp[lenA][lenB];
+    return prev[lenB];
 };
 exports.getLevenshteinDistance = getLevenshteinDistance;
 function countWords(text) {

package/dist/dts/string/helpers.d.ts

@@ -1,3 +1,4 @@
+import type { TupleOf } from '../utils/types';
 /**
  * Calculates the similarity between two strings using the Levenshtein edit distance.
  *
@@ -22,4 +23,4 @@ export declare function _buildCharLcsTable(original: string, modified: string):
  * @param lcs The precomputed LCS table from {@link buildCharLcsTable}.
  * @returns A tuple `[origMatched, modMatched]` — sets of matched character indices for the original and modified strings respectively.
  */
-export declare function _getLcsIndices(original: string, modified: string, lcs: number[][]): Set<number>[];
+export declare function _getLcsIndices(original: string, modified: string, lcs: number[][]): TupleOf<Set<number>, 2>;

package/dist/dts/string/utilities.d.ts

@@ -5,12 +5,20 @@
  */
 export declare const extractNumbersFromString: (input: string) => number[];
 /**
- * * Computes the Levenshtein distance between two strings.
- * @param a - First string.
- * @param b - Second string.
+ * * Computes the Levenshtein distance between two strings (space optimized).
+ * @param str1 - First string to compare.
+ * @param str2 - Second string to compare.
  * @returns The Levenshtein distance between the two strings.
+ *
+ * @remarks
+ * - The Levenshtein distance is the minimum number of single-character edits (insertions, deletions, or substitutions) required to change one string into the other.
+ * - This implementation uses only O(min(len(a), len(b))) space by keeping only the current and previous rows of the distance matrix.
+ *
+ * @example
+ * const distance = getLevenshteinDistance('kitten', 'sitting');
+ * console.log(distance); // Output: 3
  */
-export declare const getLevenshteinDistance: (a: string, b: string) => number;
+export declare const getLevenshteinDistance: (str1: string, str2: string) => number;
 /**
  * * Counts the number of words in a string, supporting multiple languages and scripts.
  *

package/dist/dts/utils/types.d.ts

@@ -268,6 +268,8 @@ export type ExtractRequired<T> = {
  * type Role = TupleToUnion<typeof roles>; // "admin" | "user" | "guest"
  */
 export type TupleToUnion<T extends readonly unknown[]> = T[number];
+/** Internal helper type to build a tuple of length N. */
+type $TupleOf<T, N extends number, R extends unknown[] = []> = R['length'] extends N ? R : $TupleOf<T, N, [...R, T]>;
 /**
  * * Creates a tuple type of a given length with elements of type T
  *
@@ -281,7 +283,7 @@ export type TupleToUnion<T extends readonly unknown[]> = T[number];
  * type FiveStrings = TupleOf<string, 5>; // [string, string, string, string, string]
  * type EmptyTuple = TupleOf<boolean, 0>; // []
  */
-export type TupleOf<T, N extends number, R extends unknown[] = []> = R['length'] extends N ? R : TupleOf<T, N, [...R, T]>;
+export type TupleOf<T, N extends number> = $TupleOf<T, N>;
 /** * Build a tuple of given length (helper for type-level arithmetic). */
 export type $BuildTuple<L extends number, T extends unknown[] = []> = T['length'] extends L ? T : $BuildTuple<L, [...T, unknown]>;
 /** * Produce a union of numbers `From | From+1 | ... | To`. */

package/dist/esm/string/helpers.js

@@ -1,25 +1,11 @@
+import { getLevenshteinDistance } from './utilities.js';
 export function _calculateSimilarity(str1, str2) {
-    const len1 = str1.length;
-    const len2 = str2.length;
-    const maxLen = Math.max(len1, len2);
-    if (maxLen === 0)
-        return 1;
     if (str1 === str2)
         return 1;
-    const matrix = Array(len1 + 1)
-        .fill(null)
-        .map(() => Array(len2 + 1).fill(0));
-    for (let i = 0; i <= len1; i++)
-        matrix[i][0] = i;
-    for (let j = 0; j <= len2; j++)
-        matrix[0][j] = j;
-    for (let i = 1; i <= len1; i++) {
-        for (let j = 1; j <= len2; j++) {
-            const cost = str1[i - 1] === str2[j - 1] ? 0 : 1;
-            matrix[i][j] = Math.min(matrix[i - 1][j] + 1, matrix[i][j - 1] + 1, matrix[i - 1][j - 1] + cost);
-        }
-    }
-    const distance = matrix[len1][len2];
+    const maxLen = Math.max(str1.length, str2.length);
+    if (maxLen === 0)
+        return 1;
+    const distance = getLevenshteinDistance(str1, str2);
     return 1 - distance / maxLen;
 }
 export function _buildCharLcsTable(original, modified) {

package/dist/esm/string/utilities.js

@@ -1,19 +1,27 @@
 export const extractNumbersFromString = (input) => {
     return (input.match(/\d+/g) || [])?.map(Number);
 };
-export const getLevenshteinDistance = (a, b) => {
-    const lenA = a?.length;
-    const lenB = b?.length;
-    const dp = Array.from({ length: lenA + 1 }, (_, i) => Array.from({ length: lenB + 1 }, (_, j) => (i === 0 ? j : j === 0 ? i : 0)));
+export const getLevenshteinDistance = (str1, str2) => {
+    if (str1 === str2)
+        return 0;
+    const lenA = str1?.length;
+    const lenB = str2?.length;
+    if (lenA < lenB) {
+        return getLevenshteinDistance(str2, str1);
+    }
+    let prev = Array.from({ length: lenB + 1 }, (_, j) => j);
+    let curr = new Array(lenB + 1);
     for (let i = 1; i <= lenA; i++) {
+        curr[0] = i;
         for (let j = 1; j <= lenB; j++) {
-            dp[i][j] =
-                a[i - 1] === b[j - 1]
-                    ? dp[i - 1][j - 1]
-                    : 1 + Math.min(dp[i - 1][j], dp[i][j - 1], dp[i - 1][j - 1]);
+            curr[j] =
+                str1[i - 1] === str2[j - 1]
+                    ? prev[j - 1]
+                    : 1 + Math.min(prev[j], curr[j - 1], prev[j - 1]);
         }
+        [prev, curr] = [curr, prev];
     }
-    return dp[lenA][lenB];
+    return prev[lenB];
 };
 export function countWords(text) {
     return (text?.match(/\p{L}[\p{L}\p{M}\p{Pd}'’]*|\p{N}+/gu) || [])?.length;

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "nhb-toolbox",
-  "version": "4.29.0",
+  "version": "4.29.1",
   "description": "A versatile collection of smart, efficient, and reusable utility functions, classes and types for everyday development needs.",
   "main": "dist/cjs/index.js",
   "module": "dist/esm/index.js",