@mcp-monorepo/file-browser 1.0.0

package/dist/index.d.ts

@@ -0,0 +1,3 @@
+#!/usr/bin/env node
+export {};
+//# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":""}

package/dist/index.js

@@ -0,0 +1,26 @@
+#!/usr/bin/env node
+import { createMcpServer } from '@mcp-monorepo/shared';
+import { registerFindOrReplaceTool } from './tools/find-or-replace.js';
+import { registerListDirectoryTool } from './tools/list-directory.js';
+import { registerMkDirTool } from './tools/mk-dir.js';
+import { registerMovePathTool } from './tools/move-path.js';
+import { registerOpenFileTool } from './tools/open-file.js';
+import { registerPatchFileTool } from './tools/patch-file.js';
+import { registerRemoveFileTool } from './tools/remove-file.js';
+import { registerTreeDirectoryTool } from './tools/tree-directory.js';
+createMcpServer({
+    name: 'file-browser',
+    importMetaPath: import.meta.filename,
+    title: 'File Browser MCP Server',
+    tools: [
+        registerOpenFileTool,
+        registerMovePathTool,
+        registerListDirectoryTool,
+        registerTreeDirectoryTool,
+        registerMkDirTool,
+        registerRemoveFileTool,
+        registerFindOrReplaceTool,
+        registerPatchFileTool,
+    ],
+});
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":";AAEA,OAAO,EAAE,eAAe,EAAE,MAAM,sBAAsB,CAAA;AAEtD,OAAO,EAAE,yBAAyB,EAAE,MAAM,4BAA4B,CAAA;AACtE,OAAO,EAAE,yBAAyB,EAAE,MAAM,2BAA2B,CAAA;AACrE,OAAO,EAAE,iBAAiB,EAAE,MAAM,mBAAmB,CAAA;AACrD,OAAO,EAAE,oBAAoB,EAAE,MAAM,sBAAsB,CAAA;AAC3D,OAAO,EAAE,oBAAoB,EAAE,MAAM,sBAAsB,CAAA;AAC3D,OAAO,EAAE,qBAAqB,EAAE,MAAM,uBAAuB,CAAA;AAC7D,OAAO,EAAE,sBAAsB,EAAE,MAAM,wBAAwB,CAAA;AAC/D,OAAO,EAAE,yBAAyB,EAAE,MAAM,2BAA2B,CAAA;AAErE,eAAe,CAAC;IACd,IAAI,EAAE,cAAc;IACpB,cAAc,EAAE,MAAM,CAAC,IAAI,CAAC,QAAQ;IACpC,KAAK,EAAE,yBAAyB;IAChC,KAAK,EAAE;QACL,oBAAoB;QACpB,oBAAoB;QACpB,yBAAyB;QACzB,yBAAyB;QACzB,iBAAiB;QACjB,sBAAsB;QACtB,yBAAyB;QACzB,qBAAqB;KACtB;CACF,CAAC,CAAA"}

package/dist/lib/env.d.ts

@@ -0,0 +1,10 @@
+/**
+ * Retrieves and validates the WORKING_DIR from environment variables.
+ * Ensures the path is an absolute and normalized path.
+ * Throws an error if the path is invalid, missing, or not absolute.
+ *
+ * @returns {string} - Normalized absolute path
+ * @throws {Error} - If WORKING_DIR is invalid
+ */
+export declare function getWorkingDir(): string;
+//# sourceMappingURL=env.d.ts.map

package/dist/lib/env.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"env.d.ts","sourceRoot":"","sources":["../../src/lib/env.ts"],"names":[],"mappings":"AAEA;;;;;;;GAOG;AACH,wBAAgB,aAAa,WAY5B"}

package/dist/lib/env.js

@@ -0,0 +1,20 @@
+import { isAbsolute, normalize } from 'node:path';
+/**
+ * Retrieves and validates the WORKING_DIR from environment variables.
+ * Ensures the path is an absolute and normalized path.
+ * Throws an error if the path is invalid, missing, or not absolute.
+ *
+ * @returns {string} - Normalized absolute path
+ * @throws {Error} - If WORKING_DIR is invalid
+ */
+export function getWorkingDir() {
+    const workingDir = process.env.WORKING_DIR;
+    if (!workingDir || workingDir.trim() === '') {
+        throw new Error('WORKING_DIR environment variable is not set or empty.');
+    }
+    if (!isAbsolute(workingDir)) {
+        throw new Error('WORKING_DIR must be an absolute path.');
+    }
+    return normalize(workingDir);
+}
+//# sourceMappingURL=env.js.map

package/dist/lib/env.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"env.js","sourceRoot":"","sources":["../../src/lib/env.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,SAAS,EAAE,MAAM,WAAW,CAAA;AAEjD;;;;;;;GAOG;AACH,MAAM,UAAU,aAAa;IAC3B,MAAM,UAAU,GAAG,OAAO,CAAC,GAAG,CAAC,WAAW,CAAA;IAE1C,IAAI,CAAC,UAAU,IAAI,UAAU,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC;QAC5C,MAAM,IAAI,KAAK,CAAC,uDAAuD,CAAC,CAAA;IAC1E,CAAC;IAED,IAAI,CAAC,UAAU,CAAC,UAAU,CAAC,EAAE,CAAC;QAC5B,MAAM,IAAI,KAAK,CAAC,uCAAuC,CAAC,CAAA;IAC1D,CAAC;IAED,OAAO,SAAS,CAAC,UAAU,CAAC,CAAA;AAC9B,CAAC"}

package/dist/lib/find-best-patch-match.d.ts

@@ -0,0 +1,31 @@
+type PatchMatchResult = {
+    maxOverlap: number;
+    bestMatchPos: number;
+};
+type PatchPositionResult = {
+    patchStartPos: PatchMatchResult | undefined;
+    patchEndPos: PatchMatchResult | undefined;
+};
+/**
+ * Finds the longest match for a patch substring using binary search.
+ *
+ * @param fileContent - The content of the file to search within.
+ * @param patch - The patch substring to search for.
+ * @param approxLine - The approximate line number to center the search around.
+ * @param isStart - Whether to search for the start or end of the patch.
+ * @param radius - The number of lines to search around the approximate line.
+ * @returns The position of the longest match, or undefined if not found.
+ */
+export declare function findLongestMatch(fileContent: string, patch: string, approxLine: number, isStart: boolean, radius: number): PatchMatchResult | undefined;
+/**
+ * Finds the start and end positions of a patch in the file content.
+ *
+ * @param fileContent - The content of the file to search within.
+ * @param patch - The patch substring to locate.
+ * @param approxStartLine - The approximate line number where the patch starts.
+ * @param approxEndLine - The approximate line number where the patch ends.
+ * @returns The start and end positions of the patch in the file content.
+ */
+export declare function findPatchPositions(fileContent: string, patch: string, approxStartLine: number, approxEndLine: number): PatchPositionResult;
+export {};
+//# sourceMappingURL=find-best-patch-match.d.ts.map

