@lzehrung/codegraph 2.1.0

package/dist/graph-edge-collector.d.ts

@@ -0,0 +1,57 @@
+import type { ParserLanguage } from "./parserBackend.js";
+import { type PreparedSFCEmbeddedBlock } from "./languages/filePrep.js";
+import { type LanguageExtensionMap, type LanguageSupport } from "./languages.js";
+import type { Edge } from "./types.js";
+import type { WorkspaceConfig } from "./util/workspace.js";
+import type { LogLevel } from "./logging.js";
+import type { NativeRuntimeMode, NativeQueryResults } from "./native/treeSitterNative.js";
+import type { FallbackImportExtractionEvent } from "./graphs/specifiers.js";
+import type { GraphCacheEntry } from "./graphs/types.js";
+import type { BuildReport } from "./indexer/types.js";
+import type { SyntaxTreeLike } from "./languages/types.js";
+import type { SqlFactCache } from "./sql/sourceGraph.js";
+/**
+ * Collapses duplicate edges.
+ *
+ * File-dependency edges identify on the resolved target: several import bindings that
+ * resolve to one file express a single dependency, and counting them separately would
+ * inflate fan-in, hotspots, and drift totals.
+ *
+ * SQL fact edges are the opposite. They deliberately reuse one file pair to express
+ * distinct relationships (`sql:reads_from:...` vs `sql:writes_to:...`), so `raw` is part
+ * of their identity and collapsing on it would discard real graph semantics.
+ */
+export declare function deduplicateEdges(edges: Edge[], rawIsIdentity?: boolean): Edge[];
+export declare function collectEdgesForFile(file: string, projectRoot: string, workspaceConfig: WorkspaceConfig | undefined, opts: {
+    parsed?: {
+        source: string;
+        tree?: SyntaxTreeLike;
+        sup: LanguageSupport;
+        lang?: ParserLanguage;
+        nativeQueries?: NativeQueryResults | null;
+        embeddedBlocks?: PreparedSFCEmbeddedBlock[];
+    };
+    fast?: boolean;
+    fastRegexDisabledLanguages?: string[];
+    resolveNodeModules?: boolean;
+    dynamicImportHeuristics?: boolean;
+    resolutionHints?: string[];
+    native?: NativeRuntimeMode;
+    fileSignature?: {
+        sig: string;
+        gitSig?: string;
+        cacheSig?: string;
+    };
+    sqlCorpusSig?: string;
+    cachedFileEdges?: GraphCacheEntry;
+    /** Root stored with the manifest that supplied `cachedFileEdges`. */
+    cachedFileEdgesProjectRoot?: string;
+    languageExtensions?: LanguageExtensionMap;
+    onFileEdges?: (file: string, entry: GraphCacheEntry) => void;
+    onFallbackImportExtraction?: (event: FallbackImportExtractionEvent) => void;
+    report?: BuildReport;
+    logLevel?: LogLevel;
+    allFiles?: readonly string[];
+    sqlFactCache?: SqlFactCache;
+}): Promise<Edge[]>;
+//# sourceMappingURL=graph-edge-collector.d.ts.map

package/dist/graph-edge-collector.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-edge-collector.d.ts","sourceRoot":"","sources":["../src/graph-edge-collector.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,oBAAoB,CAAC;AACzD,OAAO,EAAsB,KAAK,wBAAwB,EAAE,MAAM,yBAAyB,CAAC;AAC5F,OAAO,EAAkB,KAAK,oBAAoB,EAAE,KAAK,eAAe,EAAE,MAAM,gBAAgB,CAAC;AACjG,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,YAAY,CAAC;AAEvC,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,qBAAqB,CAAC;AAI3D,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,cAAc,CAAC;AAO7C,OAAO,KAAK,EAAE,iBAAiB,EAAuB,kBAAkB,EAAE,MAAM,8BAA8B,CAAC;AAG/G,OAAO,KAAK,EAAE,6BAA6B,EAAE,MAAM,wBAAwB,CAAC;AAE5E,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AACzD,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,oBAAoB,CAAC;AACtD,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAC;AAE3D,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,sBAAsB,CAAC;AAOzD;;;;;;;;;;GAUG;AACH,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,IAAI,EAAE,EAAE,aAAa,UAAQ,GAAG,IAAI,EAAE,CAW7E;AAoBD,wBAAsB,mBAAmB,CACvC,IAAI,EAAE,MAAM,EACZ,WAAW,EAAE,MAAM,EACnB,eAAe,EAAE,eAAe,GAAG,SAAS,EAC5C,IAAI,EAAE;IACJ,MAAM,CAAC,EAAE;QACP,MAAM,EAAE,MAAM,CAAC;QACf,IAAI,CAAC,EAAE,cAAc,CAAC;QACtB,GAAG,EAAE,eAAe,CAAC;QACrB,IAAI,CAAC,EAAE,cAAc,CAAC;QACtB,aAAa,CAAC,EAAE,kBAAkB,GAAG,IAAI,CAAC;QAC1C,cAAc,CAAC,EAAE,wBAAwB,EAAE,CAAC;KAC7C,CAAC;IACF,IAAI,CAAC,EAAE,OAAO,CAAC;IACf,0BAA0B,CAAC,EAAE,MAAM,EAAE,CAAC;IACtC,kBAAkB,CAAC,EAAE,OAAO,CAAC;IAC7B,uBAAuB,CAAC,EAAE,OAAO,CAAC;IAClC,eAAe,CAAC,EAAE,MAAM,EAAE,CAAC;IAC3B,MAAM,CAAC,EAAE,iBAAiB,CAAC;IAC3B,aAAa,CAAC,EAAE;QAAE,GAAG,EAAE,MAAM,CAAC;QAAC,MAAM,CAAC,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,EAAE,MAAM,CAAA;KAAE,CAAC;IACpE,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,eAAe,CAAC,EAAE,eAAe,CAAC;IAClC,qEAAqE;IACrE,0BAA0B,CAAC,EAAE,MAAM,CAAC;IACpC,kBAAkB,CAAC,EAAE,oBAAoB,CAAC;IAC1C,WAAW,CAAC,EAAE,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,eAAe,KAAK,IAAI,CAAC;IAC7D,0BAA0B,CAAC,EAAE,CAAC,KAAK,EAAE,6BAA6B,KAAK,IAAI,CAAC;IAC5E,MAAM,CAAC,EAAE,WAAW,CAAC;IACrB,QAAQ,CAAC,EAAE,QAAQ,CAAC;IACpB,QAAQ,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IAC7B,YAAY,CAAC,EAAE,YAAY,CAAC;CAC7B,GACA,OAAO,CAAC,IAAI,EAAE,CAAC,CAoJjB"}

package/dist/graph-edge-collector.js

