pi-hashline-edit-pro 6.5.0 → 7.0.0

package/src/edit-fidelity.ts

@@ -1,5 +1,5 @@
 import { isBlankLine, splitLines } from "./utils";
-import { HASH_SEP, canon } from "./hashline";
+import { HASH_CLASS, HASH_SEP, canon } from "./hashline";
 import type { DiffSpan } from "./replace-diff";
 
 const INVISIBLE_RE = /\p{Default_Ignorable_Code_Point}/u;
@@ -396,6 +396,25 @@ export function annotateLiteralEscapeHints(
   });
 }
 
+const LITERAL_ESCAPE_DETAIL_RE = /^\[H_LITERAL_ESCAPE\] [^:]*: "(.*?)" written as literal text(?: \((.*)\))?\.?$/;
+const LITERAL_ESCAPE_ANCHOR_RE = new RegExp(`(${HASH_CLASS})│`, "g");
+const UNICODE_LOST_DETAIL_RE = new RegExp(`^\\[H_UNICODE_LOST\\] (${HASH_CLASS})│ missing "([^"]*)"`);
+
+export function dedupeLiteralEscapeHints(hints: readonly string[]): string[] {
+  const suppressed = new Set<string>();
+  for (const hint of hints) {
+    const literal = LITERAL_ESCAPE_DETAIL_RE.exec(hint);
+    if (literal === null) continue;
+    const escape = literal[1] ?? "";
+    for (const anchor of (literal[2] ?? "").matchAll(LITERAL_ESCAPE_ANCHOR_RE)) suppressed.add(`${anchor[1]}\0${escape}`);
+  }
+  if (suppressed.size === 0) return [...hints];
+  return hints.filter((hint) => {
+    const lost = UNICODE_LOST_DETAIL_RE.exec(hint);
+    return lost === null || !suppressed.has(`${lost[1]}\0${lost[2]}`);
+  });
+}
+
 function separatorLostHint(oldLines: string[], span: DiffSpan, originalHashes?: readonly string[]): string | undefined {
   if (span.replacementCount !== 0 || span.end < span.start) return undefined;
   const beforeIndex = span.start - 1;

package/src/grep.ts

@@ -70,14 +70,6 @@ function regexSource(pattern: string, literal: boolean): string {
   return literal ? pattern.replace(/[.*+?^${}()|[\]\\]/g, "\\$&") : pattern;
 }
 
-function assertPattern(pattern: string, literal: boolean, ignoreCase: boolean): void {
-  try {
-    new RegExp(regexSource(pattern, literal), ignoreCase ? "ui" : "u");
-  } catch {
-    throw new Error(`[E_BAD_SHAPE] Invalid pattern: ${pattern}`);
-  }
-}
-
 interface RgMatchLine {
   line: number;
   start: number;
@@ -393,7 +385,7 @@ const grepToolSchema = Type.Object(
     limit: Type.Optional(
       Type.Integer({
         minimum: 1,
-        description: "Maximum number of matched lines to return",
+        description: "Maximum number of matched lines to return (default 100)",
       }),
     ),
   },
@@ -524,7 +516,6 @@ export function regGrep(pi: ExtensionAPI, flags: EditToolFlags = DEFAULT_EDIT_FL
           const globPath = toDisplayPath(globRoot, absPath);
           return globRegex.test(globPath) || globRegex.test(displayPath);
         };
-        assertPattern(req.pattern, req.literal === true, req.ignoreCase === true);
         const rgPath = await resolveRgPath();
         const hits: FileHit[] = [];
         let matches = 0;

package/src/hashline/alphabet.ts

@@ -1,16 +1,16 @@
 import anchorData from "./anchor-table.json";
 const rawAnchors: unknown = (anchorData as { anchors?: unknown }).anchors;
-if (typeof rawAnchors !== "string" || rawAnchors.length === 0 || rawAnchors.length % 4 !== 0) {
+if (typeof rawAnchors !== "string" || rawAnchors.length === 0 || rawAnchors.length % 5 !== 0) {
   throw new Error("[E_REGISTRY] Anchor table is missing or corrupt; reinstall pi-hashline-edit-pro.");
 }
 const TABLE: string = rawAnchors;
-export const HASH_LEN = 4;
+export const HASH_LEN = 5;
 export const ANCHOR_COUNT = TABLE.length / HASH_LEN;
 const LETTERS = "A-Za-z";
 
 export const ALPH_RE = new RegExp(`^[${LETTERS}]+$`);
 
-export const HASH_CLASS = `[${LETTERS}]{${HASH_LEN}}`;
+export const HASH_CLASS = `[a-z]{${HASH_LEN}}`;
 
 export const HASH_RUN = `[${LETTERS}]{${HASH_LEN},${HASH_LEN + 1}}`;