package/dist/lib/find-best-patch-match.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"find-best-patch-match.d.ts","sourceRoot":"","sources":["../../src/lib/find-best-patch-match.ts"],"names":[],"mappings":"AAMA,KAAK,gBAAgB,GAAG;IAAE,UAAU,EAAE,MAAM,CAAC;IAAC,YAAY,EAAE,MAAM,CAAA;CAAE,CAAA;AACpE,KAAK,mBAAmB,GAAG;IAAE,aAAa,EAAE,gBAAgB,GAAG,SAAS,CAAC;IAAC,WAAW,EAAE,gBAAgB,GAAG,SAAS,CAAA;CAAE,CAAA;AAErH;;;;;;;;;GASG;AACH,wBAAgB,gBAAgB,CAC9B,WAAW,EAAE,MAAM,EACnB,KAAK,EAAE,MAAM,EACb,UAAU,EAAE,MAAM,EAClB,OAAO,EAAE,OAAO,EAChB,MAAM,EAAE,MAAM,GACb,gBAAgB,GAAG,SAAS,CA8C9B;AAED;;;;;;;;GAQG;AACH,wBAAgB,kBAAkB,CAChC,WAAW,EAAE,MAAM,EACnB,KAAK,EAAE,MAAM,EACb,eAAe,EAAE,MAAM,EACvB,aAAa,EAAE,MAAM,GACpB,mBAAmB,CAUrB"}

package/dist/lib/find-best-patch-match.js

@@ -0,0 +1,74 @@
+import { getNthLastLineBreakBeforePosition, getNthNextLineBreakAfterPosition, getPositionForLineNumber, } from './finder.js';
+/**
+ * Finds the longest match for a patch substring using binary search.
+ *
+ * @param fileContent - The content of the file to search within.
+ * @param patch - The patch substring to search for.
+ * @param approxLine - The approximate line number to center the search around.
+ * @param isStart - Whether to search for the start or end of the patch.
+ * @param radius - The number of lines to search around the approximate line.
+ * @returns The position of the longest match, or undefined if not found.
+ */
+export function findLongestMatch(fileContent, patch, approxLine, isStart, radius) {
+    // Calculate the search range using line-based helper methods
+    const approxPos = getPositionForLineNumber(fileContent, approxLine);
+    if (approxPos === undefined)
+        return undefined;
+    const startSearchPos = getNthLastLineBreakBeforePosition(fileContent, approxPos, radius) ?? 0;
+    const endSearchPos = getNthNextLineBreakAfterPosition(fileContent, approxPos, radius) ?? fileContent.length;
+    const targetSegment = fileContent.slice(startSearchPos, endSearchPos);
+    // Binary search for the longest match
+    let low = 1; // Minimum overlap length
+    let isFirstStage = true;
+    let high = Math.min(10, patch.length);
+    let bestMatchPos = undefined;
+    while (low <= high) {
+        const mid = isFirstStage ? high : Math.floor((low + high) / 2);
+        const substring = isStart ? patch.slice(0, mid) : patch.slice(-mid);
+        const regex = new RegExp(substring.replace(/[.*+?^${}()|[\]\\]/g, '\\$&'), 'g');
+        const match = targetSegment.match(regex);
+        if (match) {
+            // Match found, try for a longer overlap
+            if (isFirstStage) {
+                high *= 2;
+                if (high >= patch.length) {
+                    high = patch.length;
+                    isFirstStage = false;
+                }
+            }
+            else {
+                low = mid + 1;
+            }
+            bestMatchPos = fileContent.indexOf(match[0], startSearchPos);
+            bestMatchPos = isStart ? bestMatchPos : bestMatchPos + match[0].length;
+        }
+        else {
+            // No match, try for a shorter overlap
+            if (isFirstStage) {
+                isFirstStage = false;
+            }
+            else {
+                high = mid - 1;
+            }
+        }
+    }
+    return bestMatchPos !== undefined ? { maxOverlap: high, bestMatchPos } : undefined;
+}
+/**
+ * Finds the start and end positions of a patch in the file content.
+ *
+ * @param fileContent - The content of the file to search within.
+ * @param patch - The patch substring to locate.
+ * @param approxStartLine - The approximate line number where the patch starts.
+ * @param approxEndLine - The approximate line number where the patch ends.
+ * @returns The start and end positions of the patch in the file content.
+ */
+export function findPatchPositions(fileContent, patch, approxStartLine, approxEndLine) {
+    const searchRadius = 10; // Number of lines to search around the approximate position
+    // Find the start position of the patch
+    const patchStartPos = findLongestMatch(fileContent, patch, approxStartLine, true, searchRadius);
+    // Find the end position of the patch
+    const patchEndPos = findLongestMatch(fileContent, patch, approxEndLine, false, searchRadius);
+    return { patchStartPos, patchEndPos };
+}
+//# sourceMappingURL=find-best-patch-match.js.map