@@ -0,0 +1,199 @@
+import { prepareSourceInput } from "./languages/filePrep.js";
+import { supportForFile } from "./languages.js";
+import { loadNearestTsconfigFor } from "./util/resolution.js";
+import { extractJsTsDynamicSpecifiers } from "./util/specifiers.js";
+import { logWithLevel } from "./logging.js";
+import { fileIdentityKey } from "./util/paths.js";
+import { graphOnlyLanguageSupportsImportAliases, graphOnlySpecifierNeedsResolutionConfig, isGraphOnlyLanguage, } from "./documentLinks.js";
+import { getCompactImportsExecution } from "./native/treeSitterNative.js";
+import { recordNativeExecutionOutcome } from "./native/nativeBackendReport.js";
+import { collectModuleSpecifiersFromSource } from "./graphs/specifiers.js";
+import { resolveModuleSpecifierEdges } from "./graphs/edgeResolution.js";
+import { collectSqlEdgesForFile } from "./sql/sourceGraph.js";
+const cloneEdge = (edge) => ({
+    ...edge,
+    to: edge.to.type === "file" ? { type: "file", path: edge.to.path } : { type: "external", name: edge.to.name },
+});
+/**
+ * Collapses duplicate edges.
+ *
+ * File-dependency edges identify on the resolved target: several import bindings that
+ * resolve to one file express a single dependency, and counting them separately would
+ * inflate fan-in, hotspots, and drift totals.
+ *
+ * SQL fact edges are the opposite. They deliberately reuse one file pair to express
+ * distinct relationships (`sql:reads_from:...` vs `sql:writes_to:...`), so `raw` is part
+ * of their identity and collapsing on it would discard real graph semantics.
+ */
+export function deduplicateEdges(edges, rawIsIdentity = false) {
+    const deduplicated = new Map();
+    for (const edge of edges) {
+        const target = edge.to.type === "file" ? fileIdentityKey(edge.to.path) : edge.to.name;
+        const type = edge.typeOnly ? "type-only" : "runtime";
+        const discriminator = rawIsIdentity ? `\0${edge.raw}` : "";
+        const key = `${fileIdentityKey(edge.from)}\0${edge.to.type}\0${target}\0${type}${discriminator}`;
+        const previous = deduplicated.get(key);
+        if (!previous || hasBetterProvenance(edge, previous))
+            deduplicated.set(key, edge);
+    }
+    return [...deduplicated.values()];
+}
+function hasBetterProvenance(candidate, previous) {
+    let candidateResolutionRank = 0;
+    if (candidate.resolved === "precise")
+        candidateResolutionRank = 2;
+    else if (candidate.resolved === "heuristic")
+        candidateResolutionRank = 1;
+    let previousResolutionRank = 0;
+    if (previous.resolved === "precise")
+        previousResolutionRank = 2;
+    else if (previous.resolved === "heuristic")
+        previousResolutionRank = 1;
+    if (candidateResolutionRank !== previousResolutionRank) {
+        return candidateResolutionRank > previousResolutionRank;
+    }
+    const candidateConfidence = candidate.confidence;
+    const previousConfidence = previous.confidence;
+    if (candidateConfidence === undefined || previousConfidence === undefined) {
+        return candidateConfidence !== undefined && previousConfidence === undefined;
+    }
+    return candidateConfidence > previousConfidence;
+}
+export async function collectEdgesForFile(file, projectRoot, workspaceConfig, opts) {
+    const normalizedFile = file.replace(/\\/g, "/");
+    const sigEntry = opts.fileSignature;
+    const sig = sigEntry?.sig;
+    const gitSig = sigEntry?.gitSig;
+    const sqlFile = supportForFile(normalizedFile, opts.languageExtensions)?.id === "sql";
+    const emitCacheEntry = (edges) => {
+        if (!sig || !opts.onFileEdges)
+            return;
+        opts.onFileEdges(normalizedFile, {
+            sig,
+            ...(gitSig ? { gitSig } : {}),
+            ...(sqlFile && opts.sqlCorpusSig ? { sqlCorpusSig: opts.sqlCorpusSig } : {}),
+            edges: edges.map(cloneEdge),
+        });
+    };
+    const sqlCacheIsValid = sqlFile && !!opts.sqlCorpusSig && opts.cachedFileEdges?.sqlCorpusSig === opts.sqlCorpusSig;
+    const cacheRootMatchesProject = opts.cachedFileEdgesProjectRoot === undefined ||
+        fileIdentityKey(opts.cachedFileEdgesProjectRoot) === fileIdentityKey(projectRoot);
+    const canReadCache = !sqlFile || sqlCacheIsValid;
+    const cached = canReadCache && cacheRootMatchesProject && (sig || gitSig) ? opts.cachedFileEdges : undefined;
+    const matchesGitSig = !!gitSig && !!cached?.gitSig && cached.gitSig === gitSig;
+    const matchesSig = !!sig && !!cached && cached.sig === sig;
+    if (cached && (matchesGitSig || matchesSig)) {
+        const cloned = deduplicateEdges(cached.edges.map(cloneEdge), sqlFile);
+        emitCacheEntry(cloned);
+        return cloned;
+    }
+    const parsed = opts.parsed;
+    let sup = parsed?.sup;
+    const lang = parsed?.lang;
+    let src = parsed?.source;
+    const nativeQueries = parsed?.nativeQueries ?? null;
+    let embeddedBlocks = parsed?.embeddedBlocks ?? [];
+    let compactNativeImports = null;
+    let graphOnlyLanguage = sup ? isGraphOnlyLanguage(sup.id) : false;
+    if (!sup || src === undefined) {
+        const prep = await prepareSourceInput(file, { languageExtensions: opts.languageExtensions });
+        sup = prep.sup;
+        src = prep.source;
+        embeddedBlocks = prep.embeddedBlocks ?? [];
+        graphOnlyLanguage = isGraphOnlyLanguage(sup.id);
+        const fastRegexDisabled = opts.fastRegexDisabledLanguages?.includes(sup.id);
+        const shouldSkipNativeForFastGraph = !!opts.fast && (sup.id === "ts" || sup.id === "js") && !fastRegexDisabled;
+        if (!graphOnlyLanguage && !shouldSkipNativeForFastGraph) {
+            // Use compact imports execution for graph mode -- smaller payload
+            const compactExecution = getCompactImportsExecution(src, sup, opts.native);
+            compactNativeImports = compactExecution.results;
+            recordNativeExecutionOutcome(opts.report, {
+                file: normalizedFile,
+                support: sup,
+                results: compactExecution.results,
+                ...(compactExecution.fallbackReason ? { fallbackReason: compactExecution.fallbackReason } : {}),
+                ...(compactExecution.error ? { error: compactExecution.error } : {}),
+            });
+        }
+    }
+    if (sup.id === "sql") {
+        const allFiles = opts.allFiles ?? [normalizedFile];
+        const sqlEdges = deduplicateEdges(await collectSqlEdgesForFile(normalizedFile, allFiles, opts.sqlFactCache, opts.languageExtensions), true);
+        emitCacheEntry(sqlEdges);
+        return sqlEdges;
+    }
+    const fast = !!opts.fast;
+    const specs = collectModuleSpecifiersFromSource(sup, lang, src, {
+        ...(parsed?.tree ? { tree: parsed.tree } : {}),
+        ...(nativeQueries ? { nativeQueries } : {}),
+        ...(compactNativeImports ? { compactNativeImports } : {}),
+        fast,
+        file: normalizedFile,
+        ...(opts.fastRegexDisabledLanguages ? { fastRegexDisabledLanguages: opts.fastRegexDisabledLanguages } : {}),
+        ...(opts.onFallbackImportExtraction ? { onFallbackImportExtraction: opts.onFallbackImportExtraction } : {}),
+        ...(opts.native ? { native: opts.native } : {}),
+        ...(opts.logLevel ? { logLevel: opts.logLevel } : {}),
+    });
+    if ((sup.id === "ts" || sup.id === "js") && opts.dynamicImportHeuristics) {
+        const dynamicSpecs = extractJsTsDynamicSpecifiers(src, normalizedFile, projectRoot);
+        if (dynamicSpecs.length) {
+            const existing = new Set(specs.map((entry) => entry.spec));
+            for (const entry of dynamicSpecs) {
+                if (existing.has(entry.spec))
+                    continue;
+                existing.add(entry.spec);
+                specs.push(entry);
+            }
+        }
+    }
+    const specSources = specs.map((entry) => ({ entry, support: sup }));
+    for (const block of embeddedBlocks) {
+        const blockSpecs = collectModuleSpecifiersFromSource(block.sup, undefined, block.source, {
+            fast,
+            file: normalizedFile,
+            ...(opts.fastRegexDisabledLanguages ? { fastRegexDisabledLanguages: opts.fastRegexDisabledLanguages } : {}),
+            ...(opts.onFallbackImportExtraction ? { onFallbackImportExtraction: opts.onFallbackImportExtraction } : {}),
+            ...(opts.native ? { native: opts.native } : {}),
+            ...(opts.logLevel ? { logLevel: opts.logLevel } : {}),
+        });
+        for (const entry of blockSpecs) {
+            specSources.push({ entry, support: block.sup });
+        }
+    }
+    const graphOnlyAliasLanguage = graphOnlyLanguage && graphOnlyLanguageSupportsImportAliases(sup.id);
+    const needsGraphOnlyResolutionConfig = graphOnlyAliasLanguage && specSources.some(({ entry }) => graphOnlySpecifierNeedsResolutionConfig(entry.spec));
+    const { matchPath } = sup.id === "ts" || sup.id === "tsx" || needsGraphOnlyResolutionConfig
+        ? await loadNearestTsconfigFor(file, projectRoot, opts?.logLevel)
+        : { matchPath: undefined };
+    const edges = [];
+    const edgeResolutionTasks = specSources.map(async ({ entry, support }) => {
+        return await resolveModuleSpecifierEdges(entry, {
+            support,
+            file,
+            projectRoot,
+            workspaceConfig,
+            matchPath,
+            resolveNodeModules: !!opts.resolveNodeModules,
+            ...(opts.resolutionHints ? { resolutionHints: opts.resolutionHints } : {}),
+        });
+    });
+    for (const resolvedEdge of await Promise.all(edgeResolutionTasks)) {
+        if (!resolvedEdge)
+            continue;
+        for (const edgeEntry of resolvedEdge) {
+            const { to, spec, raw, typeOnly, resolved, confidence } = edgeEntry;
+            edges.push({
+                from: normalizedFile,
+                to,
+                raw: raw ?? spec,
+                ...(typeOnly !== undefined && { typeOnly }),
+                ...(resolved !== undefined && { resolved }),
+                ...(confidence !== undefined && { confidence }),
+            });
+        }
+    }
+    const deduplicatedEdges = deduplicateEdges(edges);
+    emitCacheEntry(deduplicatedEdges);
+    return deduplicatedEdges;
+}
+//# sourceMappingURL=graph-edge-collector.js.map

