@flemist/mcp-project-tools 5.0.0 → 5.0.1

package/build/cli.js

@@ -1,5 +1,5 @@
 import { Command as a } from "commander";
-import { l as c, A as p, S as l, a as f, b as v, p as g, s as m } from "./startMcpServer-DSNoDm-K.js";
+import { l as c, A as p, S as l, a as f, b as v, p as g, s as m } from "./startMcpServer-eMtH4-uF.js";
 import * as s from "path";
 const E = {
   title: v,

package/build/index.d.ts

@@ -84,7 +84,7 @@ declare type ProcessManagerOptions = {
      * - "clear": start with empty env
      * - false: do nothing, inherit server env
      */
-    envCleanup?: 'clear' | 'replaceServerPaths' | 'deleteServerPaths' | false;
+    envCleanup?: null | 'clear' | 'replaceServerPaths' | 'deleteServerPaths' | false;
     run?: null | boolean;
     status?: null | boolean;
     wait?: null | boolean;

package/build/index.js

@@ -1,4 +1,4 @@
-import { s } from "./startMcpServer-DSNoDm-K.js";
+import { s } from "./startMcpServer-eMtH4-uF.js";
 export {
   s as startMcpServer
 };

package/build/{startMcpServer-DSNoDm-K.js → startMcpServer-eMtH4-uF.js}

@@ -98,7 +98,7 @@ function yr(t) {
 const Y = /* @__PURE__ */ new Map();
 let br = 0;
 const ke = 10, Sr = 1800 * 1e3, J = 1e4, Q = 2e3, xr = 5e3;
-function $r(t) {
+function Ir(t) {
   const { commandLine: r, commandLineRules: s } = t;
   let o = !1;
   for (const e of s)
@@ -115,7 +115,7 @@ function $r(t) {
       }
   return o;
 }
-function Ir() {
+function $r() {
   return ++br;
 }
 let Oe = !1;
@@ -278,15 +278,8 @@ function Dr(t, r) {
     return {
       error: "Session ID is required"
     };
-  const { from: o, toExclusive: e } = s.range;
-  if (e <= o)
-    return {
-      error: `Invalid range: to (${e}) must be greater than from (${o})`
-    };
-  if (e - o > J)
-    return {
-      error: `Range size ${e - o} exceeds maximum ${J}`
-    };
+  let { from: o, toExclusive: e } = s.range;
+  e <= o && (e = o), e - o > J && (e = o + J);
   const n = dt({
     sessionId: r.sessionId,
     outputId: s.outputId,
@@ -512,7 +505,7 @@ async function Ar(t, r, s) {
   if ("error" in l)
     return { error: l.error };
   const u = l.path;
-  if (!$r({ commandLine: e, commandLineRules: c })) {
+  if (!Ir({ commandLine: e, commandLineRules: c })) {
     const h = c.map(
       (g) => `${g.rule.toUpperCase()}: /${g.regexp}/ (${g.note})`
     ).join(`
@@ -530,7 +523,7 @@ To use this command line, ask the user to modify the command line rules in the c
     return {
       error: `Maximum concurrent process limit reached (${ke} processes). Cannot start new process until existing processes complete. Use process-list to see active processes, or process-kill to terminate unnecessary processes.`
     };
-  const d = Ir(), p = {
+  const d = $r(), p = {
     id: d,
     cwd: u,
     commandLine: e,
@@ -813,20 +806,20 @@ function xt(t) {
       countDirs: 0,
       countLinks: 0
     };
-    function w($, T) {
+    function w(I, T) {
       if (p(T.totalSize)) {
-        const S = `${T.totalSize.toLocaleString("en-US").replace(/,/g, " ").padStart(19)}: ${$}`;
+        const S = `${T.totalSize.toLocaleString("en-US").replace(/,/g, " ").padStart(19)}: ${I}`;
         l?.handleLog ? l.handleLog(S) : console.log(S);
       }
     }
-    async function M($, T, x, S) {
+    async function M(I, T, x, S) {
       return u ? await V({
         pool: n,
         func: async () => {
           try {
             return await u({
               level: s,
-              path: $,
+              path: I,
               stat: T,
               itemStat: x,
               totalStat: y,
@@ -841,18 +834,18 @@ function xt(t) {
         abortSignal: g
       }) : !0;
     }
-    async function E($, T, x, S) {
-      S || (S = $);
+    async function E(I, T, x, S) {
+      S || (S = I);
       const v = await V({
         pool: n,
-        func: () => j.promises.lstat($).catch(d),
+        func: () => j.promises.lstat(I).catch(d),
         count: 1,
         priority: X(T, X(1, a)),
         abortSignal: g
       });
       if (!v || !x && v.isFile())
         return null;
-      const P = Kr($, v);
+      const P = Kr(I, v);
       if (o.has(P))
         return null;
       o.add(P);
@@ -863,7 +856,7 @@ function xt(t) {
         countDirs: 0,
         countLinks: 0
       };
-      const I = X(
+      const $ = X(
         T,
         X(v.isDirectory() ? 2 : 3, a)
       );
@@ -871,9 +864,9 @@ function xt(t) {
         if (c) {
           const C = await V({
             pool: n,
-            func: () => j.promises.readlink($).catch(d).then((N) => N ?? null),
+            func: () => j.promises.readlink(I).catch(d).then((N) => N ?? null),
             count: 1,
-            priority: I,
+            priority: $,
             abortSignal: g
           });
           if (C) {
@@ -890,12 +883,12 @@ function xt(t) {
           S,
           v,
           O,
-          I
+          $
         ) && (Be(y, O), w(S, O))), O;
       } else if (v.isDirectory()) {
         const C = await V({
           pool: n,
-          func: () => j.promises.readdir($).catch(d),
+          func: () => j.promises.readdir(I).catch(d),
           count: 1,
           priority: a,
           abortSignal: g
@@ -907,7 +900,7 @@ function xt(t) {
             ...t,
             paths: C,
             abortSignal: g,
-            priority: I,
+            priority: $,
             level: s + 1,
             walkedIds: o
           });
@@ -917,18 +910,18 @@ function xt(t) {
         S,
         v,
         O,
-        I
+        $
       ) && (Be(y, O), w(S, O))), O;
     }
     const b = [];
-    for (let $ = 0, T = r.length; $ < T; $++) {
-      const x = Hr(r[$]), S = f ? f(x) : !0;
-      S !== !1 && b.push(E(x, $, S));
+    for (let I = 0, T = r.length; I < T; I++) {
+      const x = Hr(r[I]), S = f ? f(x) : !0;
+      S !== !1 && b.push(E(x, I, S));
     }
     return await Promise.all(b), y;
   });
 }
-function $t(t) {
+function It(t) {
   return xt(t);
 }
 function Yr(t, r) {
@@ -953,7 +946,7 @@ async function Zr(t) {
     e = e.trim(), !(!e || e.startsWith("#")) && o.push(e);
   }), o;
 }
-async function It(t) {
+async function $t(t) {
   const r = t.rootDir ?? ".", s = [];
   if (!t.globs?.length)
     return s;
@@ -1026,11 +1019,11 @@ function Mt({
 async function Xr(t) {
   const r = t.rootDir ?? ".", s = [], o = {};
   t.result.countFiles && (o.countFiles = 0), t.result.size && (o.size = 0);
-  const e = await It({
+  const e = await $t({
     rootDir: r,
     globs: t.globs
   });
-  return await $t({
+  return await It({
     paths: [r],
     walkLinks: !0,
     matchPath: Mt({
@@ -1169,7 +1162,7 @@ function ts(t, r) {
   }
   return e;
 }
-const rs = "5.0.0", ss = {
+const rs = "5.0.1", ss = {
   version: rs
 }, Wo = "Project Tools", Ko = "project-tools", Ho = ss.version, Qo = "d00f70240703039df14c76176a055bce6b5484d2b552ba2c89820f03b8e5e60d", qe = 25e3;
 function _e(t) {
@@ -1327,7 +1320,7 @@ async function os(t, r) {
       size: f.includes("size") || p.includes("size"),
       countFiles: f.includes("countFiles") || p.includes("countFiles")
     };
-    let b = null, $ = null;
+    let b = null, I = null;
     if (a || c)
       try {
         const S = Date.now(), v = c ? S - _e(c) : null, P = a ? S - _e(a) : null;
@@ -1340,7 +1333,7 @@ async function os(t, r) {
     if (l || u)
       try {
         const S = l ? Ge(l) : null, v = u ? Ge(u) : null;
-        $ = [S, v];
+        I = [S, v];
       } catch (S) {
         return {
           error: S instanceof Error ? S.message : "Unknown error parsing size filter"
@@ -1351,7 +1344,7 @@ async function os(t, r) {
       globs: M,
       result: E,
       dateModified: b,
-      totalSize: $
+      totalSize: I
     });
     return T.items.length > qe ? {
       error: `Number of paths (${T.items.length}) exceeds maximum allowed (${qe}). Consider using more specific glob patterns or filters to reduce the result set.`
@@ -1555,12 +1548,12 @@ async function Ct(t, r, s) {
           error: x instanceof Error ? x.message : "Unknown error parsing size filter"
         };
       }
-    const b = i ? i.includes("file") : !0, $ = i ? i.includes("dir") : !0, T = {
+    const b = i ? i.includes("file") : !0, I = i ? i.includes("dir") : !0, T = {
       name: e,
       rootDir: p,
       globs: w,
       matchFiles: b,
-      matchDirs: $,
+      matchDirs: I,
       dateModified: M,
       totalSize: E,
       fields: h
@@ -1677,11 +1670,11 @@ async function us(t) {
     size: 0
   };
   r.set(null, n);
-  const i = await It({
+  const i = await $t({
     rootDir: o,
     globs: t.globs
   });
-  return await $t({
+  return await It({
     paths: [o],
     walkLinks: !0,
     matchPath: Mt({
@@ -1696,12 +1689,12 @@ async function us(t) {
       const p = me(u || "."), h = f ? "dir" : "file", g = f ? null : c.mtimeMs, y = c.size;
       let w = !0;
       if (d && !t.matchFiles && (w = !1), f && !t.matchDirs && (w = !1), w && d && t.dateModified && g != null) {
-        const [$, T] = t.dateModified;
-        ($ != null && g < $ || T != null && g > T) && (w = !1);
+        const [I, T] = t.dateModified;
+        (I != null && g < I || T != null && g > T) && (w = !1);
       }
       if (w && d && t.totalSize && y != null) {
-        const [$, T] = t.totalSize;
-        ($ != null && y < $ || T != null && y > T) && (w = !1);
+        const [I, T] = t.totalSize;
+        (I != null && y < I || T != null && y > T) && (w = !1);
       }
       if (f && !w) {
         if (!(l.countFiles && l.countFiles > 0)) return !1;
@@ -1815,11 +1808,11 @@ function ms(t) {
     let l = 1, u, f = 0, d = 0, p = 0, h = 0, g = null, y, w, M;
     if (e)
       for (let b = 0; b < e.length; b++) {
-        const $ = e[b];
-        a += $.countMatched, l += $.countTotal, f += $.tokens, d += $.tokensTotal, p += $.size, h += $.countFiles, $.dateModified != null && (g == null || $.dateModified > g) && (g = $.dateModified);
+        const I = e[b];
+        a += I.countMatched, l += I.countTotal, f += I.tokens, d += I.tokensTotal, p += I.size, h += I.countFiles, I.dateModified != null && (g == null || I.dateModified > g) && (g = I.dateModified);
       }
     o ? (y = o.type, w = o.name, M = o.path, i = o.isMatched, i && (a += 1), o.type === "file" ? (p = o.size || 0, h = 1, g = o.dateModified || null) : o.dateModified != null && (g == null || o.dateModified > g) && (g = o.dateModified)) : (y = "dir", w = "<root>", M = ".", i = !0);
-    for (let b = 0, $ = r.length; b < $; b++) {
+    for (let b = 0, I = r.length; b < I; b++) {
       const T = r[b];
       switch (b > 0 && (n += " "), T) {
         case "dateModified":
@@ -2014,14 +2007,14 @@ function bs(t) {
     if (o != null && u + p.countChilds + g > o || e != null && f + p.tokensChilds + y > e) {
       const w = [];
       let M = null, E = 0;
-      for (let $ = 0, T = h.length; $ < T; $++) {
-        const x = h[$], S = E * a.tokens;
+      for (let I = 0, T = h.length; I < T; I++) {
+        const x = h[I], S = E * a.tokens;
         M != null && // Если общий лимит превышен, то не создаем новую группу, а продолжаем текущую. В случае достижения лимитов, последняя группа может содержать больше элементов, чем указано в лимитах группы, и это допустимо. Главное - дать в отчете полную картину.
-        !(o != null && u + 1 > o || e != null && f + a.tokens > e) && (n != null && M.countGrouped + 1 + E > n || i != null && M.tokensGrouped + x.tokens + S > i) && (w.push(M), u += 1, f += a.tokens, M = null, E = 0), M = a.add(M, x, $), x.countChilds > 0 && (E += 1);
+        !(o != null && u + 1 > o || e != null && f + a.tokens > e) && (n != null && M.countGrouped + 1 + E > n || i != null && M.tokensGrouped + x.tokens + S > i) && (w.push(M), u += 1, f += a.tokens, M = null, E = 0), M = a.add(M, x, I), x.countChilds > 0 && (E += 1);
       }
       M != null && (w.push(M), u += 1, f += a.tokens);
-      const b = w.map(($) => ({
-        text: a.getReportText($)
+      const b = w.map((I) => ({
+        text: a.getReportText(I)
       }));
       if (d != null) {
         if (d.childs != null)
@@ -2040,8 +2033,8 @@ function bs(t) {
           text: E.text
         };
         w.push(b);
-        const $ = s.getChilds(E);
-        $ != null && $.length > 0 && r.enqueue({
+        const I = s.getChilds(E);
+        I != null && I.length > 0 && r.enqueue({
           reportNode: b,
           node: E
         });
@@ -2076,11 +2069,9 @@ function kt(t) {
     a = r.root;
   let c, l = r.getChilds(a) ?? [];
   if (o != null) {
-    const [d, p] = o;
-    if (d < 0 || p <= d || p >= l.length)
-      throw new Error(
-        `Invalid index range: ${d}-${p} for root nodes length ${l.length}`
-      );
+    let [d, p] = o;
+    if (d < 0 && (d = 0), p < 0 && (p = 0), p >= l.length && (p = l.length - 1), p < d)
+      return [];
     const h = [];
     let g = null;
     for (let y = d; y <= p; y++) {
@@ -2240,7 +2231,7 @@ async function xs(t, r, s) {
     };
   }
 }
-function $s(t, r) {
+function Is(t, r) {
   t(
     "fs-snapshot-browse",
     {
@@ -2283,14 +2274,14 @@ function Dt(t) {
   return e(s.root), r;
 }
 const Ve = /* @__PURE__ */ new Map();
-function Is(t) {
+function $s(t) {
   const r = H(t);
   let s = Ve.get(r);
   return s == null && (s = new nr(), Ve.set(r, s)), s;
 }
 async function Ms(t) {
   const { filePath: r, func: s } = t;
-  return Is(r).lock(
+  return $s(r).lock(
     () => V({
       pool: Se,
       count: 1,
@@ -2307,13 +2298,13 @@ function Os(t) {
   let l = null, u = null, f = null, d = 0;
   if (o != null) {
     const b = o.length;
-    let $ = !1;
+    let I = !1;
     for (let T = 0; T < b; T++)
       if (o.charCodeAt(T) === de) {
-        $ = !0;
+        I = !0;
         break;
       }
-    if ($) {
+    if (I) {
       u = [], f = [];
       let T = 0, x = 0;
       for (; x < b; ) {
@@ -2332,18 +2323,18 @@ function Os(t) {
         else if (S === Cs)
           v = rt;
         else if (S >= re && S <= Xe) {
-          let I = x + 2;
-          for (; I < b; ) {
-            const C = o.charCodeAt(I);
+          let $ = x + 2;
+          for (; $ < b; ) {
+            const C = o.charCodeAt($);
             if (C < re || C > Xe) break;
-            I++;
+            $++;
           }
-          v = st, P = o.substring(x + 1, I), O = I - x;
+          v = st, P = o.substring(x + 1, $), O = $ - x;
         } else if (S === vs) {
-          let I = x + 2;
-          for (; I < b && o.charCodeAt(I) !== Es; )
-            I++;
-          I < b && I > x + 2 && (v = ks, P = o.substring(x + 2, I), O = I + 1 - x);
+          let $ = x + 2;
+          for (; $ < b && o.charCodeAt($) !== Es; )
+            $++;
+          $ < b && $ > x + 2 && (v = ks, P = o.substring(x + 2, $), O = $ + 1 - x);
         }
         v >= 0 ? (x > T && (u.push(se), f.push(o.substring(T, x))), u.push(v), f.push(P), x += O, T = x) : x++;
       }
@@ -2355,23 +2346,23 @@ function Os(t) {
   s.lastIndex = 0;
   let y;
   for (; (y = s.exec(r)) !== null; ) {
-    const b = y.index, $ = y[0], T = $.length, x = b + T;
+    const b = y.index, I = y[0], T = I.length, x = b + T;
     let S, v, P, O;
     if (i === 1)
       S = 0, v = 1, P = 0, O = e;
     else {
-      let I = 0, C = i - 1;
-      for (; I < C; ) {
-        const N = I + C + 1 >> 1;
-        n[N] <= b ? I = N : C = N - 1;
+      let $ = 0, C = i - 1;
+      for (; $ < C; ) {
+        const N = $ + C + 1 >> 1;
+        n[N] <= b ? $ = N : C = N - 1;
       }
-      if (S = I, T > 0) {
+      if (S = $, T > 0) {
         const N = x - 1;
-        for (C = i - 1; I < C; ) {
-          const R = I + C + 1 >> 1;
-          n[R] <= N ? I = R : C = R - 1;
+        for (C = i - 1; $ < C; ) {
+          const R = $ + C + 1 >> 1;
+          n[R] <= N ? $ = R : C = R - 1;
         }
-        v = I + 1;
+        v = $ + 1;
       } else
         v = S + 1;
       P = n[S], O = v < i ? n[v] : e;
@@ -2382,51 +2373,51 @@ function Os(t) {
       linesOffset: [P, O]
     }), o != null) {
       p += r.substring(h, b);
-      let I;
+      let $;
       if (l != null)
-        I = l;
+        $ = l;
       else {
-        I = "";
+        $ = "";
         const N = y.groups, R = y.length - 1;
         for (let K = 0; K < d; K++) {
           const q = u[K], L = f[K];
           switch (q) {
             case se:
-              I += L;
+              $ += L;
               break;
             case et:
-              I += $;
+              $ += I;
               break;
             case tt:
-              I += r.substring(0, b);
+              $ += r.substring(0, b);
               break;
             case rt:
-              I += r.substring(x);
+              $ += r.substring(x);
               break;
             case st: {
               const B = L, z = B.length, A = B.charCodeAt(0) - re;
               if (z >= 2) {
                 const _ = B.charCodeAt(1) - re, D = A * 10 + _;
                 if (D >= 1 && D <= R) {
-                  I += y[D] ?? "", z > 2 && (I += B.substring(2));
+                  $ += y[D] ?? "", z > 2 && ($ += B.substring(2));
                   break;
                 }
               }
-              A >= 1 && A <= R ? (I += y[A] ?? "", z > 1 && (I += B.substring(1))) : I += "$" + B;
+              A >= 1 && A <= R ? ($ += y[A] ?? "", z > 1 && ($ += B.substring(1))) : $ += "$" + B;
               break;
             }
             default:
-              N != null ? I += N[L] ?? "" : I += "$<" + L + ">";
+              N != null ? $ += N[L] ?? "" : $ += "$<" + L + ">";
           }
         }
       }
-      p += I;
+      p += $;
       const C = b + g;
       c.push({
-        offset: [C, C + I.length],
+        offset: [C, C + $.length],
         lines: [0, 0],
         linesOffset: [0, 0]
-      }), g += I.length - T, h = x;
+      }), g += $.length - T, h = x;
     }
     if (T === 0 && s.lastIndex++, !s.global)
       break;
@@ -2438,11 +2429,11 @@ function Os(t) {
   for (let b = 0; b < w; b++)
     p.charCodeAt(b) === Ze && b + 1 < w && M.push(b + 1);
   const E = M.length;
-  for (let b = 0, $ = c.length; b < $; b++) {
+  for (let b = 0, I = c.length; b < I; b++) {
     const T = c[b], x = T.offset[0], S = T.offset[1];
-    let v, P, O, I;
+    let v, P, O, $;
     if (E === 1)
-      v = 0, P = 1, O = 0, I = w;
+      v = 0, P = 1, O = 0, $ = w;
     else {
       let C = 0, N = E - 1;
       for (; C < N; ) {
@@ -2458,9 +2449,9 @@ function Os(t) {
         P = C + 1;
       } else
         P = v + 1;
-      O = M[v], I = P < E ? M[P] : w;
+      O = M[v], $ = P < E ? M[P] : w;
     }
-    T.lines[0] = v, T.lines[1] = P, T.linesOffset[0] = O, T.linesOffset[1] = I;
+    T.lines[0] = v, T.lines[1] = P, T.linesOffset[0] = O, T.linesOffset[1] = $;
   }
   return {
     search: { content: r, matches: a },
@@ -2515,26 +2506,26 @@ function Rs(t, r) {
     };
   }
   const s = t.replace ?? t.search, o = r.replace ?? r.search, e = t.search.content, n = o.content, i = e.length, a = n.length, c = t.search.matches, l = s.matches, u = r.search.matches, f = o.matches, d = l.length, p = u.length, h = [], g = [];
-  let y = 0, w = 0, M = 0, E = 0, b = 0, $ = 0, T = 0, x = 0, S = 0, v = 0, P = 0, O = 0, I = 0, C = 0, N = 0, R = 0, K = 0, q = 0, L = 0, B = 0, z = 0, A = 0, _ = 0, D = 0;
+  let y = 0, w = 0, M = 0, E = 0, b = 0, I = 0, T = 0, x = 0, S = 0, v = 0, P = 0, O = 0, $ = 0, C = 0, N = 0, R = 0, K = 0, q = 0, L = 0, B = 0, z = 0, A = 0, _ = 0, D = 0;
   for (; y < d || w < p; )
-    if (y < d && (b = l[y].offset[0], $ = l[y].offset[1]), w < p && (T = u[w].offset[0], x = u[w].offset[1]), y < d && w < p && b < x && T < $) {
-      K = b < T ? b : T, S = $ > x ? $ : x, P = y, O = w, y++, w++;
+    if (y < d && (b = l[y].offset[0], I = l[y].offset[1]), w < p && (T = u[w].offset[0], x = u[w].offset[1]), y < d && w < p && b < x && T < I) {
+      K = b < T ? b : T, S = I > x ? I : x, P = y, O = w, y++, w++;
       do {
         for (v = S; y < d && l[y].offset[0] < S; )
-          $ = l[y].offset[1], $ > S && (S = $), y++;
+          I = l[y].offset[1], I > S && (S = I), y++;
         for (; w < p && u[w].offset[0] < S; )
           x = u[w].offset[1], x > S && (S = x), w++;
       } while (S !== v);
-      I = 1 / 0, C = -1 / 0, q = K, L = M;
+      $ = 1 / 0, C = -1 / 0, q = K, L = M;
       for (let G = P; G < y; G++)
-        B = c[G].offset[0], z = c[G].offset[1], A = l[G].offset[0], _ = l[G].offset[1], q < A && (D = q + L, D < I && (I = D), D = A + L, D > C && (C = D)), B < I && (I = B), z > C && (C = z), L += z - B - _ + A, q = _;
-      q < S && (D = q + L, D < I && (I = D), D = S + L, D > C && (C = D)), M = L, N = 1 / 0, R = -1 / 0, q = K, L = E;
+        B = c[G].offset[0], z = c[G].offset[1], A = l[G].offset[0], _ = l[G].offset[1], q < A && (D = q + L, D < $ && ($ = D), D = A + L, D > C && (C = D)), B < $ && ($ = B), z > C && (C = z), L += z - B - _ + A, q = _;
+      q < S && (D = q + L, D < $ && ($ = D), D = S + L, D > C && (C = D)), M = L, N = 1 / 0, R = -1 / 0, q = K, L = E;
       for (let G = O; G < w; G++)
         B = u[G].offset[0], z = u[G].offset[1], A = f[G].offset[0], _ = f[G].offset[1], q < B && (D = q + L, D < N && (N = D), D = B + L, D > R && (R = D)), A < N && (N = A), _ > R && (R = _), L += _ - A - z + B, q = z;
       q < S && (D = q + L, D < N && (N = D), D = S + L, D > R && (R = D)), E = L;
-      const U = oe(e, i, I, C);
+      const U = oe(e, i, $, C);
       h.push({
-        offset: [I, C],
+        offset: [$, C],
         lines: [U.startLine, U.endLine],
         linesOffset: [U.startLineOfs, U.endLineOfs]
       });
@@ -2553,10 +2544,10 @@ function Rs(t, r) {
         linesOffset: [U.startLineOfs, U.endLineOfs]
       }), M += z - B - _ + A, y++;
     } else {
-      B = u[w].offset[0], z = u[w].offset[1], A = f[w].offset[0], _ = f[w].offset[1], I = B + M, C = z + M;
-      const U = oe(e, i, I, C);
+      B = u[w].offset[0], z = u[w].offset[1], A = f[w].offset[0], _ = f[w].offset[1], $ = B + M, C = z + M;
+      const U = oe(e, i, $, C);
       h.push({
-        offset: [I, C],
+        offset: [$, C],
         lines: [U.startLine, U.endLine],
         linesOffset: [U.startLineOfs, U.endLineOfs]
       }), g.push(f[w]), E += _ - A - z + B, w++;
@@ -2618,7 +2609,7 @@ async function Ds(t) {
     }
   });
 }
-async function $e(t) {
+async function Ie(t) {
   const { filePaths: r, operations: s, dryRun: o, dateModifiedMax: e } = t;
   return { results: await Promise.all(
     r.map(async (i) => {
@@ -2706,7 +2697,7 @@ function Bs(t) {
   });
   return { output: o + u.output + e + n + d.output + i, truncated: u.truncated || d.truncated };
 }
-function Ie(t) {
+function $e(t) {
   const { result: r, rootDir: s, errorsOnly: o } = t;
   let e = "";
   for (let n = 0; n < r.results.length; n++) {
@@ -2785,10 +2776,10 @@ async function As(t, r, s) {
     return {
       error: "Either snapshotName or snapshot must be provided"
     };
-  const d = Dt(l), p = l.query.rootDir ?? ".", h = await $e({
+  const d = Dt(l), p = l.query.rootDir ?? ".", h = await Ie({
     filePaths: d,
     operations: i
-  }), g = Ie({
+  }), g = $e({
     result: h,
     rootDir: p
   });
@@ -2887,7 +2878,7 @@ async function js(t, r, s) {
   const d = Dt(l), p = l.query.rootDir ?? ".", h = {
     filePaths: d,
     operations: i
-  }, g = Date.now(), y = await $e({
+  }, g = Date.now(), y = await Ie({
     ...h,
     dryRun: !0
   }), w = as();
@@ -2897,7 +2888,7 @@ async function js(t, r, s) {
     rootDir: p,
     dateCreated: g
   };
-  const M = Ie({
+  const M = $e({
     result: y,
     rootDir: p
   }) + `
@@ -2965,11 +2956,11 @@ async function _s(t, r, s) {
     return {
       error: `Invalid replaceId "${e}". The replaceId is located at the END of fs-snapshot-replace-prepare output. Read the ENTIRE output to find it. NEVER fabricate or guess this value.`
     };
-  const a = await $e({
+  const a = await Ie({
     ...i.options,
     dateModifiedMax: i.dateCreated
   });
-  return n.preparedReplace = null, { output: Ie({
+  return n.preparedReplace = null, { output: $e({
     result: a,
     rootDir: i.rootDir,
     errorsOnly: !0
@@ -3000,7 +2991,7 @@ ${e.output}`), n;
   );
 }
 function Js(t, r) {
-  r.list && ns(t, r), r.snapshotQueryCreate && cs(t, r), r.snapshotCreate && ws(t, r), r.snapshotBrowse && $s(t, r), r.snapshotSearch && zs(t, r), r.snapshotReplace && (qs(t, r), Gs(t, r)), console.log(
+  r.list && ns(t, r), r.snapshotQueryCreate && cs(t, r), r.snapshotCreate && ws(t, r), r.snapshotBrowse && Is(t, r), r.snapshotSearch && zs(t, r), r.snapshotReplace && (qs(t, r), Gs(t, r)), console.log(
     `File manager:
 - Working directory: ${k.resolve(r.workingDir || "")}
 `
@@ -4340,7 +4331,7 @@ Expected one of:
 - flemist-mcp.config.json5
 - flemist-mcp.config.yaml`);
 }
-const $o = {
+const Io = {
   logDir: "tmp/mcp-project-tools/logs",
   tools: {
     processManager: {
@@ -4381,7 +4372,7 @@ const $o = {
     }
   }
 };
-async function Io(t) {
+async function $o(t) {
   const r = k.resolve(t), s = await xo(r), o = k.join(r, ".flemist-mcpignore");
   try {
     await j.promises.stat(o);
@@ -4392,7 +4383,7 @@ Create .flemist-mcpignore file in: ${r}
 
 This file contains glob patterns for files/directories to exclude from MCP operations.`);
   }
-  const e = dr($o, s, {
+  const e = dr(Io, s, {
     arrayMerge(n, i) {
       return i;
     }
@@ -4500,7 +4491,7 @@ X-Project-Name header is missing. To configure MCP for this project:
 Ask user to:
 1. Add project to server's projects config: projects: { "${i}": "<project-path>" }
 2. Restart MCP server`);
-      const c = await Io(a), l = new Zt({
+      const c = await $o(a), l = new Zt({
         title: t.title,
         name: t.name,
         version: t.version

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@flemist/mcp-project-tools",
-  "version": "5.0.0",
+  "version": "5.0.1",
   "description": "MCP project tools",
   "publishConfig": {
     "access": "public"