@agent-teams/engineering-foundation 0.5.0 → 0.6.0

package/dist/capabilities/source-dependencies/application/policies/evaluate-source-dependencies.js

@@ -1,3 +1,5 @@
+import { evaluateSourceDependencyCycles } from "./evaluate-source-dependency-cycles.js";
+import { evaluateResolvedSourceDependency } from "./evaluate-resolved-source-dependency.js";
 import { SOURCE_DEPENDENCY_RULES } from "../rules.js";
 function diagnostic(input) {
     return {
@@ -12,211 +14,77 @@ function diagnostic(input) {
         requiresArchitectureReview: input.rule.requiresArchitectureReview
     };
 }
-function boundaryForPath(path, files) {
-    return files.find((file) => file.path === path)?.boundary;
-}
-function declarationDiagnostics(input) {
-    if (input.declaration === "runtime") {
+function entrypointDeclarationDiagnostics(policy, graph) {
+    if (policy.schemaVersion !== 2) {
         return [];
     }
-    const rule = input.declaration === "development"
-        ? SOURCE_DEPENDENCY_RULES.runtimeImportFromDevelopmentDependency
-        : input.workspace
-            ? SOURCE_DEPENDENCY_RULES.undeclaredWorkspaceDependency
-            : SOURCE_DEPENDENCY_RULES.undeclaredExternalDependency;
-    return [
-        diagnostic({
-            rule,
-            subject: `${input.file.workspacePackage.name}->${input.packageName}`,
-            message: input.declaration === "development"
-                ? `Runtime source imports development-only dependency ${input.packageName}.`
-                : `Runtime source imports undeclared dependency ${input.packageName}.`,
-            path: input.file.path,
-            relatedPath: input.file.workspacePackage.manifestPath,
-            evidence: [{ kind: "specifier", value: input.reference.specifier }]
-        })
-    ];
-}
-function evaluateResolved(input) {
-    const { file, reference, resolved } = input;
-    switch (resolved.kind) {
-        case "builtin":
-            return file.boundary.allowedBuiltins.includes(resolved.specifier)
-                ? []
-                : [
-                    diagnostic({
-                        rule: SOURCE_DEPENDENCY_RULES.forbiddenBuiltinDependency,
-                        subject: `${file.boundary.id}->${resolved.specifier}`,
-                        message: `Boundary ${file.boundary.id} cannot import ${resolved.specifier}.`,
-                        path: file.path,
-                        evidence: [{ kind: "specifier", value: reference.specifier }]
-                    })
-                ];
-        case "external-package":
-            return [
-                ...(file.boundary.allowedPackages.includes(resolved.packageName)
-                    ? []
-                    : [
-                        diagnostic({
-                            rule: SOURCE_DEPENDENCY_RULES.forbiddenPackageDependency,
-                            subject: `${file.boundary.id}->${resolved.packageName}`,
-                            message: `Boundary ${file.boundary.id} cannot import package ${resolved.packageName}.`,
-                            path: file.path,
-                            evidence: [{ kind: "specifier", value: reference.specifier }]
-                        })
-                    ]),
-                ...declarationDiagnostics({
-                    file,
-                    reference,
-                    packageName: resolved.packageName,
-                    declaration: resolved.declaration,
-                    workspace: false
-                })
-            ];
-        case "local-file": {
-            if (resolved.workspacePackage.name !== file.workspacePackage.name) {
-                return [
-                    diagnostic({
-                        rule: SOURCE_DEPENDENCY_RULES.crossPackageRelativeImport,
-                        subject: `${file.workspacePackage.name}->${resolved.workspacePackage.name}`,
-                        message: `Relative import crosses from ${file.workspacePackage.name} into ${resolved.workspacePackage.name}.`,
-                        path: file.path,
-                        relatedPath: resolved.path,
-                        evidence: [{ kind: "specifier", value: reference.specifier }]
-                    })
-                ];
-            }
-            const targetBoundary = boundaryForPath(resolved.path, input.classifiedFiles);
-            if (targetBoundary === undefined ||
-                targetBoundary.id === file.boundary.id ||
-                file.boundary.allowedBoundaries.includes(targetBoundary.id)) {
-                return [];
+    const nodesByPath = new Map(graph.nodes.map((node) => [node.path, node]));
+    const diagnostics = [];
+    for (const boundary of policy.boundaries) {
+        for (const entrypoint of boundary.entrypoints) {
+            const node = nodesByPath.get(entrypoint);
+            if (node !== undefined && node.boundaryId === boundary.id) {
+                continue;
             }
-            return [
-                diagnostic({
-                    rule: SOURCE_DEPENDENCY_RULES.forbiddenBoundaryDependency,
-                    subject: `${file.boundary.id}->${targetBoundary.id}`,
-                    message: `Boundary dependency is not allowed: ${file.boundary.id} -> ${targetBoundary.id}.`,
-                    path: file.path,
-                    relatedPath: resolved.path,
-                    evidence: [{ kind: "specifier", value: reference.specifier }]
-                })
-            ];
+            diagnostics.push(diagnostic({
+                rule: SOURCE_DEPENDENCY_RULES.invalidBoundaryEntrypoint,
+                subject: `${boundary.id}:${entrypoint}`,
+                message: node === undefined
+                    ? `Boundary entrypoint is not a governed classified source file: ${entrypoint}.`
+                    : `Boundary entrypoint belongs to ${node.boundaryId}, not ${boundary.id}: ${entrypoint}.`,
+                path: entrypoint,
+                evidence: [{ kind: "boundary", value: boundary.id }]
+            }));
         }
-        case "unsupported":
-            return [
-                diagnostic({
-                    rule: SOURCE_DEPENDENCY_RULES.unsupportedImportSpecifier,
-                    subject: `${file.path}:${reference.specifier}`,
-                    message: `Import specifier cannot be classified: ${resolved.reason}.`,
-                    path: file.path,
-                    evidence: [{ kind: "specifier", value: reference.specifier }]
-                })
-            ];
-        case "unresolved":
-            return [
-                diagnostic({
-                    rule: SOURCE_DEPENDENCY_RULES.unresolvedLocalImport,
-                    subject: `${file.path}:${reference.specifier}`,
-                    message: `Import could not be resolved: ${resolved.reason}.`,
-                    path: file.path,
-                    evidence: [{ kind: "specifier", value: reference.specifier }]
-                })
-            ];
-        case "workspace-package":
-            return [
-                ...(resolved.workspacePackage.name === file.workspacePackage.name ||
-                    file.boundary.allowedPackages.includes(resolved.workspacePackage.name)
-                    ? []
-                    : [
-                        diagnostic({
-                            rule: SOURCE_DEPENDENCY_RULES.forbiddenPackageDependency,
-                            subject: `${file.boundary.id}->${resolved.workspacePackage.name}`,
-                            message: `Boundary ${file.boundary.id} cannot import workspace package ${resolved.workspacePackage.name}.`,
-                            path: file.path,
-                            relatedPath: resolved.workspacePackage.manifestPath,
-                            evidence: [{ kind: "specifier", value: reference.specifier }]
-                        })
-                    ]),
-                ...(resolved.workspacePackage.name === file.workspacePackage.name
-                    ? []
-                    : declarationDiagnostics({
-                        file,
-                        reference,
-                        packageName: resolved.workspacePackage.name,
-                        declaration: resolved.declaration,
-                        workspace: true
-                    })),
-                ...(resolved.exported
-                    ? []
-                    : [
-                        diagnostic({
-                            rule: SOURCE_DEPENDENCY_RULES.packageSubpathNotExported,
-                            subject: `${resolved.workspacePackage.name}:${resolved.subpath}`,
-                            message: `Workspace package subpath is not exported: ${reference.specifier}.`,
-                            path: file.path,
-                            relatedPath: resolved.workspacePackage.manifestPath,
-                            evidence: [{ kind: "subpath", value: resolved.subpath }]
-                        })
-                    ])
-            ];
     }
+    return diagnostics;
 }
 export function evaluateSourceDependencies(input) {
     const diagnostics = [];
-    const classifiedPaths = new Set(input.classifiedFiles.map((file) => file.path));
-    const governedFilePaths = new Set(input.allSourceFiles.map((file) => file.path));
-    for (const sourceFile of input.allSourceFiles) {
-        if (!classifiedPaths.has(sourceFile.path)) {
-            diagnostics.push(diagnostic({
-                rule: SOURCE_DEPENDENCY_RULES.unclassifiedSourceFile,
-                subject: sourceFile.path,
-                message: "Governed source file does not belong to an architecture boundary.",
-                path: sourceFile.path
-            }));
-        }
+    const boundariesById = new Map(input.policy.boundaries.map((boundary) => [boundary.id, boundary]));
+    for (const path of input.graph.unclassifiedSourcePaths) {
+        diagnostics.push(diagnostic({
+            rule: SOURCE_DEPENDENCY_RULES.unclassifiedSourceFile,
+            subject: path,
+            message: "Governed source file does not belong to an architecture boundary.",
+            path
+        }));
     }
-    for (const file of input.classifiedFiles) {
-        if (file.parsed.parseErrorCount > 0) {
-            diagnostics.push(diagnostic({
-                rule: SOURCE_DEPENDENCY_RULES.sourceParseError,
-                subject: file.path,
-                message: `Source parser reported ${file.parsed.parseErrorCount} error(s).`,
-                path: file.path,
-                evidence: [
-                    { kind: "parse-error-count", value: String(file.parsed.parseErrorCount) }
-                ]
-            }));
+    for (const failure of input.graph.parseFailures) {
+        diagnostics.push(diagnostic({
+            rule: SOURCE_DEPENDENCY_RULES.sourceParseError,
+            subject: failure.path,
+            message: `Source parser reported ${failure.parseErrorCount} error(s).`,
+            path: failure.path,
+            evidence: [{ kind: "parse-error-count", value: String(failure.parseErrorCount) }]
+        }));
+    }
+    for (const unresolvedReference of input.graph.unresolvedRuntimeReferences) {
+        const boundary = boundariesById.get(unresolvedReference.boundaryId);
+        if (boundary?.allowedRuntimeReferences.includes(unresolvedReference.kind) === true) {
             continue;
         }
-        for (const unresolvedReference of file.parsed.unresolved) {
-            if (file.boundary.allowedRuntimeReferences.includes(unresolvedReference.kind)) {
-                continue;
-            }
-            diagnostics.push(diagnostic({
-                rule: SOURCE_DEPENDENCY_RULES.unresolvedRuntimeReference,
-                subject: `${file.path}:${unresolvedReference.kind}:${unresolvedReference.start}`,
-                message: `Non-literal ${unresolvedReference.kind} reference hides a dependency edge.`,
-                path: file.path,
-                evidence: [
-                    { kind: "reference-kind", value: unresolvedReference.kind },
-                    { kind: "offset", value: String(unresolvedReference.start) }
-                ]
-            }));
-        }
-        for (const reference of file.parsed.references) {
-            diagnostics.push(...evaluateResolved({
-                file,
-                reference,
-                resolved: input.resolver.resolve({
-                    file,
-                    governedFilePaths,
-                    inventory: input.inventory,
-                    reference
-                }),
-                classifiedFiles: input.classifiedFiles
-            }));
-        }
+        diagnostics.push(diagnostic({
+            rule: SOURCE_DEPENDENCY_RULES.unresolvedRuntimeReference,
+            subject: `${unresolvedReference.path}:${unresolvedReference.kind}:${unresolvedReference.start}`,
+            message: `Non-literal ${unresolvedReference.kind} reference hides a dependency edge.`,
+            path: unresolvedReference.path,
+            evidence: [
+                { kind: "reference-kind", value: unresolvedReference.kind },
+                { kind: "offset", value: String(unresolvedReference.start) }
+            ]
+        }));
+    }
+    diagnostics.push(...entrypointDeclarationDiagnostics(input.policy, input.graph));
+    for (const edge of input.graph.edges) {
+        diagnostics.push(...evaluateResolvedSourceDependency({
+            edge,
+            policy: input.policy,
+            boundariesById
+        }));
+    }
+    if (input.policy.schemaVersion === 2) {
+        diagnostics.push(...evaluateSourceDependencyCycles(input.graph));
     }
     return diagnostics;
 }

package/dist/capabilities/source-dependencies/application/policies/evaluate-source-dependencies.js.map

@@ -1 +1 @@
-{"version":3,"file":"evaluate-source-dependencies.js","sourceRoot":"","sources":["../../../../../src/capabilities/source-dependencies/application/policies/evaluate-source-dependencies.ts"],"names":[],"mappings":"AAcA,OAAO,EACL,uBAAuB,EAExB,MAAM,aAAa,CAAC;AAUrB,SAAS,UAAU,CAAC,KAOnB;IACC,OAAO;QACL,MAAM,EAAE,KAAK,CAAC,IAAI,CAAC,EAAE;QACrB,QAAQ,EAAE,KAAK,CAAC,IAAI,CAAC,QAAQ;QAC7B,OAAO,EAAE,KAAK,CAAC,OAAO;QACtB,OAAO,EAAE,KAAK,CAAC,OAAO;QACtB,QAAQ,EAAE,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE;QAC9B,gBAAgB,EACd,KAAK,CAAC,WAAW,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,WAAW,EAAE,CAAC;QACtE,QAAQ,EAAE,KAAK,CAAC,QAAQ,IAAI,EAAE;QAC9B,WAAW,EAAE,KAAK,CAAC,IAAI,CAAC,WAAW;QACnC,0BAA0B,EAAE,KAAK,CAAC,IAAI,CAAC,0BAA0B;KAClE,CAAC;AACJ,CAAC;AAED,SAAS,eAAe,CACtB,IAAY,EACZ,KAAsC;IAEtC,OAAO,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,EAAE,QAAQ,CAAC;AAC5D,CAAC;AAED,SAAS,sBAAsB,CAAC,KAM/B;IACC,IAAI,KAAK,CAAC,WAAW,KAAK,SAAS,EAAE,CAAC;QACpC,OAAO,EAAE,CAAC;IACZ,CAAC;IACD,MAAM,IAAI,GACR,KAAK,CAAC,WAAW,KAAK,aAAa;QACjC,CAAC,CAAC,uBAAuB,CAAC,sCAAsC;QAChE,CAAC,CAAC,KAAK,CAAC,SAAS;YACf,CAAC,CAAC,uBAAuB,CAAC,6BAA6B;YACvD,CAAC,CAAC,uBAAuB,CAAC,4BAA4B,CAAC;IAC7D,OAAO;QACL,UAAU,CAAC;YACT,IAAI;YACJ,OAAO,EAAE,GAAG,KAAK,CAAC,IAAI,CAAC,gBAAgB,CAAC,IAAI,KAAK,KAAK,CAAC,WAAW,EAAE;YACpE,OAAO,EACL,KAAK,CAAC,WAAW,KAAK,aAAa;gBACjC,CAAC,CAAC,sDAAsD,KAAK,CAAC,WAAW,GAAG;gBAC5E,CAAC,CAAC,gDAAgD,KAAK,CAAC,WAAW,GAAG;YAC1E,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,IAAI;YACrB,WAAW,EAAE,KAAK,CAAC,IAAI,CAAC,gBAAgB,CAAC,YAAY;YACrD,QAAQ,EAAE,CAAC,EAAE,IAAI,EAAE,WAAW,EAAE,KAAK,EAAE,KAAK,CAAC,SAAS,CAAC,SAAS,EAAE,CAAC;SACpE,CAAC;KACH,CAAC;AACJ,CAAC;AAED,SAAS,gBAAgB,CAAC,KAKzB;IACC,MAAM,EAAE,IAAI,EAAE,SAAS,EAAE,QAAQ,EAAE,GAAG,KAAK,CAAC;IAC5C,QAAQ,QAAQ,CAAC,IAAI,EAAE,CAAC;QACtB,KAAK,SAAS;YACZ,OAAO,IAAI,CAAC,QAAQ,CAAC,eAAe,CAAC,QAAQ,CAAC,QAAQ,CAAC,SAAS,CAAC;gBAC/D,CAAC,CAAC,EAAE;gBACJ,CAAC,CAAC;oBACE,UAAU,CAAC;wBACT,IAAI,EAAE,uBAAuB,CAAC,0BAA0B;wBACxD,OAAO,EAAE,GAAG,IAAI,CAAC,QAAQ,CAAC,EAAE,KAAK,QAAQ,CAAC,SAAS,EAAE;wBACrD,OAAO,EAAE,YAAY,IAAI,CAAC,QAAQ,CAAC,EAAE,kBAAkB,QAAQ,CAAC,SAAS,GAAG;wBAC5E,IAAI,EAAE,IAAI,CAAC,IAAI;wBACf,QAAQ,EAAE,CAAC,EAAE,IAAI,EAAE,WAAW,EAAE,KAAK,EAAE,SAAS,CAAC,SAAS,EAAE,CAAC;qBAC9D,CAAC;iBACH,CAAC;QACR,KAAK,kBAAkB;YACrB,OAAO;gBACL,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,eAAe,CAAC,QAAQ,CAAC,QAAQ,CAAC,WAAW,CAAC;oBAC9D,CAAC,CAAC,EAAE;oBACJ,CAAC,CAAC;wBACE,UAAU,CAAC;4BACT,IAAI,EAAE,uBAAuB,CAAC,0BAA0B;4BACxD,OAAO,EAAE,GAAG,IAAI,CAAC,QAAQ,CAAC,EAAE,KAAK,QAAQ,CAAC,WAAW,EAAE;4BACvD,OAAO,EAAE,YAAY,IAAI,CAAC,QAAQ,CAAC,EAAE,0BAA0B,QAAQ,CAAC,WAAW,GAAG;4BACtF,IAAI,EAAE,IAAI,CAAC,IAAI;4BACf,QAAQ,EAAE,CAAC,EAAE,IAAI,EAAE,WAAW,EAAE,KAAK,EAAE,SAAS,CAAC,SAAS,EAAE,CAAC;yBAC9D,CAAC;qBACH,CAAC;gBACN,GAAG,sBAAsB,CAAC;oBACxB,IAAI;oBACJ,SAAS;oBACT,WAAW,EAAE,QAAQ,CAAC,WAAW;oBACjC,WAAW,EAAE,QAAQ,CAAC,WAAW;oBACjC,SAAS,EAAE,KAAK;iBACjB,CAAC;aACH,CAAC;QACJ,KAAK,YAAY,EAAE,CAAC;YAClB,IAAI,QAAQ,CAAC,gBAAgB,CAAC,IAAI,KAAK,IAAI,CAAC,gBAAgB,CAAC,IAAI,EAAE,CAAC;gBAClE,OAAO;oBACL,UAAU,CAAC;wBACT,IAAI,EAAE,uBAAuB,CAAC,0BAA0B;wBACxD,OAAO,EAAE,GAAG,IAAI,CAAC,gBAAgB,CAAC,IAAI,KAAK,QAAQ,CAAC,gBAAgB,CAAC,IAAI,EAAE;wBAC3E,OAAO,EAAE,gCAAgC,IAAI,CAAC,gBAAgB,CAAC,IAAI,SAAS,QAAQ,CAAC,gBAAgB,CAAC,IAAI,GAAG;wBAC7G,IAAI,EAAE,IAAI,CAAC,IAAI;wBACf,WAAW,EAAE,QAAQ,CAAC,IAAI;wBAC1B,QAAQ,EAAE,CAAC,EAAE,IAAI,EAAE,WAAW,EAAE,KAAK,EAAE,SAAS,CAAC,SAAS,EAAE,CAAC;qBAC9D,CAAC;iBACH,CAAC;YACJ,CAAC;YACD,MAAM,cAAc,GAAG,eAAe,CAAC,QAAQ,CAAC,IAAI,EAAE,KAAK,CAAC,eAAe,CAAC,CAAC;YAC7E,IACE,cAAc,KAAK,SAAS;gBAC5B,cAAc,CAAC,EAAE,KAAK,IAAI,CAAC,QAAQ,CAAC,EAAE;gBACtC,IAAI,CAAC,QAAQ,CAAC,iBAAiB,CAAC,QAAQ,CAAC,cAAc,CAAC,EAAE,CAAC,EAC3D,CAAC;gBACD,OAAO,EAAE,CAAC;YACZ,CAAC;YACD,OAAO;gBACL,UAAU,CAAC;oBACT,IAAI,EAAE,uBAAuB,CAAC,2BAA2B;oBACzD,OAAO,EAAE,GAAG,IAAI,CAAC,QAAQ,CAAC,EAAE,KAAK,cAAc,CAAC,EAAE,EAAE;oBACpD,OAAO,EAAE,uCAAuC,IAAI,CAAC,QAAQ,CAAC,EAAE,OAAO,cAAc,CAAC,EAAE,GAAG;oBAC3F,IAAI,EAAE,IAAI,CAAC,IAAI;oBACf,WAAW,EAAE,QAAQ,CAAC,IAAI;oBAC1B,QAAQ,EAAE,CAAC,EAAE,IAAI,EAAE,WAAW,EAAE,KAAK,EAAE,SAAS,CAAC,SAAS,EAAE,CAAC;iBAC9D,CAAC;aACH,CAAC;QACJ,CAAC;QACD,KAAK,aAAa;YAChB,OAAO;gBACL,UAAU,CAAC;oBACT,IAAI,EAAE,uBAAuB,CAAC,0BAA0B;oBACxD,OAAO,EAAE,GAAG,IAAI,CAAC,IAAI,IAAI,SAAS,CAAC,SAAS,EAAE;oBAC9C,OAAO,EAAE,0CAA0C,QAAQ,CAAC,MAAM,GAAG;oBACrE,IAAI,EAAE,IAAI,CAAC,IAAI;oBACf,QAAQ,EAAE,CAAC,EAAE,IAAI,EAAE,WAAW,EAAE,KAAK,EAAE,SAAS,CAAC,SAAS,EAAE,CAAC;iBAC9D,CAAC;aACH,CAAC;QACJ,KAAK,YAAY;YACf,OAAO;gBACL,UAAU,CAAC;oBACT,IAAI,EAAE,uBAAuB,CAAC,qBAAqB;oBACnD,OAAO,EAAE,GAAG,IAAI,CAAC,IAAI,IAAI,SAAS,CAAC,SAAS,EAAE;oBAC9C,OAAO,EAAE,iCAAiC,QAAQ,CAAC,MAAM,GAAG;oBAC5D,IAAI,EAAE,IAAI,CAAC,IAAI;oBACf,QAAQ,EAAE,CAAC,EAAE,IAAI,EAAE,WAAW,EAAE,KAAK,EAAE,SAAS,CAAC,SAAS,EAAE,CAAC;iBAC9D,CAAC;aACH,CAAC;QACJ,KAAK,mBAAmB;YACtB,OAAO;gBACL,GAAG,CACD,QAAQ,CAAC,gBAAgB,CAAC,IAAI,KAAK,IAAI,CAAC,gBAAgB,CAAC,IAAI;oBAC7D,IAAI,CAAC,QAAQ,CAAC,eAAe,CAAC,QAAQ,CAAC,QAAQ,CAAC,gBAAgB,CAAC,IAAI,CAAC;oBACpE,CAAC,CAAC,EAAE;oBACJ,CAAC,CAAC;wBACE,UAAU,CAAC;4BACT,IAAI,EAAE,uBAAuB,CAAC,0BAA0B;4BACxD,OAAO,EAAE,GAAG,IAAI,CAAC,QAAQ,CAAC,EAAE,KAAK,QAAQ,CAAC,gBAAgB,CAAC,IAAI,EAAE;4BACjE,OAAO,EAAE,YAAY,IAAI,CAAC,QAAQ,CAAC,EAAE,oCAAoC,QAAQ,CAAC,gBAAgB,CAAC,IAAI,GAAG;4BAC1G,IAAI,EAAE,IAAI,CAAC,IAAI;4BACf,WAAW,EAAE,QAAQ,CAAC,gBAAgB,CAAC,YAAY;4BACnD,QAAQ,EAAE,CAAC,EAAE,IAAI,EAAE,WAAW,EAAE,KAAK,EAAE,SAAS,CAAC,SAAS,EAAE,CAAC;yBAC9D,CAAC;qBACH,CACN;gBACD,GAAG,CAAC,QAAQ,CAAC,gBAAgB,CAAC,IAAI,KAAK,IAAI,CAAC,gBAAgB,CAAC,IAAI;oBAC/D,CAAC,CAAC,EAAE;oBACJ,CAAC,CAAC,sBAAsB,CAAC;wBACrB,IAAI;wBACJ,SAAS;wBACT,WAAW,EAAE,QAAQ,CAAC,gBAAgB,CAAC,IAAI;wBAC3C,WAAW,EAAE,QAAQ,CAAC,WAAW;wBACjC,SAAS,EAAE,IAAI;qBAChB,CAAC,CAAC;gBACP,GAAG,CAAC,QAAQ,CAAC,QAAQ;oBACnB,CAAC,CAAC,EAAE;oBACJ,CAAC,CAAC;wBACE,UAAU,CAAC;4BACT,IAAI,EAAE,uBAAuB,CAAC,yBAAyB;4BACvD,OAAO,EAAE,GAAG,QAAQ,CAAC,gBAAgB,CAAC,IAAI,IAAI,QAAQ,CAAC,OAAO,EAAE;4BAChE,OAAO,EAAE,8CAA8C,SAAS,CAAC,SAAS,GAAG;4BAC7E,IAAI,EAAE,IAAI,CAAC,IAAI;4BACf,WAAW,EAAE,QAAQ,CAAC,gBAAgB,CAAC,YAAY;4BACnD,QAAQ,EAAE,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,QAAQ,CAAC,OAAO,EAAE,CAAC;yBACzD,CAAC;qBACH,CAAC;aACP,CAAC;IACN,CAAC;AACH,CAAC;AAED,MAAM,UAAU,0BAA0B,CACxC,KAAsB;IAEtB,MAAM,WAAW,GAA2B,EAAE,CAAC;IAC/C,MAAM,eAAe,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;IAChF,MAAM,iBAAiB,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;IACjF,KAAK,MAAM,UAAU,IAAI,KAAK,CAAC,cAAc,EAAE,CAAC;QAC9C,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC;YAC1C,WAAW,CAAC,IAAI,CACd,UAAU,CAAC;gBACT,IAAI,EAAE,uBAAuB,CAAC,sBAAsB;gBACpD,OAAO,EAAE,UAAU,CAAC,IAAI;gBACxB,OAAO,EAAE,mEAAmE;gBAC5E,IAAI,EAAE,UAAU,CAAC,IAAI;aACtB,CAAC,CACH,CAAC;QACJ,CAAC;IACH,CAAC;IACD,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,eAAe,EAAE,CAAC;QACzC,IAAI,IAAI,CAAC,MAAM,CAAC,eAAe,GAAG,CAAC,EAAE,CAAC;YACpC,WAAW,CAAC,IAAI,CACd,UAAU,CAAC;gBACT,IAAI,EAAE,uBAAuB,CAAC,gBAAgB;gBAC9C,OAAO,EAAE,IAAI,CAAC,IAAI;gBAClB,OAAO,EAAE,0BAA0B,IAAI,CAAC,MAAM,CAAC,eAAe,YAAY;gBAC1E,IAAI,EAAE,IAAI,CAAC,IAAI;gBACf,QAAQ,EAAE;oBACR,EAAE,IAAI,EAAE,mBAAmB,EAAE,KAAK,EAAE,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,eAAe,CAAC,EAAE;iBAC1E;aACF,CAAC,CACH,CAAC;YACF,SAAS;QACX,CAAC;QACD,KAAK,MAAM,mBAAmB,IAAI,IAAI,CAAC,MAAM,CAAC,UAAU,EAAE,CAAC;YACzD,IAAI,IAAI,CAAC,QAAQ,CAAC,wBAAwB,CAAC,QAAQ,CAAC,mBAAmB,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC9E,SAAS;YACX,CAAC;YACD,WAAW,CAAC,IAAI,CACd,UAAU,CAAC;gBACT,IAAI,EAAE,uBAAuB,CAAC,0BAA0B;gBACxD,OAAO,EAAE,GAAG,IAAI,CAAC,IAAI,IAAI,mBAAmB,CAAC,IAAI,IAAI,mBAAmB,CAAC,KAAK,EAAE;gBAChF,OAAO,EAAE,eAAe,mBAAmB,CAAC,IAAI,qCAAqC;gBACrF,IAAI,EAAE,IAAI,CAAC,IAAI;gBACf,QAAQ,EAAE;oBACR,EAAE,IAAI,EAAE,gBAAgB,EAAE,KAAK,EAAE,mBAAmB,CAAC,IAAI,EAAE;oBAC3D,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,CAAC,mBAAmB,CAAC,KAAK,CAAC,EAAE;iBAC7D;aACF,CAAC,CACH,CAAC;QACJ,CAAC;QACD,KAAK,MAAM,SAAS,IAAI,IAAI,CAAC,MAAM,CAAC,UAAU,EAAE,CAAC;YAC/C,WAAW,CAAC,IAAI,CACd,GAAG,gBAAgB,CAAC;gBAClB,IAAI;gBACJ,SAAS;gBACT,QAAQ,EAAE,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC;oBAC/B,IAAI;oBACJ,iBAAiB;oBACjB,SAAS,EAAE,KAAK,CAAC,SAAS;oBAC1B,SAAS;iBACV,CAAC;gBACF,eAAe,EAAE,KAAK,CAAC,eAAe;aACvC,CAAC,CACH,CAAC;QACJ,CAAC;IACH,CAAC;IACD,OAAO,WAAW,CAAC;AACrB,CAAC"}
+{"version":3,"file":"evaluate-source-dependencies.js","sourceRoot":"","sources":["../../../../../src/capabilities/source-dependencies/application/policies/evaluate-source-dependencies.ts"],"names":[],"mappings":"AAQA,OAAO,EAAE,8BAA8B,EAAE,MAAM,wCAAwC,CAAC;AACxF,OAAO,EAAE,gCAAgC,EAAE,MAAM,0CAA0C,CAAC;AAC5F,OAAO,EACL,uBAAuB,EAExB,MAAM,aAAa,CAAC;AAOrB,SAAS,UAAU,CAAC,KAOnB;IACC,OAAO;QACL,MAAM,EAAE,KAAK,CAAC,IAAI,CAAC,EAAE;QACrB,QAAQ,EAAE,KAAK,CAAC,IAAI,CAAC,QAAQ;QAC7B,OAAO,EAAE,KAAK,CAAC,OAAO;QACtB,OAAO,EAAE,KAAK,CAAC,OAAO;QACtB,QAAQ,EAAE,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE;QAC9B,gBAAgB,EACd,KAAK,CAAC,WAAW,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,WAAW,EAAE,CAAC;QACtE,QAAQ,EAAE,KAAK,CAAC,QAAQ,IAAI,EAAE;QAC9B,WAAW,EAAE,KAAK,CAAC,IAAI,CAAC,WAAW;QACnC,0BAA0B,EAAE,KAAK,CAAC,IAAI,CAAC,0BAA0B;KAClE,CAAC;AACJ,CAAC;AAED,SAAS,gCAAgC,CACvC,MAAgC,EAChC,KAA0B;IAE1B,IAAI,MAAM,CAAC,aAAa,KAAK,CAAC,EAAE,CAAC;QAC/B,OAAO,EAAE,CAAC;IACZ,CAAC;IACD,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;IAC1E,MAAM,WAAW,GAA2B,EAAE,CAAC;IAC/C,KAAK,MAAM,QAAQ,IAAI,MAAM,CAAC,UAAU,EAAE,CAAC;QACzC,KAAK,MAAM,UAAU,IAAI,QAAQ,CAAC,WAAW,EAAE,CAAC;YAC9C,MAAM,IAAI,GAAG,WAAW,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;YACzC,IAAI,IAAI,KAAK,SAAS,IAAI,IAAI,CAAC,UAAU,KAAK,QAAQ,CAAC,EAAE,EAAE,CAAC;gBAC1D,SAAS;YACX,CAAC;YACD,WAAW,CAAC,IAAI,CACd,UAAU,CAAC;gBACT,IAAI,EAAE,uBAAuB,CAAC,yBAAyB;gBACvD,OAAO,EAAE,GAAG,QAAQ,CAAC,EAAE,IAAI,UAAU,EAAE;gBACvC,OAAO,EACL,IAAI,KAAK,SAAS;oBAChB,CAAC,CAAC,iEAAiE,UAAU,GAAG;oBAChF,CAAC,CAAC,kCAAkC,IAAI,CAAC,UAAU,SAAS,QAAQ,CAAC,EAAE,KAAK,UAAU,GAAG;gBAC7F,IAAI,EAAE,UAAU;gBAChB,QAAQ,EAAE,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,KAAK,EAAE,QAAQ,CAAC,EAAE,EAAE,CAAC;aACrD,CAAC,CACH,CAAC;QACJ,CAAC;IACH,CAAC;IACD,OAAO,WAAW,CAAC;AACrB,CAAC;AAED,MAAM,UAAU,0BAA0B,CACxC,KAAsB;IAEtB,MAAM,WAAW,GAA2B,EAAE,CAAC;IAC/C,MAAM,cAAc,GAAG,IAAI,GAAG,CAC5B,KAAK,CAAC,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC,CACnE,CAAC;IACF,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,CAAC,uBAAuB,EAAE,CAAC;QACvD,WAAW,CAAC,IAAI,CACd,UAAU,CAAC;YACT,IAAI,EAAE,uBAAuB,CAAC,sBAAsB;YACpD,OAAO,EAAE,IAAI;YACb,OAAO,EAAE,mEAAmE;YAC5E,IAAI;SACL,CAAC,CACH,CAAC;IACJ,CAAC;IACD,KAAK,MAAM,OAAO,IAAI,KAAK,CAAC,KAAK,CAAC,aAAa,EAAE,CAAC;QAChD,WAAW,CAAC,IAAI,CACd,UAAU,CAAC;YACT,IAAI,EAAE,uBAAuB,CAAC,gBAAgB;YAC9C,OAAO,EAAE,OAAO,CAAC,IAAI;YACrB,OAAO,EAAE,0BAA0B,OAAO,CAAC,eAAe,YAAY;YACtE,IAAI,EAAE,OAAO,CAAC,IAAI;YAClB,QAAQ,EAAE,CAAC,EAAE,IAAI,EAAE,mBAAmB,EAAE,KAAK,EAAE,MAAM,CAAC,OAAO,CAAC,eAAe,CAAC,EAAE,CAAC;SAClF,CAAC,CACH,CAAC;IACJ,CAAC;IACD,KAAK,MAAM,mBAAmB,IAAI,KAAK,CAAC,KAAK,CAAC,2BAA2B,EAAE,CAAC;QAC1E,MAAM,QAAQ,GAAG,cAAc,CAAC,GAAG,CAAC,mBAAmB,CAAC,UAAU,CAAC,CAAC;QACpE,IAAI,QAAQ,EAAE,wBAAwB,CAAC,QAAQ,CAAC,mBAAmB,CAAC,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;YACnF,SAAS;QACX,CAAC;QACD,WAAW,CAAC,IAAI,CACd,UAAU,CAAC;YACT,IAAI,EAAE,uBAAuB,CAAC,0BAA0B;YACxD,OAAO,EAAE,GAAG,mBAAmB,CAAC,IAAI,IAAI,mBAAmB,CAAC,IAAI,IAAI,mBAAmB,CAAC,KAAK,EAAE;YAC/F,OAAO,EAAE,eAAe,mBAAmB,CAAC,IAAI,qCAAqC;YACrF,IAAI,EAAE,mBAAmB,CAAC,IAAI;YAC9B,QAAQ,EAAE;gBACR,EAAE,IAAI,EAAE,gBAAgB,EAAE,KAAK,EAAE,mBAAmB,CAAC,IAAI,EAAE;gBAC3D,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,CAAC,mBAAmB,CAAC,KAAK,CAAC,EAAE;aAC7D;SACF,CAAC,CACH,CAAC;IACJ,CAAC;IACD,WAAW,CAAC,IAAI,CAAC,GAAG,gCAAgC,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;IACjF,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QACrC,WAAW,CAAC,IAAI,CACd,GAAG,gCAAgC,CAAC;YAClC,IAAI;YACJ,MAAM,EAAE,KAAK,CAAC,MAAM;YACpB,cAAc;SACf,CAAC,CACH,CAAC;IACJ,CAAC;IACD,IAAI,KAAK,CAAC,MAAM,CAAC,aAAa,KAAK,CAAC,EAAE,CAAC;QACrC,WAAW,CAAC,IAAI,CAAC,GAAG,8BAA8B,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;IACnE,CAAC;IACD,OAAO,WAAW,CAAC;AACrB,CAAC"}

package/dist/capabilities/source-dependencies/application/policies/evaluate-source-dependency-cycles.d.ts

@@ -0,0 +1,4 @@
+import type { FoundationDiagnostic } from "../../../../check-contract.js";
+import type { ObservedSourceGraph } from "../model/source-workspace.js";
+export declare function evaluateSourceDependencyCycles(graph: ObservedSourceGraph): readonly FoundationDiagnostic[];
+//# sourceMappingURL=evaluate-source-dependency-cycles.d.ts.map

package/dist/capabilities/source-dependencies/application/policies/evaluate-source-dependency-cycles.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"evaluate-source-dependency-cycles.d.ts","sourceRoot":"","sources":["../../../../../src/capabilities/source-dependencies/application/policies/evaluate-source-dependency-cycles.ts"],"names":[],"mappings":"AAIA,OAAO,KAAK,EAAsB,oBAAoB,EAAE,MAAM,+BAA+B,CAAC;AAC9F,OAAO,KAAK,EAEV,mBAAmB,EAEpB,MAAM,8BAA8B,CAAC;AAoYtC,wBAAgB,8BAA8B,CAC5C,KAAK,EAAE,mBAAmB,GACzB,SAAS,oBAAoB,EAAE,CAgCjC"}

package/dist/capabilities/source-dependencies/application/policies/evaluate-source-dependency-cycles.js

@@ -0,0 +1,315 @@
+import { compareBinaryStrings, compareBinaryStringSequences } from "../../../../binary-string-comparator.js";
+import { SOURCE_DEPENDENCY_RULES } from "../rules.js";
+const MAX_EVIDENCE_MEMBERS = 16;
+const MAX_EVIDENCE_WITNESS_NODES = 16;
+function diagnostic(input) {
+    return {
+        ruleId: input.rule.id,
+        severity: input.rule.severity,
+        subject: input.subject,
+        message: input.message,
+        location: { path: input.path },
+        relatedLocations: input.relatedPath === null ? [] : [{ path: input.relatedPath }],
+        evidence: input.evidence,
+        remediation: input.rule.remediation,
+        requiresArchitectureReview: input.rule.requiresArchitectureReview
+    };
+}
+function compareLogicalEdges(left, right) {
+    return (compareBinaryStrings(left.from, right.from) ||
+        compareBinaryStrings(left.to, right.to) ||
+        compareBinaryStrings(left.mode, right.mode) ||
+        compareBinaryStrings(left.sourcePath, right.sourcePath) ||
+        compareBinaryStrings(left.targetPath ?? "", right.targetPath ?? ""));
+}
+function logicalEdges(graph, scope, mode) {
+    const candidates = [];
+    for (const edge of graph.edges) {
+        // A runtime cycle may contain type-only edges. Type-only diagnostics stay
+        // strict so a purely type-level SCC is not reported as a runtime cycle.
+        if (mode === "type-only" && edge.mode !== "type-only") {
+            continue;
+        }
+        const candidate = logicalEdge(edge, scope);
+        if (candidate !== undefined && candidate.from !== candidate.to) {
+            candidates.push(candidate);
+        }
+    }
+    const unique = new Map();
+    for (const edge of candidates.toSorted(compareLogicalEdges)) {
+        const key = `${edge.from}\u0000${edge.to}`;
+        const current = unique.get(key);
+        if (current === undefined || (current.mode === "type-only" && edge.mode === "runtime")) {
+            unique.set(key, edge);
+        }
+    }
+    return Object.freeze([...unique.values()].toSorted(compareLogicalEdges));
+}
+function logicalEdge(edge, scope) {
+    if (scope === "boundary") {
+        if (edge.resolution.kind !== "local-file") {
+            return undefined;
+        }
+        if (edge.resolution.targetBoundaryId === null) {
+            return undefined;
+        }
+        return {
+            from: edge.fromBoundaryId,
+            mode: edge.mode,
+            to: edge.resolution.targetBoundaryId,
+            sourcePath: edge.fromPath,
+            targetPath: edge.resolution.path
+        };
+    }
+    switch (edge.resolution.kind) {
+        case "local-file":
+            return {
+                from: edge.fromWorkspacePackageName,
+                mode: edge.mode,
+                to: edge.resolution.workspacePackageName,
+                sourcePath: edge.fromPath,
+                targetPath: edge.resolution.path
+            };
+        case "workspace-package":
+            return {
+                from: edge.fromWorkspacePackageName,
+                mode: edge.mode,
+                to: edge.resolution.workspacePackageName,
+                sourcePath: edge.fromPath,
+                targetPath: null
+            };
+        case "builtin":
+        case "external-package":
+        case "self-workspace-package":
+        case "unresolved":
+        case "unsupported":
+            return undefined;
+    }
+}
+function adjacency(edges) {
+    const output = new Map();
+    for (const edge of edges) {
+        const from = output.get(edge.from) ?? [];
+        from.push(edge);
+        output.set(edge.from, from);
+        if (!output.has(edge.to)) {
+            output.set(edge.to, []);
+        }
+    }
+    return new Map([...output.entries()].map(([node, outgoing]) => [
+        node,
+        Object.freeze(outgoing.toSorted(compareLogicalEdges))
+    ]));
+}
+function stronglyConnectedComponents(graph) {
+    const nodes = [...graph.keys()].toSorted();
+    const visited = new Set();
+    const finished = [];
+    // Iterative DFS avoids call-stack failure on a large workspace graph.
+    for (const start of nodes) {
+        if (visited.has(start)) {
+            continue;
+        }
+        visited.add(start);
+        const stack = [{ node: start, nextEdgeIndex: 0 }];
+        while (stack.length > 0) {
+            const frame = stack[stack.length - 1];
+            if (frame === undefined) {
+                break;
+            }
+            const edge = (graph.get(frame.node) ?? [])[frame.nextEdgeIndex];
+            if (edge === undefined) {
+                finished.push(frame.node);
+                stack.pop();
+                continue;
+            }
+            frame.nextEdgeIndex += 1;
+            if (!visited.has(edge.to)) {
+                visited.add(edge.to);
+                stack.push({ node: edge.to, nextEdgeIndex: 0 });
+            }
+        }
+    }
+    const reversed = new Map(nodes.map((node) => [node, []]));
+    for (const [from, outgoing] of graph) {
+        for (const edge of outgoing) {
+            const predecessors = reversed.get(edge.to);
+            if (predecessors !== undefined) {
+                predecessors.push(from);
+            }
+        }
+    }
+    const reverseAdjacency = new Map([...reversed.entries()].map(([node, predecessors]) => [
+        node,
+        predecessors.toSorted()
+    ]));
+    const components = [];
+    visited.clear();
+    for (const start of finished.toReversed()) {
+        if (visited.has(start)) {
+            continue;
+        }
+        const component = [];
+        const stack = [start];
+        visited.add(start);
+        while (stack.length > 0) {
+            const node = stack.pop();
+            if (node === undefined) {
+                continue;
+            }
+            component.push(node);
+            for (const predecessor of reverseAdjacency.get(node) ?? []) {
+                if (!visited.has(predecessor)) {
+                    visited.add(predecessor);
+                    stack.push(predecessor);
+                }
+            }
+        }
+        if (component.length > 1) {
+            components.push(component.toSorted());
+        }
+    }
+    return Object.freeze(components.toSorted(compareBinaryStringSequences));
+}
+function shortestPath(start, target, members, graph, requiredMode) {
+    const queue = [start];
+    const previous = new Map();
+    const visited = new Set([start]);
+    for (let index = 0; index < queue.length; index += 1) {
+        const node = queue[index];
+        if (node === undefined) {
+            break;
+        }
+        for (const edge of graph.get(node) ?? []) {
+            if ((requiredMode !== undefined && edge.mode !== requiredMode) ||
+                !members.has(edge.to) ||
+                visited.has(edge.to)) {
+                continue;
+            }
+            previous.set(edge.to, edge);
+            if (edge.to === target) {
+                return reconstructPath(previous, start, target);
+            }
+            visited.add(edge.to);
+            queue.push(edge.to);
+        }
+    }
+    return undefined;
+}
+function reconstructPath(previous, start, target) {
+    const path = [];
+    let cursor = target;
+    while (cursor !== start) {
+        const step = previous.get(cursor);
+        if (step === undefined) {
+            return undefined;
+        }
+        path.push(step);
+        cursor = step.from;
+    }
+    return Object.freeze(path.toReversed());
+}
+function canonicalWitness(members, graph, mode) {
+    if (members.length === 0) {
+        return undefined;
+    }
+    const memberSet = new Set(members);
+    const candidateEdges = mode === "runtime"
+        ? members.flatMap((member) => (graph.get(member) ?? []).filter((edge) => edge.mode === "runtime" && memberSet.has(edge.to))).toSorted(compareLogicalEdges)
+        : graph.get(members[0] ?? "") ?? [];
+    if (mode === "runtime") {
+        for (const firstEdge of candidateEdges) {
+            const returnPath = shortestPath(firstEdge.to, firstEdge.from, memberSet, graph, "runtime");
+            if (returnPath !== undefined) {
+                return Object.freeze([firstEdge, ...returnPath]);
+            }
+        }
+    }
+    for (const firstEdge of candidateEdges) {
+        if (!memberSet.has(firstEdge.to)) {
+            continue;
+        }
+        const returnPath = shortestPath(firstEdge.to, firstEdge.from, memberSet, graph);
+        if (returnPath !== undefined) {
+            return Object.freeze([firstEdge, ...returnPath]);
+        }
+    }
+    return undefined;
+}
+function boundedList(values, maxItems) {
+    if (values.length <= maxItems) {
+        return values.join(", ");
+    }
+    const headCount = Math.ceil(maxItems / 2);
+    const tailCount = Math.floor(maxItems / 2);
+    return [
+        ...values.slice(0, headCount),
+        `...(+${values.length - maxItems})`,
+        ...values.slice(-tailCount)
+    ].join(", ");
+}
+function boundedWitness(edges) {
+    const nodes = [edges[0]?.from, ...edges.map((edge) => edge.to)].filter((node) => node !== undefined);
+    if (nodes.length <= MAX_EVIDENCE_WITNESS_NODES) {
+        return nodes.join(" -> ");
+    }
+    const headCount = Math.ceil(MAX_EVIDENCE_WITNESS_NODES / 2);
+    const tailCount = Math.floor(MAX_EVIDENCE_WITNESS_NODES / 2);
+    return [
+        ...nodes.slice(0, headCount),
+        "...",
+        ...nodes.slice(-tailCount)
+    ].join(" -> ");
+}
+function cycleEvidence(graph, mode) {
+    const cycles = [];
+    for (const members of stronglyConnectedComponents(graph)) {
+        const witness = canonicalWitness(members, graph, mode);
+        if (witness !== undefined) {
+            cycles.push(Object.freeze({ members: Object.freeze([...members]), witness }));
+        }
+    }
+    return Object.freeze(cycles.toSorted((left, right) => compareBinaryStringSequences(left.members, right.members)));
+}
+function ruleFor(scope, mode) {
+    if (scope === "boundary") {
+        return mode === "runtime"
+            ? SOURCE_DEPENDENCY_RULES.boundaryRuntimeCycle
+            : SOURCE_DEPENDENCY_RULES.boundaryTypeOnlyCycle;
+    }
+    return mode === "runtime"
+        ? SOURCE_DEPENDENCY_RULES.packageRuntimeCycle
+        : SOURCE_DEPENDENCY_RULES.packageTypeOnlyCycle;
+}
+export function evaluateSourceDependencyCycles(graph) {
+    const diagnostics = [];
+    for (const scope of ["boundary", "package"]) {
+        for (const mode of ["runtime", "type-only"]) {
+            const cycles = cycleEvidence(adjacency(logicalEdges(graph, scope, mode)), mode);
+            const rule = ruleFor(scope, mode);
+            for (const cycle of cycles) {
+                const firstEdge = cycle.witness[0];
+                if (firstEdge === undefined) {
+                    continue;
+                }
+                diagnostics.push(diagnostic({
+                    rule,
+                    subject: `${scope}:${cycle.members.join(",")}`,
+                    message: `Observed ${mode} ${scope} cycle: ${boundedWitness(cycle.witness)}.`,
+                    path: firstEdge.sourcePath,
+                    relatedPath: firstEdge.targetPath,
+                    evidence: [
+                        { kind: "cycle-scope", value: scope },
+                        { kind: "cycle-mode", value: mode },
+                        { kind: "cycle-members", value: boundedList(cycle.members, MAX_EVIDENCE_MEMBERS) },
+                        { kind: "cycle-size", value: String(cycle.members.length) },
+                        { kind: "cycle-witness", value: boundedWitness(cycle.witness) },
+                        { kind: "cycle-witness-edge-count", value: String(cycle.witness.length) }
+                    ]
+                }));
+            }
+        }
+    }
+    return diagnostics;
+}
+//# sourceMappingURL=evaluate-source-dependency-cycles.js.map