cmpstr 3.0.2 → 3.0.4

package/dist/cjs/metric/LCS.cjs

@@ -1,88 +1,35 @@
-// CmpStr v3.0.2 build-522ae69-250720 by Paul Köhler @komed3 / MIT License
+// CmpStr v3.0.4 build-74e65a5-250915 by Paul Köhler @komed3 / MIT License
 'use strict';
 
 var Metric = require('./Metric.cjs');
 var Pool = require('../utils/Pool.cjs');
 
-/**
- * Longest Common Subsequence (LCS)
- * src/metric/LCS.ts
- *
- * @see https://en.wikipedia.org/wiki/Longest_common_subsequence
- *
- * The Longest Common Subsequence (LCS) metric measures the length of the longest
- * subsequence common to both strings. Unlike substrings, the characters of a
- * subsequence do not need to be contiguous, but must appear in the same order.
- *
- * The LCS is widely used in diff tools, bioinformatics, and approximate string
- * matching.
- *
- * @module Metric/LCS
- * @author Paul Köhler (komed3)
- * @license MIT
- */
-/**
- * LCSMetric class extends the Metric class to implement the Longest Common Subsequence algorithm.
- */
 class LCSMetric extends Metric.Metric {
-  /**
-   * Constructor for the LCSMetric class.
-   *
-   * Initializes the LCS metric with two input strings or
-   * arrays of strings and optional options.
-   *
-   * @param {MetricInput} a - First input string or array of strings
-   * @param {MetricInput} b - Second input string or array of strings
-   * @param {MetricOptions} [opt] - Options for the metric computation
-   */
   constructor(a, b, opt = {}) {
-    // Call the parent Metric constructor with the metric name and inputs
-    // Metric is symmetrical
     super('lcs', a, b, opt, true);
   }
-  /**
-   * Calculates the normalized LCS similarity between two strings.
-   *
-   * @param {string} a - First string
-   * @param {string} b - Second string
-   * @param {number} m - Length of the first string
-   * @param {number} n - Length of the second string
-   * @param {number} maxLen - Maximum length of the strings
-   * @return {MetricCompute<LCSRaw>} - Object containing the similarity result and raw LCS length
-   */
   compute(a, b, m, n, maxLen) {
-    // Get two reusable arrays from the Pool for the DP rows
     const len = m + 1;
     const [prev, curr] = Pool.Pool.acquireMany('uint16', [len, len]);
-    // Initialize the first row to zeros
     for (let i = 0; i <= m; i++) prev[i] = 0;
-    // Fill the DP matrix row by row (over the longer string)
     for (let j = 1; j <= n; j++) {
       curr[0] = 0;
-      // Get the character code of the current character in b
       const cb = b.charCodeAt(j - 1);
       for (let i = 1; i <= m; i++) {
-        // If characters match, increment the LCS length
         if (a.charCodeAt(i - 1) === cb) curr[i] = prev[i - 1] + 1;
-        // Otherwise, take the maximum of the left or above cell
         else curr[i] = Math.max(prev[i], curr[i - 1]);
       }
-      // Copy current row to previous for next iteration
       prev.set(curr);
     }
-    // The last value in prev is the LCS length
     const lcs = prev[m];
-    // Release arrays back to the pool
     Pool.Pool.release('uint16', prev, len);
     Pool.Pool.release('uint16', curr, len);
-    // Normalize by the length of the longer string
     return {
       res: maxLen === 0 ? 1 : Metric.Metric.clamp(lcs / maxLen),
       raw: { lcs, maxLen }
     };
   }
 }
-// Register the Longest Common Subsequence (LCS) in the metric registry
 Metric.MetricRegistry.add('lcs', LCSMetric);
 
 exports.LCSMetric = LCSMetric;