package/dist/lib/find-best-patch-match.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"find-best-patch-match.js","sourceRoot":"","sources":["../../src/lib/find-best-patch-match.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,iCAAiC,EACjC,gCAAgC,EAChC,wBAAwB,GACzB,MAAM,aAAa,CAAA;AAKpB;;;;;;;;;GASG;AACH,MAAM,UAAU,gBAAgB,CAC9B,WAAmB,EACnB,KAAa,EACb,UAAkB,EAClB,OAAgB,EAChB,MAAc;IAEd,6DAA6D;IAC7D,MAAM,SAAS,GAAG,wBAAwB,CAAC,WAAW,EAAE,UAAU,CAAC,CAAA;IACnE,IAAI,SAAS,KAAK,SAAS;QAAE,OAAO,SAAS,CAAA;IAE7C,MAAM,cAAc,GAAG,iCAAiC,CAAC,WAAW,EAAE,SAAS,EAAE,MAAM,CAAC,IAAI,CAAC,CAAA;IAC7F,MAAM,YAAY,GAAG,gCAAgC,CAAC,WAAW,EAAE,SAAS,EAAE,MAAM,CAAC,IAAI,WAAW,CAAC,MAAM,CAAA;IAC3G,MAAM,aAAa,GAAG,WAAW,CAAC,KAAK,CAAC,cAAc,EAAE,YAAY,CAAC,CAAA;IAErE,sCAAsC;IACtC,IAAI,GAAG,GAAG,CAAC,CAAA,CAAC,yBAAyB;IACrC,IAAI,YAAY,GAAG,IAAI,CAAA;IACvB,IAAI,IAAI,GAAW,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,MAAM,CAAC,CAAA;IAC7C,IAAI,YAAY,GAAuB,SAAS,CAAA;IAEhD,OAAO,GAAG,IAAI,IAAI,EAAE,CAAC;QACnB,MAAM,GAAG,GAAW,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAA;QACtE,MAAM,SAAS,GAAG,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAA;QAEnE,MAAM,KAAK,GAAG,IAAI,MAAM,CAAC,SAAS,CAAC,OAAO,CAAC,qBAAqB,EAAE,MAAM,CAAC,EAAE,GAAG,CAAC,CAAA;QAC/E,MAAM,KAAK,GAAG,aAAa,CAAC,KAAK,CAAC,KAAK,CAAC,CAAA;QAExC,IAAI,KAAK,EAAE,CAAC;YACV,wCAAwC;YACxC,IAAI,YAAY,EAAE,CAAC;gBACjB,IAAI,IAAI,CAAC,CAAA;gBACT,IAAI,IAAI,IAAI,KAAK,CAAC,MAAM,EAAE,CAAC;oBACzB,IAAI,GAAG,KAAK,CAAC,MAAM,CAAA;oBACnB,YAAY,GAAG,KAAK,CAAA;gBACtB,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,GAAG,GAAG,GAAG,GAAG,CAAC,CAAA;YACf,CAAC;YACD,YAAY,GAAG,WAAW,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,cAAc,CAAC,CAAA;YAC5D,YAAY,GAAG,OAAO,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,YAAY,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAA;QACxE,CAAC;aAAM,CAAC;YACN,sCAAsC;YACtC,IAAI,YAAY,EAAE,CAAC;gBACjB,YAAY,GAAG,KAAK,CAAA;YACtB,CAAC;iBAAM,CAAC;gBACN,IAAI,GAAG,GAAG,GAAG,CAAC,CAAA;YAChB,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,YAAY,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,IAAI,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC,SAAS,CAAA;AACpF,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,kBAAkB,CAChC,WAAmB,EACnB,KAAa,EACb,eAAuB,EACvB,aAAqB;IAErB,MAAM,YAAY,GAAG,EAAE,CAAA,CAAC,4DAA4D;IAEpF,uCAAuC;IACvC,MAAM,aAAa,GAAG,gBAAgB,CAAC,WAAW,EAAE,KAAK,EAAE,eAAe,EAAE,IAAI,EAAE,YAAY,CAAC,CAAA;IAE/F,qCAAqC;IACrC,MAAM,WAAW,GAAG,gBAAgB,CAAC,WAAW,EAAE,KAAK,EAAE,aAAa,EAAE,KAAK,EAAE,YAAY,CAAC,CAAA;IAE5F,OAAO,EAAE,aAAa,EAAE,WAAW,EAAE,CAAA;AACvC,CAAC"}

package/dist/lib/finder.d.ts

@@ -0,0 +1,46 @@
+/**
+ * Finds the n-th last line break before the specified position in the input string.
+ *
+ * @param input - The input string to search within.
+ * @param position - The position in the string to search before.
+ * @param n - Number of line breaks.
+ * @returns The index of the n-th last line break before the position, or undefined if not found.
+ */
+export declare function getNthLastLineBreakBeforePosition(input: string, position: number, n: number): number | undefined;
+/**
+ * Finds the n-th next line break after the specified position in the input string.
+ *
+ * @param input - The input string to search within.
+ * @param position - The position in the string to search after.
+ * @param n - Number of line breaks.
+ * @returns The index of the n-th next line break after the position, or undefined if not found.
+ */
+export declare function getNthNextLineBreakAfterPosition(input: string, position: number, n: number): number | undefined;
+/**
+ * Determines the line number at the specified position in the input string.
+ *
+ * @param input - The input string to analyze.
+ * @param position - The position in the string to determine the line number for.
+ * @returns The 1-based line number at the specified position.
+ * @throws If the position is out of bounds of the input string.
+ */
+export declare function getLineNumberAtPosition(input: string, position: number): number;
+/**
+ * Converts a 1-based line number to a position index in the file content.
+ *
+ * @param fileContent - The content of the file.
+ * @param lineNumber - The 1-based line number to convert.
+ * @returns The position index of the start of the specified line, or undefined if the line does not exist.
+ */
+export declare function getPositionForLineNumber(fileContent: string, lineNumber: number): number | undefined;
+/**
+ * Extracts the substring from two line breaks before and after the given position,
+ * and prepends each line with line numbers, linebreaks, and "|".
+ *
+ * @param input - The input string to process.
+ * @param startPos - The start position in the string to center the extraction around.
+ * @param endPos - The end position in the string to center the extraction around.
+ * @returns The formatted substring with line numbers, linebreaks, and "|" prepended to each line.
+ */
+export declare function getFormattedSubstring(input: string, startPos: number, endPos: number): string;
+//# sourceMappingURL=finder.d.ts.map

package/dist/lib/finder.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"finder.d.ts","sourceRoot":"","sources":["../../src/lib/finder.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AACH,wBAAgB,iCAAiC,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS,CAUhH;AAED;;;;;;;GAOG;AACH,wBAAgB,gCAAgC,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS,CAY/G;AAED;;;;;;;GAOG;AACH,wBAAgB,uBAAuB,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,MAAM,CAS/E;AAED;;;;;;GAMG;AACH,wBAAgB,wBAAwB,CAAC,WAAW,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS,CAIpG;AAED;;;;;;;;GAQG;AACH,wBAAgB,qBAAqB,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,MAAM,CAiB7F"}

package/dist/lib/finder.js

