@wrongstack/tools 0.283.1 → 0.284.1

package/dist/edit.js

@@ -1,26 +1,316 @@
 import * as fs from 'node:fs/promises';
 import * as Core from '@wrongstack/core';
 import { ToolValidationError, detectNewlineStyle, normalizeToLf, toStyle, atomicWrite, unifiedDiff } from '@wrongstack/core';
-import * as path from 'node:path';
+import * as path2 from 'node:path';
+import { createHash } from 'node:crypto';
 
 // src/edit.ts
+
+// src/_edit-match.ts
+var TIER_LABEL = {
+  exact: "exact match",
+  "trailing-whitespace": "whitespace-normalized match (trailing whitespace ignored)",
+  "whitespace-normalized": "whitespace-normalized match (indentation ignored, replacement re-indented)",
+  fuzzy: "fuzzy match (block anchors exact, interior \u226590% similar)"
+};
+var TIER_CONFIDENCE = {
+  exact: "exact",
+  "trailing-whitespace": "high",
+  "whitespace-normalized": "medium",
+  fuzzy: "low"
+};
+var MIN_NORMALIZED_NEEDLE_CHARS = 16;
+var FUZZY_MIN_SIMILARITY = 0.9;
+var FUZZY_AMBIGUITY_MARGIN = 0.05;
+var FUZZY_MAX_INTERIOR_CHARS = 2e3;
+function findLadderMatches(fileLf, oldLf) {
+  const exact = [];
+  let idx = fileLf.indexOf(oldLf);
+  while (idx !== -1) {
+    exact.push({ start: idx, end: idx + oldLf.length, startLine: lineAt(fileLf, idx) });
+    idx = fileLf.indexOf(oldLf, idx + 1);
+  }
+  if (exact.length > 0) return { tier: "exact", matches: exact };
+  const fileLines = fileLf.split("\n");
+  const needleLines = oldLf.split("\n");
+  if (needleLines.length > fileLines.length) return void 0;
+  const offsets = lineOffsets(fileLines);
+  const trailing = windowScan(
+    fileLines,
+    needleLines,
+    offsets,
+    (a, b) => a.trimEnd() === b.trimEnd()
+  );
+  if (trailing.length > 0) return { tier: "trailing-whitespace", matches: trailing };
+  const normalizedLen = needleLines.reduce((n, l) => n + l.trim().length, 0);
+  if (normalizedLen < MIN_NORMALIZED_NEEDLE_CHARS) return void 0;
+  const normalized = windowScan(fileLines, needleLines, offsets, (a, b) => a.trim() === b.trim());
+  if (normalized.length > 0) return { tier: "whitespace-normalized", matches: normalized };
+  return fuzzyScan(fileLines, needleLines, offsets);
+}
+function lineAt(text, pos) {
+  let line = 1;
+  for (let i = 0; i < pos; i++) {
+    if (text.charCodeAt(i) === 10) line++;
+  }
+  return line;
+}
+function lineOffsets(lines) {
+  const out = new Array(lines.length);
+  let pos = 0;
+  for (let i = 0; i < lines.length; i++) {
+    out[i] = pos;
+    pos += lines[i].length + 1;
+  }
+  return out;
+}
+function windowToMatch(fileLines, offsets, start, windowLen) {
+  const lastLine = start + windowLen - 1;
+  return {
+    start: offsets[start],
+    end: offsets[lastLine] + fileLines[lastLine].length,
+    startLine: start + 1
+  };
+}
+function windowScan(fileLines, needleLines, offsets, eq) {
+  const n = needleLines.length;
+  const out = [];
+  for (let i = 0; i + n <= fileLines.length; i++) {
+    let all = true;
+    for (let j = 0; j < n; j++) {
+      if (!eq(fileLines[i + j], needleLines[j])) {
+        all = false;
+        break;
+      }
+    }
+    if (all) {
+      out.push(windowToMatch(fileLines, offsets, i, n));
+      i += n - 1;
+    }
+  }
+  return out;
+}
+function fuzzyScan(fileLines, needleLines, offsets) {
+  const n = needleLines.length;
+  if (n < 3) return void 0;
+  const firstNeedle = needleLines[0].trim();
+  const lastNeedle = needleLines[n - 1].trim();
+  const needleInterior = needleLines.slice(1, -1).map((l) => l.trim()).join("\n");
+  if (needleInterior.length > FUZZY_MAX_INTERIOR_CHARS) return void 0;
+  const candidates = [];
+  for (let i = 0; i + n <= fileLines.length; i++) {
+    if (fileLines[i].trim() !== firstNeedle) continue;
+    if (fileLines[i + n - 1].trim() !== lastNeedle) continue;
+    const windowInterior = fileLines.slice(i + 1, i + n - 1).map((l) => l.trim()).join("\n");
+    if (windowInterior.length > FUZZY_MAX_INTERIOR_CHARS) continue;
+    const score = similarity(needleInterior, windowInterior);
+    if (score >= FUZZY_MIN_SIMILARITY) {
+      candidates.push({ match: windowToMatch(fileLines, offsets, i, n), score });
+    }
+  }
+  if (candidates.length === 0) return void 0;
+  candidates.sort((a, b) => b.score - a.score);
+  const best = candidates[0];
+  const runnerUp = candidates[1];
+  if (runnerUp && best.score - runnerUp.score < FUZZY_AMBIGUITY_MARGIN) {
+    return {
+      tier: "fuzzy",
+      matches: candidates.map((c) => c.match),
+      score: best.score,
+      ambiguous: true
+    };
+  }
+  return { tier: "fuzzy", matches: [best.match], score: best.score };
+}
+function similarity(a, b) {
+  if (a === b) return 1;
+  const max = Math.max(a.length, b.length);
+  if (max === 0) return 1;
+  if (Math.abs(a.length - b.length) / max > 1 - FUZZY_MIN_SIMILARITY + 0.05) {
+    return 1 - Math.abs(a.length - b.length) / max;
+  }
+  return 1 - levenshtein(a, b) / max;
+}
+function levenshtein(a, b) {
+  if (a.length === 0) return b.length;
+  if (b.length === 0) return a.length;
+  let prev = new Array(b.length + 1);
+  let cur = new Array(b.length + 1);
+  for (let j = 0; j <= b.length; j++) prev[j] = j;
+  for (let i = 1; i <= a.length; i++) {
+    cur[0] = i;
+    const ca = a.charCodeAt(i - 1);
+    for (let j = 1; j <= b.length; j++) {
+      const cost = ca === b.charCodeAt(j - 1) ? 0 : 1;
+      cur[j] = Math.min(
+        prev[j] + 1,
+        cur[j - 1] + 1,
+        prev[j - 1] + cost
+      );
+    }
+    [prev, cur] = [cur, prev];
+  }
+  return prev[b.length];
+}
+function firstLineIndent(text) {
+  for (const line of text.split("\n")) {
+    if (line.trim() === "") continue;
+    return /^[ \t]*/.exec(line)[0];
+  }
+  return "";
+}
+function adjustIndent(newLf, fromIndent, toIndent) {
+  if (fromIndent === toIndent) return { text: newLf, adjusted: false };
+  const lines = newLf.split("\n");
+  if (toIndent.startsWith(fromIndent)) {
+    const extra = toIndent.slice(fromIndent.length);
+    return {
+      text: lines.map((l) => l.trim() === "" ? l : extra + l).join("\n"),
+      adjusted: true
+    };
+  }
+  if (fromIndent.startsWith(toIndent)) {
+    const remove = fromIndent.slice(toIndent.length);
+    return {
+      text: lines.map((l) => l.startsWith(remove) ? l.slice(remove.length) : l).join("\n"),
+      adjusted: true
+    };
+  }
+  return { text: newLf, adjusted: false };
+}
+function nearestMatchHint(fileLf, oldLf) {
+  const fileLines = fileLf.split("\n");
+  const needleLines = oldLf.split("\n");
+  if (needleLines.length > fileLines.length) return void 0;
+  const needleTrimmed = needleLines.map((l) => l.trim());
+  let bestScore = 0;
+  let bestStart = -1;
+  for (let i = 0; i + needleLines.length <= fileLines.length; i++) {
+    let sum = 0;
+    for (let j = 0; j < needleLines.length; j++) {
+      sum += prefixSimilarity(needleTrimmed[j], fileLines[i + j].trim());
+    }
+    const score = sum / needleLines.length;
+    if (score > bestScore) {
+      bestScore = score;
+      bestStart = i;
+    }
+  }
+  if (bestStart === -1 || bestScore < 0.5) return void 0;
+  const snippet = fileLines.slice(bestStart, bestStart + Math.min(3, needleLines.length)).map((l) => l.length > 120 ? `${l.slice(0, 120)}\u2026` : l).join("\n");
+  return { line: bestStart + 1, snippet };
+}
+function prefixSimilarity(a, b) {
+  if (a === b) return 1;
+  const max = Math.max(a.length, b.length);
+  if (max === 0) return 1;
+  let p = 0;
+  const lim = Math.min(a.length, b.length);
+  while (p < lim && a.charCodeAt(p) === b.charCodeAt(p)) p++;
+  return p / max;
+}
+var TS_LIKE = /* @__PURE__ */ new Set([".ts", ".tsx", ".mts", ".cts", ".js", ".jsx", ".mjs", ".cjs"]);
+var MAX_CHECK_CHARS = 15e5;
+var MAX_ERRORS = 5;
+var tsLoad = null;
+function loadTypescript() {
+  tsLoad ??= import('typescript').then(
+    (m) => m.default ?? m,
+    () => null
+  );
+  return tsLoad;
+}
+async function checkSyntax(filePath, content, previousContent) {
+  const errors = await parseErrors(filePath, content);
+  if (errors === void 0) return void 0;
+  if (errors.length === 0) return { errors, preExisting: false };
+  let preExisting = false;
+  if (previousContent !== void 0) {
+    const prevErrors = await parseErrors(filePath, previousContent);
+    preExisting = prevErrors !== void 0 && prevErrors.length > 0;
+  }
+  return { errors, preExisting };
+}
+function isJsoncFile(filePath) {
+  const base = path2.basename(filePath).toLowerCase();
+  if (base.endsWith(".jsonc")) return true;
+  if (/^(tsconfig|jsconfig)([.-].*)?\.json$/.test(base)) return true;
+  const dir = path2.basename(path2.dirname(filePath)).toLowerCase();
+  return dir === ".vscode";
+}
+async function parseErrors(filePath, content) {
+  if (content.length > MAX_CHECK_CHARS) return void 0;
+  const ext = path2.extname(filePath).toLowerCase();
+  if (ext === ".json" || ext === ".jsonc") {
+    try {
+      JSON.parse(content);
+      return [];
+    } catch (err) {
+      if (isJsoncFile(filePath)) {
+        const ts2 = await loadTypescript();
+        if (ts2) {
+          const jsonc = ts2.parseConfigFileTextToJson(filePath, content);
+          if (!jsonc.error) return [];
+          return [formatDiag(ts2, jsonc.error, content)];
+        }
+      }
+      return [`JSON parse error: ${err.message}`];
+    }
+  }
+  if (!TS_LIKE.has(ext)) return void 0;
+  const ts = await loadTypescript();
+  if (!ts) return void 0;
+  const scriptKind = ext === ".tsx" ? ts.ScriptKind.TSX : ext === ".ts" || ext === ".mts" || ext === ".cts" ? ts.ScriptKind.TS : (
+    // Plain JS may legitimately contain JSX; the JSX grammar is a
+    // superset for untyped code, so parsing .js/.jsx as JSX avoids
+    // false positives on React files.
+    ts.ScriptKind.JSX
+  );
+  const sourceFile = ts.createSourceFile(
+    path2.basename(filePath),
+    content,
+    ts.ScriptTarget.Latest,
+    /* setParentNodes */
+    false,
+    scriptKind
+  );
+  const diags = sourceFile.parseDiagnostics ?? [];
+  return diags.slice(0, MAX_ERRORS).map((d) => formatDiag(ts, d, content, sourceFile));
+}
+function formatDiag(ts, diag, content, sourceFile) {
+  const message = ts.flattenDiagnosticMessageText(diag.messageText, " ");
+  if (diag.start === void 0) return message;
+  let line;
+  if (sourceFile) {
+    line = sourceFile.getLineAndCharacterOfPosition(diag.start).line + 1;
+  } else {
+    line = 1;
+    for (let i = 0; i < diag.start && i < content.length; i++) {
+      if (content.charCodeAt(i) === 10) line++;
+    }
+  }
+  return `line ${line}: ${message}`;
+}
+function sha256hex(content) {
+  return createHash("sha256").update(content, "utf8").digest("hex");
+}
 function resolvePath(input, ctx) {
-  return path.isAbsolute(input) ? path.normalize(input) : path.resolve(ctx.workingDir ?? ctx.cwd, input);
+  return path2.isAbsolute(input) ? path2.normalize(input) : path2.resolve(ctx.workingDir ?? ctx.cwd, input);
 }
 function allowedRoots(ctx) {
-  return [path.resolve(ctx.projectRoot), path.resolve(Core.wstackGlobalRoot())];
+  return [path2.resolve(ctx.projectRoot), path2.resolve(Core.wstackGlobalRoot())];
 }
 function isInsideAny(target, roots) {
   return roots.some((root) => {
-    const rel = path.relative(root, target);
-    return rel === "" || !rel.startsWith("..") && !path.isAbsolute(rel);
+    const rel = path2.relative(root, target);
+    return rel === "" || !rel.startsWith("..") && !path2.isAbsolute(rel);
   });
 }
 function ensureInsideRoot(absPath, ctx) {
-  const target = path.resolve(absPath);
+  const target = path2.resolve(absPath);
   if (ctx.allowOutsideProjectRoot) return target;
   if (isInsideAny(target, allowedRoots(ctx))) return target;
-  throw new Error(`Path "${absPath}" is outside project root "${path.resolve(ctx.projectRoot)}"`);
+  throw new Error(`Path "${absPath}" is outside project root "${path2.resolve(ctx.projectRoot)}"`);
 }
 function safeResolve(input, ctx) {
   return ensureInsideRoot(resolvePath(input, ctx), ctx);
@@ -28,7 +318,7 @@ function safeResolve(input, ctx) {
 async function assertRealInsideRoot(absPath, ctx) {
   if (ctx.allowOutsideProjectRoot) return;
   const realRoots = await Promise.all(
-    allowedRoots(ctx).map((r) => fs.realpath(r).catch(() => path.resolve(r)))
+    allowedRoots(ctx).map((r) => fs.realpath(r).catch(() => path2.resolve(r)))
   );
   let probe = absPath;
   for (; ; ) {
@@ -37,7 +327,7 @@ async function assertRealInsideRoot(absPath, ctx) {
       real = await fs.realpath(probe);
     } catch (err) {
       if (err.code === "ENOENT") {
-        const parent = path.dirname(probe);
+        const parent = path2.dirname(probe);
         if (parent === probe) return;
         probe = parent;
         continue;
@@ -61,7 +351,11 @@ var editTool = {
   name: "edit",
   category: "Filesystem",
   description: "Perform a precise, surgical text replacement in a file. This is the preferred tool for modifying existing code. It works best after a prior `read`, but can auto-read the current file when the replacement is still unambiguous. Fails safely if the `old_string` appears more than once unless `replace_all` is set.",
-  usageHint: "RECOMMENDED WORKFLOW:\n1. Prefer calling `read` on the target file first when planning an edit.\n2. Use a sufficiently unique `old_string` (include surrounding lines/context if needed).\n3. If the string appears multiple times and you want to change all of them, set `replace_all: true`.\n4. `new_string` must be the exact replacement text.\n\nIf no prior read is recorded, the tool auto-reads the current file and only applies the edit after the same ambiguity checks pass.",
+  usageHint: "RECOMMENDED WORKFLOW:\n1. Prefer calling `read` on the target file first when planning an edit.\n2. Use a sufficiently unique `old_string` (include surrounding lines/context if needed).\n3. If the string appears multiple times and you want to change all of them, set `replace_all: true`.\n4. `new_string` must be the exact replacement text.\n\nIf no prior read is recorded, the tool auto-reads the current file and only applies the edit after the same ambiguity checks pass.\nIf `old_string` differs from the file only in whitespace (trailing spaces, indentation), a lower-confidence fallback match is applied and reported in `matched_by`/`note` \u2014 always verify the diff when this happens.\nAfter the edit, TS/JS/JSON files are syntax-checked; if `syntax_errors` is present in the output, fix those errors immediately with a follow-up edit.",
+  selection: {
+    doNotUseWhen: "creating a new file, replacing the whole file, or applying an existing unified diff.",
+    useInstead: ["write", "patch"]
+  },
   permission: "confirm",
   mutating: true,
   capabilities: ["fs.write"],
@@ -77,7 +371,7 @@ var editTool = {
     },
     required: ["path", "old_string", "new_string"]
   },
-  async execute(input, ctx) {
+  async execute(input, ctx, opts) {
     if (!input?.path) {
       throw new ToolValidationError({ message: "edit: path is required", field: "path" });
     }
@@ -120,13 +414,25 @@ var editTool = {
     const original = await fs.readFile(absPath, "utf8");
     const updated = await fs.stat(absPath);
     const mtimeTolerance = process.platform === "win32" ? 2e3 : 1;
-    const lastReadMtime = ctx.lastReadMtime(absPath);
-    if (lastReadMtime !== void 0 && updated.mtimeMs > lastReadMtime + mtimeTolerance) {
-      throw new ToolValidationError({
-        message: `edit: file "${input.path}" was modified externally. Re-read it first.`,
-        field: "path",
-        context: { reason: "external_modification" }
-      });
+    const originalHash = sha256hex(original);
+    const lastReadHash = ctx.lastReadHash?.(absPath);
+    if (lastReadHash !== void 0) {
+      if (lastReadHash !== originalHash) {
+        throw new ToolValidationError({
+          message: `edit: file "${input.path}" was modified externally. Re-read it first.`,
+          field: "path",
+          context: { reason: "external_modification" }
+        });
+      }
+    } else {
+      const lastReadMtime = ctx.lastReadMtime(absPath);
+      if (lastReadMtime !== void 0 && updated.mtimeMs > lastReadMtime + mtimeTolerance) {
+        throw new ToolValidationError({
+          message: `edit: file "${input.path}" was modified externally. Re-read it first.`,
+          field: "path",
+          context: { reason: "external_modification" }
+        });
+      }
     }
     if (autoRead && updated.mtimeMs > stat2.mtimeMs + mtimeTolerance) {
       throw new ToolValidationError({
@@ -141,42 +447,78 @@ var editTool = {
     const oldLf = normalizeToLf(input.old_string);
     const newLf = normalizeToLf(input.new_string);
     if (oldLf === newLf) {
-      if (autoRead) ctx.recordRead(absPath, updated.mtimeMs);
+      if (autoRead) ctx.recordRead(absPath, updated.mtimeMs, "user", originalHash);
       return {
         path: absPath,
         replacements: 0,
         diff: "(no-op: old and new are identical)",
+        matched_by: "exact",
         note: autoReadNote
       };
     }
-    let count = 0;
-    let idx = fileLf.indexOf(oldLf);
-    const matches = [];
-    while (idx !== -1) {
-      matches.push(idx);
-      count++;
-      idx = fileLf.indexOf(oldLf, idx + 1);
-    }
-    if (count === 0) {
-      const hint = findSimilarity(fileLf, oldLf);
+    const ladder = findLadderMatches(fileLf, oldLf);
+    if (!ladder) {
+      const hint = nearestMatchHint(fileLf, oldLf);
       throw new ToolValidationError({
-        message: `edit: no match for old_string in "${input.path}".${hint ? ` Nearest match near line ${hint}.` : ""}`,
+        message: `edit: no match for old_string in "${input.path}".${hint ? ` Nearest match near line ${hint.line}:
+${hint.snippet}
+Compare this against your old_string and retry with the file's actual text.` : ""}`,
         field: "old_string"
       });
     }
+    const { tier, matches } = ladder;
+    const count = matches.length;
+    if (ladder.ambiguous) {
+      const lines = matches.map((m) => m.startLine);
+      throw new ToolValidationError({
+        message: `edit: old_string only matched fuzzily and ${count} candidate blocks scored too close to distinguish (lines: ${lines.join(", ")}) in "${input.path}". Re-read the file and use the exact text of the intended block.`,
+        field: "old_string",
+        context: { occurrences: count, matchTier: tier }
+      });
+    }
+    if (input.replace_all && tier !== "exact" && tier !== "trailing-whitespace") {
+      throw new ToolValidationError({
+        message: `edit: old_string only matched via ${TIER_LABEL[tier]} in "${input.path}", but replace_all requires an exact (or trailing-whitespace) match. Re-read the file and use its exact text.`,
+        field: "old_string",
+        context: { matchTier: tier }
+      });
+    }
     if (count > 1 && !input.replace_all) {
-      const lines = lineNumbersFor(fileLf, matches);
+      const lines = matches.map((m) => m.startLine);
       throw new ToolValidationError({
-        message: `edit: old_string matched ${count} times in "${input.path}" (lines: ${lines.join(", ")}). Add more context to make it unique, or set replace_all: true.`,
+        message: `edit: old_string matched ${count} times in "${input.path}" (lines: ${lines.join(", ")})${tier === "exact" ? "" : ` via ${TIER_LABEL[tier]}`}. Add more context to make it unique, or set replace_all: true.`,
         field: "old_string",
-        context: { occurrences: count }
+        context: { occurrences: count, matchTier: tier }
       });
     }
-    const newFileLf = input.replace_all ? fileLf.split(oldLf).join(newLf) : fileLf.replace(oldLf, newLf);
+    let newFileLf;
+    let tierNote;
+    if (tier === "exact") {
+      newFileLf = input.replace_all ? fileLf.split(oldLf).join(newLf) : fileLf.replace(oldLf, newLf);
+    } else {
+      let replacement = newLf;
+      let indentSuffix = "";
+      if (tier === "whitespace-normalized" || tier === "fuzzy") {
+        const first = matches[0];
+        const matchedText = fileLf.slice(first.start, first.end);
+        const adjusted = adjustIndent(newLf, firstLineIndent(oldLf), firstLineIndent(matchedText));
+        replacement = adjusted.text;
+        if (adjusted.adjusted) indentSuffix = "; replacement re-indented to match the file";
+      }
+      newFileLf = fileLf;
+      const applied = input.replace_all ? matches : matches.slice(0, 1);
+      for (let i = applied.length - 1; i >= 0; i--) {
+        const m = applied[i];
+        newFileLf = newFileLf.slice(0, m.start) + replacement + newFileLf.slice(m.end);
+      }
+      const scoreSuffix = ladder.score !== void 0 ? `, similarity ${(ladder.score * 100).toFixed(1)}%` : "";
+      tierNote = `old_string did not match exactly; applied via ${TIER_LABEL[tier]} at line ${matches[0].startLine} (confidence: ${TIER_CONFIDENCE[tier]}${scoreSuffix}${indentSuffix}). Review the diff to confirm the intended target was edited.`;
+    }
     const newFile = toStyle(newFileLf, style);
+    opts?.signal?.throwIfAborted();
     await atomicWrite(absPath, newFile, { mode: updated.mode & 511 });
     const written = await fs.stat(absPath);
-    ctx.recordRead(absPath, written.mtimeMs, "write");
+    ctx.recordRead(absPath, written.mtimeMs, "write", sha256hex(newFile));
     ctx.session.recordFileChange({
       path: absPath,
       action: "modified",
@@ -187,38 +529,22 @@ var editTool = {
       fromFile: input.path,
       toFile: input.path
     });
+    const syntax = await checkSyntax(absPath, newFile, original).catch(() => void 0);
+    let syntaxNote;
+    if (syntax && syntax.errors.length > 0) {
+      syntaxNote = syntax.preExisting ? `Syntax check: the file still has parse errors (they pre-date this edit) \u2014 see syntax_errors.` : `Syntax check: this edit introduced ${syntax.errors.length} parse error(s) \u2014 fix them now, see syntax_errors.`;
+    }
+    const notes = [autoReadNote, tierNote, syntaxNote].filter(Boolean);
     return {
       path: absPath,
       replacements: input.replace_all ? count : 1,
       diff,
-      note: autoReadNote
+      matched_by: tier,
+      syntax_errors: syntax && syntax.errors.length > 0 ? syntax.errors : void 0,
+      note: notes.length > 0 ? notes.join("\n") : void 0
     };
   }
 };
-function lineNumbersFor(text, indices) {
-  const out = [];
-  let pos = 0;
-  let line = 1;
-  for (const target of indices) {
-    while (pos < target) {
-      if (text.charCodeAt(pos) === 10) line++;
-      pos++;
-    }
-    out.push(line);
-  }
-  return out;
-}
-function findSimilarity(haystack, needle) {
-  if (needle.length < 20) return void 0;
-  const probe = needle.slice(0, Math.min(40, needle.length));
-  const idx = haystack.indexOf(probe);
-  if (idx === -1) return void 0;
-  let line = 1;
-  for (let i = 0; i < idx; i++) {
-    if (haystack.charCodeAt(i) === 10) line++;
-  }
-  return line;
-}
 
 export { editTool };
 //# sourceMappingURL=edit.js.map