@webpieces/nx-webpieces-rules 0.3.128 → 0.3.130

package/src/executors/validate-nx-wiring/schema.json

@@ -0,0 +1,19 @@
+{
+    "$schema": "http://json-schema.org/schema",
+    "title": "Validate Nx Wiring Executor",
+    "description": "Validates that the webpieces validators are wired into the build via nx.json targetDefaults dependsOn, so a build cannot pass while running zero validators.",
+    "type": "object",
+    "properties": {
+        "requiredDeps": {
+            "type": "array",
+            "items": { "type": "string" },
+            "description": "Target names that each compile executor's dependsOn must include. Defaults: architecture:validate-complete, validate-no-file-import-cycles."
+        },
+        "compileExecutors": {
+            "type": "array",
+            "items": { "type": "string" },
+            "description": "Compile executors to require wiring on, but only when actually used in the project graph. Defaults: @nx/js:tsc, @angular/build:application."
+        }
+    },
+    "required": []
+}

package/src/executors/validate-packagejson/executor.js

@@ -19,17 +19,24 @@ async function runExecutor(options, context) {
     console.log('\n📦 Validating Package.json Dependencies\n');
     // eslint-disable-next-line @webpieces/no-unmanaged-exceptions
     try {
-        // Step 1: Generate current graph from project.json files
-        console.log('📊 Generating dependency graph from project.json files...');
-        const rawGraph = await (0, graph_generator_1.generateGraph)();
+        // Step 1: Build the full graph from nx, then transitively reduce it (the view)
+        console.log("📊 Generating dependency graph from nx's project graph...");
+        const reducedGraph = await (0, graph_generator_1.generateReducedGraph)();
         // Step 2: Topological sort (to get enhanced graph with levels)
         console.log('🔄 Computing topological layers...');
-        const enhancedGraph = (0, graph_sorter_1.sortGraphTopologically)(rawGraph);
+        const enhancedGraph = (0, graph_sorter_1.sortGraphTopologically)(reducedGraph);
         // Step 3: Validate package.json dependencies match
-        console.log('📦 Validating package.json dependencies match project.json...');
+        console.log('📦 Validating package.json dependencies match the architecture graph...');
         const packageValidation = await (0, package_validator_1.validatePackageJsonDependencies)(enhancedGraph, workspaceRoot);
+        // Warnings never fail the build (e.g. runtime-only / peer deps).
+        if (packageValidation.warnings.length > 0) {
+            console.warn('\n⚠️  Package.json notices (non-fatal):');
+            for (const warning of packageValidation.warnings) {
+                console.warn(`  ${warning}`);
+            }
+        }
         if (!packageValidation.valid) {
-            console.error('❌ Package.json validation failed!');
+            console.error('\n❌ Package.json validation failed!');
             console.error('\nErrors:');
             for (const error of packageValidation.errors) {
                 console.error(`  ${error}`);
@@ -37,10 +44,9 @@ async function runExecutor(options, context) {
             console.error('\nTo fix:');
             console.error('  1. Review the missing dependencies above');
             console.error('  2. Add the missing dependencies to the respective package.json files');
-            console.error('  3. Ensure dependencies in package.json match build.dependsOn in project.json');
             return { success: false };
         }
-        console.log('✅ Package.json dependencies match project.json');
+        console.log('✅ Package.json dependencies cover the architecture graph');
         // Print summary
         const validProjects = packageValidation.projectResults.filter(r => r.valid).length;
         const totalProjects = packageValidation.projectResults.length;

package/src/executors/validate-packagejson/executor.js.map

@@ -1 +1 @@
-{"version":3,"file":"executor.js","sourceRoot":"","sources":["../../../../../../../packages/tooling/nx-webpieces-rules/src/executors/validate-packagejson/executor.ts"],"names":[],"mappings":";AAAA;;;;;;;;GAQG;;AAgBH,8BAmDC;AAhED,+DAA0D;AAC1D,yDAAgE;AAChE,mEAA8E;AAC9E,2CAAwC;AAUzB,KAAK,UAAU,WAAW,CACrC,OAAmC,EACnC,OAAwB;IAExB,MAAM,aAAa,GAAG,OAAO,CAAC,IAAI,CAAC;IAEnC,OAAO,CAAC,GAAG,CAAC,6CAA6C,CAAC,CAAC;IAE3D,8DAA8D;IAC9D,IAAI,CAAC;QACD,yDAAyD;QACzD,OAAO,CAAC,GAAG,CAAC,2DAA2D,CAAC,CAAC;QACzE,MAAM,QAAQ,GAAG,MAAM,IAAA,+BAAa,GAAE,CAAC;QAEvC,+DAA+D;QAC/D,OAAO,CAAC,GAAG,CAAC,oCAAoC,CAAC,CAAC;QAClD,MAAM,aAAa,GAAG,IAAA,qCAAsB,EAAC,QAAQ,CAAC,CAAC;QAEvD,mDAAmD;QACnD,OAAO,CAAC,GAAG,CAAC,+DAA+D,CAAC,CAAC;QAC7E,MAAM,iBAAiB,GAAG,MAAM,IAAA,mDAA+B,EAAC,aAAa,EAAE,aAAa,CAAC,CAAC;QAE9F,IAAI,CAAC,iBAAiB,CAAC,KAAK,EAAE,CAAC;YAC3B,OAAO,CAAC,KAAK,CAAC,mCAAmC,CAAC,CAAC;YACnD,OAAO,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;YAC3B,KAAK,MAAM,KAAK,IAAI,iBAAiB,CAAC,MAAM,EAAE,CAAC;gBAC3C,OAAO,CAAC,KAAK,CAAC,KAAK,KAAK,EAAE,CAAC,CAAC;YAChC,CAAC;YACD,OAAO,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;YAC3B,OAAO,CAAC,KAAK,CAAC,4CAA4C,CAAC,CAAC;YAC5D,OAAO,CAAC,KAAK,CAAC,wEAAwE,CAAC,CAAC;YACxF,OAAO,CAAC,KAAK,CAAC,gFAAgF,CAAC,CAAC;YAChG,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC;QAC9B,CAAC;QAED,OAAO,CAAC,GAAG,CAAC,gDAAgD,CAAC,CAAC;QAE9D,gBAAgB;QAChB,MAAM,aAAa,GAAG,iBAAiB,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC;QACnF,MAAM,aAAa,GAAG,iBAAiB,CAAC,cAAc,CAAC,MAAM,CAAC;QAC9D,OAAO,CAAC,GAAG,CAAC,0BAA0B,CAAC,CAAC;QACxC,OAAO,CAAC,GAAG,CAAC,0BAA0B,aAAa,EAAE,CAAC,CAAC;QACvD,OAAO,CAAC,GAAG,CAAC,aAAa,aAAa,EAAE,CAAC,CAAC;QAC1C,OAAO,CAAC,GAAG,CAAC,eAAe,aAAa,GAAG,aAAa,EAAE,CAAC,CAAC;QAE5D,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC;IAC7B,CAAC;IAAC,OAAO,GAAY,EAAE,CAAC;QACpB,MAAM,KAAK,GAAG,IAAA,iBAAO,EAAC,GAAG,CAAC,CAAC;QAC3B,OAAO,CAAC,KAAK,CAAC,mCAAmC,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC;QAClE,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC;IAC9B,CAAC;AACL,CAAC","sourcesContent":["/**\n * Validate Package.json Executor\n *\n * Validates that package.json dependencies match project.json build dependencies.\n * This ensures the two sources of truth don't drift apart.\n *\n * Usage:\n * nx run architecture:validate-packagejson\n */\n\nimport type { ExecutorContext } from '@nx/devkit';\nimport { generateGraph } from '../../lib/graph-generator';\nimport { sortGraphTopologically } from '../../lib/graph-sorter';\nimport { validatePackageJsonDependencies } from '../../lib/package-validator';\nimport { toError } from '../../toError';\n\nexport interface ValidatePackageJsonOptions {\n    // No options needed for now\n}\n\nexport interface ExecutorResult {\n    success: boolean;\n}\n\nexport default async function runExecutor(\n    options: ValidatePackageJsonOptions,\n    context: ExecutorContext\n): Promise<ExecutorResult> {\n    const workspaceRoot = context.root;\n\n    console.log('\\n📦 Validating Package.json Dependencies\\n');\n\n    // eslint-disable-next-line @webpieces/no-unmanaged-exceptions\n    try {\n        // Step 1: Generate current graph from project.json files\n        console.log('📊 Generating dependency graph from project.json files...');\n        const rawGraph = await generateGraph();\n\n        // Step 2: Topological sort (to get enhanced graph with levels)\n        console.log('🔄 Computing topological layers...');\n        const enhancedGraph = sortGraphTopologically(rawGraph);\n\n        // Step 3: Validate package.json dependencies match\n        console.log('📦 Validating package.json dependencies match project.json...');\n        const packageValidation = await validatePackageJsonDependencies(enhancedGraph, workspaceRoot);\n\n        if (!packageValidation.valid) {\n            console.error('❌ Package.json validation failed!');\n            console.error('\\nErrors:');\n            for (const error of packageValidation.errors) {\n                console.error(`  ${error}`);\n            }\n            console.error('\\nTo fix:');\n            console.error('  1. Review the missing dependencies above');\n            console.error('  2. Add the missing dependencies to the respective package.json files');\n            console.error('  3. Ensure dependencies in package.json match build.dependsOn in project.json');\n            return { success: false };\n        }\n\n        console.log('✅ Package.json dependencies match project.json');\n\n        // Print summary\n        const validProjects = packageValidation.projectResults.filter(r => r.valid).length;\n        const totalProjects = packageValidation.projectResults.length;\n        console.log(`\\n📈 Validation Summary:`);\n        console.log(`   Projects validated: ${totalProjects}`);\n        console.log(`   Valid: ${validProjects}`);\n        console.log(`   Invalid: ${totalProjects - validProjects}`);\n\n        return { success: true };\n    } catch (err: unknown) {\n        const error = toError(err);\n        console.error('❌ Package.json validation failed:', error.message);\n        return { success: false };\n    }\n}\n"]}
+{"version":3,"file":"executor.js","sourceRoot":"","sources":["../../../../../../../packages/tooling/nx-webpieces-rules/src/executors/validate-packagejson/executor.ts"],"names":[],"mappings":";AAAA;;;;;;;;GAQG;;AAgBH,8BA0DC;AAvED,+DAAiE;AACjE,yDAAgE;AAChE,mEAA8E;AAC9E,2CAAwC;AAUzB,KAAK,UAAU,WAAW,CACrC,OAAmC,EACnC,OAAwB;IAExB,MAAM,aAAa,GAAG,OAAO,CAAC,IAAI,CAAC;IAEnC,OAAO,CAAC,GAAG,CAAC,6CAA6C,CAAC,CAAC;IAE3D,8DAA8D;IAC9D,IAAI,CAAC;QACD,+EAA+E;QAC/E,OAAO,CAAC,GAAG,CAAC,2DAA2D,CAAC,CAAC;QACzE,MAAM,YAAY,GAAG,MAAM,IAAA,sCAAoB,GAAE,CAAC;QAElD,+DAA+D;QAC/D,OAAO,CAAC,GAAG,CAAC,oCAAoC,CAAC,CAAC;QAClD,MAAM,aAAa,GAAG,IAAA,qCAAsB,EAAC,YAAY,CAAC,CAAC;QAE3D,mDAAmD;QACnD,OAAO,CAAC,GAAG,CAAC,yEAAyE,CAAC,CAAC;QACvF,MAAM,iBAAiB,GAAG,MAAM,IAAA,mDAA+B,EAAC,aAAa,EAAE,aAAa,CAAC,CAAC;QAE9F,iEAAiE;QACjE,IAAI,iBAAiB,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxC,OAAO,CAAC,IAAI,CAAC,yCAAyC,CAAC,CAAC;YACxD,KAAK,MAAM,OAAO,IAAI,iBAAiB,CAAC,QAAQ,EAAE,CAAC;gBAC/C,OAAO,CAAC,IAAI,CAAC,KAAK,OAAO,EAAE,CAAC,CAAC;YACjC,CAAC;QACL,CAAC;QAED,IAAI,CAAC,iBAAiB,CAAC,KAAK,EAAE,CAAC;YAC3B,OAAO,CAAC,KAAK,CAAC,qCAAqC,CAAC,CAAC;YACrD,OAAO,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;YAC3B,KAAK,MAAM,KAAK,IAAI,iBAAiB,CAAC,MAAM,EAAE,CAAC;gBAC3C,OAAO,CAAC,KAAK,CAAC,KAAK,KAAK,EAAE,CAAC,CAAC;YAChC,CAAC;YACD,OAAO,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;YAC3B,OAAO,CAAC,KAAK,CAAC,4CAA4C,CAAC,CAAC;YAC5D,OAAO,CAAC,KAAK,CAAC,wEAAwE,CAAC,CAAC;YACxF,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC;QAC9B,CAAC;QAED,OAAO,CAAC,GAAG,CAAC,0DAA0D,CAAC,CAAC;QAExE,gBAAgB;QAChB,MAAM,aAAa,GAAG,iBAAiB,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC;QACnF,MAAM,aAAa,GAAG,iBAAiB,CAAC,cAAc,CAAC,MAAM,CAAC;QAC9D,OAAO,CAAC,GAAG,CAAC,0BAA0B,CAAC,CAAC;QACxC,OAAO,CAAC,GAAG,CAAC,0BAA0B,aAAa,EAAE,CAAC,CAAC;QACvD,OAAO,CAAC,GAAG,CAAC,aAAa,aAAa,EAAE,CAAC,CAAC;QAC1C,OAAO,CAAC,GAAG,CAAC,eAAe,aAAa,GAAG,aAAa,EAAE,CAAC,CAAC;QAE5D,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC;IAC7B,CAAC;IAAC,OAAO,GAAY,EAAE,CAAC;QACpB,MAAM,KAAK,GAAG,IAAA,iBAAO,EAAC,GAAG,CAAC,CAAC;QAC3B,OAAO,CAAC,KAAK,CAAC,mCAAmC,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC;QAClE,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC;IAC9B,CAAC;AACL,CAAC","sourcesContent":["/**\n * Validate Package.json Executor\n *\n * Validates that package.json dependencies match project.json build dependencies.\n * This ensures the two sources of truth don't drift apart.\n *\n * Usage:\n * nx run architecture:validate-packagejson\n */\n\nimport type { ExecutorContext } from '@nx/devkit';\nimport { generateReducedGraph } from '../../lib/graph-generator';\nimport { sortGraphTopologically } from '../../lib/graph-sorter';\nimport { validatePackageJsonDependencies } from '../../lib/package-validator';\nimport { toError } from '../../toError';\n\nexport interface ValidatePackageJsonOptions {\n    // No options needed for now\n}\n\nexport interface ExecutorResult {\n    success: boolean;\n}\n\nexport default async function runExecutor(\n    options: ValidatePackageJsonOptions,\n    context: ExecutorContext\n): Promise<ExecutorResult> {\n    const workspaceRoot = context.root;\n\n    console.log('\\n📦 Validating Package.json Dependencies\\n');\n\n    // eslint-disable-next-line @webpieces/no-unmanaged-exceptions\n    try {\n        // Step 1: Build the full graph from nx, then transitively reduce it (the view)\n        console.log(\"📊 Generating dependency graph from nx's project graph...\");\n        const reducedGraph = await generateReducedGraph();\n\n        // Step 2: Topological sort (to get enhanced graph with levels)\n        console.log('🔄 Computing topological layers...');\n        const enhancedGraph = sortGraphTopologically(reducedGraph);\n\n        // Step 3: Validate package.json dependencies match\n        console.log('📦 Validating package.json dependencies match the architecture graph...');\n        const packageValidation = await validatePackageJsonDependencies(enhancedGraph, workspaceRoot);\n\n        // Warnings never fail the build (e.g. runtime-only / peer deps).\n        if (packageValidation.warnings.length > 0) {\n            console.warn('\\n⚠️  Package.json notices (non-fatal):');\n            for (const warning of packageValidation.warnings) {\n                console.warn(`  ${warning}`);\n            }\n        }\n\n        if (!packageValidation.valid) {\n            console.error('\\n❌ Package.json validation failed!');\n            console.error('\\nErrors:');\n            for (const error of packageValidation.errors) {\n                console.error(`  ${error}`);\n            }\n            console.error('\\nTo fix:');\n            console.error('  1. Review the missing dependencies above');\n            console.error('  2. Add the missing dependencies to the respective package.json files');\n            return { success: false };\n        }\n\n        console.log('✅ Package.json dependencies cover the architecture graph');\n\n        // Print summary\n        const validProjects = packageValidation.projectResults.filter(r => r.valid).length;\n        const totalProjects = packageValidation.projectResults.length;\n        console.log(`\\n📈 Validation Summary:`);\n        console.log(`   Projects validated: ${totalProjects}`);\n        console.log(`   Valid: ${validProjects}`);\n        console.log(`   Invalid: ${totalProjects - validProjects}`);\n\n        return { success: true };\n    } catch (err: unknown) {\n        const error = toError(err);\n        console.error('❌ Package.json validation failed:', error.message);\n        return { success: false };\n    }\n}\n"]}

package/src/lib/graph-generator.d.ts

@@ -1,19 +1,38 @@
 /**
  * Graph Generator
  *
- * Generates dependency graph from project.json files in the workspace.
- * Reads build.dependsOn and implicitDependencies to determine project relationships.
+ * Builds the workspace dependency graph from nx's OWN project graph
+ * (createProjectGraphAsync). nx already derives those edges from BOTH source
+ * imports AND package.json workspace deps, so there is no hand-maintained edge
+ * list and no separate import scan — we consume what nx already computed.
+ *
+ *  - generateGraph()        → the FULL graph (every workspace edge nx knows).
+ *                             This is what build order follows via `^build`.
+ *  - generateReducedGraph() → transitive reduction of the full graph: the minimal
+ *                             edge set with identical reachability, used as the
+ *                             architecture VIEW written to dependencies.json.
  */
 /**
- * Generate raw dependency graph from project.json files
- * Returns: { projectName: [dependencyNames] }
+ * Build the full dependency graph from nx's project graph.
+ *
+ * nx's `projectGraph.nodes` are the workspace projects; `projectGraph.dependencies`
+ * holds every edge nx inferred (imports + package.json). We keep only edges whose
+ * target is another workspace project (dropping `npm:` externals) and drop excluded
+ * projects.
+ *
+ * Returns: { projectName: [workspaceDependencyNames] } (deps sorted, deduped)
  */
 export declare function generateRawGraph(): Promise<Record<string, string[]>>;
 /**
- * Transform project names (sorting dependencies only - no scope transformation)
+ * The full workspace dependency graph (every edge nx knows).
  */
-export declare function transformGraph(rawGraph: Record<string, string[]>): Record<string, string[]>;
+export declare function generateGraph(): Promise<Record<string, string[]>>;
 /**
- * Generate complete dependency graph with transformations
+ * The transitively-reduced view of the full graph. This is the canonical
+ * "architecture graph" written to and validated against dependencies.json.
+ *
+ * Reduction is undefined on cycles; callers that care about cycles
+ * (validate-no-architecture-cycles) run on the FULL graph and throw first. For the
+ * view executors, the downstream topological sort also throws on any cycle.
  */
-export declare function generateGraph(): Promise<Record<string, string[]>>;
+export declare function generateReducedGraph(): Promise<Record<string, string[]>>;

package/src/lib/graph-generator.js

@@ -2,83 +2,78 @@
 /**
  * Graph Generator
  *
- * Generates dependency graph from project.json files in the workspace.
- * Reads build.dependsOn and implicitDependencies to determine project relationships.
+ * Builds the workspace dependency graph from nx's OWN project graph
+ * (createProjectGraphAsync). nx already derives those edges from BOTH source
+ * imports AND package.json workspace deps, so there is no hand-maintained edge
+ * list and no separate import scan — we consume what nx already computed.
+ *
+ *  - generateGraph()        → the FULL graph (every workspace edge nx knows).
+ *                             This is what build order follows via `^build`.
+ *  - generateReducedGraph() → transitive reduction of the full graph: the minimal
+ *                             edge set with identical reachability, used as the
+ *                             architecture VIEW written to dependencies.json.
  */
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.generateRawGraph = generateRawGraph;
-exports.transformGraph = transformGraph;
 exports.generateGraph = generateGraph;
+exports.generateReducedGraph = generateReducedGraph;
 const devkit_1 = require("@nx/devkit");
+const transitive_reduction_1 = require("./transitive-reduction");
 /**
  * Projects to exclude from graph validation (tools, configs, etc.)
  */
 const EXCLUDED_PROJECTS = new Set(['architecture']);
 /**
- * Extract project dependencies from project.json's build.dependsOn and implicitDependencies
- */
-function extractBuildDependencies(projectConfig) {
-    const deps = [];
-    // 1. Read from build.dependsOn
-    const buildTarget = projectConfig.targets?.['build'];
-    if (buildTarget && buildTarget.dependsOn) {
-        for (const dep of buildTarget.dependsOn) {
-            if (typeof dep === 'string') {
-                // Format: "project-name:build" or just "build" (for self)
-                const match = dep.match(/^([^:]+):build$/);
-                if (match) {
-                    deps.push(match[1]);
-                }
-            }
-        }
-    }
-    // 2. Also read from implicitDependencies
-    if (projectConfig.implicitDependencies && Array.isArray(projectConfig.implicitDependencies)) {
-        for (const dep of projectConfig.implicitDependencies) {
-            if (typeof dep === 'string' && !deps.includes(dep)) {
-                deps.push(dep);
-            }
-        }
-    }
-    return deps.sort();
-}
-/**
- * Generate raw dependency graph from project.json files
- * Returns: { projectName: [dependencyNames] }
+ * Build the full dependency graph from nx's project graph.
+ *
+ * nx's `projectGraph.nodes` are the workspace projects; `projectGraph.dependencies`
+ * holds every edge nx inferred (imports + package.json). We keep only edges whose
+ * target is another workspace project (dropping `npm:` externals) and drop excluded
+ * projects.
+ *
+ * Returns: { projectName: [workspaceDependencyNames] } (deps sorted, deduped)
  */
 async function generateRawGraph() {
     const projectGraph = await (0, devkit_1.createProjectGraphAsync)();
-    const projectsConfig = (0, devkit_1.readProjectsConfigurationFromProjectGraph)(projectGraph);
+    const workspaceProjects = new Set(Object.keys(projectGraph.nodes));
     const rawDeps = {};
-    for (const [projectName, projectConfig] of Object.entries(projectsConfig.projects)) {
-        // Skip excluded projects (tools, plugins)
+    for (const projectName of workspaceProjects) {
         if (EXCLUDED_PROJECTS.has(projectName)) {
             continue;
         }
-        // Extract dependencies from build.dependsOn in project.json
-        const deps = extractBuildDependencies(projectConfig);
-        rawDeps[projectName] = deps;
+        const edges = projectGraph.dependencies[projectName] ?? [];
+        const deps = new Set();
+        for (const edge of edges) {
+            const target = edge.target;
+            // Keep only workspace→workspace edges; skip self and excluded projects.
+            if (target === projectName)
+                continue;
+            if (!workspaceProjects.has(target))
+                continue; // drops npm: externals
+            if (EXCLUDED_PROJECTS.has(target))
+                continue;
+            deps.add(target);
+        }
+        rawDeps[projectName] = Array.from(deps).sort();
     }
     return rawDeps;
 }
 /**
- * Transform project names (sorting dependencies only - no scope transformation)
+ * The full workspace dependency graph (every edge nx knows).
  */
-function transformGraph(rawGraph) {
-    const result = {};
-    for (const [projectName, deps] of Object.entries(rawGraph)) {
-        // Use project names as-is - don't force @webpieces scope on client projects
-        const transformedName = projectName;
-        const transformedDeps = deps.sort();
-        result[transformedName] = transformedDeps;
-    }
-    return result;
+async function generateGraph() {
+    return generateRawGraph();
 }
 /**
- * Generate complete dependency graph with transformations
+ * The transitively-reduced view of the full graph. This is the canonical
+ * "architecture graph" written to and validated against dependencies.json.
+ *
+ * Reduction is undefined on cycles; callers that care about cycles
+ * (validate-no-architecture-cycles) run on the FULL graph and throw first. For the
+ * view executors, the downstream topological sort also throws on any cycle.
  */
-async function generateGraph() {
-    const rawGraph = await generateRawGraph();
-    return transformGraph(rawGraph);
+async function generateReducedGraph() {
+    const full = await generateGraph();
+    return (0, transitive_reduction_1.transitiveReduction)(full);
 }
 //# sourceMappingURL=graph-generator.js.map

package/src/lib/graph-generator.js.map

@@ -1 +1 @@
-{"version":3,"file":"graph-generator.js","sourceRoot":"","sources":["../../../../../../packages/tooling/nx-webpieces-rules/src/lib/graph-generator.ts"],"names":[],"mappings":";AAAA;;;;;GAKG;;AAiDH,4CAiBC;AAKD,wCAYC;AAKD,sCAGC;AAzFD,uCAIoB;AAEpB;;GAEG;AACH,MAAM,iBAAiB,GAAG,IAAI,GAAG,CAAS,CAAC,cAAc,CAAC,CAAC,CAAC;AAE5D;;GAEG;AACH,SAAS,wBAAwB,CAAC,aAAmC;IACjE,MAAM,IAAI,GAAa,EAAE,CAAC;IAE1B,+BAA+B;IAC/B,MAAM,WAAW,GAAG,aAAa,CAAC,OAAO,EAAE,CAAC,OAAO,CAAC,CAAC;IACrD,IAAI,WAAW,IAAI,WAAW,CAAC,SAAS,EAAE,CAAC;QACvC,KAAK,MAAM,GAAG,IAAI,WAAW,CAAC,SAAS,EAAE,CAAC;YACtC,IAAI,OAAO,GAAG,KAAK,QAAQ,EAAE,CAAC;gBAC1B,0DAA0D;gBAC1D,MAAM,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC,iBAAiB,CAAC,CAAC;gBAC3C,IAAI,KAAK,EAAE,CAAC;oBACR,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;gBACxB,CAAC;YACL,CAAC;QACL,CAAC;IACL,CAAC;IAED,yCAAyC;IACzC,IAAI,aAAa,CAAC,oBAAoB,IAAI,KAAK,CAAC,OAAO,CAAC,aAAa,CAAC,oBAAoB,CAAC,EAAE,CAAC;QAC1F,KAAK,MAAM,GAAG,IAAI,aAAa,CAAC,oBAAoB,EAAE,CAAC;YACnD,IAAI,OAAO,GAAG,KAAK,QAAQ,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;gBACjD,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACnB,CAAC;QACL,CAAC;IACL,CAAC;IAED,OAAO,IAAI,CAAC,IAAI,EAAE,CAAC;AACvB,CAAC;AAED;;;GAGG;AACI,KAAK,UAAU,gBAAgB;IAClC,MAAM,YAAY,GAAG,MAAM,IAAA,gCAAuB,GAAE,CAAC;IACrD,MAAM,cAAc,GAAG,IAAA,kDAAyC,EAAC,YAAY,CAAC,CAAC;IAC/E,MAAM,OAAO,GAA6B,EAAE,CAAC;IAE7C,KAAK,MAAM,CAAC,WAAW,EAAE,aAAa,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,cAAc,CAAC,QAAQ,CAAC,EAAE,CAAC;QACjF,0CAA0C;QAC1C,IAAI,iBAAiB,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,CAAC;YACrC,SAAS;QACb,CAAC;QAED,4DAA4D;QAC5D,MAAM,IAAI,GAAG,wBAAwB,CAAC,aAAa,CAAC,CAAC;QACrD,OAAO,CAAC,WAAW,CAAC,GAAG,IAAI,CAAC;IAChC,CAAC;IAED,OAAO,OAAO,CAAC;AACnB,CAAC;AAED;;GAEG;AACH,SAAgB,cAAc,CAAC,QAAkC;IAC7D,MAAM,MAAM,GAA6B,EAAE,CAAC;IAE5C,KAAK,MAAM,CAAC,WAAW,EAAE,IAAI,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC;QACzD,4EAA4E;QAC5E,MAAM,eAAe,GAAG,WAAW,CAAC;QACpC,MAAM,eAAe,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;QAEpC,MAAM,CAAC,eAAe,CAAC,GAAG,eAAe,CAAC;IAC9C,CAAC;IAED,OAAO,MAAM,CAAC;AAClB,CAAC;AAED;;GAEG;AACI,KAAK,UAAU,aAAa;IAC/B,MAAM,QAAQ,GAAG,MAAM,gBAAgB,EAAE,CAAC;IAC1C,OAAO,cAAc,CAAC,QAAQ,CAAC,CAAC;AACpC,CAAC","sourcesContent":["/**\n * Graph Generator\n *\n * Generates dependency graph from project.json files in the workspace.\n * Reads build.dependsOn and implicitDependencies to determine project relationships.\n */\n\nimport {\n    createProjectGraphAsync,\n    readProjectsConfigurationFromProjectGraph,\n    ProjectConfiguration,\n} from '@nx/devkit';\n\n/**\n * Projects to exclude from graph validation (tools, configs, etc.)\n */\nconst EXCLUDED_PROJECTS = new Set<string>(['architecture']);\n\n/**\n * Extract project dependencies from project.json's build.dependsOn and implicitDependencies\n */\nfunction extractBuildDependencies(projectConfig: ProjectConfiguration): string[] {\n    const deps: string[] = [];\n\n    // 1. Read from build.dependsOn\n    const buildTarget = projectConfig.targets?.['build'];\n    if (buildTarget && buildTarget.dependsOn) {\n        for (const dep of buildTarget.dependsOn) {\n            if (typeof dep === 'string') {\n                // Format: \"project-name:build\" or just \"build\" (for self)\n                const match = dep.match(/^([^:]+):build$/);\n                if (match) {\n                    deps.push(match[1]);\n                }\n            }\n        }\n    }\n\n    // 2. Also read from implicitDependencies\n    if (projectConfig.implicitDependencies && Array.isArray(projectConfig.implicitDependencies)) {\n        for (const dep of projectConfig.implicitDependencies) {\n            if (typeof dep === 'string' && !deps.includes(dep)) {\n                deps.push(dep);\n            }\n        }\n    }\n\n    return deps.sort();\n}\n\n/**\n * Generate raw dependency graph from project.json files\n * Returns: { projectName: [dependencyNames] }\n */\nexport async function generateRawGraph(): Promise<Record<string, string[]>> {\n    const projectGraph = await createProjectGraphAsync();\n    const projectsConfig = readProjectsConfigurationFromProjectGraph(projectGraph);\n    const rawDeps: Record<string, string[]> = {};\n\n    for (const [projectName, projectConfig] of Object.entries(projectsConfig.projects)) {\n        // Skip excluded projects (tools, plugins)\n        if (EXCLUDED_PROJECTS.has(projectName)) {\n            continue;\n        }\n\n        // Extract dependencies from build.dependsOn in project.json\n        const deps = extractBuildDependencies(projectConfig);\n        rawDeps[projectName] = deps;\n    }\n\n    return rawDeps;\n}\n\n/**\n * Transform project names (sorting dependencies only - no scope transformation)\n */\nexport function transformGraph(rawGraph: Record<string, string[]>): Record<string, string[]> {\n    const result: Record<string, string[]> = {};\n\n    for (const [projectName, deps] of Object.entries(rawGraph)) {\n        // Use project names as-is - don't force @webpieces scope on client projects\n        const transformedName = projectName;\n        const transformedDeps = deps.sort();\n\n        result[transformedName] = transformedDeps;\n    }\n\n    return result;\n}\n\n/**\n * Generate complete dependency graph with transformations\n */\nexport async function generateGraph(): Promise<Record<string, string[]>> {\n    const rawGraph = await generateRawGraph();\n    return transformGraph(rawGraph);\n}\n"]}
+{"version":3,"file":"graph-generator.js","sourceRoot":"","sources":["../../../../../../packages/tooling/nx-webpieces-rules/src/lib/graph-generator.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;GAaG;;AAoBH,4CA0BC;AAKD,sCAEC;AAUD,oDAGC;AAhED,uCAAqD;AACrD,iEAA6D;AAE7D;;GAEG;AACH,MAAM,iBAAiB,GAAG,IAAI,GAAG,CAAS,CAAC,cAAc,CAAC,CAAC,CAAC;AAE5D;;;;;;;;;GASG;AACI,KAAK,UAAU,gBAAgB;IAClC,MAAM,YAAY,GAAG,MAAM,IAAA,gCAAuB,GAAE,CAAC;IACrD,MAAM,iBAAiB,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC;IAEnE,MAAM,OAAO,GAA6B,EAAE,CAAC;IAE7C,KAAK,MAAM,WAAW,IAAI,iBAAiB,EAAE,CAAC;QAC1C,IAAI,iBAAiB,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,CAAC;YACrC,SAAS;QACb,CAAC;QAED,MAAM,KAAK,GAAG,YAAY,CAAC,YAAY,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC;QAC3D,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;QAC/B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACvB,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;YAC3B,wEAAwE;YACxE,IAAI,MAAM,KAAK,WAAW;gBAAE,SAAS;YACrC,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,MAAM,CAAC;gBAAE,SAAS,CAAC,uBAAuB;YACrE,IAAI,iBAAiB,CAAC,GAAG,CAAC,MAAM,CAAC;gBAAE,SAAS;YAC5C,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACrB,CAAC;QAED,OAAO,CAAC,WAAW,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC;IACnD,CAAC;IAED,OAAO,OAAO,CAAC;AACnB,CAAC;AAED;;GAEG;AACI,KAAK,UAAU,aAAa;IAC/B,OAAO,gBAAgB,EAAE,CAAC;AAC9B,CAAC;AAED;;;;;;;GAOG;AACI,KAAK,UAAU,oBAAoB;IACtC,MAAM,IAAI,GAAG,MAAM,aAAa,EAAE,CAAC;IACnC,OAAO,IAAA,0CAAmB,EAAC,IAAI,CAAC,CAAC;AACrC,CAAC","sourcesContent":["/**\n * Graph Generator\n *\n * Builds the workspace dependency graph from nx's OWN project graph\n * (createProjectGraphAsync). nx already derives those edges from BOTH source\n * imports AND package.json workspace deps, so there is no hand-maintained edge\n * list and no separate import scan — we consume what nx already computed.\n *\n *  - generateGraph()        → the FULL graph (every workspace edge nx knows).\n *                             This is what build order follows via `^build`.\n *  - generateReducedGraph() → transitive reduction of the full graph: the minimal\n *                             edge set with identical reachability, used as the\n *                             architecture VIEW written to dependencies.json.\n */\n\nimport { createProjectGraphAsync } from '@nx/devkit';\nimport { transitiveReduction } from './transitive-reduction';\n\n/**\n * Projects to exclude from graph validation (tools, configs, etc.)\n */\nconst EXCLUDED_PROJECTS = new Set<string>(['architecture']);\n\n/**\n * Build the full dependency graph from nx's project graph.\n *\n * nx's `projectGraph.nodes` are the workspace projects; `projectGraph.dependencies`\n * holds every edge nx inferred (imports + package.json). We keep only edges whose\n * target is another workspace project (dropping `npm:` externals) and drop excluded\n * projects.\n *\n * Returns: { projectName: [workspaceDependencyNames] } (deps sorted, deduped)\n */\nexport async function generateRawGraph(): Promise<Record<string, string[]>> {\n    const projectGraph = await createProjectGraphAsync();\n    const workspaceProjects = new Set(Object.keys(projectGraph.nodes));\n\n    const rawDeps: Record<string, string[]> = {};\n\n    for (const projectName of workspaceProjects) {\n        if (EXCLUDED_PROJECTS.has(projectName)) {\n            continue;\n        }\n\n        const edges = projectGraph.dependencies[projectName] ?? [];\n        const deps = new Set<string>();\n        for (const edge of edges) {\n            const target = edge.target;\n            // Keep only workspace→workspace edges; skip self and excluded projects.\n            if (target === projectName) continue;\n            if (!workspaceProjects.has(target)) continue; // drops npm: externals\n            if (EXCLUDED_PROJECTS.has(target)) continue;\n            deps.add(target);\n        }\n\n        rawDeps[projectName] = Array.from(deps).sort();\n    }\n\n    return rawDeps;\n}\n\n/**\n * The full workspace dependency graph (every edge nx knows).\n */\nexport async function generateGraph(): Promise<Record<string, string[]>> {\n    return generateRawGraph();\n}\n\n/**\n * The transitively-reduced view of the full graph. This is the canonical\n * \"architecture graph\" written to and validated against dependencies.json.\n *\n * Reduction is undefined on cycles; callers that care about cycles\n * (validate-no-architecture-cycles) run on the FULL graph and throw first. For the\n * view executors, the downstream topological sort also throws on any cycle.\n */\nexport async function generateReducedGraph(): Promise<Record<string, string[]>> {\n    const full = await generateGraph();\n    return transitiveReduction(full);\n}\n"]}

package/src/lib/package-validator.d.ts

@@ -15,10 +15,20 @@ export interface ProjectValidationResult {
 }
 /**
  * Overall validation result
+ *
+ * `errors` fail the build; their only fix is ADDITIVE ("add to package.json"), so they can
+ * never push a user toward removing a runtime-required dependency.
+ *
+ * `warnings` never fail the build. Workspace deps in package.json that the architecture graph
+ * can't reach are reported here, NOT as errors: a transitively-reachable or even unreachable
+ * entry can still be a real runtime dependency (e.g. a peerDependency or a generated client
+ * that nx's import analysis doesn't traverse). Erroring on these is the "runtime-validity trap"
+ * that previously forced a bad package.json edit — so we only warn.
  */
 export interface ValidationResult {
     valid: boolean;
     errors: string[];
+    warnings: string[];
     projectResults: ProjectValidationResult[];
 }
 /**

package/src/lib/package-validator.js

@@ -132,13 +132,17 @@ function validateSingleProject(projectName, entry, projectRoot, packageJsonDeps,
         errors.push(`Project ${projectName} (${projectRoot}/package.json) is missing dependencies: ${classification.missingInPackageJson.join(', ')}\n` +
             `  Fix: Add these to package.json dependencies`);
     }
+    // Unreachable workspace extras are WARN-ONLY: they may be real runtime deps that nx's
+    // import analysis can't see (peerDependency / generated client). Never error — that is
+    // the runtime-validity trap. We surface them so genuine drift is still visible.
+    const warnings = [];
     for (const extraPkg of classification.extraWorkspaceDeps) {
         const extraProject = packageToProject.get(extraPkg);
-        errors.push(`Project ${projectName} (${projectRoot}/package.json) has "${extraPkg}" in package.json but architecture/dependencies.json has no path ${projectName} → ${extraProject} (not even transitively).\n` +
-            `  Fix: Either add "${extraProject}:build" to project.json:build.dependsOn (then run \`nx run architecture:generate\`), or remove "${extraPkg}" from package.json dependencies.`);
+        warnings.push(`Project ${projectName} (${projectRoot}/package.json) has "${extraPkg}" but the architecture graph has no path ${projectName} → ${extraProject}.\n` +
+            `  This is allowed (it may be a runtime-only/peer dependency). If it is genuinely unused, you may remove it.`);
     }
-    const valid = classification.missingInPackageJson.length === 0 &&
-        classification.extraWorkspaceDeps.length === 0;
+    // extraWorkspaceDeps do NOT affect validity — only missing (additive-fix) errors do.
+    const valid = classification.missingInPackageJson.length === 0;
     return {
         result: {
             project: projectName,
@@ -147,6 +151,7 @@ function validateSingleProject(projectName, entry, projectRoot, packageJsonDeps,
             extraInPackageJson: classification.extraInPackageJson,
         },
         errors,
+        warnings,
     };
 }
 async function validatePackageJsonDependencies(graph, workspaceRoot) {
@@ -158,6 +163,7 @@ async function validatePackageJsonDependencies(graph, workspaceRoot) {
         packageToProject.set(pkgName, projName);
     }
     const errors = [];
+    const warnings = [];
     const projectResults = [];
     for (const [projectName, entry] of Object.entries(graph)) {
         const projectConfig = projectsConfig.projects[projectName];
@@ -169,7 +175,8 @@ async function validatePackageJsonDependencies(graph, workspaceRoot) {
         const validation = validateSingleProject(projectName, entry, projectConfig.root, packageJsonDeps, graph, projectToPackage, packageToProject);
         projectResults.push(validation.result);
         errors.push(...validation.errors);
+        warnings.push(...validation.warnings);
     }
-    return { valid: errors.length === 0, errors, projectResults };
+    return { valid: errors.length === 0, errors, warnings, projectResults };
 }
 //# sourceMappingURL=package-validator.js.map

package/src/lib/package-validator.js.map

@@ -1 +1 @@
-{"version":3,"file":"package-validator.js","sourceRoot":"","sources":["../../../../../../packages/tooling/nx-webpieces-rules/src/lib/package-validator.ts"],"names":[],"mappings":";AAAA;;;;;GAKG;;AA0OH,0EAqCC;;AA7QD,+CAAyB;AACzB,mDAA6B;AAC7B,uCAGoB;AAsBpB;;;GAGG;AACH,SAAS,mBAAmB,CAAC,aAAqB,EAAE,WAAmB;IACnE,MAAM,eAAe,GAAG,IAAI,CAAC,IAAI,CAAC,aAAa,EAAE,WAAW,EAAE,cAAc,CAAC,CAAC;IAE9E,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,eAAe,CAAC,EAAE,CAAC;QAClC,OAAO,IAAI,CAAC,CAAC,qDAAqD;IACtE,CAAC;IAED,8DAA8D;IAC9D,IAAI,CAAC;QACD,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,YAAY,CAAC,eAAe,EAAE,OAAO,CAAC,CAAC,CAAC;QAC1E,MAAM,IAAI,GAAa,EAAE,CAAC;QAE1B,6CAA6C;QAC7C,KAAK,MAAM,OAAO,IAAI,CAAC,cAAc,EAAE,kBAAkB,CAAC,EAAE,CAAC;YACzD,MAAM,MAAM,GAAG,WAAW,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC;YAC1C,KAAK,MAAM,OAAO,IAAI,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;gBACxC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC;oBAC1B,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;gBACvB,CAAC;YACL,CAAC;QACL,CAAC;QAED,OAAO,IAAI,CAAC,IAAI,EAAE,CAAC;IACvB,CAAC;IAAC,OAAO,GAAY,EAAE,CAAC;QACpB,6BAA6B;QAC7B,KAAK,GAAG,CAAC;QACT,OAAO,CAAC,IAAI,CAAC,kCAAkC,eAAe,EAAE,CAAC,CAAC;QAClE,OAAO,EAAE,CAAC;IACd,CAAC;AACL,CAAC;AAED;;;GAGG;AACH,SAAS,wBAAwB,CAC7B,aAAqB;AACrB,sGAAsG;AACtG,cAAmB;IAEnB,MAAM,GAAG,GAAG,IAAI,GAAG,EAAkB,CAAC;IAEtC,oFAAoF;IACpF,KAAK,MAAM,CAAC,WAAW,EAAE,MAAM,CAAC,IAAI,MAAM,CAAC,OAAO,CAAM,cAAc,CAAC,QAAQ,CAAC,EAAE,CAAC;QAC/E,MAAM,eAAe,GAAG,IAAI,CAAC,IAAI,CAAC,aAAa,EAAE,MAAM,CAAC,IAAI,EAAE,cAAc,CAAC,CAAC;QAC9E,IAAI,EAAE,CAAC,UAAU,CAAC,eAAe,CAAC,EAAE,CAAC;YACjC,8DAA8D;YAC9D,IAAI,CAAC;gBACD,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,YAAY,CAAC,eAAe,EAAE,OAAO,CAAC,CAAC,CAAC;gBAC1E,IAAI,WAAW,CAAC,IAAI,EAAE,CAAC;oBACnB,GAAG,CAAC,GAAG,CAAC,WAAW,EAAE,WAAW,CAAC,IAAI,CAAC,CAAC;gBAC3C,CAAC;YACL,CAAC;YAAC,OAAO,GAAY,EAAE,CAAC;gBACpB,6BAA6B;gBAC7B,KAAK,GAAG,CAAC;gBACT,sBAAsB;YAC1B,CAAC;QACL,CAAC;IACL,CAAC;IAED,OAAO,GAAG,CAAC;AACf,CAAC;AAwBD;;;;;;;;;GASG;AACH,SAAS,wBAAwB,CAC7B,WAAmB,EACnB,KAAiC;IAEjC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,KAAK,GAAG,CAAC,WAAW,CAAC,CAAC;IAC5B,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACtB,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;QAC7B,MAAM,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC;QAC7B,IAAI,CAAC,KAAK;YAAE,SAAS;QACrB,KAAK,MAAM,GAAG,IAAI,KAAK,CAAC,SAAS,EAAE,CAAC;YAChC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBACpB,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBACjB,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACpB,CAAC;QACL,CAAC;IACL,CAAC;IACD,OAAO,OAAO,CAAC;AACnB,CAAC;AAOD,SAAS,YAAY,CACjB,eAAyB,EACzB,KAAiB,EACjB,iBAA8B,EAC9B,gBAAqC,EACrC,gBAAqC;IAErC,MAAM,oBAAoB,GAAa,EAAE,CAAC;IAC1C,KAAK,MAAM,cAAc,IAAI,KAAK,CAAC,SAAS,EAAE,CAAC;QAC3C,MAAM,cAAc,GAAG,gBAAgB,CAAC,GAAG,CAAC,cAAc,CAAC,IAAI,cAAc,CAAC;QAC9E,IAAI,CAAC,eAAe,CAAC,QAAQ,CAAC,cAAc,CAAC,EAAE,CAAC;YAC5C,oBAAoB,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;QAC9C,CAAC;IACL,CAAC;IAED,2EAA2E;IAC3E,0EAA0E;IAC1E,qEAAqE;IACrE,MAAM,kBAAkB,GAAa,EAAE,CAAC;IACxC,MAAM,kBAAkB,GAAa,EAAE,CAAC;IACxC,KAAK,MAAM,GAAG,IAAI,eAAe,EAAE,CAAC;QAChC,MAAM,cAAc,GAAG,gBAAgB,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACjD,IAAI,cAAc,KAAK,SAAS,EAAE,CAAC;YAC/B,kBAAkB,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAC7B,SAAS;QACb,CAAC;QACD,IAAI,KAAK,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,CAAC;YAAE,SAAS;QACvD,IAAI,iBAAiB,CAAC,GAAG,CAAC,cAAc,CAAC;YAAE,SAAS;QACpD,kBAAkB,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACjC,CAAC;IAED,OAAO,EAAE,oBAAoB,EAAE,kBAAkB,EAAE,kBAAkB,EAAE,CAAC;AAC5E,CAAC;AAED,SAAS,qBAAqB,CAC1B,WAAmB,EACnB,KAAiB,EACjB,WAAmB,EACnB,eAAyB,EACzB,KAAiC,EACjC,gBAAqC,EACrC,gBAAqC;IAErC,MAAM,iBAAiB,GAAG,wBAAwB,CAAC,WAAW,EAAE,KAAK,CAAC,CAAC;IACvE,MAAM,cAAc,GAAG,YAAY,CAC/B,eAAe,EACf,KAAK,EACL,iBAAiB,EACjB,gBAAgB,EAChB,gBAAgB,CACnB,CAAC;IAEF,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,IAAI,cAAc,CAAC,oBAAoB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACjD,MAAM,CAAC,IAAI,CACP,WAAW,WAAW,KAAK,WAAW,2CAA2C,cAAc,CAAC,oBAAoB,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI;YAC/H,+CAA+C,CACtD,CAAC;IACN,CAAC;IACD,KAAK,MAAM,QAAQ,IAAI,cAAc,CAAC,kBAAkB,EAAE,CAAC;QACvD,MAAM,YAAY,GAAG,gBAAgB,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QACpD,MAAM,CAAC,IAAI,CACP,WAAW,WAAW,KAAK,WAAW,uBAAuB,QAAQ,oEAAoE,WAAW,MAAM,YAAY,6BAA6B;YAC/L,sBAAsB,YAAY,mGAAmG,QAAQ,mCAAmC,CACvL,CAAC;IACN,CAAC;IAED,MAAM,KAAK,GACP,cAAc,CAAC,oBAAoB,CAAC,MAAM,KAAK,CAAC;QAChD,cAAc,CAAC,kBAAkB,CAAC,MAAM,KAAK,CAAC,CAAC;IACnD,OAAO;QACH,MAAM,EAAE;YACJ,OAAO,EAAE,WAAW;YACpB,KAAK;YACL,oBAAoB,EAAE,cAAc,CAAC,oBAAoB;YACzD,kBAAkB,EAAE,cAAc,CAAC,kBAAkB;SACxD;QACD,MAAM;KACT,CAAC;AACN,CAAC;AAEM,KAAK,UAAU,+BAA+B,CACjD,KAAiC,EACjC,aAAqB;IAErB,MAAM,YAAY,GAAG,MAAM,IAAA,gCAAuB,GAAE,CAAC;IACrD,MAAM,cAAc,GAAG,IAAA,kDAAyC,EAAC,YAAY,CAAC,CAAC;IAE/E,MAAM,gBAAgB,GAAG,wBAAwB,CAAC,aAAa,EAAE,cAAc,CAAC,CAAC;IACjF,MAAM,gBAAgB,GAAG,IAAI,GAAG,EAAkB,CAAC;IACnD,KAAK,MAAM,CAAC,QAAQ,EAAE,OAAO,CAAC,IAAI,gBAAgB,CAAC,OAAO,EAAE,EAAE,CAAC;QAC3D,gBAAgB,CAAC,GAAG,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;IAC5C,CAAC;IAED,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,MAAM,cAAc,GAA8B,EAAE,CAAC;IAErD,KAAK,MAAM,CAAC,WAAW,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QACvD,MAAM,aAAa,GAAG,cAAc,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC;QAC3D,IAAI,CAAC,aAAa;YAAE,SAAS;QAE7B,MAAM,eAAe,GAAG,mBAAmB,CAAC,aAAa,EAAE,aAAa,CAAC,IAAI,CAAC,CAAC;QAC/E,IAAI,eAAe,KAAK,IAAI;YAAE,SAAS;QAEvC,MAAM,UAAU,GAAG,qBAAqB,CACpC,WAAW,EACX,KAAK,EACL,aAAa,CAAC,IAAI,EAClB,eAAe,EACf,KAAK,EACL,gBAAgB,EAChB,gBAAgB,CACnB,CAAC;QACF,cAAc,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;QACvC,MAAM,CAAC,IAAI,CAAC,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC;IACtC,CAAC;IAED,OAAO,EAAE,KAAK,EAAE,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,MAAM,EAAE,cAAc,EAAE,CAAC;AAClE,CAAC","sourcesContent":["/**\n * Package Validator\n *\n * Validates that package.json dependencies match the project.json build.dependsOn\n * This ensures the two sources of truth don't drift apart.\n */\n\nimport * as fs from 'fs';\nimport * as path from 'path';\nimport {\n    createProjectGraphAsync,\n    readProjectsConfigurationFromProjectGraph,\n} from '@nx/devkit';\nimport { toError } from '../toError';\n\n/**\n * Validation result for a single project\n */\nexport interface ProjectValidationResult {\n    project: string;\n    valid: boolean;\n    missingInPackageJson: string[];\n    extraInPackageJson: string[];\n}\n\n/**\n * Overall validation result\n */\nexport interface ValidationResult {\n    valid: boolean;\n    errors: string[];\n    projectResults: ProjectValidationResult[];\n}\n\n/**\n * Read package.json dependencies for a project\n * Returns null if package.json doesn't exist (apps often don't have one)\n */\nfunction readPackageJsonDeps(workspaceRoot: string, projectRoot: string): string[] | null {\n    const packageJsonPath = path.join(workspaceRoot, projectRoot, 'package.json');\n\n    if (!fs.existsSync(packageJsonPath)) {\n        return null; // No package.json - skip validation for this project\n    }\n\n    // eslint-disable-next-line @webpieces/no-unmanaged-exceptions\n    try {\n        const packageJson = JSON.parse(fs.readFileSync(packageJsonPath, 'utf-8'));\n        const deps: string[] = [];\n\n        // Collect ALL dependencies from package.json\n        for (const depType of ['dependencies', 'peerDependencies']) {\n            const depObj = packageJson[depType] || {};\n            for (const depName of Object.keys(depObj)) {\n                if (!deps.includes(depName)) {\n                    deps.push(depName);\n                }\n            }\n        }\n\n        return deps.sort();\n    } catch (err: unknown) {\n        //const error = toError(err);\n        void err;\n        console.warn(`Could not read package.json at ${packageJsonPath}`);\n        return [];\n    }\n}\n\n/**\n * Build map of project names to their package names\n * e.g., \"core-util\" → \"@webpieces/core-util\"\n */\nfunction buildProjectToPackageMap(\n    workspaceRoot: string,\n    // webpieces-disable no-any-unknown -- Nx devkit projectsConfig type is dynamic and not strongly typed\n    projectsConfig: any\n): Map<string, string> {\n    const map = new Map<string, string>();\n\n    // webpieces-disable no-any-unknown -- Nx devkit projects config entries are untyped\n    for (const [projectName, config] of Object.entries<any>(projectsConfig.projects)) {\n        const packageJsonPath = path.join(workspaceRoot, config.root, 'package.json');\n        if (fs.existsSync(packageJsonPath)) {\n            // eslint-disable-next-line @webpieces/no-unmanaged-exceptions\n            try {\n                const packageJson = JSON.parse(fs.readFileSync(packageJsonPath, 'utf-8'));\n                if (packageJson.name) {\n                    map.set(projectName, packageJson.name);\n                }\n            } catch (err: unknown) {\n                //const error = toError(err);\n                void err;\n                // Ignore parse errors\n            }\n        }\n    }\n\n    return map;\n}\n\n/**\n * Validate that package.json dependencies match the dependency graph\n *\n * For each project in the graph:\n * - Check that all graph dependencies exist in package.json\n * - Maps project names to package names for accurate comparison\n *\n * @param graph - Enhanced graph with project dependencies (uses project names)\n * @param workspaceRoot - Absolute path to workspace root\n * @returns Validation result with errors if any\n */\ninterface GraphEntry {\n    level: number;\n    dependsOn: string[];\n}\n\ninterface DepClassification {\n    missingInPackageJson: string[];\n    extraInPackageJson: string[];\n    extraWorkspaceDeps: string[];\n}\n\n/**\n * Compute the transitive closure of a project's dependencies in the graph.\n * Example: server → [core-meta, http-server]; transitive closure includes\n * http-server and everything http-server reaches (http-routing, http-filters,\n * core-context, core-util, http-api).\n *\n * Used to allow package.json entries for transitive deps (a legitimate pattern:\n * npm install brings the whole dependency tree, so a consumer may list any\n * reachable package directly).\n */\nfunction computeTransitiveClosure(\n    projectName: string,\n    graph: Record<string, GraphEntry>\n): Set<string> {\n    const closure = new Set<string>();\n    const stack = [projectName];\n    while (stack.length > 0) {\n        const current = stack.pop()!;\n        const entry = graph[current];\n        if (!entry) continue;\n        for (const dep of entry.dependsOn) {\n            if (!closure.has(dep)) {\n                closure.add(dep);\n                stack.push(dep);\n            }\n        }\n    }\n    return closure;\n}\n\ninterface SingleProjectValidation {\n    result: ProjectValidationResult;\n    errors: string[];\n}\n\nfunction classifyDeps(\n    packageJsonDeps: string[],\n    entry: GraphEntry,\n    transitiveClosure: Set<string>,\n    projectToPackage: Map<string, string>,\n    packageToProject: Map<string, string>\n): DepClassification {\n    const missingInPackageJson: string[] = [];\n    for (const depProjectName of entry.dependsOn) {\n        const depPackageName = projectToPackage.get(depProjectName) || depProjectName;\n        if (!packageJsonDeps.includes(depPackageName)) {\n            missingInPackageJson.push(depProjectName);\n        }\n    }\n\n    // Workspace extras are OK if reachable via transitive closure (matches the\n    // ESLint enforce-architecture rule which also allows transitive imports).\n    // Only flag extras that are NOT reachable at all — real graph drift.\n    const extraInPackageJson: string[] = [];\n    const extraWorkspaceDeps: string[] = [];\n    for (const dep of packageJsonDeps) {\n        const depProjectName = packageToProject.get(dep);\n        if (depProjectName === undefined) {\n            extraInPackageJson.push(dep);\n            continue;\n        }\n        if (entry.dependsOn.includes(depProjectName)) continue;\n        if (transitiveClosure.has(depProjectName)) continue;\n        extraWorkspaceDeps.push(dep);\n    }\n\n    return { missingInPackageJson, extraInPackageJson, extraWorkspaceDeps };\n}\n\nfunction validateSingleProject(\n    projectName: string,\n    entry: GraphEntry,\n    projectRoot: string,\n    packageJsonDeps: string[],\n    graph: Record<string, GraphEntry>,\n    projectToPackage: Map<string, string>,\n    packageToProject: Map<string, string>\n): SingleProjectValidation {\n    const transitiveClosure = computeTransitiveClosure(projectName, graph);\n    const classification = classifyDeps(\n        packageJsonDeps,\n        entry,\n        transitiveClosure,\n        projectToPackage,\n        packageToProject\n    );\n\n    const errors: string[] = [];\n    if (classification.missingInPackageJson.length > 0) {\n        errors.push(\n            `Project ${projectName} (${projectRoot}/package.json) is missing dependencies: ${classification.missingInPackageJson.join(', ')}\\n` +\n                `  Fix: Add these to package.json dependencies`\n        );\n    }\n    for (const extraPkg of classification.extraWorkspaceDeps) {\n        const extraProject = packageToProject.get(extraPkg);\n        errors.push(\n            `Project ${projectName} (${projectRoot}/package.json) has \"${extraPkg}\" in package.json but architecture/dependencies.json has no path ${projectName} → ${extraProject} (not even transitively).\\n` +\n                `  Fix: Either add \"${extraProject}:build\" to project.json:build.dependsOn (then run \\`nx run architecture:generate\\`), or remove \"${extraPkg}\" from package.json dependencies.`\n        );\n    }\n\n    const valid =\n        classification.missingInPackageJson.length === 0 &&\n        classification.extraWorkspaceDeps.length === 0;\n    return {\n        result: {\n            project: projectName,\n            valid,\n            missingInPackageJson: classification.missingInPackageJson,\n            extraInPackageJson: classification.extraInPackageJson,\n        },\n        errors,\n    };\n}\n\nexport async function validatePackageJsonDependencies(\n    graph: Record<string, GraphEntry>,\n    workspaceRoot: string\n): Promise<ValidationResult> {\n    const projectGraph = await createProjectGraphAsync();\n    const projectsConfig = readProjectsConfigurationFromProjectGraph(projectGraph);\n\n    const projectToPackage = buildProjectToPackageMap(workspaceRoot, projectsConfig);\n    const packageToProject = new Map<string, string>();\n    for (const [projName, pkgName] of projectToPackage.entries()) {\n        packageToProject.set(pkgName, projName);\n    }\n\n    const errors: string[] = [];\n    const projectResults: ProjectValidationResult[] = [];\n\n    for (const [projectName, entry] of Object.entries(graph)) {\n        const projectConfig = projectsConfig.projects[projectName];\n        if (!projectConfig) continue;\n\n        const packageJsonDeps = readPackageJsonDeps(workspaceRoot, projectConfig.root);\n        if (packageJsonDeps === null) continue;\n\n        const validation = validateSingleProject(\n            projectName,\n            entry,\n            projectConfig.root,\n            packageJsonDeps,\n            graph,\n            projectToPackage,\n            packageToProject\n        );\n        projectResults.push(validation.result);\n        errors.push(...validation.errors);\n    }\n\n    return { valid: errors.length === 0, errors, projectResults };\n}\n"]}
+{"version":3,"file":"package-validator.js","sourceRoot":"","sources":["../../../../../../packages/tooling/nx-webpieces-rules/src/lib/package-validator.ts"],"names":[],"mappings":";AAAA;;;;;GAKG;;AA0PH,0EAuCC;;AA/RD,+CAAyB;AACzB,mDAA6B;AAC7B,uCAGoB;AAgCpB;;;GAGG;AACH,SAAS,mBAAmB,CAAC,aAAqB,EAAE,WAAmB;IACnE,MAAM,eAAe,GAAG,IAAI,CAAC,IAAI,CAAC,aAAa,EAAE,WAAW,EAAE,cAAc,CAAC,CAAC;IAE9E,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,eAAe,CAAC,EAAE,CAAC;QAClC,OAAO,IAAI,CAAC,CAAC,qDAAqD;IACtE,CAAC;IAED,8DAA8D;IAC9D,IAAI,CAAC;QACD,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,YAAY,CAAC,eAAe,EAAE,OAAO,CAAC,CAAC,CAAC;QAC1E,MAAM,IAAI,GAAa,EAAE,CAAC;QAE1B,6CAA6C;QAC7C,KAAK,MAAM,OAAO,IAAI,CAAC,cAAc,EAAE,kBAAkB,CAAC,EAAE,CAAC;YACzD,MAAM,MAAM,GAAG,WAAW,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC;YAC1C,KAAK,MAAM,OAAO,IAAI,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;gBACxC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC;oBAC1B,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;gBACvB,CAAC;YACL,CAAC;QACL,CAAC;QAED,OAAO,IAAI,CAAC,IAAI,EAAE,CAAC;IACvB,CAAC;IAAC,OAAO,GAAY,EAAE,CAAC;QACpB,6BAA6B;QAC7B,KAAK,GAAG,CAAC;QACT,OAAO,CAAC,IAAI,CAAC,kCAAkC,eAAe,EAAE,CAAC,CAAC;QAClE,OAAO,EAAE,CAAC;IACd,CAAC;AACL,CAAC;AAED;;;GAGG;AACH,SAAS,wBAAwB,CAC7B,aAAqB;AACrB,sGAAsG;AACtG,cAAmB;IAEnB,MAAM,GAAG,GAAG,IAAI,GAAG,EAAkB,CAAC;IAEtC,oFAAoF;IACpF,KAAK,MAAM,CAAC,WAAW,EAAE,MAAM,CAAC,IAAI,MAAM,CAAC,OAAO,CAAM,cAAc,CAAC,QAAQ,CAAC,EAAE,CAAC;QAC/E,MAAM,eAAe,GAAG,IAAI,CAAC,IAAI,CAAC,aAAa,EAAE,MAAM,CAAC,IAAI,EAAE,cAAc,CAAC,CAAC;QAC9E,IAAI,EAAE,CAAC,UAAU,CAAC,eAAe,CAAC,EAAE,CAAC;YACjC,8DAA8D;YAC9D,IAAI,CAAC;gBACD,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,YAAY,CAAC,eAAe,EAAE,OAAO,CAAC,CAAC,CAAC;gBAC1E,IAAI,WAAW,CAAC,IAAI,EAAE,CAAC;oBACnB,GAAG,CAAC,GAAG,CAAC,WAAW,EAAE,WAAW,CAAC,IAAI,CAAC,CAAC;gBAC3C,CAAC;YACL,CAAC;YAAC,OAAO,GAAY,EAAE,CAAC;gBACpB,6BAA6B;gBAC7B,KAAK,GAAG,CAAC;gBACT,sBAAsB;YAC1B,CAAC;QACL,CAAC;IACL,CAAC;IAED,OAAO,GAAG,CAAC;AACf,CAAC;AAwBD;;;;;;;;;GASG;AACH,SAAS,wBAAwB,CAC7B,WAAmB,EACnB,KAAiC;IAEjC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,KAAK,GAAG,CAAC,WAAW,CAAC,CAAC;IAC5B,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACtB,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;QAC7B,MAAM,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC;QAC7B,IAAI,CAAC,KAAK;YAAE,SAAS;QACrB,KAAK,MAAM,GAAG,IAAI,KAAK,CAAC,SAAS,EAAE,CAAC;YAChC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBACpB,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBACjB,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACpB,CAAC;QACL,CAAC;IACL,CAAC;IACD,OAAO,OAAO,CAAC;AACnB,CAAC;AAQD,SAAS,YAAY,CACjB,eAAyB,EACzB,KAAiB,EACjB,iBAA8B,EAC9B,gBAAqC,EACrC,gBAAqC;IAErC,MAAM,oBAAoB,GAAa,EAAE,CAAC;IAC1C,KAAK,MAAM,cAAc,IAAI,KAAK,CAAC,SAAS,EAAE,CAAC;QAC3C,MAAM,cAAc,GAAG,gBAAgB,CAAC,GAAG,CAAC,cAAc,CAAC,IAAI,cAAc,CAAC;QAC9E,IAAI,CAAC,eAAe,CAAC,QAAQ,CAAC,cAAc,CAAC,EAAE,CAAC;YAC5C,oBAAoB,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;QAC9C,CAAC;IACL,CAAC;IAED,2EAA2E;IAC3E,0EAA0E;IAC1E,qEAAqE;IACrE,MAAM,kBAAkB,GAAa,EAAE,CAAC;IACxC,MAAM,kBAAkB,GAAa,EAAE,CAAC;IACxC,KAAK,MAAM,GAAG,IAAI,eAAe,EAAE,CAAC;QAChC,MAAM,cAAc,GAAG,gBAAgB,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACjD,IAAI,cAAc,KAAK,SAAS,EAAE,CAAC;YAC/B,kBAAkB,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAC7B,SAAS;QACb,CAAC;QACD,IAAI,KAAK,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,CAAC;YAAE,SAAS;QACvD,IAAI,iBAAiB,CAAC,GAAG,CAAC,cAAc,CAAC;YAAE,SAAS;QACpD,kBAAkB,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACjC,CAAC;IAED,OAAO,EAAE,oBAAoB,EAAE,kBAAkB,EAAE,kBAAkB,EAAE,CAAC;AAC5E,CAAC;AAED,SAAS,qBAAqB,CAC1B,WAAmB,EACnB,KAAiB,EACjB,WAAmB,EACnB,eAAyB,EACzB,KAAiC,EACjC,gBAAqC,EACrC,gBAAqC;IAErC,MAAM,iBAAiB,GAAG,wBAAwB,CAAC,WAAW,EAAE,KAAK,CAAC,CAAC;IACvE,MAAM,cAAc,GAAG,YAAY,CAC/B,eAAe,EACf,KAAK,EACL,iBAAiB,EACjB,gBAAgB,EAChB,gBAAgB,CACnB,CAAC;IAEF,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,IAAI,cAAc,CAAC,oBAAoB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACjD,MAAM,CAAC,IAAI,CACP,WAAW,WAAW,KAAK,WAAW,2CAA2C,cAAc,CAAC,oBAAoB,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI;YAC/H,+CAA+C,CACtD,CAAC;IACN,CAAC;IAED,sFAAsF;IACtF,uFAAuF;IACvF,gFAAgF;IAChF,MAAM,QAAQ,GAAa,EAAE,CAAC;IAC9B,KAAK,MAAM,QAAQ,IAAI,cAAc,CAAC,kBAAkB,EAAE,CAAC;QACvD,MAAM,YAAY,GAAG,gBAAgB,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QACpD,QAAQ,CAAC,IAAI,CACT,WAAW,WAAW,KAAK,WAAW,uBAAuB,QAAQ,4CAA4C,WAAW,MAAM,YAAY,KAAK;YAC/I,6GAA6G,CACpH,CAAC;IACN,CAAC;IAED,qFAAqF;IACrF,MAAM,KAAK,GAAG,cAAc,CAAC,oBAAoB,CAAC,MAAM,KAAK,CAAC,CAAC;IAC/D,OAAO;QACH,MAAM,EAAE;YACJ,OAAO,EAAE,WAAW;YACpB,KAAK;YACL,oBAAoB,EAAE,cAAc,CAAC,oBAAoB;YACzD,kBAAkB,EAAE,cAAc,CAAC,kBAAkB;SACxD;QACD,MAAM;QACN,QAAQ;KACX,CAAC;AACN,CAAC;AAEM,KAAK,UAAU,+BAA+B,CACjD,KAAiC,EACjC,aAAqB;IAErB,MAAM,YAAY,GAAG,MAAM,IAAA,gCAAuB,GAAE,CAAC;IACrD,MAAM,cAAc,GAAG,IAAA,kDAAyC,EAAC,YAAY,CAAC,CAAC;IAE/E,MAAM,gBAAgB,GAAG,wBAAwB,CAAC,aAAa,EAAE,cAAc,CAAC,CAAC;IACjF,MAAM,gBAAgB,GAAG,IAAI,GAAG,EAAkB,CAAC;IACnD,KAAK,MAAM,CAAC,QAAQ,EAAE,OAAO,CAAC,IAAI,gBAAgB,CAAC,OAAO,EAAE,EAAE,CAAC;QAC3D,gBAAgB,CAAC,GAAG,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;IAC5C,CAAC;IAED,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,MAAM,QAAQ,GAAa,EAAE,CAAC;IAC9B,MAAM,cAAc,GAA8B,EAAE,CAAC;IAErD,KAAK,MAAM,CAAC,WAAW,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QACvD,MAAM,aAAa,GAAG,cAAc,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC;QAC3D,IAAI,CAAC,aAAa;YAAE,SAAS;QAE7B,MAAM,eAAe,GAAG,mBAAmB,CAAC,aAAa,EAAE,aAAa,CAAC,IAAI,CAAC,CAAC;QAC/E,IAAI,eAAe,KAAK,IAAI;YAAE,SAAS;QAEvC,MAAM,UAAU,GAAG,qBAAqB,CACpC,WAAW,EACX,KAAK,EACL,aAAa,CAAC,IAAI,EAClB,eAAe,EACf,KAAK,EACL,gBAAgB,EAChB,gBAAgB,CACnB,CAAC;QACF,cAAc,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;QACvC,MAAM,CAAC,IAAI,CAAC,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC;QAClC,QAAQ,CAAC,IAAI,CAAC,GAAG,UAAU,CAAC,QAAQ,CAAC,CAAC;IAC1C,CAAC;IAED,OAAO,EAAE,KAAK,EAAE,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,MAAM,EAAE,QAAQ,EAAE,cAAc,EAAE,CAAC;AAC5E,CAAC","sourcesContent":["/**\n * Package Validator\n *\n * Validates that package.json dependencies match the project.json build.dependsOn\n * This ensures the two sources of truth don't drift apart.\n */\n\nimport * as fs from 'fs';\nimport * as path from 'path';\nimport {\n    createProjectGraphAsync,\n    readProjectsConfigurationFromProjectGraph,\n} from '@nx/devkit';\nimport { toError } from '../toError';\n\n/**\n * Validation result for a single project\n */\nexport interface ProjectValidationResult {\n    project: string;\n    valid: boolean;\n    missingInPackageJson: string[];\n    extraInPackageJson: string[];\n}\n\n/**\n * Overall validation result\n *\n * `errors` fail the build; their only fix is ADDITIVE (\"add to package.json\"), so they can\n * never push a user toward removing a runtime-required dependency.\n *\n * `warnings` never fail the build. Workspace deps in package.json that the architecture graph\n * can't reach are reported here, NOT as errors: a transitively-reachable or even unreachable\n * entry can still be a real runtime dependency (e.g. a peerDependency or a generated client\n * that nx's import analysis doesn't traverse). Erroring on these is the \"runtime-validity trap\"\n * that previously forced a bad package.json edit — so we only warn.\n */\nexport interface ValidationResult {\n    valid: boolean;\n    errors: string[];\n    warnings: string[];\n    projectResults: ProjectValidationResult[];\n}\n\n/**\n * Read package.json dependencies for a project\n * Returns null if package.json doesn't exist (apps often don't have one)\n */\nfunction readPackageJsonDeps(workspaceRoot: string, projectRoot: string): string[] | null {\n    const packageJsonPath = path.join(workspaceRoot, projectRoot, 'package.json');\n\n    if (!fs.existsSync(packageJsonPath)) {\n        return null; // No package.json - skip validation for this project\n    }\n\n    // eslint-disable-next-line @webpieces/no-unmanaged-exceptions\n    try {\n        const packageJson = JSON.parse(fs.readFileSync(packageJsonPath, 'utf-8'));\n        const deps: string[] = [];\n\n        // Collect ALL dependencies from package.json\n        for (const depType of ['dependencies', 'peerDependencies']) {\n            const depObj = packageJson[depType] || {};\n            for (const depName of Object.keys(depObj)) {\n                if (!deps.includes(depName)) {\n                    deps.push(depName);\n                }\n            }\n        }\n\n        return deps.sort();\n    } catch (err: unknown) {\n        //const error = toError(err);\n        void err;\n        console.warn(`Could not read package.json at ${packageJsonPath}`);\n        return [];\n    }\n}\n\n/**\n * Build map of project names to their package names\n * e.g., \"core-util\" → \"@webpieces/core-util\"\n */\nfunction buildProjectToPackageMap(\n    workspaceRoot: string,\n    // webpieces-disable no-any-unknown -- Nx devkit projectsConfig type is dynamic and not strongly typed\n    projectsConfig: any\n): Map<string, string> {\n    const map = new Map<string, string>();\n\n    // webpieces-disable no-any-unknown -- Nx devkit projects config entries are untyped\n    for (const [projectName, config] of Object.entries<any>(projectsConfig.projects)) {\n        const packageJsonPath = path.join(workspaceRoot, config.root, 'package.json');\n        if (fs.existsSync(packageJsonPath)) {\n            // eslint-disable-next-line @webpieces/no-unmanaged-exceptions\n            try {\n                const packageJson = JSON.parse(fs.readFileSync(packageJsonPath, 'utf-8'));\n                if (packageJson.name) {\n                    map.set(projectName, packageJson.name);\n                }\n            } catch (err: unknown) {\n                //const error = toError(err);\n                void err;\n                // Ignore parse errors\n            }\n        }\n    }\n\n    return map;\n}\n\n/**\n * Validate that package.json dependencies match the dependency graph\n *\n * For each project in the graph:\n * - Check that all graph dependencies exist in package.json\n * - Maps project names to package names for accurate comparison\n *\n * @param graph - Enhanced graph with project dependencies (uses project names)\n * @param workspaceRoot - Absolute path to workspace root\n * @returns Validation result with errors if any\n */\ninterface GraphEntry {\n    level: number;\n    dependsOn: string[];\n}\n\ninterface DepClassification {\n    missingInPackageJson: string[];\n    extraInPackageJson: string[];\n    extraWorkspaceDeps: string[];\n}\n\n/**\n * Compute the transitive closure of a project's dependencies in the graph.\n * Example: server → [core-meta, http-server]; transitive closure includes\n * http-server and everything http-server reaches (http-routing, http-filters,\n * core-context, core-util, http-api).\n *\n * Used to allow package.json entries for transitive deps (a legitimate pattern:\n * npm install brings the whole dependency tree, so a consumer may list any\n * reachable package directly).\n */\nfunction computeTransitiveClosure(\n    projectName: string,\n    graph: Record<string, GraphEntry>\n): Set<string> {\n    const closure = new Set<string>();\n    const stack = [projectName];\n    while (stack.length > 0) {\n        const current = stack.pop()!;\n        const entry = graph[current];\n        if (!entry) continue;\n        for (const dep of entry.dependsOn) {\n            if (!closure.has(dep)) {\n                closure.add(dep);\n                stack.push(dep);\n            }\n        }\n    }\n    return closure;\n}\n\ninterface SingleProjectValidation {\n    result: ProjectValidationResult;\n    errors: string[];\n    warnings: string[];\n}\n\nfunction classifyDeps(\n    packageJsonDeps: string[],\n    entry: GraphEntry,\n    transitiveClosure: Set<string>,\n    projectToPackage: Map<string, string>,\n    packageToProject: Map<string, string>\n): DepClassification {\n    const missingInPackageJson: string[] = [];\n    for (const depProjectName of entry.dependsOn) {\n        const depPackageName = projectToPackage.get(depProjectName) || depProjectName;\n        if (!packageJsonDeps.includes(depPackageName)) {\n            missingInPackageJson.push(depProjectName);\n        }\n    }\n\n    // Workspace extras are OK if reachable via transitive closure (matches the\n    // ESLint enforce-architecture rule which also allows transitive imports).\n    // Only flag extras that are NOT reachable at all — real graph drift.\n    const extraInPackageJson: string[] = [];\n    const extraWorkspaceDeps: string[] = [];\n    for (const dep of packageJsonDeps) {\n        const depProjectName = packageToProject.get(dep);\n        if (depProjectName === undefined) {\n            extraInPackageJson.push(dep);\n            continue;\n        }\n        if (entry.dependsOn.includes(depProjectName)) continue;\n        if (transitiveClosure.has(depProjectName)) continue;\n        extraWorkspaceDeps.push(dep);\n    }\n\n    return { missingInPackageJson, extraInPackageJson, extraWorkspaceDeps };\n}\n\nfunction validateSingleProject(\n    projectName: string,\n    entry: GraphEntry,\n    projectRoot: string,\n    packageJsonDeps: string[],\n    graph: Record<string, GraphEntry>,\n    projectToPackage: Map<string, string>,\n    packageToProject: Map<string, string>\n): SingleProjectValidation {\n    const transitiveClosure = computeTransitiveClosure(projectName, graph);\n    const classification = classifyDeps(\n        packageJsonDeps,\n        entry,\n        transitiveClosure,\n        projectToPackage,\n        packageToProject\n    );\n\n    const errors: string[] = [];\n    if (classification.missingInPackageJson.length > 0) {\n        errors.push(\n            `Project ${projectName} (${projectRoot}/package.json) is missing dependencies: ${classification.missingInPackageJson.join(', ')}\\n` +\n                `  Fix: Add these to package.json dependencies`\n        );\n    }\n\n    // Unreachable workspace extras are WARN-ONLY: they may be real runtime deps that nx's\n    // import analysis can't see (peerDependency / generated client). Never error — that is\n    // the runtime-validity trap. We surface them so genuine drift is still visible.\n    const warnings: string[] = [];\n    for (const extraPkg of classification.extraWorkspaceDeps) {\n        const extraProject = packageToProject.get(extraPkg);\n        warnings.push(\n            `Project ${projectName} (${projectRoot}/package.json) has \"${extraPkg}\" but the architecture graph has no path ${projectName} → ${extraProject}.\\n` +\n                `  This is allowed (it may be a runtime-only/peer dependency). If it is genuinely unused, you may remove it.`\n        );\n    }\n\n    // extraWorkspaceDeps do NOT affect validity — only missing (additive-fix) errors do.\n    const valid = classification.missingInPackageJson.length === 0;\n    return {\n        result: {\n            project: projectName,\n            valid,\n            missingInPackageJson: classification.missingInPackageJson,\n            extraInPackageJson: classification.extraInPackageJson,\n        },\n        errors,\n        warnings,\n    };\n}\n\nexport async function validatePackageJsonDependencies(\n    graph: Record<string, GraphEntry>,\n    workspaceRoot: string\n): Promise<ValidationResult> {\n    const projectGraph = await createProjectGraphAsync();\n    const projectsConfig = readProjectsConfigurationFromProjectGraph(projectGraph);\n\n    const projectToPackage = buildProjectToPackageMap(workspaceRoot, projectsConfig);\n    const packageToProject = new Map<string, string>();\n    for (const [projName, pkgName] of projectToPackage.entries()) {\n        packageToProject.set(pkgName, projName);\n    }\n\n    const errors: string[] = [];\n    const warnings: string[] = [];\n    const projectResults: ProjectValidationResult[] = [];\n\n    for (const [projectName, entry] of Object.entries(graph)) {\n        const projectConfig = projectsConfig.projects[projectName];\n        if (!projectConfig) continue;\n\n        const packageJsonDeps = readPackageJsonDeps(workspaceRoot, projectConfig.root);\n        if (packageJsonDeps === null) continue;\n\n        const validation = validateSingleProject(\n            projectName,\n            entry,\n            projectConfig.root,\n            packageJsonDeps,\n            graph,\n            projectToPackage,\n            packageToProject\n        );\n        projectResults.push(validation.result);\n        errors.push(...validation.errors);\n        warnings.push(...validation.warnings);\n    }\n\n    return { valid: errors.length === 0, errors, warnings, projectResults };\n}\n"]}

package/src/lib/transitive-reduction.d.ts

@@ -0,0 +1,25 @@
+/**
+ * Transitive Reduction
+ *
+ * Computes the transitive reduction of a DAG: the minimal set of edges that
+ * preserves the exact same reachability (transitive closure) as the input graph.
+ *
+ * For a DAG the transitive reduction is unique. An edge u → v is redundant when v
+ * is reachable from u through some OTHER direct child w of u (w ≠ v). Removing all
+ * redundant edges yields the reduced graph.
+ *
+ * This is purely a VIEW transformation for architecture/dependencies.json — it must
+ * never feed back into package.json or build order. Build order continues to follow
+ * nx's full project graph (via `^build`); reduction preserves reachability, so any
+ * topological order valid for the full graph is also valid for the reduced graph.
+ *
+ * The input MUST be acyclic. Reduction is undefined on cycles; callers run the
+ * cycle-detecting topological sort (graph-sorter) which throws on cycles first.
+ */
+/**
+ * Compute the transitive reduction of a DAG.
+ *
+ * @param graph - Full DAG as { project: [directChildren] }
+ * @returns Reduced graph { project: [minimalDirectChildren] } (children sorted)
+ */
+export declare function transitiveReduction(graph: Record<string, string[]>): Record<string, string[]>;

package/src/lib/transitive-reduction.js

@@ -0,0 +1,56 @@
+"use strict";
+/**
+ * Transitive Reduction
+ *
+ * Computes the transitive reduction of a DAG: the minimal set of edges that
+ * preserves the exact same reachability (transitive closure) as the input graph.
+ *
+ * For a DAG the transitive reduction is unique. An edge u → v is redundant when v
+ * is reachable from u through some OTHER direct child w of u (w ≠ v). Removing all
+ * redundant edges yields the reduced graph.
+ *
+ * This is purely a VIEW transformation for architecture/dependencies.json — it must
+ * never feed back into package.json or build order. Build order continues to follow
+ * nx's full project graph (via `^build`); reduction preserves reachability, so any
+ * topological order valid for the full graph is also valid for the reduced graph.
+ *
+ * The input MUST be acyclic. Reduction is undefined on cycles; callers run the
+ * cycle-detecting topological sort (graph-sorter) which throws on cycles first.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.transitiveReduction = transitiveReduction;
+/**
+ * Compute the transitive reduction of a DAG.
+ *
+ * @param graph - Full DAG as { project: [directChildren] }
+ * @returns Reduced graph { project: [minimalDirectChildren] } (children sorted)
+ */
+function transitiveReduction(graph) {
+    // Memoized reachability (transitive closure) per node.
+    const closure = new Map();
+    function reach(node) {
+        const cached = closure.get(node);
+        if (cached)
+            return cached;
+        const acc = new Set();
+        // Set before recursion: safe for a DAG, and guards against runaway recursion
+        // if the input is unexpectedly cyclic (closure stays finite).
+        closure.set(node, acc);
+        for (const child of graph[node] ?? []) {
+            acc.add(child);
+            for (const reachable of reach(child)) {
+                acc.add(reachable);
+            }
+        }
+        return acc;
+    }
+    const reduced = {};
+    for (const u of Object.keys(graph)) {
+        const children = graph[u] ?? [];
+        // Keep u → v only if NO sibling w (w ≠ v) already reaches v.
+        const kept = children.filter((v) => !children.some((w) => w !== v && reach(w).has(v)));
+        reduced[u] = kept.sort();
+    }
+    return reduced;
+}
+//# sourceMappingURL=transitive-reduction.js.map

package/src/lib/transitive-reduction.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"transitive-reduction.js","sourceRoot":"","sources":["../../../../../../packages/tooling/nx-webpieces-rules/src/lib/transitive-reduction.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;GAiBG;;AAQH,kDAiCC;AAvCD;;;;;GAKG;AACH,SAAgB,mBAAmB,CAC/B,KAA+B;IAE/B,uDAAuD;IACvD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAuB,CAAC;IAE/C,SAAS,KAAK,CAAC,IAAY;QACvB,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACjC,IAAI,MAAM;YAAE,OAAO,MAAM,CAAC;QAE1B,MAAM,GAAG,GAAG,IAAI,GAAG,EAAU,CAAC;QAC9B,6EAA6E;QAC7E,8DAA8D;QAC9D,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QACvB,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;YACpC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YACf,KAAK,MAAM,SAAS,IAAI,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC;gBACnC,GAAG,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;YACvB,CAAC;QACL,CAAC;QACD,OAAO,GAAG,CAAC;IACf,CAAC;IAED,MAAM,OAAO,GAA6B,EAAE,CAAC;IAC7C,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QACjC,MAAM,QAAQ,GAAG,KAAK,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QAChC,6DAA6D;QAC7D,MAAM,IAAI,GAAG,QAAQ,CAAC,MAAM,CACxB,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAC3D,CAAC;QACF,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;IAC7B,CAAC;IACD,OAAO,OAAO,CAAC;AACnB,CAAC","sourcesContent":["/**\n * Transitive Reduction\n *\n * Computes the transitive reduction of a DAG: the minimal set of edges that\n * preserves the exact same reachability (transitive closure) as the input graph.\n *\n * For a DAG the transitive reduction is unique. An edge u → v is redundant when v\n * is reachable from u through some OTHER direct child w of u (w ≠ v). Removing all\n * redundant edges yields the reduced graph.\n *\n * This is purely a VIEW transformation for architecture/dependencies.json — it must\n * never feed back into package.json or build order. Build order continues to follow\n * nx's full project graph (via `^build`); reduction preserves reachability, so any\n * topological order valid for the full graph is also valid for the reduced graph.\n *\n * The input MUST be acyclic. Reduction is undefined on cycles; callers run the\n * cycle-detecting topological sort (graph-sorter) which throws on cycles first.\n */\n\n/**\n * Compute the transitive reduction of a DAG.\n *\n * @param graph - Full DAG as { project: [directChildren] }\n * @returns Reduced graph { project: [minimalDirectChildren] } (children sorted)\n */\nexport function transitiveReduction(\n    graph: Record<string, string[]>\n): Record<string, string[]> {\n    // Memoized reachability (transitive closure) per node.\n    const closure = new Map<string, Set<string>>();\n\n    function reach(node: string): Set<string> {\n        const cached = closure.get(node);\n        if (cached) return cached;\n\n        const acc = new Set<string>();\n        // Set before recursion: safe for a DAG, and guards against runaway recursion\n        // if the input is unexpectedly cyclic (closure stays finite).\n        closure.set(node, acc);\n        for (const child of graph[node] ?? []) {\n            acc.add(child);\n            for (const reachable of reach(child)) {\n                acc.add(reachable);\n            }\n        }\n        return acc;\n    }\n\n    const reduced: Record<string, string[]> = {};\n    for (const u of Object.keys(graph)) {\n        const children = graph[u] ?? [];\n        // Keep u → v only if NO sibling w (w ≠ v) already reaches v.\n        const kept = children.filter(\n            (v) => !children.some((w) => w !== v && reach(w).has(v))\n        );\n        reduced[u] = kept.sort();\n    }\n    return reduced;\n}\n"]}

package/src/plugin.d.ts

@@ -37,6 +37,7 @@ export interface ValidationOptions {
     validateModifiedFiles?: boolean;
     validateVersionsLocked?: boolean;
     validateTsInSrc?: boolean;
+    validateNxWiring?: boolean;
     newMethodsMaxLines?: number;
     modifiedAndNewMethodsMaxLines?: number;
     modifiedFilesMaxLines?: number;

package/src/plugin.js

@@ -32,7 +32,10 @@ const DEFAULT_OPTIONS = {
         graphPath: 'architecture/dependencies.json',
         validations: {
             noCycles: true,
-            noSkipLevelDeps: true,
+            // Retired: the architecture graph is now auto-reduced in `generate`, so the
+            // committed graph can never contain a skip-level edge. Defaults off; the
+            // executor is a no-op kept for one release. See validate-no-skiplevel-deps.
+            noSkipLevelDeps: false,
             architectureUnchanged: true,
             validatePackageJson: true,
             validateNewMethods: true,
@@ -40,6 +43,7 @@ const DEFAULT_OPTIONS = {
             validateModifiedFiles: true,
             validateVersionsLocked: true,
             validateTsInSrc: true,
+            validateNxWiring: true,
             newMethodsMaxLines: 30,
             modifiedAndNewMethodsMaxLines: 80,
             modifiedFilesMaxLines: 900,
@@ -184,6 +188,8 @@ function buildValidationTargetsList(validations) {
         targets.push('validate-versions-locked');
     if (validations.validateTsInSrc)
         targets.push('validate-ts-in-src');
+    if (validations.validateNxWiring)
+        targets.push('validate-nx-wiring');
     return targets;
 }
 /**
@@ -228,6 +234,9 @@ function createWorkspaceTargetsWithoutPrefix(opts) {
     if (validations.validateTsInSrc) {
         targets['validate-ts-in-src'] = createValidateTsInSrcTarget();
     }
+    if (validations.validateNxWiring) {
+        targets['validate-nx-wiring'] = createValidateNxWiringTarget();
+    }
     // Add validate-complete target that runs all enabled validations
     const validationTargets = buildValidationTargetsList(validations);
     if (validationTargets.length > 0) {
@@ -428,6 +437,17 @@ function createValidateTsInSrcTarget() {
         },
     };
 }
+function createValidateNxWiringTarget() {
+    return {
+        executor: '@webpieces/nx-webpieces-rules:validate-nx-wiring',
+        cache: false, // Cheap; depends on nx.json + project graph, not worth caching
+        inputs: ['{workspaceRoot}/nx.json', '{workspaceRoot}/webpieces.config.json'],
+        metadata: {
+            technologies: ['nx'],
+            description: 'Validate the webpieces validators are wired into the build via nx.json dependsOn',
+        },
+    };
+}
 function createValidateCompleteTarget(validationTargets) {
     return {
         executor: 'nx:noop',