package/dist/graph-edge-collector.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-edge-collector.js","sourceRoot":"","sources":["../src/graph-edge-collector.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,kBAAkB,EAAiC,MAAM,yBAAyB,CAAC;AAC5F,OAAO,EAAE,cAAc,EAAmD,MAAM,gBAAgB,CAAC;AAEjG,OAAO,EAAE,sBAAsB,EAAE,MAAM,sBAAsB,CAAC;AAE9D,OAAO,EAAE,4BAA4B,EAAE,MAAM,sBAAsB,CAAC;AACpE,OAAO,EAAE,YAAY,EAAE,MAAM,cAAc,CAAC;AAC5C,OAAO,EAAE,eAAe,EAAE,MAAM,iBAAiB,CAAC;AAElD,OAAO,EACL,sCAAsC,EACtC,uCAAuC,EACvC,mBAAmB,GACpB,MAAM,oBAAoB,CAAC;AAC5B,OAAO,EAAE,0BAA0B,EAAE,MAAM,8BAA8B,CAAC;AAE1E,OAAO,EAAE,4BAA4B,EAAE,MAAM,iCAAiC,CAAC;AAC/E,OAAO,EAAE,iCAAiC,EAAE,MAAM,wBAAwB,CAAC;AAE3E,OAAO,EAAE,2BAA2B,EAAE,MAAM,4BAA4B,CAAC;AAIzE,OAAO,EAAE,sBAAsB,EAAE,MAAM,sBAAsB,CAAC;AAG9D,MAAM,SAAS,GAAG,CAAC,IAAU,EAAQ,EAAE,CAAC,CAAC;IACvC,GAAG,IAAI;IACP,EAAE,EAAE,IAAI,CAAC,EAAE,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE;CAC9G,CAAC,CAAC;AAEH;;;;;;;;;;GAUG;AACH,MAAM,UAAU,gBAAgB,CAAC,KAAa,EAAE,aAAa,GAAG,KAAK;IACnE,MAAM,YAAY,GAAG,IAAI,GAAG,EAAgB,CAAC;IAC7C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,MAAM,GAAG,IAAI,CAAC,EAAE,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,eAAe,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC;QACtF,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,SAAS,CAAC;QACrD,MAAM,aAAa,GAAG,aAAa,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAC3D,MAAM,GAAG,GAAG,GAAG,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,EAAE,CAAC,IAAI,KAAK,MAAM,KAAK,IAAI,GAAG,aAAa,EAAE,CAAC;QACjG,MAAM,QAAQ,GAAG,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACvC,IAAI,CAAC,QAAQ,IAAI,mBAAmB,CAAC,IAAI,EAAE,QAAQ,CAAC;YAAE,YAAY,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;IACpF,CAAC;IACD,OAAO,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,CAAC;AACpC,CAAC;AAED,SAAS,mBAAmB,CAAC,SAAe,EAAE,QAAc;IAC1D,IAAI,uBAAuB,GAAG,CAAC,CAAC;IAChC,IAAI,SAAS,CAAC,QAAQ,KAAK,SAAS;QAAE,uBAAuB,GAAG,CAAC,CAAC;SAC7D,IAAI,SAAS,CAAC,QAAQ,KAAK,WAAW;QAAE,uBAAuB,GAAG,CAAC,CAAC;IACzE,IAAI,sBAAsB,GAAG,CAAC,CAAC;IAC/B,IAAI,QAAQ,CAAC,QAAQ,KAAK,SAAS;QAAE,sBAAsB,GAAG,CAAC,CAAC;SAC3D,IAAI,QAAQ,CAAC,QAAQ,KAAK,WAAW;QAAE,sBAAsB,GAAG,CAAC,CAAC;IACvE,IAAI,uBAAuB,KAAK,sBAAsB,EAAE,CAAC;QACvD,OAAO,uBAAuB,GAAG,sBAAsB,CAAC;IAC1D,CAAC;IACD,MAAM,mBAAmB,GAAG,SAAS,CAAC,UAAU,CAAC;IACjD,MAAM,kBAAkB,GAAG,QAAQ,CAAC,UAAU,CAAC;IAC/C,IAAI,mBAAmB,KAAK,SAAS,IAAI,kBAAkB,KAAK,SAAS,EAAE,CAAC;QAC1E,OAAO,mBAAmB,KAAK,SAAS,IAAI,kBAAkB,KAAK,SAAS,CAAC;IAC/E,CAAC;IACD,OAAO,mBAAmB,GAAG,kBAAkB,CAAC;AAClD,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,mBAAmB,CACvC,IAAY,EACZ,WAAmB,EACnB,eAA4C,EAC5C,IA2BC;IAED,MAAM,cAAc,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;IAChD,MAAM,QAAQ,GAAG,IAAI,CAAC,aAAa,CAAC;IACpC,MAAM,GAAG,GAAG,QAAQ,EAAE,GAAG,CAAC;IAC1B,MAAM,MAAM,GAAG,QAAQ,EAAE,MAAM,CAAC;IAChC,MAAM,OAAO,GAAG,cAAc,CAAC,cAAc,EAAE,IAAI,CAAC,kBAAkB,CAAC,EAAE,EAAE,KAAK,KAAK,CAAC;IACtF,MAAM,cAAc,GAAG,CAAC,KAAa,EAAE,EAAE;QACvC,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,WAAW;YAAE,OAAO;QACtC,IAAI,CAAC,WAAW,CAAC,cAAc,EAAE;YAC/B,GAAG;YACH,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YAC7B,GAAG,CAAC,OAAO,IAAI,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,YAAY,EAAE,IAAI,CAAC,YAAY,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YAC5E,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC;SAC5B,CAAC,CAAC;IACL,CAAC,CAAC;IAEF,MAAM,eAAe,GAAG,OAAO,IAAI,CAAC,CAAC,IAAI,CAAC,YAAY,IAAI,IAAI,CAAC,eAAe,EAAE,YAAY,KAAK,IAAI,CAAC,YAAY,CAAC;IACnH,MAAM,uBAAuB,GAC3B,IAAI,CAAC,0BAA0B,KAAK,SAAS;QAC7C,eAAe,CAAC,IAAI,CAAC,0BAA0B,CAAC,KAAK,eAAe,CAAC,WAAW,CAAC,CAAC;IACpF,MAAM,YAAY,GAAG,CAAC,OAAO,IAAI,eAAe,CAAC;IACjD,MAAM,MAAM,GAAG,YAAY,IAAI,uBAAuB,IAAI,CAAC,GAAG,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,SAAS,CAAC;IAC7G,MAAM,aAAa,GAAG,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,MAAM,EAAE,MAAM,IAAI,MAAM,CAAC,MAAM,KAAK,MAAM,CAAC;IAC/E,MAAM,UAAU,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,MAAM,IAAI,MAAM,CAAC,GAAG,KAAK,GAAG,CAAC;IAE3D,IAAI,MAAM,IAAI,CAAC,aAAa,IAAI,UAAU,CAAC,EAAE,CAAC;QAC5C,MAAM,MAAM,GAAG,gBAAgB,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,OAAO,CAAC,CAAC;QACtE,cAAc,CAAC,MAAM,CAAC,CAAC;QACvB,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;IAC3B,IAAI,GAAG,GAAG,MAAM,EAAE,GAAG,CAAC;IACtB,MAAM,IAAI,GAAG,MAAM,EAAE,IAAI,CAAC;IAC1B,IAAI,GAAG,GAAG,MAAM,EAAE,MAAM,CAAC;IACzB,MAAM,aAAa,GAAG,MAAM,EAAE,aAAa,IAAI,IAAI,CAAC;IACpD,IAAI,cAAc,GAAG,MAAM,EAAE,cAAc,IAAI,EAAE,CAAC;IAClD,IAAI,oBAAoB,GAA+B,IAAI,CAAC;IAC5D,IAAI,iBAAiB,GAAG,GAAG,CAAC,CAAC,CAAC,mBAAmB,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;IAClE,IAAI,CAAC,GAAG,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;QAC9B,MAAM,IAAI,GAAG,MAAM,kBAAkB,CAAC,IAAI,EAAE,EAAE,kBAAkB,EAAE,IAAI,CAAC,kBAAkB,EAAE,CAAC,CAAC;QAC7F,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC;QACf,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC;QAClB,cAAc,GAAG,IAAI,CAAC,cAAc,IAAI,EAAE,CAAC;QAC3C,iBAAiB,GAAG,mBAAmB,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAChD,MAAM,iBAAiB,GAAG,IAAI,CAAC,0BAA0B,EAAE,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC5E,MAAM,4BAA4B,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,KAAK,IAAI,CAAC,IAAI,CAAC,iBAAiB,CAAC;QAC/G,IAAI,CAAC,iBAAiB,IAAI,CAAC,4BAA4B,EAAE,CAAC;YACxD,kEAAkE;YAClE,MAAM,gBAAgB,GAAG,0BAA0B,CAAC,GAAG,EAAE,GAAG,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;YAC3E,oBAAoB,GAAG,gBAAgB,CAAC,OAAO,CAAC;YAChD,4BAA4B,CAAC,IAAI,CAAC,MAAM,EAAE;gBACxC,IAAI,EAAE,cAAc;gBACpB,OAAO,EAAE,GAAG;gBACZ,OAAO,EAAE,gBAAgB,CAAC,OAAO;gBACjC,GAAG,CAAC,gBAAgB,CAAC,cAAc,CAAC,CAAC,CAAC,EAAE,cAAc,EAAE,gBAAgB,CAAC,cAAc,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC/F,GAAG,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,gBAAgB,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;aACrE,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IACD,IAAI,GAAG,CAAC,EAAE,KAAK,KAAK,EAAE,CAAC;QACrB,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,IAAI,CAAC,cAAc,CAAC,CAAC;QACnD,MAAM,QAAQ,GAAG,gBAAgB,CAC/B,MAAM,sBAAsB,CAAC,cAAc,EAAE,QAAQ,EAAE,IAAI,CAAC,YAAY,EAAE,IAAI,CAAC,kBAAkB,CAAC,EAClG,IAAI,CACL,CAAC;QACF,cAAc,CAAC,QAAQ,CAAC,CAAC;QACzB,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,MAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;IACzB,MAAM,KAAK,GAAG,iCAAiC,CAAC,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE;QAC9D,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAC9C,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAC3C,GAAG,CAAC,oBAAoB,CAAC,CAAC,CAAC,EAAE,oBAAoB,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACzD,IAAI;QACJ,IAAI,EAAE,cAAc;QACpB,GAAG,CAAC,IAAI,CAAC,0BAA0B,CAAC,CAAC,CAAC,EAAE,0BAA0B,EAAE,IAAI,CAAC,0BAA0B,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAC3G,GAAG,CAAC,IAAI,CAAC,0BAA0B,CAAC,CAAC,CAAC,EAAE,0BAA0B,EAAE,IAAI,CAAC,0BAA0B,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAC3G,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAC/C,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KACtD,CAAC,CAAC;IAEH,IAAI,CAAC,GAAG,CAAC,EAAE,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,KAAK,IAAI,CAAC,IAAI,IAAI,CAAC,uBAAuB,EAAE,CAAC;QACzE,MAAM,YAAY,GAAG,4BAA4B,CAAC,GAAG,EAAE,cAAc,EAAE,WAAW,CAAC,CAAC;QACpF,IAAI,YAAY,CAAC,MAAM,EAAE,CAAC;YACxB,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC;YAC3D,KAAK,MAAM,KAAK,IAAI,YAAY,EAAE,CAAC;gBACjC,IAAI,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC;oBAAE,SAAS;gBACvC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;gBACzB,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACpB,CAAC;QACH,CAAC;IACH,CAAC;IAED,MAAM,WAAW,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;IACpE,KAAK,MAAM,KAAK,IAAI,cAAc,EAAE,CAAC;QACnC,MAAM,UAAU,GAAG,iCAAiC,CAAC,KAAK,CAAC,GAAG,EAAE,SAAS,EAAE,KAAK,CAAC,MAAM,EAAE;YACvF,IAAI;YACJ,IAAI,EAAE,cAAc;YACpB,GAAG,CAAC,IAAI,CAAC,0BAA0B,CAAC,CAAC,CAAC,EAAE,0BAA0B,EAAE,IAAI,CAAC,0BAA0B,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YAC3G,GAAG,CAAC,IAAI,CAAC,0BAA0B,CAAC,CAAC,CAAC,EAAE,0BAA0B,EAAE,IAAI,CAAC,0BAA0B,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YAC3G,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YAC/C,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SACtD,CAAC,CAAC;QACH,KAAK,MAAM,KAAK,IAAI,UAAU,EAAE,CAAC;YAC/B,WAAW,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,CAAC,GAAG,EAAE,CAAC,CAAC;QAClD,CAAC;IACH,CAAC;IAED,MAAM,sBAAsB,GAAG,iBAAiB,IAAI,sCAAsC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IACnG,MAAM,8BAA8B,GAClC,sBAAsB,IAAI,WAAW,CAAC,IAAI,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,uCAAuC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC;IACjH,MAAM,EAAE,SAAS,EAAE,GACjB,GAAG,CAAC,EAAE,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,KAAK,KAAK,IAAI,8BAA8B;QACnE,CAAC,CAAC,MAAM,sBAAsB,CAAC,IAAI,EAAE,WAAW,EAAE,IAAI,EAAE,QAAQ,CAAC;QACjE,CAAC,CAAC,EAAE,SAAS,EAAE,SAAS,EAAE,CAAC;IAC/B,MAAM,KAAK,GAAW,EAAE,CAAC;IACzB,MAAM,mBAAmB,GAAG,WAAW,CAAC,GAAG,CAAC,KAAK,EAAE,EAAE,KAAK,EAAE,OAAO,EAAE,EAAE,EAAE;QACvE,OAAO,MAAM,2BAA2B,CAAC,KAAK,EAAE;YAC9C,OAAO;YACP,IAAI;YACJ,WAAW;YACX,eAAe;YACf,SAAS;YACT,kBAAkB,EAAE,CAAC,CAAC,IAAI,CAAC,kBAAkB;YAC7C,GAAG,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,EAAE,eAAe,EAAE,IAAI,CAAC,eAAe,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SAC3E,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,KAAK,MAAM,YAAY,IAAI,MAAM,OAAO,CAAC,GAAG,CAAC,mBAAmB,CAAC,EAAE,CAAC;QAClE,IAAI,CAAC,YAAY;YAAE,SAAS;QAC5B,KAAK,MAAM,SAAS,IAAI,YAAY,EAAE,CAAC;YACrC,MAAM,EAAE,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,QAAQ,EAAE,QAAQ,EAAE,UAAU,EAAE,GAAG,SAAS,CAAC;YACpE,KAAK,CAAC,IAAI,CAAC;gBACT,IAAI,EAAE,cAAc;gBACpB,EAAE;gBACF,GAAG,EAAE,GAAG,IAAI,IAAI;gBAChB,GAAG,CAAC,QAAQ,KAAK,SAAS,IAAI,EAAE,QAAQ,EAAE,CAAC;gBAC3C,GAAG,CAAC,QAAQ,KAAK,SAAS,IAAI,EAAE,QAAQ,EAAE,CAAC;gBAC3C,GAAG,CAAC,UAAU,KAAK,SAAS,IAAI,EAAE,UAAU,EAAE,CAAC;aAChD,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,MAAM,iBAAiB,GAAG,gBAAgB,CAAC,KAAK,CAAC,CAAC;IAClD,cAAc,CAAC,iBAAiB,CAAC,CAAC;IAClC,OAAO,iBAAiB,CAAC;AAC3B,CAAC"}