@@ -0,0 +1,90 @@
+/**
+ * Finds the n-th last line break before the specified position in the input string.
+ *
+ * @param input - The input string to search within.
+ * @param position - The position in the string to search before.
+ * @param n - Number of line breaks.
+ * @returns The index of the n-th last line break before the position, or undefined if not found.
+ */
+export function getNthLastLineBreakBeforePosition(input, position, n) {
+    const regex = new RegExp(`(?:\\n[^\\n]*?){${n - 1}}\\n(?=[^\\n]*$)`);
+    const substring = input.slice(0, position);
+    const match = substring.match(regex);
+    if (match) {
+        return match.index ?? undefined;
+    }
+    return undefined;
+}
+/**
+ * Finds the n-th next line break after the specified position in the input string.
+ *
+ * @param input - The input string to search within.
+ * @param position - The position in the string to search after.
+ * @param n - Number of line breaks.
+ * @returns The index of the n-th next line break after the position, or undefined if not found.
+ */
+export function getNthNextLineBreakAfterPosition(input, position, n) {
+    const substring = input.slice(position);
+    const regex = new RegExp(`(?:[^\\n]*\\n){${n}}`);
+    const match = substring.match(regex);
+    if (match) {
+        const nthNextLineBreakIndex = match[0].length;
+        if (nthNextLineBreakIndex === 0)
+            return 0;
+        return position + nthNextLineBreakIndex - 1;
+    }
+    return undefined;
+}
+/**
+ * Determines the line number at the specified position in the input string.
+ *
+ * @param input - The input string to analyze.
+ * @param position - The position in the string to determine the line number for.
+ * @returns The 1-based line number at the specified position.
+ * @throws If the position is out of bounds of the input string.
+ */
+export function getLineNumberAtPosition(input, position) {
+    if (position < 0 || position > input.length) {
+        throw new Error('Position is out of bounds');
+    }
+    const substring = input.slice(0, position);
+    const lineBreakCount = (substring.match(/\n/g) || []).length;
+    return lineBreakCount + 1;
+}
+/**
+ * Converts a 1-based line number to a position index in the file content.
+ *
+ * @param fileContent - The content of the file.
+ * @param lineNumber - The 1-based line number to convert.
+ * @returns The position index of the start of the specified line, or undefined if the line does not exist.
+ */
+export function getPositionForLineNumber(fileContent, lineNumber) {
+    const position = getNthNextLineBreakAfterPosition(fileContent, 0, lineNumber - 1);
+    const offset = lineNumber === 1 ? 0 : 1;
+    return position === undefined || fileContent.length <= position ? undefined : position + offset;
+}
+/**
+ * Extracts the substring from two line breaks before and after the given position,
+ * and prepends each line with line numbers, linebreaks, and "|".
+ *
+ * @param input - The input string to process.
+ * @param startPos - The start position in the string to center the extraction around.
+ * @param endPos - The end position in the string to center the extraction around.
+ * @returns The formatted substring with line numbers, linebreaks, and "|" prepended to each line.
+ */
+export function getFormattedSubstring(input, startPos, endPos) {
+    let start = getNthLastLineBreakBeforePosition(input, startPos, 2);
+    start = start === undefined ? 0 : start + 1;
+    let end = getNthNextLineBreakAfterPosition(input, endPos, 2);
+    end = end === undefined ? input.length : end;
+    const substring = input.slice(start, end);
+    const startLineNumber = getLineNumberAtPosition(input, start);
+    if (substring === '') {
+        return '';
+    }
+    return substring
+        .split('\n')
+        .map((line, index) => `${startLineNumber + index} | ${line}`)
+        .join('\n');
+}
+//# sourceMappingURL=finder.js.map

package/dist/lib/finder.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"finder.js","sourceRoot":"","sources":["../../src/lib/finder.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AACH,MAAM,UAAU,iCAAiC,CAAC,KAAa,EAAE,QAAgB,EAAE,CAAS;IAC1F,MAAM,KAAK,GAAG,IAAI,MAAM,CAAC,mBAAmB,CAAC,GAAG,CAAC,kBAAkB,CAAC,CAAA;IACpE,MAAM,SAAS,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAA;IAC1C,MAAM,KAAK,GAAG,SAAS,CAAC,KAAK,CAAC,KAAK,CAAC,CAAA;IAEpC,IAAI,KAAK,EAAE,CAAC;QACV,OAAO,KAAK,CAAC,KAAK,IAAI,SAAS,CAAA;IACjC,CAAC;IAED,OAAO,SAAS,CAAA;AAClB,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,gCAAgC,CAAC,KAAa,EAAE,QAAgB,EAAE,CAAS;IACzF,MAAM,SAAS,GAAG,KAAK,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAA;IACvC,MAAM,KAAK,GAAG,IAAI,MAAM,CAAC,kBAAkB,CAAC,GAAG,CAAC,CAAA;IAChD,MAAM,KAAK,GAAG,SAAS,CAAC,KAAK,CAAC,KAAK,CAAC,CAAA;IAEpC,IAAI,KAAK,EAAE,CAAC;QACV,MAAM,qBAAqB,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAA;QAC7C,IAAI,qBAAqB,KAAK,CAAC;YAAE,OAAO,CAAC,CAAA;QACzC,OAAO,QAAQ,GAAG,qBAAqB,GAAG,CAAC,CAAA;IAC7C,CAAC;IAED,OAAO,SAAS,CAAA;AAClB,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,uBAAuB,CAAC,KAAa,EAAE,QAAgB;IACrE,IAAI,QAAQ,GAAG,CAAC,IAAI,QAAQ,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;QAC5C,MAAM,IAAI,KAAK,CAAC,2BAA2B,CAAC,CAAA;IAC9C,CAAC;IAED,MAAM,SAAS,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAA;IAC1C,MAAM,cAAc,GAAG,CAAC,SAAS,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAA;IAE5D,OAAO,cAAc,GAAG,CAAC,CAAA;AAC3B,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,wBAAwB,CAAC,WAAmB,EAAE,UAAkB;IAC9E,MAAM,QAAQ,GAAG,gCAAgC,CAAC,WAAW,EAAE,CAAC,EAAE,UAAU,GAAG,CAAC,CAAC,CAAA;IACjF,MAAM,MAAM,GAAG,UAAU,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;IACvC,OAAO,QAAQ,KAAK,SAAS,IAAI,WAAW,CAAC,MAAM,IAAI,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,QAAQ,GAAG,MAAM,CAAA;AACjG,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,qBAAqB,CAAC,KAAa,EAAE,QAAgB,EAAE,MAAc;IACnF,IAAI,KAAK,GAAG,iCAAiC,CAAC,KAAK,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAA;IACjE,KAAK,GAAG,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAA;IAC3C,IAAI,GAAG,GAAG,gCAAgC,CAAC,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC,CAAA;IAC5D,GAAG,GAAG,GAAG,KAAK,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAA;IAE5C,MAAM,SAAS,GAAG,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,CAAA;IACzC,MAAM,eAAe,GAAG,uBAAuB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAA;IAE7D,IAAI,SAAS,KAAK,EAAE,EAAE,CAAC;QACrB,OAAO,EAAE,CAAA;IACX,CAAC;IAED,OAAO,SAAS;SACb,KAAK,CAAC,IAAI,CAAC;SACX,GAAG,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,GAAG,eAAe,GAAG,KAAK,MAAM,IAAI,EAAE,CAAC;SAC5D,IAAI,CAAC,IAAI,CAAC,CAAA;AACf,CAAC"}

