@webpieces/nx-webpieces-rules 0.0.1 → 0.2.114

package/src/lib/{graph-comparator.ts → graph-comparator.js}

@@ -1,35 +1,12 @@
+"use strict";
 /**
  * Graph Comparator
  *
  * Compares the current generated graph with the saved (blessed) graph.
  * Used in validate mode to ensure developers have updated the graph file.
  */
-
-import type { EnhancedGraph } from './graph-sorter';
-
-/**
- * Difference between two graphs
- */
-export interface GraphDiff {
-    added: string[];
-    removed: string[];
-    modified: {
-        project: string;
-        addedDeps: string[];
-        removedDeps: string[];
-        levelChanged: { from: number; to: number } | null;
-    }[];
-}
-
-/**
- * Comparison result
- */
-export interface ComparisonResult {
-    identical: boolean;
-    diff: GraphDiff;
-    summary: string;
-}
-
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.compareGraphs = compareGraphs;
 /**
  * Compare two graphs and return the differences
  *
@@ -37,81 +14,59 @@ export interface ComparisonResult {
  * @param saved - Previously saved (blessed) graph
  * @returns Comparison result with detailed diff
  */
-export function compareGraphs(current: EnhancedGraph, saved: EnhancedGraph): ComparisonResult {
+function compareGraphs(current, saved) {
     const currentProjects = new Set(Object.keys(current));
     const savedProjects = new Set(Object.keys(saved));
-
-    const diff: GraphDiff = {
+    const diff = {
         added: [],
         removed: [],
         modified: [],
     };
-
     // Find added projects
     for (const project of currentProjects) {
         if (!savedProjects.has(project)) {
             diff.added.push(project);
         }
     }
-
     // Find removed projects
     for (const project of savedProjects) {
         if (!currentProjects.has(project)) {
             diff.removed.push(project);
         }
     }
-
     // Find modified projects
     findModifiedProjects(current, saved, currentProjects, savedProjects, diff);
-
-    const identical =
-        diff.added.length === 0 && diff.removed.length === 0 && diff.modified.length === 0;
-
+    const identical = diff.added.length === 0 && diff.removed.length === 0 && diff.modified.length === 0;
     const summary = identical ? 'Graphs are identical' : buildSummary(diff);
-
     return {
         identical,
         diff,
         summary,
     };
 }
-
-function findModifiedProjects(
-    current: EnhancedGraph,
-    saved: EnhancedGraph,
-    currentProjects: Set<string>,
-    savedProjects: Set<string>,
-    diff: GraphDiff
-): void {
+function findModifiedProjects(current, saved, currentProjects, savedProjects, diff) {
     for (const project of currentProjects) {
-        if (!savedProjects.has(project)) continue;
-
+        if (!savedProjects.has(project))
+            continue;
         const currentEntry = current[project];
         const savedEntry = saved[project];
-
         const currentDeps = new Set(currentEntry.dependsOn);
         const savedDeps = new Set(savedEntry.dependsOn);
-
-        const addedDeps: string[] = [];
-        const removedDeps: string[] = [];
-
+        const addedDeps = [];
+        const removedDeps = [];
         for (const dep of currentDeps) {
             if (!savedDeps.has(dep)) {
                 addedDeps.push(dep);
             }
         }
-
         for (const dep of savedDeps) {
             if (!currentDeps.has(dep)) {
                 removedDeps.push(dep);
             }
         }
-
-        const levelChanged =
-            currentEntry.level !== savedEntry.level
-                ? { from: savedEntry.level, to: currentEntry.level }
-                : null;
-
+        const levelChanged = currentEntry.level !== savedEntry.level
+            ? { from: savedEntry.level, to: currentEntry.level }
+            : null;
         if (addedDeps.length > 0 || removedDeps.length > 0 || levelChanged) {
             diff.modified.push({
                 project,
@@ -122,20 +77,16 @@ function findModifiedProjects(
         }
     }
 }
-
-function buildSummary(diff: GraphDiff): string {
-    const summaryParts: string[] = [];
-
+function buildSummary(diff) {
+    const summaryParts = [];
     if (diff.added.length > 0) {
         summaryParts.push(`Added projects: ${diff.added.join(', ')}`);
     }
-
     if (diff.removed.length > 0) {
         summaryParts.push(`Removed projects: ${diff.removed.join(', ')}`);
     }
-
     for (const mod of diff.modified) {
-        const parts: string[] = [];
+        const parts = [];
         if (mod.addedDeps.length > 0) {
             parts.push(`+deps: ${mod.addedDeps.join(', ')}`);
         }
@@ -149,6 +100,6 @@ function buildSummary(diff: GraphDiff): string {
             summaryParts.push(`${mod.project}: ${parts.join('; ')}`);
         }
     }
-
     return summaryParts.join('\n');
 }
+//# sourceMappingURL=graph-comparator.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"graph-comparator.js","sourceRoot":"","sources":["../../../../../../packages/tooling/nx-webpieces-rules/src/lib/graph-comparator.ts"],"names":[],"mappings":";AAAA;;;;;GAKG;;AAkCH,sCAqCC;AA5CD;;;;;;GAMG;AACH,SAAgB,aAAa,CAAC,OAAsB,EAAE,KAAoB;IACtE,MAAM,eAAe,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;IACtD,MAAM,aAAa,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;IAElD,MAAM,IAAI,GAAc;QACpB,KAAK,EAAE,EAAE;QACT,OAAO,EAAE,EAAE;QACX,QAAQ,EAAE,EAAE;KACf,CAAC;IAEF,sBAAsB;IACtB,KAAK,MAAM,OAAO,IAAI,eAAe,EAAE,CAAC;QACpC,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;YAC9B,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC7B,CAAC;IACL,CAAC;IAED,wBAAwB;IACxB,KAAK,MAAM,OAAO,IAAI,aAAa,EAAE,CAAC;QAClC,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;YAChC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC/B,CAAC;IACL,CAAC;IAED,yBAAyB;IACzB,oBAAoB,CAAC,OAAO,EAAE,KAAK,EAAE,eAAe,EAAE,aAAa,EAAE,IAAI,CAAC,CAAC;IAE3E,MAAM,SAAS,GACX,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC,CAAC;IAEvF,MAAM,OAAO,GAAG,SAAS,CAAC,CAAC,CAAC,sBAAsB,CAAC,CAAC,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;IAExE,OAAO;QACH,SAAS;QACT,IAAI;QACJ,OAAO;KACV,CAAC;AACN,CAAC;AAED,SAAS,oBAAoB,CACzB,OAAsB,EACtB,KAAoB,EACpB,eAA4B,EAC5B,aAA0B,EAC1B,IAAe;IAEf,KAAK,MAAM,OAAO,IAAI,eAAe,EAAE,CAAC;QACpC,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,OAAO,CAAC;YAAE,SAAS;QAE1C,MAAM,YAAY,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC;QACtC,MAAM,UAAU,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC;QAElC,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC;QACpD,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC;QAEhD,MAAM,SAAS,GAAa,EAAE,CAAC;QAC/B,MAAM,WAAW,GAAa,EAAE,CAAC;QAEjC,KAAK,MAAM,GAAG,IAAI,WAAW,EAAE,CAAC;YAC5B,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBACtB,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACxB,CAAC;QACL,CAAC;QAED,KAAK,MAAM,GAAG,IAAI,SAAS,EAAE,CAAC;YAC1B,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBACxB,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAC1B,CAAC;QACL,CAAC;QAED,MAAM,YAAY,GACd,YAAY,CAAC,KAAK,KAAK,UAAU,CAAC,KAAK;YACnC,CAAC,CAAC,EAAE,IAAI,EAAE,UAAU,CAAC,KAAK,EAAE,EAAE,EAAE,YAAY,CAAC,KAAK,EAAE;YACpD,CAAC,CAAC,IAAI,CAAC;QAEf,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC,IAAI,YAAY,EAAE,CAAC;YACjE,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC;gBACf,OAAO;gBACP,SAAS;gBACT,WAAW;gBACX,YAAY;aACf,CAAC,CAAC;QACP,CAAC;IACL,CAAC;AACL,CAAC;AAED,SAAS,YAAY,CAAC,IAAe;IACjC,MAAM,YAAY,GAAa,EAAE,CAAC;IAElC,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,YAAY,CAAC,IAAI,CAAC,mBAAmB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAClE,CAAC;IAED,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC1B,YAAY,CAAC,IAAI,CAAC,qBAAqB,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACtE,CAAC;IAED,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;QAC9B,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,IAAI,GAAG,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC3B,KAAK,CAAC,IAAI,CAAC,UAAU,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACrD,CAAC;QACD,IAAI,GAAG,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC7B,KAAK,CAAC,IAAI,CAAC,UAAU,GAAG,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACvD,CAAC;QACD,IAAI,GAAG,CAAC,YAAY,EAAE,CAAC;YACnB,KAAK,CAAC,IAAI,CAAC,UAAU,GAAG,CAAC,YAAY,CAAC,IAAI,OAAO,GAAG,CAAC,YAAY,CAAC,EAAE,EAAE,CAAC,CAAC;QAC5E,CAAC;QACD,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACnB,YAAY,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,OAAO,KAAK,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC7D,CAAC;IACL,CAAC;IAED,OAAO,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AACnC,CAAC","sourcesContent":["/**\n * Graph Comparator\n *\n * Compares the current generated graph with the saved (blessed) graph.\n * Used in validate mode to ensure developers have updated the graph file.\n */\n\nimport type { EnhancedGraph } from './graph-sorter';\n\n/**\n * Difference between two graphs\n */\nexport interface GraphDiff {\n    added: string[];\n    removed: string[];\n    modified: {\n        project: string;\n        addedDeps: string[];\n        removedDeps: string[];\n        levelChanged: { from: number; to: number } | null;\n    }[];\n}\n\n/**\n * Comparison result\n */\nexport interface ComparisonResult {\n    identical: boolean;\n    diff: GraphDiff;\n    summary: string;\n}\n\n/**\n * Compare two graphs and return the differences\n *\n * @param current - Currently generated graph\n * @param saved - Previously saved (blessed) graph\n * @returns Comparison result with detailed diff\n */\nexport function compareGraphs(current: EnhancedGraph, saved: EnhancedGraph): ComparisonResult {\n    const currentProjects = new Set(Object.keys(current));\n    const savedProjects = new Set(Object.keys(saved));\n\n    const diff: GraphDiff = {\n        added: [],\n        removed: [],\n        modified: [],\n    };\n\n    // Find added projects\n    for (const project of currentProjects) {\n        if (!savedProjects.has(project)) {\n            diff.added.push(project);\n        }\n    }\n\n    // Find removed projects\n    for (const project of savedProjects) {\n        if (!currentProjects.has(project)) {\n            diff.removed.push(project);\n        }\n    }\n\n    // Find modified projects\n    findModifiedProjects(current, saved, currentProjects, savedProjects, diff);\n\n    const identical =\n        diff.added.length === 0 && diff.removed.length === 0 && diff.modified.length === 0;\n\n    const summary = identical ? 'Graphs are identical' : buildSummary(diff);\n\n    return {\n        identical,\n        diff,\n        summary,\n    };\n}\n\nfunction findModifiedProjects(\n    current: EnhancedGraph,\n    saved: EnhancedGraph,\n    currentProjects: Set<string>,\n    savedProjects: Set<string>,\n    diff: GraphDiff\n): void {\n    for (const project of currentProjects) {\n        if (!savedProjects.has(project)) continue;\n\n        const currentEntry = current[project];\n        const savedEntry = saved[project];\n\n        const currentDeps = new Set(currentEntry.dependsOn);\n        const savedDeps = new Set(savedEntry.dependsOn);\n\n        const addedDeps: string[] = [];\n        const removedDeps: string[] = [];\n\n        for (const dep of currentDeps) {\n            if (!savedDeps.has(dep)) {\n                addedDeps.push(dep);\n            }\n        }\n\n        for (const dep of savedDeps) {\n            if (!currentDeps.has(dep)) {\n                removedDeps.push(dep);\n            }\n        }\n\n        const levelChanged =\n            currentEntry.level !== savedEntry.level\n                ? { from: savedEntry.level, to: currentEntry.level }\n                : null;\n\n        if (addedDeps.length > 0 || removedDeps.length > 0 || levelChanged) {\n            diff.modified.push({\n                project,\n                addedDeps,\n                removedDeps,\n                levelChanged,\n            });\n        }\n    }\n}\n\nfunction buildSummary(diff: GraphDiff): string {\n    const summaryParts: string[] = [];\n\n    if (diff.added.length > 0) {\n        summaryParts.push(`Added projects: ${diff.added.join(', ')}`);\n    }\n\n    if (diff.removed.length > 0) {\n        summaryParts.push(`Removed projects: ${diff.removed.join(', ')}`);\n    }\n\n    for (const mod of diff.modified) {\n        const parts: string[] = [];\n        if (mod.addedDeps.length > 0) {\n            parts.push(`+deps: ${mod.addedDeps.join(', ')}`);\n        }\n        if (mod.removedDeps.length > 0) {\n            parts.push(`-deps: ${mod.removedDeps.join(', ')}`);\n        }\n        if (mod.levelChanged) {\n            parts.push(`level: ${mod.levelChanged.from} -> ${mod.levelChanged.to}`);\n        }\n        if (parts.length > 0) {\n            summaryParts.push(`${mod.project}: ${parts.join('; ')}`);\n        }\n    }\n\n    return summaryParts.join('\\n');\n}\n"]}

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

@@ -0,0 +1,19 @@
+/**
+ * Graph Generator
+ *
+ * Generates dependency graph from project.json files in the workspace.
+ * Reads build.dependsOn and implicitDependencies to determine project relationships.
+ */
+/**
+ * Generate raw dependency graph from project.json files
+ * Returns: { projectName: [dependencyNames] }
+ */
+export declare function generateRawGraph(): Promise<Record<string, string[]>>;
+/**
+ * Transform project names (sorting dependencies only - no scope transformation)
+ */
+export declare function transformGraph(rawGraph: Record<string, string[]>): Record<string, string[]>;
+/**
+ * Generate complete dependency graph with transformations
+ */
+export declare function generateGraph(): Promise<Record<string, string[]>>;

package/src/lib/{graph-generator.ts → graph-generator.js}

@@ -1,27 +1,24 @@
+"use strict";
 /**
  * Graph Generator
  *
  * Generates dependency graph from project.json files in the workspace.
  * Reads build.dependsOn and implicitDependencies to determine project relationships.
  */
-
-import {
-    createProjectGraphAsync,
-    readProjectsConfigurationFromProjectGraph,
-    ProjectConfiguration,
-} from '@nx/devkit';
-
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.generateRawGraph = generateRawGraph;
+exports.transformGraph = transformGraph;
+exports.generateGraph = generateGraph;
+const devkit_1 = require("@nx/devkit");
 /**
  * Projects to exclude from graph validation (tools, configs, etc.)
  */
-const EXCLUDED_PROJECTS = new Set<string>([]);
-
+const EXCLUDED_PROJECTS = new Set([]);
 /**
  * Extract project dependencies from project.json's build.dependsOn and implicitDependencies
  */
-function extractBuildDependencies(projectConfig: ProjectConfiguration): string[] {
-    const deps: string[] = [];
-
+function extractBuildDependencies(projectConfig) {
+    const deps = [];
     // 1. Read from build.dependsOn
     const buildTarget = projectConfig.targets?.['build'];
     if (buildTarget && buildTarget.dependsOn) {
@@ -35,7 +32,6 @@ function extractBuildDependencies(projectConfig: ProjectConfiguration): string[]
             }
         }
     }
-
     // 2. Also read from implicitDependencies
     if (projectConfig.implicitDependencies && Array.isArray(projectConfig.implicitDependencies)) {
         for (const dep of projectConfig.implicitDependencies) {
@@ -44,54 +40,45 @@ function extractBuildDependencies(projectConfig: ProjectConfiguration): string[]
             }
         }
     }
-
     return deps.sort();
 }
-
 /**
  * Generate raw dependency graph from project.json files
  * Returns: { projectName: [dependencyNames] }
  */
-export async function generateRawGraph(): Promise<Record<string, string[]>> {
-    const projectGraph = await createProjectGraphAsync();
-    const projectsConfig = readProjectsConfigurationFromProjectGraph(projectGraph);
-    const rawDeps: Record<string, string[]> = {};
-
+async function generateRawGraph() {
+    const projectGraph = await (0, devkit_1.createProjectGraphAsync)();
+    const projectsConfig = (0, devkit_1.readProjectsConfigurationFromProjectGraph)(projectGraph);
+    const rawDeps = {};
     for (const [projectName, projectConfig] of Object.entries(projectsConfig.projects)) {
         // Skip excluded projects (tools, plugins)
         if (EXCLUDED_PROJECTS.has(projectName)) {
             continue;
         }
-
         // Extract dependencies from build.dependsOn in project.json
         const deps = extractBuildDependencies(projectConfig);
         rawDeps[projectName] = deps;
     }
-
     return rawDeps;
 }
-
 /**
  * Transform project names (sorting dependencies only - no scope transformation)
  */
-export function transformGraph(rawGraph: Record<string, string[]>): Record<string, string[]> {
-    const result: Record<string, string[]> = {};
-
+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;
 }
-
 /**
  * Generate complete dependency graph with transformations
  */
-export async function generateGraph(): Promise<Record<string, string[]>> {
+async function generateGraph() {
     const rawGraph = await generateRawGraph();
     return transformGraph(rawGraph);
 }
+//# sourceMappingURL=graph-generator.js.map

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

@@ -0,0 +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,EAAE,CAAC,CAAC;AAE9C;;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>([]);\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"]}

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

@@ -0,0 +1,31 @@
+/**
+ * Graph Loader
+ *
+ * Handles loading and saving the blessed dependency graph file.
+ * The graph is stored at architecture/dependencies.json in the workspace root.
+ */
+import type { EnhancedGraph } from './graph-sorter';
+/**
+ * Default path for the dependencies file (relative to workspace root)
+ */
+export declare const DEFAULT_GRAPH_PATH = "architecture/dependencies.json";
+/**
+ * Load the blessed graph from disk
+ *
+ * @param workspaceRoot - Absolute path to workspace root
+ * @param graphPath - Relative path to graph file (default: .graphs/dependencies.json)
+ * @returns The blessed graph, or null if file doesn't exist
+ */
+export declare function loadBlessedGraph(workspaceRoot: string, graphPath?: string): EnhancedGraph | null;
+/**
+ * Save the graph to disk
+ *
+ * @param graph - The graph to save
+ * @param workspaceRoot - Absolute path to workspace root
+ * @param graphPath - Relative path to graph file (default: .graphs/dependencies.json)
+ */
+export declare function saveGraph(graph: EnhancedGraph, workspaceRoot: string, graphPath?: string): void;
+/**
+ * Check if the graph file exists
+ */
+export declare function graphFileExists(workspaceRoot: string, graphPath?: string): boolean;

package/src/lib/{graph-loader.ts → graph-loader.js}

@@ -1,20 +1,23 @@
+"use strict";
 /**
  * Graph Loader
  *
  * Handles loading and saving the blessed dependency graph file.
  * The graph is stored at architecture/dependencies.json in the workspace root.
  */
-
-import * as fs from 'fs';
-import * as path from 'path';
-import type { EnhancedGraph } from './graph-sorter';
-import { toError } from '../toError';
-
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.DEFAULT_GRAPH_PATH = void 0;
+exports.loadBlessedGraph = loadBlessedGraph;
+exports.saveGraph = saveGraph;
+exports.graphFileExists = graphFileExists;
+const tslib_1 = require("tslib");
+const fs = tslib_1.__importStar(require("fs"));
+const path = tslib_1.__importStar(require("path"));
+const toError_1 = require("../toError");
 /**
  * Default path for the dependencies file (relative to workspace root)
  */
-export const DEFAULT_GRAPH_PATH = 'architecture/dependencies.json';
-
+exports.DEFAULT_GRAPH_PATH = 'architecture/dependencies.json';
 /**
  * Load the blessed graph from disk
  *
@@ -22,44 +25,37 @@ export const DEFAULT_GRAPH_PATH = 'architecture/dependencies.json';
  * @param graphPath - Relative path to graph file (default: .graphs/dependencies.json)
  * @returns The blessed graph, or null if file doesn't exist
  */
-export function loadBlessedGraph(
-    workspaceRoot: string,
-    graphPath: string = DEFAULT_GRAPH_PATH
-): EnhancedGraph | null {
+function loadBlessedGraph(workspaceRoot, graphPath = exports.DEFAULT_GRAPH_PATH) {
     const fullPath = path.join(workspaceRoot, graphPath);
-
     if (!fs.existsSync(fullPath)) {
         return null;
     }
-
     // eslint-disable-next-line @webpieces/no-unmanaged-exceptions
     try {
         const content = fs.readFileSync(fullPath, 'utf-8');
-        return JSON.parse(content) as EnhancedGraph;
-    } catch (err: unknown) {
-        const error = toError(err);
+        return JSON.parse(content);
+    }
+    catch (err) {
+        const error = (0, toError_1.toError)(err);
         throw new Error(`Failed to load graph from ${fullPath}: ${error.message}`);
     }
 }
-
 /**
  * Format a graph as JSON with multi-line arrays for readability
  */
-function formatGraphJson(graph: EnhancedGraph): string {
-    const lines: string[] = ['{'];
+function formatGraphJson(graph) {
+    const lines = ['{'];
     const keys = Object.keys(graph).sort();
-
     keys.forEach((key, index) => {
         const entry = graph[key];
         const isLast = index === keys.length - 1;
         const comma = isLast ? '' : ',';
-
         lines.push(`    "${key}": {`);
         lines.push(`        "level": ${entry.level},`);
-
         if (entry.dependsOn.length === 0) {
             lines.push(`        "dependsOn": []`);
-        } else {
+        }
+        else {
             lines.push(`        "dependsOn": [`);
             entry.dependsOn.forEach((dep, depIndex) => {
                 const depComma = depIndex === entry.dependsOn.length - 1 ? '' : ',';
@@ -67,15 +63,11 @@ function formatGraphJson(graph: EnhancedGraph): string {
             });
             lines.push(`        ]`);
         }
-
         lines.push(`    }${comma}`);
-
     });
-
     lines.push('}');
     return lines.join('\n') + '\n';
 }
-
 /**
  * Save the graph to disk
  *
@@ -83,37 +75,27 @@ function formatGraphJson(graph: EnhancedGraph): string {
  * @param workspaceRoot - Absolute path to workspace root
  * @param graphPath - Relative path to graph file (default: .graphs/dependencies.json)
  */
-export function saveGraph(
-    graph: EnhancedGraph,
-    workspaceRoot: string,
-    graphPath: string = DEFAULT_GRAPH_PATH
-): void {
+function saveGraph(graph, workspaceRoot, graphPath = exports.DEFAULT_GRAPH_PATH) {
     const fullPath = path.join(workspaceRoot, graphPath);
     const dir = path.dirname(fullPath);
-
     // Ensure directory exists
     if (!fs.existsSync(dir)) {
         fs.mkdirSync(dir, { recursive: true });
     }
-
     // Sort keys for deterministic output
-    const sortedGraph: EnhancedGraph = {};
+    const sortedGraph = {};
     const sortedKeys = Object.keys(graph).sort();
     for (const key of sortedKeys) {
         sortedGraph[key] = graph[key];
     }
-
     const content = formatGraphJson(sortedGraph);
     fs.writeFileSync(fullPath, content, 'utf-8');
 }
-
 /**
  * Check if the graph file exists
  */
-export function graphFileExists(
-    workspaceRoot: string,
-    graphPath: string = DEFAULT_GRAPH_PATH
-): boolean {
+function graphFileExists(workspaceRoot, graphPath = exports.DEFAULT_GRAPH_PATH) {
     const fullPath = path.join(workspaceRoot, graphPath);
     return fs.existsSync(fullPath);
 }
+//# sourceMappingURL=graph-loader.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"graph-loader.js","sourceRoot":"","sources":["../../../../../../packages/tooling/nx-webpieces-rules/src/lib/graph-loader.ts"],"names":[],"mappings":";AAAA;;;;;GAKG;;;AAmBH,4CAkBC;AA2CD,8BAsBC;AAKD,0CAMC;;AA/GD,+CAAyB;AACzB,mDAA6B;AAE7B,wCAAqC;AAErC;;GAEG;AACU,QAAA,kBAAkB,GAAG,gCAAgC,CAAC;AAEnE;;;;;;GAMG;AACH,SAAgB,gBAAgB,CAC5B,aAAqB,EACrB,YAAoB,0BAAkB;IAEtC,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,aAAa,EAAE,SAAS,CAAC,CAAC;IAErD,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,QAAQ,CAAC,EAAE,CAAC;QAC3B,OAAO,IAAI,CAAC;IAChB,CAAC;IAED,8DAA8D;IAC9D,IAAI,CAAC;QACD,MAAM,OAAO,GAAG,EAAE,CAAC,YAAY,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;QACnD,OAAO,IAAI,CAAC,KAAK,CAAC,OAAO,CAAkB,CAAC;IAChD,CAAC;IAAC,OAAO,GAAY,EAAE,CAAC;QACpB,MAAM,KAAK,GAAG,IAAA,iBAAO,EAAC,GAAG,CAAC,CAAC;QAC3B,MAAM,IAAI,KAAK,CAAC,6BAA6B,QAAQ,KAAK,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC;IAC/E,CAAC;AACL,CAAC;AAED;;GAEG;AACH,SAAS,eAAe,CAAC,KAAoB;IACzC,MAAM,KAAK,GAAa,CAAC,GAAG,CAAC,CAAC;IAC9B,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC;IAEvC,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE;QACxB,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC;QACzB,MAAM,MAAM,GAAG,KAAK,KAAK,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;QACzC,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC;QAEhC,KAAK,CAAC,IAAI,CAAC,QAAQ,GAAG,MAAM,CAAC,CAAC;QAC9B,KAAK,CAAC,IAAI,CAAC,oBAAoB,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC;QAE/C,IAAI,KAAK,CAAC,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC/B,KAAK,CAAC,IAAI,CAAC,yBAAyB,CAAC,CAAC;QAC1C,CAAC;aAAM,CAAC;YACJ,KAAK,CAAC,IAAI,CAAC,wBAAwB,CAAC,CAAC;YACrC,KAAK,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,QAAQ,EAAE,EAAE;gBACtC,MAAM,QAAQ,GAAG,QAAQ,KAAK,KAAK,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC;gBACpE,KAAK,CAAC,IAAI,CAAC,gBAAgB,GAAG,IAAI,QAAQ,EAAE,CAAC,CAAC;YAClD,CAAC,CAAC,CAAC;YACH,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QAC5B,CAAC;QAED,KAAK,CAAC,IAAI,CAAC,QAAQ,KAAK,EAAE,CAAC,CAAC;IAEhC,CAAC,CAAC,CAAC;IAEH,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAChB,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;AACnC,CAAC;AAED;;;;;;GAMG;AACH,SAAgB,SAAS,CACrB,KAAoB,EACpB,aAAqB,EACrB,YAAoB,0BAAkB;IAEtC,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,aAAa,EAAE,SAAS,CAAC,CAAC;IACrD,MAAM,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;IAEnC,0BAA0B;IAC1B,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;QACtB,EAAE,CAAC,SAAS,CAAC,GAAG,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;IAC3C,CAAC;IAED,qCAAqC;IACrC,MAAM,WAAW,GAAkB,EAAE,CAAC;IACtC,MAAM,UAAU,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC;IAC7C,KAAK,MAAM,GAAG,IAAI,UAAU,EAAE,CAAC;QAC3B,WAAW,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC;IAClC,CAAC;IAED,MAAM,OAAO,GAAG,eAAe,CAAC,WAAW,CAAC,CAAC;IAC7C,EAAE,CAAC,aAAa,CAAC,QAAQ,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;AACjD,CAAC;AAED;;GAEG;AACH,SAAgB,eAAe,CAC3B,aAAqB,EACrB,YAAoB,0BAAkB;IAEtC,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,aAAa,EAAE,SAAS,CAAC,CAAC;IACrD,OAAO,EAAE,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;AACnC,CAAC","sourcesContent":["/**\n * Graph Loader\n *\n * Handles loading and saving the blessed dependency graph file.\n * The graph is stored at architecture/dependencies.json in the workspace root.\n */\n\nimport * as fs from 'fs';\nimport * as path from 'path';\nimport type { EnhancedGraph } from './graph-sorter';\nimport { toError } from '../toError';\n\n/**\n * Default path for the dependencies file (relative to workspace root)\n */\nexport const DEFAULT_GRAPH_PATH = 'architecture/dependencies.json';\n\n/**\n * Load the blessed graph from disk\n *\n * @param workspaceRoot - Absolute path to workspace root\n * @param graphPath - Relative path to graph file (default: .graphs/dependencies.json)\n * @returns The blessed graph, or null if file doesn't exist\n */\nexport function loadBlessedGraph(\n    workspaceRoot: string,\n    graphPath: string = DEFAULT_GRAPH_PATH\n): EnhancedGraph | null {\n    const fullPath = path.join(workspaceRoot, graphPath);\n\n    if (!fs.existsSync(fullPath)) {\n        return null;\n    }\n\n    // eslint-disable-next-line @webpieces/no-unmanaged-exceptions\n    try {\n        const content = fs.readFileSync(fullPath, 'utf-8');\n        return JSON.parse(content) as EnhancedGraph;\n    } catch (err: unknown) {\n        const error = toError(err);\n        throw new Error(`Failed to load graph from ${fullPath}: ${error.message}`);\n    }\n}\n\n/**\n * Format a graph as JSON with multi-line arrays for readability\n */\nfunction formatGraphJson(graph: EnhancedGraph): string {\n    const lines: string[] = ['{'];\n    const keys = Object.keys(graph).sort();\n\n    keys.forEach((key, index) => {\n        const entry = graph[key];\n        const isLast = index === keys.length - 1;\n        const comma = isLast ? '' : ',';\n\n        lines.push(`    \"${key}\": {`);\n        lines.push(`        \"level\": ${entry.level},`);\n\n        if (entry.dependsOn.length === 0) {\n            lines.push(`        \"dependsOn\": []`);\n        } else {\n            lines.push(`        \"dependsOn\": [`);\n            entry.dependsOn.forEach((dep, depIndex) => {\n                const depComma = depIndex === entry.dependsOn.length - 1 ? '' : ',';\n                lines.push(`            \"${dep}\"${depComma}`);\n            });\n            lines.push(`        ]`);\n        }\n\n        lines.push(`    }${comma}`);\n\n    });\n\n    lines.push('}');\n    return lines.join('\\n') + '\\n';\n}\n\n/**\n * Save the graph to disk\n *\n * @param graph - The graph to save\n * @param workspaceRoot - Absolute path to workspace root\n * @param graphPath - Relative path to graph file (default: .graphs/dependencies.json)\n */\nexport function saveGraph(\n    graph: EnhancedGraph,\n    workspaceRoot: string,\n    graphPath: string = DEFAULT_GRAPH_PATH\n): void {\n    const fullPath = path.join(workspaceRoot, graphPath);\n    const dir = path.dirname(fullPath);\n\n    // Ensure directory exists\n    if (!fs.existsSync(dir)) {\n        fs.mkdirSync(dir, { recursive: true });\n    }\n\n    // Sort keys for deterministic output\n    const sortedGraph: EnhancedGraph = {};\n    const sortedKeys = Object.keys(graph).sort();\n    for (const key of sortedKeys) {\n        sortedGraph[key] = graph[key];\n    }\n\n    const content = formatGraphJson(sortedGraph);\n    fs.writeFileSync(fullPath, content, 'utf-8');\n}\n\n/**\n * Check if the graph file exists\n */\nexport function graphFileExists(\n    workspaceRoot: string,\n    graphPath: string = DEFAULT_GRAPH_PATH\n): boolean {\n    const fullPath = path.join(workspaceRoot, graphPath);\n    return fs.existsSync(fullPath);\n}\n"]}

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

@@ -0,0 +1,37 @@
+/**
+ * Graph Sorter
+ *
+ * Performs topological sorting on the dependency graph to:
+ * 1. Detect circular dependencies (fails if cycle found)
+ * 2. Assign level numbers to each project (level 0 = no deps, level 1 = depends on level 0, etc.)
+ * 3. Group projects into layers for deterministic ordering
+ */
+/**
+ * Graph entry with level metadata
+ */
+export interface GraphEntry {
+    level: number;
+    dependsOn: string[];
+}
+/**
+ * Enhanced graph format with level information
+ */
+export type EnhancedGraph = Record<string, GraphEntry>;
+/**
+ * Compute topological layers for dependency graph using Kahn's algorithm
+ *
+ * Projects are grouped into layers where each layer only depends on previous layers.
+ * Throws an error if a circular dependency is detected.
+ *
+ * @param graph - Dependency graph { project: [deps] }
+ * @returns Array of layers, each containing sorted project names
+ */
+export declare function computeTopologicalLayers(graph: Record<string, string[]>): string[][];
+/**
+ * Sort graph in topological order with alphabetical sorting within layers
+ * Returns enhanced format with level metadata
+ *
+ * @param graph - Unsorted dependency graph { project: [deps] }
+ * @returns Sorted graph with level metadata { project: { level: number, dependsOn: [deps] } }
+ */
+export declare function sortGraphTopologically(graph: Record<string, string[]>): EnhancedGraph;