@webpieces/dev-config 0.2.17 → 0.2.21

package/architecture/executors/visualize/schema.json

@@ -0,0 +1,14 @@
+{
+    "$schema": "http://json-schema.org/schema",
+    "title": "Visualize Executor",
+    "description": "Generates visual representations of the architecture graph",
+    "type": "object",
+    "properties": {
+        "graphPath": {
+            "type": "string",
+            "description": "Path to the graph file (relative to workspace root)",
+            "default": "architecture/dependencies.json"
+        }
+    },
+    "required": []
+}

package/architecture/index.d.ts

@@ -0,0 +1,19 @@
+/**
+ * Architecture Validation Module
+ *
+ * Provides tools for validating and managing the architecture dependency graph.
+ *
+ * Exports:
+ * - Graph generation from project.json files
+ * - Topological sorting and cycle detection
+ * - Package.json validation
+ * - Graph comparison
+ * - Graph file loading/saving
+ * - Graph visualization (DOT + HTML)
+ */
+export * from './lib/graph-generator';
+export * from './lib/graph-sorter';
+export * from './lib/graph-comparator';
+export * from './lib/package-validator';
+export * from './lib/graph-loader';
+export * from './lib/graph-visualizer';

package/architecture/index.js

@@ -0,0 +1,23 @@
+"use strict";
+/**
+ * Architecture Validation Module
+ *
+ * Provides tools for validating and managing the architecture dependency graph.
+ *
+ * Exports:
+ * - Graph generation from project.json files
+ * - Topological sorting and cycle detection
+ * - Package.json validation
+ * - Graph comparison
+ * - Graph file loading/saving
+ * - Graph visualization (DOT + HTML)
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+const tslib_1 = require("tslib");
+tslib_1.__exportStar(require("./lib/graph-generator"), exports);
+tslib_1.__exportStar(require("./lib/graph-sorter"), exports);
+tslib_1.__exportStar(require("./lib/graph-comparator"), exports);
+tslib_1.__exportStar(require("./lib/package-validator"), exports);
+tslib_1.__exportStar(require("./lib/graph-loader"), exports);
+tslib_1.__exportStar(require("./lib/graph-visualizer"), exports);
+//# sourceMappingURL=index.js.map

package/architecture/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../../packages/tooling/dev-config/architecture/index.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;GAYG;;;AAEH,gEAAsC;AACtC,6DAAmC;AACnC,iEAAuC;AACvC,kEAAwC;AACxC,6DAAmC;AACnC,iEAAuC","sourcesContent":["/**\n * Architecture Validation Module\n *\n * Provides tools for validating and managing the architecture dependency graph.\n *\n * Exports:\n * - Graph generation from project.json files\n * - Topological sorting and cycle detection\n * - Package.json validation\n * - Graph comparison\n * - Graph file loading/saving\n * - Graph visualization (DOT + HTML)\n */\n\nexport * from './lib/graph-generator';\nexport * from './lib/graph-sorter';\nexport * from './lib/graph-comparator';\nexport * from './lib/package-validator';\nexport * from './lib/graph-loader';\nexport * from './lib/graph-visualizer';\n"]}

package/architecture/index.ts

@@ -0,0 +1,20 @@
+/**
+ * Architecture Validation Module
+ *
+ * Provides tools for validating and managing the architecture dependency graph.
+ *
+ * Exports:
+ * - Graph generation from project.json files
+ * - Topological sorting and cycle detection
+ * - Package.json validation
+ * - Graph comparison
+ * - Graph file loading/saving
+ * - Graph visualization (DOT + HTML)
+ */
+
+export * from './lib/graph-generator';
+export * from './lib/graph-sorter';
+export * from './lib/graph-comparator';
+export * from './lib/package-validator';
+export * from './lib/graph-loader';
+export * from './lib/graph-visualizer';

package/architecture/lib/graph-comparator.d.ts

@@ -0,0 +1,39 @@
+/**
+ * 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;
+}
+/**
+ * Compare two graphs and return the differences
+ *
+ * @param current - Currently generated graph
+ * @param saved - Previously saved (blessed) graph
+ * @returns Comparison result with detailed diff
+ */
+export declare function compareGraphs(current: EnhancedGraph, saved: EnhancedGraph): ComparisonResult;

package/architecture/lib/graph-comparator.js

