@webpieces/nx-webpieces-rules 0.0.1 → 0.2.113

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

@@ -1,3 +1,4 @@
+"use strict";
 /**
  * Graph Sorter
  *
@@ -6,20 +7,9 @@
  * 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>;
-
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.computeTopologicalLayers = computeTopologicalLayers;
+exports.sortGraphTopologically = sortGraphTopologically;
 /**
  * Compute topological layers for dependency graph using Kahn's algorithm
  *
@@ -29,88 +19,72 @@ export type EnhancedGraph = Record<string, GraphEntry>;
  * @param graph - Dependency graph { project: [deps] }
  * @returns Array of layers, each containing sorted project names
  */
-export function computeTopologicalLayers(graph: Record<string, string[]>): string[][] {
-    const layers: string[][] = [];
-    const processed = new Set<string>();
+function computeTopologicalLayers(graph) {
+    const layers = [];
+    const processed = new Set();
     const allProjects = Object.keys(graph);
-
     while (processed.size < allProjects.length) {
-        const currentLayer: string[] = [];
-
+        const currentLayer = [];
         for (const project of allProjects) {
-            if (processed.has(project)) continue;
-
+            if (processed.has(project))
+                continue;
             const deps = graph[project] || [];
             // Check if all dependencies are in previous layers (already processed)
             const allDepsInPrevLayers = deps.every((dep) => processed.has(dep));
-
             if (allDepsInPrevLayers) {
                 currentLayer.push(project);
             }
         }
-
         if (currentLayer.length === 0) {
             // No progress made = circular dependency detected
             const remaining = allProjects.filter((p) => !processed.has(p));
-
             // Try to identify the cycle
             const cycleInfo = findCycle(graph, remaining);
-
-            throw new Error(
-                `Circular dependency detected among: ${remaining.join(', ')}\n` +
-                    (cycleInfo ? `Cycle: ${cycleInfo}\n` : '') +
-                    'Fix: Remove one of the dependencies to break the cycle.'
-            );
+            throw new Error(`Circular dependency detected among: ${remaining.join(', ')}\n` +
+                (cycleInfo ? `Cycle: ${cycleInfo}\n` : '') +
+                'Fix: Remove one of the dependencies to break the cycle.');
         }
-
         // Sort alphabetically within layer for deterministic output
         currentLayer.sort();
         layers.push(currentLayer);
-
         // Mark as processed
         currentLayer.forEach((p) => processed.add(p));
     }
-
     return layers;
 }
-
 /**
  * Try to find and describe a cycle in the graph
  */
-function findCycle(graph: Record<string, string[]>, remaining: string[]): string | null {
-    const visited = new Set<string>();
-    const path: string[] = [];
-
-    function dfs(node: string): string | null {
+function findCycle(graph, remaining) {
+    const visited = new Set();
+    const path = [];
+    function dfs(node) {
         if (path.includes(node)) {
             const cycleStart = path.indexOf(node);
             return [...path.slice(cycleStart), node].join(' -> ');
         }
-        if (visited.has(node)) return null;
-
+        if (visited.has(node))
+            return null;
         visited.add(node);
         path.push(node);
-
         const deps = graph[node] || [];
         for (const dep of deps) {
             if (remaining.includes(dep)) {
                 const result = dfs(dep);
-                if (result) return result;
+                if (result)
+                    return result;
             }
         }
-
         path.pop();
         return null;
     }
-
     for (const node of remaining) {
         const cycle = dfs(node);
-        if (cycle) return cycle;
+        if (cycle)
+            return cycle;
     }
-
     return null;
 }
-
 /**
  * Sort graph in topological order with alphabetical sorting within layers
  * Returns enhanced format with level metadata
@@ -118,10 +92,9 @@ function findCycle(graph: Record<string, string[]>, remaining: string[]): string
  * @param graph - Unsorted dependency graph { project: [deps] }
  * @returns Sorted graph with level metadata { project: { level: number, dependsOn: [deps] } }
  */
-export function sortGraphTopologically(graph: Record<string, string[]>): EnhancedGraph {
+function sortGraphTopologically(graph) {
     const layers = computeTopologicalLayers(graph);
-    const result: EnhancedGraph = {};
-
+    const result = {};
     // Add projects layer by layer (dependencies before dependents)
     layers.forEach((layer, levelIndex) => {
         for (const project of layer) {
@@ -132,6 +105,6 @@ export function sortGraphTopologically(graph: Record<string, string[]>): Enhance
             };
         }
     });
-
     return result;
 }
+//# sourceMappingURL=graph-sorter.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"graph-sorter.js","sourceRoot":"","sources":["../../../../../../packages/tooling/nx-webpieces-rules/src/lib/graph-sorter.ts"],"names":[],"mappings":";AAAA;;;;;;;GAOG;;AAwBH,4DA2CC;AA8CD,wDAgBC;AAlHD;;;;;;;;GAQG;AACH,SAAgB,wBAAwB,CAAC,KAA+B;IACpE,MAAM,MAAM,GAAe,EAAE,CAAC;IAC9B,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;IACpC,MAAM,WAAW,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAEvC,OAAO,SAAS,CAAC,IAAI,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC;QACzC,MAAM,YAAY,GAAa,EAAE,CAAC;QAElC,KAAK,MAAM,OAAO,IAAI,WAAW,EAAE,CAAC;YAChC,IAAI,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC;gBAAE,SAAS;YAErC,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC;YAClC,uEAAuE;YACvE,MAAM,mBAAmB,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;YAEpE,IAAI,mBAAmB,EAAE,CAAC;gBACtB,YAAY,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAC/B,CAAC;QACL,CAAC;QAED,IAAI,YAAY,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC5B,kDAAkD;YAClD,MAAM,SAAS,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YAE/D,4BAA4B;YAC5B,MAAM,SAAS,GAAG,SAAS,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;YAE9C,MAAM,IAAI,KAAK,CACX,uCAAuC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI;gBAC3D,CAAC,SAAS,CAAC,CAAC,CAAC,UAAU,SAAS,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC1C,yDAAyD,CAChE,CAAC;QACN,CAAC;QAED,4DAA4D;QAC5D,YAAY,CAAC,IAAI,EAAE,CAAC;QACpB,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;QAE1B,oBAAoB;QACpB,YAAY,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAClD,CAAC;IAED,OAAO,MAAM,CAAC;AAClB,CAAC;AAED;;GAEG;AACH,SAAS,SAAS,CAAC,KAA+B,EAAE,SAAmB;IACnE,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,IAAI,GAAa,EAAE,CAAC;IAE1B,SAAS,GAAG,CAAC,IAAY;QACrB,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;YACtB,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;YACtC,OAAO,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC1D,CAAC;QACD,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,OAAO,IAAI,CAAC;QAEnC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAClB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAEhB,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;QAC/B,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACrB,IAAI,SAAS,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;gBAC1B,MAAM,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;gBACxB,IAAI,MAAM;oBAAE,OAAO,MAAM,CAAC;YAC9B,CAAC;QACL,CAAC;QAED,IAAI,CAAC,GAAG,EAAE,CAAC;QACX,OAAO,IAAI,CAAC;IAChB,CAAC;IAED,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;QAC3B,MAAM,KAAK,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC;QACxB,IAAI,KAAK;YAAE,OAAO,KAAK,CAAC;IAC5B,CAAC;IAED,OAAO,IAAI,CAAC;AAChB,CAAC;AAED;;;;;;GAMG;AACH,SAAgB,sBAAsB,CAAC,KAA+B;IAClE,MAAM,MAAM,GAAG,wBAAwB,CAAC,KAAK,CAAC,CAAC;IAC/C,MAAM,MAAM,GAAkB,EAAE,CAAC;IAEjC,+DAA+D;IAC/D,MAAM,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,UAAU,EAAE,EAAE;QACjC,KAAK,MAAM,OAAO,IAAI,KAAK,EAAE,CAAC;YAC1B,6CAA6C;YAC7C,MAAM,CAAC,OAAO,CAAC,GAAG;gBACd,KAAK,EAAE,UAAU;gBACjB,SAAS,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE;aAC3C,CAAC;QACN,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,OAAO,MAAM,CAAC;AAClB,CAAC","sourcesContent":["/**\n * Graph Sorter\n *\n * Performs topological sorting on the dependency graph to:\n * 1. Detect circular dependencies (fails if cycle found)\n * 2. Assign level numbers to each project (level 0 = no deps, level 1 = depends on level 0, etc.)\n * 3. Group projects into layers for deterministic ordering\n */\n\n/**\n * Graph entry with level metadata\n */\nexport interface GraphEntry {\n    level: number;\n    dependsOn: string[];\n}\n\n/**\n * Enhanced graph format with level information\n */\nexport type EnhancedGraph = Record<string, GraphEntry>;\n\n/**\n * Compute topological layers for dependency graph using Kahn's algorithm\n *\n * Projects are grouped into layers where each layer only depends on previous layers.\n * Throws an error if a circular dependency is detected.\n *\n * @param graph - Dependency graph { project: [deps] }\n * @returns Array of layers, each containing sorted project names\n */\nexport function computeTopologicalLayers(graph: Record<string, string[]>): string[][] {\n    const layers: string[][] = [];\n    const processed = new Set<string>();\n    const allProjects = Object.keys(graph);\n\n    while (processed.size < allProjects.length) {\n        const currentLayer: string[] = [];\n\n        for (const project of allProjects) {\n            if (processed.has(project)) continue;\n\n            const deps = graph[project] || [];\n            // Check if all dependencies are in previous layers (already processed)\n            const allDepsInPrevLayers = deps.every((dep) => processed.has(dep));\n\n            if (allDepsInPrevLayers) {\n                currentLayer.push(project);\n            }\n        }\n\n        if (currentLayer.length === 0) {\n            // No progress made = circular dependency detected\n            const remaining = allProjects.filter((p) => !processed.has(p));\n\n            // Try to identify the cycle\n            const cycleInfo = findCycle(graph, remaining);\n\n            throw new Error(\n                `Circular dependency detected among: ${remaining.join(', ')}\\n` +\n                    (cycleInfo ? `Cycle: ${cycleInfo}\\n` : '') +\n                    'Fix: Remove one of the dependencies to break the cycle.'\n            );\n        }\n\n        // Sort alphabetically within layer for deterministic output\n        currentLayer.sort();\n        layers.push(currentLayer);\n\n        // Mark as processed\n        currentLayer.forEach((p) => processed.add(p));\n    }\n\n    return layers;\n}\n\n/**\n * Try to find and describe a cycle in the graph\n */\nfunction findCycle(graph: Record<string, string[]>, remaining: string[]): string | null {\n    const visited = new Set<string>();\n    const path: string[] = [];\n\n    function dfs(node: string): string | null {\n        if (path.includes(node)) {\n            const cycleStart = path.indexOf(node);\n            return [...path.slice(cycleStart), node].join(' -> ');\n        }\n        if (visited.has(node)) return null;\n\n        visited.add(node);\n        path.push(node);\n\n        const deps = graph[node] || [];\n        for (const dep of deps) {\n            if (remaining.includes(dep)) {\n                const result = dfs(dep);\n                if (result) return result;\n            }\n        }\n\n        path.pop();\n        return null;\n    }\n\n    for (const node of remaining) {\n        const cycle = dfs(node);\n        if (cycle) return cycle;\n    }\n\n    return null;\n}\n\n/**\n * Sort graph in topological order with alphabetical sorting within layers\n * Returns enhanced format with level metadata\n *\n * @param graph - Unsorted dependency graph { project: [deps] }\n * @returns Sorted graph with level metadata { project: { level: number, dependsOn: [deps] } }\n */\nexport function sortGraphTopologically(graph: Record<string, string[]>): EnhancedGraph {\n    const layers = computeTopologicalLayers(graph);\n    const result: EnhancedGraph = {};\n\n    // Add projects layer by layer (dependencies before dependents)\n    layers.forEach((layer, levelIndex) => {\n        for (const project of layer) {\n            // Already sorted alphabetically within layer\n            result[project] = {\n                level: levelIndex,\n                dependsOn: (graph[project] || []).sort(),\n            };\n        }\n    });\n\n    return result;\n}\n"]}

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

@@ -0,0 +1,31 @@
+/**
+ * Graph Visualizer
+ *
+ * Generates visual representations of the architecture graph:
+ * - DOT format (for Graphviz)
+ * - Interactive HTML (using viz.js)
+ *
+ * Output files go to tmp/webpieces/ for easy viewing without committing.
+ */
+import type { EnhancedGraph } from './graph-sorter';
+/**
+ * Generate Graphviz DOT format from the graph
+ */
+export declare function generateDot(graph: EnhancedGraph, title?: string): string;
+/**
+ * Generate interactive HTML with embedded SVG using viz.js
+ */
+export declare function generateHTML(dot: string, title?: string): string;
+interface VisualizationPaths {
+    dotPath: string;
+    htmlPath: string;
+}
+/**
+ * Write visualization files to tmp/webpieces/
+ */
+export declare function writeVisualization(graph: EnhancedGraph, workspaceRoot: string, title?: string): VisualizationPaths;
+/**
+ * Open the HTML visualization in the default browser
+ */
+export declare function openVisualization(htmlPath: string): boolean;
+export {};

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

@@ -1,3 +1,4 @@
+"use strict";
 /**
  * Graph Visualizer
  *
@@ -7,57 +8,54 @@
  *
  * Output files go to tmp/webpieces/ for easy viewing without committing.
  */
-
-import * as fs from 'fs';
-import * as path from 'path';
-import { execSync } from 'child_process';
-import type { EnhancedGraph } from './graph-sorter';
-import { toError } from '../toError';
-
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.generateDot = generateDot;
+exports.generateHTML = generateHTML;
+exports.writeVisualization = writeVisualization;
+exports.openVisualization = openVisualization;
+const tslib_1 = require("tslib");
+const fs = tslib_1.__importStar(require("fs"));
+const path = tslib_1.__importStar(require("path"));
+const child_process_1 = require("child_process");
 /**
  * Level colors for visualization
  */
-const LEVEL_COLORS: Record<number, string> = {
+const LEVEL_COLORS = {
     0: '#E8F5E9', // Light green - foundation
     1: '#E3F2FD', // Light blue - middleware
     2: '#FFF3E0', // Light orange - applications
     3: '#FCE4EC', // Light pink - higher level
 };
-
 /**
  * Remove scope from name for display
  * '@scope/name' → 'name'
  * 'name' → 'name'
  */
-function getShortName(name: string): string {
-    return name.includes('/') ? name.split('/').pop()! : name;
+function getShortName(name) {
+    return name.includes('/') ? name.split('/').pop() : name;
 }
-
 /**
  * Generate Graphviz DOT format from the graph
  */
-export function generateDot(graph: EnhancedGraph, title: string = 'WebPieces Architecture'): string {
+function generateDot(graph, title = 'WebPieces Architecture') {
     let dot = 'digraph Architecture {\n';
     dot += '  rankdir=TB;\n';
     dot += '  node [shape=box, style=filled, fontname="Arial"];\n';
     dot += '  edge [fontname="Arial"];\n\n';
-
     // Group projects by level
-    const levels: Record<number, string[]> = {};
+    const levels = {};
     for (const [project, info] of Object.entries(graph)) {
-        if (!levels[info.level]) levels[info.level] = [];
+        if (!levels[info.level])
+            levels[info.level] = [];
         levels[info.level].push(project);
     }
-
     // Create nodes with level-based colors
     for (const [project, info] of Object.entries(graph)) {
         const shortName = getShortName(project);
         const color = LEVEL_COLORS[info.level] || '#F5F5F5';
         dot += `  "${shortName}" [fillcolor="${color}", label="${shortName}\\n(L${info.level})"];\n`;
     }
-
     dot += '\n';
-
     // Create same-rank subgraphs for each level
     for (const [level, projects] of Object.entries(levels)) {
         dot += `  { rank=same; `;
@@ -67,9 +65,7 @@ export function generateDot(graph: EnhancedGraph, title: string = 'WebPieces Arc
         });
         dot += '}\n';
     }
-
     dot += '\n';
-
     // Create edges (dependencies)
     for (const [project, info] of Object.entries(graph)) {
         const shortName = getShortName(project);
@@ -78,23 +74,19 @@ export function generateDot(graph: EnhancedGraph, title: string = 'WebPieces Arc
             dot += `  "${shortName}" -> "${depShortName}";\n`;
         }
     }
-
     dot += '\n  labelloc="t";\n';
     dot += `  label="${title}\\n(from architecture/dependencies.json)";\n`;
     dot += '  fontsize=20;\n';
     dot += '}\n';
-
     return dot;
 }
-
 /**
  * Generate interactive HTML with embedded SVG using viz.js
  */
-export function generateHTML(dot: string, title: string = 'WebPieces Architecture'): string {
+function generateHTML(dot, title = 'WebPieces Architecture') {
     const styles = generateHTMLStyles();
     const legend = generateHTMLLegend();
     const script = generateHTMLScript(dot);
-
     return `<!DOCTYPE html>
 <html>
 <head>
@@ -111,8 +103,7 @@ export function generateHTML(dot: string, title: string = 'WebPieces Architectur
 </body>
 </html>`;
 }
-
-function generateHTMLStyles(): string {
+function generateHTMLStyles() {
     return `
         body {
             margin: 0;
@@ -155,8 +146,7 @@ function generateHTMLStyles(): string {
         }
     `;
 }
-
-function generateHTMLLegend(): string {
+function generateHTMLLegend() {
     return `<div class="legend">
         <h2>Legend</h2>
         <div class="legend-item">
@@ -176,8 +166,7 @@ function generateHTMLLegend(): string {
         </div>
     </div>`;
 }
-
-function generateHTMLScript(dot: string): string {
+function generateHTMLScript(dot) {
     return `
         const dot = ${JSON.stringify(dot)};
         const viz = new Viz();
@@ -192,62 +181,49 @@ function generateHTMLScript(dot: string): string {
             });
     `;
 }
-
-interface VisualizationPaths {
-    dotPath: string;
-    htmlPath: string;
-}
-
 /**
  * Write visualization files to tmp/webpieces/
  */
-export function writeVisualization(
-    graph: EnhancedGraph,
-    workspaceRoot: string,
-    title: string = 'WebPieces Architecture'
-): VisualizationPaths {
+function writeVisualization(graph, workspaceRoot, title = 'WebPieces Architecture') {
     const outputDir = path.join(workspaceRoot, 'tmp', 'webpieces');
-
     // Ensure directory exists
     if (!fs.existsSync(outputDir)) {
         fs.mkdirSync(outputDir, { recursive: true });
     }
-
     // Generate DOT
     const dot = generateDot(graph, title);
     const dotPath = path.join(outputDir, 'architecture.dot');
     fs.writeFileSync(dotPath, dot, 'utf-8');
-
     // Generate HTML
     const html = generateHTML(dot, title);
     const htmlPath = path.join(outputDir, 'architecture.html');
     fs.writeFileSync(htmlPath, html, 'utf-8');
-
     return { dotPath, htmlPath };
 }
-
 /**
  * Open the HTML visualization in the default browser
  */
-export function openVisualization(htmlPath: string): boolean {
+function openVisualization(htmlPath) {
     // eslint-disable-next-line @webpieces/no-unmanaged-exceptions
     try {
         const platform = process.platform;
-        let openCommand: string;
-
+        let openCommand;
         if (platform === 'darwin') {
             openCommand = `open "${htmlPath}"`;
-        } else if (platform === 'win32') {
+        }
+        else if (platform === 'win32') {
             openCommand = `start "" "${htmlPath}"`;
-        } else {
+        }
+        else {
             openCommand = `xdg-open "${htmlPath}"`;
         }
-
-        execSync(openCommand, { stdio: 'ignore' });
+        (0, child_process_1.execSync)(openCommand, { stdio: 'ignore' });
         return true;
-    } catch (err: unknown) {
+    }
+    catch (err) {
         //const error = toError(err);
         void err;
         return false;
     }
 }
+//# sourceMappingURL=graph-visualizer.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"graph-visualizer.js","sourceRoot":"","sources":["../../../../../../packages/tooling/nx-webpieces-rules/src/lib/graph-visualizer.ts"],"names":[],"mappings":";AAAA;;;;;;;;GAQG;;AA8BH,kCAiDC;AAKD,oCAoBC;AA2FD,gDAuBC;AAKD,8CAqBC;;AAlPD,+CAAyB;AACzB,mDAA6B;AAC7B,iDAAyC;AAIzC;;GAEG;AACH,MAAM,YAAY,GAA2B;IACzC,CAAC,EAAE,SAAS,EAAE,2BAA2B;IACzC,CAAC,EAAE,SAAS,EAAE,0BAA0B;IACxC,CAAC,EAAE,SAAS,EAAE,8BAA8B;IAC5C,CAAC,EAAE,SAAS,EAAE,4BAA4B;CAC7C,CAAC;AAEF;;;;GAIG;AACH,SAAS,YAAY,CAAC,IAAY;IAC9B,OAAO,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,EAAG,CAAC,CAAC,CAAC,IAAI,CAAC;AAC9D,CAAC;AAED;;GAEG;AACH,SAAgB,WAAW,CAAC,KAAoB,EAAE,QAAgB,wBAAwB;IACtF,IAAI,GAAG,GAAG,0BAA0B,CAAC;IACrC,GAAG,IAAI,iBAAiB,CAAC;IACzB,GAAG,IAAI,uDAAuD,CAAC;IAC/D,GAAG,IAAI,gCAAgC,CAAC;IAExC,0BAA0B;IAC1B,MAAM,MAAM,GAA6B,EAAE,CAAC;IAC5C,KAAK,MAAM,CAAC,OAAO,EAAE,IAAI,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QAClD,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC;YAAE,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC;QACjD,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IACrC,CAAC;IAED,uCAAuC;IACvC,KAAK,MAAM,CAAC,OAAO,EAAE,IAAI,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QAClD,MAAM,SAAS,GAAG,YAAY,CAAC,OAAO,CAAC,CAAC;QACxC,MAAM,KAAK,GAAG,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,SAAS,CAAC;QACpD,GAAG,IAAI,MAAM,SAAS,iBAAiB,KAAK,aAAa,SAAS,QAAQ,IAAI,CAAC,KAAK,QAAQ,CAAC;IACjG,CAAC;IAED,GAAG,IAAI,IAAI,CAAC;IAEZ,4CAA4C;IAC5C,KAAK,MAAM,CAAC,KAAK,EAAE,QAAQ,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;QACrD,GAAG,IAAI,iBAAiB,CAAC;QACzB,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;YACnB,MAAM,SAAS,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;YAClC,GAAG,IAAI,IAAI,SAAS,KAAK,CAAC;QAC9B,CAAC,CAAC,CAAC;QACH,GAAG,IAAI,KAAK,CAAC;IACjB,CAAC;IAED,GAAG,IAAI,IAAI,CAAC;IAEZ,8BAA8B;IAC9B,KAAK,MAAM,CAAC,OAAO,EAAE,IAAI,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QAClD,MAAM,SAAS,GAAG,YAAY,CAAC,OAAO,CAAC,CAAC;QACxC,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,SAAS,IAAI,EAAE,EAAE,CAAC;YACrC,MAAM,YAAY,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC;YACvC,GAAG,IAAI,MAAM,SAAS,SAAS,YAAY,MAAM,CAAC;QACtD,CAAC;IACL,CAAC;IAED,GAAG,IAAI,qBAAqB,CAAC;IAC7B,GAAG,IAAI,YAAY,KAAK,8CAA8C,CAAC;IACvE,GAAG,IAAI,kBAAkB,CAAC;IAC1B,GAAG,IAAI,KAAK,CAAC;IAEb,OAAO,GAAG,CAAC;AACf,CAAC;AAED;;GAEG;AACH,SAAgB,YAAY,CAAC,GAAW,EAAE,QAAgB,wBAAwB;IAC9E,MAAM,MAAM,GAAG,kBAAkB,EAAE,CAAC;IACpC,MAAM,MAAM,GAAG,kBAAkB,EAAE,CAAC;IACpC,MAAM,MAAM,GAAG,kBAAkB,CAAC,GAAG,CAAC,CAAC;IAEvC,OAAO;;;aAGE,KAAK;;;aAGL,MAAM;;;UAGT,KAAK;MACT,MAAM;;cAEE,MAAM;;QAEZ,CAAC;AACT,CAAC;AAED,SAAS,kBAAkB;IACvB,OAAO;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;KAwCN,CAAC;AACN,CAAC;AAED,SAAS,kBAAkB;IACvB,OAAO;;;;;;;;;;;;;;;;;WAiBA,CAAC;AACZ,CAAC;AAED,SAAS,kBAAkB,CAAC,GAAW;IACnC,OAAO;sBACW,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC;;;;;;;;;;;KAWpC,CAAC;AACN,CAAC;AAOD;;GAEG;AACH,SAAgB,kBAAkB,CAC9B,KAAoB,EACpB,aAAqB,EACrB,QAAgB,wBAAwB;IAExC,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,aAAa,EAAE,KAAK,EAAE,WAAW,CAAC,CAAC;IAE/D,0BAA0B;IAC1B,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,SAAS,CAAC,EAAE,CAAC;QAC5B,EAAE,CAAC,SAAS,CAAC,SAAS,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;IACjD,CAAC;IAED,eAAe;IACf,MAAM,GAAG,GAAG,WAAW,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;IACtC,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,kBAAkB,CAAC,CAAC;IACzD,EAAE,CAAC,aAAa,CAAC,OAAO,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC;IAExC,gBAAgB;IAChB,MAAM,IAAI,GAAG,YAAY,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;IACtC,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,mBAAmB,CAAC,CAAC;IAC3D,EAAE,CAAC,aAAa,CAAC,QAAQ,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;IAE1C,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,CAAC;AACjC,CAAC;AAED;;GAEG;AACH,SAAgB,iBAAiB,CAAC,QAAgB;IAC9C,8DAA8D;IAC9D,IAAI,CAAC;QACD,MAAM,QAAQ,GAAG,OAAO,CAAC,QAAQ,CAAC;QAClC,IAAI,WAAmB,CAAC;QAExB,IAAI,QAAQ,KAAK,QAAQ,EAAE,CAAC;YACxB,WAAW,GAAG,SAAS,QAAQ,GAAG,CAAC;QACvC,CAAC;aAAM,IAAI,QAAQ,KAAK,OAAO,EAAE,CAAC;YAC9B,WAAW,GAAG,aAAa,QAAQ,GAAG,CAAC;QAC3C,CAAC;aAAM,CAAC;YACJ,WAAW,GAAG,aAAa,QAAQ,GAAG,CAAC;QAC3C,CAAC;QAED,IAAA,wBAAQ,EAAC,WAAW,EAAE,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC,CAAC;QAC3C,OAAO,IAAI,CAAC;IAChB,CAAC;IAAC,OAAO,GAAY,EAAE,CAAC;QACpB,6BAA6B;QAC7B,KAAK,GAAG,CAAC;QACT,OAAO,KAAK,CAAC;IACjB,CAAC;AACL,CAAC","sourcesContent":["/**\n * Graph Visualizer\n *\n * Generates visual representations of the architecture graph:\n * - DOT format (for Graphviz)\n * - Interactive HTML (using viz.js)\n *\n * Output files go to tmp/webpieces/ for easy viewing without committing.\n */\n\nimport * as fs from 'fs';\nimport * as path from 'path';\nimport { execSync } from 'child_process';\nimport type { EnhancedGraph } from './graph-sorter';\nimport { toError } from '../toError';\n\n/**\n * Level colors for visualization\n */\nconst LEVEL_COLORS: Record<number, string> = {\n    0: '#E8F5E9', // Light green - foundation\n    1: '#E3F2FD', // Light blue - middleware\n    2: '#FFF3E0', // Light orange - applications\n    3: '#FCE4EC', // Light pink - higher level\n};\n\n/**\n * Remove scope from name for display\n * '@scope/name' → 'name'\n * 'name' → 'name'\n */\nfunction getShortName(name: string): string {\n    return name.includes('/') ? name.split('/').pop()! : name;\n}\n\n/**\n * Generate Graphviz DOT format from the graph\n */\nexport function generateDot(graph: EnhancedGraph, title: string = 'WebPieces Architecture'): string {\n    let dot = 'digraph Architecture {\\n';\n    dot += '  rankdir=TB;\\n';\n    dot += '  node [shape=box, style=filled, fontname=\"Arial\"];\\n';\n    dot += '  edge [fontname=\"Arial\"];\\n\\n';\n\n    // Group projects by level\n    const levels: Record<number, string[]> = {};\n    for (const [project, info] of Object.entries(graph)) {\n        if (!levels[info.level]) levels[info.level] = [];\n        levels[info.level].push(project);\n    }\n\n    // Create nodes with level-based colors\n    for (const [project, info] of Object.entries(graph)) {\n        const shortName = getShortName(project);\n        const color = LEVEL_COLORS[info.level] || '#F5F5F5';\n        dot += `  \"${shortName}\" [fillcolor=\"${color}\", label=\"${shortName}\\\\n(L${info.level})\"];\\n`;\n    }\n\n    dot += '\\n';\n\n    // Create same-rank subgraphs for each level\n    for (const [level, projects] of Object.entries(levels)) {\n        dot += `  { rank=same; `;\n        projects.forEach((p) => {\n            const shortName = getShortName(p);\n            dot += `\"${shortName}\"; `;\n        });\n        dot += '}\\n';\n    }\n\n    dot += '\\n';\n\n    // Create edges (dependencies)\n    for (const [project, info] of Object.entries(graph)) {\n        const shortName = getShortName(project);\n        for (const dep of info.dependsOn || []) {\n            const depShortName = getShortName(dep);\n            dot += `  \"${shortName}\" -> \"${depShortName}\";\\n`;\n        }\n    }\n\n    dot += '\\n  labelloc=\"t\";\\n';\n    dot += `  label=\"${title}\\\\n(from architecture/dependencies.json)\";\\n`;\n    dot += '  fontsize=20;\\n';\n    dot += '}\\n';\n\n    return dot;\n}\n\n/**\n * Generate interactive HTML with embedded SVG using viz.js\n */\nexport function generateHTML(dot: string, title: string = 'WebPieces Architecture'): string {\n    const styles = generateHTMLStyles();\n    const legend = generateHTMLLegend();\n    const script = generateHTMLScript(dot);\n\n    return `<!DOCTYPE html>\n<html>\n<head>\n    <title>${title}</title>\n    <script src=\"https://cdn.jsdelivr.net/npm/viz.js@2.1.2/viz.js\"></script>\n    <script src=\"https://cdn.jsdelivr.net/npm/viz.js@2.1.2/full.render.js\"></script>\n    <style>${styles}</style>\n</head>\n<body>\n    <h1>${title}</h1>\n    ${legend}\n    <div id=\"graph\"></div>\n    <script>${script}</script>\n</body>\n</html>`;\n}\n\nfunction generateHTMLStyles(): string {\n    return `\n        body {\n            margin: 0;\n            padding: 20px;\n            font-family: Arial, sans-serif;\n            background: #f5f5f5;\n        }\n        h1 {\n            text-align: center;\n            color: #333;\n        }\n        #graph {\n            text-align: center;\n            background: white;\n            padding: 20px;\n            border-radius: 8px;\n            box-shadow: 0 2px 4px rgba(0,0,0,0.1);\n        }\n        .legend {\n            margin: 20px auto;\n            max-width: 600px;\n            padding: 15px;\n            background: white;\n            border-radius: 8px;\n            box-shadow: 0 2px 4px rgba(0,0,0,0.1);\n        }\n        .legend h2 {\n            margin-top: 0;\n        }\n        .legend-item {\n            margin: 8px 0;\n        }\n        .legend-box {\n            display: inline-block;\n            width: 20px;\n            height: 20px;\n            border: 1px solid #ccc;\n            margin-right: 10px;\n            vertical-align: middle;\n        }\n    `;\n}\n\nfunction generateHTMLLegend(): string {\n    return `<div class=\"legend\">\n        <h2>Legend</h2>\n        <div class=\"legend-item\">\n            <span class=\"legend-box\" style=\"background: #E8F5E9;\"></span>\n            <strong>Level 0:</strong> Foundation libraries (no dependencies)\n        </div>\n        <div class=\"legend-item\">\n            <span class=\"legend-box\" style=\"background: #E3F2FD;\"></span>\n            <strong>Level 1:</strong> Middleware libraries (depend on Level 0)\n        </div>\n        <div class=\"legend-item\">\n            <span class=\"legend-box\" style=\"background: #FFF3E0;\"></span>\n            <strong>Level 2:</strong> Applications (depend on Level 1)\n        </div>\n        <div class=\"legend-item\" style=\"margin-top: 15px;\">\n            <em>Note: Transitive dependencies are allowed but not shown in the graph.</em>\n        </div>\n    </div>`;\n}\n\nfunction generateHTMLScript(dot: string): string {\n    return `\n        const dot = ${JSON.stringify(dot)};\n        const viz = new Viz();\n\n        viz.renderSVGElement(dot)\n            .then(element => {\n                document.getElementById('graph').appendChild(element);\n            })\n            .catch(err => {\n                console.error(err);\n                document.getElementById('graph').innerHTML = '<pre>' + err + '</pre>';\n            });\n    `;\n}\n\ninterface VisualizationPaths {\n    dotPath: string;\n    htmlPath: string;\n}\n\n/**\n * Write visualization files to tmp/webpieces/\n */\nexport function writeVisualization(\n    graph: EnhancedGraph,\n    workspaceRoot: string,\n    title: string = 'WebPieces Architecture'\n): VisualizationPaths {\n    const outputDir = path.join(workspaceRoot, 'tmp', 'webpieces');\n\n    // Ensure directory exists\n    if (!fs.existsSync(outputDir)) {\n        fs.mkdirSync(outputDir, { recursive: true });\n    }\n\n    // Generate DOT\n    const dot = generateDot(graph, title);\n    const dotPath = path.join(outputDir, 'architecture.dot');\n    fs.writeFileSync(dotPath, dot, 'utf-8');\n\n    // Generate HTML\n    const html = generateHTML(dot, title);\n    const htmlPath = path.join(outputDir, 'architecture.html');\n    fs.writeFileSync(htmlPath, html, 'utf-8');\n\n    return { dotPath, htmlPath };\n}\n\n/**\n * Open the HTML visualization in the default browser\n */\nexport function openVisualization(htmlPath: string): boolean {\n    // eslint-disable-next-line @webpieces/no-unmanaged-exceptions\n    try {\n        const platform = process.platform;\n        let openCommand: string;\n\n        if (platform === 'darwin') {\n            openCommand = `open \"${htmlPath}\"`;\n        } else if (platform === 'win32') {\n            openCommand = `start \"\" \"${htmlPath}\"`;\n        } else {\n            openCommand = `xdg-open \"${htmlPath}\"`;\n        }\n\n        execSync(openCommand, { stdio: 'ignore' });\n        return true;\n    } catch (err: unknown) {\n        //const error = toError(err);\n        void err;\n        return false;\n    }\n}\n"]}

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

@@ -0,0 +1,40 @@
+/**
+ * Package Validator
+ *
+ * Validates that package.json dependencies match the project.json build.dependsOn
+ * This ensures the two sources of truth don't drift apart.
+ */
+/**
+ * Validation result for a single project
+ */
+export interface ProjectValidationResult {
+    project: string;
+    valid: boolean;
+    missingInPackageJson: string[];
+    extraInPackageJson: string[];
+}
+/**
+ * Overall validation result
+ */
+export interface ValidationResult {
+    valid: boolean;
+    errors: string[];
+    projectResults: ProjectValidationResult[];
+}
+/**
+ * Validate that package.json dependencies match the dependency graph
+ *
+ * For each project in the graph:
+ * - Check that all graph dependencies exist in package.json
+ * - Maps project names to package names for accurate comparison
+ *
+ * @param graph - Enhanced graph with project dependencies (uses project names)
+ * @param workspaceRoot - Absolute path to workspace root
+ * @returns Validation result with errors if any
+ */
+interface GraphEntry {
+    level: number;
+    dependsOn: string[];
+}
+export declare function validatePackageJsonDependencies(graph: Record<string, GraphEntry>, workspaceRoot: string): Promise<ValidationResult>;
+export {};