package/dist/cjs/metric/LCS.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"LCS.cjs","sources":["../../../src/metric/LCS.ts"],"sourcesContent":[null],"names":["Metric","Pool","MetricRegistry"],"mappings":";;;;;;AAAA,CAAA,CAAA;;;;;;;;;;;;;;;;AAgBG,CAAA,CAAA;AAaH,CAAA,CAAA;;AAEG,CAAA,CAAA;AACG,CAAA,CAAA,CAAA,CAAA,CAAA,CAAO,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAU,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAQA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAc,CAAA;AAEzC,CAAA,CAAA,CAAA,CAAA;;;;;;;;;AASG,CAAA,CAAA,CAAA,CAAA;AACH,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAc,CAAc,CAAA,CAAE,CAAc,CAAA,CAAE,CAAA,CAAA,IAAqB,CAAA,CAAE,CAAA,CAAA;;;IAIjE,CAAA,CAAA,CAAA,CAAA,CAAK,CAAG,CAAA,CAAA,CAAA,CAAA,CAAK,CAAA,CAAE,CAAC,CAAA,CAAE,CAAC,CAAA,CAAE,CAAA,CAAA,CAAG,CAAA,CAAE,CAAA,CAAA,CAAA,CAAI,CAAE;EAEpC;AAEA,CAAA,CAAA,CAAA,CAAA;;;;;;;;;AASG,CAAA,CAAA,CAAA,CAAA;EACgB,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAO,CACtB,CAAS,CAAA,CAAE,CAAS,CAAA,CAAE,CAAS,CAAA,CAAE,CAAS,CAAA,CAC1C,CAAA,CAAA,CAAA,CAAA,CAAA,CAAc,CAAA,CAAA;;AAId,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAM,CAAA,CAAA,CAAG,CAAA,CAAA,CAAW,CAAC,GAAG,CAAC;AACzB,CAAA,CAAA,CAAA,CAAA,MAAM,CAAE,CAAA,CAAA,CAAA,CAAI,EAAE,CAAA,CAAA,CAAA,CAAI,CAAE,GAAGC,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAI,CAAC,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAW,CAAE,QAAQ,CAAA,CAAE,CAAE,GAAG,CAAA,CAAE,CAAA,CAAA,CAAG,CAAE,CAAE;;IAGjE,CAAA,CAAA,CAAA,CAAA,CAAM,CAAA,CAAA,CAAA,CAAI,CAAC,CAAA,CAAA,CAAG,CAAC,CAAA,CAAE,CAAC,CAAA,CAAA,CAAA,CAAI,CAAC,CAAA,CAAE,CAAC,CAAA,CAAE,CAAG,CAAA,CAAA,CAAA,CAAA,CAAI,CAAE,CAAC,CAAE,GAAG,CAAC;;AAG5C,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAM,CAAA,CAAA,CAAA,CAAI,CAAC,CAAA,CAAA,CAAG,CAAC,CAAA,CAAE,CAAC,CAAA,CAAA,CAAA,CAAI,CAAC,CAAA,CAAE,CAAC,CAAA,CAAE,CAAA,CAAG;AAE3B,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAI,CAAE,CAAC,CAAE,GAAG,CAAC;;MAGb,CAAA,CAAA,CAAA,CAAA,CAAA,CAAM,CAAA,CAAE,CAAA,CAAA,CAAW,CAAC,CAAC,UAAU,CAAE,CAAC,CAAA,CAAA,CAAG,CAAC,CAAE;AAExC,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAM,CAAA,CAAA,CAAA,CAAI,CAAC,CAAA,CAAA,CAAG,CAAC,CAAA,CAAE,CAAC,CAAA,CAAA,CAAA,CAAI,CAAC,CAAA,CAAE,CAAC,CAAA,CAAE,CAAA,CAAG;;QAG3B,CAAA,CAAA,CAAA,CAAK,CAAC,CAAC,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAU,CAAE,CAAC,CAAA,CAAA,CAAG,CAAC,CAAE,CAAA,CAAA,CAAA,CAAA,CAAK,CAAA,CAAE,CAAG,CAAA,CAAA,CAAA,CAAA,CAAI,CAAE,CAAC,CAAE,CAAA,CAAA,CAAG,CAAA,CAAA,CAAA,CAAI,CAAE,CAAC,CAAA,CAAA,CAAG,CAAC,CAAE,CAAA,CAAA,CAAG,CAAC;;aAG5D,CAAA,CAAA,CAAA,CAAI,CAAE,CAAC,CAAE,GAAG,CAAA,CAAA,CAAA,CAAI,CAAC,GAAG,CAAE,CAAA,CAAA,CAAA,CAAI,CAAE,CAAC,CAAE,EAAE,CAAA,CAAA,CAAA,CAAI,CAAE,CAAC,CAAA,CAAA,CAAG,CAAC,CAAE,CAAE;MAEzD;;AAGA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAI,CAAC,CAAA,CAAA,CAAG,CAAE,IAAI,CAAE;IAEpB;;AAGA,CAAA,CAAA,CAAA,CAAA,MAAM,CAAA,CAAA,CAAG,CAAA,CAAA,CAAW,CAAA,CAAA,CAAA,CAAI,CAAE,CAAC,CAAE;;IAG7BA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAI,CAAC,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAO,CAAE,QAAQ,CAAA,CAAE,CAAA,CAAA,CAAA,CAAI,CAAA,CAAE,CAAA,CAAA,CAAG,CAAE;IACnCA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAI,CAAC,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAO,CAAE,QAAQ,CAAA,CAAE,CAAA,CAAA,CAAA,CAAI,CAAA,CAAE,CAAA,CAAA,CAAG,CAAE;;IAGnC,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAO;AACH,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAG,CAAA,CAAE,CAAA,CAAA,CAAA,CAAA,CAAA,CAAM,CAAA,CAAA,CAAA,CAAA,CAAK,CAAC,CAAA,CAAA,CAAG,CAAC,CAAA,CAAA,CAAGD,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAM,CAAC,CAAA,CAAA,CAAA,CAAA,CAAK,CAAE,CAAA,CAAA,CAAG,CAAA,CAAA,CAAG,MAAM,CAAE;AACpD,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAG,CAAA,CAAE,CAAA,CAAE,CAAA,CAAA,CAAG,EAAE,CAAA,CAAA,CAAA,CAAA,CAAA,CAAM,CAAA;KACrB;EAEL;AAEH;AAED,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA;AACAE,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAc,CAAC,CAAA,CAAA,CAAG,CAAE,CAAA,CAAA,CAAA,CAAA,CAAK,CAAA,CAAE,SAAS,CAAE;;;"}
+{"version":3,"file":"LCS.cjs","sources":["../../../src/metric/LCS.ts"],"sourcesContent":[null],"names":["Metric","Pool","MetricRegistry"],"mappings":";;;;;;AAgCM,CAAA,CAAA,CAAA,CAAA,CAAA,CAAO,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAU,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAQA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAc,CAAA;AAYzC,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAc,CAAc,CAAA,CAAE,CAAc,CAAA,CAAE,CAAA,CAAA,IAAqB,CAAA,CAAE,CAAA,CAAA;IAIjE,CAAA,CAAA,CAAA,CAAA,CAAK,CAAG,CAAA,CAAA,CAAA,CAAA,CAAK,CAAA,CAAE,CAAC,CAAA,CAAE,CAAC,CAAA,CAAE,CAAA,CAAA,CAAG,CAAA,CAAE,CAAA,CAAA,CAAA,CAAI,CAAE;EAEpC;EAYmB,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAO,CACtB,CAAS,CAAA,CAAE,CAAS,CAAA,CAAE,CAAS,CAAA,CAAE,CAAS,CAAA,CAC1C,CAAA,CAAA,CAAA,CAAA,CAAA,CAAc,CAAA,CAAA;AAId,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAM,CAAA,CAAA,CAAG,CAAA,CAAA,CAAW,CAAC,GAAG,CAAC;AACzB,CAAA,CAAA,CAAA,CAAA,MAAM,CAAE,CAAA,CAAA,CAAA,CAAI,EAAE,CAAA,CAAA,CAAA,CAAI,CAAE,GAAGC,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAI,CAAC,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAW,CAAE,QAAQ,CAAA,CAAE,CAAE,GAAG,CAAA,CAAE,CAAA,CAAA,CAAG,CAAE,CAAE;IAGjE,CAAA,CAAA,CAAA,CAAA,CAAM,CAAA,CAAA,CAAA,CAAI,CAAC,CAAA,CAAA,CAAG,CAAC,CAAA,CAAE,CAAC,CAAA,CAAA,CAAA,CAAI,CAAC,CAAA,CAAE,CAAC,CAAA,CAAE,CAAG,CAAA,CAAA,CAAA,CAAA,CAAI,CAAE,CAAC,CAAE,GAAG,CAAC;AAG5C,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAM,CAAA,CAAA,CAAA,CAAI,CAAC,CAAA,CAAA,CAAG,CAAC,CAAA,CAAE,CAAC,CAAA,CAAA,CAAA,CAAI,CAAC,CAAA,CAAE,CAAC,CAAA,CAAE,CAAA,CAAG;AAE3B,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAI,CAAE,CAAC,CAAE,GAAG,CAAC;MAGb,CAAA,CAAA,CAAA,CAAA,CAAA,CAAM,CAAA,CAAE,CAAA,CAAA,CAAW,CAAC,CAAC,UAAU,CAAE,CAAC,CAAA,CAAA,CAAG,CAAC,CAAE;AAExC,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAM,CAAA,CAAA,CAAA,CAAI,CAAC,CAAA,CAAA,CAAG,CAAC,CAAA,CAAE,CAAC,CAAA,CAAA,CAAA,CAAI,CAAC,CAAA,CAAE,CAAC,CAAA,CAAE,CAAA,CAAG;QAG3B,CAAA,CAAA,CAAA,CAAK,CAAC,CAAC,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAU,CAAE,CAAC,CAAA,CAAA,CAAG,CAAC,CAAE,CAAA,CAAA,CAAA,CAAA,CAAK,CAAA,CAAE,CAAG,CAAA,CAAA,CAAA,CAAA,CAAI,CAAE,CAAC,CAAE,CAAA,CAAA,CAAG,CAAA,CAAA,CAAA,CAAI,CAAE,CAAC,CAAA,CAAA,CAAG,CAAC,CAAE,CAAA,CAAA,CAAG,CAAC;aAG5D,CAAA,CAAA,CAAA,CAAI,CAAE,CAAC,CAAE,GAAG,CAAA,CAAA,CAAA,CAAI,CAAC,GAAG,CAAE,CAAA,CAAA,CAAA,CAAI,CAAE,CAAC,CAAE,EAAE,CAAA,CAAA,CAAA,CAAI,CAAE,CAAC,CAAA,CAAA,CAAG,CAAC,CAAE,CAAE;MAEzD;AAGA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAI,CAAC,CAAA,CAAA,CAAG,CAAE,IAAI,CAAE;IAEpB;AAGA,CAAA,CAAA,CAAA,CAAA,MAAM,CAAA,CAAA,CAAG,CAAA,CAAA,CAAW,CAAA,CAAA,CAAA,CAAI,CAAE,CAAC,CAAE;IAG7BA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAI,CAAC,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAO,CAAE,QAAQ,CAAA,CAAE,CAAA,CAAA,CAAA,CAAI,CAAA,CAAE,CAAA,CAAA,CAAG,CAAE;IACnCA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAI,CAAC,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAO,CAAE,QAAQ,CAAA,CAAE,CAAA,CAAA,CAAA,CAAI,CAAA,CAAE,CAAA,CAAA,CAAG,CAAE;IAGnC,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAO;AACH,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAG,CAAA,CAAE,CAAA,CAAA,CAAA,CAAA,CAAA,CAAM,CAAA,CAAA,CAAA,CAAA,CAAK,CAAC,CAAA,CAAA,CAAG,CAAC,CAAA,CAAA,CAAGD,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAM,CAAC,CAAA,CAAA,CAAA,CAAA,CAAK,CAAE,CAAA,CAAA,CAAG,CAAA,CAAA,CAAG,MAAM,CAAE;AACpD,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAG,CAAA,CAAE,CAAA,CAAE,CAAA,CAAA,CAAG,EAAE,CAAA,CAAA,CAAA,CAAA,CAAA,CAAM,CAAA;KACrB;EAEL;AAEH;AAGDE,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAc,CAAC,CAAA,CAAA,CAAG,CAAE,CAAA,CAAA,CAAA,CAAA,CAAK,CAAA,CAAE,SAAS,CAAE;;;"}