package/dist/graphs/adjacency.d.ts

@@ -0,0 +1,10 @@
+import type { FileId, Graph } from "../types.js";
+export type GraphAdjacencyIndex = {
+    forward: Map<FileId, FileId[]>;
+    reverse: Map<FileId, FileId[]>;
+};
+export declare function buildGraphAdjacency(graph: Graph): GraphAdjacencyIndex;
+export declare function graphAdjacencyFor(graph: Graph): GraphAdjacencyIndex;
+export declare function getForwardNeighbors(adjacency: GraphAdjacencyIndex, file: FileId): readonly FileId[];
+export declare function getReverseNeighbors(adjacency: GraphAdjacencyIndex, file: FileId): readonly FileId[];
+//# sourceMappingURL=adjacency.d.ts.map

package/dist/graphs/adjacency.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"adjacency.d.ts","sourceRoot":"","sources":["../../src/graphs/adjacency.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,aAAa,CAAC;AAEjD,MAAM,MAAM,mBAAmB,GAAG;IAChC,OAAO,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC;IAC/B,OAAO,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC;CAChC,CAAC;AAYF,wBAAgB,mBAAmB,CAAC,KAAK,EAAE,KAAK,GAAG,mBAAmB,CASrE;AAID,wBAAgB,iBAAiB,CAAC,KAAK,EAAE,KAAK,GAAG,mBAAmB,CAQnE;AAED,wBAAgB,mBAAmB,CAAC,SAAS,EAAE,mBAAmB,EAAE,IAAI,EAAE,MAAM,GAAG,SAAS,MAAM,EAAE,CAEnG;AAED,wBAAgB,mBAAmB,CAAC,SAAS,EAAE,mBAAmB,EAAE,IAAI,EAAE,MAAM,GAAG,SAAS,MAAM,EAAE,CAEnG"}

