@unbrained/pm-cli 2026.6.8 → 2026.6.9

package/dist/cli-bundle/chunks/chunk-EAOG77HM.js

@@ -1,56 +0,0 @@
-// dist/core/shared/levenshtein.js
-!(function() {
-  try {
-    var e = "undefined" != typeof window ? window : "undefined" != typeof global ? global : "undefined" != typeof globalThis ? globalThis : "undefined" != typeof self ? self : {}, n = new e.Error().stack;
-    n && (e._sentryDebugIds = e._sentryDebugIds || {}, e._sentryDebugIds[n] = "6f3e0977-8505-552c-b2ff-862f2a5d5a91");
-  } catch (e2) {
-  }
-})();
-function levenshteinDistanceWithinLimit(left, right, limit) {
-  if (left === right) {
-    return 0;
-  }
-  if (Math.abs(left.length - right.length) > limit) {
-    return null;
-  }
-  const width = right.length + 1;
-  const beforePrevious = new Array(width);
-  const previous = new Array(width);
-  const current = new Array(width);
-  for (let column = 0; column < width; column += 1) {
-    beforePrevious[column] = 0;
-    previous[column] = column;
-  }
-  for (let row = 1; row <= left.length; row += 1) {
-    current[0] = row;
-    let rowMin = current[0];
-    for (let column = 1; column <= right.length; column += 1) {
-      const cost = left[row - 1] === right[column - 1] ? 0 : 1;
-      const substitution = previous[column - 1] + cost;
-      const insertion = current[column - 1] + 1;
-      const deletion = previous[column] + 1;
-      let candidate = Math.min(substitution, insertion, deletion);
-      if (row > 1 && column > 1 && left[row - 1] === right[column - 2] && left[row - 2] === right[column - 1]) {
-        candidate = Math.min(candidate, beforePrevious[column - 2] + 1);
-      }
-      current[column] = candidate;
-      if (candidate < rowMin) {
-        rowMin = candidate;
-      }
-    }
-    if (rowMin > limit) {
-      return null;
-    }
-    for (let column = 0; column < width; column += 1) {
-      beforePrevious[column] = previous[column];
-      previous[column] = current[column];
-    }
-  }
-  const result = previous[right.length];
-  return result <= limit ? result : null;
-}
-
-export {
-  levenshteinDistanceWithinLimit
-};
-//# sourceMappingURL=chunk-EAOG77HM.js.map

package/dist/cli-bundle/chunks/chunk-EAOG77HM.js.map

@@ -1,7 +0,0 @@
-{
-  "version": 3,
-  "sources": ["../../../../../../../../core/shared/levenshtein.ts"],
-  "sourcesContent": ["// Optimal String Alignment (OSA) Damerau–Levenshtein: counts a single adjacent\n// transposition as one edit (e.g. \"titel\" vs \"title\", \"lst\" vs \"lts\" -> \"list\")\n// so flag/command typo suggestions catch transpositions at the same maxDistance\n// budget plain Levenshtein uses for substitutions. pm-fl0c #6 (2026-05-28):\n// fixed because plain Levenshtein scored \"titel\"->\"title\" at 2, defeating the\n// length-5 maxDistance=1 ceiling in suggestNearestLongFlags.\nexport function levenshteinDistanceWithinLimit(left: string, right: string, limit: number): number | null {\n  if (left === right) {\n    return 0;\n  }\n  if (Math.abs(left.length - right.length) > limit) {\n    return null;\n  }\n  const width = right.length + 1;\n  const beforePrevious = new Array<number>(width);\n  const previous = new Array<number>(width);\n  const current = new Array<number>(width);\n  for (let column = 0; column < width; column += 1) {\n    beforePrevious[column] = 0;\n    previous[column] = column;\n  }\n  for (let row = 1; row <= left.length; row += 1) {\n    current[0] = row;\n    let rowMin = current[0];\n    for (let column = 1; column <= right.length; column += 1) {\n      const cost = left[row - 1] === right[column - 1] ? 0 : 1;\n      const substitution = previous[column - 1] + cost;\n      const insertion = current[column - 1] + 1;\n      const deletion = previous[column] + 1;\n      let candidate = Math.min(substitution, insertion, deletion);\n      if (\n        row > 1 &&\n        column > 1 &&\n        left[row - 1] === right[column - 2] &&\n        left[row - 2] === right[column - 1]\n      ) {\n        candidate = Math.min(candidate, beforePrevious[column - 2] + 1);\n      }\n      current[column] = candidate;\n      if (candidate < rowMin) {\n        rowMin = candidate;\n      }\n    }\n    if (rowMin > limit) {\n      return null;\n    }\n    for (let column = 0; column < width; column += 1) {\n      beforePrevious[column] = previous[column];\n      previous[column] = current[column];\n    }\n  }\n  const result = previous[right.length];\n  return result <= limit ? result : null;\n}\n"],
-  "mappings": ";;;;;;;;AAMM,SAAU,+BAA+B,MAAc,OAAe,OAAa;AACvF,MAAI,SAAS,OAAO;AAClB,WAAO;EACT;AACA,MAAI,KAAK,IAAI,KAAK,SAAS,MAAM,MAAM,IAAI,OAAO;AAChD,WAAO;EACT;AACA,QAAM,QAAQ,MAAM,SAAS;AAC7B,QAAM,iBAAiB,IAAI,MAAc,KAAK;AAC9C,QAAM,WAAW,IAAI,MAAc,KAAK;AACxC,QAAM,UAAU,IAAI,MAAc,KAAK;AACvC,WAAS,SAAS,GAAG,SAAS,OAAO,UAAU,GAAG;AAChD,mBAAe,MAAM,IAAI;AACzB,aAAS,MAAM,IAAI;EACrB;AACA,WAAS,MAAM,GAAG,OAAO,KAAK,QAAQ,OAAO,GAAG;AAC9C,YAAQ,CAAC,IAAI;AACb,QAAI,SAAS,QAAQ,CAAC;AACtB,aAAS,SAAS,GAAG,UAAU,MAAM,QAAQ,UAAU,GAAG;AACxD,YAAM,OAAO,KAAK,MAAM,CAAC,MAAM,MAAM,SAAS,CAAC,IAAI,IAAI;AACvD,YAAM,eAAe,SAAS,SAAS,CAAC,IAAI;AAC5C,YAAM,YAAY,QAAQ,SAAS,CAAC,IAAI;AACxC,YAAM,WAAW,SAAS,MAAM,IAAI;AACpC,UAAI,YAAY,KAAK,IAAI,cAAc,WAAW,QAAQ;AAC1D,UACE,MAAM,KACN,SAAS,KACT,KAAK,MAAM,CAAC,MAAM,MAAM,SAAS,CAAC,KAClC,KAAK,MAAM,CAAC,MAAM,MAAM,SAAS,CAAC,GAClC;AACA,oBAAY,KAAK,IAAI,WAAW,eAAe,SAAS,CAAC,IAAI,CAAC;MAChE;AACA,cAAQ,MAAM,IAAI;AAClB,UAAI,YAAY,QAAQ;AACtB,iBAAS;MACX;IACF;AACA,QAAI,SAAS,OAAO;AAClB,aAAO;IACT;AACA,aAAS,SAAS,GAAG,SAAS,OAAO,UAAU,GAAG;AAChD,qBAAe,MAAM,IAAI,SAAS,MAAM;AACxC,eAAS,MAAM,IAAI,QAAQ,MAAM;IACnC;EACF;AACA,QAAM,SAAS,SAAS,MAAM,MAAM;AACpC,SAAO,UAAU,QAAQ,SAAS;AACpC;",
-  "names": []
-}