@ninjaxtools/slopdex 0.18.0 → 0.20.0

package/dist/chunk-KUV6PKKL.js

@@ -1,425 +0,0 @@
-import {
-  analysisSimilarity
-} from "./chunk-KQRS5P4U.js";
-import {
-  assertPositiveInteger,
-  compileNameRegex,
-  throwIfAborted
-} from "./chunk-VH5VGRCI.js";
-import {
-  CodeIndexError,
-  IncompatibleIndexError
-} from "./chunk-DKRB2XT5.js";
-
-// src/search/cross-search.ts
-import { realpath, stat } from "node:fs/promises";
-import path2 from "node:path";
-
-// src/analysis/cohesion.ts
-import path from "node:path";
-async function analyzeCohesion(options) {
-  const status = options.source.status();
-  const scoring = analysisSimilarity(status);
-  const neighbors = options.neighbors ?? 20;
-  const limit = options.limit ?? 50;
-  const minSimilarity = options.minSimilarity ?? 0.8;
-  const minLines = options.minLines ?? 2;
-  const sourceFilter = options.sourceFilter ?? { type: "all" };
-  assertPositiveInteger(neighbors, "neighbors");
-  assertPositiveInteger(limit, "limit");
-  assertPositiveInteger(minLines, "minLines");
-  if (!Number.isFinite(minSimilarity) || minSimilarity < -1 || minSimilarity >= 1) {
-    throw new CodeIndexError("minSimilarity must be at least -1 and less than 1.");
-  }
-  if (options.maxSimilarity !== void 0 && (!Number.isFinite(options.maxSimilarity) || options.maxSimilarity <= minSimilarity)) {
-    throw new CodeIndexError("maxSimilarity must be greater than minSimilarity.");
-  }
-  const nameRegex = compileNameRegex(options.nameRegex);
-  const candidateFunctions = options.source.allFunctions().filter((callable) => callable.lineCount >= minLines && (!nameRegex || nameRegex.test(callable.qualifiedName)));
-  const candidateIds = new Set(candidateFunctions.map((callable) => callable.id));
-  const sourceFunctions = (await options.source.sourceFunctions(sourceFilter)).filter((callable) => candidateIds.has(callable.id));
-  const neighborCache = /* @__PURE__ */ new Map();
-  const useCache = !options.source.readOnly;
-  if (useCache) {
-    await options.source.refreshSimilarityCache({
-      width: Math.min(200, Math.max(50, neighbors * 5)),
-      minSimilarity,
-      ...options.signal ? { signal: options.signal } : {},
-      ...options.onCacheProgress ? { onProgress: options.onCacheProgress } : {}
-    });
-  }
-  const cacheReader = useCache ? options.source.cachedSimilarityReader({
-    includeDescriptions: scoring.similarityMode === "code-description-file-average"
-  }) : void 0;
-  const neighborsFor = (callable) => {
-    throwIfAborted(options.signal);
-    const query = {
-      includeDescriptions: scoring.similarityMode === "code-description-file-average",
-      limit: neighbors,
-      minSimilarity,
-      ...options.maxSimilarity !== void 0 ? { maxSimilarity: options.maxSimilarity } : {},
-      minLines,
-      ...options.nameRegex !== void 0 ? { nameRegex: options.nameRegex } : {}
-    };
-    const matches = (cacheReader ? cacheReader.similarToFunction(callable.id, query) : options.source.similarToFunction(callable.id, query)).filter((match) => candidateIds.has(match.function.id));
-    neighborCache.set(callable.id, new Set(matches.map((match) => match.function.id)));
-    return matches;
-  };
-  const edges = /* @__PURE__ */ new Map();
-  for (let index = 0; index < sourceFunctions.length; index += 1) {
-    const source = sourceFunctions[index];
-    for (const match of neighborsFor(source)) {
-      const [left, right] = orderedFunctions(source, match.function);
-      const key = pairKey(left.id, right.id);
-      const existing = edges.get(key);
-      if (!existing || match.similarity > existing.similarity) {
-        const { function: _function, ...scores } = match;
-        edges.set(key, { left, right, ...scores });
-      }
-    }
-    options.onProgress?.({ completed: index + 1, total: sourceFunctions.length });
-  }
-  const scoredPairs = [...edges.values()].map((edge) => {
-    const leftNeighbors = neighborCache.get(edge.left.id);
-    const rightNeighbors = neighborCache.get(edge.right.id);
-    const reciprocal = leftNeighbors && rightNeighbors ? leftNeighbors.has(edge.right.id) && rightNeighbors.has(edge.left.id) : null;
-    return scorePair(edge, reciprocal, minSimilarity);
-  }).sort(comparePairs);
-  scoredPairs.forEach((pair, index) => {
-    pair.rank = index + 1;
-  });
-  const repositoryScope = sourceFilter.type === "all" && sourceFilter.path === void 0 && sourceFilter.nameRegex === void 0;
-  const metrics = calculateMetrics(
-    repositoryScope ? "repository" : "selected-sources",
-    sourceFunctions.length,
-    candidateFunctions.length,
-    scoredPairs
-  );
-  const reportedPairs = scoredPairs.slice(0, limit);
-  const files = aggregateFiles(sourceFunctions, scoredPairs).filter((file) => file.internalAffinity + file.sameFolderAffinity + file.externalAffinity > 0).slice(0, limit);
-  const groups = buildGroups(reportedPairs);
-  return {
-    schemaVersion: 3,
-    repository: {
-      generation: status.generation,
-      gitCheckpoint: status.gitCheckpoint,
-      embeddingProfile: status.embeddingProfile,
-      descriptionProfile: status.descriptionProfile
-    },
-    parameters: {
-      ...scoring,
-      neighbors,
-      limit,
-      minSimilarity,
-      ...options.maxSimilarity !== void 0 ? { maxSimilarity: options.maxSimilarity } : {},
-      minLines,
-      ...options.nameRegex !== void 0 ? { nameRegex: options.nameRegex } : {},
-      sourceFilter
-    },
-    metrics,
-    pairs: reportedPairs,
-    files,
-    groups
-  };
-}
-function cohesionLocation(leftPath, rightPath) {
-  const normalizedLeft = leftPath.replaceAll("\\", "/");
-  const normalizedRight = rightPath.replaceAll("\\", "/");
-  const leftDirectory = directoryParts(normalizedLeft);
-  const rightDirectory = directoryParts(normalizedRight);
-  let commonLength = 0;
-  while (commonLength < leftDirectory.length && commonLength < rightDirectory.length && leftDirectory[commonLength] === rightDirectory[commonLength]) {
-    commonLength += 1;
-  }
-  const commonParts = leftDirectory.slice(0, commonLength);
-  const commonAncestor = commonParts.length > 0 ? commonParts.join("/") : null;
-  const sameFile = normalizedLeft === normalizedRight;
-  const folderHops = sameFile ? 0 : leftDirectory.length - commonLength + rightDirectory.length - commonLength;
-  return {
-    category: sameFile ? "same-file" : folderHops === 0 ? "same-folder" : "different-folder",
-    physicalDistance: sameFile ? 0 : 1 + folderHops,
-    folderHops,
-    commonAncestor,
-    sourceTestPair: isTestPath(normalizedLeft) !== isTestPath(normalizedRight)
-  };
-}
-function scorePair(edge, reciprocal, minSimilarity) {
-  const location = cohesionLocation(edge.left.path, edge.right.path);
-  const semanticWeight = clamp((edge.similarity - minSimilarity) / (1 - minSimilarity));
-  const separationWeight = 1 - Math.exp(-location.physicalDistance / 2);
-  return {
-    rank: 0,
-    left: edge.left,
-    right: edge.right,
-    similarity: edge.similarity,
-    ...edge.codeSimilarity !== void 0 ? { codeSimilarity: edge.codeSimilarity } : {},
-    ...edge.descriptionSimilarity !== void 0 ? { descriptionSimilarity: edge.descriptionSimilarity } : {},
-    ...edge.fileDescriptionSimilarity !== void 0 ? { fileDescriptionSimilarity: edge.fileDescriptionSimilarity } : {},
-    reciprocal,
-    semanticWeight,
-    separationWeight,
-    cohesionGap: semanticWeight * separationWeight,
-    location
-  };
-}
-function calculateMetrics(scope, functionsAnalyzed, candidateFunctions, pairs) {
-  const totalWeight = pairs.reduce((sum, pair) => sum + pair.semanticWeight, 0);
-  const sameFileWeight = pairs.filter((pair) => pair.location.category === "same-file").reduce((sum, pair) => sum + pair.semanticWeight, 0);
-  const sameFolderWeight = pairs.filter((pair) => pair.location.category === "same-folder").reduce((sum, pair) => sum + pair.semanticWeight, 0);
-  const remoteWeight = pairs.filter((pair) => pair.location.category === "different-folder").reduce((sum, pair) => sum + pair.semanticWeight, 0);
-  const weightedDistance = pairs.reduce(
-    (sum, pair) => sum + pair.semanticWeight * pair.location.physicalDistance,
-    0
-  );
-  return {
-    scope,
-    functionsAnalyzed,
-    candidateFunctions,
-    semanticEdges: pairs.length,
-    sameFileRatio: ratio(sameFileWeight, totalWeight),
-    sameFolderRatio: ratio(sameFolderWeight, totalWeight),
-    remoteRatio: ratio(remoteWeight, totalWeight),
-    weightedMeanDistance: ratio(weightedDistance, totalWeight)
-  };
-}
-function aggregateFiles(sourceFunctions, pairs) {
-  const sourceIds = new Set(sourceFunctions.map((callable) => callable.id));
-  const counts = /* @__PURE__ */ new Map();
-  for (const callable of sourceFunctions) counts.set(callable.path, (counts.get(callable.path) ?? 0) + 1);
-  const reports = /* @__PURE__ */ new Map();
-  for (const [filePath, functionCount] of counts) {
-    reports.set(filePath, {
-      path: filePath,
-      functionCount,
-      internalAffinity: 0,
-      sameFolderAffinity: 0,
-      externalAffinity: 0,
-      externalAffinityRatio: 0
-    });
-  }
-  for (const pair of pairs) {
-    if (sourceIds.has(pair.left.id)) addFileAffinity(reports.get(pair.left.path), pair.right, pair);
-    if (sourceIds.has(pair.right.id)) addFileAffinity(reports.get(pair.right.path), pair.left, pair);
-  }
-  for (const report of reports.values()) {
-    const total = report.internalAffinity + report.sameFolderAffinity + report.externalAffinity;
-    report.externalAffinityRatio = ratio(report.externalAffinity, total);
-  }
-  return [...reports.values()].sort((left, right) => right.externalAffinityRatio - left.externalAffinityRatio || right.externalAffinity - left.externalAffinity || left.path.localeCompare(right.path));
-}
-function addFileAffinity(report, match, pair) {
-  if (pair.location.category === "same-file") report.internalAffinity += pair.semanticWeight;
-  else if (pair.location.category === "same-folder") report.sameFolderAffinity += pair.semanticWeight;
-  else {
-    report.externalAffinity += pair.semanticWeight;
-    updateStrongestExternal(report, match, pair);
-  }
-}
-function updateStrongestExternal(report, callable, pair) {
-  if (!report.strongestExternalMatch || pair.cohesionGap > report.strongestExternalMatch.cohesionGap) {
-    report.strongestExternalMatch = {
-      function: callable,
-      similarity: pair.similarity,
-      ...pair.codeSimilarity !== void 0 ? { codeSimilarity: pair.codeSimilarity } : {},
-      ...pair.descriptionSimilarity !== void 0 ? { descriptionSimilarity: pair.descriptionSimilarity } : {},
-      ...pair.fileDescriptionSimilarity !== void 0 ? { fileDescriptionSimilarity: pair.fileDescriptionSimilarity } : {},
-      cohesionGap: pair.cohesionGap
-    };
-  }
-}
-function buildGroups(pairs) {
-  const functions = /* @__PURE__ */ new Map();
-  const neighbors = /* @__PURE__ */ new Map();
-  for (const pair of pairs) {
-    functions.set(pair.left.id, pair.left);
-    functions.set(pair.right.id, pair.right);
-    addNeighbor(neighbors, pair.left.id, pair.right.id);
-    addNeighbor(neighbors, pair.right.id, pair.left.id);
-  }
-  const seen = /* @__PURE__ */ new Set();
-  const groups = [];
-  for (const start of neighbors.keys()) {
-    if (seen.has(start)) continue;
-    const pending = [start];
-    const memberIds = /* @__PURE__ */ new Set();
-    while (pending.length > 0) {
-      const id = pending.pop();
-      if (seen.has(id)) continue;
-      seen.add(id);
-      memberIds.add(id);
-      for (const neighbor of neighbors.get(id) ?? []) pending.push(neighbor);
-    }
-    const groupPairs = pairs.filter((pair) => memberIds.has(pair.left.id) && memberIds.has(pair.right.id));
-    const members = [...memberIds].map((id) => functions.get(id)).sort(compareFunctions);
-    groups.push({
-      rank: 0,
-      memberCount: members.length,
-      fileCount: new Set(members.map((member) => member.path)).size,
-      minimumEdgeSimilarity: Math.min(...groupPairs.map((pair) => pair.similarity)),
-      maximumEdgeSimilarity: Math.max(...groupPairs.map((pair) => pair.similarity)),
-      maximumPhysicalDistance: Math.max(...groupPairs.map((pair) => pair.location.physicalDistance)),
-      maximumCohesionGap: Math.max(...groupPairs.map((pair) => pair.cohesionGap)),
-      members
-    });
-  }
-  groups.sort((left, right) => right.maximumCohesionGap - left.maximumCohesionGap || right.memberCount - left.memberCount || compareFunctions(left.members[0], right.members[0]));
-  groups.forEach((group, index) => {
-    group.rank = index + 1;
-  });
-  return groups;
-}
-function directoryParts(filePath) {
-  const directory = path.posix.dirname(filePath.replaceAll("\\", "/"));
-  return directory === "." ? [] : directory.split("/").filter(Boolean);
-}
-function isTestPath(filePath) {
-  const original = filePath.replaceAll("\\", "/");
-  const normalized = original.toLowerCase();
-  const segments = normalized.split("/");
-  const fileName = segments.at(-1) ?? "";
-  return segments.some((segment) => segment === "test" || segment === "tests" || segment === "__tests__") || /\.(?:test|spec)\.[cm]?[jt]sx?$/.test(fileName) || /_test\.go$/.test(fileName) || /^(?:test_.+|.+_test)\.(?:py|pyw|rs|c|h)$/.test(fileName) || /^(?:Test.+|.+Tests?|.+TestCase)\.java$/.test(original.split("/").at(-1) ?? "");
-}
-function orderedFunctions(left, right) {
-  return compareFunctions(left, right) <= 0 ? [left, right] : [right, left];
-}
-function compareFunctions(left, right) {
-  return left.path.localeCompare(right.path) || left.startLine - right.startLine || left.startColumn - right.startColumn || left.qualifiedName.localeCompare(right.qualifiedName) || left.id - right.id;
-}
-function comparePairs(left, right) {
-  return right.cohesionGap - left.cohesionGap || right.similarity - left.similarity || Number(right.reciprocal === true) - Number(left.reciprocal === true) || compareFunctions(left.left, right.left) || compareFunctions(left.right, right.right);
-}
-function pairKey(leftId, rightId) {
-  return leftId < rightId ? `${leftId}:${rightId}` : `${rightId}:${leftId}`;
-}
-function addNeighbor(neighbors, source, target) {
-  const values = neighbors.get(source) ?? /* @__PURE__ */ new Set();
-  values.add(target);
-  neighbors.set(source, values);
-}
-function ratio(numerator, denominator) {
-  return denominator === 0 ? 0 : numerator / denominator;
-}
-function clamp(value) {
-  return Math.max(0, Math.min(1, value));
-}
-
-// src/search/cross-search.ts
-async function* crossSearch(options) {
-  const target = options.target ?? options.source;
-  const sourceStatus = options.source.status();
-  const targetStatus = target.status();
-  const sourceProfile = JSON.stringify(sourceStatus.embeddingProfile);
-  const targetProfile = JSON.stringify(targetStatus.embeddingProfile);
-  if (sourceProfile !== targetProfile) {
-    throw new IncompatibleIndexError("Cross-search requires identical embedding profiles.");
-  }
-  const scoring = {
-    ...analysisSimilarity(sourceStatus, targetStatus),
-    sourceDescriptionProfile: sourceStatus.descriptionProfile,
-    targetDescriptionProfile: targetStatus.descriptionProfile
-  };
-  const includeDescriptions = scoring.similarityMode === "code-description-file-average";
-  const limit = options.limitPerFunction ?? 5;
-  assertPositiveInteger(limit, "limitPerFunction");
-  const minLines = options.minLines ?? 2;
-  assertPositiveInteger(minLines, "minLines");
-  const nameRegex = compileNameRegex(options.nameRegex);
-  const sourceFunctions = (await options.source.sourceFunctions(options.sourceFilter ?? { type: "all" })).filter((callable) => callable.lineCount >= minLines && (!nameRegex || nameRegex.test(callable.qualifiedName)));
-  const sameIndex = target.indexPath === options.source.indexPath || await fileIdentity(target.indexPath) === await fileIdentity(options.source.indexPath);
-  const sourceRoot = options.crossFileOnly ? await canonicalRoot(options.source.rootDir) : void 0;
-  const targetRoot = options.crossFileOnly ? sameIndex ? sourceRoot : await canonicalRoot(target.rootDir) : void 0;
-  const rootsDiffer = options.cohesion && !sameIndex ? await canonicalRoot(options.source.rootDir) !== await canonicalRoot(target.rootDir) : false;
-  const canonicalFiles = /* @__PURE__ */ new Map();
-  const canonicalFile = (root, filePath) => {
-    const absolutePath = path2.resolve(root, filePath);
-    let result = canonicalFiles.get(absolutePath);
-    if (!result) {
-      result = fileIdentity(absolutePath);
-      canonicalFiles.set(absolutePath, result);
-    }
-    return result;
-  };
-  const targetPathsByCanonicalFile = /* @__PURE__ */ new Map();
-  if (targetRoot) {
-    const targetPaths = [...new Set(target.allFunctions().map((callable) => callable.path))];
-    await Promise.all(targetPaths.map(async (targetPath) => {
-      const canonicalPath = await canonicalFile(targetRoot, targetPath);
-      const paths = targetPathsByCanonicalFile.get(canonicalPath) ?? [];
-      paths.push(targetPath);
-      targetPathsByCanonicalFile.set(canonicalPath, paths);
-    }));
-  }
-  const seenPairs = /* @__PURE__ */ new Set();
-  const useCache = sameIndex && !options.source.readOnly;
-  if (useCache) {
-    await options.source.refreshSimilarityCache({
-      width: Math.min(200, Math.max(50, limit * 5)),
-      minSimilarity: options.minSimilarity ?? -1,
-      ...options.signal ? { signal: options.signal } : {},
-      ...options.onCacheProgress ? { onProgress: options.onCacheProgress } : {}
-    });
-  }
-  const cacheReader = useCache ? options.source.cachedSimilarityReader({ includeDescriptions }) : void 0;
-  for (let index = 0; index < sourceFunctions.length; index += 1) {
-    throwIfAborted(options.signal);
-    const source = sourceFunctions[index];
-    const canonicalSourceFile = sourceRoot ? await canonicalFile(sourceRoot, source.path) : void 0;
-    const excludedTargetPaths = canonicalSourceFile ? targetPathsByCanonicalFile.get(canonicalSourceFile) : void 0;
-    const excludePaths = excludedTargetPaths ? { excludePaths: excludedTargetPaths } : {};
-    const similar = cacheReader ? cacheReader.similarToFunction : options.source.similarToFunction.bind(options.source);
-    const candidates = sameIndex ? similar(source.id, {
-      includeDescriptions,
-      limit,
-      minSimilarity: options.minSimilarity ?? -1,
-      ...options.maxSimilarity !== void 0 ? { maxSimilarity: options.maxSimilarity } : {},
-      minLines,
-      ...options.nameRegex !== void 0 ? { nameRegex: options.nameRegex } : {},
-      ...excludePaths
-    }) : target.searchByVector(options.source.vectorForFunction(source.id), {
-      ...includeDescriptions ? {
-        descriptionVector: options.source.vectorForFunction(source.id, "description"),
-        fileDescriptionVector: options.source.vectorForFile(source.path)
-      } : {},
-      limit,
-      minSimilarity: options.minSimilarity ?? -1,
-      ...options.maxSimilarity !== void 0 ? { maxSimilarity: options.maxSimilarity } : {},
-      minLines,
-      ...options.nameRegex !== void 0 ? { nameRegex: options.nameRegex } : {},
-      ...excludePaths
-    });
-    const rankedCandidates = options.cohesion ? candidates.map((match) => ({
-      ...match,
-      physicalDistance: cohesionLocation(source.path, match.function.path).physicalDistance + Number(rootsDiffer)
-    })).sort((left, right) => right.physicalDistance - left.physicalDistance || right.similarity - left.similarity || left.function.path.localeCompare(right.function.path) || left.function.startLine - right.function.startLine || left.function.id - right.function.id) : candidates;
-    const matches = sameIndex && !options.includeSymmetricDuplicates ? rankedCandidates.filter((match) => {
-      const pair = source.id < match.function.id ? `${source.id}:${match.function.id}` : `${match.function.id}:${source.id}`;
-      if (seenPairs.has(pair)) return false;
-      seenPairs.add(pair);
-      return true;
-    }) : rankedCandidates;
-    if (matches.length > 0) yield { source, matches, scoring };
-    options.onProgress?.({ completed: index + 1, total: sourceFunctions.length });
-  }
-}
-async function canonicalRoot(root) {
-  try {
-    return await realpath(root);
-  } catch {
-    return path2.resolve(root);
-  }
-}
-async function fileIdentity(filePath) {
-  try {
-    const metadata = await stat(filePath);
-    return `inode:${metadata.dev}:${metadata.ino}`;
-  } catch {
-    return `path:${path2.resolve(filePath)}`;
-  }
-}
-
-export {
-  analyzeCohesion,
-  cohesionLocation,
-  crossSearch
-};
-//# sourceMappingURL=chunk-KUV6PKKL.js.map