package/dist/graphs/adjacency.js

@@ -0,0 +1,38 @@
+import { fileIdentityKey } from "../util/paths.js";
+function appendNeighbor(adjacency, from, to) {
+    const key = fileIdentityKey(from);
+    const neighbors = adjacency.get(key);
+    if (neighbors) {
+        neighbors.push(to);
+        return;
+    }
+    adjacency.set(key, [to]);
+}
+export function buildGraphAdjacency(graph) {
+    const forward = new Map();
+    const reverse = new Map();
+    for (const edge of graph.edges) {
+        if (edge.to.type !== "file")
+            continue;
+        appendNeighbor(forward, edge.from, edge.to.path);
+        appendNeighbor(reverse, edge.to.path, edge.from);
+    }
+    return { forward, reverse };
+}
+const adjacencyByGraph = new WeakMap();
+export function graphAdjacencyFor(graph) {
+    const cached = adjacencyByGraph.get(graph);
+    if (cached) {
+        return cached;
+    }
+    const built = buildGraphAdjacency(graph);
+    adjacencyByGraph.set(graph, built);
+    return built;
+}
+export function getForwardNeighbors(adjacency, file) {
+    return adjacency.forward.get(fileIdentityKey(file)) ?? [];
+}
+export function getReverseNeighbors(adjacency, file) {
+    return adjacency.reverse.get(fileIdentityKey(file)) ?? [];
+}
+//# sourceMappingURL=adjacency.js.map