@@ -0,0 +1,100 @@
+"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.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.compareGraphs = compareGraphs;
+/**
+ * Compare two graphs and return the differences
+ *
+ * @param current - Currently generated graph
+ * @param saved - Previously saved (blessed) graph
+ * @returns Comparison result with detailed diff
+ */
+function compareGraphs(current, saved) {
+    const currentProjects = new Set(Object.keys(current));
+    const savedProjects = new Set(Object.keys(saved));
+    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
+    for (const project of currentProjects) {
+        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 = [];
+        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;
+        if (addedDeps.length > 0 || removedDeps.length > 0 || levelChanged) {
+            diff.modified.push({
+                project,
+                addedDeps,
+                removedDeps,
+                levelChanged,
+            });
+        }
+    }
+    const identical = diff.added.length === 0 && diff.removed.length === 0 && diff.modified.length === 0;
+    // Generate summary
+    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 = [];
+        if (mod.addedDeps.length > 0) {
+            parts.push(`+deps: ${mod.addedDeps.join(', ')}`);
+        }
+        if (mod.removedDeps.length > 0) {
+            parts.push(`-deps: ${mod.removedDeps.join(', ')}`);
+        }
+        if (mod.levelChanged) {
+            parts.push(`level: ${mod.levelChanged.from} -> ${mod.levelChanged.to}`);
+        }
+        if (parts.length > 0) {
+            summaryParts.push(`${mod.project}: ${parts.join('; ')}`);
+        }
+    }
+    const summary = identical ? 'Graphs are identical' : summaryParts.join('\n');
+    return {
+        identical,
+        diff,
+        summary,
+    };
+}
+//# sourceMappingURL=graph-comparator.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"graph-comparator.js","sourceRoot":"","sources":["../../../../../../packages/tooling/dev-config/architecture/lib/graph-comparator.ts"],"names":[],"mappings":";AAAA;;;;;GAKG;;AAkCH,sCAqGC;AA5GD;;;;;;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,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;IAED,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,mBAAmB;IACnB,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,MAAM,OAAO,GAAG,SAAS,CAAC,CAAC,CAAC,sBAAsB,CAAC,CAAC,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAE7E,OAAO;QACH,SAAS;QACT,IAAI;QACJ,OAAO;KACV,CAAC;AACN,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    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    const identical =\n        diff.added.length === 0 && diff.removed.length === 0 && diff.modified.length === 0;\n\n    // Generate summary\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    const summary = identical ? 'Graphs are identical' : summaryParts.join('\\n');\n\n    return {\n        identical,\n        diff,\n        summary,\n    };\n}\n"]}

package/architecture/lib/graph-comparator.ts

@@ -0,0 +1,141 @@
+/**
+ * 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;
+}
+
+/**
+ * Compare two graphs and return the differences
+ *
+ * @param current - Currently generated graph
+ * @param saved - Previously saved (blessed) graph
+ * @returns Comparison result with detailed diff
+ */
+export function compareGraphs(current: EnhancedGraph, saved: EnhancedGraph): ComparisonResult {
+    const currentProjects = new Set(Object.keys(current));
+    const savedProjects = new Set(Object.keys(saved));
+
+    const diff: GraphDiff = {
+        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
+    for (const project of currentProjects) {
+        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[] = [];
+
+        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;
+
+        if (addedDeps.length > 0 || removedDeps.length > 0 || levelChanged) {
+            diff.modified.push({
+                project,
+                addedDeps,
+                removedDeps,
+                levelChanged,
+            });
+        }
+    }
+
+    const identical =
+        diff.added.length === 0 && diff.removed.length === 0 && diff.modified.length === 0;
+
+    // Generate summary
+    const summaryParts: string[] = [];
+
+    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[] = [];
+        if (mod.addedDeps.length > 0) {
+            parts.push(`+deps: ${mod.addedDeps.join(', ')}`);
+        }
+        if (mod.removedDeps.length > 0) {
+            parts.push(`-deps: ${mod.removedDeps.join(', ')}`);
+        }
+        if (mod.levelChanged) {
+            parts.push(`level: ${mod.levelChanged.from} -> ${mod.levelChanged.to}`);
+        }
+        if (parts.length > 0) {
+            summaryParts.push(`${mod.project}: ${parts.join('; ')}`);
+        }
+    }
+
+    const summary = identical ? 'Graphs are identical' : summaryParts.join('\n');
+
+    return {
+        identical,
+        diff,
+        summary,
+    };
+}