package/dist/cjs/metric/Levenshtein.cjs

@@ -1,93 +1,35 @@
-// CmpStr v3.0.2 build-522ae69-250720 by Paul Köhler @komed3 / MIT License
+// CmpStr v3.0.4 build-74e65a5-250915 by Paul Köhler @komed3 / MIT License
 'use strict';
 
 var Metric = require('./Metric.cjs');
 var Pool = require('../utils/Pool.cjs');
 
-/**
- * Levenshtein Distance
- * src/metric/Levenshtein.ts
- *
- * @see https://en.wikipedia.org/wiki/Levenshtein_distance
- *
- * The Levenshtein distance is a classic metric for measuring the minimum number
- * of single-character edits (insertions, deletions, or substitutions) required
- * to change one string into another.
- *
- * It is widely used in approximate string matching, spell checking, and natural
- * language processing.
- *
- * @module Metric/LevenshteinDistance
- * @author Paul Köhler (komed3)
- * @license MIT
- */
-/**
- * LevenshteinDistance class extends the Metric class to implement the Levenshtein distance algorithm.
- */
 class LevenshteinDistance extends Metric.Metric {
-  /**
-   * Constructor for the Levenshtein class.
-   *
-   * Initializes the Levenshtein metric with two input strings
-   * or arrays of strings and optional options.
-   *
-   * @param {MetricInput} a - First input string or array of strings
-   * @param {MetricInput} b - Second input string or array of strings
-   * @param {MetricOptions} [opt] - Options for the metric computation
-   */
   constructor(a, b, opt = {}) {
-    // Call the parent Metric constructor with the metric name and inputs
-    // Metric is symmetrical
     super('levenshtein', a, b, opt, true);
   }
-  /**
-   * Calculates the Levenshtein distance between two strings.
-   *
-   * @param {string} a - First string
-   * @param {string} b - Second string
-   * @param {number} m - Length of the first string
-   * @param {number} n - Length of the second string
-   * @param {number} maxLen - Maximum length of the strings
-   * @return {MetricCompute<LevenshteinRaw>} - Object containing the similarity result and raw distance
-   */
   compute(a, b, m, n, maxLen) {
-    // Get two reusable arrays from the Pool for the DP rows
     const len = m + 1;
     const [prev, curr] = Pool.Pool.acquireMany('uint16', [len, len]);
-    // Initialize the first row (edit distances from empty string to a)
     for (let i = 0; i <= m; i++) prev[i] = i;
-    // Fill the DP matrix row by row (over the longer string)
     for (let j = 1; j <= n; j++) {
-      // Cost of transforming empty string to b[0..j]
       curr[0] = j;
-      // Get the character code of the current character in b
       const cb = b.charCodeAt(j - 1);
       for (let i = 1; i <= m; i++) {
-        // Cost is 0 if characters match, 1 otherwise
         const cost = a.charCodeAt(i - 1) === cb ? 0 : 1;
-        // Calculate the minimum edit distance for current cell
-        curr[i] = Math.min(
-          curr[i - 1] + 1, // Insertion
-          prev[i] + 1, // Deletion
-          prev[i - 1] + cost // Substitution
-        );
+        curr[i] = Math.min(curr[i - 1] + 1, prev[i] + 1, prev[i - 1] + cost);
       }
-      // Copy current row to previous for next iteration
       prev.set(curr);
     }
-    // The last value in prev is the Levenshtein distance
     const dist = prev[m];
-    // Release arrays back to the pool
     Pool.Pool.release('uint16', prev, len);
     Pool.Pool.release('uint16', curr, len);
-    // Return the result as a MetricCompute object
     return {
       res: maxLen === 0 ? 1 : Metric.Metric.clamp(1 - dist / maxLen),
       raw: { dist, maxLen }
     };
   }
 }