package/dist/graphs/adjacency.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"adjacency.js","sourceRoot":"","sources":["../../src/graphs/adjacency.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,eAAe,EAAE,MAAM,kBAAkB,CAAC;AAQnD,SAAS,cAAc,CAAC,SAAgC,EAAE,IAAY,EAAE,EAAU;IAChF,MAAM,GAAG,GAAG,eAAe,CAAC,IAAI,CAAC,CAAC;IAClC,MAAM,SAAS,GAAG,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACrC,IAAI,SAAS,EAAE,CAAC;QACd,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACnB,OAAO;IACT,CAAC;IACD,SAAS,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;AAC3B,CAAC;AAED,MAAM,UAAU,mBAAmB,CAAC,KAAY;IAC9C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC5C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC5C,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAC/B,IAAI,IAAI,CAAC,EAAE,CAAC,IAAI,KAAK,MAAM;YAAE,SAAS;QACtC,cAAc,CAAC,OAAO,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;QACjD,cAAc,CAAC,OAAO,EAAE,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;IACnD,CAAC;IACD,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,CAAC;AAC9B,CAAC;AAED,MAAM,gBAAgB,GAAG,IAAI,OAAO,EAA8B,CAAC;AAEnE,MAAM,UAAU,iBAAiB,CAAC,KAAY;IAC5C,MAAM,MAAM,GAAG,gBAAgB,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IAC3C,IAAI,MAAM,EAAE,CAAC;QACX,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,MAAM,KAAK,GAAG,mBAAmB,CAAC,KAAK,CAAC,CAAC;IACzC,gBAAgB,CAAC,GAAG,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;IACnC,OAAO,KAAK,CAAC;AACf,CAAC;AAED,MAAM,UAAU,mBAAmB,CAAC,SAA8B,EAAE,IAAY;IAC9E,OAAO,SAAS,CAAC,OAAO,CAAC,GAAG,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC;AAC5D,CAAC;AAED,MAAM,UAAU,mBAAmB,CAAC,SAA8B,EAAE,IAAY;IAC9E,OAAO,SAAS,CAAC,OAAO,CAAC,GAAG,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC;AAC5D,CAAC"}

package/dist/graphs/angularjs.d.ts

@@ -0,0 +1,5 @@
+import type { ParsedFileContext } from "../indexer/parse-context.js";
+import type { Edge } from "../types.js";
+import { type WorkspaceConfig } from "../util/workspace.js";
+export declare function collectAngularJsFrameworkEdges(projectRoot: string, files: string[], workspaceConfig: WorkspaceConfig | undefined, parsed?: Map<string, ParsedFileContext>): Promise<Edge[]>;
+//# sourceMappingURL=angularjs.d.ts.map

package/dist/graphs/angularjs.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"angularjs.d.ts","sourceRoot":"","sources":["../../src/graphs/angularjs.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,6BAA6B,CAAC;AAErE,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,aAAa,CAAC;AAGxC,OAAO,EAAE,KAAK,eAAe,EAAE,MAAM,sBAAsB,CAAC;AAO5D,wBAAsB,8BAA8B,CAClD,WAAW,EAAE,MAAM,EACnB,KAAK,EAAE,MAAM,EAAE,EACf,eAAe,EAAE,eAAe,GAAG,SAAS,EAC5C,MAAM,CAAC,EAAE,GAAG,CAAC,MAAM,EAAE,iBAAiB,CAAC,GACtC,OAAO,CAAC,IAAI,EAAE,CAAC,CAsFjB"}

package/dist/graphs/angularjs.js

@@ -0,0 +1,88 @@
+import fsp from "node:fs/promises";
+import { extractAngularJsReferences, extractAngularJsRegistrations } from "../frameworks/angularjs.js";
+import { fileIdentityKey } from "../util/paths.js";
+import { resolveSpecifier } from "../util/resolution.js";
+import {} from "../util/workspace.js";
+export async function collectAngularJsFrameworkEdges(projectRoot, files, workspaceConfig, parsed) {
+    const jsFiles = files.filter((file) => file.toLowerCase().endsWith(".js"));
+    if (!jsFiles.length)
+        return [];
+    const contexts = [];
+    for (const file of jsFiles) {
+        const parsedSource = parsed?.get(fileIdentityKey(file))?.source;
+        if (parsedSource !== undefined) {
+            contexts.push({ file, source: parsedSource });
+            continue;
+        }
+        try {
+            const source = await fsp.readFile(file, "utf8");
+            contexts.push({ file, source });
+        }
+        catch {
+            continue;
+        }
+    }
+    const registrationFilesByName = new Map();
+    for (const context of contexts) {
+        for (const registration of extractAngularJsRegistrations(context.source)) {
+            let filesForName = registrationFilesByName.get(registration.name);
+            if (!filesForName) {
+                filesForName = new Set();
+                registrationFilesByName.set(registration.name, filesForName);
+            }
+            filesForName.add(context.file.replace(/\\/g, "/"));
+        }
+    }
+    const edges = [];
+    const seen = new Set();
+    const pushEdge = (edge) => {
+        const key = `${edge.from}::${edge.raw}::${edge.to.type === "file" ? edge.to.path : `external:${edge.to.name}`}`;
+        if (seen.has(key))
+            return;
+        seen.add(key);
+        edges.push(edge);
+    };
+    for (const context of contexts) {
+        const normalizedFile = context.file.replace(/\\/g, "/");
+        const references = extractAngularJsReferences(context.source);
+        for (const reference of references) {
+            if (reference.kind === "templateUrl") {
+                const resolved = await resolveSpecifier(context.file, reference.value, projectRoot, undefined, workspaceConfig);
+                pushEdge({
+                    from: normalizedFile,
+                    to: typeof resolved === "string"
+                        ? { type: "file", path: resolved.replace(/\\/g, "/") }
+                        : { type: "external", name: resolved.external },
+                    raw: reference.value,
+                    resolved: "heuristic",
+                    confidence: 0.9,
+                });
+                continue;
+            }
+            const resolvedFiles = registrationFilesByName.get(reference.value);
+            if (resolvedFiles && resolvedFiles.size > 0) {
+                for (const targetFile of resolvedFiles) {
+                    if (targetFile === normalizedFile)
+                        continue;
+                    pushEdge({
+                        from: normalizedFile,
+                        to: { type: "file", path: targetFile },
+                        raw: reference.value,
+                        resolved: "heuristic",
+                        confidence: reference.kind === "controller" ? 0.9 : 0.8,
+                    });
+                }
+                continue;
+            }
+            pushEdge({
+                from: normalizedFile,
+                to: { type: "external", name: reference.value },
+                raw: reference.value,
+                resolved: "heuristic",
+                confidence: reference.kind === "controller" ? 0.75 : 0.7,
+            });
+        }
+    }
+    return edges;
+}
+//# sourceMappingURL=angularjs.js.map