package/architecture/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 to @webpieces/xxx format
+ */
+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/architecture/lib/graph-generator.js

@@ -0,0 +1,88 @@
+"use strict";
+/**
+ * Graph Generator
+ *
+ * Generates dependency graph from project.json files in the workspace.
+ * Reads build.dependsOn and implicitDependencies to determine project relationships.
+ */
+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([]);
+/**
+ * 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] }
+ */
+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 to @webpieces/xxx format
+ */
+function transformGraph(rawGraph) {
+    const result = {};
+    for (const [projectName, deps] of Object.entries(rawGraph)) {
+        // Avoid double prefix if already has @webpieces/
+        const transformedName = projectName.startsWith('@webpieces/')
+            ? projectName
+            : `@webpieces/${projectName}`;
+        const transformedDeps = deps
+            .map((d) => (d.startsWith('@webpieces/') ? d : `@webpieces/${d}`))
+            .sort();
+        result[transformedName] = transformedDeps;
+    }
+    return result;
+}
+/**
+ * Generate complete dependency graph with transformations
+ */
+async function generateGraph() {
+    const rawGraph = await generateRawGraph();
+    return transformGraph(rawGraph);
+}
+//# sourceMappingURL=graph-generator.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"graph-generator.js","sourceRoot":"","sources":["../../../../../../packages/tooling/dev-config/architecture/lib/graph-generator.ts"],"names":[],"mappings":";AAAA;;;;;GAKG;;AAiDH,4CAiBC;AAKD,wCAiBC;AAKD,sCAGC;AA9FD,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,iDAAiD;QACjD,MAAM,eAAe,GAAG,WAAW,CAAC,UAAU,CAAC,aAAa,CAAC;YACzD,CAAC,CAAC,WAAW;YACb,CAAC,CAAC,cAAc,WAAW,EAAE,CAAC;QAElC,MAAM,eAAe,GAAG,IAAI;aACvB,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,EAAE,CAAC,CAAC;aACjE,IAAI,EAAE,CAAC;QAEZ,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 to @webpieces/xxx format\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        // Avoid double prefix if already has @webpieces/\n        const transformedName = projectName.startsWith('@webpieces/')\n            ? projectName\n            : `@webpieces/${projectName}`;\n\n        const transformedDeps = deps\n            .map((d) => (d.startsWith('@webpieces/') ? d : `@webpieces/${d}`))\n            .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/architecture/lib/graph-generator.ts

@@ -0,0 +1,102 @@
+/**
+ * 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';
+
+/**
+ * Projects to exclude from graph validation (tools, configs, etc.)
+ */
+const EXCLUDED_PROJECTS = new Set<string>([]);
+
+/**
+ * Extract project dependencies from project.json's build.dependsOn and implicitDependencies
+ */
+function extractBuildDependencies(projectConfig: ProjectConfiguration): string[] {
+    const deps: string[] = [];
+
+    // 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] }
+ */
+export async function generateRawGraph(): Promise<Record<string, string[]>> {
+    const projectGraph = await createProjectGraphAsync();
+    const projectsConfig = readProjectsConfigurationFromProjectGraph(projectGraph);
+    const rawDeps: Record<string, string[]> = {};
+
+    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 to @webpieces/xxx format
+ */
+export function transformGraph(rawGraph: Record<string, string[]>): Record<string, string[]> {
+    const result: Record<string, string[]> = {};
+
+    for (const [projectName, deps] of Object.entries(rawGraph)) {
+        // Avoid double prefix if already has @webpieces/
+        const transformedName = projectName.startsWith('@webpieces/')
+            ? projectName
+            : `@webpieces/${projectName}`;
+
+        const transformedDeps = deps
+            .map((d) => (d.startsWith('@webpieces/') ? d : `@webpieces/${d}`))
+            .sort();
+
+        result[transformedName] = transformedDeps;
+    }
+
+    return result;
+}
+
+/**
+ * Generate complete dependency graph with transformations
+ */
+export async function generateGraph(): Promise<Record<string, string[]>> {
+    const rawGraph = await generateRawGraph();
+    return transformGraph(rawGraph);
+}

package/architecture/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;