package/dist/lib/validators.d.ts

@@ -0,0 +1,12 @@
+/**
+ * Checks if a given absolute path (candidatePath) is a subpath of another absolute path (basePath).
+ * @param {string} basePath - The parent path to check against.
+ * @param {string} candidatePath - The path to check if it's within the basePath.
+ * @throws {Error} - If either path is not absolute or candidatePath not is within basePath
+ */
+export declare function validateWithinBasePath(basePath: string, candidatePath: string): void;
+export declare function validateExists(path: string): Promise<void>;
+export declare function validateDoesNotExists(path: string): Promise<void>;
+export declare function validateIsFile(path: string): Promise<void>;
+export declare function validateIsDir(path: string): Promise<void>;
+//# sourceMappingURL=validators.d.ts.map

package/dist/lib/validators.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"validators.d.ts","sourceRoot":"","sources":["../../src/lib/validators.ts"],"names":[],"mappings":"AAKA;;;;;GAKG;AACH,wBAAgB,sBAAsB,CAAC,QAAQ,EAAE,MAAM,EAAE,aAAa,EAAE,MAAM,QAwB7E;AAED,wBAAsB,cAAc,CAAC,IAAI,EAAE,MAAM,iBAMhD;AAED,wBAAsB,qBAAqB,CAAC,IAAI,EAAE,MAAM,iBASvD;AAED,wBAAsB,cAAc,CAAC,IAAI,EAAE,MAAM,iBAKhD;AAED,wBAAsB,aAAa,CAAC,IAAI,EAAE,MAAM,iBAK/C"}

package/dist/lib/validators.js

@@ -0,0 +1,57 @@
+import { stat } from 'node:fs/promises';
+import { isAbsolute, normalize } from 'node:path';
+import { logger } from '@mcp-monorepo/shared';
+/**
+ * Checks if a given absolute path (candidatePath) is a subpath of another absolute path (basePath).
+ * @param {string} basePath - The parent path to check against.
+ * @param {string} candidatePath - The path to check if it's within the basePath.
+ * @throws {Error} - If either path is not absolute or candidatePath not is within basePath
+ */
+export function validateWithinBasePath(basePath, candidatePath) {
+    if (!isAbsolute(basePath)) {
+        logger.error('Base path must be an absolute path. Got: ', basePath, ' instead.');
+        throw new Error('Base path must be an absolute path.');
+    }
+    if (!isAbsolute(candidatePath)) {
+        logger.error('Candidate path must be an absolute path. Got: ', candidatePath, ' instead.');
+        throw new Error('Candidate path must be an absolute path.');
+    }
+    const normalizedBase = normalize(basePath).replace(/[/\\]+$/, ''); // Remove trailing slash
+    const normalizedCandidate = normalize(candidatePath);
+    if (!normalizedCandidate.startsWith(normalizedBase)) {
+        logger.error('Candidate path must be within base path. Got: ', normalizedCandidate, ' in base path: ', normalizedBase, ' instead.');
+        throw new Error('Candidate path must be within base path.');
+    }
+}
+export async function validateExists(path) {
+    try {
+        await stat(path);
+    }
+    catch (_) {
+        throw new Error('The provided path does not exist.');
+    }
+}
+export async function validateDoesNotExists(path) {
+    try {
+        await stat(path);
+        throw new Error('The provided path does exist.');
+    }
+    catch (error) {
+        if (error && typeof error === 'object' && 'code' in error && error.code !== 'ENOENT') {
+            throw error;
+        }
+    }
+}
+export async function validateIsFile(path) {
+    const fileStats = await stat(path);
+    if (!fileStats.isFile()) {
+        throw new Error('The provided path does not point to a valid file.');
+    }
+}
+export async function validateIsDir(path) {
+    const fileStats = await stat(path);
+    if (!fileStats.isDirectory()) {
+        throw new Error('The provided path does not point to a valid directory.');
+    }
+}
+//# sourceMappingURL=validators.js.map