-// Register the Levenshtein distance in the metric registry
 Metric.MetricRegistry.add('levenshtein', LevenshteinDistance);
 
 exports.LevenshteinDistance = LevenshteinDistance;

package/dist/cjs/metric/Levenshtein.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"Levenshtein.cjs","sources":["../../../src/metric/Levenshtein.ts"],"sourcesContent":[null],"names":["Metric","Pool","MetricRegistry"],"mappings":";;;;;;AAAA,CAAA,CAAA;;;;;;;;;;;;;;;;AAgBG,CAAA,CAAA;AAaH,CAAA,CAAA;;AAEG,CAAA,CAAA;AACG,CAAA,CAAA,CAAA,CAAA,CAAA,CAAO,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAoB,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAQA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAsB,CAAA;AAE3D,CAAA,CAAA,CAAA,CAAA;;;;;;;;;AASG,CAAA,CAAA,CAAA,CAAA;AACH,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAc,CAAc,CAAA,CAAE,CAAc,CAAA,CAAE,CAAA,CAAA,IAAqB,CAAA,CAAE,CAAA,CAAA;;;IAIjE,CAAA,CAAA,CAAA,CAAA,CAAK,CAAG,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAa,CAAA,CAAE,CAAC,CAAA,CAAE,CAAC,CAAA,CAAE,CAAA,CAAA,CAAG,CAAA,CAAE,CAAA,CAAA,CAAA,CAAI,CAAE;EAE5C;AAEA,CAAA,CAAA,CAAA,CAAA;;;;;;;;;AASG,CAAA,CAAA,CAAA,CAAA;EACgB,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAO,CACtB,CAAS,CAAA,CAAE,CAAS,CAAA,CAAE,CAAS,CAAA,CAAE,CAAS,CAAA,CAC1C,CAAA,CAAA,CAAA,CAAA,CAAA,CAAc,CAAA,CAAA;;AAId,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAM,CAAA,CAAA,CAAG,CAAA,CAAA,CAAW,CAAC,GAAG,CAAC;AACzB,CAAA,CAAA,CAAA,CAAA,MAAM,CAAE,CAAA,CAAA,CAAA,CAAI,EAAE,CAAA,CAAA,CAAA,CAAI,CAAE,GAAGC,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAI,CAAC,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAW,CAAE,QAAQ,CAAA,CAAE,CAAE,GAAG,CAAA,CAAE,CAAA,CAAA,CAAG,CAAE,CAAE;;IAGjE,CAAA,CAAA,CAAA,CAAA,CAAM,CAAA,CAAA,CAAA,CAAI,CAAC,CAAA,CAAA,CAAG,CAAC,CAAA,CAAE,CAAC,CAAA,CAAA,CAAA,CAAI,CAAC,CAAA,CAAE,CAAC,CAAA,CAAE,CAAG,CAAA,CAAA,CAAA,CAAA,CAAI,CAAE,CAAC,CAAE,GAAG,CAAC;;AAG5C,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAM,CAAA,CAAA,CAAA,CAAI,CAAC,CAAA,CAAA,CAAG,CAAC,CAAA,CAAE,CAAC,CAAA,CAAA,CAAA,CAAI,CAAC,CAAA,CAAE,CAAC,CAAA,CAAE,CAAA,CAAG;;AAG3B,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAI,CAAE,CAAC,CAAE,GAAG,CAAC;;MAGb,CAAA,CAAA,CAAA,CAAA,CAAA,CAAM,CAAA,CAAE,CAAA,CAAA,CAAW,CAAC,CAAC,UAAU,CAAE,CAAC,CAAA,CAAA,CAAG,CAAC,CAAE;AAExC,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAM,CAAA,CAAA,CAAA,CAAI,CAAC,CAAA,CAAA,CAAG,CAAC,CAAA,CAAE,CAAC,CAAA,CAAA,CAAA,CAAI,CAAC,CAAA,CAAE,CAAC,CAAA,CAAE,CAAA,CAAG;;QAG3B,MAAM,CAAA,CAAA,CAAA,CAAI,CAAA,CAAA,CAAW,CAAC,CAAC,UAAU,CAAE,CAAC,CAAA,CAAA,CAAG,CAAC,CAAE,CAAA,CAAA,CAAA,CAAA,CAAK,CAAA,CAAE,CAAA,CAAA,CAAG,CAAC,GAAG,CAAC;;AAGzD,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,IAAI,CAAE,CAAC,CAAE,CAAA,CAAA,CAAG,IAAI,CAAC,CAAA,CAAA,CAAG;UAChB,CAAA,CAAA,CAAA,CAAI,CAAE,CAAC,CAAA,CAAA,CAAG,CAAC,CAAE,GAAG,CAAC,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA;AACjB,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAI,CAAE,CAAC,CAAE,GAAG,CAAC,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA;UACb,IAAI,CAAE,CAAC,GAAG,CAAC,CAAE,GAAG,CAAA,CAAA,CAAA,CAAI,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA;SACvB;MAEL;;AAGA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAI,CAAC,CAAA,CAAA,CAAG,CAAE,IAAI,CAAE;IAEpB;;AAGA,CAAA,CAAA,CAAA,CAAA,MAAM,CAAA,CAAA,CAAA,CAAI,CAAA,CAAA,CAAW,CAAA,CAAA,CAAA,CAAI,CAAE,CAAC,CAAE;;IAG9BA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAI,CAAC,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAO,CAAE,QAAQ,CAAA,CAAE,CAAA,CAAA,CAAA,CAAI,CAAA,CAAE,CAAA,CAAA,CAAG,CAAE;IACnCA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAI,CAAC,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAO,CAAE,QAAQ,CAAA,CAAE,CAAA,CAAA,CAAA,CAAI,CAAA,CAAE,CAAA,CAAA,CAAG,CAAE;;IAGnC,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAO;MACH,GAAG,CAAA,CAAE,CAAA,CAAA,CAAA,CAAA,CAAA,CAAM,CAAA,CAAA,CAAA,CAAA,CAAK,CAAC,GAAG,CAAC,CAAA,CAAA,CAAGD,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAM,CAAC,KAAK,CAAE,CAAC,GAAG,CAAA,CAAA,CAAA,CAAI,CAAA,CAAA,CAAG,MAAM,CAAE;AACzD,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAG,CAAA,CAAE,CAAA,CAAE,CAAA,CAAA,CAAA,CAAI,EAAE,CAAA,CAAA,CAAA,CAAA,CAAA,CAAM,CAAA;KACtB;EAEL;AAEH;AAED,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA;AACAE,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAc,CAAC,CAAA,CAAA,CAAG,CAAE,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAa,CAAA,CAAE,mBAAmB,CAAE;;;"}
+{"version":3,"file":"Levenshtein.cjs","sources":["../../../src/metric/Levenshtein.ts"],"sourcesContent":[null],"names":["Metric","Pool","MetricRegistry"],"mappings":";;;;;;AAgCM,CAAA,CAAA,CAAA,CAAA,CAAA,CAAO,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAoB,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAQA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAsB,CAAA;AAY3D,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAc,CAAc,CAAA,CAAE,CAAc,CAAA,CAAE,CAAA,CAAA,IAAqB,CAAA,CAAE,CAAA,CAAA;IAIjE,CAAA,CAAA,CAAA,CAAA,CAAK,CAAG,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAa,CAAA,CAAE,CAAC,CAAA,CAAE,CAAC,CAAA,CAAE,CAAA,CAAA,CAAG,CAAA,CAAE,CAAA,CAAA,CAAA,CAAI,CAAE;EAE5C;EAYmB,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAO,CACtB,CAAS,CAAA,CAAE,CAAS,CAAA,CAAE,CAAS,CAAA,CAAE,CAAS,CAAA,CAC1C,CAAA,CAAA,CAAA,CAAA,CAAA,CAAc,CAAA,CAAA;AAId,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAM,CAAA,CAAA,CAAG,CAAA,CAAA,CAAW,CAAC,GAAG,CAAC;AACzB,CAAA,CAAA,CAAA,CAAA,MAAM,CAAE,CAAA,CAAA,CAAA,CAAI,EAAE,CAAA,CAAA,CAAA,CAAI,CAAE,GAAGC,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAI,CAAC,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAW,CAAE,QAAQ,CAAA,CAAE,CAAE,GAAG,CAAA,CAAE,CAAA,CAAA,CAAG,CAAE,CAAE;IAGjE,CAAA,CAAA,CAAA,CAAA,CAAM,CAAA,CAAA,CAAA,CAAI,CAAC,CAAA,CAAA,CAAG,CAAC,CAAA,CAAE,CAAC,CAAA,CAAA,CAAA,CAAI,CAAC,CAAA,CAAE,CAAC,CAAA,CAAE,CAAG,CAAA,CAAA,CAAA,CAAA,CAAI,CAAE,CAAC,CAAE,GAAG,CAAC;AAG5C,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAM,CAAA,CAAA,CAAA,CAAI,CAAC,CAAA,CAAA,CAAG,CAAC,CAAA,CAAE,CAAC,CAAA,CAAA,CAAA,CAAI,CAAC,CAAA,CAAE,CAAC,CAAA,CAAE,CAAA,CAAG;AAG3B,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAI,CAAE,CAAC,CAAE,GAAG,CAAC;MAGb,CAAA,CAAA,CAAA,CAAA,CAAA,CAAM,CAAA,CAAE,CAAA,CAAA,CAAW,CAAC,CAAC,UAAU,CAAE,CAAC,CAAA,CAAA,CAAG,CAAC,CAAE;AAExC,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAM,CAAA,CAAA,CAAA,CAAI,CAAC,CAAA,CAAA,CAAG,CAAC,CAAA,CAAE,CAAC,CAAA,CAAA,CAAA,CAAI,CAAC,CAAA,CAAE,CAAC,CAAA,CAAE,CAAA,CAAG;QAG3B,MAAM,CAAA,CAAA,CAAA,CAAI,CAAA,CAAA,CAAW,CAAC,CAAC,UAAU,CAAE,CAAC,CAAA,CAAA,CAAG,CAAC,CAAE,CAAA,CAAA,CAAA,CAAA,CAAK,CAAA,CAAE,CAAA,CAAA,CAAG,CAAC,GAAG,CAAC;AAGzD,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,IAAI,CAAE,CAAC,CAAE,CAAA,CAAA,CAAG,IAAI,CAAC,CAAA,CAAA,CAAG,CAChB,CAAA,CAAA,CAAA,CAAI,CAAE,CAAC,CAAA,CAAA,CAAG,CAAC,CAAE,GAAG,CAAC,CACjB,CAAA,CAAA,CAAA,CAAA,CAAI,CAAE,CAAC,CAAE,GAAG,CAAC,EACb,IAAI,CAAE,CAAC,CAAA,CAAA,CAAG,CAAC,CAAE,CAAA,CAAA,CAAG,CAAA,CAAA,CAAA,EACnB;MAEL;AAGA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAI,CAAC,CAAA,CAAA,CAAG,CAAE,IAAI,CAAE;IAEpB;AAGA,CAAA,CAAA,CAAA,CAAA,MAAM,CAAA,CAAA,CAAA,CAAI,CAAA,CAAA,CAAW,CAAA,CAAA,CAAA,CAAI,CAAE,CAAC,CAAE;IAG9BA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAI,CAAC,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAO,CAAE,QAAQ,CAAA,CAAE,CAAA,CAAA,CAAA,CAAI,CAAA,CAAE,CAAA,CAAA,CAAG,CAAE;IACnCA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAI,CAAC,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAO,CAAE,QAAQ,CAAA,CAAE,CAAA,CAAA,CAAA,CAAI,CAAA,CAAE,CAAA,CAAA,CAAG,CAAE;IAGnC,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAO;MACH,GAAG,CAAA,CAAE,CAAA,CAAA,CAAA,CAAA,CAAA,CAAM,CAAA,CAAA,CAAA,CAAA,CAAK,CAAC,GAAG,CAAC,CAAA,CAAA,CAAGD,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAM,CAAC,KAAK,CAAE,CAAC,GAAG,CAAA,CAAA,CAAA,CAAI,CAAA,CAAA,CAAG,MAAM,CAAE;AACzD,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAG,CAAA,CAAE,CAAA,CAAE,CAAA,CAAA,CAAA,CAAI,EAAE,CAAA,CAAA,CAAA,CAAA,CAAA,CAAM,CAAA;KACtB;EAEL;AAEH;AAGDE,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAc,CAAC,CAAA,CAAA,CAAG,CAAE,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAa,CAAA,CAAE,mBAAmB,CAAE;;;"}

