pathprobe 0.3.2 → 0.4.2

package/README.md

@@ -1,16 +1,19 @@
 # pathprobe
 
-`pathprobe` 用于从自然语言、日志、错误信息或其他文本中找出真实存在于文件系统中的文件和目录路径。
+`pathprobe` 是一个用于从自然语言文本中提取路径的工具。
 
-它支持显式路径、相对路径、带环境变量的路径、被引号包裹的路径，以及更宽松的文本片段匹配；还可以遵循 `.gitignore` 等忽略规则。
+它可以识别绝对路径、相对路径、引号中的路径、带环境变量的路径，以及形如 `file.ts:12:8` 的行列位置。
 
-## 使用
+## 基本用法
 
 ```ts
 import { findExistingPaths } from "pathprobe";
 
 const matches = await findExistingPaths(
-  "配置文件位于 ./config/settings.json，请检查后再启动。",
+  `
+  请检查 src/index.ts:12，
+  以及 "./src/types.ts"。
+  `,
   2,
   [process.cwd()],
 );
@@ -24,23 +27,22 @@ console.log(matches);
 [
   {
     kind: "file",
-    path: "/project/config/settings.json",
+    path: "/project/src/index.ts",
     position: {
-      start: 6,
-      end: 28,
+      start: 8,
+      end: 23,
+    },
+    location: {
+      line: 12,
     },
   },
 ];
 ```
 
-其中：
-
-- `kind`：路径类型，`file` 或 `directory`
-- `path`：解析后的绝对路径
-- `position`：原始文本中匹配内容的起止位置
-
 ## API
 
+### `findExistingPaths()`
+
 ```ts
 findExistingPaths(
   text,
@@ -52,60 +54,120 @@ findExistingPaths(
 ): Promise<PathMatch[]>
 ```
 
-### `text`
+参数：
 
-需要搜索的文本。
+- `text`：需要扫描的文本。
+- `level`：搜索级别。
+- `directories`：用于解析相对路径的搜索目录，可以提供多个目录。
+- `variables`：可选的变量映射，用于展开文本中的环境变量。
+- `respectIgnore`：是否遵循 `.gitignore` 等忽略规则。
+- `searchHidden`：是否允许搜索隐藏文件和隐藏目录。
 
-### `level`
+### 搜索级别
 
-搜索强度，从 `1` 开始。级别越高，识别范围越宽，同时可能需要更多文件系统扫描。
+`level` 从 `1` 开始，最高值可通过 `MAX_LEVEL` 获取。
 
-可以通过导出的 `MAX_LEVEL` 获取当前支持的最高级别：
+级别越高，识别范围越宽，同时可能需要更多文件系统扫描。
 
 ```ts
 import { MAX_LEVEL } from "pathprobe";
 ```
 
-### `directories`
+## 支持的路径形式
 
-用于解析相对路径的搜索根目录，可指定多个：
+例如：
 
-```ts
-const matches = await findExistingPaths(text, 2, [process.cwd(), "/another/project"]);
+```text
+/src/index.ts
+./src/index.ts
+../config/settings.js
+C:\project\src\index.ts
+\\server\share\file.txt
+file:///tmp/example.txt
+"src/types.ts"
+src/index.ts:15
+src/index.ts:15:8
 ```
 
-相对路径会分别基于这些目录进行解析。
+也支持多种变量写法，例如：
 
-### `variables`
+```text
+$HOME/project/file.txt
+${HOME}/project/file.txt
+$env:HOME/project/file.txt
+%USERPROFILE%\project\file.txt
+{{ HOME }}/project/file.txt
+${{ env.HOME }}/project/file.txt
+```
 
-可选的变量值：
+可以通过 `variables` 显式提供变量：
 
 ```ts