package/dist/lib/validators.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"validators.js","sourceRoot":"","sources":["../../src/lib/validators.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,MAAM,kBAAkB,CAAA;AACvC,OAAO,EAAE,UAAU,EAAE,SAAS,EAAE,MAAM,WAAW,CAAA;AAEjD,OAAO,EAAE,MAAM,EAAE,MAAM,sBAAsB,CAAA;AAE7C;;;;;GAKG;AACH,MAAM,UAAU,sBAAsB,CAAC,QAAgB,EAAE,aAAqB;IAC5E,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,EAAE,CAAC;QAC1B,MAAM,CAAC,KAAK,CAAC,2CAA2C,EAAE,QAAQ,EAAE,WAAW,CAAC,CAAA;QAChF,MAAM,IAAI,KAAK,CAAC,qCAAqC,CAAC,CAAA;IACxD,CAAC;IAED,IAAI,CAAC,UAAU,CAAC,aAAa,CAAC,EAAE,CAAC;QAC/B,MAAM,CAAC,KAAK,CAAC,gDAAgD,EAAE,aAAa,EAAE,WAAW,CAAC,CAAA;QAC1F,MAAM,IAAI,KAAK,CAAC,0CAA0C,CAAC,CAAA;IAC7D,CAAC;IAED,MAAM,cAAc,GAAG,SAAS,CAAC,QAAQ,CAAC,CAAC,OAAO,CAAC,SAAS,EAAE,EAAE,CAAC,CAAA,CAAC,wBAAwB;IAC1F,MAAM,mBAAmB,GAAG,SAAS,CAAC,aAAa,CAAC,CAAA;IAEpD,IAAI,CAAC,mBAAmB,CAAC,UAAU,CAAC,cAAc,CAAC,EAAE,CAAC;QACpD,MAAM,CAAC,KAAK,CACV,gDAAgD,EAChD,mBAAmB,EACnB,iBAAiB,EACjB,cAAc,EACd,WAAW,CACZ,CAAA;QACD,MAAM,IAAI,KAAK,CAAC,0CAA0C,CAAC,CAAA;IAC7D,CAAC;AACH,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,cAAc,CAAC,IAAY;IAC/C,IAAI,CAAC;QACH,MAAM,IAAI,CAAC,IAAI,CAAC,CAAA;IAClB,CAAC;IAAC,OAAO,CAAC,EAAE,CAAC;QACX,MAAM,IAAI,KAAK,CAAC,mCAAmC,CAAC,CAAA;IACtD,CAAC;AACH,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,qBAAqB,CAAC,IAAY;IACtD,IAAI,CAAC;QACH,MAAM,IAAI,CAAC,IAAI,CAAC,CAAA;QAChB,MAAM,IAAI,KAAK,CAAC,+BAA+B,CAAC,CAAA;IAClD,CAAC;IAAC,OAAO,KAAc,EAAE,CAAC;QACxB,IAAI,KAAK,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,MAAM,IAAI,KAAK,IAAI,KAAK,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;YACrF,MAAM,KAAK,CAAA;QACb,CAAC;IACH,CAAC;AACH,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,cAAc,CAAC,IAAY;IAC/C,MAAM,SAAS,GAAG,MAAM,IAAI,CAAC,IAAI,CAAC,CAAA;IAClC,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,EAAE,CAAC;QACxB,MAAM,IAAI,KAAK,CAAC,mDAAmD,CAAC,CAAA;IACtE,CAAC;AACH,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,aAAa,CAAC,IAAY;IAC9C,MAAM,SAAS,GAAG,MAAM,IAAI,CAAC,IAAI,CAAC,CAAA;IAClC,IAAI,CAAC,SAAS,CAAC,WAAW,EAAE,EAAE,CAAC;QAC7B,MAAM,IAAI,KAAK,CAAC,wDAAwD,CAAC,CAAA;IAC3E,CAAC;AACH,CAAC"}

package/dist/lib/walker/better-walker.d.ts

@@ -0,0 +1,52 @@
+import { type Stats } from 'fs';
+export declare function getTypeFromStats(entry: Stats): "folder" | "file" | "block device" | "character device" | "FIFO" | "socket" | "symbolic link" | "unknown";
+export type StatType = ReturnType<typeof getTypeFromStats>;
+/**
+ * Options for traversing a directory using Breadth-First Search (BFS).
+ */
+interface TraverseOptions {
+    /** The absolute path to the directory to traverse. */
+    absoluteFolderPath: string;
+    /**
+     * An array of file names containing ignore patterns.
+     * @default ['.gitignore']
+     */
+    ignoreFiles?: string[];
+    /**
+     * Whether to follow symbolic links.
+     * Symbolic links are only followed if this is true and the operating system is not Windows.
+     * @default false
+     */
+    followSymLinks?: boolean;
+    /**
+     * The maximum depth to traverse.
+     * A depth of 0 means only the starting directory is processed.
+     * @default Infinity
+     */
+    maxDepth?: number;
+    /**
+     * The maximum number of entries (files/directories) to yield.
+     * The traversal stops once this limit is reached.
+     * @default Infinity
+     */
+    maxEntries?: number;
+    /**
+     * Whether to include empty directories in the traversal results. Dirs with content are never included.
+     * If set to `true`, empty directories will be yielded as part of the traversal.
+     * If set to `false`, empty directories will be skipped.
+     * @default false
+     */
+    includeEmptyDir?: boolean;
+}
+/**
+ * Asynchronously traverses a directory using Breadth-First Search (BFS) and yields each file/directory path.
+ *
+ * @param opts Options for the traversal, including the relative folder path, whether to follow symbolic links, max depth, and max entries.
+ * @returns An asynchronous generator that yields relative paths of files and directories.
+ */
+export declare function traverseDirectoryBFS(opts: TraverseOptions): AsyncGenerator<{
+    relPath: string;
+    type: StatType;
+}>;
+export {};
+//# sourceMappingURL=better-walker.d.ts.map

package/dist/lib/walker/better-walker.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"better-walker.d.ts","sourceRoot":"","sources":["../../../src/lib/walker/better-walker.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,KAAK,EAAE,MAAM,IAAI,CAAA;AAS/B,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,KAAK,6GAiB5C;AAED,MAAM,MAAM,QAAQ,GAAG,UAAU,CAAC,OAAO,gBAAgB,CAAC,CAAA;AAE1D;;GAEG;AACH,UAAU,eAAe;IACvB,sDAAsD;IACtD,kBAAkB,EAAE,MAAM,CAAA;IAC1B;;;OAGG;IACH,WAAW,CAAC,EAAE,MAAM,EAAE,CAAA;IACtB;;;;OAIG;IACH,cAAc,CAAC,EAAE,OAAO,CAAA;IACxB;;;;OAIG;IACH,QAAQ,CAAC,EAAE,MAAM,CAAA;IACjB;;;;OAIG;IACH,UAAU,CAAC,EAAE,MAAM,CAAA;IACnB;;;;;OAKG;IACH,eAAe,CAAC,EAAE,OAAO,CAAA;CAC1B;AAED;;;;;GAKG;AACH,wBAAuB,oBAAoB,CACzC,IAAI,EAAE,eAAe,GACpB,cAAc,CAAC;IAAE,OAAO,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,QAAQ,CAAA;CAAE,CAAC,CAoGrD"}

package/dist/lib/walker/better-walker.js