package/dist/chunk-KUV6PKKL.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/search/cross-search.ts","../src/analysis/cohesion.ts"],"sourcesContent":["import { realpath, stat } from \"node:fs/promises\";\nimport path from \"node:path\";\n\nimport { IncompatibleIndexError } from \"../errors.js\";\nimport { cohesionLocation } from \"../analysis/cohesion.js\";\nimport type { CrossSearchOptions, CrossSearchResult } from \"../types.js\";\nimport { assertPositiveInteger, compileNameRegex, throwIfAborted } from \"../utils.js\";\nimport { analysisSimilarity } from \"./similarity.js\";\n\nexport async function* crossSearch(options: CrossSearchOptions): AsyncGenerator<CrossSearchResult> {\n  const target = options.target ?? options.source;\n  const sourceStatus = options.source.status();\n  const targetStatus = target.status();\n  const sourceProfile = JSON.stringify(sourceStatus.embeddingProfile);\n  const targetProfile = JSON.stringify(targetStatus.embeddingProfile);\n  if (sourceProfile !== targetProfile) {\n    throw new IncompatibleIndexError(\"Cross-search requires identical embedding profiles.\");\n  }\n  const scoring = {\n    ...analysisSimilarity(sourceStatus, targetStatus),\n    sourceDescriptionProfile: sourceStatus.descriptionProfile,\n    targetDescriptionProfile: targetStatus.descriptionProfile,\n  };\n  const includeDescriptions = scoring.similarityMode === \"code-description-file-average\";\n\n  const limit = options.limitPerFunction ?? 5;\n  assertPositiveInteger(limit, \"limitPerFunction\");\n  const minLines = options.minLines ?? 2;\n  assertPositiveInteger(minLines, \"minLines\");\n  const nameRegex = compileNameRegex(options.nameRegex);\n  const sourceFunctions = (await options.source.sourceFunctions(options.sourceFilter ?? { type: \"all\" }))\n    .filter((callable) => callable.lineCount >= minLines && (!nameRegex || nameRegex.test(callable.qualifiedName)));\n  const sameIndex = target.indexPath === options.source.indexPath\n    || await fileIdentity(target.indexPath) === await fileIdentity(options.source.indexPath);\n  const sourceRoot = options.crossFileOnly ? await canonicalRoot(options.source.rootDir) : undefined;\n  const targetRoot = options.crossFileOnly\n    ? sameIndex ? sourceRoot! : await canonicalRoot(target.rootDir)\n    : undefined;\n  const rootsDiffer = options.cohesion && !sameIndex\n    ? await canonicalRoot(options.source.rootDir) !== await canonicalRoot(target.rootDir)\n    : false;\n  const canonicalFiles = new Map<string, Promise<string>>();\n  const canonicalFile = (root: string, filePath: string): Promise<string> => {\n    const absolutePath = path.resolve(root, filePath);\n    let result = canonicalFiles.get(absolutePath);\n    if (!result) {\n      result = fileIdentity(absolutePath);\n      canonicalFiles.set(absolutePath, result);\n    }\n    return result;\n  };\n  const targetPathsByCanonicalFile = new Map<string, string[]>();\n  if (targetRoot) {\n    const targetPaths = [...new Set(target.allFunctions().map((callable) => callable.path))];\n    await Promise.all(targetPaths.map(async (targetPath) => {\n      const canonicalPath = await canonicalFile(targetRoot, targetPath);\n      const paths = targetPathsByCanonicalFile.get(canonicalPath) ?? [];\n      paths.push(targetPath);\n      targetPathsByCanonicalFile.set(canonicalPath, paths);\n    }));\n  }\n  const seenPairs = new Set<string>();\n  const useCache = sameIndex && !options.source.readOnly;\n  if (useCache) {\n    await options.source.refreshSimilarityCache({\n      width: Math.min(200, Math.max(50, limit * 5)),\n      minSimilarity: options.minSimilarity ?? -1,\n      ...(options.signal ? { signal: options.signal } : {}),\n      ...(options.onCacheProgress ? { onProgress: options.onCacheProgress } : {}),\n    });\n  }\n  // One validity snapshot for the whole run: per-function lookups must not\n  // re-read the state tables for every source.\n  const cacheReader = useCache ? options.source.cachedSimilarityReader({ includeDescriptions }) : undefined;\n  for (let index = 0; index < sourceFunctions.length; index += 1) {\n    throwIfAborted(options.signal);\n    const source = sourceFunctions[index]!;\n    const canonicalSourceFile = sourceRoot ? await canonicalFile(sourceRoot, source.path) : undefined;\n    const excludedTargetPaths = canonicalSourceFile ? targetPathsByCanonicalFile.get(canonicalSourceFile) : undefined;\n    const excludePaths = excludedTargetPaths ? { excludePaths: excludedTargetPaths } : {};\n    const similar = cacheReader ? cacheReader.similarToFunction : options.source.similarToFunction.bind(options.source);\n    const candidates = sameIndex\n      ? similar(source.id, {\n        includeDescriptions,\n        limit,\n        minSimilarity: options.minSimilarity ?? -1,\n        ...(options.maxSimilarity !== undefined ? { maxSimilarity: options.maxSimilarity } : {}),\n        minLines,\n        ...(options.nameRegex !== undefined ? { nameRegex: options.nameRegex } : {}),\n        ...excludePaths,\n      })\n      : target.searchByVector(options.source.vectorForFunction(source.id), {\n        ...(includeDescriptions ? {\n          descriptionVector: options.source.vectorForFunction(source.id, \"description\"),\n          fileDescriptionVector: options.source.vectorForFile(source.path),\n        } : {}),\n        limit,\n        minSimilarity: options.minSimilarity ?? -1,\n        ...(options.maxSimilarity !== undefined ? { maxSimilarity: options.maxSimilarity } : {}),\n        minLines,\n        ...(options.nameRegex !== undefined ? { nameRegex: options.nameRegex } : {}),\n        ...excludePaths,\n      });\n    const rankedCandidates = options.cohesion\n      ? candidates.map((match) => ({\n        ...match,\n        physicalDistance: cohesionLocation(source.path, match.function.path).physicalDistance + Number(rootsDiffer),\n      })).sort((left, right) => right.physicalDistance - left.physicalDistance\n        || right.similarity - left.similarity\n        || left.function.path.localeCompare(right.function.path)\n        || left.function.startLine - right.function.startLine\n        || left.function.id - right.function.id)\n      : candidates;\n    const matches = sameIndex && !options.includeSymmetricDuplicates\n      ? rankedCandidates.filter((match) => {\n        const pair = source.id < match.function.id\n          ? `${source.id}:${match.function.id}`\n          : `${match.function.id}:${source.id}`;\n        if (seenPairs.has(pair)) return false;\n        seenPairs.add(pair);\n        return true;\n      })\n      : rankedCandidates;\n    if (matches.length > 0) yield { source, matches, scoring };\n    options.onProgress?.({ completed: index + 1, total: sourceFunctions.length });\n  }\n}\n\nasync function canonicalRoot(root: string): Promise<string> {\n  try {\n    return await realpath(root);\n  } catch {\n    return path.resolve(root);\n  }\n}\n\nasync function fileIdentity(filePath: string): Promise<string> {\n  try {\n    const metadata = await stat(filePath);\n    return `inode:${metadata.dev}:${metadata.ino}`;\n  } catch {\n    return `path:${path.resolve(filePath)}`;\n  }\n}\n","import path from \"node:path\";\n\nimport { CodeIndexError } from \"../errors.js\";\nimport { analysisSimilarity } from \"../search/similarity.js\";\nimport type {\n  CohesionAnalysisOptions,\n  CohesionFileReport,\n  CohesionGroup,\n  CohesionLocation,\n  CohesionPair,\n  CohesionReport,\n  IndexedFunction,\n  SimilarityResult,\n  SimilarityScores,\n} from \"../types.js\";\nimport { assertPositiveInteger, compileNameRegex, throwIfAborted } from \"../utils.js\";\n\ninterface CandidateEdge extends SimilarityScores {\n  left: IndexedFunction;\n  right: IndexedFunction;\n}\n\nexport async function analyzeCohesion(options: CohesionAnalysisOptions): Promise<CohesionReport> {\n  const status = options.source.status();\n  const scoring = analysisSimilarity(status);\n  const neighbors = options.neighbors ?? 20;\n  const limit = options.limit ?? 50;\n  const minSimilarity = options.minSimilarity ?? 0.8;\n  const minLines = options.minLines ?? 2;\n  const sourceFilter = options.sourceFilter ?? { type: \"all\" };\n  assertPositiveInteger(neighbors, \"neighbors\");\n  assertPositiveInteger(limit, \"limit\");\n  assertPositiveInteger(minLines, \"minLines\");\n  if (!Number.isFinite(minSimilarity) || minSimilarity < -1 || minSimilarity >= 1) {\n    throw new CodeIndexError(\"minSimilarity must be at least -1 and less than 1.\");\n  }\n  if (options.maxSimilarity !== undefined\n    && (!Number.isFinite(options.maxSimilarity) || options.maxSimilarity <= minSimilarity)) {\n    throw new CodeIndexError(\"maxSimilarity must be greater than minSimilarity.\");\n  }\n  const nameRegex = compileNameRegex(options.nameRegex);\n  const candidateFunctions = options.source.allFunctions()\n    .filter((callable) => callable.lineCount >= minLines && (!nameRegex || nameRegex.test(callable.qualifiedName)));\n  const candidateIds = new Set(candidateFunctions.map((callable) => callable.id));\n  const sourceFunctions = (await options.source.sourceFunctions(sourceFilter))\n    .filter((callable) => candidateIds.has(callable.id));\n\n  const neighborCache = new Map<number, Set<number>>();\n  const useCache = !options.source.readOnly;\n  if (useCache) {\n    await options.source.refreshSimilarityCache({\n      width: Math.min(200, Math.max(50, neighbors * 5)),\n      minSimilarity,\n      ...(options.signal ? { signal: options.signal } : {}),\n      ...(options.onCacheProgress ? { onProgress: options.onCacheProgress } : {}),\n    });\n  }\n  // One validity snapshot for the whole run: per-function lookups must not\n  // re-read the state tables for every source.\n  const cacheReader = useCache ? options.source.cachedSimilarityReader({\n    includeDescriptions: scoring.similarityMode === \"code-description-file-average\",\n  }) : undefined;\n  const neighborsFor = (callable: IndexedFunction): SimilarityResult[] => {\n    throwIfAborted(options.signal);\n    const query = {\n      includeDescriptions: scoring.similarityMode === \"code-description-file-average\",\n      limit: neighbors,\n      minSimilarity,\n      ...(options.maxSimilarity !== undefined ? { maxSimilarity: options.maxSimilarity } : {}),\n      minLines,\n      ...(options.nameRegex !== undefined ? { nameRegex: options.nameRegex } : {}),\n    };\n    const matches = (cacheReader ? cacheReader.similarToFunction(callable.id, query)\n      : options.source.similarToFunction(callable.id, query))\n      .filter((match) => candidateIds.has(match.function.id));\n    neighborCache.set(callable.id, new Set(matches.map((match) => match.function.id)));\n    return matches;\n  };\n\n  const edges = new Map<string, CandidateEdge>();\n  for (let index = 0; index < sourceFunctions.length; index += 1) {\n    const source = sourceFunctions[index]!;\n    for (const match of neighborsFor(source)) {\n      const [left, right] = orderedFunctions(source, match.function);\n      const key = pairKey(left.id, right.id);\n      const existing = edges.get(key);\n      if (!existing || match.similarity > existing.similarity) {\n        const { function: _function, ...scores } = match;\n        edges.set(key, { left, right, ...scores });\n      }\n    }\n    options.onProgress?.({ completed: index + 1, total: sourceFunctions.length });\n  }\n\n  const scoredPairs = [...edges.values()].map((edge) => {\n    const leftNeighbors = neighborCache.get(edge.left.id);\n    const rightNeighbors = neighborCache.get(edge.right.id);\n    const reciprocal = leftNeighbors && rightNeighbors\n      ? leftNeighbors.has(edge.right.id) && rightNeighbors.has(edge.left.id)\n      : null;\n    return scorePair(edge, reciprocal, minSimilarity);\n  }).sort(comparePairs);\n  scoredPairs.forEach((pair, index) => {\n    pair.rank = index + 1;\n  });\n\n  const repositoryScope = sourceFilter.type === \"all\" && sourceFilter.path === undefined && sourceFilter.nameRegex === undefined;\n  const metrics = calculateMetrics(\n    repositoryScope ? \"repository\" : \"selected-sources\",\n    sourceFunctions.length,\n    candidateFunctions.length,\n    scoredPairs,\n  );\n  const reportedPairs = scoredPairs.slice(0, limit);\n  const files = aggregateFiles(sourceFunctions, scoredPairs)\n    .filter((file) => file.internalAffinity + file.sameFolderAffinity + file.externalAffinity > 0)\n    .slice(0, limit);\n  const groups = buildGroups(reportedPairs);\n  return {\n    schemaVersion: 3,\n    repository: {\n      generation: status.generation,\n      gitCheckpoint: status.gitCheckpoint,\n      embeddingProfile: status.embeddingProfile,\n      descriptionProfile: status.descriptionProfile,\n    },\n    parameters: {\n      ...scoring,\n      neighbors,\n      limit,\n      minSimilarity,\n      ...(options.maxSimilarity !== undefined ? { maxSimilarity: options.maxSimilarity } : {}),\n      minLines,\n      ...(options.nameRegex !== undefined ? { nameRegex: options.nameRegex } : {}),\n      sourceFilter,\n    },\n    metrics,\n    pairs: reportedPairs,\n    files,\n    groups,\n  };\n}\n\nexport function cohesionLocation(leftPath: string, rightPath: string): CohesionLocation {\n  const normalizedLeft = leftPath.replaceAll(\"\\\\\", \"/\");\n  const normalizedRight = rightPath.replaceAll(\"\\\\\", \"/\");\n  const leftDirectory = directoryParts(normalizedLeft);\n  const rightDirectory = directoryParts(normalizedRight);\n  let commonLength = 0;\n  while (commonLength < leftDirectory.length\n    && commonLength < rightDirectory.length\n    && leftDirectory[commonLength] === rightDirectory[commonLength]) {\n    commonLength += 1;\n  }\n  const commonParts = leftDirectory.slice(0, commonLength);\n  const commonAncestor = commonParts.length > 0 ? commonParts.join(\"/\") : null;\n  const sameFile = normalizedLeft === normalizedRight;\n  const folderHops = sameFile\n    ? 0\n    : leftDirectory.length - commonLength + rightDirectory.length - commonLength;\n  return {\n    category: sameFile ? \"same-file\" : folderHops === 0 ? \"same-folder\" : \"different-folder\",\n    physicalDistance: sameFile ? 0 : 1 + folderHops,\n    folderHops,\n    commonAncestor,\n    sourceTestPair: isTestPath(normalizedLeft) !== isTestPath(normalizedRight),\n  };\n}\n\nfunction scorePair(edge: CandidateEdge, reciprocal: boolean | null, minSimilarity: number): CohesionPair {\n  const location = cohesionLocation(edge.left.path, edge.right.path);\n  const semanticWeight = clamp((edge.similarity - minSimilarity) / (1 - minSimilarity));\n  const separationWeight = 1 - Math.exp(-location.physicalDistance / 2);\n  return {\n    rank: 0,\n    left: edge.left,\n    right: edge.right,\n    similarity: edge.similarity,\n    ...(edge.codeSimilarity !== undefined ? { codeSimilarity: edge.codeSimilarity } : {}),\n    ...(edge.descriptionSimilarity !== undefined ? { descriptionSimilarity: edge.descriptionSimilarity } : {}),\n    ...(edge.fileDescriptionSimilarity !== undefined ? { fileDescriptionSimilarity: edge.fileDescriptionSimilarity } : {}),\n    reciprocal,\n    semanticWeight,\n    separationWeight,\n    cohesionGap: semanticWeight * separationWeight,\n    location,\n  };\n}\n\nfunction calculateMetrics(\n  scope: CohesionReport[\"metrics\"][\"scope\"],\n  functionsAnalyzed: number,\n  candidateFunctions: number,\n  pairs: readonly CohesionPair[],\n): CohesionReport[\"metrics\"] {\n  const totalWeight = pairs.reduce((sum, pair) => sum + pair.semanticWeight, 0);\n  const sameFileWeight = pairs\n    .filter((pair) => pair.location.category === \"same-file\")\n    .reduce((sum, pair) => sum + pair.semanticWeight, 0);\n  const sameFolderWeight = pairs\n    .filter((pair) => pair.location.category === \"same-folder\")\n    .reduce((sum, pair) => sum + pair.semanticWeight, 0);\n  const remoteWeight = pairs\n    .filter((pair) => pair.location.category === \"different-folder\")\n    .reduce((sum, pair) => sum + pair.semanticWeight, 0);\n  const weightedDistance = pairs.reduce(\n    (sum, pair) => sum + pair.semanticWeight * pair.location.physicalDistance,\n    0,\n  );\n  return {\n    scope,\n    functionsAnalyzed,\n    candidateFunctions,\n    semanticEdges: pairs.length,\n    sameFileRatio: ratio(sameFileWeight, totalWeight),\n    sameFolderRatio: ratio(sameFolderWeight, totalWeight),\n    remoteRatio: ratio(remoteWeight, totalWeight),\n    weightedMeanDistance: ratio(weightedDistance, totalWeight),\n  };\n}\n\nfunction aggregateFiles(\n  sourceFunctions: readonly IndexedFunction[],\n  pairs: readonly CohesionPair[],\n): CohesionFileReport[] {\n  const sourceIds = new Set(sourceFunctions.map((callable) => callable.id));\n  const counts = new Map<string, number>();\n  for (const callable of sourceFunctions) counts.set(callable.path, (counts.get(callable.path) ?? 0) + 1);\n  const reports = new Map<string, CohesionFileReport>();\n  for (const [filePath, functionCount] of counts) {\n    reports.set(filePath, {\n      path: filePath,\n      functionCount,\n      internalAffinity: 0,\n      sameFolderAffinity: 0,\n      externalAffinity: 0,\n      externalAffinityRatio: 0,\n    });\n  }\n  for (const pair of pairs) {\n    if (sourceIds.has(pair.left.id)) addFileAffinity(reports.get(pair.left.path)!, pair.right, pair);\n    if (sourceIds.has(pair.right.id)) addFileAffinity(reports.get(pair.right.path)!, pair.left, pair);\n  }\n  for (const report of reports.values()) {\n    const total = report.internalAffinity + report.sameFolderAffinity + report.externalAffinity;\n    report.externalAffinityRatio = ratio(report.externalAffinity, total);\n  }\n  return [...reports.values()].sort((left, right) => right.externalAffinityRatio - left.externalAffinityRatio\n    || right.externalAffinity - left.externalAffinity\n    || left.path.localeCompare(right.path));\n}\n\nfunction addFileAffinity(\n  report: CohesionFileReport,\n  match: IndexedFunction,\n  pair: CohesionPair,\n): void {\n  if (pair.location.category === \"same-file\") report.internalAffinity += pair.semanticWeight;\n  else if (pair.location.category === \"same-folder\") report.sameFolderAffinity += pair.semanticWeight;\n  else {\n    report.externalAffinity += pair.semanticWeight;\n    updateStrongestExternal(report, match, pair);\n  }\n}\n\nfunction updateStrongestExternal(\n  report: CohesionFileReport,\n  callable: IndexedFunction,\n  pair: CohesionPair,\n): void {\n  if (!report.strongestExternalMatch || pair.cohesionGap > report.strongestExternalMatch.cohesionGap) {\n    report.strongestExternalMatch = {\n      function: callable,\n      similarity: pair.similarity,\n      ...(pair.codeSimilarity !== undefined ? { codeSimilarity: pair.codeSimilarity } : {}),\n      ...(pair.descriptionSimilarity !== undefined ? { descriptionSimilarity: pair.descriptionSimilarity } : {}),\n      ...(pair.fileDescriptionSimilarity !== undefined ? { fileDescriptionSimilarity: pair.fileDescriptionSimilarity } : {}),\n      cohesionGap: pair.cohesionGap,\n    };\n  }\n}\n\nfunction buildGroups(pairs: readonly CohesionPair[]): CohesionGroup[] {\n  const functions = new Map<number, IndexedFunction>();\n  const neighbors = new Map<number, Set<number>>();\n  for (const pair of pairs) {\n    functions.set(pair.left.id, pair.left);\n    functions.set(pair.right.id, pair.right);\n    addNeighbor(neighbors, pair.left.id, pair.right.id);\n    addNeighbor(neighbors, pair.right.id, pair.left.id);\n  }\n  const seen = new Set<number>();\n  const groups: CohesionGroup[] = [];\n  for (const start of neighbors.keys()) {\n    if (seen.has(start)) continue;\n    const pending = [start];\n    const memberIds = new Set<number>();\n    while (pending.length > 0) {\n      const id = pending.pop()!;\n      if (seen.has(id)) continue;\n      seen.add(id);\n      memberIds.add(id);\n      for (const neighbor of neighbors.get(id) ?? []) pending.push(neighbor);\n    }\n    const groupPairs = pairs.filter((pair) => memberIds.has(pair.left.id) && memberIds.has(pair.right.id));\n    const members = [...memberIds].map((id) => functions.get(id)!).sort(compareFunctions);\n    groups.push({\n      rank: 0,\n      memberCount: members.length,\n      fileCount: new Set(members.map((member) => member.path)).size,\n      minimumEdgeSimilarity: Math.min(...groupPairs.map((pair) => pair.similarity)),\n      maximumEdgeSimilarity: Math.max(...groupPairs.map((pair) => pair.similarity)),\n      maximumPhysicalDistance: Math.max(...groupPairs.map((pair) => pair.location.physicalDistance)),\n      maximumCohesionGap: Math.max(...groupPairs.map((pair) => pair.cohesionGap)),\n      members,\n    });\n  }\n  groups.sort((left, right) => right.maximumCohesionGap - left.maximumCohesionGap\n    || right.memberCount - left.memberCount\n    || compareFunctions(left.members[0]!, right.members[0]!));\n  groups.forEach((group, index) => {\n    group.rank = index + 1;\n  });\n  return groups;\n}\n\nfunction directoryParts(filePath: string): string[] {\n  const directory = path.posix.dirname(filePath.replaceAll(\"\\\\\", \"/\"));\n  return directory === \".\" ? [] : directory.split(\"/\").filter(Boolean);\n}\n\nfunction isTestPath(filePath: string): boolean {\n  const original = filePath.replaceAll(\"\\\\\", \"/\");\n  const normalized = original.toLowerCase();\n  const segments = normalized.split(\"/\");\n  const fileName = segments.at(-1) ?? \"\";\n  return segments.some((segment) => segment === \"test\" || segment === \"tests\" || segment === \"__tests__\")\n    || /\\.(?:test|spec)\\.[cm]?[jt]sx?$/.test(fileName)\n    || /_test\\.go$/.test(fileName)\n    || /^(?:test_.+|.+_test)\\.(?:py|pyw|rs|c|h)$/.test(fileName)\n    || /^(?:Test.+|.+Tests?|.+TestCase)\\.java$/.test(original.split(\"/\").at(-1) ?? \"\");\n}\n\nfunction orderedFunctions(left: IndexedFunction, right: IndexedFunction): [IndexedFunction, IndexedFunction] {\n  return compareFunctions(left, right) <= 0 ? [left, right] : [right, left];\n}\n\nfunction compareFunctions(left: IndexedFunction, right: IndexedFunction): number {\n  return left.path.localeCompare(right.path)\n    || left.startLine - right.startLine\n    || left.startColumn - right.startColumn\n    || left.qualifiedName.localeCompare(right.qualifiedName)\n    || left.id - right.id;\n}\n\nfunction comparePairs(left: CohesionPair, right: CohesionPair): number {\n  return right.cohesionGap - left.cohesionGap\n    || right.similarity - left.similarity\n    || Number(right.reciprocal === true) - Number(left.reciprocal === true)\n    || compareFunctions(left.left, right.left)\n    || compareFunctions(left.right, right.right);\n}\n\nfunction pairKey(leftId: number, rightId: number): string {\n  return leftId < rightId ? `${leftId}:${rightId}` : `${rightId}:${leftId}`;\n}\n\nfunction addNeighbor(neighbors: Map<number, Set<number>>, source: number, target: number): void {\n  const values = neighbors.get(source) ?? new Set<number>();\n  values.add(target);\n  neighbors.set(source, values);\n}\n\nfunction ratio(numerator: number, denominator: number): number {\n  return denominator === 0 ? 0 : numerator / denominator;\n}\n\nfunction clamp(value: number): number {\n  return Math.max(0, Math.min(1, value));\n}\n"],"mappings":";;;;;;;;;;;;;;AAAA,SAAS,UAAU,YAAY;AAC/B,OAAOA,WAAU;;;ACDjB,OAAO,UAAU;AAsBjB,eAAsB,gBAAgB,SAA2D;AAC/F,QAAM,SAAS,QAAQ,OAAO,OAAO;AACrC,QAAM,UAAU,mBAAmB,MAAM;AACzC,QAAM,YAAY,QAAQ,aAAa;AACvC,QAAM,QAAQ,QAAQ,SAAS;AAC/B,QAAM,gBAAgB,QAAQ,iBAAiB;AAC/C,QAAM,WAAW,QAAQ,YAAY;AACrC,QAAM,eAAe,QAAQ,gBAAgB,EAAE,MAAM,MAAM;AAC3D,wBAAsB,WAAW,WAAW;AAC5C,wBAAsB,OAAO,OAAO;AACpC,wBAAsB,UAAU,UAAU;AAC1C,MAAI,CAAC,OAAO,SAAS,aAAa,KAAK,gBAAgB,MAAM,iBAAiB,GAAG;AAC/E,UAAM,IAAI,eAAe,oDAAoD;AAAA,EAC/E;AACA,MAAI,QAAQ,kBAAkB,WACxB,CAAC,OAAO,SAAS,QAAQ,aAAa,KAAK,QAAQ,iBAAiB,gBAAgB;AACxF,UAAM,IAAI,eAAe,mDAAmD;AAAA,EAC9E;AACA,QAAM,YAAY,iBAAiB,QAAQ,SAAS;AACpD,QAAM,qBAAqB,QAAQ,OAAO,aAAa,EACpD,OAAO,CAAC,aAAa,SAAS,aAAa,aAAa,CAAC,aAAa,UAAU,KAAK,SAAS,aAAa,EAAE;AAChH,QAAM,eAAe,IAAI,IAAI,mBAAmB,IAAI,CAAC,aAAa,SAAS,EAAE,CAAC;AAC9E,QAAM,mBAAmB,MAAM,QAAQ,OAAO,gBAAgB,YAAY,GACvE,OAAO,CAAC,aAAa,aAAa,IAAI,SAAS,EAAE,CAAC;AAErD,QAAM,gBAAgB,oBAAI,IAAyB;AACnD,QAAM,WAAW,CAAC,QAAQ,OAAO;AACjC,MAAI,UAAU;AACZ,UAAM,QAAQ,OAAO,uBAAuB;AAAA,MAC1C,OAAO,KAAK,IAAI,KAAK,KAAK,IAAI,IAAI,YAAY,CAAC,CAAC;AAAA,MAChD;AAAA,MACA,GAAI,QAAQ,SAAS,EAAE,QAAQ,QAAQ,OAAO,IAAI,CAAC;AAAA,MACnD,GAAI,QAAQ,kBAAkB,EAAE,YAAY,QAAQ,gBAAgB,IAAI,CAAC;AAAA,IAC3E,CAAC;AAAA,EACH;AAGA,QAAM,cAAc,WAAW,QAAQ,OAAO,uBAAuB;AAAA,IACnE,qBAAqB,QAAQ,mBAAmB;AAAA,EAClD,CAAC,IAAI;AACL,QAAM,eAAe,CAAC,aAAkD;AACtE,mBAAe,QAAQ,MAAM;AAC7B,UAAM,QAAQ;AAAA,MACZ,qBAAqB,QAAQ,mBAAmB;AAAA,MAChD,OAAO;AAAA,MACP;AAAA,MACA,GAAI,QAAQ,kBAAkB,SAAY,EAAE,eAAe,QAAQ,cAAc,IAAI,CAAC;AAAA,MACtF;AAAA,MACA,GAAI,QAAQ,cAAc,SAAY,EAAE,WAAW,QAAQ,UAAU,IAAI,CAAC;AAAA,IAC5E;AACA,UAAM,WAAW,cAAc,YAAY,kBAAkB,SAAS,IAAI,KAAK,IAC3E,QAAQ,OAAO,kBAAkB,SAAS,IAAI,KAAK,GACpD,OAAO,CAAC,UAAU,aAAa,IAAI,MAAM,SAAS,EAAE,CAAC;AACxD,kBAAc,IAAI,SAAS,IAAI,IAAI,IAAI,QAAQ,IAAI,CAAC,UAAU,MAAM,SAAS,EAAE,CAAC,CAAC;AACjF,WAAO;AAAA,EACT;AAEA,QAAM,QAAQ,oBAAI,IAA2B;AAC7C,WAAS,QAAQ,GAAG,QAAQ,gBAAgB,QAAQ,SAAS,GAAG;AAC9D,UAAM,SAAS,gBAAgB,KAAK;AACpC,eAAW,SAAS,aAAa,MAAM,GAAG;AACxC,YAAM,CAAC,MAAM,KAAK,IAAI,iBAAiB,QAAQ,MAAM,QAAQ;AAC7D,YAAM,MAAM,QAAQ,KAAK,IAAI,MAAM,EAAE;AACrC,YAAM,WAAW,MAAM,IAAI,GAAG;AAC9B,UAAI,CAAC,YAAY,MAAM,aAAa,SAAS,YAAY;AACvD,cAAM,EAAE,UAAU,WAAW,GAAG,OAAO,IAAI;AAC3C,cAAM,IAAI,KAAK,EAAE,MAAM,OAAO,GAAG,OAAO,CAAC;AAAA,MAC3C;AAAA,IACF;AACA,YAAQ,aAAa,EAAE,WAAW,QAAQ,GAAG,OAAO,gBAAgB,OAAO,CAAC;AAAA,EAC9E;AAEA,QAAM,cAAc,CAAC,GAAG,MAAM,OAAO,CAAC,EAAE,IAAI,CAAC,SAAS;AACpD,UAAM,gBAAgB,cAAc,IAAI,KAAK,KAAK,EAAE;AACpD,UAAM,iBAAiB,cAAc,IAAI,KAAK,MAAM,EAAE;AACtD,UAAM,aAAa,iBAAiB,iBAChC,cAAc,IAAI,KAAK,MAAM,EAAE,KAAK,eAAe,IAAI,KAAK,KAAK,EAAE,IACnE;AACJ,WAAO,UAAU,MAAM,YAAY,aAAa;AAAA,EAClD,CAAC,EAAE,KAAK,YAAY;AACpB,cAAY,QAAQ,CAAC,MAAM,UAAU;AACnC,SAAK,OAAO,QAAQ;AAAA,EACtB,CAAC;AAED,QAAM,kBAAkB,aAAa,SAAS,SAAS,aAAa,SAAS,UAAa,aAAa,cAAc;AACrH,QAAM,UAAU;AAAA,IACd,kBAAkB,eAAe;AAAA,IACjC,gBAAgB;AAAA,IAChB,mBAAmB;AAAA,IACnB;AAAA,EACF;AACA,QAAM,gBAAgB,YAAY,MAAM,GAAG,KAAK;AAChD,QAAM,QAAQ,eAAe,iBAAiB,WAAW,EACtD,OAAO,CAAC,SAAS,KAAK,mBAAmB,KAAK,qBAAqB,KAAK,mBAAmB,CAAC,EAC5F,MAAM,GAAG,KAAK;AACjB,QAAM,SAAS,YAAY,aAAa;AACxC,SAAO;AAAA,IACL,eAAe;AAAA,IACf,YAAY;AAAA,MACV,YAAY,OAAO;AAAA,MACnB,eAAe,OAAO;AAAA,MACtB,kBAAkB,OAAO;AAAA,MACzB,oBAAoB,OAAO;AAAA,IAC7B;AAAA,IACA,YAAY;AAAA,MACV,GAAG;AAAA,MACH;AAAA,MACA;AAAA,MACA;AAAA,MACA,GAAI,QAAQ,kBAAkB,SAAY,EAAE,eAAe,QAAQ,cAAc,IAAI,CAAC;AAAA,MACtF;AAAA,MACA,GAAI,QAAQ,cAAc,SAAY,EAAE,WAAW,QAAQ,UAAU,IAAI,CAAC;AAAA,MAC1E;AAAA,IACF;AAAA,IACA;AAAA,IACA,OAAO;AAAA,IACP;AAAA,IACA;AAAA,EACF;AACF;AAEO,SAAS,iBAAiB,UAAkB,WAAqC;AACtF,QAAM,iBAAiB,SAAS,WAAW,MAAM,GAAG;AACpD,QAAM,kBAAkB,UAAU,WAAW,MAAM,GAAG;AACtD,QAAM,gBAAgB,eAAe,cAAc;AACnD,QAAM,iBAAiB,eAAe,eAAe;AACrD,MAAI,eAAe;AACnB,SAAO,eAAe,cAAc,UAC/B,eAAe,eAAe,UAC9B,cAAc,YAAY,MAAM,eAAe,YAAY,GAAG;AACjE,oBAAgB;AAAA,EAClB;AACA,QAAM,cAAc,cAAc,MAAM,GAAG,YAAY;AACvD,QAAM,iBAAiB,YAAY,SAAS,IAAI,YAAY,KAAK,GAAG,IAAI;AACxE,QAAM,WAAW,mBAAmB;AACpC,QAAM,aAAa,WACf,IACA,cAAc,SAAS,eAAe,eAAe,SAAS;AAClE,SAAO;AAAA,IACL,UAAU,WAAW,cAAc,eAAe,IAAI,gBAAgB;AAAA,IACtE,kBAAkB,WAAW,IAAI,IAAI;AAAA,IACrC;AAAA,IACA;AAAA,IACA,gBAAgB,WAAW,cAAc,MAAM,WAAW,eAAe;AAAA,EAC3E;AACF;AAEA,SAAS,UAAU,MAAqB,YAA4B,eAAqC;AACvG,QAAM,WAAW,iBAAiB,KAAK,KAAK,MAAM,KAAK,MAAM,IAAI;AACjE,QAAM,iBAAiB,OAAO,KAAK,aAAa,kBAAkB,IAAI,cAAc;AACpF,QAAM,mBAAmB,IAAI,KAAK,IAAI,CAAC,SAAS,mBAAmB,CAAC;AACpE,SAAO;AAAA,IACL,MAAM;AAAA,IACN,MAAM,KAAK;AAAA,IACX,OAAO,KAAK;AAAA,IACZ,YAAY,KAAK;AAAA,IACjB,GAAI,KAAK,mBAAmB,SAAY,EAAE,gBAAgB,KAAK,eAAe,IAAI,CAAC;AAAA,IACnF,GAAI,KAAK,0BAA0B,SAAY,EAAE,uBAAuB,KAAK,sBAAsB,IAAI,CAAC;AAAA,IACxG,GAAI,KAAK,8BAA8B,SAAY,EAAE,2BAA2B,KAAK,0BAA0B,IAAI,CAAC;AAAA,IACpH;AAAA,IACA;AAAA,IACA;AAAA,IACA,aAAa,iBAAiB;AAAA,IAC9B;AAAA,EACF;AACF;AAEA,SAAS,iBACP,OACA,mBACA,oBACA,OAC2B;AAC3B,QAAM,cAAc,MAAM,OAAO,CAAC,KAAK,SAAS,MAAM,KAAK,gBAAgB,CAAC;AAC5E,QAAM,iBAAiB,MACpB,OAAO,CAAC,SAAS,KAAK,SAAS,aAAa,WAAW,EACvD,OAAO,CAAC,KAAK,SAAS,MAAM,KAAK,gBAAgB,CAAC;AACrD,QAAM,mBAAmB,MACtB,OAAO,CAAC,SAAS,KAAK,SAAS,aAAa,aAAa,EACzD,OAAO,CAAC,KAAK,SAAS,MAAM,KAAK,gBAAgB,CAAC;AACrD,QAAM,eAAe,MAClB,OAAO,CAAC,SAAS,KAAK,SAAS,aAAa,kBAAkB,EAC9D,OAAO,CAAC,KAAK,SAAS,MAAM,KAAK,gBAAgB,CAAC;AACrD,QAAM,mBAAmB,MAAM;AAAA,IAC7B,CAAC,KAAK,SAAS,MAAM,KAAK,iBAAiB,KAAK,SAAS;AAAA,IACzD;AAAA,EACF;AACA,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA,eAAe,MAAM;AAAA,IACrB,eAAe,MAAM,gBAAgB,WAAW;AAAA,IAChD,iBAAiB,MAAM,kBAAkB,WAAW;AAAA,IACpD,aAAa,MAAM,cAAc,WAAW;AAAA,IAC5C,sBAAsB,MAAM,kBAAkB,WAAW;AAAA,EAC3D;AACF;AAEA,SAAS,eACP,iBACA,OACsB;AACtB,QAAM,YAAY,IAAI,IAAI,gBAAgB,IAAI,CAAC,aAAa,SAAS,EAAE,CAAC;AACxE,QAAM,SAAS,oBAAI,IAAoB;AACvC,aAAW,YAAY,gBAAiB,QAAO,IAAI,SAAS,OAAO,OAAO,IAAI,SAAS,IAAI,KAAK,KAAK,CAAC;AACtG,QAAM,UAAU,oBAAI,IAAgC;AACpD,aAAW,CAAC,UAAU,aAAa,KAAK,QAAQ;AAC9C,YAAQ,IAAI,UAAU;AAAA,MACpB,MAAM;AAAA,MACN;AAAA,MACA,kBAAkB;AAAA,MAClB,oBAAoB;AAAA,MACpB,kBAAkB;AAAA,MAClB,uBAAuB;AAAA,IACzB,CAAC;AAAA,EACH;AACA,aAAW,QAAQ,OAAO;AACxB,QAAI,UAAU,IAAI,KAAK,KAAK,EAAE,EAAG,iBAAgB,QAAQ,IAAI,KAAK,KAAK,IAAI,GAAI,KAAK,OAAO,IAAI;AAC/F,QAAI,UAAU,IAAI,KAAK,MAAM,EAAE,EAAG,iBAAgB,QAAQ,IAAI,KAAK,MAAM,IAAI,GAAI,KAAK,MAAM,IAAI;AAAA,EAClG;AACA,aAAW,UAAU,QAAQ,OAAO,GAAG;AACrC,UAAM,QAAQ,OAAO,mBAAmB,OAAO,qBAAqB,OAAO;AAC3E,WAAO,wBAAwB,MAAM,OAAO,kBAAkB,KAAK;AAAA,EACrE;AACA,SAAO,CAAC,GAAG,QAAQ,OAAO,CAAC,EAAE,KAAK,CAAC,MAAM,UAAU,MAAM,wBAAwB,KAAK,yBACjF,MAAM,mBAAmB,KAAK,oBAC9B,KAAK,KAAK,cAAc,MAAM,IAAI,CAAC;AAC1C;AAEA,SAAS,gBACP,QACA,OACA,MACM;AACN,MAAI,KAAK,SAAS,aAAa,YAAa,QAAO,oBAAoB,KAAK;AAAA,WACnE,KAAK,SAAS,aAAa,cAAe,QAAO,sBAAsB,KAAK;AAAA,OAChF;AACH,WAAO,oBAAoB,KAAK;AAChC,4BAAwB,QAAQ,OAAO,IAAI;AAAA,EAC7C;AACF;AAEA,SAAS,wBACP,QACA,UACA,MACM;AACN,MAAI,CAAC,OAAO,0BAA0B,KAAK,cAAc,OAAO,uBAAuB,aAAa;AAClG,WAAO,yBAAyB;AAAA,MAC9B,UAAU;AAAA,MACV,YAAY,KAAK;AAAA,MACjB,GAAI,KAAK,mBAAmB,SAAY,EAAE,gBAAgB,KAAK,eAAe,IAAI,CAAC;AAAA,MACnF,GAAI,KAAK,0BAA0B,SAAY,EAAE,uBAAuB,KAAK,sBAAsB,IAAI,CAAC;AAAA,MACxG,GAAI,KAAK,8BAA8B,SAAY,EAAE,2BAA2B,KAAK,0BAA0B,IAAI,CAAC;AAAA,MACpH,aAAa,KAAK;AAAA,IACpB;AAAA,EACF;AACF;AAEA,SAAS,YAAY,OAAiD;AACpE,QAAM,YAAY,oBAAI,IAA6B;AACnD,QAAM,YAAY,oBAAI,IAAyB;AAC/C,aAAW,QAAQ,OAAO;AACxB,cAAU,IAAI,KAAK,KAAK,IAAI,KAAK,IAAI;AACrC,cAAU,IAAI,KAAK,MAAM,IAAI,KAAK,KAAK;AACvC,gBAAY,WAAW,KAAK,KAAK,IAAI,KAAK,MAAM,EAAE;AAClD,gBAAY,WAAW,KAAK,MAAM,IAAI,KAAK,KAAK,EAAE;AAAA,EACpD;AACA,QAAM,OAAO,oBAAI,IAAY;AAC7B,QAAM,SAA0B,CAAC;AACjC,aAAW,SAAS,UAAU,KAAK,GAAG;AACpC,QAAI,KAAK,IAAI,KAAK,EAAG;AACrB,UAAM,UAAU,CAAC,KAAK;AACtB,UAAM,YAAY,oBAAI,IAAY;AAClC,WAAO,QAAQ,SAAS,GAAG;AACzB,YAAM,KAAK,QAAQ,IAAI;AACvB,UAAI,KAAK,IAAI,EAAE,EAAG;AAClB,WAAK,IAAI,EAAE;AACX,gBAAU,IAAI,EAAE;AAChB,iBAAW,YAAY,UAAU,IAAI,EAAE,KAAK,CAAC,EAAG,SAAQ,KAAK,QAAQ;AAAA,IACvE;AACA,UAAM,aAAa,MAAM,OAAO,CAAC,SAAS,UAAU,IAAI,KAAK,KAAK,EAAE,KAAK,UAAU,IAAI,KAAK,MAAM,EAAE,CAAC;AACrG,UAAM,UAAU,CAAC,GAAG,SAAS,EAAE,IAAI,CAAC,OAAO,UAAU,IAAI,EAAE,CAAE,EAAE,KAAK,gBAAgB;AACpF,WAAO,KAAK;AAAA,MACV,MAAM;AAAA,MACN,aAAa,QAAQ;AAAA,MACrB,WAAW,IAAI,IAAI,QAAQ,IAAI,CAAC,WAAW,OAAO,IAAI,CAAC,EAAE;AAAA,MACzD,uBAAuB,KAAK,IAAI,GAAG,WAAW,IAAI,CAAC,SAAS,KAAK,UAAU,CAAC;AAAA,MAC5E,uBAAuB,KAAK,IAAI,GAAG,WAAW,IAAI,CAAC,SAAS,KAAK,UAAU,CAAC;AAAA,MAC5E,yBAAyB,KAAK,IAAI,GAAG,WAAW,IAAI,CAAC,SAAS,KAAK,SAAS,gBAAgB,CAAC;AAAA,MAC7F,oBAAoB,KAAK,IAAI,GAAG,WAAW,IAAI,CAAC,SAAS,KAAK,WAAW,CAAC;AAAA,MAC1E;AAAA,IACF,CAAC;AAAA,EACH;AACA,SAAO,KAAK,CAAC,MAAM,UAAU,MAAM,qBAAqB,KAAK,sBACxD,MAAM,cAAc,KAAK,eACzB,iBAAiB,KAAK,QAAQ,CAAC,GAAI,MAAM,QAAQ,CAAC,CAAE,CAAC;AAC1D,SAAO,QAAQ,CAAC,OAAO,UAAU;AAC/B,UAAM,OAAO,QAAQ;AAAA,EACvB,CAAC;AACD,SAAO;AACT;AAEA,SAAS,eAAe,UAA4B;AAClD,QAAM,YAAY,KAAK,MAAM,QAAQ,SAAS,WAAW,MAAM,GAAG,CAAC;AACnE,SAAO,cAAc,MAAM,CAAC,IAAI,UAAU,MAAM,GAAG,EAAE,OAAO,OAAO;AACrE;AAEA,SAAS,WAAW,UAA2B;AAC7C,QAAM,WAAW,SAAS,WAAW,MAAM,GAAG;AAC9C,QAAM,aAAa,SAAS,YAAY;AACxC,QAAM,WAAW,WAAW,MAAM,GAAG;AACrC,QAAM,WAAW,SAAS,GAAG,EAAE,KAAK;AACpC,SAAO,SAAS,KAAK,CAAC,YAAY,YAAY,UAAU,YAAY,WAAW,YAAY,WAAW,KACjG,iCAAiC,KAAK,QAAQ,KAC9C,aAAa,KAAK,QAAQ,KAC1B,2CAA2C,KAAK,QAAQ,KACxD,yCAAyC,KAAK,SAAS,MAAM,GAAG,EAAE,GAAG,EAAE,KAAK,EAAE;AACrF;AAEA,SAAS,iBAAiB,MAAuB,OAA4D;AAC3G,SAAO,iBAAiB,MAAM,KAAK,KAAK,IAAI,CAAC,MAAM,KAAK,IAAI,CAAC,OAAO,IAAI;AAC1E;AAEA,SAAS,iBAAiB,MAAuB,OAAgC;AAC/E,SAAO,KAAK,KAAK,cAAc,MAAM,IAAI,KACpC,KAAK,YAAY,MAAM,aACvB,KAAK,cAAc,MAAM,eACzB,KAAK,cAAc,cAAc,MAAM,aAAa,KACpD,KAAK,KAAK,MAAM;AACvB;AAEA,SAAS,aAAa,MAAoB,OAA6B;AACrE,SAAO,MAAM,cAAc,KAAK,eAC3B,MAAM,aAAa,KAAK,cACxB,OAAO,MAAM,eAAe,IAAI,IAAI,OAAO,KAAK,eAAe,IAAI,KACnE,iBAAiB,KAAK,MAAM,MAAM,IAAI,KACtC,iBAAiB,KAAK,OAAO,MAAM,KAAK;AAC/C;AAEA,SAAS,QAAQ,QAAgB,SAAyB;AACxD,SAAO,SAAS,UAAU,GAAG,MAAM,IAAI,OAAO,KAAK,GAAG,OAAO,IAAI,MAAM;AACzE;AAEA,SAAS,YAAY,WAAqC,QAAgB,QAAsB;AAC9F,QAAM,SAAS,UAAU,IAAI,MAAM,KAAK,oBAAI,IAAY;AACxD,SAAO,IAAI,MAAM;AACjB,YAAU,IAAI,QAAQ,MAAM;AAC9B;AAEA,SAAS,MAAM,WAAmB,aAA6B;AAC7D,SAAO,gBAAgB,IAAI,IAAI,YAAY;AAC7C;AAEA,SAAS,MAAM,OAAuB;AACpC,SAAO,KAAK,IAAI,GAAG,KAAK,IAAI,GAAG,KAAK,CAAC;AACvC;;;ADlXA,gBAAuB,YAAY,SAAgE;AACjG,QAAM,SAAS,QAAQ,UAAU,QAAQ;AACzC,QAAM,eAAe,QAAQ,OAAO,OAAO;AAC3C,QAAM,eAAe,OAAO,OAAO;AACnC,QAAM,gBAAgB,KAAK,UAAU,aAAa,gBAAgB;AAClE,QAAM,gBAAgB,KAAK,UAAU,aAAa,gBAAgB;AAClE,MAAI,kBAAkB,eAAe;AACnC,UAAM,IAAI,uBAAuB,qDAAqD;AAAA,EACxF;AACA,QAAM,UAAU;AAAA,IACd,GAAG,mBAAmB,cAAc,YAAY;AAAA,IAChD,0BAA0B,aAAa;AAAA,IACvC,0BAA0B,aAAa;AAAA,EACzC;AACA,QAAM,sBAAsB,QAAQ,mBAAmB;AAEvD,QAAM,QAAQ,QAAQ,oBAAoB;AAC1C,wBAAsB,OAAO,kBAAkB;AAC/C,QAAM,WAAW,QAAQ,YAAY;AACrC,wBAAsB,UAAU,UAAU;AAC1C,QAAM,YAAY,iBAAiB,QAAQ,SAAS;AACpD,QAAM,mBAAmB,MAAM,QAAQ,OAAO,gBAAgB,QAAQ,gBAAgB,EAAE,MAAM,MAAM,CAAC,GAClG,OAAO,CAAC,aAAa,SAAS,aAAa,aAAa,CAAC,aAAa,UAAU,KAAK,SAAS,aAAa,EAAE;AAChH,QAAM,YAAY,OAAO,cAAc,QAAQ,OAAO,aACjD,MAAM,aAAa,OAAO,SAAS,MAAM,MAAM,aAAa,QAAQ,OAAO,SAAS;AACzF,QAAM,aAAa,QAAQ,gBAAgB,MAAM,cAAc,QAAQ,OAAO,OAAO,IAAI;AACzF,QAAM,aAAa,QAAQ,gBACvB,YAAY,aAAc,MAAM,cAAc,OAAO,OAAO,IAC5D;AACJ,QAAM,cAAc,QAAQ,YAAY,CAAC,YACrC,MAAM,cAAc,QAAQ,OAAO,OAAO,MAAM,MAAM,cAAc,OAAO,OAAO,IAClF;AACJ,QAAM,iBAAiB,oBAAI,IAA6B;AACxD,QAAM,gBAAgB,CAAC,MAAc,aAAsC;AACzE,UAAM,eAAeC,MAAK,QAAQ,MAAM,QAAQ;AAChD,QAAI,SAAS,eAAe,IAAI,YAAY;AAC5C,QAAI,CAAC,QAAQ;AACX,eAAS,aAAa,YAAY;AAClC,qBAAe,IAAI,cAAc,MAAM;AAAA,IACzC;AACA,WAAO;AAAA,EACT;AACA,QAAM,6BAA6B,oBAAI,IAAsB;AAC7D,MAAI,YAAY;AACd,UAAM,cAAc,CAAC,GAAG,IAAI,IAAI,OAAO,aAAa,EAAE,IAAI,CAAC,aAAa,SAAS,IAAI,CAAC,CAAC;AACvF,UAAM,QAAQ,IAAI,YAAY,IAAI,OAAO,eAAe;AACtD,YAAM,gBAAgB,MAAM,cAAc,YAAY,UAAU;AAChE,YAAM,QAAQ,2BAA2B,IAAI,aAAa,KAAK,CAAC;AAChE,YAAM,KAAK,UAAU;AACrB,iCAA2B,IAAI,eAAe,KAAK;AAAA,IACrD,CAAC,CAAC;AAAA,EACJ;AACA,QAAM,YAAY,oBAAI,IAAY;AAClC,QAAM,WAAW,aAAa,CAAC,QAAQ,OAAO;AAC9C,MAAI,UAAU;AACZ,UAAM,QAAQ,OAAO,uBAAuB;AAAA,MAC1C,OAAO,KAAK,IAAI,KAAK,KAAK,IAAI,IAAI,QAAQ,CAAC,CAAC;AAAA,MAC5C,eAAe,QAAQ,iBAAiB;AAAA,MACxC,GAAI,QAAQ,SAAS,EAAE,QAAQ,QAAQ,OAAO,IAAI,CAAC;AAAA,MACnD,GAAI,QAAQ,kBAAkB,EAAE,YAAY,QAAQ,gBAAgB,IAAI,CAAC;AAAA,IAC3E,CAAC;AAAA,EACH;AAGA,QAAM,cAAc,WAAW,QAAQ,OAAO,uBAAuB,EAAE,oBAAoB,CAAC,IAAI;AAChG,WAAS,QAAQ,GAAG,QAAQ,gBAAgB,QAAQ,SAAS,GAAG;AAC9D,mBAAe,QAAQ,MAAM;AAC7B,UAAM,SAAS,gBAAgB,KAAK;AACpC,UAAM,sBAAsB,aAAa,MAAM,cAAc,YAAY,OAAO,IAAI,IAAI;AACxF,UAAM,sBAAsB,sBAAsB,2BAA2B,IAAI,mBAAmB,IAAI;AACxG,UAAM,eAAe,sBAAsB,EAAE,cAAc,oBAAoB,IAAI,CAAC;AACpF,UAAM,UAAU,cAAc,YAAY,oBAAoB,QAAQ,OAAO,kBAAkB,KAAK,QAAQ,MAAM;AAClH,UAAM,aAAa,YACf,QAAQ,OAAO,IAAI;AAAA,MACnB;AAAA,MACA;AAAA,MACA,eAAe,QAAQ,iBAAiB;AAAA,MACxC,GAAI,QAAQ,kBAAkB,SAAY,EAAE,eAAe,QAAQ,cAAc,IAAI,CAAC;AAAA,MACtF;AAAA,MACA,GAAI,QAAQ,cAAc,SAAY,EAAE,WAAW,QAAQ,UAAU,IAAI,CAAC;AAAA,MAC1E,GAAG;AAAA,IACL,CAAC,IACC,OAAO,eAAe,QAAQ,OAAO,kBAAkB,OAAO,EAAE,GAAG;AAAA,MACnE,GAAI,sBAAsB;AAAA,QACxB,mBAAmB,QAAQ,OAAO,kBAAkB,OAAO,IAAI,aAAa;AAAA,QAC5E,uBAAuB,QAAQ,OAAO,cAAc,OAAO,IAAI;AAAA,MACjE,IAAI,CAAC;AAAA,MACL;AAAA,MACA,eAAe,QAAQ,iBAAiB;AAAA,MACxC,GAAI,QAAQ,kBAAkB,SAAY,EAAE,eAAe,QAAQ,cAAc,IAAI,CAAC;AAAA,MACtF;AAAA,MACA,GAAI,QAAQ,cAAc,SAAY,EAAE,WAAW,QAAQ,UAAU,IAAI,CAAC;AAAA,MAC1E,GAAG;AAAA,IACL,CAAC;AACH,UAAM,mBAAmB,QAAQ,WAC7B,WAAW,IAAI,CAAC,WAAW;AAAA,MAC3B,GAAG;AAAA,MACH,kBAAkB,iBAAiB,OAAO,MAAM,MAAM,SAAS,IAAI,EAAE,mBAAmB,OAAO,WAAW;AAAA,IAC5G,EAAE,EAAE,KAAK,CAAC,MAAM,UAAU,MAAM,mBAAmB,KAAK,oBACnD,MAAM,aAAa,KAAK,cACxB,KAAK,SAAS,KAAK,cAAc,MAAM,SAAS,IAAI,KACpD,KAAK,SAAS,YAAY,MAAM,SAAS,aACzC,KAAK,SAAS,KAAK,MAAM,SAAS,EAAE,IACvC;AACJ,UAAM,UAAU,aAAa,CAAC,QAAQ,6BAClC,iBAAiB,OAAO,CAAC,UAAU;AACnC,YAAM,OAAO,OAAO,KAAK,MAAM,SAAS,KACpC,GAAG,OAAO,EAAE,IAAI,MAAM,SAAS,EAAE,KACjC,GAAG,MAAM,SAAS,EAAE,IAAI,OAAO,EAAE;AACrC,UAAI,UAAU,IAAI,IAAI,EAAG,QAAO;AAChC,gBAAU,IAAI,IAAI;AAClB,aAAO;AAAA,IACT,CAAC,IACC;AACJ,QAAI,QAAQ,SAAS,EAAG,OAAM,EAAE,QAAQ,SAAS,QAAQ;AACzD,YAAQ,aAAa,EAAE,WAAW,QAAQ,GAAG,OAAO,gBAAgB,OAAO,CAAC;AAAA,EAC9E;AACF;AAEA,eAAe,cAAc,MAA+B;AAC1D,MAAI;AACF,WAAO,MAAM,SAAS,IAAI;AAAA,EAC5B,QAAQ;AACN,WAAOA,MAAK,QAAQ,IAAI;AAAA,EAC1B;AACF;AAEA,eAAe,aAAa,UAAmC;AAC7D,MAAI;AACF,UAAM,WAAW,MAAM,KAAK,QAAQ;AACpC,WAAO,SAAS,SAAS,GAAG,IAAI,SAAS,GAAG;AAAA,EAC9C,QAAQ;AACN,WAAO,QAAQA,MAAK,QAAQ,QAAQ,CAAC;AAAA,EACvC;AACF;","names":["path","path"]}