-await findExistingPaths("打开 $PROJECT_ROOT/src/index.ts", 2, [process.cwd()], {
+const matches = await findExistingPaths("$PROJECT_ROOT/src/index.ts", 2, [process.cwd()], {
   PROJECT_ROOT: "/workspace/project",
 });
 ```
 
-支持多种常见变量写法。
+没有在 `variables` 中提供的变量会继续尝试从 `process.env` 中读取。
+
+## 返回值
+
+每个匹配项的类型为：
+
+```ts
+interface PathMatch {
+  kind: "file" | "directory";
+  path: string;
+  position: {
+    start: number;
+    end: number;
+  };
+  location?: {
+    line: number;
+    column?: number;
+  };
+}
+```
+
+其中：
 
-未在 `variables` 中提供的变量会尝试从 `process.env` 获取。
+- `path` 是解析并标准化后的实际路径。
+- `kind` 表示目标是文件还是目录。
+- `position` 表示原始文本中路径所在的字符范围，`end` 为结束位置的后一位。
+- `location` 保存路径后附带的行号、列号信息。
 
-### `respectIgnore`
+## Ignore 与隐藏文件
 
-是否遵循忽略规则。
+默认行为由库配置决定，也可以在调用时覆盖：
 
-启用后，搜索目录中的 `.gitignore` 等规则可以阻止被忽略的路径出现在结果中。
+```ts
+await findExistingPaths(
+  text,
+  2,
+  [process.cwd()],
+  {},
+  true, // respectIgnore
+  false, // searchHidden
+);
+```
 
-### `searchHidden`
+启用 `respectIgnore` 后，搜索会考虑 Git ignore 和配置的 ignore 文件。
 
-是否搜索隐藏文件和隐藏目录。
+关闭 `searchHidden` 后，诸如 `.git/`、`.cache/` 之类的隐藏路径不会参与匹配。
 
-## 类型
+## TypeScript
 
-主要类型均可直接导入：
+库同时导出常用类型：
 
 ```ts
-import type { PathKind, PathMatch, PathPosition, SearchLevel, Variables } from "pathprobe";
+import type {
+  PathKind,
+  PathLocation,
+  PathMatch,
+  PathPosition,
+  SearchLevel,
+  Variables,
+} from "pathprobe";
 ```
 
-`pathprobe` 不负责读取文件内容；它只负责从文本中发现路径、解析路径并确认对应文件或目录是否存在。
+`pathprobe` 面向 Node.js 文件系统使用，并采用 ESM/NodeNext 模块方式。

package/dist/index.mjs

@@ -9,7 +9,7 @@ const settings = {
 	batchValidationThreshold: 48,
 	directoryScanThreshold: 2,
 	ignoreFilePatterns: ["**/.ignore", "**/.rgignore"],
-	locationSuffixPattern: /(?::\d+){1,2}$/u,
+	locationSuffixPattern: /:(?<line>\d+)(?::(?<column>\d+))?$/u,
 	respectIgnoreByDefault: true,
 	searchHiddenByDefault: false,
 	spanWordLimits: [
@@ -54,7 +54,7 @@ function expandVariables(value, variables) {
 const explicitPattern = /(?:file:\/\/\/?|[A-Za-z]:[\\/]|\\\\|\/|(?:\.{1,2}|~)[\\/])[^"'`<>()[\]{}\s]+/gu;
 const quotedPattern = /(["'`])(?<value>[^"'`\r\n]+)\1/gu;
 const tokenPattern = /[^\s]+/gu;
-const pathTokenPattern = /(?:[\p{L}\p{N}_@%$+~.#[\],-]+[\\/])+(?:[\p{L}\p{N}_@%$+~.#[\],-]+)|[\p{L}\p{N}_@%$+~.#[\],-]+\.[\p{L}\p{N}_@%$-]{1,16}(?::\d+){0,2}/gu;
+const pathTokenPattern = /(?:(?:[\p{L}\p{N}_@%$+~.#[\],-]+[\\/])+(?:[\p{L}\p{N}_@%$+~.#[\],-]+)|[\p{L}\p{N}_@%$+~.#[\],-]+\.[\p{L}\p{N}_@%$-]{1,16})(?::\d+){0,2}/gu;
 const variablePathPattern = new RegExp(`${variableReferenceSource}(?:[\\\\/][^"'\`<>()[\\]{}\\s]+)+`, "giu");
 const clausePattern = /[^\r\n!?！？;；。]+/gu;
 const pathHintPattern = /[\\/]|(?:^|[\s"'`])(?:\.{1,2}|~|%[A-Za-z_][A-Za-z0-9_]*%|\$\{?[A-Za-z_][A-Za-z0-9_]*\}?)(?:[\\/]|$)|\.[\p{L}\p{N}]{1,16}(?::\d+){0,2}(?:$|[\s,.;:!?，。；：！？、])/u;
@@ -295,21 +295,70 @@ function uniquePaths(values) {
 	for (const value of values) paths.set(pathKey(value), value);
 	return [...paths.values()];
 }
-function trimCandidate(value, preserveSyntax) {
-	let result = preserveSyntax ? value : value.trim();
-	if (result.length >= 2 && (result[0] === "\"" && result.at(-1) === "\"" || result[0] === "'" && result.at(-1) === "'" || result[0] === "`" && result.at(-1) === "`")) result = result.slice(1, -1);
-	if (!preserveSyntax) {
-		while (result.length > 0 && settings.trailingPunctuation.includes(result.at(-1) ?? "")) result = result.slice(0, -1);
-		result = result.replace(settings.locationSuffixPattern, "");
-	}
+function parseLocationPart(value, name) {
+	const result = Number(value);
+	if (!Number.isSafeInteger(result)) throw new RangeError(`${name} must be a safe integer`);
 	return result;
 }
+function prepareCandidate(candidate) {
+	let end = candidate.end;
+	let start = candidate.start;
+	let value = candidate.value;
+	if (candidate.kind !== "inventory" && candidate.kind !== "quoted") {
+		const startTrimmed = value.trimStart();
+		start += value.length - startTrimmed.length;
+		value = startTrimmed;
+		const endTrimmed = value.trimEnd();
+		end -= value.length - endTrimmed.length;
+		value = endTrimmed;
+		if (value.length >= 2 && (value[0] === "\"" && value.at(-1) === "\"" || value[0] === "'" && value.at(-1) === "'" || value[0] === "`" && value.at(-1) === "`")) {
+			start += 1;
+			end -= 1;
+			value = value.slice(1, -1);
+		}
+		while (value.length > 0 && settings.trailingPunctuation.includes(value.at(-1) ?? "")) {
+			end -= 1;
+			value = value.slice(0, -1);
+		}
+	}
+	if (candidate.kind === "inventory") return {
+		position: {
+			end,
+			start
+		},
+		value
+	};
+	const match = settings.locationSuffixPattern.exec(value);
+	if (match === null) return {
+		position: {
+			end,
+			start
+		},
+		value
+	};
+	const lineValue = match.groups?.line;
+	if (lineValue === void 0) throw new TypeError("locationSuffixPattern must capture a line");
+	const columnValue = match.groups?.column;
+	const location = columnValue === void 0 ? { line: parseLocationPart(lineValue, "line") } : {
+		column: parseLocationPart(columnValue, "column"),
+		line: parseLocationPart(lineValue, "line")
+	};
+	end -= match[0].length;
+	return {
+		location,
+		position: {
+			end,
+			start
+		},
+		value: value.slice(0, match.index)
+	};
+}
 function unescape(value) {
 	if (value.startsWith("\\\\") && !value.startsWith("\\\\\\\\")) return value;
 	return value.replace(/\\(["'`\\])/gu, "$1").replace(/\\\\/gu, "\\");
 }
-function toPaths(value, roots, variables, preserveSyntax = false) {
-	let expanded = expandVariables(trimCandidate(value, preserveSyntax), variables);
+function toPaths(value, roots, variables) {
+	let expanded = expandVariables(value, variables);
 	if (expanded.startsWith("file://")) try {
 		expanded = fileURLToPath(expanded);
 	} catch (error) {
@@ -324,15 +373,25 @@ function toPaths(value, roots, variables, preserveSyntax = false) {
 	if (nodePath.isAbsolute(expanded)) return [nodePath.normalize(expanded)];
 	return uniquePaths(roots.map((root) => nodePath.resolve(root, expanded)));
 }
+function mergeLocation(match, location) {
+	if (location === void 0) return;
+	if (match.location === void 0) {
+		match.location = location;
+		return;
+	}
+	if (match.location.line !== location.line || match.location.column !== location.column) throw new Error("Candidates for the same path and position have conflicting locations");
+}
 async function validateCandidates(candidates, roots, variables, respectIgnore, searchHidden) {
 	const resolvedCandidates = [];
 	const validationPaths = /* @__PURE__ */ new Map();
 	for (const candidate of candidates) {
-		const paths = toPaths(candidate.value, roots, variables, candidate.kind === "inventory" || candidate.kind === "quoted");
+		const prepared = prepareCandidate(candidate);
+		const paths = toPaths(prepared.value, roots, variables);
 		for (const filePath of paths) {
 			resolvedCandidates.push({
-				candidate,
-				path: filePath
+				...prepared.location === void 0 ? {} : { location: prepared.location },
+				path: filePath,
+				position: prepared.position
 			});
 			validationPaths.set(pathKey(filePath), filePath);
 		}
@@ -341,17 +400,24 @@ async function validateCandidates(candidates, roots, variables, respectIgnore, s
 	if (respectIgnore || !searchHidden) searchablePaths = [...await filterSearchablePaths(searchablePaths, roots, respectIgnore, searchHidden)];
 	const classifiedPaths = await classifyExistingPaths(searchablePaths, roots);
 	const kindsByPath = new Map([...classifiedPaths].map(([filePath, kind]) => [pathKey(filePath), kind]));
-	return resolvedCandidates.flatMap(({ candidate, path }) => {
+	const matches = /* @__PURE__ */ new Map();
+	for (const { location, path, position } of resolvedCandidates) {
 		const kind = kindsByPath.get(pathKey(path));
-		return kind === void 0 ? [] : [{
+		if (kind === void 0) continue;
+		const key = `${pathKey(path)}\0${position.start}\0${position.end}`;
+		const existing = matches.get(key);
+		if (existing !== void 0) {
+			mergeLocation(existing, location);
+			continue;
+		}
+		matches.set(key, {
 			kind,
+			...location === void 0 ? {} : { location },
 			path,
-			position: {
-				end: candidate.end,
-				start: candidate.start
-			}
-		}];
-	});
+			position
+		});
+	}
+	return [...matches.values()];
 }
 //#endregion
 //#region src/inventory.ts

package/dist/index.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"index.mjs","names":["pathKey","pathKey"],"sources":["../config/settings.ts","../src/variables.ts","../src/candidates.ts","../src/existence.ts","../src/policy.ts","../src/filesystem.ts","../src/inventory.ts","../src/index.ts"],"sourcesContent":["import type { SearchSettings } from \"../src/types.js\";\n\nexport const settings: SearchSettings = {\n  batchValidationThreshold: 48,\n  directoryScanThreshold: 2,\n  ignoreFilePatterns: [\"**/.ignore\", \"**/.rgignore\"],\n  locationSuffixPattern: /(?::\\d+){1,2}$/u,\n  respectIgnoreByDefault: true,\n  searchHiddenByDefault: false,\n  spanWordLimits: [3, 8, 24],\n  trailingPunctuation: \".,;:!?，。；：！？、\",\n  validationConcurrency: 32,\n};\n","import type { Variables } from \"./types.js\";\n\nconst nameSource = String.raw`[A-Za-z_][A-Za-z0-9_.-]*`;\nexport const variableReferenceSource = String.raw`(?:\\$\\{\\{\\s*(?:(?:env|vars|variables)[.:])?${nameSource}\\s*\\}\\}|\\{\\{\\s*${nameSource}\\s*\\}\\}|\\$\\{(?:env[.:])?${nameSource}\\}|\\$env:${nameSource}|\\$[A-Za-z_][A-Za-z0-9_]*|%${nameSource}%|!${nameSource}!|\\$\\(\\s*${nameSource}\\s*\\)|@${nameSource}@)`;\nconst expressionPatterns = [\n  new RegExp(String.raw`\\$\\{\\{\\s*(?:(?:env|vars|variables)[.:])?(${nameSource})\\s*\\}\\}`, \"giu\"),\n  new RegExp(String.raw`\\{\\{\\s*(${nameSource})\\s*\\}\\}`, \"gu\"),\n  new RegExp(String.raw`\\$\\{(?:env[.:])?(${nameSource})\\}`, \"giu\"),\n  new RegExp(String.raw`\\$env:(${nameSource})`, \"giu\"),\n  new RegExp(String.raw`\\$(?!env:)([A-Za-z_][A-Za-z0-9_]*)`, \"giu\"),\n  new RegExp(String.raw`%(${nameSource})%`, \"gu\"),\n  new RegExp(String.raw`!(${nameSource})!`, \"gu\"),\n  new RegExp(String.raw`\\$\\(\\s*(${nameSource})\\s*\\)`, \"gu\"),\n  new RegExp(String.raw`@(${nameSource})@`, \"gu\"),\n];\nfunction resolveVariable(name: string, variables: Variables): string | undefined {\n  const direct = variables[name] ?? process.env[name];\n  if (direct !== undefined) {\n    return direct;\n  }\n  const unscoped = /^(?:env|vars|variables)[.:](.+)$/iu.exec(name)?.[1];\n  return unscoped === undefined ? undefined : (variables[unscoped] ?? process.env[unscoped]);\n}\nexport function expandVariables(value: string, variables: Variables): string {\n  let result = value;\n  for (const pattern of expressionPatterns) {\n    result = result.replace(pattern, (match, name: string) => {\n      const replacement = resolveVariable(name, variables);\n      return replacement === undefined ? match : replacement;\n    });\n  }\n  return result;\n}\n","import type { Candidate, SearchLevel } from \"./types.js\";\nimport { settings } from \"../config/settings.js\";\nimport { variableReferenceSource } from \"./variables.js\";\n\nconst explicitPattern =\n  /(?:file:\\/\\/\\/?|[A-Za-z]:[\\\\/]|\\\\\\\\|\\/|(?:\\.{1,2}|~)[\\\\/])[^\"'`<>()[\\]{}\\s]+/gu;\nconst quotedPattern = /([\"'`])(?<value>[^\"'`\\r\\n]+)\\1/gu;\nconst tokenPattern = /[^\\s]+/gu;\nconst pathTokenPattern =\n  /(?:[\\p{L}\\p{N}_@%$+~.#[\\],-]+[\\\\/])+(?:[\\p{L}\\p{N}_@%$+~.#[\\],-]+)|[\\p{L}\\p{N}_@%$+~.#[\\],-]+\\.[\\p{L}\\p{N}_@%$-]{1,16}(?::\\d+){0,2}/gu;\nconst unquotedPathCharacterSource = \"[^\\\"'`<>()[\\\\]{}\\\\s]\";\nconst variablePathPattern = new RegExp(\n  `${variableReferenceSource}(?:[\\\\\\\\/]${unquotedPathCharacterSource}+)+`,\n  \"giu\",\n);\nconst clausePattern = /[^\\r\\n!?！？;；。]+/gu;\nconst pathHintPattern =\n  /[\\\\/]|(?:^|[\\s\"'`])(?:\\.{1,2}|~|%[A-Za-z_][A-Za-z0-9_]*%|\\$\\{?[A-Za-z_][A-Za-z0-9_]*\\}?)(?:[\\\\/]|$)|\\.[\\p{L}\\p{N}]{1,16}(?::\\d+){0,2}(?:$|[\\s,.;:!?，。；：！？、])/u;\nconst variableHintPattern = new RegExp(String.raw`${variableReferenceSource}(?:[\\\\/]|$)`, \"iu\");\nfunction add(\n  result: Candidate[],\n  seen: Set<string>,\n  value: string,\n  start: number,\n  end: number,\n  kind: Candidate[\"kind\"],\n): void {\n  if (value.length === 0) {\n    return;\n  }\n  const key = `${start}:${end}:${value}`;\n  if (!seen.has(key)) {\n    seen.add(key);\n    result.push({ end, kind, start, value });\n  }\n}\nfunction addMatches(\n  result: Candidate[],\n  seen: Set<string>,\n  text: string,\n  pattern: RegExp,\n  kind: Candidate[\"kind\"],\n): void {\n  for (const match of text.matchAll(pattern)) {\n    const value = match[0];\n    const start = match.index ?? 0;\n    add(result, seen, value, start, start + value.length, kind);\n  }\n}\nfunction addQuotedMatches(result: Candidate[], seen: Set<string>, text: string): void {\n  for (const match of text.matchAll(quotedPattern)) {\n    const value = match.groups?.value;\n    if (value === undefined) {\n      continue;\n    }\n    const start = (match.index ?? 0) + match[0].indexOf(value);\n    add(result, seen, value, start, start + value.length, \"quoted\");\n  }\n}\nfunction addSpanMatches(\n  result: Candidate[],\n  seen: Set<string>,\n  text: string,\n  maximumWords: number,\n): void {\n  for (const clause of text.matchAll(clausePattern)) {\n    const clauseStart = clause.index ?? 0;\n    const clauseText = clause[0];\n    const tokens = [...clauseText.matchAll(tokenPattern)].map((token) => ({\n      end: clauseStart + (token.index ?? 0) + token[0].length,\n      hint: Number(pathHintPattern.test(token[0]) || variableHintPattern.test(token[0])),\n      start: clauseStart + (token.index ?? 0),\n      value: token[0],\n    }));\n    const hintCounts = [0];\n    for (const token of tokens) {\n      hintCounts.push((hintCounts.at(-1) ?? 0) + token.hint);\n    }\n    for (let start = 0; start < tokens.length; start += 1) {\n      const last = Math.min(tokens.length, start + maximumWords);\n      for (let end = start + 1; end <= last; end += 1) {\n        const firstToken = tokens[start];\n        const lastToken = tokens[end - 1];\n        const hintsBefore = hintCounts[start];\n        const hintsAfter = hintCounts[end];\n        if (\n          firstToken === undefined ||\n          lastToken === undefined ||\n          hintsBefore === undefined ||\n          hintsAfter === undefined ||\n          hintsBefore === hintsAfter\n        ) {\n          continue;\n        }\n        const value = text.slice(firstToken.start, lastToken.end);\n        if (pathHintPattern.test(value)) {\n          add(result, seen, value, firstToken.start, lastToken.end, \"span\");\n        }\n      }\n    }\n  }\n}\nexport function extractCandidates(text: string, level: SearchLevel): Candidate[] {\n  const result: Candidate[] = [];\n  const seen = new Set<string>();\n  addQuotedMatches(result, seen, text);\n  addMatches(result, seen, text, explicitPattern, \"explicit\");\n  if (level >= 2) {\n    addMatches(result, seen, text, variablePathPattern, \"heuristic\");\n    addMatches(result, seen, text, pathTokenPattern, \"heuristic\");\n  }\n  if (level >= 3) {\n    const maximumWords =\n      settings.spanWordLimits[Math.min(level - 3, settings.spanWordLimits.length - 1)];\n    if (maximumWords === undefined) {\n      throw new RangeError(\"No text-span level is configured\");\n    }\n    addSpanMatches(result, seen, text, maximumWords);\n  }\n  return result;\n}\n","import { readdir, stat } from \"node:fs/promises\";\nimport nodePath from \"node:path\";\nimport pLimit from \"p-limit\";\nimport { settings } from \"../config/settings.js\";\nimport type { PathKind } from \"./types.js\";\n\nconst knownFileErrors = new Set([\n  \"EACCES\",\n  \"ELOOP\",\n  \"ENAMETOOLONG\",\n  \"ENOTDIR\",\n  \"ENOENT\",\n  \"EPERM\",\n  \"EINVAL\",\n]);\nfunction pathKey(value: string): string {\n  return process.platform === \"win32\" ? value.toLowerCase() : value;\n}\nfunction isKnownFileError(error: unknown): boolean {\n  return (\n    error instanceof Error &&\n    \"code\" in error &&\n    typeof error.code === \"string\" &&\n    knownFileErrors.has(error.code)\n  );\n}\nasync function classifyPath(filePath: string): Promise<PathKind | undefined> {\n  try {\n    const pathStats = await stat(filePath);\n    if (pathStats.isFile()) {\n      return \"file\";\n    }\n    return pathStats.isDirectory() ? \"directory\" : undefined;\n  } catch (error) {\n    if (isKnownFileError(error)) {\n      return undefined;\n    }\n    throw error;\n  }\n}\nasync function classifyAndAdd(found: Map<string, PathKind>, filePath: string): Promise<void> {\n  const kind = await classifyPath(filePath);\n  if (kind !== undefined) {\n    found.set(filePath, kind);\n  }\n}\nexport async function classifyExistingPaths(\n  paths: readonly string[],\n  roots: readonly string[],\n): Promise<Map<string, PathKind>> {\n  const found = new Map<string, PathKind>();\n  const limit = pLimit(settings.validationConcurrency);\n  if (paths.length < settings.batchValidationThreshold) {\n    await Promise.all(paths.map((filePath) => limit(() => classifyAndAdd(found, filePath))));\n    return found;\n  }\n  const rootKeys = new Set(roots.map(pathKey));\n  const pathsByParent = new Map<string, { parent: string; paths: string[] }>();\n  for (const filePath of paths) {\n    if (rootKeys.has(pathKey(filePath))) {\n      found.set(filePath, \"directory\");\n      continue;\n    }\n    const parent = nodePath.dirname(filePath);\n    const key = pathKey(parent);\n    const group = pathsByParent.get(key) ?? { parent, paths: [] };\n    group.paths.push(filePath);\n    pathsByParent.set(key, group);\n  }\n  const directPaths: string[] = [];\n  const scannedGroups: { parent: string; paths: string[] }[] = [];\n  for (const group of pathsByParent.values()) {\n    if (group.paths.length < settings.directoryScanThreshold) {\n      directPaths.push(...group.paths);\n    } else {\n      scannedGroups.push(group);\n    }\n  }\n  await Promise.all([\n    ...directPaths.map((filePath) => limit(() => classifyAndAdd(found, filePath))),\n    ...scannedGroups.map(({ parent, paths: groupPaths }) =>\n      limit(async () => {\n        let entries;\n        try {\n          entries = await readdir(parent, { withFileTypes: true });\n        } catch (error) {\n          if (isKnownFileError(error)) {\n            return;\n          }\n          throw error;\n        }\n        const entriesByName = new Map(entries.map((entry) => [pathKey(entry.name), entry]));\n        await Promise.all(\n          groupPaths.map(async (filePath) => {\n            const name = nodePath.basename(filePath);\n            const entry = entriesByName.get(pathKey(name));\n            if (entry?.isFile()) {\n              found.set(filePath, \"file\");\n            } else if (entry?.isDirectory()) {\n              found.set(filePath, \"directory\");\n            } else if (\n              entry !== undefined ||\n              (process.platform === \"win32\" && name.includes(\":\"))\n            ) {\n              await classifyAndAdd(found, filePath);\n            }\n          }),\n        );\n      }),\n    ),\n  ]);\n  return found;\n}\n","import { stat } from \"node:fs/promises\";\nimport nodePath from \"node:path\";\nimport fastGlob from \"fast-glob\";\nimport { convertPathToPattern, globby } from \"globby\";\nimport { settings } from \"../config/settings.js\";\n\nfunction pathKey(value: string): string {\n  return process.platform === \"win32\" ? value.toLowerCase() : value;\n}\nfunction isWithinRoot(filePath: string, root: string): boolean {\n  const relative = nodePath.relative(root, filePath);\n  return (\n    relative === \"\" ||\n    (relative !== \"..\" &&\n      !relative.startsWith(`..${nodePath.sep}`) &&\n      !nodePath.isAbsolute(relative))\n  );\n}\nfunction isHidden(relativePath: string): boolean {\n  return relativePath.split(/[\\\\/]/u).some((part) => part.length > 1 && part.startsWith(\".\"));\n}\nfunction traversalOptions(root: string, searchHidden: boolean) {\n  return {\n    caseSensitiveMatch: process.platform !== \"win32\",\n    cwd: root,\n    dot: searchHidden,\n    followSymbolicLinks: false,\n    onlyFiles: false,\n    unique: true,\n  } as const;\n}\nfunction globbyOptions(root: string, respectIgnore: boolean, searchHidden: boolean) {\n  return {\n    ...traversalOptions(root, searchHidden),\n    expandDirectories: false,\n    gitignore: respectIgnore,\n    globalGitignore: respectIgnore,\n    ...(respectIgnore ? { ignoreFiles: settings.ignoreFilePatterns } : {}),\n  } as const;\n}\nexport async function resolveSearchDirectories(directories: readonly string[]): Promise<string[]> {\n  if (!Array.isArray(directories)) {\n    throw new TypeError(\"directories must be an array\");\n  }\n  if (directories.length === 0) {\n    throw new RangeError(\"directories must not be empty\");\n  }\n  const unique = new Map<string, string>();\n  for (const directory of directories) {\n    if (typeof directory !== \"string\" || directory.length === 0) {\n      throw new TypeError(\"every directory must be a non-empty string\");\n    }\n    const resolved = nodePath.resolve(directory);\n    unique.set(pathKey(resolved), resolved);\n  }\n  await Promise.all(\n    [...unique.values()].map(async (directory) => {\n      if (!(await stat(directory)).isDirectory()) {\n        throw new TypeError(`${directory} is not a directory`);\n      }\n    }),\n  );\n  return [...unique.values()];\n}\nexport async function listSearchEntries(\n  root: string,\n  respectIgnore: boolean,\n  searchHidden: boolean,\n): Promise<string[]> {\n  if (!respectIgnore) {\n    return fastGlob(\"**/*\", traversalOptions(root, searchHidden));\n  }\n  return globby(\"**/*\", globbyOptions(root, respectIgnore, searchHidden));\n}\nexport async function filterSearchablePaths(\n  paths: readonly string[],\n  roots: readonly string[],\n  respectIgnore: boolean,\n  searchHidden: boolean,\n): Promise<Set<string>> {\n  const allowed = new Set<string>();\n  const pathsByRoot = new Map<string, string[]>();\n  for (const filePath of paths) {\n    let hasSearchRoot = false;\n    for (const root of roots) {\n      if (!isWithinRoot(filePath, root)) {\n        continue;\n      }\n      hasSearchRoot = true;\n      const relative = nodePath.relative(root, filePath);\n      if (!searchHidden && isHidden(relative)) {\n        continue;\n      }\n      if (relative === \"\" || !respectIgnore) {\n        allowed.add(filePath);\n      } else {\n        const grouped = pathsByRoot.get(root) ?? [];\n        grouped.push(relative);\n        pathsByRoot.set(root, grouped);\n      }\n    }\n    if (hasSearchRoot) {\n      continue;\n    }\n    const filesystemRelative = nodePath.relative(nodePath.parse(filePath).root, filePath);\n    if (searchHidden || !isHidden(filesystemRelative)) {\n      allowed.add(filePath);\n    }\n  }\n  await Promise.all(\n    [...pathsByRoot].map(async ([root, relativePaths]) => {\n      const patterns = relativePaths.map(convertPathToPattern);\n      const matches = await globby(patterns, {\n        ...globbyOptions(root, true, true),\n        absolute: true,\n      });\n      for (const match of matches) {\n        allowed.add(nodePath.normalize(match));\n      }\n    }),\n  );\n  return allowed;\n}\n","import { fileURLToPath } from \"node:url\";\nimport nodePath from \"node:path\";\nimport { classifyExistingPaths } from \"./existence.js\";\nimport { filterSearchablePaths } from \"./policy.js\";\nimport { expandVariables } from \"./variables.js\";\nimport { settings } from \"../config/settings.js\";\nimport type { Candidate, PathMatch, Variables } from \"./types.js\";\n\ninterface ResolvedCandidate {\n  candidate: Candidate;\n  path: string;\n}\nfunction pathKey(value: string): string {\n  return process.platform === \"win32\" ? value.toLowerCase() : value;\n}\nfunction uniquePaths(values: Iterable<string>): string[] {\n  const paths = new Map<string, string>();\n  for (const value of values) {\n    paths.set(pathKey(value), value);\n  }\n  return [...paths.values()];\n}\nfunction trimCandidate(value: string, preserveSyntax: boolean): string {\n  let result = preserveSyntax ? value : value.trim();\n  if (\n    result.length >= 2 &&\n    ((result[0] === '\"' && result.at(-1) === '\"') ||\n      (result[0] === \"'\" && result.at(-1) === \"'\") ||\n      (result[0] === \"`\" && result.at(-1) === \"`\"))\n  ) {\n    result = result.slice(1, -1);\n  }\n  if (!preserveSyntax) {\n    while (result.length > 0 && settings.trailingPunctuation.includes(result.at(-1) ?? \"\")) {\n      result = result.slice(0, -1);\n    }\n\n    result = result.replace(settings.locationSuffixPattern, \"\");\n  }\n  return result;\n}\nfunction unescape(value: string): string {\n  if (value.startsWith(\"\\\\\\\\\") && !value.startsWith(\"\\\\\\\\\\\\\\\\\")) {\n    return value;\n  }\n  return value.replace(/\\\\([\"'`\\\\])/gu, \"$1\").replace(/\\\\\\\\/gu, \"\\\\\");\n}\nfunction toPaths(\n  value: string,\n  roots: readonly string[],\n  variables: Variables,\n  preserveSyntax = false,\n): string[] {\n  let expanded = expandVariables(trimCandidate(value, preserveSyntax), variables);\n  if (expanded.startsWith(\"file://\")) {\n    try {\n      expanded = fileURLToPath(expanded);\n    } catch (error) {\n      if (error instanceof TypeError) {\n        return [];\n      }\n      throw error;\n    }\n  } else {\n    expanded = unescape(expanded);\n    if (expanded === \"~\" || /^~[\\\\/]/u.test(expanded)) {\n      expanded = nodePath.join(\n        variables.HOME ??\n          variables.USERPROFILE ??\n          process.env.HOME ??\n          process.env.USERPROFILE ??\n          \"\",\n        expanded.slice(2),\n      );\n    }\n  }\n  if (expanded.length === 0) {\n    return [];\n  }\n  if (nodePath.isAbsolute(expanded)) {\n    return [nodePath.normalize(expanded)];\n  }\n  return uniquePaths(roots.map((root) => nodePath.resolve(root, expanded)));\n}\nexport async function validateCandidates(\n  candidates: Candidate[],\n  roots: readonly string[],\n  variables: Variables,\n  respectIgnore: boolean,\n  searchHidden: boolean,\n): Promise<PathMatch[]> {\n  const resolvedCandidates: ResolvedCandidate[] = [];\n  const validationPaths = new Map<string, string>();\n  for (const candidate of candidates) {\n    const paths = toPaths(\n      candidate.value,\n      roots,\n      variables,\n      candidate.kind === \"inventory\" || candidate.kind === \"quoted\",\n    );\n    for (const filePath of paths) {\n      resolvedCandidates.push({ candidate, path: filePath });\n      validationPaths.set(pathKey(filePath), filePath);\n    }\n  }\n  let searchablePaths = [...validationPaths.values()];\n  if (respectIgnore || !searchHidden) {\n    searchablePaths = [\n      ...(await filterSearchablePaths(searchablePaths, roots, respectIgnore, searchHidden)),\n    ];\n  }\n  const classifiedPaths = await classifyExistingPaths(searchablePaths, roots);\n  const kindsByPath = new Map(\n    [...classifiedPaths].map(([filePath, kind]) => [pathKey(filePath), kind]),\n  );\n  return resolvedCandidates.flatMap(({ candidate, path }) => {\n    const kind = kindsByPath.get(pathKey(path));\n    return kind === undefined\n      ? []\n      : [\n          {\n            kind,\n            path,\n            position: {\n              end: candidate.end,\n              start: candidate.start,\n            },\n          },\n        ];\n  });\n}\n","import nodePath from \"node:path\";\nimport { listSearchEntries } from \"./policy.js\";\nimport type { Candidate } from \"./types.js\";\n\nfunction isBoundary(value: string | undefined, following: string | undefined): boolean {\n  if (value === \".\") {\n    return following === undefined || !/[\\p{L}\\p{N}_-]/u.test(following);\n  }\n  return value === undefined || !/[\\p{L}\\p{N}_/\\\\-]/u.test(value);\n}\nfunction addOccurrences(\n  result: Candidate[],\n  seen: Set<string>,\n  source: string,\n  text: string,\n  value: string,\n): void {\n  const target = process.platform === \"win32\" ? value.toLowerCase() : value;\n  let offset = source.indexOf(target);\n  while (offset !== -1) {\n    const end = offset + target.length;\n    if (isBoundary(text[offset - 1], text[offset]) && isBoundary(text[end], text[end + 1])) {\n      const key = `${offset}:${end}:${text.slice(offset, end)}`;\n      if (!seen.has(key)) {\n        seen.add(key);\n        result.push({\n          end,\n          kind: \"inventory\",\n          start: offset,\n          value,\n        });\n      }\n    }\n    offset = source.indexOf(target, offset + 1);\n  }\n}\nexport async function inventoryCandidates(\n  text: string,\n  roots: readonly string[],\n  respectIgnore: boolean,\n  searchHidden: boolean,\n): Promise<Candidate[]> {\n  const entries = await Promise.all(\n    roots.map((root) => listSearchEntries(root, respectIgnore, searchHidden)),\n  );\n  const result: Candidate[] = [];\n  const seen = new Set<string>();\n  const scanned = new Set<string>();\n  const source = process.platform === \"win32\" ? text.toLowerCase() : text;\n  for (const [rootIndex, relativeEntries] of entries.entries()) {\n    const root = roots[rootIndex];\n    if (root === undefined) {\n      continue;\n    }\n    for (const relativeEntry of relativeEntries) {\n      const absoluteEntry = nodePath.resolve(root, relativeEntry);\n      const variants = [\n        relativeEntry,\n        relativeEntry.replaceAll(\"/\", nodePath.sep),\n        absoluteEntry,\n        absoluteEntry.replaceAll(nodePath.sep, \"/\"),\n      ];\n      for (const value of variants) {\n        const key = process.platform === \"win32\" ? value.toLowerCase() : value;\n        if (!scanned.has(key)) {\n          scanned.add(key);\n          addOccurrences(result, seen, source, text, value);\n        }\n      }\n    }\n  }\n  return result;\n}\n","import { extractCandidates } from \"./candidates.js\";\nimport { validateCandidates } from \"./filesystem.js\";\nimport { inventoryCandidates } from \"./inventory.js\";\nimport { resolveSearchDirectories } from \"./policy.js\";\nimport { settings } from \"../config/settings.js\";\nimport type { PathMatch, SearchLevel, Variables } from \"./types.js\";\n\nexport const MAX_LEVEL = settings.spanWordLimits.length + 3;\nfunction validateVariables(value: unknown): asserts value is Variables {\n  if (\n    typeof value !== \"object\" ||\n    value === null ||\n    Array.isArray(value) ||\n    Object.values(value).some((item) => typeof item !== \"string\")\n  ) {\n    throw new TypeError(\"variables must be an object of string values\");\n  }\n}\nexport async function findExistingPaths(\n  text: string,\n  level: SearchLevel,\n  directories: readonly string[],\n  variables: Variables = {},\n  respectIgnore: boolean = settings.respectIgnoreByDefault,\n  searchHidden: boolean = settings.searchHiddenByDefault,\n): Promise<PathMatch[]> {\n  if (typeof text !== \"string\") {\n    throw new TypeError(\"text must be a string\");\n  }\n  if (!Number.isInteger(level) || level < 1 || level > MAX_LEVEL) {\n    throw new RangeError(`level must be an integer from 1 to ${MAX_LEVEL}`);\n  }\n  validateVariables(variables);\n  if (typeof respectIgnore !== \"boolean\") {\n    throw new TypeError(\"respectIgnore must be a boolean\");\n  }\n  if (typeof searchHidden !== \"boolean\") {\n    throw new TypeError(\"searchHidden must be a boolean\");\n  }\n  const roots = await resolveSearchDirectories(directories);\n  const candidates = extractCandidates(text, level);\n  if (level === MAX_LEVEL) {\n    candidates.push(...(await inventoryCandidates(text, roots, respectIgnore, searchHidden)));\n  }\n  return validateCandidates(candidates, roots, variables, respectIgnore, searchHidden);\n}\nexport type { PathKind, PathMatch, PathPosition, SearchLevel, Variables } from \"./types.js\";\n"],"mappings":";;;;;;;AAEA,MAAa,WAA2B;CACtC,0BAA0B;CAC1B,wBAAwB;CACxB,oBAAoB,CAAC,cAAc,cAAc;CACjD,uBAAuB;CACvB,wBAAwB;CACxB,uBAAuB;CACvB,gBAAgB;EAAC;EAAG;EAAG;CAAE;CACzB,qBAAqB;CACrB,uBAAuB;AACzB;;;ACVA,MAAM,aAAa,OAAO,GAAG;AAC7B,MAAa,0BAA0B,OAAO,GAAG,8CAA8C,WAAW,iBAAiB,WAAW,0BAA0B,WAAW,WAAW,WAAW,6BAA6B,WAAW,KAAK,WAAW,WAAW,WAAW,SAAS,WAAW;AACnS,MAAM,qBAAqB;CACzB,IAAI,OAAO,OAAO,GAAG,4CAA4C,WAAW,WAAW,KAAK;CAC5F,IAAI,OAAO,OAAO,GAAG,WAAW,WAAW,WAAW,IAAI;CAC1D,IAAI,OAAO,OAAO,GAAG,oBAAoB,WAAW,MAAM,KAAK;CAC/D,IAAI,OAAO,OAAO,GAAG,UAAU,WAAW,IAAI,KAAK;CACnD,IAAI,OAAO,OAAO,GAAG,sCAAsC,KAAK;CAChE,IAAI,OAAO,OAAO,GAAG,KAAK,WAAW,KAAK,IAAI;CAC9C,IAAI,OAAO,OAAO,GAAG,KAAK,WAAW,KAAK,IAAI;CAC9C,IAAI,OAAO,OAAO,GAAG,WAAW,WAAW,SAAS,IAAI;CACxD,IAAI,OAAO,OAAO,GAAG,KAAK,WAAW,KAAK,IAAI;AAChD;AACA,SAAS,gBAAgB,MAAc,WAA0C;CAC/E,MAAM,SAAS,UAAU,SAAS,QAAQ,IAAI;CAC9C,IAAI,WAAW,KAAA,GACb,OAAO;CAET,MAAM,WAAW,qCAAqC,KAAK,IAAI,CAAC,GAAG;CACnE,OAAO,aAAa,KAAA,IAAY,KAAA,IAAa,UAAU,aAAa,QAAQ,IAAI;AAClF;AACA,SAAgB,gBAAgB,OAAe,WAA8B;CAC3E,IAAI,SAAS;CACb,KAAK,MAAM,WAAW,oBACpB,SAAS,OAAO,QAAQ,UAAU,OAAO,SAAiB;EACxD,MAAM,cAAc,gBAAgB,MAAM,SAAS;EACnD,OAAO,gBAAgB,KAAA,IAAY,QAAQ;CAC7C,CAAC;CAEH,OAAO;AACT;;;AC5BA,MAAM,kBACJ;AACF,MAAM,gBAAgB;AACtB,MAAM,eAAe;AACrB,MAAM,mBACJ;AAEF,MAAM,sBAAsB,IAAI,OAC9B,GAAG,wBAAwB,oCAC3B,KACF;AACA,MAAM,gBAAgB;AACtB,MAAM,kBACJ;AACF,MAAM,sBAAsB,IAAI,OAAO,OAAO,GAAG,GAAG,wBAAwB,cAAc,IAAI;AAC9F,SAAS,IACP,QACA,MACA,OACA,OACA,KACA,MACM;CACN,IAAI,MAAM,WAAW,GACnB;CAEF,MAAM,MAAM,GAAG,MAAM,GAAG,IAAI,GAAG;CAC/B,IAAI,CAAC,KAAK,IAAI,GAAG,GAAG;EAClB,KAAK,IAAI,GAAG;EACZ,OAAO,KAAK;GAAE;GAAK;GAAM;GAAO;EAAM,CAAC;CACzC;AACF;AACA,SAAS,WACP,QACA,MACA,MACA,SACA,MACM;CACN,KAAK,MAAM,SAAS,KAAK,SAAS,OAAO,GAAG;EAC1C,MAAM,QAAQ,MAAM;EACpB,MAAM,QAAQ,MAAM,SAAS;EAC7B,IAAI,QAAQ,MAAM,OAAO,OAAO,QAAQ,MAAM,QAAQ,IAAI;CAC5D;AACF;AACA,SAAS,iBAAiB,QAAqB,MAAmB,MAAoB;CACpF,KAAK,MAAM,SAAS,KAAK,SAAS,aAAa,GAAG;EAChD,MAAM,QAAQ,MAAM,QAAQ;EAC5B,IAAI,UAAU,KAAA,GACZ;EAEF,MAAM,SAAS,MAAM,SAAS,KAAK,MAAM,EAAE,CAAC,QAAQ,KAAK;EACzD,IAAI,QAAQ,MAAM,OAAO,OAAO,QAAQ,MAAM,QAAQ,QAAQ;CAChE;AACF;AACA,SAAS,eACP,QACA,MACA,MACA,cACM;CACN,KAAK,MAAM,UAAU,KAAK,SAAS,aAAa,GAAG;EACjD,MAAM,cAAc,OAAO,SAAS;EAEpC,MAAM,SAAS,CAAC,GADG,OAAO,EACG,CAAC,SAAS,YAAY,CAAC,CAAC,CAAC,KAAK,WAAW;GACpE,KAAK,eAAe,MAAM,SAAS,KAAK,MAAM,EAAE,CAAC;GACjD,MAAM,OAAO,gBAAgB,KAAK,MAAM,EAAE,KAAK,oBAAoB,KAAK,MAAM,EAAE,CAAC;GACjF,OAAO,eAAe,MAAM,SAAS;GACrC,OAAO,MAAM;EACf,EAAE;EACF,MAAM,aAAa,CAAC,CAAC;EACrB,KAAK,MAAM,SAAS,QAClB,WAAW,MAAM,WAAW,GAAG,EAAE,KAAK,KAAK,MAAM,IAAI;EAEvD,KAAK,IAAI,QAAQ,GAAG,QAAQ,OAAO,QAAQ,SAAS,GAAG;GACrD,MAAM,OAAO,KAAK,IAAI,OAAO,QAAQ,QAAQ,YAAY;GACzD,KAAK,IAAI,MAAM,QAAQ,GAAG,OAAO,MAAM,OAAO,GAAG;IAC/C,MAAM,aAAa,OAAO;IAC1B,MAAM,YAAY,OAAO,MAAM;IAC/B,MAAM,cAAc,WAAW;IAC/B,MAAM,aAAa,WAAW;IAC9B,IACE,eAAe,KAAA,KACf,cAAc,KAAA,KACd,gBAAgB,KAAA,KAChB,eAAe,KAAA,KACf,gBAAgB,YAEhB;IAEF,MAAM,QAAQ,KAAK,MAAM,WAAW,OAAO,UAAU,GAAG;IACxD,IAAI,gBAAgB,KAAK,KAAK,GAC5B,IAAI,QAAQ,MAAM,OAAO,WAAW,OAAO,UAAU,KAAK,MAAM;GAEpE;EACF;CACF;AACF;AACA,SAAgB,kBAAkB,MAAc,OAAiC;CAC/E,MAAM,SAAsB,CAAC;CAC7B,MAAM,uBAAO,IAAI,IAAY;CAC7B,iBAAiB,QAAQ,MAAM,IAAI;CACnC,WAAW,QAAQ,MAAM,MAAM,iBAAiB,UAAU;CAC1D,IAAI,SAAS,GAAG;EACd,WAAW,QAAQ,MAAM,MAAM,qBAAqB,WAAW;EAC/D,WAAW,QAAQ,MAAM,MAAM,kBAAkB,WAAW;CAC9D;CACA,IAAI,SAAS,GAAG;EACd,MAAM,eACJ,SAAS,eAAe,KAAK,IAAI,QAAQ,GAAG,SAAS,eAAe,SAAS,CAAC;EAChF,IAAI,iBAAiB,KAAA,GACnB,MAAM,IAAI,WAAW,kCAAkC;EAEzD,eAAe,QAAQ,MAAM,MAAM,YAAY;CACjD;CACA,OAAO;AACT;;;AClHA,MAAM,kCAAkB,IAAI,IAAI;CAC9B;CACA;CACA;CACA;CACA;CACA;CACA;AACF,CAAC;AACD,SAASA,UAAQ,OAAuB;CACtC,OAAO,QAAQ,aAAa,UAAU,MAAM,YAAY,IAAI;AAC9D;AACA,SAAS,iBAAiB,OAAyB;CACjD,OACE,iBAAiB,SACjB,UAAU,SACV,OAAO,MAAM,SAAS,YACtB,gBAAgB,IAAI,MAAM,IAAI;AAElC;AACA,eAAe,aAAa,UAAiD;CAC3E,IAAI;EACF,MAAM,YAAY,MAAM,KAAK,QAAQ;EACrC,IAAI,UAAU,OAAO,GACnB,OAAO;EAET,OAAO,UAAU,YAAY,IAAI,cAAc,KAAA;CACjD,SAAS,OAAO;EACd,IAAI,iBAAiB,KAAK,GACxB;EAEF,MAAM;CACR;AACF;AACA,eAAe,eAAe,OAA8B,UAAiC;CAC3F,MAAM,OAAO,MAAM,aAAa,QAAQ;CACxC,IAAI,SAAS,KAAA,GACX,MAAM,IAAI,UAAU,IAAI;AAE5B;AACA,eAAsB,sBACpB,OACA,OACgC;CAChC,MAAM,wBAAQ,IAAI,IAAsB;CACxC,MAAM,QAAQ,OAAO,SAAS,qBAAqB;CACnD,IAAI,MAAM,SAAS,SAAS,0BAA0B;EACpD,MAAM,QAAQ,IAAI,MAAM,KAAK,aAAa,YAAY,eAAe,OAAO,QAAQ,CAAC,CAAC,CAAC;EACvF,OAAO;CACT;CACA,MAAM,WAAW,IAAI,IAAI,MAAM,IAAIA,SAAO,CAAC;CAC3C,MAAM,gCAAgB,IAAI,IAAiD;CAC3E,KAAK,MAAM,YAAY,OAAO;EAC5B,IAAI,SAAS,IAAIA,UAAQ,QAAQ,CAAC,GAAG;GACnC,MAAM,IAAI,UAAU,WAAW;GAC/B;EACF;EACA,MAAM,SAAS,SAAS,QAAQ,QAAQ;EACxC,MAAM,MAAMA,UAAQ,MAAM;EAC1B,MAAM,QAAQ,cAAc,IAAI,GAAG,KAAK;GAAE;GAAQ,OAAO,CAAC;EAAE;EAC5D,MAAM,MAAM,KAAK,QAAQ;EACzB,cAAc,IAAI,KAAK,KAAK;CAC9B;CACA,MAAM,cAAwB,CAAC;CAC/B,MAAM,gBAAuD,CAAC;CAC9D,KAAK,MAAM,SAAS,cAAc,OAAO,GACvC,IAAI,MAAM,MAAM,SAAS,SAAS,wBAChC,YAAY,KAAK,GAAG,MAAM,KAAK;MAE/B,cAAc,KAAK,KAAK;CAG5B,MAAM,QAAQ,IAAI,CAChB,GAAG,YAAY,KAAK,aAAa,YAAY,eAAe,OAAO,QAAQ,CAAC,CAAC,GAC7E,GAAG,cAAc,KAAK,EAAE,QAAQ,OAAO,iBACrC,MAAM,YAAY;EAChB,IAAI;EACJ,IAAI;GACF,UAAU,MAAM,QAAQ,QAAQ,EAAE,eAAe,KAAK,CAAC;EACzD,SAAS,OAAO;GACd,IAAI,iBAAiB,KAAK,GACxB;GAEF,MAAM;EACR;EACA,MAAM,gBAAgB,IAAI,IAAI,QAAQ,KAAK,UAAU,CAACA,UAAQ,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC;EAClF,MAAM,QAAQ,IACZ,WAAW,IAAI,OAAO,aAAa;GACjC,MAAM,OAAO,SAAS,SAAS,QAAQ;GACvC,MAAM,QAAQ,cAAc,IAAIA,UAAQ,IAAI,CAAC;GAC7C,IAAI,OAAO,OAAO,GAChB,MAAM,IAAI,UAAU,MAAM;QACrB,IAAI,OAAO,YAAY,GAC5B,MAAM,IAAI,UAAU,WAAW;QAC1B,IACL,UAAU,KAAA,KACT,QAAQ,aAAa,WAAW,KAAK,SAAS,GAAG,GAElD,MAAM,eAAe,OAAO,QAAQ;EAExC,CAAC,CACH;CACF,CAAC,CACH,CACF,CAAC;CACD,OAAO;AACT;;;AC1GA,SAASC,UAAQ,OAAuB;CACtC,OAAO,QAAQ,aAAa,UAAU,MAAM,YAAY,IAAI;AAC9D;AACA,SAAS,aAAa,UAAkB,MAAuB;CAC7D,MAAM,WAAW,SAAS,SAAS,MAAM,QAAQ;CACjD,OACE,aAAa,MACZ,aAAa,QACZ,CAAC,SAAS,WAAW,KAAK,SAAS,KAAK,KACxC,CAAC,SAAS,WAAW,QAAQ;AAEnC;AACA,SAAS,SAAS,cAA+B;CAC/C,OAAO,aAAa,MAAM,QAAQ,CAAC,CAAC,MAAM,SAAS,KAAK,SAAS,KAAK,KAAK,WAAW,GAAG,CAAC;AAC5F;AACA,SAAS,iBAAiB,MAAc,cAAuB;CAC7D,OAAO;EACL,oBAAoB,QAAQ,aAAa;EACzC,KAAK;EACL,KAAK;EACL,qBAAqB;EACrB,WAAW;EACX,QAAQ;CACV;AACF;AACA,SAAS,cAAc,MAAc,eAAwB,cAAuB;CAClF,OAAO;EACL,GAAG,iBAAiB,MAAM,YAAY;EACtC,mBAAmB;EACnB,WAAW;EACX,iBAAiB;EACjB,GAAI,gBAAgB,EAAE,aAAa,SAAS,mBAAmB,IAAI,CAAC;CACtE;AACF;AACA,eAAsB,yBAAyB,aAAmD;CAChG,IAAI,CAAC,MAAM,QAAQ,WAAW,GAC5B,MAAM,IAAI,UAAU,8BAA8B;CAEpD,IAAI,YAAY,WAAW,GACzB,MAAM,IAAI,WAAW,+BAA+B;CAEtD,MAAM,yBAAS,IAAI,IAAoB;CACvC,KAAK,MAAM,aAAa,aAAa;EACnC,IAAI,OAAO,cAAc,YAAY,UAAU,WAAW,GACxD,MAAM,IAAI,UAAU,4CAA4C;EAElE,MAAM,WAAW,SAAS,QAAQ,SAAS;EAC3C,OAAO,IAAIA,UAAQ,QAAQ,GAAG,QAAQ;CACxC;CACA,MAAM,QAAQ,IACZ,CAAC,GAAG,OAAO,OAAO,CAAC,CAAC,CAAC,IAAI,OAAO,cAAc;EAC5C,IAAI,EAAE,MAAM,KAAK,SAAS,EAAA,CAAG,YAAY,GACvC,MAAM,IAAI,UAAU,GAAG,UAAU,oBAAoB;CAEzD,CAAC,CACH;CACA,OAAO,CAAC,GAAG,OAAO,OAAO,CAAC;AAC5B;AACA,eAAsB,kBACpB,MACA,eACA,cACmB;CACnB,IAAI,CAAC,eACH,OAAO,SAAS,QAAQ,iBAAiB,MAAM,YAAY,CAAC;CAE9D,OAAO,OAAO,QAAQ,cAAc,MAAM,eAAe,YAAY,CAAC;AACxE;AACA,eAAsB,sBACpB,OACA,OACA,eACA,cACsB;CACtB,MAAM,0BAAU,IAAI,IAAY;CAChC,MAAM,8BAAc,IAAI,IAAsB;CAC9C,KAAK,MAAM,YAAY,OAAO;EAC5B,IAAI,gBAAgB;EACpB,KAAK,MAAM,QAAQ,OAAO;GACxB,IAAI,CAAC,aAAa,UAAU,IAAI,GAC9B;GAEF,gBAAgB;GAChB,MAAM,WAAW,SAAS,SAAS,MAAM,QAAQ;GACjD,IAAI,CAAC,gBAAgB,SAAS,QAAQ,GACpC;GAEF,IAAI,aAAa,MAAM,CAAC,eACtB,QAAQ,IAAI,QAAQ;QACf;IACL,MAAM,UAAU,YAAY,IAAI,IAAI,KAAK,CAAC;IAC1C,QAAQ,KAAK,QAAQ;IACrB,YAAY,IAAI,MAAM,OAAO;GAC/B;EACF;EACA,IAAI,eACF;EAEF,MAAM,qBAAqB,SAAS,SAAS,SAAS,MAAM,QAAQ,CAAC,CAAC,MAAM,QAAQ;EACpF,IAAI,gBAAgB,CAAC,SAAS,kBAAkB,GAC9C,QAAQ,IAAI,QAAQ;CAExB;CACA,MAAM,QAAQ,IACZ,CAAC,GAAG,WAAW,CAAC,CAAC,IAAI,OAAO,CAAC,MAAM,mBAAmB;EACpD,MAAM,WAAW,cAAc,IAAI,oBAAoB;EACvD,MAAM,UAAU,MAAM,OAAO,UAAU;GACrC,GAAG,cAAc,MAAM,MAAM,IAAI;GACjC,UAAU;EACZ,CAAC;EACD,KAAK,MAAM,SAAS,SAClB,QAAQ,IAAI,SAAS,UAAU,KAAK,CAAC;CAEzC,CAAC,CACH;CACA,OAAO;AACT;;;AC9GA,SAAS,QAAQ,OAAuB;CACtC,OAAO,QAAQ,aAAa,UAAU,MAAM,YAAY,IAAI;AAC9D;AACA,SAAS,YAAY,QAAoC;CACvD,MAAM,wBAAQ,IAAI,IAAoB;CACtC,KAAK,MAAM,SAAS,QAClB,MAAM,IAAI,QAAQ,KAAK,GAAG,KAAK;CAEjC,OAAO,CAAC,GAAG,MAAM,OAAO,CAAC;AAC3B;AACA,SAAS,cAAc,OAAe,gBAAiC;CACrE,IAAI,SAAS,iBAAiB,QAAQ,MAAM,KAAK;CACjD,IACE,OAAO,UAAU,MACf,OAAO,OAAO,QAAO,OAAO,GAAG,EAAE,MAAM,QACtC,OAAO,OAAO,OAAO,OAAO,GAAG,EAAE,MAAM,OACvC,OAAO,OAAO,OAAO,OAAO,GAAG,EAAE,MAAM,MAE1C,SAAS,OAAO,MAAM,GAAG,EAAE;CAE7B,IAAI,CAAC,gBAAgB;EACnB,OAAO,OAAO,SAAS,KAAK,SAAS,oBAAoB,SAAS,OAAO,GAAG,EAAE,KAAK,EAAE,GACnF,SAAS,OAAO,MAAM,GAAG,EAAE;EAG7B,SAAS,OAAO,QAAQ,SAAS,uBAAuB,EAAE;CAC5D;CACA,OAAO;AACT;AACA,SAAS,SAAS,OAAuB;CACvC,IAAI,MAAM,WAAW,MAAM,KAAK,CAAC,MAAM,WAAW,UAAU,GAC1D,OAAO;CAET,OAAO,MAAM,QAAQ,iBAAiB,IAAI,CAAC,CAAC,QAAQ,UAAU,IAAI;AACpE;AACA,SAAS,QACP,OACA,OACA,WACA,iBAAiB,OACP;CACV,IAAI,WAAW,gBAAgB,cAAc,OAAO,cAAc,GAAG,SAAS;CAC9E,IAAI,SAAS,WAAW,SAAS,GAC/B,IAAI;EACF,WAAW,cAAc,QAAQ;CACnC,SAAS,OAAO;EACd,IAAI,iBAAiB,WACnB,OAAO,CAAC;EAEV,MAAM;CACR;MACK;EACL,WAAW,SAAS,QAAQ;EAC5B,IAAI,aAAa,OAAO,WAAW,KAAK,QAAQ,GAC9C,WAAW,SAAS,KAClB,UAAU,QACR,UAAU,eACV,QAAQ,IAAI,QACZ,QAAQ,IAAI,eACZ,IACF,SAAS,MAAM,CAAC,CAClB;CAEJ;CACA,IAAI,SAAS,WAAW,GACtB,OAAO,CAAC;CAEV,IAAI,SAAS,WAAW,QAAQ,GAC9B,OAAO,CAAC,SAAS,UAAU,QAAQ,CAAC;CAEtC,OAAO,YAAY,MAAM,KAAK,SAAS,SAAS,QAAQ,MAAM,QAAQ,CAAC,CAAC;AAC1E;AACA,eAAsB,mBACpB,YACA,OACA,WACA,eACA,cACsB;CACtB,MAAM,qBAA0C,CAAC;CACjD,MAAM,kCAAkB,IAAI,IAAoB;CAChD,KAAK,MAAM,aAAa,YAAY;EAClC,MAAM,QAAQ,QACZ,UAAU,OACV,OACA,WACA,UAAU,SAAS,eAAe,UAAU,SAAS,QACvD;EACA,KAAK,MAAM,YAAY,OAAO;GAC5B,mBAAmB,KAAK;IAAE;IAAW,MAAM;GAAS,CAAC;GACrD,gBAAgB,IAAI,QAAQ,QAAQ,GAAG,QAAQ;EACjD;CACF;CACA,IAAI,kBAAkB,CAAC,GAAG,gBAAgB,OAAO,CAAC;CAClD,IAAI,iBAAiB,CAAC,cACpB,kBAAkB,CAChB,GAAI,MAAM,sBAAsB,iBAAiB,OAAO,eAAe,YAAY,CACrF;CAEF,MAAM,kBAAkB,MAAM,sBAAsB,iBAAiB,KAAK;CAC1E,MAAM,cAAc,IAAI,IACtB,CAAC,GAAG,eAAe,CAAC,CAAC,KAAK,CAAC,UAAU,UAAU,CAAC,QAAQ,QAAQ,GAAG,IAAI,CAAC,CAC1E;CACA,OAAO,mBAAmB,SAAS,EAAE,WAAW,WAAW;EACzD,MAAM,OAAO,YAAY,IAAI,QAAQ,IAAI,CAAC;EAC1C,OAAO,SAAS,KAAA,IACZ,CAAC,IACD,CACE;GACE;GACA;GACA,UAAU;IACR,KAAK,UAAU;IACf,OAAO,UAAU;GACnB;EACF,CACF;CACN,CAAC;AACH;;;AC9HA,SAAS,WAAW,OAA2B,WAAwC;CACrF,IAAI,UAAU,KACZ,OAAO,cAAc,KAAA,KAAa,CAAC,kBAAkB,KAAK,SAAS;CAErE,OAAO,UAAU,KAAA,KAAa,CAAC,qBAAqB,KAAK,KAAK;AAChE;AACA,SAAS,eACP,QACA,MACA,QACA,MACA,OACM;CACN,MAAM,SAAS,QAAQ,aAAa,UAAU,MAAM,YAAY,IAAI;CACpE,IAAI,SAAS,OAAO,QAAQ,MAAM;CAClC,OAAO,WAAW,IAAI;EACpB,MAAM,MAAM,SAAS,OAAO;EAC5B,IAAI,WAAW,KAAK,SAAS,IAAI,KAAK,OAAO,KAAK,WAAW,KAAK,MAAM,KAAK,MAAM,EAAE,GAAG;GACtF,MAAM,MAAM,GAAG,OAAO,GAAG,IAAI,GAAG,KAAK,MAAM,QAAQ,GAAG;GACtD,IAAI,CAAC,KAAK,IAAI,GAAG,GAAG;IAClB,KAAK,IAAI,GAAG;IACZ,OAAO,KAAK;KACV;KACA,MAAM;KACN,OAAO;KACP;IACF,CAAC;GACH;EACF;EACA,SAAS,OAAO,QAAQ,QAAQ,SAAS,CAAC;CAC5C;AACF;AACA,eAAsB,oBACpB,MACA,OACA,eACA,cACsB;CACtB,MAAM,UAAU,MAAM,QAAQ,IAC5B,MAAM,KAAK,SAAS,kBAAkB,MAAM,eAAe,YAAY,CAAC,CAC1E;CACA,MAAM,SAAsB,CAAC;CAC7B,MAAM,uBAAO,IAAI,IAAY;CAC7B,MAAM,0BAAU,IAAI,IAAY;CAChC,MAAM,SAAS,QAAQ,aAAa,UAAU,KAAK,YAAY,IAAI;CACnE,KAAK,MAAM,CAAC,WAAW,oBAAoB,QAAQ,QAAQ,GAAG;EAC5D,MAAM,OAAO,MAAM;EACnB,IAAI,SAAS,KAAA,GACX;EAEF,KAAK,MAAM,iBAAiB,iBAAiB;GAC3C,MAAM,gBAAgB,SAAS,QAAQ,MAAM,aAAa;GAC1D,MAAM,WAAW;IACf;IACA,cAAc,WAAW,KAAK,SAAS,GAAG;IAC1C;IACA,cAAc,WAAW,SAAS,KAAK,GAAG;GAC5C;GACA,KAAK,MAAM,SAAS,UAAU;IAC5B,MAAM,MAAM,QAAQ,aAAa,UAAU,MAAM,YAAY,IAAI;IACjE,IAAI,CAAC,QAAQ,IAAI,GAAG,GAAG;KACrB,QAAQ,IAAI,GAAG;KACf,eAAe,QAAQ,MAAM,QAAQ,MAAM,KAAK;IAClD;GACF;EACF;CACF;CACA,OAAO;AACT;;;ACjEA,MAAa,YAAY,SAAS,eAAe,SAAS;AAC1D,SAAS,kBAAkB,OAA4C;CACrE,IACE,OAAO,UAAU,YACjB,UAAU,QACV,MAAM,QAAQ,KAAK,KACnB,OAAO,OAAO,KAAK,CAAC,CAAC,MAAM,SAAS,OAAO,SAAS,QAAQ,GAE5D,MAAM,IAAI,UAAU,8CAA8C;AAEtE;AACA,eAAsB,kBACpB,MACA,OACA,aACA,YAAuB,CAAC,GACxB,gBAAyB,SAAS,wBAClC,eAAwB,SAAS,uBACX;CACtB,IAAI,OAAO,SAAS,UAClB,MAAM,IAAI,UAAU,uBAAuB;CAE7C,IAAI,CAAC,OAAO,UAAU,KAAK,KAAK,QAAQ,KAAK,QAAQ,WACnD,MAAM,IAAI,WAAW,sCAAsC,WAAW;CAExE,kBAAkB,SAAS;CAC3B,IAAI,OAAO,kBAAkB,WAC3B,MAAM,IAAI,UAAU,iCAAiC;CAEvD,IAAI,OAAO,iBAAiB,WAC1B,MAAM,IAAI,UAAU,gCAAgC;CAEtD,MAAM,QAAQ,MAAM,yBAAyB,WAAW;CACxD,MAAM,aAAa,kBAAkB,MAAM,KAAK;CAChD,IAAI,UAAU,WACZ,WAAW,KAAK,GAAI,MAAM,oBAAoB,MAAM,OAAO,eAAe,YAAY,CAAE;CAE1F,OAAO,mBAAmB,YAAY,OAAO,WAAW,eAAe,YAAY;AACrF"}
+{"version":3,"file":"index.mjs","names":["pathKey","pathKey"],"sources":["../config/settings.ts","../src/variables.ts","../src/candidates.ts","../src/existence.ts","../src/policy.ts","../src/filesystem.ts","../src/inventory.ts","../src/index.ts"],"sourcesContent":["import type { SearchSettings } from \"../src/types.js\";\n\nexport const settings: SearchSettings = {\n  batchValidationThreshold: 48,\n  directoryScanThreshold: 2,\n  ignoreFilePatterns: [\"**/.ignore\", \"**/.rgignore\"],\n  locationSuffixPattern: /:(?<line>\\d+)(?::(?<column>\\d+))?$/u,\n  respectIgnoreByDefault: true,\n  searchHiddenByDefault: false,\n  spanWordLimits: [3, 8, 24],\n  trailingPunctuation: \".,;:!?，。；：！？、\",\n  validationConcurrency: 32,\n};\n","import type { Variables } from \"./types.js\";\n\nconst nameSource = String.raw`[A-Za-z_][A-Za-z0-9_.-]*`;\nexport const variableReferenceSource = String.raw`(?:\\$\\{\\{\\s*(?:(?:env|vars|variables)[.:])?${nameSource}\\s*\\}\\}|\\{\\{\\s*${nameSource}\\s*\\}\\}|\\$\\{(?:env[.:])?${nameSource}\\}|\\$env:${nameSource}|\\$[A-Za-z_][A-Za-z0-9_]*|%${nameSource}%|!${nameSource}!|\\$\\(\\s*${nameSource}\\s*\\)|@${nameSource}@)`;\nconst expressionPatterns = [\n  new RegExp(String.raw`\\$\\{\\{\\s*(?:(?:env|vars|variables)[.:])?(${nameSource})\\s*\\}\\}`, \"giu\"),\n  new RegExp(String.raw`\\{\\{\\s*(${nameSource})\\s*\\}\\}`, \"gu\"),\n  new RegExp(String.raw`\\$\\{(?:env[.:])?(${nameSource})\\}`, \"giu\"),\n  new RegExp(String.raw`\\$env:(${nameSource})`, \"giu\"),\n  new RegExp(String.raw`\\$(?!env:)([A-Za-z_][A-Za-z0-9_]*)`, \"giu\"),\n  new RegExp(String.raw`%(${nameSource})%`, \"gu\"),\n  new RegExp(String.raw`!(${nameSource})!`, \"gu\"),\n  new RegExp(String.raw`\\$\\(\\s*(${nameSource})\\s*\\)`, \"gu\"),\n  new RegExp(String.raw`@(${nameSource})@`, \"gu\"),\n];\nfunction resolveVariable(name: string, variables: Variables): string | undefined {\n  const direct = variables[name] ?? process.env[name];\n  if (direct !== undefined) {\n    return direct;\n  }\n  const unscoped = /^(?:env|vars|variables)[.:](.+)$/iu.exec(name)?.[1];\n  return unscoped === undefined ? undefined : (variables[unscoped] ?? process.env[unscoped]);\n}\nexport function expandVariables(value: string, variables: Variables): string {\n  let result = value;\n  for (const pattern of expressionPatterns) {\n    result = result.replace(pattern, (match, name: string) => {\n      const replacement = resolveVariable(name, variables);\n      return replacement === undefined ? match : replacement;\n    });\n  }\n  return result;\n}\n","import type { Candidate, SearchLevel } from \"./types.js\";\nimport { settings } from \"../config/settings.js\";\nimport { variableReferenceSource } from \"./variables.js\";\n\nconst explicitPattern =\n  /(?:file:\\/\\/\\/?|[A-Za-z]:[\\\\/]|\\\\\\\\|\\/|(?:\\.{1,2}|~)[\\\\/])[^\"'`<>()[\\]{}\\s]+/gu;\nconst quotedPattern = /([\"'`])(?<value>[^\"'`\\r\\n]+)\\1/gu;\nconst tokenPattern = /[^\\s]+/gu;\nconst pathTokenPattern =\n  /(?:(?:[\\p{L}\\p{N}_@%$+~.#[\\],-]+[\\\\/])+(?:[\\p{L}\\p{N}_@%$+~.#[\\],-]+)|[\\p{L}\\p{N}_@%$+~.#[\\],-]+\\.[\\p{L}\\p{N}_@%$-]{1,16})(?::\\d+){0,2}/gu;\nconst unquotedPathCharacterSource = \"[^\\\"'`<>()[\\\\]{}\\\\s]\";\nconst variablePathPattern = new RegExp(\n  `${variableReferenceSource}(?:[\\\\\\\\/]${unquotedPathCharacterSource}+)+`,\n  \"giu\",\n);\nconst clausePattern = /[^\\r\\n!?！？;；。]+/gu;\nconst pathHintPattern =\n  /[\\\\/]|(?:^|[\\s\"'`])(?:\\.{1,2}|~|%[A-Za-z_][A-Za-z0-9_]*%|\\$\\{?[A-Za-z_][A-Za-z0-9_]*\\}?)(?:[\\\\/]|$)|\\.[\\p{L}\\p{N}]{1,16}(?::\\d+){0,2}(?:$|[\\s,.;:!?，。；：！？、])/u;\nconst variableHintPattern = new RegExp(String.raw`${variableReferenceSource}(?:[\\\\/]|$)`, \"iu\");\nfunction add(\n  result: Candidate[],\n  seen: Set<string>,\n  value: string,\n  start: number,\n  end: number,\n  kind: Candidate[\"kind\"],\n): void {\n  if (value.length === 0) {\n    return;\n  }\n  const key = `${start}:${end}:${value}`;\n  if (!seen.has(key)) {\n    seen.add(key);\n    result.push({ end, kind, start, value });\n  }\n}\nfunction addMatches(\n  result: Candidate[],\n  seen: Set<string>,\n  text: string,\n  pattern: RegExp,\n  kind: Candidate[\"kind\"],\n): void {\n  for (const match of text.matchAll(pattern)) {\n    const value = match[0];\n    const start = match.index ?? 0;\n    add(result, seen, value, start, start + value.length, kind);\n  }\n}\nfunction addQuotedMatches(result: Candidate[], seen: Set<string>, text: string): void {\n  for (const match of text.matchAll(quotedPattern)) {\n    const value = match.groups?.value;\n    if (value === undefined) {\n      continue;\n    }\n    const start = (match.index ?? 0) + match[0].indexOf(value);\n    add(result, seen, value, start, start + value.length, \"quoted\");\n  }\n}\nfunction addSpanMatches(\n  result: Candidate[],\n  seen: Set<string>,\n  text: string,\n  maximumWords: number,\n): void {\n  for (const clause of text.matchAll(clausePattern)) {\n    const clauseStart = clause.index ?? 0;\n    const clauseText = clause[0];\n    const tokens = [...clauseText.matchAll(tokenPattern)].map((token) => ({\n      end: clauseStart + (token.index ?? 0) + token[0].length,\n      hint: Number(pathHintPattern.test(token[0]) || variableHintPattern.test(token[0])),\n      start: clauseStart + (token.index ?? 0),\n      value: token[0],\n    }));\n    const hintCounts = [0];\n    for (const token of tokens) {\n      hintCounts.push((hintCounts.at(-1) ?? 0) + token.hint);\n    }\n    for (let start = 0; start < tokens.length; start += 1) {\n      const last = Math.min(tokens.length, start + maximumWords);\n      for (let end = start + 1; end <= last; end += 1) {\n        const firstToken = tokens[start];\n        const lastToken = tokens[end - 1];\n        const hintsBefore = hintCounts[start];\n        const hintsAfter = hintCounts[end];\n        if (\n          firstToken === undefined ||\n          lastToken === undefined ||\n          hintsBefore === undefined ||\n          hintsAfter === undefined ||\n          hintsBefore === hintsAfter\n        ) {\n          continue;\n        }\n        const value = text.slice(firstToken.start, lastToken.end);\n        if (pathHintPattern.test(value)) {\n          add(result, seen, value, firstToken.start, lastToken.end, \"span\");\n        }\n      }\n    }\n  }\n}\nexport function extractCandidates(text: string, level: SearchLevel): Candidate[] {\n  const result: Candidate[] = [];\n  const seen = new Set<string>();\n  addQuotedMatches(result, seen, text);\n  addMatches(result, seen, text, explicitPattern, \"explicit\");\n  if (level >= 2) {\n    addMatches(result, seen, text, variablePathPattern, \"heuristic\");\n    addMatches(result, seen, text, pathTokenPattern, \"heuristic\");\n  }\n  if (level >= 3) {\n    const maximumWords =\n      settings.spanWordLimits[Math.min(level - 3, settings.spanWordLimits.length - 1)];\n    if (maximumWords === undefined) {\n      throw new RangeError(\"No text-span level is configured\");\n    }\n    addSpanMatches(result, seen, text, maximumWords);\n  }\n  return result;\n}\n","import { readdir, stat } from \"node:fs/promises\";\nimport nodePath from \"node:path\";\nimport pLimit from \"p-limit\";\nimport { settings } from \"../config/settings.js\";\nimport type { PathKind } from \"./types.js\";\n\nconst knownFileErrors = new Set([\n  \"EACCES\",\n  \"ELOOP\",\n  \"ENAMETOOLONG\",\n  \"ENOTDIR\",\n  \"ENOENT\",\n  \"EPERM\",\n  \"EINVAL\",\n]);\nfunction pathKey(value: string): string {\n  return process.platform === \"win32\" ? value.toLowerCase() : value;\n}\nfunction isKnownFileError(error: unknown): boolean {\n  return (\n    error instanceof Error &&\n    \"code\" in error &&\n    typeof error.code === \"string\" &&\n    knownFileErrors.has(error.code)\n  );\n}\nasync function classifyPath(filePath: string): Promise<PathKind | undefined> {\n  try {\n    const pathStats = await stat(filePath);\n    if (pathStats.isFile()) {\n      return \"file\";\n    }\n    return pathStats.isDirectory() ? \"directory\" : undefined;\n  } catch (error) {\n    if (isKnownFileError(error)) {\n      return undefined;\n    }\n    throw error;\n  }\n}\nasync function classifyAndAdd(found: Map<string, PathKind>, filePath: string): Promise<void> {\n  const kind = await classifyPath(filePath);\n  if (kind !== undefined) {\n    found.set(filePath, kind);\n  }\n}\nexport async function classifyExistingPaths(\n  paths: readonly string[],\n  roots: readonly string[],\n): Promise<Map<string, PathKind>> {\n  const found = new Map<string, PathKind>();\n  const limit = pLimit(settings.validationConcurrency);\n  if (paths.length < settings.batchValidationThreshold) {\n    await Promise.all(paths.map((filePath) => limit(() => classifyAndAdd(found, filePath))));\n    return found;\n  }\n  const rootKeys = new Set(roots.map(pathKey));\n  const pathsByParent = new Map<string, { parent: string; paths: string[] }>();\n  for (const filePath of paths) {\n    if (rootKeys.has(pathKey(filePath))) {\n      found.set(filePath, \"directory\");\n      continue;\n    }\n    const parent = nodePath.dirname(filePath);\n    const key = pathKey(parent);\n    const group = pathsByParent.get(key) ?? { parent, paths: [] };\n    group.paths.push(filePath);\n    pathsByParent.set(key, group);\n  }\n  const directPaths: string[] = [];\n  const scannedGroups: { parent: string; paths: string[] }[] = [];\n  for (const group of pathsByParent.values()) {\n    if (group.paths.length < settings.directoryScanThreshold) {\n      directPaths.push(...group.paths);\n    } else {\n      scannedGroups.push(group);\n    }\n  }\n  await Promise.all([\n    ...directPaths.map((filePath) => limit(() => classifyAndAdd(found, filePath))),\n    ...scannedGroups.map(({ parent, paths: groupPaths }) =>\n      limit(async () => {\n        let entries;\n        try {\n          entries = await readdir(parent, { withFileTypes: true });\n        } catch (error) {\n          if (isKnownFileError(error)) {\n            return;\n          }\n          throw error;\n        }\n        const entriesByName = new Map(entries.map((entry) => [pathKey(entry.name), entry]));\n        await Promise.all(\n          groupPaths.map(async (filePath) => {\n            const name = nodePath.basename(filePath);\n            const entry = entriesByName.get(pathKey(name));\n            if (entry?.isFile()) {\n              found.set(filePath, \"file\");\n            } else if (entry?.isDirectory()) {\n              found.set(filePath, \"directory\");\n            } else if (\n              entry !== undefined ||\n              (process.platform === \"win32\" && name.includes(\":\"))\n            ) {\n              await classifyAndAdd(found, filePath);\n            }\n          }),\n        );\n      }),\n    ),\n  ]);\n  return found;\n}\n","import { stat } from \"node:fs/promises\";\nimport nodePath from \"node:path\";\nimport fastGlob from \"fast-glob\";\nimport { convertPathToPattern, globby } from \"globby\";\nimport { settings } from \"../config/settings.js\";\n\nfunction pathKey(value: string): string {\n  return process.platform === \"win32\" ? value.toLowerCase() : value;\n}\nfunction isWithinRoot(filePath: string, root: string): boolean {\n  const relative = nodePath.relative(root, filePath);\n  return (\n    relative === \"\" ||\n    (relative !== \"..\" &&\n      !relative.startsWith(`..${nodePath.sep}`) &&\n      !nodePath.isAbsolute(relative))\n  );\n}\nfunction isHidden(relativePath: string): boolean {\n  return relativePath.split(/[\\\\/]/u).some((part) => part.length > 1 && part.startsWith(\".\"));\n}\nfunction traversalOptions(root: string, searchHidden: boolean) {\n  return {\n    caseSensitiveMatch: process.platform !== \"win32\",\n    cwd: root,\n    dot: searchHidden,\n    followSymbolicLinks: false,\n    onlyFiles: false,\n    unique: true,\n  } as const;\n}\nfunction globbyOptions(root: string, respectIgnore: boolean, searchHidden: boolean) {\n  return {\n    ...traversalOptions(root, searchHidden),\n    expandDirectories: false,\n    gitignore: respectIgnore,\n    globalGitignore: respectIgnore,\n    ...(respectIgnore ? { ignoreFiles: settings.ignoreFilePatterns } : {}),\n  } as const;\n}\nexport async function resolveSearchDirectories(directories: readonly string[]): Promise<string[]> {\n  if (!Array.isArray(directories)) {\n    throw new TypeError(\"directories must be an array\");\n  }\n  if (directories.length === 0) {\n    throw new RangeError(\"directories must not be empty\");\n  }\n  const unique = new Map<string, string>();\n  for (const directory of directories) {\n    if (typeof directory !== \"string\" || directory.length === 0) {\n      throw new TypeError(\"every directory must be a non-empty string\");\n    }\n    const resolved = nodePath.resolve(directory);\n    unique.set(pathKey(resolved), resolved);\n  }\n  await Promise.all(\n    [...unique.values()].map(async (directory) => {\n      if (!(await stat(directory)).isDirectory()) {\n        throw new TypeError(`${directory} is not a directory`);\n      }\n    }),\n  );\n  return [...unique.values()];\n}\nexport async function listSearchEntries(\n  root: string,\n  respectIgnore: boolean,\n  searchHidden: boolean,\n): Promise<string[]> {\n  if (!respectIgnore) {\n    return fastGlob(\"**/*\", traversalOptions(root, searchHidden));\n  }\n  return globby(\"**/*\", globbyOptions(root, respectIgnore, searchHidden));\n}\nexport async function filterSearchablePaths(\n  paths: readonly string[],\n  roots: readonly string[],\n  respectIgnore: boolean,\n  searchHidden: boolean,\n): Promise<Set<string>> {\n  const allowed = new Set<string>();\n  const pathsByRoot = new Map<string, string[]>();\n  for (const filePath of paths) {\n    let hasSearchRoot = false;\n    for (const root of roots) {\n      if (!isWithinRoot(filePath, root)) {\n        continue;\n      }\n      hasSearchRoot = true;\n      const relative = nodePath.relative(root, filePath);\n      if (!searchHidden && isHidden(relative)) {\n        continue;\n      }\n      if (relative === \"\" || !respectIgnore) {\n        allowed.add(filePath);\n      } else {\n        const grouped = pathsByRoot.get(root) ?? [];\n        grouped.push(relative);\n        pathsByRoot.set(root, grouped);\n      }\n    }\n    if (hasSearchRoot) {\n      continue;\n    }\n    const filesystemRelative = nodePath.relative(nodePath.parse(filePath).root, filePath);\n    if (searchHidden || !isHidden(filesystemRelative)) {\n      allowed.add(filePath);\n    }\n  }\n  await Promise.all(\n    [...pathsByRoot].map(async ([root, relativePaths]) => {\n      const patterns = relativePaths.map(convertPathToPattern);\n      const matches = await globby(patterns, {\n        ...globbyOptions(root, true, true),\n        absolute: true,\n      });\n      for (const match of matches) {\n        allowed.add(nodePath.normalize(match));\n      }\n    }),\n  );\n  return allowed;\n}\n","import { fileURLToPath } from \"node:url\";\nimport nodePath from \"node:path\";\nimport { classifyExistingPaths } from \"./existence.js\";\nimport { filterSearchablePaths } from \"./policy.js\";\nimport { expandVariables } from \"./variables.js\";\nimport { settings } from \"../config/settings.js\";\nimport type { Candidate, PathLocation, PathMatch, PathPosition, Variables } from \"./types.js\";\n\ninterface ResolvedCandidate {\n  location?: PathLocation;\n  path: string;\n  position: PathPosition;\n}\ninterface PreparedCandidate {\n  location?: PathLocation;\n  position: PathPosition;\n  value: string;\n}\nfunction pathKey(value: string): string {\n  return process.platform === \"win32\" ? value.toLowerCase() : value;\n}\nfunction uniquePaths(values: Iterable<string>): string[] {\n  const paths = new Map<string, string>();\n  for (const value of values) {\n    paths.set(pathKey(value), value);\n  }\n  return [...paths.values()];\n}\nfunction parseLocationPart(value: string, name: string): number {\n  const result = Number(value);\n  if (!Number.isSafeInteger(result)) {\n    throw new RangeError(`${name} must be a safe integer`);\n  }\n  return result;\n}\nfunction prepareCandidate(candidate: Candidate): PreparedCandidate {\n  let end = candidate.end;\n  let start = candidate.start;\n  let value = candidate.value;\n  if (candidate.kind !== \"inventory\" && candidate.kind !== \"quoted\") {\n    const startTrimmed = value.trimStart();\n    start += value.length - startTrimmed.length;\n    value = startTrimmed;\n    const endTrimmed = value.trimEnd();\n    end -= value.length - endTrimmed.length;\n    value = endTrimmed;\n    if (\n      value.length >= 2 &&\n      ((value[0] === '\"' && value.at(-1) === '\"') ||\n        (value[0] === \"'\" && value.at(-1) === \"'\") ||\n        (value[0] === \"`\" && value.at(-1) === \"`\"))\n    ) {\n      start += 1;\n      end -= 1;\n      value = value.slice(1, -1);\n    }\n    while (value.length > 0 && settings.trailingPunctuation.includes(value.at(-1) ?? \"\")) {\n      end -= 1;\n      value = value.slice(0, -1);\n    }\n  }\n  if (candidate.kind === \"inventory\") {\n    return { position: { end, start }, value };\n  }\n  const match = settings.locationSuffixPattern.exec(value);\n  if (match === null) {\n    return { position: { end, start }, value };\n  }\n  const lineValue = match.groups?.line;\n  if (lineValue === undefined) {\n    throw new TypeError(\"locationSuffixPattern must capture a line\");\n  }\n  const columnValue = match.groups?.column;\n  const location: PathLocation =\n    columnValue === undefined\n      ? { line: parseLocationPart(lineValue, \"line\") }\n      : {\n          column: parseLocationPart(columnValue, \"column\"),\n          line: parseLocationPart(lineValue, \"line\"),\n        };\n  end -= match[0].length;\n  return {\n    location,\n    position: { end, start },\n    value: value.slice(0, match.index),\n  };\n}\nfunction unescape(value: string): string {\n  if (value.startsWith(\"\\\\\\\\\") && !value.startsWith(\"\\\\\\\\\\\\\\\\\")) {\n    return value;\n  }\n  return value.replace(/\\\\([\"'`\\\\])/gu, \"$1\").replace(/\\\\\\\\/gu, \"\\\\\");\n}\nfunction toPaths(value: string, roots: readonly string[], variables: Variables): string[] {\n  let expanded = expandVariables(value, variables);\n  if (expanded.startsWith(\"file://\")) {\n    try {\n      expanded = fileURLToPath(expanded);\n    } catch (error) {\n      if (error instanceof TypeError) {\n        return [];\n      }\n      throw error;\n    }\n  } else {\n    expanded = unescape(expanded);\n    if (expanded === \"~\" || /^~[\\\\/]/u.test(expanded)) {\n      expanded = nodePath.join(\n        variables.HOME ??\n          variables.USERPROFILE ??\n          process.env.HOME ??\n          process.env.USERPROFILE ??\n          \"\",\n        expanded.slice(2),\n      );\n    }\n  }\n  if (expanded.length === 0) {\n    return [];\n  }\n  if (nodePath.isAbsolute(expanded)) {\n    return [nodePath.normalize(expanded)];\n  }\n  return uniquePaths(roots.map((root) => nodePath.resolve(root, expanded)));\n}\nfunction mergeLocation(match: PathMatch, location: PathLocation | undefined): void {\n  if (location === undefined) {\n    return;\n  }\n  if (match.location === undefined) {\n    match.location = location;\n    return;\n  }\n  if (match.location.line !== location.line || match.location.column !== location.column) {\n    throw new Error(\"Candidates for the same path and position have conflicting locations\");\n  }\n}\nexport async function validateCandidates(\n  candidates: Candidate[],\n  roots: readonly string[],\n  variables: Variables,\n  respectIgnore: boolean,\n  searchHidden: boolean,\n): Promise<PathMatch[]> {\n  const resolvedCandidates: ResolvedCandidate[] = [];\n  const validationPaths = new Map<string, string>();\n  for (const candidate of candidates) {\n    const prepared = prepareCandidate(candidate);\n    const paths = toPaths(prepared.value, roots, variables);\n    for (const filePath of paths) {\n      resolvedCandidates.push({\n        ...(prepared.location === undefined ? {} : { location: prepared.location }),\n        path: filePath,\n        position: prepared.position,\n      });\n      validationPaths.set(pathKey(filePath), filePath);\n    }\n  }\n  let searchablePaths = [...validationPaths.values()];\n  if (respectIgnore || !searchHidden) {\n    searchablePaths = [\n      ...(await filterSearchablePaths(searchablePaths, roots, respectIgnore, searchHidden)),\n    ];\n  }\n  const classifiedPaths = await classifyExistingPaths(searchablePaths, roots);\n  const kindsByPath = new Map(\n    [...classifiedPaths].map(([filePath, kind]) => [pathKey(filePath), kind]),\n  );\n  const matches = new Map<string, PathMatch>();\n  for (const { location, path, position } of resolvedCandidates) {\n    const kind = kindsByPath.get(pathKey(path));\n    if (kind === undefined) {\n      continue;\n    }\n    const key = `${pathKey(path)}\\0${position.start}\\0${position.end}`;\n    const existing = matches.get(key);\n    if (existing !== undefined) {\n      mergeLocation(existing, location);\n      continue;\n    }\n    matches.set(key, {\n      kind,\n      ...(location === undefined ? {} : { location }),\n      path,\n      position,\n    });\n  }\n  return [...matches.values()];\n}\n","import nodePath from \"node:path\";\nimport { listSearchEntries } from \"./policy.js\";\nimport type { Candidate } from \"./types.js\";\n\nfunction isBoundary(value: string | undefined, following: string | undefined): boolean {\n  if (value === \".\") {\n    return following === undefined || !/[\\p{L}\\p{N}_-]/u.test(following);\n  }\n  return value === undefined || !/[\\p{L}\\p{N}_/\\\\-]/u.test(value);\n}\nfunction addOccurrences(\n  result: Candidate[],\n  seen: Set<string>,\n  source: string,\n  text: string,\n  value: string,\n): void {\n  const target = process.platform === \"win32\" ? value.toLowerCase() : value;\n  let offset = source.indexOf(target);\n  while (offset !== -1) {\n    const end = offset + target.length;\n    if (isBoundary(text[offset - 1], text[offset]) && isBoundary(text[end], text[end + 1])) {\n      const key = `${offset}:${end}:${text.slice(offset, end)}`;\n      if (!seen.has(key)) {\n        seen.add(key);\n        result.push({\n          end,\n          kind: \"inventory\",\n          start: offset,\n          value,\n        });\n      }\n    }\n    offset = source.indexOf(target, offset + 1);\n  }\n}\nexport async function inventoryCandidates(\n  text: string,\n  roots: readonly string[],\n  respectIgnore: boolean,\n  searchHidden: boolean,\n): Promise<Candidate[]> {\n  const entries = await Promise.all(\n    roots.map((root) => listSearchEntries(root, respectIgnore, searchHidden)),\n  );\n  const result: Candidate[] = [];\n  const seen = new Set<string>();\n  const scanned = new Set<string>();\n  const source = process.platform === \"win32\" ? text.toLowerCase() : text;\n  for (const [rootIndex, relativeEntries] of entries.entries()) {\n    const root = roots[rootIndex];\n    if (root === undefined) {\n      continue;\n    }\n    for (const relativeEntry of relativeEntries) {\n      const absoluteEntry = nodePath.resolve(root, relativeEntry);\n      const variants = [\n        relativeEntry,\n        relativeEntry.replaceAll(\"/\", nodePath.sep),\n        absoluteEntry,\n        absoluteEntry.replaceAll(nodePath.sep, \"/\"),\n      ];\n      for (const value of variants) {\n        const key = process.platform === \"win32\" ? value.toLowerCase() : value;\n        if (!scanned.has(key)) {\n          scanned.add(key);\n          addOccurrences(result, seen, source, text, value);\n        }\n      }\n    }\n  }\n  return result;\n}\n","import { extractCandidates } from \"./candidates.js\";\nimport { validateCandidates } from \"./filesystem.js\";\nimport { inventoryCandidates } from \"./inventory.js\";\nimport { resolveSearchDirectories } from \"./policy.js\";\nimport { settings } from \"../config/settings.js\";\nimport type { PathMatch, SearchLevel, Variables } from \"./types.js\";\n\nexport const MAX_LEVEL = settings.spanWordLimits.length + 3;\nfunction validateVariables(value: unknown): asserts value is Variables {\n  if (\n    typeof value !== \"object\" ||\n    value === null ||\n    Array.isArray(value) ||\n    Object.values(value).some((item) => typeof item !== \"string\")\n  ) {\n    throw new TypeError(\"variables must be an object of string values\");\n  }\n}\nexport async function findExistingPaths(\n  text: string,\n  level: SearchLevel,\n  directories: readonly string[],\n  variables: Variables = {},\n  respectIgnore: boolean = settings.respectIgnoreByDefault,\n  searchHidden: boolean = settings.searchHiddenByDefault,\n): Promise<PathMatch[]> {\n  if (typeof text !== \"string\") {\n    throw new TypeError(\"text must be a string\");\n  }\n  if (!Number.isInteger(level) || level < 1 || level > MAX_LEVEL) {\n    throw new RangeError(`level must be an integer from 1 to ${MAX_LEVEL}`);\n  }\n  validateVariables(variables);\n  if (typeof respectIgnore !== \"boolean\") {\n    throw new TypeError(\"respectIgnore must be a boolean\");\n  }\n  if (typeof searchHidden !== \"boolean\") {\n    throw new TypeError(\"searchHidden must be a boolean\");\n  }\n  const roots = await resolveSearchDirectories(directories);\n  const candidates = extractCandidates(text, level);\n  if (level === MAX_LEVEL) {\n    candidates.push(...(await inventoryCandidates(text, roots, respectIgnore, searchHidden)));\n  }\n  return validateCandidates(candidates, roots, variables, respectIgnore, searchHidden);\n}\nexport type {\n  PathKind,\n  PathLocation,\n  PathMatch,\n  PathPosition,\n  SearchLevel,\n  Variables,\n} from \"./types.js\";\n"],"mappings":";;;;;;;AAEA,MAAa,WAA2B;CACtC,0BAA0B;CAC1B,wBAAwB;CACxB,oBAAoB,CAAC,cAAc,cAAc;CACjD,uBAAuB;CACvB,wBAAwB;CACxB,uBAAuB;CACvB,gBAAgB;EAAC;EAAG;EAAG;CAAE;CACzB,qBAAqB;CACrB,uBAAuB;AACzB;;;ACVA,MAAM,aAAa,OAAO,GAAG;AAC7B,MAAa,0BAA0B,OAAO,GAAG,8CAA8C,WAAW,iBAAiB,WAAW,0BAA0B,WAAW,WAAW,WAAW,6BAA6B,WAAW,KAAK,WAAW,WAAW,WAAW,SAAS,WAAW;AACnS,MAAM,qBAAqB;CACzB,IAAI,OAAO,OAAO,GAAG,4CAA4C,WAAW,WAAW,KAAK;CAC5F,IAAI,OAAO,OAAO,GAAG,WAAW,WAAW,WAAW,IAAI;CAC1D,IAAI,OAAO,OAAO,GAAG,oBAAoB,WAAW,MAAM,KAAK;CAC/D,IAAI,OAAO,OAAO,GAAG,UAAU,WAAW,IAAI,KAAK;CACnD,IAAI,OAAO,OAAO,GAAG,sCAAsC,KAAK;CAChE,IAAI,OAAO,OAAO,GAAG,KAAK,WAAW,KAAK,IAAI;CAC9C,IAAI,OAAO,OAAO,GAAG,KAAK,WAAW,KAAK,IAAI;CAC9C,IAAI,OAAO,OAAO,GAAG,WAAW,WAAW,SAAS,IAAI;CACxD,IAAI,OAAO,OAAO,GAAG,KAAK,WAAW,KAAK,IAAI;AAChD;AACA,SAAS,gBAAgB,MAAc,WAA0C;CAC/E,MAAM,SAAS,UAAU,SAAS,QAAQ,IAAI;CAC9C,IAAI,WAAW,KAAA,GACb,OAAO;CAET,MAAM,WAAW,qCAAqC,KAAK,IAAI,CAAC,GAAG;CACnE,OAAO,aAAa,KAAA,IAAY,KAAA,IAAa,UAAU,aAAa,QAAQ,IAAI;AAClF;AACA,SAAgB,gBAAgB,OAAe,WAA8B;CAC3E,IAAI,SAAS;CACb,KAAK,MAAM,WAAW,oBACpB,SAAS,OAAO,QAAQ,UAAU,OAAO,SAAiB;EACxD,MAAM,cAAc,gBAAgB,MAAM,SAAS;EACnD,OAAO,gBAAgB,KAAA,IAAY,QAAQ;CAC7C,CAAC;CAEH,OAAO;AACT;;;AC5BA,MAAM,kBACJ;AACF,MAAM,gBAAgB;AACtB,MAAM,eAAe;AACrB,MAAM,mBACJ;AAEF,MAAM,sBAAsB,IAAI,OAC9B,GAAG,wBAAwB,oCAC3B,KACF;AACA,MAAM,gBAAgB;AACtB,MAAM,kBACJ;AACF,MAAM,sBAAsB,IAAI,OAAO,OAAO,GAAG,GAAG,wBAAwB,cAAc,IAAI;AAC9F,SAAS,IACP,QACA,MACA,OACA,OACA,KACA,MACM;CACN,IAAI,MAAM,WAAW,GACnB;CAEF,MAAM,MAAM,GAAG,MAAM,GAAG,IAAI,GAAG;CAC/B,IAAI,CAAC,KAAK,IAAI,GAAG,GAAG;EAClB,KAAK,IAAI,GAAG;EACZ,OAAO,KAAK;GAAE;GAAK;GAAM;GAAO;EAAM,CAAC;CACzC;AACF;AACA,SAAS,WACP,QACA,MACA,MACA,SACA,MACM;CACN,KAAK,MAAM,SAAS,KAAK,SAAS,OAAO,GAAG;EAC1C,MAAM,QAAQ,MAAM;EACpB,MAAM,QAAQ,MAAM,SAAS;EAC7B,IAAI,QAAQ,MAAM,OAAO,OAAO,QAAQ,MAAM,QAAQ,IAAI;CAC5D;AACF;AACA,SAAS,iBAAiB,QAAqB,MAAmB,MAAoB;CACpF,KAAK,MAAM,SAAS,KAAK,SAAS,aAAa,GAAG;EAChD,MAAM,QAAQ,MAAM,QAAQ;EAC5B,IAAI,UAAU,KAAA,GACZ;EAEF,MAAM,SAAS,MAAM,SAAS,KAAK,MAAM,EAAE,CAAC,QAAQ,KAAK;EACzD,IAAI,QAAQ,MAAM,OAAO,OAAO,QAAQ,MAAM,QAAQ,QAAQ;CAChE;AACF;AACA,SAAS,eACP,QACA,MACA,MACA,cACM;CACN,KAAK,MAAM,UAAU,KAAK,SAAS,aAAa,GAAG;EACjD,MAAM,cAAc,OAAO,SAAS;EAEpC,MAAM,SAAS,CAAC,GADG,OAAO,EACG,CAAC,SAAS,YAAY,CAAC,CAAC,CAAC,KAAK,WAAW;GACpE,KAAK,eAAe,MAAM,SAAS,KAAK,MAAM,EAAE,CAAC;GACjD,MAAM,OAAO,gBAAgB,KAAK,MAAM,EAAE,KAAK,oBAAoB,KAAK,MAAM,EAAE,CAAC;GACjF,OAAO,eAAe,MAAM,SAAS;GACrC,OAAO,MAAM;EACf,EAAE;EACF,MAAM,aAAa,CAAC,CAAC;EACrB,KAAK,MAAM,SAAS,QAClB,WAAW,MAAM,WAAW,GAAG,EAAE,KAAK,KAAK,MAAM,IAAI;EAEvD,KAAK,IAAI,QAAQ,GAAG,QAAQ,OAAO,QAAQ,SAAS,GAAG;GACrD,MAAM,OAAO,KAAK,IAAI,OAAO,QAAQ,QAAQ,YAAY;GACzD,KAAK,IAAI,MAAM,QAAQ,GAAG,OAAO,MAAM,OAAO,GAAG;IAC/C,MAAM,aAAa,OAAO;IAC1B,MAAM,YAAY,OAAO,MAAM;IAC/B,MAAM,cAAc,WAAW;IAC/B,MAAM,aAAa,WAAW;IAC9B,IACE,eAAe,KAAA,KACf,cAAc,KAAA,KACd,gBAAgB,KAAA,KAChB,eAAe,KAAA,KACf,gBAAgB,YAEhB;IAEF,MAAM,QAAQ,KAAK,MAAM,WAAW,OAAO,UAAU,GAAG;IACxD,IAAI,gBAAgB,KAAK,KAAK,GAC5B,IAAI,QAAQ,MAAM,OAAO,WAAW,OAAO,UAAU,KAAK,MAAM;GAEpE;EACF;CACF;AACF;AACA,SAAgB,kBAAkB,MAAc,OAAiC;CAC/E,MAAM,SAAsB,CAAC;CAC7B,MAAM,uBAAO,IAAI,IAAY;CAC7B,iBAAiB,QAAQ,MAAM,IAAI;CACnC,WAAW,QAAQ,MAAM,MAAM,iBAAiB,UAAU;CAC1D,IAAI,SAAS,GAAG;EACd,WAAW,QAAQ,MAAM,MAAM,qBAAqB,WAAW;EAC/D,WAAW,QAAQ,MAAM,MAAM,kBAAkB,WAAW;CAC9D;CACA,IAAI,SAAS,GAAG;EACd,MAAM,eACJ,SAAS,eAAe,KAAK,IAAI,QAAQ,GAAG,SAAS,eAAe,SAAS,CAAC;EAChF,IAAI,iBAAiB,KAAA,GACnB,MAAM,IAAI,WAAW,kCAAkC;EAEzD,eAAe,QAAQ,MAAM,MAAM,YAAY;CACjD;CACA,OAAO;AACT;;;AClHA,MAAM,kCAAkB,IAAI,IAAI;CAC9B;CACA;CACA;CACA;CACA;CACA;CACA;AACF,CAAC;AACD,SAASA,UAAQ,OAAuB;CACtC,OAAO,QAAQ,aAAa,UAAU,MAAM,YAAY,IAAI;AAC9D;AACA,SAAS,iBAAiB,OAAyB;CACjD,OACE,iBAAiB,SACjB,UAAU,SACV,OAAO,MAAM,SAAS,YACtB,gBAAgB,IAAI,MAAM,IAAI;AAElC;AACA,eAAe,aAAa,UAAiD;CAC3E,IAAI;EACF,MAAM,YAAY,MAAM,KAAK,QAAQ;EACrC,IAAI,UAAU,OAAO,GACnB,OAAO;EAET,OAAO,UAAU,YAAY,IAAI,cAAc,KAAA;CACjD,SAAS,OAAO;EACd,IAAI,iBAAiB,KAAK,GACxB;EAEF,MAAM;CACR;AACF;AACA,eAAe,eAAe,OAA8B,UAAiC;CAC3F,MAAM,OAAO,MAAM,aAAa,QAAQ;CACxC,IAAI,SAAS,KAAA,GACX,MAAM,IAAI,UAAU,IAAI;AAE5B;AACA,eAAsB,sBACpB,OACA,OACgC;CAChC,MAAM,wBAAQ,IAAI,IAAsB;CACxC,MAAM,QAAQ,OAAO,SAAS,qBAAqB;CACnD,IAAI,MAAM,SAAS,SAAS,0BAA0B;EACpD,MAAM,QAAQ,IAAI,MAAM,KAAK,aAAa,YAAY,eAAe,OAAO,QAAQ,CAAC,CAAC,CAAC;EACvF,OAAO;CACT;CACA,MAAM,WAAW,IAAI,IAAI,MAAM,IAAIA,SAAO,CAAC;CAC3C,MAAM,gCAAgB,IAAI,IAAiD;CAC3E,KAAK,MAAM,YAAY,OAAO;EAC5B,IAAI,SAAS,IAAIA,UAAQ,QAAQ,CAAC,GAAG;GACnC,MAAM,IAAI,UAAU,WAAW;GAC/B;EACF;EACA,MAAM,SAAS,SAAS,QAAQ,QAAQ;EACxC,MAAM,MAAMA,UAAQ,MAAM;EAC1B,MAAM,QAAQ,cAAc,IAAI,GAAG,KAAK;GAAE;GAAQ,OAAO,CAAC;EAAE;EAC5D,MAAM,MAAM,KAAK,QAAQ;EACzB,cAAc,IAAI,KAAK,KAAK;CAC9B;CACA,MAAM,cAAwB,CAAC;CAC/B,MAAM,gBAAuD,CAAC;CAC9D,KAAK,MAAM,SAAS,cAAc,OAAO,GACvC,IAAI,MAAM,MAAM,SAAS,SAAS,wBAChC,YAAY,KAAK,GAAG,MAAM,KAAK;MAE/B,cAAc,KAAK,KAAK;CAG5B,MAAM,QAAQ,IAAI,CAChB,GAAG,YAAY,KAAK,aAAa,YAAY,eAAe,OAAO,QAAQ,CAAC,CAAC,GAC7E,GAAG,cAAc,KAAK,EAAE,QAAQ,OAAO,iBACrC,MAAM,YAAY;EAChB,IAAI;EACJ,IAAI;GACF,UAAU,MAAM,QAAQ,QAAQ,EAAE,eAAe,KAAK,CAAC;EACzD,SAAS,OAAO;GACd,IAAI,iBAAiB,KAAK,GACxB;GAEF,MAAM;EACR;EACA,MAAM,gBAAgB,IAAI,IAAI,QAAQ,KAAK,UAAU,CAACA,UAAQ,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC;EAClF,MAAM,QAAQ,IACZ,WAAW,IAAI,OAAO,aAAa;GACjC,MAAM,OAAO,SAAS,SAAS,QAAQ;GACvC,MAAM,QAAQ,cAAc,IAAIA,UAAQ,IAAI,CAAC;GAC7C,IAAI,OAAO,OAAO,GAChB,MAAM,IAAI,UAAU,MAAM;QACrB,IAAI,OAAO,YAAY,GAC5B,MAAM,IAAI,UAAU,WAAW;QAC1B,IACL,UAAU,KAAA,KACT,QAAQ,aAAa,WAAW,KAAK,SAAS,GAAG,GAElD,MAAM,eAAe,OAAO,QAAQ;EAExC,CAAC,CACH;CACF,CAAC,CACH,CACF,CAAC;CACD,OAAO;AACT;;;AC1GA,SAASC,UAAQ,OAAuB;CACtC,OAAO,QAAQ,aAAa,UAAU,MAAM,YAAY,IAAI;AAC9D;AACA,SAAS,aAAa,UAAkB,MAAuB;CAC7D,MAAM,WAAW,SAAS,SAAS,MAAM,QAAQ;CACjD,OACE,aAAa,MACZ,aAAa,QACZ,CAAC,SAAS,WAAW,KAAK,SAAS,KAAK,KACxC,CAAC,SAAS,WAAW,QAAQ;AAEnC;AACA,SAAS,SAAS,cAA+B;CAC/C,OAAO,aAAa,MAAM,QAAQ,CAAC,CAAC,MAAM,SAAS,KAAK,SAAS,KAAK,KAAK,WAAW,GAAG,CAAC;AAC5F;AACA,SAAS,iBAAiB,MAAc,cAAuB;CAC7D,OAAO;EACL,oBAAoB,QAAQ,aAAa;EACzC,KAAK;EACL,KAAK;EACL,qBAAqB;EACrB,WAAW;EACX,QAAQ;CACV;AACF;AACA,SAAS,cAAc,MAAc,eAAwB,cAAuB;CAClF,OAAO;EACL,GAAG,iBAAiB,MAAM,YAAY;EACtC,mBAAmB;EACnB,WAAW;EACX,iBAAiB;EACjB,GAAI,gBAAgB,EAAE,aAAa,SAAS,mBAAmB,IAAI,CAAC;CACtE;AACF;AACA,eAAsB,yBAAyB,aAAmD;CAChG,IAAI,CAAC,MAAM,QAAQ,WAAW,GAC5B,MAAM,IAAI,UAAU,8BAA8B;CAEpD,IAAI,YAAY,WAAW,GACzB,MAAM,IAAI,WAAW,+BAA+B;CAEtD,MAAM,yBAAS,IAAI,IAAoB;CACvC,KAAK,MAAM,aAAa,aAAa;EACnC,IAAI,OAAO,cAAc,YAAY,UAAU,WAAW,GACxD,MAAM,IAAI,UAAU,4CAA4C;EAElE,MAAM,WAAW,SAAS,QAAQ,SAAS;EAC3C,OAAO,IAAIA,UAAQ,QAAQ,GAAG,QAAQ;CACxC;CACA,MAAM,QAAQ,IACZ,CAAC,GAAG,OAAO,OAAO,CAAC,CAAC,CAAC,IAAI,OAAO,cAAc;EAC5C,IAAI,EAAE,MAAM,KAAK,SAAS,EAAA,CAAG,YAAY,GACvC,MAAM,IAAI,UAAU,GAAG,UAAU,oBAAoB;CAEzD,CAAC,CACH;CACA,OAAO,CAAC,GAAG,OAAO,OAAO,CAAC;AAC5B;AACA,eAAsB,kBACpB,MACA,eACA,cACmB;CACnB,IAAI,CAAC,eACH,OAAO,SAAS,QAAQ,iBAAiB,MAAM,YAAY,CAAC;CAE9D,OAAO,OAAO,QAAQ,cAAc,MAAM,eAAe,YAAY,CAAC;AACxE;AACA,eAAsB,sBACpB,OACA,OACA,eACA,cACsB;CACtB,MAAM,0BAAU,IAAI,IAAY;CAChC,MAAM,8BAAc,IAAI,IAAsB;CAC9C,KAAK,MAAM,YAAY,OAAO;EAC5B,IAAI,gBAAgB;EACpB,KAAK,MAAM,QAAQ,OAAO;GACxB,IAAI,CAAC,aAAa,UAAU,IAAI,GAC9B;GAEF,gBAAgB;GAChB,MAAM,WAAW,SAAS,SAAS,MAAM,QAAQ;GACjD,IAAI,CAAC,gBAAgB,SAAS,QAAQ,GACpC;GAEF,IAAI,aAAa,MAAM,CAAC,eACtB,QAAQ,IAAI,QAAQ;QACf;IACL,MAAM,UAAU,YAAY,IAAI,IAAI,KAAK,CAAC;IAC1C,QAAQ,KAAK,QAAQ;IACrB,YAAY,IAAI,MAAM,OAAO;GAC/B;EACF;EACA,IAAI,eACF;EAEF,MAAM,qBAAqB,SAAS,SAAS,SAAS,MAAM,QAAQ,CAAC,CAAC,MAAM,QAAQ;EACpF,IAAI,gBAAgB,CAAC,SAAS,kBAAkB,GAC9C,QAAQ,IAAI,QAAQ;CAExB;CACA,MAAM,QAAQ,IACZ,CAAC,GAAG,WAAW,CAAC,CAAC,IAAI,OAAO,CAAC,MAAM,mBAAmB;EACpD,MAAM,WAAW,cAAc,IAAI,oBAAoB;EACvD,MAAM,UAAU,MAAM,OAAO,UAAU;GACrC,GAAG,cAAc,MAAM,MAAM,IAAI;GACjC,UAAU;EACZ,CAAC;EACD,KAAK,MAAM,SAAS,SAClB,QAAQ,IAAI,SAAS,UAAU,KAAK,CAAC;CAEzC,CAAC,CACH;CACA,OAAO;AACT;;;ACxGA,SAAS,QAAQ,OAAuB;CACtC,OAAO,QAAQ,aAAa,UAAU,MAAM,YAAY,IAAI;AAC9D;AACA,SAAS,YAAY,QAAoC;CACvD,MAAM,wBAAQ,IAAI,IAAoB;CACtC,KAAK,MAAM,SAAS,QAClB,MAAM,IAAI,QAAQ,KAAK,GAAG,KAAK;CAEjC,OAAO,CAAC,GAAG,MAAM,OAAO,CAAC;AAC3B;AACA,SAAS,kBAAkB,OAAe,MAAsB;CAC9D,MAAM,SAAS,OAAO,KAAK;CAC3B,IAAI,CAAC,OAAO,cAAc,MAAM,GAC9B,MAAM,IAAI,WAAW,GAAG,KAAK,wBAAwB;CAEvD,OAAO;AACT;AACA,SAAS,iBAAiB,WAAyC;CACjE,IAAI,MAAM,UAAU;CACpB,IAAI,QAAQ,UAAU;CACtB,IAAI,QAAQ,UAAU;CACtB,IAAI,UAAU,SAAS,eAAe,UAAU,SAAS,UAAU;EACjE,MAAM,eAAe,MAAM,UAAU;EACrC,SAAS,MAAM,SAAS,aAAa;EACrC,QAAQ;EACR,MAAM,aAAa,MAAM,QAAQ;EACjC,OAAO,MAAM,SAAS,WAAW;EACjC,QAAQ;EACR,IACE,MAAM,UAAU,MACd,MAAM,OAAO,QAAO,MAAM,GAAG,EAAE,MAAM,QACpC,MAAM,OAAO,OAAO,MAAM,GAAG,EAAE,MAAM,OACrC,MAAM,OAAO,OAAO,MAAM,GAAG,EAAE,MAAM,MACxC;GACA,SAAS;GACT,OAAO;GACP,QAAQ,MAAM,MAAM,GAAG,EAAE;EAC3B;EACA,OAAO,MAAM,SAAS,KAAK,SAAS,oBAAoB,SAAS,MAAM,GAAG,EAAE,KAAK,EAAE,GAAG;GACpF,OAAO;GACP,QAAQ,MAAM,MAAM,GAAG,EAAE;EAC3B;CACF;CACA,IAAI,UAAU,SAAS,aACrB,OAAO;EAAE,UAAU;GAAE;GAAK;EAAM;EAAG;CAAM;CAE3C,MAAM,QAAQ,SAAS,sBAAsB,KAAK,KAAK;CACvD,IAAI,UAAU,MACZ,OAAO;EAAE,UAAU;GAAE;GAAK;EAAM;EAAG;CAAM;CAE3C,MAAM,YAAY,MAAM,QAAQ;CAChC,IAAI,cAAc,KAAA,GAChB,MAAM,IAAI,UAAU,2CAA2C;CAEjE,MAAM,cAAc,MAAM,QAAQ;CAClC,MAAM,WACJ,gBAAgB,KAAA,IACZ,EAAE,MAAM,kBAAkB,WAAW,MAAM,EAAE,IAC7C;EACE,QAAQ,kBAAkB,aAAa,QAAQ;EAC/C,MAAM,kBAAkB,WAAW,MAAM;CAC3C;CACN,OAAO,MAAM,EAAE,CAAC;CAChB,OAAO;EACL;EACA,UAAU;GAAE;GAAK;EAAM;EACvB,OAAO,MAAM,MAAM,GAAG,MAAM,KAAK;CACnC;AACF;AACA,SAAS,SAAS,OAAuB;CACvC,IAAI,MAAM,WAAW,MAAM,KAAK,CAAC,MAAM,WAAW,UAAU,GAC1D,OAAO;CAET,OAAO,MAAM,QAAQ,iBAAiB,IAAI,CAAC,CAAC,QAAQ,UAAU,IAAI;AACpE;AACA,SAAS,QAAQ,OAAe,OAA0B,WAAgC;CACxF,IAAI,WAAW,gBAAgB,OAAO,SAAS;CAC/C,IAAI,SAAS,WAAW,SAAS,GAC/B,IAAI;EACF,WAAW,cAAc,QAAQ;CACnC,SAAS,OAAO;EACd,IAAI,iBAAiB,WACnB,OAAO,CAAC;EAEV,MAAM;CACR;MACK;EACL,WAAW,SAAS,QAAQ;EAC5B,IAAI,aAAa,OAAO,WAAW,KAAK,QAAQ,GAC9C,WAAW,SAAS,KAClB,UAAU,QACR,UAAU,eACV,QAAQ,IAAI,QACZ,QAAQ,IAAI,eACZ,IACF,SAAS,MAAM,CAAC,CAClB;CAEJ;CACA,IAAI,SAAS,WAAW,GACtB,OAAO,CAAC;CAEV,IAAI,SAAS,WAAW,QAAQ,GAC9B,OAAO,CAAC,SAAS,UAAU,QAAQ,CAAC;CAEtC,OAAO,YAAY,MAAM,KAAK,SAAS,SAAS,QAAQ,MAAM,QAAQ,CAAC,CAAC;AAC1E;AACA,SAAS,cAAc,OAAkB,UAA0C;CACjF,IAAI,aAAa,KAAA,GACf;CAEF,IAAI,MAAM,aAAa,KAAA,GAAW;EAChC,MAAM,WAAW;EACjB;CACF;CACA,IAAI,MAAM,SAAS,SAAS,SAAS,QAAQ,MAAM,SAAS,WAAW,SAAS,QAC9E,MAAM,IAAI,MAAM,sEAAsE;AAE1F;AACA,eAAsB,mBACpB,YACA,OACA,WACA,eACA,cACsB;CACtB,MAAM,qBAA0C,CAAC;CACjD,MAAM,kCAAkB,IAAI,IAAoB;CAChD,KAAK,MAAM,aAAa,YAAY;EAClC,MAAM,WAAW,iBAAiB,SAAS;EAC3C,MAAM,QAAQ,QAAQ,SAAS,OAAO,OAAO,SAAS;EACtD,KAAK,MAAM,YAAY,OAAO;GAC5B,mBAAmB,KAAK;IACtB,GAAI,SAAS,aAAa,KAAA,IAAY,CAAC,IAAI,EAAE,UAAU,SAAS,SAAS;IACzE,MAAM;IACN,UAAU,SAAS;GACrB,CAAC;GACD,gBAAgB,IAAI,QAAQ,QAAQ,GAAG,QAAQ;EACjD;CACF;CACA,IAAI,kBAAkB,CAAC,GAAG,gBAAgB,OAAO,CAAC;CAClD,IAAI,iBAAiB,CAAC,cACpB,kBAAkB,CAChB,GAAI,MAAM,sBAAsB,iBAAiB,OAAO,eAAe,YAAY,CACrF;CAEF,MAAM,kBAAkB,MAAM,sBAAsB,iBAAiB,KAAK;CAC1E,MAAM,cAAc,IAAI,IACtB,CAAC,GAAG,eAAe,CAAC,CAAC,KAAK,CAAC,UAAU,UAAU,CAAC,QAAQ,QAAQ,GAAG,IAAI,CAAC,CAC1E;CACA,MAAM,0BAAU,IAAI,IAAuB;CAC3C,KAAK,MAAM,EAAE,UAAU,MAAM,cAAc,oBAAoB;EAC7D,MAAM,OAAO,YAAY,IAAI,QAAQ,IAAI,CAAC;EAC1C,IAAI,SAAS,KAAA,GACX;EAEF,MAAM,MAAM,GAAG,QAAQ,IAAI,EAAE,IAAI,SAAS,MAAM,IAAI,SAAS;EAC7D,MAAM,WAAW,QAAQ,IAAI,GAAG;EAChC,IAAI,aAAa,KAAA,GAAW;GAC1B,cAAc,UAAU,QAAQ;GAChC;EACF;EACA,QAAQ,IAAI,KAAK;GACf;GACA,GAAI,aAAa,KAAA,IAAY,CAAC,IAAI,EAAE,SAAS;GAC7C;GACA;EACF,CAAC;CACH;CACA,OAAO,CAAC,GAAG,QAAQ,OAAO,CAAC;AAC7B;;;ACxLA,SAAS,WAAW,OAA2B,WAAwC;CACrF,IAAI,UAAU,KACZ,OAAO,cAAc,KAAA,KAAa,CAAC,kBAAkB,KAAK,SAAS;CAErE,OAAO,UAAU,KAAA,KAAa,CAAC,qBAAqB,KAAK,KAAK;AAChE;AACA,SAAS,eACP,QACA,MACA,QACA,MACA,OACM;CACN,MAAM,SAAS,QAAQ,aAAa,UAAU,MAAM,YAAY,IAAI;CACpE,IAAI,SAAS,OAAO,QAAQ,MAAM;CAClC,OAAO,WAAW,IAAI;EACpB,MAAM,MAAM,SAAS,OAAO;EAC5B,IAAI,WAAW,KAAK,SAAS,IAAI,KAAK,OAAO,KAAK,WAAW,KAAK,MAAM,KAAK,MAAM,EAAE,GAAG;GACtF,MAAM,MAAM,GAAG,OAAO,GAAG,IAAI,GAAG,KAAK,MAAM,QAAQ,GAAG;GACtD,IAAI,CAAC,KAAK,IAAI,GAAG,GAAG;IAClB,KAAK,IAAI,GAAG;IACZ,OAAO,KAAK;KACV;KACA,MAAM;KACN,OAAO;KACP;IACF,CAAC;GACH;EACF;EACA,SAAS,OAAO,QAAQ,QAAQ,SAAS,CAAC;CAC5C;AACF;AACA,eAAsB,oBACpB,MACA,OACA,eACA,cACsB;CACtB,MAAM,UAAU,MAAM,QAAQ,IAC5B,MAAM,KAAK,SAAS,kBAAkB,MAAM,eAAe,YAAY,CAAC,CAC1E;CACA,MAAM,SAAsB,CAAC;CAC7B,MAAM,uBAAO,IAAI,IAAY;CAC7B,MAAM,0BAAU,IAAI,IAAY;CAChC,MAAM,SAAS,QAAQ,aAAa,UAAU,KAAK,YAAY,IAAI;CACnE,KAAK,MAAM,CAAC,WAAW,oBAAoB,QAAQ,QAAQ,GAAG;EAC5D,MAAM,OAAO,MAAM;EACnB,IAAI,SAAS,KAAA,GACX;EAEF,KAAK,MAAM,iBAAiB,iBAAiB;GAC3C,MAAM,gBAAgB,SAAS,QAAQ,MAAM,aAAa;GAC1D,MAAM,WAAW;IACf;IACA,cAAc,WAAW,KAAK,SAAS,GAAG;IAC1C;IACA,cAAc,WAAW,SAAS,KAAK,GAAG;GAC5C;GACA,KAAK,MAAM,SAAS,UAAU;IAC5B,MAAM,MAAM,QAAQ,aAAa,UAAU,MAAM,YAAY,IAAI;IACjE,IAAI,CAAC,QAAQ,IAAI,GAAG,GAAG;KACrB,QAAQ,IAAI,GAAG;KACf,eAAe,QAAQ,MAAM,QAAQ,MAAM,KAAK;IAClD;GACF;EACF;CACF;CACA,OAAO;AACT;;;ACjEA,MAAa,YAAY,SAAS,eAAe,SAAS;AAC1D,SAAS,kBAAkB,OAA4C;CACrE,IACE,OAAO,UAAU,YACjB,UAAU,QACV,MAAM,QAAQ,KAAK,KACnB,OAAO,OAAO,KAAK,CAAC,CAAC,MAAM,SAAS,OAAO,SAAS,QAAQ,GAE5D,MAAM,IAAI,UAAU,8CAA8C;AAEtE;AACA,eAAsB,kBACpB,MACA,OACA,aACA,YAAuB,CAAC,GACxB,gBAAyB,SAAS,wBAClC,eAAwB,SAAS,uBACX;CACtB,IAAI,OAAO,SAAS,UAClB,MAAM,IAAI,UAAU,uBAAuB;CAE7C,IAAI,CAAC,OAAO,UAAU,KAAK,KAAK,QAAQ,KAAK,QAAQ,WACnD,MAAM,IAAI,WAAW,sCAAsC,WAAW;CAExE,kBAAkB,SAAS;CAC3B,IAAI,OAAO,kBAAkB,WAC3B,MAAM,IAAI,UAAU,iCAAiC;CAEvD,IAAI,OAAO,iBAAiB,WAC1B,MAAM,IAAI,UAAU,gCAAgC;CAEtD,MAAM,QAAQ,MAAM,yBAAyB,WAAW;CACxD,MAAM,aAAa,kBAAkB,MAAM,KAAK;CAChD,IAAI,UAAU,WACZ,WAAW,KAAK,GAAI,MAAM,oBAAoB,MAAM,OAAO,eAAe,YAAY,CAAE;CAE1F,OAAO,mBAAmB,YAAY,OAAO,WAAW,eAAe,YAAY;AACrF"}

package/dist/types/src/index.d.ts

@@ -1,4 +1,4 @@
 import type { PathMatch, SearchLevel, Variables } from "./types.js";
 export declare const MAX_LEVEL: number;
 export declare function findExistingPaths(text: string, level: SearchLevel, directories: readonly string[], variables?: Variables, respectIgnore?: boolean, searchHidden?: boolean): Promise<PathMatch[]>;
-export type { PathKind, PathMatch, PathPosition, SearchLevel, Variables } from "./types.js";
+export type { PathKind, PathLocation, PathMatch, PathPosition, SearchLevel, Variables, } from "./types.js";

package/dist/types/src/types.d.ts

@@ -4,8 +4,13 @@ export interface PathPosition {
     end: number;
     start: number;
 }
+export interface PathLocation {
+    column?: number;
+    line: number;
+}
 export interface PathMatch {
     kind: PathKind;
+    location?: PathLocation;
     path: string;
     position: PathPosition;
 }

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "pathprobe",
-  "version": "0.3.2",
+  "version": "0.4.2",
   "description": "Extract, resolve, and validate file and directory paths mentioned in text, with variable expansion, ignore rules, hidden-file control, and configurable search roots.",
   "license": "Apache-2.0",
   "repository": {