@webpieces/nx-webpieces-rules 0.4.899 → 0.4.900

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@webpieces/nx-webpieces-rules",
-  "version": "0.4.899",
+  "version": "0.4.900",
   "description": "Nx-specific webpieces validation rules, graph tooling, executors, and inference plugin.",
   "type": "commonjs",
   "main": "./src/index.js",
@@ -20,12 +20,12 @@
     "README.md"
   ],
   "dependencies": {
-    "@webpieces/api-doc-model": "0.4.899",
-    "@webpieces/core-util": "0.4.899",
-    "@webpieces/eslint-rules": "0.4.899",
-    "@webpieces/rules-config": "0.4.899",
+    "@webpieces/api-doc-model": "0.4.900",
+    "@webpieces/core-util": "0.4.900",
+    "@webpieces/eslint-rules": "0.4.900",
+    "@webpieces/rules-config": "0.4.900",
     "madge": "8.0.0",
-    "@webpieces/rules-sdk": "0.4.899"
+    "@webpieces/rules-sdk": "0.4.900"
   },
   "peerDependencies": {
     "@nx/devkit": ">=18.0.0"
@@ -41,7 +41,7 @@
     "access": "public"
   },
   "devDependencies": {
-    "@webpieces/tooling-testkit": "0.4.899"
+    "@webpieces/tooling-testkit": "0.4.900"
   },
   "types": "./src/index.d.ts",
   "bin": {

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

@@ -10,7 +10,9 @@
  *                             This is what build order follows via `^build`.
  *  - generateReducedGraph() → transitive reduction of the full graph: the minimal
  *                             edge set with identical reachability, used as the
- *                             architecture VIEW written to dependencies.json.
+ *                             architecture VIEW written to dependencies.json. A path
+ *                             through a `drawOnGraph:false` project never removes a
+ *                             visible edge (see visible-transitive-reduction.ts).
  */
 /**
  * Build the full dependency graph from nx's project graph.

package/src/lib/graph-generator.js

@@ -11,14 +11,18 @@
  *                             This is what build order follows via `^build`.
  *  - generateReducedGraph() → transitive reduction of the full graph: the minimal
  *                             edge set with identical reachability, used as the
- *                             architecture VIEW written to dependencies.json.
+ *                             architecture VIEW written to dependencies.json. A path
+ *                             through a `drawOnGraph:false` project never removes a
+ *                             visible edge (see visible-transitive-reduction.ts).
  */
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.generateRawGraph = generateRawGraph;
 exports.generateGraph = generateGraph;
 exports.generateReducedGraph = generateReducedGraph;
 const devkit_1 = require("@nx/devkit");
-const transitive_reduction_1 = require("./transitive-reduction");
+const graph_metadata_1 = require("./graph-metadata");
+const draw_on_graph_resolver_1 = require("./draw-on-graph-resolver");
+const visible_transitive_reduction_1 = require("./visible-transitive-reduction");
 /**
  * Projects to exclude from graph validation (tools, configs, etc.)
  */
@@ -74,6 +78,21 @@ async function generateGraph() {
  */
 async function generateReducedGraph() {
     const full = await generateGraph();
-    return (0, transitive_reduction_1.transitiveReduction)(full);
+    const hidden = await new HiddenProjectFinder().find();
+    return new visible_transitive_reduction_1.VisibleTransitiveReduction().reduce(full, hidden);
+}
+/**
+ * The projects tagged `drawOnGraph:false`. A malformed tag is NOT reported here: enrichGraph
+ * reports it with every other metadata problem, and such a project is treated as drawn.
+ */
+class HiddenProjectFinder {
+    async find() {
+        const hidden = new Set();
+        for (const info of (await (0, graph_metadata_1.collectProjectInfo)()).values()) {
+            if ((0, draw_on_graph_resolver_1.resolveDrawOnGraph)(info).drawOnGraph === false)
+                hidden.add(info.name);
+        }
+        return hidden;
+    }
 }
 //# sourceMappingURL=graph-generator.js.map

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

@@ -1 +1 @@
-{"version":3,"file":"graph-generator.js","sourceRoot":"","sources":["../../../../../../packages/tooling/nx-webpieces-rules/src/lib/graph-generator.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;GAaG;;AAoBH,4CA0BC;AAKD,sCAEC;AAUD,oDAGC;AAhED,uCAAqD;AACrD,iEAA6D;AAE7D;;GAEG;AACH,MAAM,iBAAiB,GAAG,IAAI,GAAG,CAAS,CAAC,cAAc,CAAC,CAAC,CAAC;AAE5D;;;;;;;;;GASG;AACI,KAAK,UAAU,gBAAgB;IAClC,MAAM,YAAY,GAAG,MAAM,IAAA,gCAAuB,GAAE,CAAC;IACrD,MAAM,iBAAiB,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC;IAEnE,MAAM,OAAO,GAA6B,EAAE,CAAC;IAE7C,KAAK,MAAM,WAAW,IAAI,iBAAiB,EAAE,CAAC;QAC1C,IAAI,iBAAiB,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,CAAC;YACrC,SAAS;QACb,CAAC;QAED,MAAM,KAAK,GAAG,YAAY,CAAC,YAAY,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC;QAC3D,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;QAC/B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACvB,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;YAC3B,wEAAwE;YACxE,IAAI,MAAM,KAAK,WAAW;gBAAE,SAAS;YACrC,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,MAAM,CAAC;gBAAE,SAAS,CAAC,uBAAuB;YACrE,IAAI,iBAAiB,CAAC,GAAG,CAAC,MAAM,CAAC;gBAAE,SAAS;YAC5C,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACrB,CAAC;QAED,OAAO,CAAC,WAAW,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC;IACnD,CAAC;IAED,OAAO,OAAO,CAAC;AACnB,CAAC;AAED;;GAEG;AACI,KAAK,UAAU,aAAa;IAC/B,OAAO,gBAAgB,EAAE,CAAC;AAC9B,CAAC;AAED;;;;;;;GAOG;AACI,KAAK,UAAU,oBAAoB;IACtC,MAAM,IAAI,GAAG,MAAM,aAAa,EAAE,CAAC;IACnC,OAAO,IAAA,0CAAmB,EAAC,IAAI,CAAC,CAAC;AACrC,CAAC","sourcesContent":["/**\n * Graph Generator\n *\n * Builds the workspace dependency graph from nx's OWN project graph\n * (createProjectGraphAsync). nx already derives those edges from BOTH source\n * imports AND package.json workspace deps, so there is no hand-maintained edge\n * list and no separate import scan — we consume what nx already computed.\n *\n *  - generateGraph()        → the FULL graph (every workspace edge nx knows).\n *                             This is what build order follows via `^build`.\n *  - generateReducedGraph() → transitive reduction of the full graph: the minimal\n *                             edge set with identical reachability, used as the\n *                             architecture VIEW written to dependencies.json.\n */\n\nimport { createProjectGraphAsync } from '@nx/devkit';\nimport { transitiveReduction } from './transitive-reduction';\n\n/**\n * Projects to exclude from graph validation (tools, configs, etc.)\n */\nconst EXCLUDED_PROJECTS = new Set<string>(['architecture']);\n\n/**\n * Build the full dependency graph from nx's project graph.\n *\n * nx's `projectGraph.nodes` are the workspace projects; `projectGraph.dependencies`\n * holds every edge nx inferred (imports + package.json). We keep only edges whose\n * target is another workspace project (dropping `npm:` externals) and drop excluded\n * projects.\n *\n * Returns: { projectName: [workspaceDependencyNames] } (deps sorted, deduped)\n */\nexport async function generateRawGraph(): Promise<Record<string, string[]>> {\n    const projectGraph = await createProjectGraphAsync();\n    const workspaceProjects = new Set(Object.keys(projectGraph.nodes));\n\n    const rawDeps: Record<string, string[]> = {};\n\n    for (const projectName of workspaceProjects) {\n        if (EXCLUDED_PROJECTS.has(projectName)) {\n            continue;\n        }\n\n        const edges = projectGraph.dependencies[projectName] ?? [];\n        const deps = new Set<string>();\n        for (const edge of edges) {\n            const target = edge.target;\n            // Keep only workspace→workspace edges; skip self and excluded projects.\n            if (target === projectName) continue;\n            if (!workspaceProjects.has(target)) continue; // drops npm: externals\n            if (EXCLUDED_PROJECTS.has(target)) continue;\n            deps.add(target);\n        }\n\n        rawDeps[projectName] = Array.from(deps).sort();\n    }\n\n    return rawDeps;\n}\n\n/**\n * The full workspace dependency graph (every edge nx knows).\n */\nexport async function generateGraph(): Promise<Record<string, string[]>> {\n    return generateRawGraph();\n}\n\n/**\n * The transitively-reduced view of the full graph. This is the canonical\n * \"architecture graph\" written to and validated against dependencies.json.\n *\n * Reduction is undefined on cycles; callers that care about cycles\n * (validate-no-architecture-cycles) run on the FULL graph and throw first. For the\n * view executors, the downstream topological sort also throws on any cycle.\n */\nexport async function generateReducedGraph(): Promise<Record<string, string[]>> {\n    const full = await generateGraph();\n    return transitiveReduction(full);\n}\n"]}
+{"version":3,"file":"graph-generator.js","sourceRoot":"","sources":["../../../../../../packages/tooling/nx-webpieces-rules/src/lib/graph-generator.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;GAeG;;AAsBH,4CA0BC;AAKD,sCAEC;AAUD,oDAIC;AAnED,uCAAqD;AACrD,qDAAsD;AACtD,qEAA8D;AAC9D,iFAA4E;AAE5E;;GAEG;AACH,MAAM,iBAAiB,GAAG,IAAI,GAAG,CAAS,CAAC,cAAc,CAAC,CAAC,CAAC;AAE5D;;;;;;;;;GASG;AACI,KAAK,UAAU,gBAAgB;IAClC,MAAM,YAAY,GAAG,MAAM,IAAA,gCAAuB,GAAE,CAAC;IACrD,MAAM,iBAAiB,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC;IAEnE,MAAM,OAAO,GAA6B,EAAE,CAAC;IAE7C,KAAK,MAAM,WAAW,IAAI,iBAAiB,EAAE,CAAC;QAC1C,IAAI,iBAAiB,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,CAAC;YACrC,SAAS;QACb,CAAC;QAED,MAAM,KAAK,GAAG,YAAY,CAAC,YAAY,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC;QAC3D,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;QAC/B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACvB,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;YAC3B,wEAAwE;YACxE,IAAI,MAAM,KAAK,WAAW;gBAAE,SAAS;YACrC,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,MAAM,CAAC;gBAAE,SAAS,CAAC,uBAAuB;YACrE,IAAI,iBAAiB,CAAC,GAAG,CAAC,MAAM,CAAC;gBAAE,SAAS;YAC5C,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACrB,CAAC;QAED,OAAO,CAAC,WAAW,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC;IACnD,CAAC;IAED,OAAO,OAAO,CAAC;AACnB,CAAC;AAED;;GAEG;AACI,KAAK,UAAU,aAAa;IAC/B,OAAO,gBAAgB,EAAE,CAAC;AAC9B,CAAC;AAED;;;;;;;GAOG;AACI,KAAK,UAAU,oBAAoB;IACtC,MAAM,IAAI,GAAG,MAAM,aAAa,EAAE,CAAC;IACnC,MAAM,MAAM,GAAG,MAAM,IAAI,mBAAmB,EAAE,CAAC,IAAI,EAAE,CAAC;IACtD,OAAO,IAAI,yDAA0B,EAAE,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;AACjE,CAAC;AAED;;;GAGG;AACH,MAAM,mBAAmB;IACrB,KAAK,CAAC,IAAI;QACN,MAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAC;QACjC,KAAK,MAAM,IAAI,IAAI,CAAC,MAAM,IAAA,mCAAkB,GAAE,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC;YACvD,IAAI,IAAA,2CAAkB,EAAC,IAAI,CAAC,CAAC,WAAW,KAAK,KAAK;gBAAE,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9E,CAAC;QACD,OAAO,MAAM,CAAC;IAClB,CAAC;CACJ","sourcesContent":["/**\n * Graph Generator\n *\n * Builds the workspace dependency graph from nx's OWN project graph\n * (createProjectGraphAsync). nx already derives those edges from BOTH source\n * imports AND package.json workspace deps, so there is no hand-maintained edge\n * list and no separate import scan — we consume what nx already computed.\n *\n *  - generateGraph()        → the FULL graph (every workspace edge nx knows).\n *                             This is what build order follows via `^build`.\n *  - generateReducedGraph() → transitive reduction of the full graph: the minimal\n *                             edge set with identical reachability, used as the\n *                             architecture VIEW written to dependencies.json. A path\n *                             through a `drawOnGraph:false` project never removes a\n *                             visible edge (see visible-transitive-reduction.ts).\n */\n\nimport { createProjectGraphAsync } from '@nx/devkit';\nimport { collectProjectInfo } from './graph-metadata';\nimport { resolveDrawOnGraph } from './draw-on-graph-resolver';\nimport { VisibleTransitiveReduction } from './visible-transitive-reduction';\n\n/**\n * Projects to exclude from graph validation (tools, configs, etc.)\n */\nconst EXCLUDED_PROJECTS = new Set<string>(['architecture']);\n\n/**\n * Build the full dependency graph from nx's project graph.\n *\n * nx's `projectGraph.nodes` are the workspace projects; `projectGraph.dependencies`\n * holds every edge nx inferred (imports + package.json). We keep only edges whose\n * target is another workspace project (dropping `npm:` externals) and drop excluded\n * projects.\n *\n * Returns: { projectName: [workspaceDependencyNames] } (deps sorted, deduped)\n */\nexport async function generateRawGraph(): Promise<Record<string, string[]>> {\n    const projectGraph = await createProjectGraphAsync();\n    const workspaceProjects = new Set(Object.keys(projectGraph.nodes));\n\n    const rawDeps: Record<string, string[]> = {};\n\n    for (const projectName of workspaceProjects) {\n        if (EXCLUDED_PROJECTS.has(projectName)) {\n            continue;\n        }\n\n        const edges = projectGraph.dependencies[projectName] ?? [];\n        const deps = new Set<string>();\n        for (const edge of edges) {\n            const target = edge.target;\n            // Keep only workspace→workspace edges; skip self and excluded projects.\n            if (target === projectName) continue;\n            if (!workspaceProjects.has(target)) continue; // drops npm: externals\n            if (EXCLUDED_PROJECTS.has(target)) continue;\n            deps.add(target);\n        }\n\n        rawDeps[projectName] = Array.from(deps).sort();\n    }\n\n    return rawDeps;\n}\n\n/**\n * The full workspace dependency graph (every edge nx knows).\n */\nexport async function generateGraph(): Promise<Record<string, string[]>> {\n    return generateRawGraph();\n}\n\n/**\n * The transitively-reduced view of the full graph. This is the canonical\n * \"architecture graph\" written to and validated against dependencies.json.\n *\n * Reduction is undefined on cycles; callers that care about cycles\n * (validate-no-architecture-cycles) run on the FULL graph and throw first. For the\n * view executors, the downstream topological sort also throws on any cycle.\n */\nexport async function generateReducedGraph(): Promise<Record<string, string[]>> {\n    const full = await generateGraph();\n    const hidden = await new HiddenProjectFinder().find();\n    return new VisibleTransitiveReduction().reduce(full, hidden);\n}\n\n/**\n * The projects tagged `drawOnGraph:false`. A malformed tag is NOT reported here: enrichGraph\n * reports it with every other metadata problem, and such a project is treated as drawn.\n */\nclass HiddenProjectFinder {\n    async find(): Promise<Set<string>> {\n        const hidden = new Set<string>();\n        for (const info of (await collectProjectInfo()).values()) {\n            if (resolveDrawOnGraph(info).drawOnGraph === false) hidden.add(info.name);\n        }\n        return hidden;\n    }\n}\n"]}

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

@@ -0,0 +1,33 @@
+/**
+ * Visible Transitive Reduction (#1215)
+ *
+ * The plain transitive reduction drops a direct edge A → C whenever a longer path A → B → C exists.
+ * That is correct on the FULL graph, but the rendered graphs then omit every project tagged
+ * `drawOnGraph:false`. When B is such a hidden project, hiding it removes the only path the
+ * reduction kept, and A → C vanishes from the picture although A really depends on C directly.
+ * That is exactly how `rules-sdk` rendered as an orphan: every rules package reaches it through the
+ * hidden, test-only `tooling-testkit`, so every direct edge into it was reduced away.
+ *
+ * So the reduction is computed TWICE and unioned:
+ *  - over the full graph, which keeps every edge that touches a hidden project (the JSON stays a
+ *    complete data view, hidden projects included);
+ *  - over the VISIBLE graph only (hidden projects and their edges removed first), which decides
+ *    which visible → visible edges are drawn. A path through a hidden project never makes a visible
+ *    edge redundant.
+ *
+ * Every visible → visible edge the full reduction keeps is also kept by the visible reduction (no
+ * sibling reaches its target in the full graph, so none does in a subgraph), so the union only ADDS
+ * the edges that were wrongly removed through a hidden project. Both halves are subsets of the full
+ * graph and the full reduction alone already preserves reachability, so the union does too — and
+ * every added edge is implied by a longer existing path, so no dependency level changes.
+ */
+export declare class VisibleTransitiveReduction {
+    /**
+     * @param full - Full DAG as { project: [directChildren] }
+     * @param hidden - Projects tagged `drawOnGraph:false`
+     * @returns Reduced graph { project: [children] } (children sorted)
+     */
+    reduce(full: Record<string, string[]>, hidden: ReadonlySet<string>): Record<string, string[]>;
+    /** The full graph with every hidden project, and every edge touching one, removed. */
+    private visibleSubgraph;
+}

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

@@ -0,0 +1,60 @@
+"use strict";
+/**
+ * Visible Transitive Reduction (#1215)
+ *
+ * The plain transitive reduction drops a direct edge A → C whenever a longer path A → B → C exists.
+ * That is correct on the FULL graph, but the rendered graphs then omit every project tagged
+ * `drawOnGraph:false`. When B is such a hidden project, hiding it removes the only path the
+ * reduction kept, and A → C vanishes from the picture although A really depends on C directly.
+ * That is exactly how `rules-sdk` rendered as an orphan: every rules package reaches it through the
+ * hidden, test-only `tooling-testkit`, so every direct edge into it was reduced away.
+ *
+ * So the reduction is computed TWICE and unioned:
+ *  - over the full graph, which keeps every edge that touches a hidden project (the JSON stays a
+ *    complete data view, hidden projects included);
+ *  - over the VISIBLE graph only (hidden projects and their edges removed first), which decides
+ *    which visible → visible edges are drawn. A path through a hidden project never makes a visible
+ *    edge redundant.
+ *
+ * Every visible → visible edge the full reduction keeps is also kept by the visible reduction (no
+ * sibling reaches its target in the full graph, so none does in a subgraph), so the union only ADDS
+ * the edges that were wrongly removed through a hidden project. Both halves are subsets of the full
+ * graph and the full reduction alone already preserves reachability, so the union does too — and
+ * every added edge is implied by a longer existing path, so no dependency level changes.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.VisibleTransitiveReduction = void 0;
+const transitive_reduction_1 = require("./transitive-reduction");
+class VisibleTransitiveReduction {
+    /**
+     * @param full - Full DAG as { project: [directChildren] }
+     * @param hidden - Projects tagged `drawOnGraph:false`
+     * @returns Reduced graph { project: [children] } (children sorted)
+     */
+    reduce(full, hidden) {
+        const reduced = (0, transitive_reduction_1.transitiveReduction)(full);
+        if (hidden.size === 0)
+            return reduced;
+        const visibleReduced = (0, transitive_reduction_1.transitiveReduction)(this.visibleSubgraph(full, hidden));
+        const result = {};
+        for (const project of Object.keys(reduced)) {
+            const children = new Set(reduced[project]);
+            for (const child of visibleReduced[project] ?? [])
+                children.add(child);
+            result[project] = Array.from(children).sort();
+        }
+        return result;
+    }
+    /** The full graph with every hidden project, and every edge touching one, removed. */
+    visibleSubgraph(full, hidden) {
+        const visible = {};
+        for (const project of Object.keys(full)) {
+            if (hidden.has(project))
+                continue;
+            visible[project] = (full[project] ?? []).filter((dep) => !hidden.has(dep));
+        }
+        return visible;
+    }
+}
+exports.VisibleTransitiveReduction = VisibleTransitiveReduction;
+//# sourceMappingURL=visible-transitive-reduction.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"visible-transitive-reduction.js","sourceRoot":"","sources":["../../../../../../packages/tooling/nx-webpieces-rules/src/lib/visible-transitive-reduction.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;;;;;GAsBG;;;AAEH,iEAA6D;AAE7D,MAAa,0BAA0B;IACnC;;;;OAIG;IACH,MAAM,CAAC,IAA8B,EAAE,MAA2B;QAC9D,MAAM,OAAO,GAAG,IAAA,0CAAmB,EAAC,IAAI,CAAC,CAAC;QAC1C,IAAI,MAAM,CAAC,IAAI,KAAK,CAAC;YAAE,OAAO,OAAO,CAAC;QAEtC,MAAM,cAAc,GAAG,IAAA,0CAAmB,EAAC,IAAI,CAAC,eAAe,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC;QAC/E,MAAM,MAAM,GAA6B,EAAE,CAAC;QAC5C,KAAK,MAAM,OAAO,IAAI,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC;YACzC,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAS,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC;YACnD,KAAK,MAAM,KAAK,IAAI,cAAc,CAAC,OAAO,CAAC,IAAI,EAAE;gBAAE,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YACvE,MAAM,CAAC,OAAO,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QAClD,CAAC;QACD,OAAO,MAAM,CAAC;IAClB,CAAC;IAED,sFAAsF;IAC9E,eAAe,CACnB,IAA8B,EAC9B,MAA2B;QAE3B,MAAM,OAAO,GAA6B,EAAE,CAAC;QAC7C,KAAK,MAAM,OAAO,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;YACtC,IAAI,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC;gBAAE,SAAS;YAClC,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,GAAW,EAAW,EAAE,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QAChG,CAAC;QACD,OAAO,OAAO,CAAC;IACnB,CAAC;CACJ;AAhCD,gEAgCC","sourcesContent":["/**\n * Visible Transitive Reduction (#1215)\n *\n * The plain transitive reduction drops a direct edge A → C whenever a longer path A → B → C exists.\n * That is correct on the FULL graph, but the rendered graphs then omit every project tagged\n * `drawOnGraph:false`. When B is such a hidden project, hiding it removes the only path the\n * reduction kept, and A → C vanishes from the picture although A really depends on C directly.\n * That is exactly how `rules-sdk` rendered as an orphan: every rules package reaches it through the\n * hidden, test-only `tooling-testkit`, so every direct edge into it was reduced away.\n *\n * So the reduction is computed TWICE and unioned:\n *  - over the full graph, which keeps every edge that touches a hidden project (the JSON stays a\n *    complete data view, hidden projects included);\n *  - over the VISIBLE graph only (hidden projects and their edges removed first), which decides\n *    which visible → visible edges are drawn. A path through a hidden project never makes a visible\n *    edge redundant.\n *\n * Every visible → visible edge the full reduction keeps is also kept by the visible reduction (no\n * sibling reaches its target in the full graph, so none does in a subgraph), so the union only ADDS\n * the edges that were wrongly removed through a hidden project. Both halves are subsets of the full\n * graph and the full reduction alone already preserves reachability, so the union does too — and\n * every added edge is implied by a longer existing path, so no dependency level changes.\n */\n\nimport { transitiveReduction } from './transitive-reduction';\n\nexport class VisibleTransitiveReduction {\n    /**\n     * @param full - Full DAG as { project: [directChildren] }\n     * @param hidden - Projects tagged `drawOnGraph:false`\n     * @returns Reduced graph { project: [children] } (children sorted)\n     */\n    reduce(full: Record<string, string[]>, hidden: ReadonlySet<string>): Record<string, string[]> {\n        const reduced = transitiveReduction(full);\n        if (hidden.size === 0) return reduced;\n\n        const visibleReduced = transitiveReduction(this.visibleSubgraph(full, hidden));\n        const result: Record<string, string[]> = {};\n        for (const project of Object.keys(reduced)) {\n            const children = new Set<string>(reduced[project]);\n            for (const child of visibleReduced[project] ?? []) children.add(child);\n            result[project] = Array.from(children).sort();\n        }\n        return result;\n    }\n\n    /** The full graph with every hidden project, and every edge touching one, removed. */\n    private visibleSubgraph(\n        full: Record<string, string[]>,\n        hidden: ReadonlySet<string>,\n    ): Record<string, string[]> {\n        const visible: Record<string, string[]> = {};\n        for (const project of Object.keys(full)) {\n            if (hidden.has(project)) continue;\n            visible[project] = (full[project] ?? []).filter((dep: string): boolean => !hidden.has(dep));\n        }\n        return visible;\n    }\n}\n"]}