package/dist/graphs/angularjs.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"angularjs.js","sourceRoot":"","sources":["../../src/graphs/angularjs.ts"],"names":[],"mappings":"AAAA,OAAO,GAAG,MAAM,kBAAkB,CAAC;AAEnC,OAAO,EAAE,0BAA0B,EAAE,6BAA6B,EAAE,MAAM,4BAA4B,CAAC;AAEvG,OAAO,EAAE,eAAe,EAAE,MAAM,kBAAkB,CAAC;AACnD,OAAO,EAAE,gBAAgB,EAAE,MAAM,uBAAuB,CAAC;AACzD,OAAO,EAAwB,MAAM,sBAAsB,CAAC;AAO5D,MAAM,CAAC,KAAK,UAAU,8BAA8B,CAClD,WAAmB,EACnB,KAAe,EACf,eAA4C,EAC5C,MAAuC;IAEvC,MAAM,OAAO,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC;IAC3E,IAAI,CAAC,OAAO,CAAC,MAAM;QAAE,OAAO,EAAE,CAAC;IAE/B,MAAM,QAAQ,GAA2B,EAAE,CAAC;IAC5C,KAAK,MAAM,IAAI,IAAI,OAAO,EAAE,CAAC;QAC3B,MAAM,YAAY,GAAG,MAAM,EAAE,GAAG,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC,EAAE,MAAM,CAAC;QAChE,IAAI,YAAY,KAAK,SAAS,EAAE,CAAC;YAC/B,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,YAAY,EAAE,CAAC,CAAC;YAC9C,SAAS;QACX,CAAC;QAED,IAAI,CAAC;YACH,MAAM,MAAM,GAAG,MAAM,GAAG,CAAC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;YAChD,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC,CAAC;QAClC,CAAC;QAAC,MAAM,CAAC;YACP,SAAS;QACX,CAAC;IACH,CAAC;IAED,MAAM,uBAAuB,GAAG,IAAI,GAAG,EAAuB,CAAC;IAC/D,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC/B,KAAK,MAAM,YAAY,IAAI,6BAA6B,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;YACzE,IAAI,YAAY,GAAG,uBAAuB,CAAC,GAAG,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;YAClE,IAAI,CAAC,YAAY,EAAE,CAAC;gBAClB,YAAY,GAAG,IAAI,GAAG,EAAU,CAAC;gBACjC,uBAAuB,CAAC,GAAG,CAAC,YAAY,CAAC,IAAI,EAAE,YAAY,CAAC,CAAC;YAC/D,CAAC;YACD,YAAY,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC;QACrD,CAAC;IACH,CAAC;IAED,MAAM,KAAK,GAAW,EAAE,CAAC;IACzB,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,MAAM,QAAQ,GAAG,CAAC,IAAU,EAAQ,EAAE;QACpC,MAAM,GAAG,GAAG,GAAG,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,GAAG,KAAK,IAAI,CAAC,EAAE,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,YAAY,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC;QAChH,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,OAAO;QAC1B,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACd,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACnB,CAAC,CAAC;IAEF,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC/B,MAAM,cAAc,GAAG,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QACxD,MAAM,UAAU,GAAG,0BAA0B,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;QAC9D,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;YACnC,IAAI,SAAS,CAAC,IAAI,KAAK,aAAa,EAAE,CAAC;gBACrC,MAAM,QAAQ,GAAG,MAAM,gBAAgB,CAAC,OAAO,CAAC,IAAI,EAAE,SAAS,CAAC,KAAK,EAAE,WAAW,EAAE,SAAS,EAAE,eAAe,CAAC,CAAC;gBAChH,QAAQ,CAAC;oBACP,IAAI,EAAE,cAAc;oBACpB,EAAE,EACA,OAAO,QAAQ,KAAK,QAAQ;wBAC1B,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,QAAQ,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,EAAE;wBACtD,CAAC,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,QAAQ,CAAC,QAAQ,EAAE;oBACnD,GAAG,EAAE,SAAS,CAAC,KAAK;oBACpB,QAAQ,EAAE,WAAW;oBACrB,UAAU,EAAE,GAAG;iBAChB,CAAC,CAAC;gBACH,SAAS;YACX,CAAC;YAED,MAAM,aAAa,GAAG,uBAAuB,CAAC,GAAG,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;YACnE,IAAI,aAAa,IAAI,aAAa,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;gBAC5C,KAAK,MAAM,UAAU,IAAI,aAAa,EAAE,CAAC;oBACvC,IAAI,UAAU,KAAK,cAAc;wBAAE,SAAS;oBAC5C,QAAQ,CAAC;wBACP,IAAI,EAAE,cAAc;wBACpB,EAAE,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,UAAU,EAAE;wBACtC,GAAG,EAAE,SAAS,CAAC,KAAK;wBACpB,QAAQ,EAAE,WAAW;wBACrB,UAAU,EAAE,SAAS,CAAC,IAAI,KAAK,YAAY,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG;qBACxD,CAAC,CAAC;gBACL,CAAC;gBACD,SAAS;YACX,CAAC;YAED,QAAQ,CAAC;gBACP,IAAI,EAAE,cAAc;gBACpB,EAAE,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,SAAS,CAAC,KAAK,EAAE;gBAC/C,GAAG,EAAE,SAAS,CAAC,KAAK;gBACpB,QAAQ,EAAE,WAAW;gBACrB,UAAU,EAAE,SAAS,CAAC,IAAI,KAAK,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG;aACzD,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC"}

package/dist/graphs/cycles.d.ts

@@ -0,0 +1,24 @@
+import type { FileId, Graph } from "../types.js";
+export type CycleInternalEdge = {
+    from: FileId;
+    to: FileId;
+    raw: string;
+    typeOnly?: boolean;
+};
+export type DetailedCycle = {
+    files: FileId[];
+    entryEdges: CycleInternalEdge[];
+    internalEdges: CycleInternalEdge[];
+    fileCount: number;
+    internalEdgeCount: number;
+    fanInFromOutside: number;
+    priorityScore: number;
+    remediationHint: string;
+};
+export type CycleSortMode = "priority" | "size" | "fanin";
+export declare function findCycles(graph: Graph): FileId[][];
+export declare function sortDetailedCycles(cycles: DetailedCycle[], mode?: CycleSortMode): DetailedCycle[];
+export declare function findDetailedCycles(graph: Graph, options?: {
+    symbolCoupling?: Map<string, number>;
+}): DetailedCycle[];
+//# sourceMappingURL=cycles.d.ts.map

package/dist/graphs/cycles.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"cycles.d.ts","sourceRoot":"","sources":["../../src/graphs/cycles.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,aAAa,CAAC;AAGjD,MAAM,MAAM,iBAAiB,GAAG;IAC9B,IAAI,EAAE,MAAM,CAAC;IACb,EAAE,EAAE,MAAM,CAAC;IACX,GAAG,EAAE,MAAM,CAAC;IACZ,QAAQ,CAAC,EAAE,OAAO,CAAC;CACpB,CAAC;AAEF,MAAM,MAAM,aAAa,GAAG;IAC1B,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,UAAU,EAAE,iBAAiB,EAAE,CAAC;IAChC,aAAa,EAAE,iBAAiB,EAAE,CAAC;IACnC,SAAS,EAAE,MAAM,CAAC;IAClB,iBAAiB,EAAE,MAAM,CAAC;IAC1B,gBAAgB,EAAE,MAAM,CAAC;IACzB,aAAa,EAAE,MAAM,CAAC;IACtB,eAAe,EAAE,MAAM,CAAC;CACzB,CAAC;AAEF,MAAM,MAAM,aAAa,GAAG,UAAU,GAAG,MAAM,GAAG,OAAO,CAAC;AAc1D,wBAAgB,UAAU,CAAC,KAAK,EAAE,KAAK,GAAG,MAAM,EAAE,EAAE,CAEnD;AAED,wBAAgB,kBAAkB,CAAC,MAAM,EAAE,aAAa,EAAE,EAAE,IAAI,GAAE,aAA0B,GAAG,aAAa,EAAE,CAgB7G;AAED,wBAAgB,kBAAkB,CAChC,KAAK,EAAE,KAAK,EACZ,OAAO,GAAE;IAAE,cAAc,CAAC,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;CAAO,GACrD,aAAa,EAAE,CAwIjB"}