package/dist/cjs/metric/Metric.cjs

@@ -1,190 +1,69 @@
-// CmpStr v3.0.2 build-522ae69-250720 by Paul Köhler @komed3 / MIT License
+// CmpStr v3.0.4 build-74e65a5-250915 by Paul Köhler @komed3 / MIT License
 'use strict';
 
 var Registry = require('../utils/Registry.cjs');
 var HashTable = require('../utils/HashTable.cjs');
 var Profiler = require('../utils/Profiler.cjs');
 
-/**
- * Abstract Metric
- * src/metric/Metric.ts
- *
- * This module defines an abstract class for string metrics, providing a framework for
- * computing various string similarity metrics. It includes methods for running metrics
- * in different modes (single, batch, pairwise) synchronous or asynchronous and caching
- * results to optimize performance. The class is designed to be extended by specific
- * metric implementations like the Levenshtein distance or Jaro-Winkler similarity.
- *
- * It provides:
- *  - A base class for string metrics with common functionality
- *  - Methods for running metrics in different modes
- *  - Pre-computation for trivial cases to optimize performance
- *  - Caching of metric computations to avoid redundant calculations
- *  - Support for symmetrical metrics (same result for inputs in any order)
- *  - Performance tracking capabilities (Profiler)
- *  - Asynchronous execution support for metrics
- *
- * This class is intended to be extended by specific metric implementations that will
- * implement the `compute` method to define the specific metric computation logic.
- *
- * @module Metric
- * @author Paul Köhler (komed3)
- * @license MIT
- */
-// Get the singleton profiler instance for performance monitoring
 const profiler = Profiler.Profiler.getInstance();