package/dist/chunk-MKUTTXZB.js

@@ -1,74 +0,0 @@
-import {
-  requestEmbeddings
-} from "./chunk-JAVPHCZH.js";
-import {
-  reportModelCall
-} from "./chunk-BXWO2KMC.js";
-import {
-  DEFAULT_PARALLELISM
-} from "./chunk-VH5VGRCI.js";
-
-// src/embeddings/openai.ts
-import { createOpenAI } from "@ai-sdk/openai";
-import { embed, embedMany } from "ai";
-import { Tiktoken } from "js-tiktoken/lite";
-import cl100kBase from "js-tiktoken/ranks/cl100k_base";
-var MAX_INPUT_TOKENS = 8192;
-var tokenizer;
-function truncateInput(input) {
-  tokenizer ??= new Tiktoken(cl100kBase);
-  const tokens = tokenizer.encode(input, [], []);
-  return tokens.length <= MAX_INPUT_TOKENS ? input : tokenizer.decode(tokens.slice(0, MAX_INPUT_TOKENS));
-}
-var OpenAIEmbeddingProvider = class {
-  profile;
-  #model;
-  #verbose;
-  #parallelism;
-  constructor(options = {}) {
-    const apiKey = options.apiKey ?? process.env.OPENAI_API_KEY ?? "";
-    if (!apiKey) throw new Error("OPENAI_API_KEY is required.");
-    const model = options.model ?? "text-embedding-3-large";
-    const dimensions = options.dimensions ?? 3072;
-    if (!Number.isInteger(dimensions) || dimensions < 1) throw new Error("dimensions must be a positive integer.");
-    this.profile = { provider: "openai", model, dimensions, strategyVersion: "callable-v2" };
-    this.#verbose = options.verbose ?? false;
-    this.#parallelism = options.parallelism ?? DEFAULT_PARALLELISM;
-    this.#model = createOpenAI({
-      apiKey,
-      baseURL: (options.baseUrl ?? "https://api.openai.com/v1").replace(/\/$/, "")
-    }).embeddingModel(model);
-  }
-  async embedDocuments(inputs, options) {
-    if (inputs.length === 0) return [];
-    reportModelCall("vectors", this.profile, this.#verbose, this.#parallelism);
-    return requestEmbeddings(
-      embedMany({
-        model: this.#model,
-        values: inputs.map(truncateInput),
-        providerOptions: { openai: { dimensions: this.profile.dimensions } },
-        ...options?.signal ? { abortSignal: options.signal } : {}
-      }).then(({ embeddings }) => embeddings),
-      this.profile.dimensions,
-      options?.signal
-    );
-  }
-  async embedQuery(input, options) {
-    reportModelCall("vectors", this.profile, this.#verbose, 1);
-    return (await requestEmbeddings(
-      embed({
-        model: this.#model,
-        value: truncateInput(input),
-        providerOptions: { openai: { dimensions: this.profile.dimensions } },
-        ...options?.signal ? { abortSignal: options.signal } : {}
-      }).then(({ embedding }) => [embedding]),
-      this.profile.dimensions,
-      options?.signal
-    ))[0];
-  }
-};
-
-export {
-  OpenAIEmbeddingProvider
-};
-//# sourceMappingURL=chunk-MKUTTXZB.js.map

package/dist/chunk-MKUTTXZB.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/embeddings/openai.ts"],"sourcesContent":["import { createOpenAI } from \"@ai-sdk/openai\";\nimport { embed, embedMany } from \"ai\";\nimport { Tiktoken } from \"js-tiktoken/lite\";\nimport cl100kBase from \"js-tiktoken/ranks/cl100k_base\";\n\nimport type { EmbeddingProvider } from \"../types.js\";\nimport { reportModelCall } from \"../model-call-notice.js\";\nimport { DEFAULT_PARALLELISM } from \"../utils.js\";\nimport { requestEmbeddings } from \"./ai-sdk.js\";\n\nconst MAX_INPUT_TOKENS = 8192;\nlet tokenizer: Tiktoken | undefined;\n\nfunction truncateInput(input: string): string {\n  tokenizer ??= new Tiktoken(cl100kBase);\n  const tokens = tokenizer.encode(input, [], []);\n  return tokens.length <= MAX_INPUT_TOKENS ? input : tokenizer.decode(tokens.slice(0, MAX_INPUT_TOKENS));\n}\n\nexport interface OpenAIEmbeddingProviderOptions {\n  apiKey?: string;\n  model?: string;\n  dimensions?: number;\n  baseUrl?: string;\n  verbose?: boolean;\n  parallelism?: number;\n}\n\nexport class OpenAIEmbeddingProvider implements EmbeddingProvider {\n  public readonly profile;\n  readonly #model;\n  readonly #verbose: boolean;\n  readonly #parallelism: number;\n\n  public constructor(options: OpenAIEmbeddingProviderOptions = {}) {\n    const apiKey = options.apiKey ?? process.env.OPENAI_API_KEY ?? \"\";\n    if (!apiKey) throw new Error(\"OPENAI_API_KEY is required.\");\n    const model = options.model ?? \"text-embedding-3-large\";\n    const dimensions = options.dimensions ?? 3072;\n    if (!Number.isInteger(dimensions) || dimensions < 1) throw new Error(\"dimensions must be a positive integer.\");\n    this.profile = { provider: \"openai\", model, dimensions, strategyVersion: \"callable-v2\" } as const;\n    this.#verbose = options.verbose ?? false;\n    this.#parallelism = options.parallelism ?? DEFAULT_PARALLELISM;\n    this.#model = createOpenAI({\n      apiKey,\n      baseURL: (options.baseUrl ?? \"https://api.openai.com/v1\").replace(/\\/$/, \"\"),\n    }).embeddingModel(model);\n  }\n\n  public async embedDocuments(inputs: readonly string[], options?: { signal?: AbortSignal }): Promise<number[][]> {\n    if (inputs.length === 0) return [];\n    reportModelCall(\"vectors\", this.profile, this.#verbose, this.#parallelism);\n    return requestEmbeddings(\n      embedMany({\n        model: this.#model,\n        values: inputs.map(truncateInput),\n        providerOptions: { openai: { dimensions: this.profile.dimensions } },\n        ...(options?.signal ? { abortSignal: options.signal } : {}),\n      }).then(({ embeddings }) => embeddings),\n      this.profile.dimensions,\n      options?.signal,\n    );\n  }\n\n  public async embedQuery(input: string, options?: { signal?: AbortSignal }): Promise<number[]> {\n    reportModelCall(\"vectors\", this.profile, this.#verbose, 1);\n    return (await requestEmbeddings(\n      embed({\n        model: this.#model,\n        value: truncateInput(input),\n        providerOptions: { openai: { dimensions: this.profile.dimensions } },\n        ...(options?.signal ? { abortSignal: options.signal } : {}),\n      }).then(({ embedding }) => [embedding]),\n      this.profile.dimensions,\n      options?.signal,\n    ))[0]!;\n  }\n}\n"],"mappings":";;;;;;;;;;;AAAA,SAAS,oBAAoB;AAC7B,SAAS,OAAO,iBAAiB;AACjC,SAAS,gBAAgB;AACzB,OAAO,gBAAgB;AAOvB,IAAM,mBAAmB;AACzB,IAAI;AAEJ,SAAS,cAAc,OAAuB;AAC5C,gBAAc,IAAI,SAAS,UAAU;AACrC,QAAM,SAAS,UAAU,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC;AAC7C,SAAO,OAAO,UAAU,mBAAmB,QAAQ,UAAU,OAAO,OAAO,MAAM,GAAG,gBAAgB,CAAC;AACvG;AAWO,IAAM,0BAAN,MAA2D;AAAA,EAChD;AAAA,EACP;AAAA,EACA;AAAA,EACA;AAAA,EAEF,YAAY,UAA0C,CAAC,GAAG;AAC/D,UAAM,SAAS,QAAQ,UAAU,QAAQ,IAAI,kBAAkB;AAC/D,QAAI,CAAC,OAAQ,OAAM,IAAI,MAAM,6BAA6B;AAC1D,UAAM,QAAQ,QAAQ,SAAS;AAC/B,UAAM,aAAa,QAAQ,cAAc;AACzC,QAAI,CAAC,OAAO,UAAU,UAAU,KAAK,aAAa,EAAG,OAAM,IAAI,MAAM,wCAAwC;AAC7G,SAAK,UAAU,EAAE,UAAU,UAAU,OAAO,YAAY,iBAAiB,cAAc;AACvF,SAAK,WAAW,QAAQ,WAAW;AACnC,SAAK,eAAe,QAAQ,eAAe;AAC3C,SAAK,SAAS,aAAa;AAAA,MACzB;AAAA,MACA,UAAU,QAAQ,WAAW,6BAA6B,QAAQ,OAAO,EAAE;AAAA,IAC7E,CAAC,EAAE,eAAe,KAAK;AAAA,EACzB;AAAA,EAEA,MAAa,eAAe,QAA2B,SAAyD;AAC9G,QAAI,OAAO,WAAW,EAAG,QAAO,CAAC;AACjC,oBAAgB,WAAW,KAAK,SAAS,KAAK,UAAU,KAAK,YAAY;AACzE,WAAO;AAAA,MACL,UAAU;AAAA,QACR,OAAO,KAAK;AAAA,QACZ,QAAQ,OAAO,IAAI,aAAa;AAAA,QAChC,iBAAiB,EAAE,QAAQ,EAAE,YAAY,KAAK,QAAQ,WAAW,EAAE;AAAA,QACnE,GAAI,SAAS,SAAS,EAAE,aAAa,QAAQ,OAAO,IAAI,CAAC;AAAA,MAC3D,CAAC,EAAE,KAAK,CAAC,EAAE,WAAW,MAAM,UAAU;AAAA,MACtC,KAAK,QAAQ;AAAA,MACb,SAAS;AAAA,IACX;AAAA,EACF;AAAA,EAEA,MAAa,WAAW,OAAe,SAAuD;AAC5F,oBAAgB,WAAW,KAAK,SAAS,KAAK,UAAU,CAAC;AACzD,YAAQ,MAAM;AAAA,MACZ,MAAM;AAAA,QACJ,OAAO,KAAK;AAAA,QACZ,OAAO,cAAc,KAAK;AAAA,QAC1B,iBAAiB,EAAE,QAAQ,EAAE,YAAY,KAAK,QAAQ,WAAW,EAAE;AAAA,QACnE,GAAI,SAAS,SAAS,EAAE,aAAa,QAAQ,OAAO,IAAI,CAAC;AAAA,MAC3D,CAAC,EAAE,KAAK,CAAC,EAAE,UAAU,MAAM,CAAC,SAAS,CAAC;AAAA,MACtC,KAAK,QAAQ;AAAA,MACb,SAAS;AAAA,IACX,GAAG,CAAC;AAAA,EACN;AACF;","names":[]}