package/dist/graphs/cycles.js

@@ -0,0 +1,159 @@
+import { GRAPH_ONLY_DOCUMENT_EXTENSIONS } from "../util/graphOnlyExtensions.js";
+const DOCUMENT_ONLY_CYCLE_EXTENSIONS = new Set(GRAPH_ONLY_DOCUMENT_EXTENSIONS);
+function isDocumentOnlyCycleFile(file) {
+    const normalized = file.toLowerCase().split(/[?#]/, 1)[0] ?? "";
+    for (const extension of DOCUMENT_ONLY_CYCLE_EXTENSIONS) {
+        if (normalized.endsWith(extension)) {
+            return true;
+        }
+    }
+    return false;
+}
+export function findCycles(graph) {
+    return findDetailedCycles(graph).map((cycle) => cycle.files);
+}
+export function sortDetailedCycles(cycles, mode = "priority") {
+    const sorted = [...cycles];
+    sorted.sort((left, right) => {
+        if (mode === "size") {
+            if (right.fileCount !== left.fileCount)
+                return right.fileCount - left.fileCount;
+            return right.priorityScore - left.priorityScore;
+        }
+        if (mode === "fanin") {
+            if (right.fanInFromOutside !== left.fanInFromOutside) {
+                return right.fanInFromOutside - left.fanInFromOutside;
+            }
+            return right.priorityScore - left.priorityScore;
+        }
+        return right.priorityScore - left.priorityScore;
+    });
+    return sorted;
+}
+export function findDetailedCycles(graph, options = {}) {
+    const nodes = Array.from(graph.nodes);
+    const indexByNode = new Map();
+    nodes.forEach((node, index) => indexByNode.set(node, index));
+    const adjacency = nodes.map(() => []);
+    const incomingFileEdges = nodes.map(() => []);
+    for (const edge of graph.edges) {
+        if (edge.to.type !== "file")
+            continue;
+        const fromIndex = indexByNode.get(edge.from);
+        const toIndex = indexByNode.get(edge.to.path);
+        if (fromIndex !== undefined && toIndex !== undefined) {
+            adjacency[fromIndex].push(toIndex);
+            incomingFileEdges[toIndex].push({
+                from: edge.from,
+                to: edge.to.path,
+                raw: edge.raw,
+                ...(edge.typeOnly !== undefined ? { typeOnly: edge.typeOnly } : {}),
+            });
+        }
+    }
+    const nodeCount = nodes.length;
+    const indices = new Array(nodeCount).fill(-1);
+    const lowlink = new Array(nodeCount).fill(-1);
+    const onStack = new Array(nodeCount).fill(false);
+    const stack = [];
+    let nextIndex = 0;
+    const stronglyConnectedComponents = [];
+    for (let start = 0; start < nodeCount; start++) {
+        if (indices[start] !== -1)
+            continue;
+        const callStack = [{ vertex: start, nextNeighbor: 0 }];
+        while (callStack.length > 0) {
+            const frame = callStack[callStack.length - 1];
+            const vertex = frame.vertex;
+            if (indices[vertex] === -1) {
+                indices[vertex] = nextIndex;
+                lowlink[vertex] = nextIndex;
+                nextIndex += 1;
+                stack.push(vertex);
+                onStack[vertex] = true;
+            }
+            const neighbors = adjacency[vertex];
+            if (frame.nextNeighbor < neighbors.length) {
+                const neighbor = neighbors[frame.nextNeighbor];
+                frame.nextNeighbor += 1;
+                if (indices[neighbor] === -1) {
+                    callStack.push({ vertex: neighbor, nextNeighbor: 0 });
+                }
+                else if (onStack[neighbor]) {
+                    lowlink[vertex] = Math.min(lowlink[vertex], indices[neighbor]);
+                }
+                continue;
+            }
+            callStack.pop();
+            if (callStack.length > 0) {
+                const parent = callStack[callStack.length - 1].vertex;
+                lowlink[parent] = Math.min(lowlink[parent], lowlink[vertex]);
+            }
+            if (lowlink[vertex] === indices[vertex]) {
+                const component = [];
+                let popped;
+                do {
+                    popped = stack.pop();
+                    onStack[popped] = false;
+                    component.push(popped);
+                } while (popped !== vertex);
+                if (component.length > 1 || adjacency[vertex].includes(vertex)) {
+                    stronglyConnectedComponents.push(component);
+                }
+            }
+        }
+    }
+    const cycleDetails = [];
+    for (const component of stronglyConnectedComponents) {
+        const files = component.map((index) => nodes[index]);
+        if (files.every(isDocumentOnlyCycleFile)) {
+            continue;
+        }
+        const componentFiles = new Set(files);
+        const internalEdges = [];
+        const entryEdges = [];
+        let internalEdgeCount = 0;
+        let fanInFromOutside = 0;
+        for (const nodeIndex of component) {
+            for (const edge of incomingFileEdges[nodeIndex]) {
+                if (componentFiles.has(edge.from)) {
+                    internalEdgeCount += 1;
+                    internalEdges.push(edge);
+                }
+                else {
+                    fanInFromOutside += 1;
+                    entryEdges.push(edge);
+                }
+            }
+        }
+        const priorityScore = files.length * 3 + fanInFromOutside * 2 + internalEdgeCount;
+        const couplingForEdge = (edge) => options.symbolCoupling?.get(`${edge.from} -> ${edge.to}`) ?? 0;
+        const weakestEdge = internalEdges.reduce((best, edge) => {
+            if (!best)
+                return edge;
+            const bestCoupling = couplingForEdge(best);
+            const edgeCoupling = couplingForEdge(edge);
+            if (edgeCoupling !== bestCoupling) {
+                return edgeCoupling < bestCoupling ? edge : best;
+            }
+            if (!!edge.typeOnly && !best.typeOnly)
+                return edge;
+            return best;
+        }, null);
+        const remediationHint = weakestEdge
+            ? `Break ${weakestEdge.from} -> ${weakestEdge.to} (import ${weakestEdge.raw}) to reduce SCC coupling; estimated symbol coupling=${couplingForEdge(weakestEdge)}.`
+            : `Break one import edge in this ${files.length}-file SCC to remove the cycle.`;
+        cycleDetails.push({
+            files,
+            entryEdges,
+            internalEdges,
+            fileCount: files.length,
+            internalEdgeCount,
+            fanInFromOutside,
+            priorityScore,
+            remediationHint,
+        });
+    }
+    return sortDetailedCycles(cycleDetails, "priority");
+}
+//# sourceMappingURL=cycles.js.map