-/**
- * Abstract class representing a generic string metric.
- *
- * @abstract
- * @template R - The type of the raw result, defaulting to `MetricRaw`.
- */
 class Metric {
-  // Cache for metric computations to avoid redundant calculations
   static cache = new HashTable.HashTable();
-  // Metric name for identification
   metric;
-  // Inputs for the metric computation, transformed into arrays
   a;
   b;
-  // Store original inputs for result mapping
   origA = [];
   origB = [];
-  // Options for the metric computation, such as performance tracking
   options;
-  // Indicates whether the metric is symmetric (same result for inputs in any order)
   symmetric;
-  /**
-   * Result of the metric computation, which can be a single result or an array of results.
-   * This will be populated after running the metric.
-   */
   results;
-  /**
-   * Static method to clear the cache of metric computations.
-   */
   static clear() {
     this.cache.clear();
   }
-  /**
-   * Swaps two strings and their lengths if the first is longer than the second.
-   *
-   * @param {string} a - First string
-   * @param {string} b - Second string
-   * @param {number} m - Length of the first string
-   * @param {number} n - Length of the second string
-   * @returns {[string, string, number, number]} - Swapped strings and lengths
-   */
   static swap(a, b, m, n) {
     return m > n ? [b, a, n, m] : [a, b, m, n];
   }
-  /**
-   * Clamps the similarity result between 0 and 1.
-   *
-   * @param {number} res - The input similarity to clamp
-   * @returns {number} - The clamped similarity (0 to 1)
-   */
   static clamp(res) {
     return Math.max(0, Math.min(1, res));
   }
-  /**
-   * Constructor for the Metric class.
-   * Initializes the metric with two inputs (strings or arrays of strings) and options.
-   *
-   * @param {string} metric - The name of the metric (e.g. 'levenshtein')
-   * @param {MetricInput} a - First input string or array of strings
-   * @param {MetricInput} b - Second input string or array of strings
-   * @param {MetricOptions} [opt] - Options for the metric computation
-   * @param {boolean} [symmetric=false] - Whether the metric is symmetric (same result for inputs in any order)
-   * @throws {Error} - If inputs `a` or `b` are empty
-   */
   constructor(metric, a, b, opt = {}, symmetric = false) {
-    // Set the metric name
     this.metric = metric;
-    // Set the inputs
     this.a = Array.isArray(a) ? a : [a];
     this.b = Array.isArray(b) ? b : [b];
-    // Validate inputs: ensure they are not empty
     if (this.a.length === 0 || this.b.length === 0)
-      throw new Error(`inputs <a> and <b> must not be empty`);
-    // Set options
+      throw new Error(`Inputs <a> and <b> must not be empty`);
     this.options = opt;
     this.symmetric = symmetric;
   }
-  /**
-   * Pre-compute the metric for two strings.
-   * This method is called before the actual computation to handle trivial cases.
-   *
-   * @param {string} a - First string
-   * @param {string} b - Second string
-   * @param {number} m - Length of the first string
-   * @param {number} n - Length of the second string
-   * @returns {MetricCompute<R>|undefined} - Pre-computed result or undefined if not applicable
-   */
   preCompute(a, b, m, n) {
-    // If strings are identical, return a similarity of 1
     if (a === b) return { res: 1 };
-    // If the lengths of both strings is less than 2, return a similarity of 0
     if (m == 0 || n == 0 || (m < 2 && n < 2)) return { res: 0 };
     return undefined;
   }
-  /**
-   * Abstract method to be implemented by subclasses to perform the metric computation.
-   * This method should contain the logic for computing the metric between two strings.
-   *
-   * @param {string} a - First string
-   * @param {string} b - Second string
-   * @param {number} m - Length of the first string
-   * @param {number} n - Length of the second string
-   * @param {number} maxLen - Maximum length of the strings
-   * @returns {MetricCompute<R>} - The result of the metric computation
-   * @throws {Error} - If not overridden in a subclass
-   */
   compute(a, b, m, n, maxLen) {
     throw new Error(`Method compute() must be overridden in a subclass`);
   }
-  /**
-   * Run the metric computation for single inputs (two strings).
-   * Applies preCompute for trivial cases before cache lookup and computation.
-   *
-   * If the profiler is active, it will measure time and memory usage.
-   *
-   * @param {number} i - Pointer to the first string
-   * @param {number} j - Pointer to the second string
-   * @returns {MetricResultSingle<R>} - The result of the metric computation
-   */
   runSingle(i, j) {
-    // Type safety: convert inputs to strings
     let a = String(this.a[i]),
       A = a;
     let b = String(this.b[j]),
       B = b;
-    // Get lengths
     let m = A.length,
       n = B.length;
-    // Pre-compute trivial cases (identical, empty, etc.)
     let result = this.preCompute(A, B, m, n);
     if (!result) {
-      // If the profiler is enabled, measure; else, just run
       result = profiler.run(() => {
-        // Generate a cache key based on the metric and pair of strings `a` and `b`
         const key = Metric.cache.key(this.metric, [A, B], this.symmetric);
-        // If the key exists in the cache, return the cached result
-        // Otherwise, compute the metric using the algorithm
         return (
           Metric.cache.get(key || '') ??
           (() => {
-            // If the metric is symmetrical, swap `a` and `b` (shorter string first)
             if (this.symmetric) [A, B, m, n] = Metric.swap(A, B, m, n);
-            // Compute the similarity using the algorithm
             const res = this.compute(A, B, m, n, Math.max(m, n));
-            // If a key was generated, store the result in the cache
             if (key) Metric.cache.set(key, res);
             return res;
           })()
         );
       });
     }
-    // Build metric result object
     return {
       metric: this.metric,
       a: this.origA[i] ?? a,
@@ -192,114 +71,45 @@ class Metric {
       ...result
     };
   }
-  /**
-   * Run the metric computation for single inputs (two strings) asynchronously.
-   *
-   * @param {number} i - Pointer to the first string
-   * @param {number} j - Pointer to the second string
-   * @returns {Promise<MetricResultSingle<R>>} - Promise resolving the result of the metric computation
-   */
   async runSingleAsync(i, j) {
     return Promise.resolve(this.runSingle(i, j));
   }
-  /**
-   * Run the metric computation for batch inputs (arrays of strings).
-   *
-   * It iterates through each string in the first array and computes the metric
-   * against each string in the second array.
-   */
   runBatch() {
     const results = [];
-    // Loop through each combination of strings in a[] and b[]
     for (let i = 0; i < this.a.length; i++)
       for (let j = 0; j < this.b.length; j++)
         results.push(this.runSingle(i, j));
-    // Populate the results
-    // `this.results` will be an array of MetricResultSingle
     this.results = results;
   }
-  /**
-   * Run the metric computation for batch inputs (arrays of strings) asynchronously.
-   */
   async runBatchAsync() {
     const results = [];
-    // Loop through each combination of strings in a[] and b[]
     for (let i = 0; i < this.a.length; i++)
       for (let j = 0; j < this.b.length; j++)
         results.push(await this.runSingleAsync(i, j));
-    // Populate the results
-    // `this.results` will be an array of MetricResultSingle
     this.results = results;
   }
-  /**
-   * Run the metric computation for pairwise inputs (A[i] vs B[i]).
-   *
-   * This method assumes that both `a` and `b` are arrays of equal length
-   * and computes the metric only for corresponding index pairs.
-   */
   runPairwise() {
     const results = [];
-    // Compute metric for each corresponding pair
     for (let i = 0; i < this.a.length; i++) results.push(this.runSingle(i, i));
-    // Populate the results
-    // `this.results` will be an array of MetricResultSingle
     this.results = results;
   }
-  /**
-   * Run the metric computation for pairwise inputs (A[i] vs B[i]) asynchronously.
-   */
   async runPairwiseAsync() {
     const results = [];
-    // Compute metric for each corresponding pair
     for (let i = 0; i < this.a.length; i++)
       results.push(await this.runSingleAsync(i, i));
-    // Populate the results
-    // `this.results` will be an array of MetricResultSingle
     this.results = results;
   }
-  /**
-   * Set the original inputs to which the results of the metric calculation will refer.
-   *
-   * @param {MetricInput} [a] - original input(s) for a
-   * @param {MetricInput} [b] - original input(s) for b
-   */
   setOriginal(a, b) {
     if (a) this.origA = Array.isArray(a) ? a : [a];
     if (b) this.origB = Array.isArray(b) ? b : [b];
     return this;
   }
-  /**
-   * Check if the inputs are in batch mode.
-   *
-   * This method checks if either `a` or `b` contains more than one string,
-   * indicating that the metric is being run in batch mode.
-   *
-   * @returns {boolean} - True if either input is an array with more than one element
-   */
   isBatch() {
     return this.a.length > 1 || this.b.length > 1;
   }
-  /**
-   * Check if the inputs are in single mode.
-   *
-   * This method checks if both `a` and `b` are single strings (not arrays),
-   * indicating that the metric is being run on a single pair of strings.
-   *
-   * @returns {boolean} - True if both inputs are single strings
-   */
   isSingle() {
     return !this.isBatch();
   }
-  /**
-   * Check if the inputs are in pairwise mode.
-   *
-   * This method checks if both `a` and `b` are arrays of the same length,
-   * indicating that the metric is being run on corresponding pairs of strings.
-   *
-   * @returns {boolean} - True if both inputs are arrays of equal length
-   * @param {boolean} [safe=false] - If true, does not throw an error if lengths are not equal
-   * @throws {Error} - If `safe` is false and the lengths of `a` and `b` are not equal
-   */
   isPairwise(safe = false) {
     return this.isBatch() && this.a.length === this.b.length
       ? true
@@ -308,136 +118,66 @@ class Metric {
             throw new Error(`Mode <pairwise> requires arrays of equal length`);
           })();
   }
-  /**
-   * Check if the metric is symmetrical.
-   *
-   * This method returns whether the metric is symmetric, meaning it produces the same
-   * result regardless of the order of inputs (e.g., Levenshtein distance).
-   *
-   * @returns {boolean} - True if the metric is symmetric
-   */
   isSymmetrical() {
     return this.symmetric;
   }
-  /**
-   * Determine which mode to run the metric in.
-   *
-   * This method checks the provided mode or defaults to the mode specified in options.
-   * If no mode is specified, it defaults to 'default'.
-   *
-   * @param {MetricMode} [mode] - The mode to run the metric in (optional)
-   * @returns {MetricMode} - The determined mode
-   */
   whichMode(mode) {
     return mode ?? this.options?.mode ?? 'default';
   }
-  /**
-   * Clear the cached results of the metric.
-   *
-   * This method resets the `results` property to `undefined`, effectively clearing
-   * any previously computed results. It can be useful for re-running the metric
-   * with new inputs or options.
-   */
   clear() {
     this.results = undefined;
   }
-  /**
-   * Run the metric computation based on the specified mode.
-   *
-   * @param {MetricMode} [mode] - The mode to run the metric in (optional)
-   * @param {boolean} [clear=true] - Whether to clear previous results before running
-   * @throws {Error} - If an unsupported mode is specified
-   */
   run(mode, clear = true) {
-    // Clear previous results if requested
     if (clear) this.clear();
     switch (this.whichMode(mode)) {
-      // Default mode runs the metric on single inputs or falls back to batch mode
       case 'default':
         if (this.isSingle()) {
           this.results = this.runSingle(0, 0);
           break;
         }
-      // Batch mode runs the metric on all combinations of a[] and b[]
       case 'batch':
         this.runBatch();
         break;
-      // Single mode runs the metric on the first elements of a[] and b[]
       case 'single':
         this.results = this.runSingle(0, 0);
         break;
-      // Pairwise mode runs the metric on corresponding pairs of a[] and b[]
       case 'pairwise':
         if (this.isPairwise()) this.runPairwise();
         break;
-      // Unsupported mode
       default:
         throw new Error(`Unsupported mode <${mode}>`);
     }
   }
-  /**
-   * Run the metric computation based on the specified mode asynchronously.
-   *
-   * @param {MetricMode} [mode] - The mode to run the metric in (optional)
-   * @param {boolean} [clear=true] - Whether to clear previous results before running
-   * @returns {Promise<void>} - A promise that resolves when the metric computation is complete
-   * @throws {Error} - If an unsupported mode is specified
-   */
   async runAsync(mode, clear = true) {
-    // Clear previous results if requested
     if (clear) this.clear();
     switch (this.whichMode(mode)) {
-      // Default mode runs the metric on single inputs or falls back to batch mode
       case 'default':
         if (this.isSingle()) {
           this.results = await this.runSingleAsync(0, 0);
           break;
         }
-      // Batch mode runs the metric on all combinations of a[] and b[]
       case 'batch':
         await this.runBatchAsync();
         break;
-      // Single mode runs the metric on the first elements of a[] and b[]
       case 'single':
         this.results = await this.runSingleAsync(0, 0);
         break;
-      // Pairwise mode runs the metric on corresponding pairs of a[] and b[]
       case 'pairwise':
         if (this.isPairwise()) await this.runPairwiseAsync();
         break;
-      // Unsupported mode
       default:
         throw new Error(`Unsupported async mode <${mode}>`);
     }
   }
-  /**
-   * Get the name of the metric.
-   *
-   * @returns {string} - The name of the metric
-   */
   getMetricName() {
     return this.metric;
   }
-  /**
-   * Get the result of the metric computation.
-   *
-   * @returns {MetricResult<R>} - The result of the metric computation
-   * @throws {Error} - If `run()` has not been called before this method
-   */
   getResults() {
-    // Ensure that the metric has been run before getting the result
     if (this.results === undefined)
       throw new Error(`run() must be called before getResult()`);
-    // Return the result(s)
     return this.results;
   }
 }
-/**
- * Metric registry service for managing metric implementations.
- *
- * This registry allows for dynamic registration and retrieval of metric classes,
- * enabling the use of various string similarity metrics in a consistent manner.
- */
 const MetricRegistry = Registry.Registry('metric', Metric);
 
 exports.Metric = Metric;