edf2csv 0.7.249 → 0.7.251

package/dist/cli.js

@@ -26,6 +26,7 @@ import { TimeRangeError, parseTimeSpec } from './convert/time-range.js';
 import { deriveRecordStarts, withTimingPromiseKept } from './convert/timing.js';
 import { formatDiagnostics, formatInfo, infoJson, formatSummary, printable, printableLines, summaryJson, wrap } from './cli/report.js';
 import { counted, listed } from './format/list.js';
+import { editDistance } from './format/distance.js';
 import { VERSION } from './version.js';
 const USAGE = `edf2csv ${VERSION}
 Convert EDF, EDF+ and BDF recordings to CSV
@@ -2072,32 +2073,6 @@ function usageMessage(error, argv) {
         `flag rather than as its value.\n` +
         `       Write it as one argument instead: ${typeable}`);
 }
-/**
- * Edit distance counting a swap of two adjacent characters as one edit, not two.
- *
- * Damerau's restricted form, which needs the row two back and so keeps three rather than the
- * two plain Levenshtein needs. Twenty names of under twenty characters, so the extra row costs
- * nothing worth measuring.
- */
-function editDistance(a, b) {
-    let twoBack = [];
-    let previous = Array.from({ length: b.length + 1 }, (_unused, i) => i);
-    for (let i = 1; i <= a.length; i++) {
-        const current = new Array(b.length + 1).fill(0);
-        current[0] = i;
-        for (let j = 1; j <= b.length; j++) {
-            const cost = a[i - 1] === b[j - 1] ? 0 : 1;
-            let best = Math.min(previous[j] + 1, current[j - 1] + 1, previous[j - 1] + cost);
-            if (i > 1 && j > 1 && a[i - 1] === b[j - 2] && a[i - 2] === b[j - 1]) {
-                best = Math.min(best, twoBack[j - 2] + 1);
-            }
-            current[j] = best;
-        }
-        twoBack = previous;
-        previous = current;
-    }
-    return previous[b.length];
-}
 /**
  * The option they probably meant, or null when nothing is close enough to say.
  *