pi-hashline-edit-pro 0.13.3 → 0.13.4

package/README.md

@@ -1,8 +1,8 @@
 # pi-hashline-edit-pro
 
-A [pi-coding-agent](https://github.com/badlogic/pi-mono/tree/main/packages/coding-agent) extension that replaces the built-in `read` and `edit` tools with a hash-anchored line-replacing workflow. Strict semantics, no silent relocation, no autocorrection, no fuzzy fallback. 3-character content hashes over a 64-character URL-safe base64 alphabet give 18 bits of entropy per anchor, with perfect hashing (collision resolution) ensuring every line gets a unique anchor.
+A [pi-coding-agent](https://github.com/badlogic/pi-mono/tree/main/packages/coding-agent) extension that replaces the built-in `read` and `edit` tools with a hash-anchored line-replacing workflow. Strict semantics, no silent relocation, no autocorrection, no fuzzy fallback. Every line gets a unique content hash, so edits stay precise and stale anchors are caught before they reach the file.
 
-Fork of [pi-hashline-edit](https://github.com/RimuruW/pi-hashline-edit) by RimuruW. The strict-semantics policy is unchanged. This fork extends the upstream design in two ways: a 3-character hash length with a 64-character alphabet for more entropy, and perfect hashing (collision resolution) that ensures every line in a file gets a unique anchor.
+Fork of [pi-hashline-edit](https://github.com/RimuruW/pi-hashline-edit) by RimuruW. The strict-semantics policy is unchanged. This fork extends the upstream design with 3-character hashes and collision resolution for unique per-line anchors.
 
 Every line returned by `read` carries a short content hash. Edits reference those hashes instead of raw text, so the tool can detect stale context and reject outdated changes before they reach the file.
 
@@ -12,8 +12,8 @@ The original uses 2-character hashes of a 16-character alphabet, with the hash b
 
 This fork makes two changes that compound:
 
-1. **Bump hash length to 3 characters** of the 64-char URL-safe base64 alphabet. That gives 18 bits / 262,144 buckets, up from 8 bits / 256 in the upstream.
-2. **Perfect hashing (collision resolution).** When computing hashes for a file, if a line's base hash collides with an already-assigned hash, the hash is incremented (using a retry counter: `:R{retry}`) until a unique hash is found. This ensures every line in a file gets a unique anchor, even with the shorter 3-character hash space. Two byte-identical lines (e.g. repeated `import` statements, repeated `}`) get different hashes automatically.
+1. **3-character hash length** over a 64-char URL-safe base64 alphabet (up from 2 characters in the upstream), expanding the hash space from 256 to 262,144 buckets.
+2. **Perfect hashing (collision resolution).** When computing hashes for a file, if a line's base hash collides with an already-assigned hash, the hash is incremented (using a retry counter: `:R{retry}`) until a unique hash is found. This ensures every line gets a unique anchor, even within a 3-character hash space. Two byte-identical lines (e.g. repeated `}` or repeated `import` statements) get different hashes automatically.
 
 ## Installation
 
@@ -49,7 +49,7 @@ szJ│  console.log("world");
 _zl│}
 ```
 
-- `HASH` is a 3-character content hash from the URL-safe base64 alphabet `A-Za-z0-9-_` (e.g. `aB3`).
+- `HASH` is a 3-character content hash from the URL-safe base64 alphabet `A-Za-z0-9-_` (e.g. `aB3`). See [Hashing](#hashing) for details.
 
 Optional parameters:
 
@@ -82,7 +82,7 @@ Replaces using the `HASH│content` anchors from `read` output to target lines p
 
 ### Chained edits
 
-After a successful replace, the response text is empty (warnings are still shown if present). To get fresh anchors for follow-up edits, call `read` on the file first. This avoids token overhead from re-displaying content the model already knows.
+After a successful replace, the response confirms with `Successfully replaced in {path}.` (warnings are still shown if present). To get fresh anchors for follow-up edits, call `read` on the file first. This avoids token overhead from re-displaying content the model already knows.
 
 ### Auto-read after write
 
@@ -122,7 +122,7 @@ The runtime always precomputes the full per-line hash array for a file via `line
 
 ### Bare-prefix detector
 
-With the `│` delimiter format, the bare-prefix detector regex `^\s*[A-Za-z0-9_\-]{3}│` is highly specific. It only matches lines starting with exactly 3 base64 chars and `│`. This eliminates false positives from common code patterns like `init:`, `data:`, `else:`, etc. The detector rejects edit lines matching this pattern with `[E_BARE_HASH_PREFIX]` to prevent the model from accidentally pasting hash anchors into file content.
+With the `│` delimiter format, the bare-prefix detector regex `^\s*[A-Za-z0-9_\-]{3}│` is highly specific. It only matches lines starting with a hash-like prefix. This eliminates false positives from common code patterns like `init:`, `data:`, `else:`, etc. The detector rejects edit lines matching this pattern with `[E_BARE_HASH_PREFIX]` to prevent the model from accidentally pasting hash anchors into file content.
 
 ## Development
 

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "pi-hashline-edit-pro",
-  "version": "0.13.3",
+  "version": "0.13.4",
   "description": "Strict hashline read/replace tool for pi-coding-agent with hash-anchored edits (3-char, 18-bit, perfect hashing)",
   "main": "index.ts",
   "repository": {

package/src/hashline/apply.ts

@@ -92,11 +92,13 @@ function resToSpan(
     return null;
   }
 
+  const label = descEdit(edit);
+
   if (edit.content_lines.length > 0) {
     return {
       kind: "replace",
       index,
-      label: descEdit(edit),
+      label,
       start: lineStarts[startLine - 1]!,
       end: lineStarts[endLine - 1]! + fileLines[endLine - 1]!.length,
       replacement: edit.content_lines.join("\n"),
@@ -107,7 +109,7 @@ function resToSpan(
     return {
       kind: "replace",
       index,
-      label: descEdit(edit),
+      label,
       start: 0,
       end: content.length,
       replacement: "",
@@ -118,7 +120,7 @@ function resToSpan(
     return {
       kind: "replace",
       index,
-      label: descEdit(edit),
+      label,
       start: lineStarts[startLine - 1]!,
       end: lineStarts[endLine]!,
       replacement: "",
@@ -128,7 +130,7 @@ function resToSpan(
   return {
     kind: "replace",
     index,
-    label: descEdit(edit),
+    label,
     start: Math.max(0, lineStarts[startLine - 1]! - 1),
     end: lineStarts[endLine - 1]! + fileLines[endLine - 1]!.length,
     replacement: "",

package/src/replace-normalize.ts

@@ -27,6 +27,32 @@ function coerceEditArray(items: unknown[]): unknown[] {
     });
 }
 
+/**
+ * Normalizes a field from `from` to `to`: JSON-string arrays → real arrays,
+ * single objects → wrapped in array. Shared by the `changes` and `edits`
+ * normalization branches.
+ */
+function normalizeField(
+  record: Record<string, unknown>,
+  from: string,
+  to: string,
+): void {
+  if (!has(record, from)) return;
+  const raw = tryParseJSON(record[from], Array.isArray) ?? record[from];
+  if (Array.isArray(raw)) {
+    record[to] = coerceEditArray(raw);
+  } else {
+    const single =
+      typeof raw === "string"
+        ? tryParseJSON(raw, isRec)
+        : isRec(raw)
+          ? raw
+          : undefined;
+    if (single) record[to] = coerceEditArray([single]);
+  }
+  if (from !== to) delete record[from];
+}
+
 export function normReq(input: unknown): unknown {
   if (!isRec(input)) {
     return input;
@@ -39,32 +65,8 @@ export function normReq(input: unknown): unknown {
     delete record.file_path;
   }
 
-  const hasChangesField = has(record, "changes");
-  const hasEditsField = has(record, "edits");
-
-if (hasChangesField) {
-    const raw = tryParseJSON(record.changes, Array.isArray) ?? record.changes;
-    if (Array.isArray(raw)) {
-        record.changes = coerceEditArray(raw);
-    } else {
-        // Single object (JSON string or literal) → wrap in array
-        const single = typeof raw === "string"
-            ? tryParseJSON(raw, isRec)
-            : isRec(raw) ? raw : undefined;
-        if (single) record.changes = coerceEditArray([single]);
-    }
-} else if (hasEditsField) {
-    const raw = tryParseJSON(record.edits, Array.isArray) ?? record.edits;
-    if (Array.isArray(raw)) {
-        record.changes = coerceEditArray(raw);
-    } else {
-        const single = typeof raw === "string"
-            ? tryParseJSON(raw, isRec)
-            : isRec(raw) ? raw : undefined;
-        if (single) record.changes = coerceEditArray([single]);
-    }
-    delete record.edits;
-}
+  normalizeField(record, "changes", "changes");
+  normalizeField(record, "edits", "changes");
 
   return record;
 }

package/src/replace-response.ts

@@ -142,7 +142,7 @@ export function buildNoop(input: NoopInput): TResult {
 }
 
 export function buildChanged(input: SuccessInput): TResult {
-	const { result, warnings, snapshotId, originalNormalized, editMeta } = input;
+	const { path, result, warnings, snapshotId, originalNormalized, editMeta } = input;
 
 	const resultLines = visLines(result);
 	const resultHashes = input.resultHashes ?? lineHashes(result);
@@ -150,9 +150,12 @@ export function buildChanged(input: SuccessInput): TResult {
 	const addedLines = cntDiff(diffResult.diff, "+");
 	const removedLines = cntDiff(diffResult.diff, "-");
 	const warningsBlock = warnBlock(warnings);
+	const successPrefix = `Successfully replaced in ${path}.`;
 	const text = resultLines.length === 0
 		? "File is empty. Use replace to insert content."
-		: warningsBlock.trimStart();
+		: warningsBlock
+			? `${successPrefix}${warningsBlock}`
+			: successPrefix;
 
 	const metrics = buildM({
 		classification: "applied",