@@ -0,0 +1,120 @@
+import { lstat, readdir, stat } from 'node:fs/promises';
+import { platform } from 'node:os';
+import { join, relative } from 'node:path';
+import { logger } from '@mcp-monorepo/shared';
+import { IgnoreFileService } from './ignore-file-service.js';
+export function getTypeFromStats(entry) {
+    if (entry.isDirectory()) {
+        return 'folder';
+    }
+    else if (entry.isFile()) {
+        return 'file';
+    }
+    else if (entry.isBlockDevice()) {
+        return 'block device';
+    }
+    else if (entry.isCharacterDevice()) {
+        return 'character device';
+    }
+    else if (entry.isFIFO()) {
+        return 'FIFO';
+    }
+    else if (entry.isSocket()) {
+        return 'socket';
+    }
+    else if (entry.isSymbolicLink()) {
+        return 'symbolic link';
+    }
+    return 'unknown';
+}
+/**
+ * Asynchronously traverses a directory using Breadth-First Search (BFS) and yields each file/directory path.
+ *
+ * @param opts Options for the traversal, including the relative folder path, whether to follow symbolic links, max depth, and max entries.
+ * @returns An asynchronous generator that yields relative paths of files and directories.
+ */
+export async function* traverseDirectoryBFS(opts) {
+    const { absoluteFolderPath, ignoreFiles = ['.gitignore'], followSymLinks = false, maxDepth = Infinity, maxEntries = Infinity, includeEmptyDir = false, } = opts;
+    const isWindows = platform() === 'win32';
+    const ignoreService = new IgnoreFileService();
+    ignoreService.addByContent(absoluteFolderPath, '/.git/');
+    const baseDirStats = await lstat(absoluteFolderPath).catch(() => undefined);
+    if (!baseDirStats || !baseDirStats.isDirectory()) {
+        throw new Error('The provided path is not a directory.');
+    }
+    const queue = [
+        {
+            stats: baseDirStats,
+            currentPath: absoluteFolderPath,
+            currentDepth: 0,
+        },
+    ];
+    const visited = new Set();
+    let yieldedCount = 0;
+    while (queue.length > 0 && yieldedCount < maxEntries) {
+        const shifted = queue.shift();
+        if (!shifted)
+            break;
+        let { stats } = shifted;
+        const { currentPath, currentDepth } = shifted;
+        if (currentDepth > maxDepth || visited.has(currentPath)) {
+            continue;
+        }
+        visited.add(currentPath);
+        if (stats.isSymbolicLink() && followSymLinks && !isWindows) {
+            try {
+                stats = await stat(currentPath); // Follow symlink
+            }
+            catch (error) {
+                logger.error(`Error accessing path ${currentPath}:`, error);
+                continue; // Skip broken symlinks
+            }
+        }
+        const relPath = relative(absoluteFolderPath, currentPath).replace(/\\/g, '/');
+        // Process directories
+        if (stats.isDirectory()) {
+            // ** THE FIX: Perform a two-pass scan. First, load ignore files. **
+            const dirents = await readdir(currentPath, { withFileTypes: true });
+            // Pass 1: Find and immediately process all ignore files in this directory.
+            for (const dirent of dirents) {
+                if (dirent.isFile() && ignoreFiles.includes(dirent.name)) {
+                    await ignoreService.add(join(currentPath, dirent.name));
+                }
+            }
+            // Pass 2: Process children with the now-updated rules.
+            let hasYieldableChildren = false;
+            for (const dirent of dirents) {
+                const childPath = join(currentPath, dirent.name);
+                if (visited.has(childPath))
+                    continue;
+                const childRelPath = join(relPath, dirent.name);
+                if (!ignoreService.isPathIgnored(childPath)) {
+                    hasYieldableChildren = true;
+                }
+                // Prune directories that cannot possibly contain allowed files.
+                if (dirent.isDirectory() && !ignoreService.couldDirectoryContainAllowedFiles(childPath)) {
+                    continue;
+                }
+                try {
+                    const childStats = await lstat(childPath);
+                    queue.push({ stats: childStats, currentPath: childPath, currentDepth: currentDepth + 1 });
+                }
+                catch (e) {
+                    // ignore files that might have been deleted during traversal
+                }
+            }
+            if (relPath && includeEmptyDir && !hasYieldableChildren) {
+                yieldedCount++;
+                yield { relPath, type: 'folder' };
+            }
+        }
+        else {
+            // Process files
+            if (relPath && !ignoreService.isPathIgnored(currentPath)) {
+                yieldedCount++;
+                yield { relPath, type: getTypeFromStats(stats) };
+            }
+        }
+    }
+}
+//# sourceMappingURL=better-walker.js.map

package/dist/lib/walker/better-walker.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"better-walker.js","sourceRoot":"","sources":["../../../src/lib/walker/better-walker.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,IAAI,EAAE,MAAM,kBAAkB,CAAA;AACvD,OAAO,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAA;AAClC,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAA;AAE1C,OAAO,EAAE,MAAM,EAAE,MAAM,sBAAsB,CAAA;AAE7C,OAAO,EAAE,iBAAiB,EAAE,MAAM,0BAA0B,CAAA;AAE5D,MAAM,UAAU,gBAAgB,CAAC,KAAY;IAC3C,IAAI,KAAK,CAAC,WAAW,EAAE,EAAE,CAAC;QACxB,OAAO,QAAiB,CAAA;IAC1B,CAAC;SAAM,IAAI,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;QAC1B,OAAO,MAAe,CAAA;IACxB,CAAC;SAAM,IAAI,KAAK,CAAC,aAAa,EAAE,EAAE,CAAC;QACjC,OAAO,cAAuB,CAAA;IAChC,CAAC;SAAM,IAAI,KAAK,CAAC,iBAAiB,EAAE,EAAE,CAAC;QACrC,OAAO,kBAAkB,CAAA;IAC3B,CAAC;SAAM,IAAI,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;QAC1B,OAAO,MAAe,CAAA;IACxB,CAAC;SAAM,IAAI,KAAK,CAAC,QAAQ,EAAE,EAAE,CAAC;QAC5B,OAAO,QAAiB,CAAA;IAC1B,CAAC;SAAM,IAAI,KAAK,CAAC,cAAc,EAAE,EAAE,CAAC;QAClC,OAAO,eAAwB,CAAA;IACjC,CAAC;IACD,OAAO,SAAkB,CAAA;AAC3B,CAAC;AA0CD;;;;;GAKG;AACH,MAAM,CAAC,KAAK,SAAS,CAAC,CAAC,oBAAoB,CACzC,IAAqB;IAErB,MAAM,EACJ,kBAAkB,EAClB,WAAW,GAAG,CAAC,YAAY,CAAC,EAC5B,cAAc,GAAG,KAAK,EACtB,QAAQ,GAAG,QAAQ,EACnB,UAAU,GAAG,QAAQ,EACrB,eAAe,GAAG,KAAK,GACxB,GAAG,IAAI,CAAA;IACR,MAAM,SAAS,GAAG,QAAQ,EAAE,KAAK,OAAO,CAAA;IAExC,MAAM,aAAa,GAAG,IAAI,iBAAiB,EAAE,CAAA;IAC7C,aAAa,CAAC,YAAY,CAAC,kBAAkB,EAAE,QAAQ,CAAC,CAAA;IAExD,MAAM,YAAY,GAAG,MAAM,KAAK,CAAC,kBAAkB,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,SAAS,CAAC,CAAA;IAC3E,IAAI,CAAC,YAAY,IAAI,CAAC,YAAY,CAAC,WAAW,EAAE,EAAE,CAAC;QACjD,MAAM,IAAI,KAAK,CAAC,uCAAuC,CAAC,CAAA;IAC1D,CAAC;IAED,MAAM,KAAK,GAAkE;QAC3E;YACE,KAAK,EAAE,YAAY;YACnB,WAAW,EAAE,kBAAkB;YAC/B,YAAY,EAAE,CAAC;SAChB;KACF,CAAA;IACD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAA;IACjC,IAAI,YAAY,GAAG,CAAC,CAAA;IAEpB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,IAAI,YAAY,GAAG,UAAU,EAAE,CAAC;QACrD,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAE,CAAA;QAC7B,IAAI,CAAC,OAAO;YAAE,MAAK;QACnB,IAAI,EAAE,KAAK,EAAE,GAAG,OAAO,CAAA;QACvB,MAAM,EAAE,WAAW,EAAE,YAAY,EAAE,GAAG,OAAO,CAAA;QAE7C,IAAI,YAAY,GAAG,QAAQ,IAAI,OAAO,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,CAAC;YACxD,SAAQ;QACV,CAAC;QACD,OAAO,CAAC,GAAG,CAAC,WAAW,CAAC,CAAA;QAExB,IAAI,KAAK,CAAC,cAAc,EAAE,IAAI,cAAc,IAAI,CAAC,SAAS,EAAE,CAAC;YAC3D,IAAI,CAAC;gBACH,KAAK,GAAG,MAAM,IAAI,CAAC,WAAW,CAAC,CAAA,CAAC,iBAAiB;YACnD,CAAC;YAAC,OAAO,KAAK,EAAE,CAAC;gBACf,MAAM,CAAC,KAAK,CAAC,wBAAwB,WAAW,GAAG,EAAE,KAAK,CAAC,CAAA;gBAC3D,SAAQ,CAAC,uBAAuB;YAClC,CAAC;QACH,CAAC;QAED,MAAM,OAAO,GAAG,QAAQ,CAAC,kBAAkB,EAAE,WAAW,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAA;QAE7E,sBAAsB;QACtB,IAAI,KAAK,CAAC,WAAW,EAAE,EAAE,CAAC;YACxB,oEAAoE;YACpE,MAAM,OAAO,GAAG,MAAM,OAAO,CAAC,WAAW,EAAE,EAAE,aAAa,EAAE,IAAI,EAAE,CAAC,CAAA;YAEnE,2EAA2E;YAC3E,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;gBAC7B,IAAI,MAAM,CAAC,MAAM,EAAE,IAAI,WAAW,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;oBACzD,MAAM,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,WAAW,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAA;gBACzD,CAAC;YACH,CAAC;YAED,uDAAuD;YACvD,IAAI,oBAAoB,GAAG,KAAK,CAAA;YAChC,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;gBAC7B,MAAM,SAAS,GAAG,IAAI,CAAC,WAAW,EAAE,MAAM,CAAC,IAAI,CAAC,CAAA;gBAChD,IAAI,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC;oBAAE,SAAQ;gBAEpC,MAAM,YAAY,GAAG,IAAI,CAAC,OAAO,EAAE,MAAM,CAAC,IAAI,CAAC,CAAA;gBAE/C,IAAI,CAAC,aAAa,CAAC,aAAa,CAAC,SAAS,CAAC,EAAE,CAAC;oBAC5C,oBAAoB,GAAG,IAAI,CAAA;gBAC7B,CAAC;gBAED,gEAAgE;gBAChE,IAAI,MAAM,CAAC,WAAW,EAAE,IAAI,CAAC,aAAa,CAAC,iCAAiC,CAAC,SAAS,CAAC,EAAE,CAAC;oBACxF,SAAQ;gBACV,CAAC;gBAED,IAAI,CAAC;oBACH,MAAM,UAAU,GAAG,MAAM,KAAK,CAAC,SAAS,CAAC,CAAA;oBACzC,KAAK,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,UAAU,EAAE,WAAW,EAAE,SAAS,EAAE,YAAY,EAAE,YAAY,GAAG,CAAC,EAAE,CAAC,CAAA;gBAC3F,CAAC;gBAAC,OAAO,CAAC,EAAE,CAAC;oBACX,6DAA6D;gBAC/D,CAAC;YACH,CAAC;YAED,IAAI,OAAO,IAAI,eAAe,IAAI,CAAC,oBAAoB,EAAE,CAAC;gBACxD,YAAY,EAAE,CAAA;gBACd,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAA;YACnC,CAAC;QACH,CAAC;aAAM,CAAC;YACN,gBAAgB;YAChB,IAAI,OAAO,IAAI,CAAC,aAAa,CAAC,aAAa,CAAC,WAAW,CAAC,EAAE,CAAC;gBACzD,YAAY,EAAE,CAAA;gBACd,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,gBAAgB,CAAC,KAAK,CAAC,EAAE,CAAA;YAClD,CAAC;QACH,CAAC;IACH,CAAC;AACH,CAAC"}

package/dist/lib/walker/ignore-file-service.d.ts

@@ -0,0 +1,8 @@
+export declare class IgnoreFileService {
+    private rulesByDirectory;
+    add(filePath: string): Promise<void>;
+    addByContent(directoryPath: string, fileContent: string): void;
+    isPathIgnored(absolutePath: string): boolean;
+    couldDirectoryContainAllowedFiles(absolutePath: string): boolean;
+}
+//# sourceMappingURL=ignore-file-service.d.ts.map

package/dist/lib/walker/ignore-file-service.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ignore-file-service.d.ts","sourceRoot":"","sources":["../../../src/lib/walker/ignore-file-service.ts"],"names":[],"mappings":"AAsBA,qBAAa,iBAAiB;IAC5B,OAAO,CAAC,gBAAgB,CAA6B;IAE/C,GAAG,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAM1C,YAAY,CAAC,aAAa,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,GAAG,IAAI;IAwB9D,aAAa,CAAC,YAAY,EAAE,MAAM,GAAG,OAAO;IAsD5C,iCAAiC,CAAC,YAAY,EAAE,MAAM,GAAG,OAAO;CA6CjE"}