@webpieces/nx-webpieces-rules 0.4.898 → 0.4.900

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

@@ -24,6 +24,8 @@
  *  - ProductPalette — the Product color mode's colors: a fixed palette of eight assigned in sorted
  *    product-name order, a neutral fill for a box shared by EVERY product, and a dashed white box for
  *    one in no product.
+ *  - ProductBoundary — which dependency edges cross from one product into another (#1204), drawn
+ *    dashed in the target product's color in the Product color mode.
  *
  * Membership is stable per checkout (it depends on tags and edges, never on a diff), so it is written
  * into the committed dependencies.json / runtime-dependencies.json rather than into a sidecar.
@@ -61,6 +63,18 @@ export declare class ProductPalette {
     /** True when some product is past the palette's eight, so the legend must say it is neutral. */
     overflows(): boolean;
 }
+/**
+ * Where a dependency edge crosses a product boundary (#1204), for the Product color mode: an edge
+ * A -> B crosses when B does not carry every product of A, and it is drawn dashed in the color of the
+ * product it crosses INTO, so the boundaries read at a glance while same-product edges stay quiet.
+ * Whether a crossing is ALLOWED is the product dependency matrix's call (product-dependencies.ts):
+ * with `product-tags` ON, generation already refused every crossing the matrix does not allow, so
+ * every crossing drawn is an allowed one.
+ */
+export declare class ProductBoundary {
+    /** The product the edge crosses into, or null when the target carries every product of the source. */
+    crossedInto(from: readonly string[], to: readonly string[]): string | null;
+}
 /**
  * The architecture graph's product membership: declared seeds walked DOWN over `dependsOn`, where a
  * project's own declared products are final.

package/src/lib/graph-products.js

@@ -25,12 +25,14 @@
  *  - ProductPalette — the Product color mode's colors: a fixed palette of eight assigned in sorted
  *    product-name order, a neutral fill for a box shared by EVERY product, and a dashed white box for
  *    one in no product.
+ *  - ProductBoundary — which dependency edges cross from one product into another (#1204), drawn
+ *    dashed in the target product's color in the Product color mode.
  *
  * Membership is stable per checkout (it depends on tags and edges, never on a diff), so it is written
  * into the committed dependencies.json / runtime-dependencies.json rather than into a sidecar.
  */
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.RuntimeProductMembership = exports.ProductMembership = exports.ProductPalette = exports.PRODUCT_NONE_BORDER = exports.PRODUCT_NONE_FILL = exports.PRODUCT_SHARED_FILL = exports.PRODUCT_PALETTE_SIZE = exports.ProductColor = void 0;
+exports.RuntimeProductMembership = exports.ProductMembership = exports.ProductBoundary = exports.ProductPalette = exports.PRODUCT_NONE_BORDER = exports.PRODUCT_NONE_FILL = exports.PRODUCT_SHARED_FILL = exports.PRODUCT_PALETTE_SIZE = exports.ProductColor = void 0;
 // The same two text colors graph-color-modes.ts writes on every fill. Spelled here rather than
 // imported because graph-color-modes.ts imports THIS file (for the palette), and a file-import cycle
 // is refused by `no-file-import-cycles`.
@@ -107,6 +109,25 @@ class ProductPalette {
     }
 }
 exports.ProductPalette = ProductPalette;
+/**
+ * Where a dependency edge crosses a product boundary (#1204), for the Product color mode: an edge
+ * A -> B crosses when B does not carry every product of A, and it is drawn dashed in the color of the
+ * product it crosses INTO, so the boundaries read at a glance while same-product edges stay quiet.
+ * Whether a crossing is ALLOWED is the product dependency matrix's call (product-dependencies.ts):
+ * with `product-tags` ON, generation already refused every crossing the matrix does not allow, so
+ * every crossing drawn is an allowed one.
+ */
+class ProductBoundary {
+    /** The product the edge crosses into, or null when the target carries every product of the source. */
+    crossedInto(from, to) {
+        if (from.length === 0 || to.length === 0)
+            return null;
+        if (from.every((product) => to.includes(product)))
+            return null;
+        return to.find((product) => !from.includes(product)) ?? to[0];
+    }
+}
+exports.ProductBoundary = ProductBoundary;
 /**
  * The architecture graph's product membership: declared seeds walked DOWN over `dependsOn`, where a
  * project's own declared products are final.

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

@@ -1 +1 @@
-{"version":3,"file":"graph-products.js","sourceRoot":"","sources":["../../../../../../packages/tooling/nx-webpieces-rules/src/lib/graph-products.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6BG;;;AAKH,+FAA+F;AAC/F,qGAAqG;AACrG,yCAAyC;AACzC,MAAM,SAAS,GAAG,SAAS,CAAC;AAC5B,MAAM,UAAU,GAAG,SAAS,CAAC;AAE7B,2EAA2E;AAC3E,MAAa,YAAY;IAED;IACA;IACA;IAEA;IALpB,YACoB,OAAe,EACf,KAAa,EACb,SAAiB;IACjC,4FAA4F;IAC5E,SAAkB;QAJlB,YAAO,GAAP,OAAO,CAAQ;QACf,UAAK,GAAL,KAAK,CAAQ;QACb,cAAS,GAAT,SAAS,CAAQ;QAEjB,cAAS,GAAT,SAAS,CAAS;IACnC,CAAC;CACP;AARD,oCAQC;AAED,iGAAiG;AACjG,MAAM,cAAc,GAA2C;IAC3D,CAAC,SAAS,EAAE,UAAU,CAAC;IACvB,CAAC,SAAS,EAAE,SAAS,CAAC;IACtB,CAAC,SAAS,EAAE,UAAU,CAAC;IACvB,CAAC,SAAS,EAAE,SAAS,CAAC;IACtB,CAAC,SAAS,EAAE,UAAU,CAAC;IACvB,CAAC,SAAS,EAAE,SAAS,CAAC;IACtB,CAAC,SAAS,EAAE,UAAU,CAAC;IACvB,CAAC,SAAS,EAAE,SAAS,CAAC;CACzB,CAAC;AAEF,6FAA6F;AAChF,QAAA,oBAAoB,GAAG,cAAc,CAAC,MAAM,CAAC;AAE1D,iFAAiF;AACpE,QAAA,mBAAmB,GAAG,SAAS,CAAC;AAC7C,wDAAwD;AAC3C,QAAA,iBAAiB,GAAG,SAAS,CAAC;AAC9B,QAAA,mBAAmB,GAAG,SAAS,CAAC;AAE7C,MAAa,cAAc;IACvB,2DAA2D;IAClD,MAAM,CAAiB;IAEhC,YAAY,QAA2B;QACnC,MAAM,MAAM,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QAC7C,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,OAAe,EAAE,KAAa,EAAgB,EAAE;YACtE,MAAM,KAAK,GAAG,cAAc,CAAC,KAAK,CAAC,CAAC;YACpC,IAAI,KAAK,KAAK,SAAS;gBAAE,OAAO,IAAI,YAAY,CAAC,OAAO,EAAE,2BAAmB,EAAE,SAAS,EAAE,KAAK,CAAC,CAAC;YACjG,OAAO,IAAI,YAAY,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;QAC/D,CAAC,CAAC,CAAC;IACP,CAAC;IAED,uEAAuE;IACvE,8EAA8E;IAC9E,MAAM,CAAC,SAAS,CAAC,KAAoB;QACjC,MAAM,GAAG,GAAa,EAAE,CAAC;QACzB,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC;YAAE,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,IAAI,EAAE,CAAC,CAAC,CAAC;QAC9E,OAAO,IAAI,cAAc,CAAC,GAAG,CAAC,CAAC;IACnC,CAAC;IAED,KAAK;QACD,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,KAAmB,EAAU,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;IAC3E,CAAC;IAED,OAAO,CAAC,OAAe;QACnB,OAAO,CACH,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,KAAmB,EAAW,EAAE,CAAC,KAAK,CAAC,OAAO,KAAK,OAAO,CAAC;YAC7E,IAAI,YAAY,CAAC,OAAO,EAAE,2BAAmB,EAAE,SAAS,EAAE,KAAK,CAAC,CACnE,CAAC;IACN,CAAC;IAED,sFAAsF;IACtF,WAAW,CAAC,QAA2B;QACnC,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,KAAmB,EAAW,EAAE,CAAC,QAAQ,CAAC,QAAQ,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;IAC3H,CAAC;IAED,gGAAgG;IAChG,SAAS;QACL,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,KAAmB,EAAW,EAAE,CAAC,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;IAChF,CAAC;CACJ;AAzCD,wCAyCC;AAED;;;GAGG;AACH,MAAa,iBAAiB;IAC1B;;;;;OAKG;IACH,OAAO,CAAC,KAA6C,EAAE,KAAoB;QACvE,MAAM,QAAQ,GAAG,IAAI,GAAG,EAA6B,CAAC;QACtD,KAAK,CAAC,OAAO,CAAC,CAAC,QAA2B,EAAE,IAAY,EAAQ,EAAE;YAC9D,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,KAAK,SAAS;gBAAE,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;QACvF,CAAC,CAAC,CAAC;QACH,MAAM,OAAO,GAAG,IAAI,GAAG,EAAuB,CAAC;QAC/C,QAAQ,CAAC,OAAO,CAAC,CAAC,QAA2B,EAAE,IAAY,EAAQ,EAAE;YACjE,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC;QACzC,CAAC,CAAC,CAAC;QACH,QAAQ,CAAC,OAAO,CAAC,CAAC,QAA2B,EAAE,IAAY,EAAQ,EAAE;YACjE,KAAK,MAAM,OAAO,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,KAAK,EAAE,QAAQ,CAAC,EAAE,CAAC;gBACxD,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,IAAI,GAAG,EAAU,CAAC;gBACtD,KAAK,MAAM,OAAO,IAAI,QAAQ;oBAAE,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;gBACjD,OAAO,CAAC,GAAG,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;YAC9B,CAAC;QACL,CAAC,CAAC,CAAC;QACH,MAAM,MAAM,GAAG,IAAI,GAAG,EAAoB,CAAC;QAC3C,OAAO,CAAC,OAAO,CAAC,CAAC,GAAgB,EAAE,OAAe,EAAQ,EAAE;YACxD,MAAM,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;QACzC,CAAC,CAAC,CAAC;QACH,OAAO,MAAM,CAAC;IAClB,CAAC;IAED;;;OAGG;IACK,OAAO,CAAC,IAAY,EAAE,KAAoB,EAAE,QAAgD;QAChG,MAAM,IAAI,GAAG,IAAI,GAAG,CAAS,CAAC,IAAI,CAAC,CAAC,CAAC;QACrC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,KAAK,GAAG,CAAC,IAAI,CAAC,CAAC;QACrB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACtB,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,EAAY,CAAC;YACtC,KAAK,MAAM,GAAG,IAAI,KAAK,CAAC,OAAO,CAAC,EAAE,SAAS,IAAI,EAAE,EAAE,CAAC;gBAChD,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;oBAAE,SAAS;gBAC5B,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBACd,IAAI,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC;oBAAE,SAAS;gBAChC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBACjB,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACpB,CAAC;QACL,CAAC;QACD,OAAO,OAAO,CAAC;IACnB,CAAC;CACJ;AAlDD,8CAkDC;AAED;;;GAGG;AACH,MAAa,wBAAwB;IACjC;;;;;;OAMG;IACH,KAAK,CAAC,KAAmB,EAAE,QAAuB;QAC9C,MAAM,KAAK,GAAG,IAAI,GAAG,EAA6B,CAAC;QACnD,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC;YAC7C,MAAM,GAAG,GAAG,QAAQ,CAAC,IAAI,CAAC,EAAE,QAAQ,IAAI,EAAE,CAAC;YAC3C,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC;gBAAE,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QAC7C,CAAC;QACD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAuB,CAAC;QAC/C,KAAK,CAAC,OAAO,CAAC,CAAC,GAAsB,EAAE,IAAY,EAAQ,EAAE;YACzD,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QACpC,CAAC,CAAC,CAAC;QACH,KAAK,CAAC,OAAO,CAAC,CAAC,GAAsB,EAAE,IAAY,EAAQ,EAAE;YACzD,KAAK,MAAM,OAAO,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,KAAK,EAAE,KAAK,CAAC,EAAE,CAAC;gBACrD,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,IAAI,GAAG,EAAU,CAAC;gBACtD,KAAK,MAAM,OAAO,IAAI,GAAG;oBAAE,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;gBAC5C,OAAO,CAAC,GAAG,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;YAC9B,CAAC;QACL,CAAC,CAAC,CAAC;QACH,OAAO,CAAC,OAAO,CAAC,CAAC,GAAgB,EAAE,IAAY,EAAQ,EAAE;YACrD,MAAM,OAAO,GAAG,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;YACrC,IAAI,OAAO,KAAK,SAAS;gBAAE,OAAO,CAAC,QAAQ,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;QAClE,CAAC,CAAC,CAAC;IACP,CAAC;IAED,qHAAqH;IAC7G,OAAO,CAAC,IAAY,EAAE,KAAmB,EAAE,KAA6C;QAC5F,MAAM,IAAI,GAAG,IAAI,GAAG,CAAS,CAAC,IAAI,CAAC,CAAC,CAAC;QACrC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,KAAK,GAAG,CAAC,IAAI,CAAC,CAAC;QACrB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACtB,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,EAAY,CAAC;YACnC,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC;gBAC3C,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,SAAS;oBAAE,SAAS;gBACnE,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;gBACf,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC;oBAAE,SAAS;gBAC9B,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;gBAClB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACrB,CAAC;QACL,CAAC;QACD,OAAO,OAAO,CAAC;IACnB,CAAC;IAED,kGAAkG;IAC1F,OAAO,CAAC,IAAY,EAAE,KAAmB;QAC7C,MAAM,OAAO,GAAa,EAAE,CAAC;QAC7B,KAAK,MAAM,GAAG,IAAI,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,SAAS,IAAI,EAAE,EAAE,CAAC;YACtD,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAC5B,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBAClB,SAAS;YACb,CAAC;YACD,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,UAAU,IAAI,EAAE,CAAC,CAAC,CAAC;QAClF,CAAC;QACD,OAAO,OAAO,CAAC;IACnB,CAAC;CACJ;AA7DD,4DA6DC","sourcesContent":["/**\n * Products on the architecture graphs (#1179).\n *\n * A monorepo can hold several PRODUCTS, each with its own clients and servers. A product is declared\n * on its entry points with the nx tag `product:<name>` (product-resolver.ts); everything else a\n * product consists of is DERIVED here, never declared:\n *\n *  - ProductMembership — the dependency graph. A project's OWN `product:` tags are FINAL (#1201): a\n *    project that declares any keeps exactly its declared set. An UNTAGGED project belongs to every\n *    product whose tagged project reaches it by a downward walk over `dependsOn` — and that walk stops\n *    at a tagged project, whose own dependencies are reached by its own seed walk. That closure is\n *    everything that can change the product's behaviour, so it is what a reviewer of that product\n *    reviews. It must start from EVERY entry point, clients and servers both: a client reaches its\n *    server only over HTTP, never through an nx edge, so a server is in its product only because it is\n *    tagged. Why final: a project is one product's, never two by accident — the example apps depend on\n *    the platform libraries, and a platform library tagged `product:platform` must not be painted\n *    `example` because an example reaches it. A published library whose entry points live in OTHER\n *    repos carries its own tag for exactly that reason: no in-repo walk can ever reach it correctly.\n *  - RuntimeProductMembership — the runtime graph, under the same rule. A service that already carries\n *    products (declared, or derived on the dependency graph above) keeps exactly them; a service with\n *    none belongs to every product whose service reaches it over RUNTIME `dependsOn`, including through\n *    a queue to its consumers, and that walk stops at a service with products of its own. A call from\n *    one product into another product's service still shows — as the runtime EDGE between them.\n *  - ProductPalette — the Product color mode's colors: a fixed palette of eight assigned in sorted\n *    product-name order, a neutral fill for a box shared by EVERY product, and a dashed white box for\n *    one in no product.\n *\n * Membership is stable per checkout (it depends on tags and edges, never on a diff), so it is written\n * into the committed dependencies.json / runtime-dependencies.json rather than into a sidecar.\n */\n\nimport type { EnhancedGraph } from './graph-sorter';\nimport type { RuntimeGraph } from './runtime-graph-model';\n\n// The same two text colors graph-color-modes.ts writes on every fill. Spelled here rather than\n// imported because graph-color-modes.ts imports THIS file (for the palette), and a file-import cycle\n// is refused by `no-file-import-cycles`.\nconst DARK_TEXT = '#1a1c22';\nconst LIGHT_TEXT = '#ffffff';\n\n/** One product's color, and the text color that reads on it. Data-only. */\nexport class ProductColor {\n    constructor(\n        public readonly product: string,\n        public readonly color: string,\n        public readonly fontColor: string,\n        /** False for a product past the palette's eight, which is painted with the neutral fill. */\n        public readonly inPalette: boolean,\n    ) {}\n}\n\n/** The eight product colors, in assignment order. Distinct from every runtime and role color. */\nconst PRODUCT_COLORS: readonly (readonly [string, string])[] = [\n    ['#3f6fb5', LIGHT_TEXT],\n    ['#f28e2b', DARK_TEXT],\n    ['#c0392b', LIGHT_TEXT],\n    ['#5cb8b2', DARK_TEXT],\n    ['#3d8b3d', LIGHT_TEXT],\n    ['#edc948', DARK_TEXT],\n    ['#8e5ea2', LIGHT_TEXT],\n    ['#ff9da7', DARK_TEXT],\n];\n\n/** How many products get a color of their own; any further product uses the neutral fill. */\nexport const PRODUCT_PALETTE_SIZE = PRODUCT_COLORS.length;\n\n/** A box shared by EVERY product, and every product past the palette's eight. */\nexport const PRODUCT_SHARED_FILL = '#c9ced8';\n/** A box in no product: white, with a dashed border. */\nexport const PRODUCT_NONE_FILL = '#ffffff';\nexport const PRODUCT_NONE_BORDER = '#8a90a0';\n\nexport class ProductPalette {\n    /** Every declared product, sorted, each with its color. */\n    readonly colors: ProductColor[];\n\n    constructor(products: readonly string[]) {\n        const sorted = [...new Set(products)].sort();\n        this.colors = sorted.map((product: string, index: number): ProductColor => {\n            const entry = PRODUCT_COLORS[index];\n            if (entry === undefined) return new ProductColor(product, PRODUCT_SHARED_FILL, DARK_TEXT, false);\n            return new ProductColor(product, entry[0], entry[1], true);\n        });\n    }\n\n    /** Every product carried by a project of the graph, as one palette. */\n    // webpieces-disable no-function-outside-class -- static factory of this class\n    static fromGraph(graph: EnhancedGraph): ProductPalette {\n        const all: string[] = [];\n        for (const entry of Object.values(graph)) all.push(...(entry.products ?? []));\n        return new ProductPalette(all);\n    }\n\n    names(): string[] {\n        return this.colors.map((color: ProductColor): string => color.product);\n    }\n\n    colorOf(product: string): ProductColor {\n        return (\n            this.colors.find((color: ProductColor): boolean => color.product === product) ??\n            new ProductColor(product, PRODUCT_SHARED_FILL, DARK_TEXT, false)\n        );\n    }\n\n    /** True for a box carrying every product of a workspace that declares two or more. */\n    sharedByAll(products: readonly string[]): boolean {\n        return this.colors.length > 1 && this.colors.every((color: ProductColor): boolean => products.includes(color.product));\n    }\n\n    /** True when some product is past the palette's eight, so the legend must say it is neutral. */\n    overflows(): boolean {\n        return this.colors.some((color: ProductColor): boolean => !color.inPalette);\n    }\n}\n\n/**\n * The architecture graph's product membership: declared seeds walked DOWN over `dependsOn`, where a\n * project's own declared products are final.\n */\nexport class ProductMembership {\n    /**\n     * @param seeds project → the products it DECLARES (its `product:` tags)\n     * @returns project → its sorted products: exactly its declared set when it declares any; otherwise\n     *          every product whose tagged project reaches it without passing through another tagged\n     *          project. A project in no product is absent, so with no tag anywhere the map is empty.\n     */\n    compute(seeds: ReadonlyMap<string, readonly string[]>, graph: EnhancedGraph): Map<string, string[]> {\n        const declared = new Map<string, readonly string[]>();\n        seeds.forEach((products: readonly string[], seed: string): void => {\n            if (products.length > 0 && graph[seed] !== undefined) declared.set(seed, products);\n        });\n        const members = new Map<string, Set<string>>();\n        declared.forEach((products: readonly string[], seed: string): void => {\n            members.set(seed, new Set(products));\n        });\n        declared.forEach((products: readonly string[], seed: string): void => {\n            for (const project of this.closure(seed, graph, declared)) {\n                const set = members.get(project) ?? new Set<string>();\n                for (const product of products) set.add(product);\n                members.set(project, set);\n            }\n        });\n        const result = new Map<string, string[]>();\n        members.forEach((set: Set<string>, project: string): void => {\n            result.set(project, [...set].sort());\n        });\n        return result;\n    }\n\n    /**\n     * Every UNTAGGED project `seed` reaches through `dependsOn`. A tagged project is neither collected\n     * nor walked through: its products are final, and its own seed walk covers its dependencies.\n     */\n    private closure(seed: string, graph: EnhancedGraph, declared: ReadonlyMap<string, readonly string[]>): Set<string> {\n        const seen = new Set<string>([seed]);\n        const reached = new Set<string>();\n        const stack = [seed];\n        while (stack.length > 0) {\n            const project = stack.pop() as string;\n            for (const dep of graph[project]?.dependsOn ?? []) {\n                if (seen.has(dep)) continue;\n                seen.add(dep);\n                if (declared.has(dep)) continue;\n                reached.add(dep);\n                stack.push(dep);\n            }\n        }\n        return reached;\n    }\n}\n\n/**\n * The runtime graph's product membership: services that carry products walked over RUNTIME\n * `dependsOn`, where a service's own products are final.\n */\nexport class RuntimeProductMembership {\n    /**\n     * Stamp `products` onto every service of `graph` that some product reaches. Seeds are the\n     * services whose dependencies.json entry carries `products`, and each keeps exactly those; a\n     * service with none gets every product whose seed reaches it without passing through another\n     * seed. A `queue:<Api.method>` dependency is followed to that queue's consumers. A service in no\n     * product gets no field.\n     */\n    apply(graph: RuntimeGraph, projects: EnhancedGraph): void {\n        const seeds = new Map<string, readonly string[]>();\n        for (const name of Object.keys(graph.services)) {\n            const own = projects[name]?.products ?? [];\n            if (own.length > 0) seeds.set(name, own);\n        }\n        const members = new Map<string, Set<string>>();\n        seeds.forEach((own: readonly string[], name: string): void => {\n            members.set(name, new Set(own));\n        });\n        seeds.forEach((own: readonly string[], name: string): void => {\n            for (const reached of this.closure(name, graph, seeds)) {\n                const set = members.get(reached) ?? new Set<string>();\n                for (const product of own) set.add(product);\n                members.set(reached, set);\n            }\n        });\n        members.forEach((set: Set<string>, name: string): void => {\n            const service = graph.services[name];\n            if (service !== undefined) service.products = [...set].sort();\n        });\n    }\n\n    /** Every service WITHOUT products of its own that `seed` reaches; a seed is neither collected nor walked through. */\n    private closure(seed: string, graph: RuntimeGraph, seeds: ReadonlyMap<string, readonly string[]>): Set<string> {\n        const seen = new Set<string>([seed]);\n        const reached = new Set<string>();\n        const stack = [seed];\n        while (stack.length > 0) {\n            const name = stack.pop() as string;\n            for (const next of this.callees(name, graph)) {\n                if (seen.has(next) || graph.services[next] === undefined) continue;\n                seen.add(next);\n                if (seeds.has(next)) continue;\n                reached.add(next);\n                stack.push(next);\n            }\n        }\n        return reached;\n    }\n\n    /** The services one service calls: direct ones, and the consumers behind every queue it feeds. */\n    private callees(name: string, graph: RuntimeGraph): string[] {\n        const callees: string[] = [];\n        for (const dep of graph.services[name]?.dependsOn ?? []) {\n            if (!dep.startsWith('queue:')) {\n                callees.push(dep);\n                continue;\n            }\n            callees.push(...(graph.queues[dep.slice('queue:'.length)]?.consumedBy ?? []));\n        }\n        return callees;\n    }\n}\n"]}
+{"version":3,"file":"graph-products.js","sourceRoot":"","sources":["../../../../../../packages/tooling/nx-webpieces-rules/src/lib/graph-products.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+BG;;;AAKH,+FAA+F;AAC/F,qGAAqG;AACrG,yCAAyC;AACzC,MAAM,SAAS,GAAG,SAAS,CAAC;AAC5B,MAAM,UAAU,GAAG,SAAS,CAAC;AAE7B,2EAA2E;AAC3E,MAAa,YAAY;IAED;IACA;IACA;IAEA;IALpB,YACoB,OAAe,EACf,KAAa,EACb,SAAiB;IACjC,4FAA4F;IAC5E,SAAkB;QAJlB,YAAO,GAAP,OAAO,CAAQ;QACf,UAAK,GAAL,KAAK,CAAQ;QACb,cAAS,GAAT,SAAS,CAAQ;QAEjB,cAAS,GAAT,SAAS,CAAS;IACnC,CAAC;CACP;AARD,oCAQC;AAED,iGAAiG;AACjG,MAAM,cAAc,GAA2C;IAC3D,CAAC,SAAS,EAAE,UAAU,CAAC;IACvB,CAAC,SAAS,EAAE,SAAS,CAAC;IACtB,CAAC,SAAS,EAAE,UAAU,CAAC;IACvB,CAAC,SAAS,EAAE,SAAS,CAAC;IACtB,CAAC,SAAS,EAAE,UAAU,CAAC;IACvB,CAAC,SAAS,EAAE,SAAS,CAAC;IACtB,CAAC,SAAS,EAAE,UAAU,CAAC;IACvB,CAAC,SAAS,EAAE,SAAS,CAAC;CACzB,CAAC;AAEF,6FAA6F;AAChF,QAAA,oBAAoB,GAAG,cAAc,CAAC,MAAM,CAAC;AAE1D,iFAAiF;AACpE,QAAA,mBAAmB,GAAG,SAAS,CAAC;AAC7C,wDAAwD;AAC3C,QAAA,iBAAiB,GAAG,SAAS,CAAC;AAC9B,QAAA,mBAAmB,GAAG,SAAS,CAAC;AAE7C,MAAa,cAAc;IACvB,2DAA2D;IAClD,MAAM,CAAiB;IAEhC,YAAY,QAA2B;QACnC,MAAM,MAAM,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QAC7C,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,OAAe,EAAE,KAAa,EAAgB,EAAE;YACtE,MAAM,KAAK,GAAG,cAAc,CAAC,KAAK,CAAC,CAAC;YACpC,IAAI,KAAK,KAAK,SAAS;gBAAE,OAAO,IAAI,YAAY,CAAC,OAAO,EAAE,2BAAmB,EAAE,SAAS,EAAE,KAAK,CAAC,CAAC;YACjG,OAAO,IAAI,YAAY,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;QAC/D,CAAC,CAAC,CAAC;IACP,CAAC;IAED,uEAAuE;IACvE,8EAA8E;IAC9E,MAAM,CAAC,SAAS,CAAC,KAAoB;QACjC,MAAM,GAAG,GAAa,EAAE,CAAC;QACzB,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC;YAAE,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,IAAI,EAAE,CAAC,CAAC,CAAC;QAC9E,OAAO,IAAI,cAAc,CAAC,GAAG,CAAC,CAAC;IACnC,CAAC;IAED,KAAK;QACD,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,KAAmB,EAAU,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;IAC3E,CAAC;IAED,OAAO,CAAC,OAAe;QACnB,OAAO,CACH,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,KAAmB,EAAW,EAAE,CAAC,KAAK,CAAC,OAAO,KAAK,OAAO,CAAC;YAC7E,IAAI,YAAY,CAAC,OAAO,EAAE,2BAAmB,EAAE,SAAS,EAAE,KAAK,CAAC,CACnE,CAAC;IACN,CAAC;IAED,sFAAsF;IACtF,WAAW,CAAC,QAA2B;QACnC,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,KAAmB,EAAW,EAAE,CAAC,QAAQ,CAAC,QAAQ,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;IAC3H,CAAC;IAED,gGAAgG;IAChG,SAAS;QACL,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,KAAmB,EAAW,EAAE,CAAC,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;IAChF,CAAC;CACJ;AAzCD,wCAyCC;AAED;;;;;;;GAOG;AACH,MAAa,eAAe;IACxB,sGAAsG;IACtG,WAAW,CAAC,IAAuB,EAAE,EAAqB;QACtD,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC;QACtD,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,OAAe,EAAW,EAAE,CAAC,EAAE,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;YAAE,OAAO,IAAI,CAAC;QAChF,OAAO,EAAE,CAAC,IAAI,CAAC,CAAC,OAAe,EAAW,EAAE,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;IACnF,CAAC;CACJ;AAPD,0CAOC;AAED;;;GAGG;AACH,MAAa,iBAAiB;IAC1B;;;;;OAKG;IACH,OAAO,CAAC,KAA6C,EAAE,KAAoB;QACvE,MAAM,QAAQ,GAAG,IAAI,GAAG,EAA6B,CAAC;QACtD,KAAK,CAAC,OAAO,CAAC,CAAC,QAA2B,EAAE,IAAY,EAAQ,EAAE;YAC9D,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,KAAK,SAAS;gBAAE,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;QACvF,CAAC,CAAC,CAAC;QACH,MAAM,OAAO,GAAG,IAAI,GAAG,EAAuB,CAAC;QAC/C,QAAQ,CAAC,OAAO,CAAC,CAAC,QAA2B,EAAE,IAAY,EAAQ,EAAE;YACjE,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC;QACzC,CAAC,CAAC,CAAC;QACH,QAAQ,CAAC,OAAO,CAAC,CAAC,QAA2B,EAAE,IAAY,EAAQ,EAAE;YACjE,KAAK,MAAM,OAAO,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,KAAK,EAAE,QAAQ,CAAC,EAAE,CAAC;gBACxD,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,IAAI,GAAG,EAAU,CAAC;gBACtD,KAAK,MAAM,OAAO,IAAI,QAAQ;oBAAE,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;gBACjD,OAAO,CAAC,GAAG,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;YAC9B,CAAC;QACL,CAAC,CAAC,CAAC;QACH,MAAM,MAAM,GAAG,IAAI,GAAG,EAAoB,CAAC;QAC3C,OAAO,CAAC,OAAO,CAAC,CAAC,GAAgB,EAAE,OAAe,EAAQ,EAAE;YACxD,MAAM,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;QACzC,CAAC,CAAC,CAAC;QACH,OAAO,MAAM,CAAC;IAClB,CAAC;IAED;;;OAGG;IACK,OAAO,CAAC,IAAY,EAAE,KAAoB,EAAE,QAAgD;QAChG,MAAM,IAAI,GAAG,IAAI,GAAG,CAAS,CAAC,IAAI,CAAC,CAAC,CAAC;QACrC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,KAAK,GAAG,CAAC,IAAI,CAAC,CAAC;QACrB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACtB,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,EAAY,CAAC;YACtC,KAAK,MAAM,GAAG,IAAI,KAAK,CAAC,OAAO,CAAC,EAAE,SAAS,IAAI,EAAE,EAAE,CAAC;gBAChD,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;oBAAE,SAAS;gBAC5B,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBACd,IAAI,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC;oBAAE,SAAS;gBAChC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBACjB,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACpB,CAAC;QACL,CAAC;QACD,OAAO,OAAO,CAAC;IACnB,CAAC;CACJ;AAlDD,8CAkDC;AAED;;;GAGG;AACH,MAAa,wBAAwB;IACjC;;;;;;OAMG;IACH,KAAK,CAAC,KAAmB,EAAE,QAAuB;QAC9C,MAAM,KAAK,GAAG,IAAI,GAAG,EAA6B,CAAC;QACnD,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC;YAC7C,MAAM,GAAG,GAAG,QAAQ,CAAC,IAAI,CAAC,EAAE,QAAQ,IAAI,EAAE,CAAC;YAC3C,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC;gBAAE,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QAC7C,CAAC;QACD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAuB,CAAC;QAC/C,KAAK,CAAC,OAAO,CAAC,CAAC,GAAsB,EAAE,IAAY,EAAQ,EAAE;YACzD,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QACpC,CAAC,CAAC,CAAC;QACH,KAAK,CAAC,OAAO,CAAC,CAAC,GAAsB,EAAE,IAAY,EAAQ,EAAE;YACzD,KAAK,MAAM,OAAO,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,KAAK,EAAE,KAAK,CAAC,EAAE,CAAC;gBACrD,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,IAAI,GAAG,EAAU,CAAC;gBACtD,KAAK,MAAM,OAAO,IAAI,GAAG;oBAAE,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;gBAC5C,OAAO,CAAC,GAAG,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;YAC9B,CAAC;QACL,CAAC,CAAC,CAAC;QACH,OAAO,CAAC,OAAO,CAAC,CAAC,GAAgB,EAAE,IAAY,EAAQ,EAAE;YACrD,MAAM,OAAO,GAAG,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;YACrC,IAAI,OAAO,KAAK,SAAS;gBAAE,OAAO,CAAC,QAAQ,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;QAClE,CAAC,CAAC,CAAC;IACP,CAAC;IAED,qHAAqH;IAC7G,OAAO,CAAC,IAAY,EAAE,KAAmB,EAAE,KAA6C;QAC5F,MAAM,IAAI,GAAG,IAAI,GAAG,CAAS,CAAC,IAAI,CAAC,CAAC,CAAC;QACrC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,KAAK,GAAG,CAAC,IAAI,CAAC,CAAC;QACrB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACtB,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,EAAY,CAAC;YACnC,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC;gBAC3C,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,SAAS;oBAAE,SAAS;gBACnE,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;gBACf,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC;oBAAE,SAAS;gBAC9B,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;gBAClB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACrB,CAAC;QACL,CAAC;QACD,OAAO,OAAO,CAAC;IACnB,CAAC;IAED,kGAAkG;IAC1F,OAAO,CAAC,IAAY,EAAE,KAAmB;QAC7C,MAAM,OAAO,GAAa,EAAE,CAAC;QAC7B,KAAK,MAAM,GAAG,IAAI,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,SAAS,IAAI,EAAE,EAAE,CAAC;YACtD,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAC5B,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBAClB,SAAS;YACb,CAAC;YACD,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,UAAU,IAAI,EAAE,CAAC,CAAC,CAAC;QAClF,CAAC;QACD,OAAO,OAAO,CAAC;IACnB,CAAC;CACJ;AA7DD,4DA6DC","sourcesContent":["/**\n * Products on the architecture graphs (#1179).\n *\n * A monorepo can hold several PRODUCTS, each with its own clients and servers. A product is declared\n * on its entry points with the nx tag `product:<name>` (product-resolver.ts); everything else a\n * product consists of is DERIVED here, never declared:\n *\n *  - ProductMembership — the dependency graph. A project's OWN `product:` tags are FINAL (#1201): a\n *    project that declares any keeps exactly its declared set. An UNTAGGED project belongs to every\n *    product whose tagged project reaches it by a downward walk over `dependsOn` — and that walk stops\n *    at a tagged project, whose own dependencies are reached by its own seed walk. That closure is\n *    everything that can change the product's behaviour, so it is what a reviewer of that product\n *    reviews. It must start from EVERY entry point, clients and servers both: a client reaches its\n *    server only over HTTP, never through an nx edge, so a server is in its product only because it is\n *    tagged. Why final: a project is one product's, never two by accident — the example apps depend on\n *    the platform libraries, and a platform library tagged `product:platform` must not be painted\n *    `example` because an example reaches it. A published library whose entry points live in OTHER\n *    repos carries its own tag for exactly that reason: no in-repo walk can ever reach it correctly.\n *  - RuntimeProductMembership — the runtime graph, under the same rule. A service that already carries\n *    products (declared, or derived on the dependency graph above) keeps exactly them; a service with\n *    none belongs to every product whose service reaches it over RUNTIME `dependsOn`, including through\n *    a queue to its consumers, and that walk stops at a service with products of its own. A call from\n *    one product into another product's service still shows — as the runtime EDGE between them.\n *  - ProductPalette — the Product color mode's colors: a fixed palette of eight assigned in sorted\n *    product-name order, a neutral fill for a box shared by EVERY product, and a dashed white box for\n *    one in no product.\n *  - ProductBoundary — which dependency edges cross from one product into another (#1204), drawn\n *    dashed in the target product's color in the Product color mode.\n *\n * Membership is stable per checkout (it depends on tags and edges, never on a diff), so it is written\n * into the committed dependencies.json / runtime-dependencies.json rather than into a sidecar.\n */\n\nimport type { EnhancedGraph } from './graph-sorter';\nimport type { RuntimeGraph } from './runtime-graph-model';\n\n// The same two text colors graph-color-modes.ts writes on every fill. Spelled here rather than\n// imported because graph-color-modes.ts imports THIS file (for the palette), and a file-import cycle\n// is refused by `no-file-import-cycles`.\nconst DARK_TEXT = '#1a1c22';\nconst LIGHT_TEXT = '#ffffff';\n\n/** One product's color, and the text color that reads on it. Data-only. */\nexport class ProductColor {\n    constructor(\n        public readonly product: string,\n        public readonly color: string,\n        public readonly fontColor: string,\n        /** False for a product past the palette's eight, which is painted with the neutral fill. */\n        public readonly inPalette: boolean,\n    ) {}\n}\n\n/** The eight product colors, in assignment order. Distinct from every runtime and role color. */\nconst PRODUCT_COLORS: readonly (readonly [string, string])[] = [\n    ['#3f6fb5', LIGHT_TEXT],\n    ['#f28e2b', DARK_TEXT],\n    ['#c0392b', LIGHT_TEXT],\n    ['#5cb8b2', DARK_TEXT],\n    ['#3d8b3d', LIGHT_TEXT],\n    ['#edc948', DARK_TEXT],\n    ['#8e5ea2', LIGHT_TEXT],\n    ['#ff9da7', DARK_TEXT],\n];\n\n/** How many products get a color of their own; any further product uses the neutral fill. */\nexport const PRODUCT_PALETTE_SIZE = PRODUCT_COLORS.length;\n\n/** A box shared by EVERY product, and every product past the palette's eight. */\nexport const PRODUCT_SHARED_FILL = '#c9ced8';\n/** A box in no product: white, with a dashed border. */\nexport const PRODUCT_NONE_FILL = '#ffffff';\nexport const PRODUCT_NONE_BORDER = '#8a90a0';\n\nexport class ProductPalette {\n    /** Every declared product, sorted, each with its color. */\n    readonly colors: ProductColor[];\n\n    constructor(products: readonly string[]) {\n        const sorted = [...new Set(products)].sort();\n        this.colors = sorted.map((product: string, index: number): ProductColor => {\n            const entry = PRODUCT_COLORS[index];\n            if (entry === undefined) return new ProductColor(product, PRODUCT_SHARED_FILL, DARK_TEXT, false);\n            return new ProductColor(product, entry[0], entry[1], true);\n        });\n    }\n\n    /** Every product carried by a project of the graph, as one palette. */\n    // webpieces-disable no-function-outside-class -- static factory of this class\n    static fromGraph(graph: EnhancedGraph): ProductPalette {\n        const all: string[] = [];\n        for (const entry of Object.values(graph)) all.push(...(entry.products ?? []));\n        return new ProductPalette(all);\n    }\n\n    names(): string[] {\n        return this.colors.map((color: ProductColor): string => color.product);\n    }\n\n    colorOf(product: string): ProductColor {\n        return (\n            this.colors.find((color: ProductColor): boolean => color.product === product) ??\n            new ProductColor(product, PRODUCT_SHARED_FILL, DARK_TEXT, false)\n        );\n    }\n\n    /** True for a box carrying every product of a workspace that declares two or more. */\n    sharedByAll(products: readonly string[]): boolean {\n        return this.colors.length > 1 && this.colors.every((color: ProductColor): boolean => products.includes(color.product));\n    }\n\n    /** True when some product is past the palette's eight, so the legend must say it is neutral. */\n    overflows(): boolean {\n        return this.colors.some((color: ProductColor): boolean => !color.inPalette);\n    }\n}\n\n/**\n * Where a dependency edge crosses a product boundary (#1204), for the Product color mode: an edge\n * A -> B crosses when B does not carry every product of A, and it is drawn dashed in the color of the\n * product it crosses INTO, so the boundaries read at a glance while same-product edges stay quiet.\n * Whether a crossing is ALLOWED is the product dependency matrix's call (product-dependencies.ts):\n * with `product-tags` ON, generation already refused every crossing the matrix does not allow, so\n * every crossing drawn is an allowed one.\n */\nexport class ProductBoundary {\n    /** The product the edge crosses into, or null when the target carries every product of the source. */\n    crossedInto(from: readonly string[], to: readonly string[]): string | null {\n        if (from.length === 0 || to.length === 0) return null;\n        if (from.every((product: string): boolean => to.includes(product))) return null;\n        return to.find((product: string): boolean => !from.includes(product)) ?? to[0];\n    }\n}\n\n/**\n * The architecture graph's product membership: declared seeds walked DOWN over `dependsOn`, where a\n * project's own declared products are final.\n */\nexport class ProductMembership {\n    /**\n     * @param seeds project → the products it DECLARES (its `product:` tags)\n     * @returns project → its sorted products: exactly its declared set when it declares any; otherwise\n     *          every product whose tagged project reaches it without passing through another tagged\n     *          project. A project in no product is absent, so with no tag anywhere the map is empty.\n     */\n    compute(seeds: ReadonlyMap<string, readonly string[]>, graph: EnhancedGraph): Map<string, string[]> {\n        const declared = new Map<string, readonly string[]>();\n        seeds.forEach((products: readonly string[], seed: string): void => {\n            if (products.length > 0 && graph[seed] !== undefined) declared.set(seed, products);\n        });\n        const members = new Map<string, Set<string>>();\n        declared.forEach((products: readonly string[], seed: string): void => {\n            members.set(seed, new Set(products));\n        });\n        declared.forEach((products: readonly string[], seed: string): void => {\n            for (const project of this.closure(seed, graph, declared)) {\n                const set = members.get(project) ?? new Set<string>();\n                for (const product of products) set.add(product);\n                members.set(project, set);\n            }\n        });\n        const result = new Map<string, string[]>();\n        members.forEach((set: Set<string>, project: string): void => {\n            result.set(project, [...set].sort());\n        });\n        return result;\n    }\n\n    /**\n     * Every UNTAGGED project `seed` reaches through `dependsOn`. A tagged project is neither collected\n     * nor walked through: its products are final, and its own seed walk covers its dependencies.\n     */\n    private closure(seed: string, graph: EnhancedGraph, declared: ReadonlyMap<string, readonly string[]>): Set<string> {\n        const seen = new Set<string>([seed]);\n        const reached = new Set<string>();\n        const stack = [seed];\n        while (stack.length > 0) {\n            const project = stack.pop() as string;\n            for (const dep of graph[project]?.dependsOn ?? []) {\n                if (seen.has(dep)) continue;\n                seen.add(dep);\n                if (declared.has(dep)) continue;\n                reached.add(dep);\n                stack.push(dep);\n            }\n        }\n        return reached;\n    }\n}\n\n/**\n * The runtime graph's product membership: services that carry products walked over RUNTIME\n * `dependsOn`, where a service's own products are final.\n */\nexport class RuntimeProductMembership {\n    /**\n     * Stamp `products` onto every service of `graph` that some product reaches. Seeds are the\n     * services whose dependencies.json entry carries `products`, and each keeps exactly those; a\n     * service with none gets every product whose seed reaches it without passing through another\n     * seed. A `queue:<Api.method>` dependency is followed to that queue's consumers. A service in no\n     * product gets no field.\n     */\n    apply(graph: RuntimeGraph, projects: EnhancedGraph): void {\n        const seeds = new Map<string, readonly string[]>();\n        for (const name of Object.keys(graph.services)) {\n            const own = projects[name]?.products ?? [];\n            if (own.length > 0) seeds.set(name, own);\n        }\n        const members = new Map<string, Set<string>>();\n        seeds.forEach((own: readonly string[], name: string): void => {\n            members.set(name, new Set(own));\n        });\n        seeds.forEach((own: readonly string[], name: string): void => {\n            for (const reached of this.closure(name, graph, seeds)) {\n                const set = members.get(reached) ?? new Set<string>();\n                for (const product of own) set.add(product);\n                members.set(reached, set);\n            }\n        });\n        members.forEach((set: Set<string>, name: string): void => {\n            const service = graph.services[name];\n            if (service !== undefined) service.products = [...set].sort();\n        });\n    }\n\n    /** Every service WITHOUT products of its own that `seed` reaches; a seed is neither collected nor walked through. */\n    private closure(seed: string, graph: RuntimeGraph, seeds: ReadonlyMap<string, readonly string[]>): Set<string> {\n        const seen = new Set<string>([seed]);\n        const reached = new Set<string>();\n        const stack = [seed];\n        while (stack.length > 0) {\n            const name = stack.pop() as string;\n            for (const next of this.callees(name, graph)) {\n                if (seen.has(next) || graph.services[next] === undefined) continue;\n                seen.add(next);\n                if (seeds.has(next)) continue;\n                reached.add(next);\n                stack.push(next);\n            }\n        }\n        return reached;\n    }\n\n    /** The services one service calls: direct ones, and the consumers behind every queue it feeds. */\n    private callees(name: string, graph: RuntimeGraph): string[] {\n        const callees: string[] = [];\n        for (const dep of graph.services[name]?.dependsOn ?? []) {\n            if (!dep.startsWith('queue:')) {\n                callees.push(dep);\n                continue;\n            }\n            callees.push(...(graph.queues[dep.slice('queue:'.length)]?.consumedBy ?? []));\n        }\n        return callees;\n    }\n}\n"]}

package/src/lib/graph-render-model.d.ts

@@ -31,7 +31,19 @@ export declare class RenderEdge {
     readonly to: string;
     readonly dot: string;
     readonly id: string;
-    constructor(from: string, to: string, dot: string, id: string);
+    /**
+     * The statement the architecture page's Product color mode draws instead of `dot` (#1204): a
+     * dependency crossing into another product, dashed in that product's color. Null for every
+     * other edge, which draws `dot` in every mode.
+     */
+    readonly productDot: string | null;
+    constructor(from: string, to: string, dot: string, id: string, 
+    /**
+     * The statement the architecture page's Product color mode draws instead of `dot` (#1204): a
+     * dependency crossing into another product, dashed in that product's color. Null for every
+     * other edge, which draws `dot` in every mode.
+     */
+    productDot?: string | null);
 }
 /** The immutable drawable snapshot carried by a generated page. */
 export declare class GraphRenderModel {
@@ -55,7 +67,12 @@ export declare class GraphRenderModel {
     /** A box drawn differently per color mode; `fullDot` carries its RUNTIME statement. */
     styledNode(facts: NodeFacts, modes: NodeModeDots): string;
     completeEndpoints(): void;
-    edge(from: string, to: string, dot: string): string;
+    /**
+     * One edge. `productAttrs`, when not empty, is the attribute list the Product color mode adds to
+     * the statement (a later list overrides an earlier one in DOT), e.g. a cross-product dependency's
+     * dash and color; `fullDot` always carries the plain statement.
+     */
+    edge(from: string, to: string, dot: string, productAttrs?: string): string;
 }
 /** Shared filter chrome and script-safe JSON for pages opened directly from disk. */
 export declare class GraphFilterAssets {

package/src/lib/graph-render-model.js

@@ -47,11 +47,19 @@ class RenderEdge {
     to;
     dot;
     id;
-    constructor(from, to, dot, id) {
+    productDot;
+    constructor(from, to, dot, id, 
+    /**
+     * The statement the architecture page's Product color mode draws instead of `dot` (#1204): a
+     * dependency crossing into another product, dashed in that product's color. Null for every
+     * other edge, which draws `dot` in every mode.
+     */
+    productDot = null) {
         this.from = from;
         this.to = to;
         this.dot = dot;
         this.id = id;
+        this.productDot = productDot;
     }
 }
 exports.RenderEdge = RenderEdge;
@@ -113,10 +121,17 @@ class GraphRenderModel {
             }
         }
     }
-    edge(from, to, dot) {
+    /**
+     * One edge. `productAttrs`, when not empty, is the attribute list the Product color mode adds to
+     * the statement (a later list overrides an earlier one in DOT), e.g. a cross-product dependency's
+     * dash and color; `fullDot` always carries the plain statement.
+     */
+    edge(from, to, dot, productAttrs = '') {
         const id = `wp-real-edge-${this.edges.length}`;
-        const statement = `${dot.slice(0, -2)} [id="${id}"];\n`;
-        this.edges.push(new RenderEdge(from, to, statement, id));
+        const base = `${dot.slice(0, -2)} [id="${id}"]`;
+        const statement = `${base};\n`;
+        const productDot = productAttrs === '' ? null : `${base} [${productAttrs}];\n`;
+        this.edges.push(new RenderEdge(from, to, statement, id, productDot));
         return statement;
     }
 }

package/src/lib/graph-render-model.js.map

@@ -1 +1 @@
-{"version":3,"file":"graph-render-model.js","sourceRoot":"","sources":["../../../../../../packages/tooling/nx-webpieces-rules/src/lib/graph-render-model.ts"],"names":[],"mappings":";;;AAAA,6CAAwC;AAExC,2DAA2E;AAE3E;;;;;;;;;GASG;AACH,MAAa,UAAU;IAEC;IACA;IACA;IACA;IACA;IACA;IANpB,YACoB,EAAU,EACV,GAAW,EACX,KAA0B,EAC1B,IAAqB,EACrB,QAAkB,EAClB,YAAsB,EAAE;QALxB,OAAE,GAAF,EAAE,CAAQ;QACV,QAAG,GAAH,GAAG,CAAQ;QACX,UAAK,GAAL,KAAK,CAAqB;QAC1B,SAAI,GAAJ,IAAI,CAAiB;QACrB,aAAQ,GAAR,QAAQ,CAAU;QAClB,cAAS,GAAT,SAAS,CAAe;IACzC,CAAC;CACP;AATD,gCASC;AAED,gGAAgG;AAChG,MAAa,QAAQ;IAEG;IACA;IACA;IAHpB,YACoB,KAAa,EACb,IAAY,EACZ,UAAoB;QAFpB,UAAK,GAAL,KAAK,CAAQ;QACb,SAAI,GAAJ,IAAI,CAAQ;QACZ,eAAU,GAAV,UAAU,CAAU;IACrC,CAAC;CACP;AAND,4BAMC;AAED,MAAa,UAAU;IAEC;IACA;IACA;IACA;IAJpB,YACoB,IAAY,EACZ,EAAU,EACV,GAAW,EACX,EAAU;QAHV,SAAI,GAAJ,IAAI,CAAQ;QACZ,OAAE,GAAF,EAAE,CAAQ;QACV,QAAG,GAAH,GAAG,CAAQ;QACX,OAAE,GAAF,EAAE,CAAQ;IAC3B,CAAC;CACP;AAPD,gCAOC;AAED,mEAAmE;AACnE,MAAa,gBAAgB;IACzB,MAAM,GAA+B,cAAc,CAAC;IAC3C,KAAK,GAAiB,EAAE,CAAC;IACzB,KAAK,GAAiB,EAAE,CAAC;IAClC,KAAK,GAAgB,EAAE,CAAC;IACxB,OAAO,GAAG,EAAE,CAAC;IACb,MAAM,GAAG,EAAE,CAAC;IACZ,MAAM,GAAG,EAAE,CAAC;IACZ,kGAAkG;IAClG,MAAM,GAAG,IAAI,+BAAW,EAAE,CAAC;IAE3B,IAAI,CAAC,EAAU,EAAE,GAAW,EAAE,WAAqB,EAAE,EAAE,YAAsB,EAAE;QAC3E,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,UAAU,CAAC,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,QAAQ,EAAE,SAAS,CAAC,CAAC,CAAC;QAC1E,OAAO,GAAG,CAAC;IACf,CAAC;IAED;;;;;OAKG;IACH,cAAc,CAAC,SAAkC;QAC7C,MAAM,IAAI,GAAG,IAAI,GAAG,EAAsB,CAAC;QAC3C,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK;YAAE,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QACvD,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC;YACrD,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;YAC/B,IAAI,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC;gBAAE,SAAS;YACjC,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;YACpC,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;gBAC5B,MAAM,KAAK,GACP,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;gBAC7E,IAAI,KAAK,KAAK,IAAI,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC;oBAAE,SAAS;gBAClD,KAAK,MAAM,OAAO,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,QAAQ,IAAI,EAAE;oBAAE,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YAClF,CAAC;YACD,IAAI,SAAS,CAAC,IAAI,KAAK,CAAC;gBAAE,SAAS;YACnC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,IAAI,UAAU,CAC9B,IAAI,CAAC,EAAE,EACP,IAAI,CAAC,GAAG,EACR,IAAI,CAAC,KAAK,EACV,IAAI,CAAC,IAAI,EACT,CAAC,GAAG,SAAS,CAAC,CAAC,IAAI,EAAE,EACrB,IAAI,CAAC,SAAS,CACjB,CAAC;QACN,CAAC;IACL,CAAC;IAED,uFAAuF;IACvF,UAAU,CAAC,KAAgB,EAAE,KAAmB;QAC5C,IAAI,CAAC,KAAK,CAAC,IAAI,CACX,IAAI,UAAU,CACV,KAAK,CAAC,MAAM,EACZ,KAAK,CAAC,OAAO,EACb,KAAK,EACL,IAAI,QAAQ,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,UAAU,CAAC,EACvD,KAAK,CAAC,QAAQ,CACjB,CACJ,CAAC;QACF,OAAO,KAAK,CAAC,OAAO,CAAC;IACzB,CAAC;IAED,iBAAiB;QACb,MAAM,GAAG,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;QACvD,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAC5B,KAAK,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;gBACpC,IAAI,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;oBAAE,SAAS;gBAC1B,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;gBACZ,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,MAAM,IAAA,qBAAQ,EAAC,EAAE,CAAC,MAAM,CAAC,CAAC;YAC5C,CAAC;QACL,CAAC;IACL,CAAC;IAED,IAAI,CAAC,IAAY,EAAE,EAAU,EAAE,GAAW;QACtC,MAAM,EAAE,GAAG,gBAAgB,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;QAC/C,MAAM,SAAS,GAAG,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,SAAS,EAAE,OAAO,CAAC;QACxD,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,UAAU,CAAC,IAAI,EAAE,EAAE,EAAE,SAAS,EAAE,EAAE,CAAC,CAAC,CAAC;QACzD,OAAO,SAAS,CAAC;IACrB,CAAC;CACJ;AA9ED,4CA8EC;AAED,qFAAqF;AACrF,MAAa,iBAAiB;IAC1B,IAAI,CAAI,KAAQ;QACZ,OAAO,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;IAC1D,CAAC;IAED,IAAI;QACA,OAAO,CACH,qFAAqF;YACrF,uEAAuE;YACvE,iDAAiD,CACpD,CAAC;IACN,CAAC;IAED,MAAM;QACF,OAAO,CACH,8EAA8E;YAC9E,mEAAmE;YACnE,sEAAsE,CACzE,CAAC;IACN,CAAC;CACJ;AApBD,8CAoBC","sourcesContent":["import { dotValue } from './dot-syntax';\nimport { LevelBand } from './graph-level-bands';\nimport { LegendFacts, NodeFacts, NodeModeDots } from './graph-color-modes';\n\n/**\n * Renderer-owned records, captured while emitting DOT, never recovered by parsing labels.\n *\n * `dot` is the statement `fullDot` carries. `modes` carries per-mode statements in both viewers; `tags` carries declared service/project\n * metadata. Runtime auxiliary entities leave tags null so facets count services and retain context\n * separately.\n *\n * `products` is set on BOTH graphs (#1179): the products a box belongs to, which each page's product\n * filter matches on. Empty for a box in no product.\n */\nexport class RenderNode {\n    constructor(\n        public readonly id: string,\n        public readonly dot: string,\n        public readonly modes: NodeModeDots | null,\n        public readonly tags: NodeTags | null,\n        public readonly products: string[],\n        public readonly queueKeys: string[] = [],\n    ) {}\n}\n\n/** What the architecture page's Filter matches a box on: its level, role and framework tags. */\nexport class NodeTags {\n    constructor(\n        public readonly level: number,\n        public readonly role: string,\n        public readonly frameworks: string[],\n    ) {}\n}\n\nexport class RenderEdge {\n    constructor(\n        public readonly from: string,\n        public readonly to: string,\n        public readonly dot: string,\n        public readonly id: string,\n    ) {}\n}\n\n/** The immutable drawable snapshot carried by a generated page. */\nexport class GraphRenderModel {\n    viewer: 'architecture' | 'runtime' = 'architecture';\n    readonly nodes: RenderNode[] = [];\n    readonly edges: RenderEdge[] = [];\n    bands: LevelBand[] = [];\n    fullDot = '';\n    header = '';\n    footer = '';\n    /** The colors and roles in use, so the page's legend lists exactly those (architecture graph). */\n    legend = new LegendFacts();\n\n    node(id: string, dot: string, products: string[] = [], queueKeys: string[] = []): string {\n        this.nodes.push(new RenderNode(id, dot, null, null, products, queueKeys));\n        return dot;\n    }\n\n    /**\n     * Every product a declared box (a queue, a cron trigger, an external system) inherits from the\n     * services its edges touch (#1179): it belongs to whichever product's services it is attached to.\n     * Called by the runtime graph once every edge is emitted; RenderNode is immutable, so a node gains\n     * its products by being replaced.\n     */\n    attachProducts(isService: (id: string) => boolean): void {\n        const byId = new Map<string, RenderNode>();\n        for (const node of this.nodes) byId.set(node.id, node);\n        for (let index = 0; index < this.nodes.length; index++) {\n            const node = this.nodes[index];\n            if (isService(node.id)) continue;\n            const inherited = new Set<string>();\n            for (const edge of this.edges) {\n                const other =\n                    edge.from === node.id ? edge.to : edge.to === node.id ? edge.from : null;\n                if (other === null || !isService(other)) continue;\n                for (const product of byId.get(other)?.products ?? []) inherited.add(product);\n            }\n            if (inherited.size === 0) continue;\n            this.nodes[index] = new RenderNode(\n                node.id,\n                node.dot,\n                node.modes,\n                node.tags,\n                [...inherited].sort(),\n                node.queueKeys,\n            );\n        }\n    }\n\n    /** A box drawn differently per color mode; `fullDot` carries its RUNTIME statement. */\n    styledNode(facts: NodeFacts, modes: NodeModeDots): string {\n        this.nodes.push(\n            new RenderNode(\n                facts.nodeId,\n                modes.runtime,\n                modes,\n                new NodeTags(facts.level, facts.role, facts.frameworks),\n                facts.products,\n            ),\n        );\n        return modes.runtime;\n    }\n\n    completeEndpoints(): void {\n        const ids = new Set(this.nodes.map((node) => node.id));\n        for (const edge of this.edges) {\n            for (const id of [edge.from, edge.to]) {\n                if (ids.has(id)) continue;\n                ids.add(id);\n                this.node(id, `  \"${dotValue(id)}\";\\n`);\n            }\n        }\n    }\n\n    edge(from: string, to: string, dot: string): string {\n        const id = `wp-real-edge-${this.edges.length}`;\n        const statement = `${dot.slice(0, -2)} [id=\"${id}\"];\\n`;\n        this.edges.push(new RenderEdge(from, to, statement, id));\n        return statement;\n    }\n}\n\n/** Shared filter chrome and script-safe JSON for pages opened directly from disk. */\nexport class GraphFilterAssets {\n    json<T>(value: T): string {\n        return JSON.stringify(value).replace(/</g, '\\\\u003c');\n    }\n\n    html(): string {\n        return (\n            '<p id=\"wp-filter-status\" hidden>Filtering: <strong id=\"wp-filter-anchor\"></strong> ' +\n            '<button id=\"wp-filter-off\" type=\"button\">Turn off Filter</button></p>' +\n            '<p id=\"wp-graph-error\" role=\"alert\" hidden></p>'\n        );\n    }\n\n    styles(): string {\n        return (\n            '#wp-filter-status { text-align:center; } #wp-graph-error { color:#b71c1c; } ' +\n            '#graph .wp-filter-anchor polygon, #graph .wp-filter-anchor path, ' +\n            '#graph .wp-filter-anchor ellipse { stroke:#8b3cf0; stroke-width:3; }'\n        );\n    }\n}\n"]}
+{"version":3,"file":"graph-render-model.js","sourceRoot":"","sources":["../../../../../../packages/tooling/nx-webpieces-rules/src/lib/graph-render-model.ts"],"names":[],"mappings":";;;AAAA,6CAAwC;AAExC,2DAA2E;AAE3E;;;;;;;;;GASG;AACH,MAAa,UAAU;IAEC;IACA;IACA;IACA;IACA;IACA;IANpB,YACoB,EAAU,EACV,GAAW,EACX,KAA0B,EAC1B,IAAqB,EACrB,QAAkB,EAClB,YAAsB,EAAE;QALxB,OAAE,GAAF,EAAE,CAAQ;QACV,QAAG,GAAH,GAAG,CAAQ;QACX,UAAK,GAAL,KAAK,CAAqB;QAC1B,SAAI,GAAJ,IAAI,CAAiB;QACrB,aAAQ,GAAR,QAAQ,CAAU;QAClB,cAAS,GAAT,SAAS,CAAe;IACzC,CAAC;CACP;AATD,gCASC;AAED,gGAAgG;AAChG,MAAa,QAAQ;IAEG;IACA;IACA;IAHpB,YACoB,KAAa,EACb,IAAY,EACZ,UAAoB;QAFpB,UAAK,GAAL,KAAK,CAAQ;QACb,SAAI,GAAJ,IAAI,CAAQ;QACZ,eAAU,GAAV,UAAU,CAAU;IACrC,CAAC;CACP;AAND,4BAMC;AAED,MAAa,UAAU;IAEC;IACA;IACA;IACA;IAMA;IAVpB,YACoB,IAAY,EACZ,EAAU,EACV,GAAW,EACX,EAAU;IAC1B;;;;OAIG;IACa,aAA4B,IAAI;QAThC,SAAI,GAAJ,IAAI,CAAQ;QACZ,OAAE,GAAF,EAAE,CAAQ;QACV,QAAG,GAAH,GAAG,CAAQ;QACX,OAAE,GAAF,EAAE,CAAQ;QAMV,eAAU,GAAV,UAAU,CAAsB;IACjD,CAAC;CACP;AAbD,gCAaC;AAED,mEAAmE;AACnE,MAAa,gBAAgB;IACzB,MAAM,GAA+B,cAAc,CAAC;IAC3C,KAAK,GAAiB,EAAE,CAAC;IACzB,KAAK,GAAiB,EAAE,CAAC;IAClC,KAAK,GAAgB,EAAE,CAAC;IACxB,OAAO,GAAG,EAAE,CAAC;IACb,MAAM,GAAG,EAAE,CAAC;IACZ,MAAM,GAAG,EAAE,CAAC;IACZ,kGAAkG;IAClG,MAAM,GAAG,IAAI,+BAAW,EAAE,CAAC;IAE3B,IAAI,CAAC,EAAU,EAAE,GAAW,EAAE,WAAqB,EAAE,EAAE,YAAsB,EAAE;QAC3E,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,UAAU,CAAC,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,QAAQ,EAAE,SAAS,CAAC,CAAC,CAAC;QAC1E,OAAO,GAAG,CAAC;IACf,CAAC;IAED;;;;;OAKG;IACH,cAAc,CAAC,SAAkC;QAC7C,MAAM,IAAI,GAAG,IAAI,GAAG,EAAsB,CAAC;QAC3C,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK;YAAE,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QACvD,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC;YACrD,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;YAC/B,IAAI,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC;gBAAE,SAAS;YACjC,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;YACpC,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;gBAC5B,MAAM,KAAK,GACP,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;gBAC7E,IAAI,KAAK,KAAK,IAAI,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC;oBAAE,SAAS;gBAClD,KAAK,MAAM,OAAO,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,QAAQ,IAAI,EAAE;oBAAE,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YAClF,CAAC;YACD,IAAI,SAAS,CAAC,IAAI,KAAK,CAAC;gBAAE,SAAS;YACnC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,IAAI,UAAU,CAC9B,IAAI,CAAC,EAAE,EACP,IAAI,CAAC,GAAG,EACR,IAAI,CAAC,KAAK,EACV,IAAI,CAAC,IAAI,EACT,CAAC,GAAG,SAAS,CAAC,CAAC,IAAI,EAAE,EACrB,IAAI,CAAC,SAAS,CACjB,CAAC;QACN,CAAC;IACL,CAAC;IAED,uFAAuF;IACvF,UAAU,CAAC,KAAgB,EAAE,KAAmB;QAC5C,IAAI,CAAC,KAAK,CAAC,IAAI,CACX,IAAI,UAAU,CACV,KAAK,CAAC,MAAM,EACZ,KAAK,CAAC,OAAO,EACb,KAAK,EACL,IAAI,QAAQ,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,UAAU,CAAC,EACvD,KAAK,CAAC,QAAQ,CACjB,CACJ,CAAC;QACF,OAAO,KAAK,CAAC,OAAO,CAAC;IACzB,CAAC;IAED,iBAAiB;QACb,MAAM,GAAG,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;QACvD,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAC5B,KAAK,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;gBACpC,IAAI,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;oBAAE,SAAS;gBAC1B,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;gBACZ,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,MAAM,IAAA,qBAAQ,EAAC,EAAE,CAAC,MAAM,CAAC,CAAC;YAC5C,CAAC;QACL,CAAC;IACL,CAAC;IAED;;;;OAIG;IACH,IAAI,CAAC,IAAY,EAAE,EAAU,EAAE,GAAW,EAAE,eAAuB,EAAE;QACjE,MAAM,EAAE,GAAG,gBAAgB,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;QAC/C,MAAM,IAAI,GAAG,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,SAAS,EAAE,IAAI,CAAC;QAChD,MAAM,SAAS,GAAG,GAAG,IAAI,KAAK,CAAC;QAC/B,MAAM,UAAU,GAAG,YAAY,KAAK,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,KAAK,YAAY,MAAM,CAAC;QAC/E,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,UAAU,CAAC,IAAI,EAAE,EAAE,EAAE,SAAS,EAAE,EAAE,EAAE,UAAU,CAAC,CAAC,CAAC;QACrE,OAAO,SAAS,CAAC;IACrB,CAAC;CACJ;AArFD,4CAqFC;AAED,qFAAqF;AACrF,MAAa,iBAAiB;IAC1B,IAAI,CAAI,KAAQ;QACZ,OAAO,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;IAC1D,CAAC;IAED,IAAI;QACA,OAAO,CACH,qFAAqF;YACrF,uEAAuE;YACvE,iDAAiD,CACpD,CAAC;IACN,CAAC;IAED,MAAM;QACF,OAAO,CACH,8EAA8E;YAC9E,mEAAmE;YACnE,sEAAsE,CACzE,CAAC;IACN,CAAC;CACJ;AApBD,8CAoBC","sourcesContent":["import { dotValue } from './dot-syntax';\nimport { LevelBand } from './graph-level-bands';\nimport { LegendFacts, NodeFacts, NodeModeDots } from './graph-color-modes';\n\n/**\n * Renderer-owned records, captured while emitting DOT, never recovered by parsing labels.\n *\n * `dot` is the statement `fullDot` carries. `modes` carries per-mode statements in both viewers; `tags` carries declared service/project\n * metadata. Runtime auxiliary entities leave tags null so facets count services and retain context\n * separately.\n *\n * `products` is set on BOTH graphs (#1179): the products a box belongs to, which each page's product\n * filter matches on. Empty for a box in no product.\n */\nexport class RenderNode {\n    constructor(\n        public readonly id: string,\n        public readonly dot: string,\n        public readonly modes: NodeModeDots | null,\n        public readonly tags: NodeTags | null,\n        public readonly products: string[],\n        public readonly queueKeys: string[] = [],\n    ) {}\n}\n\n/** What the architecture page's Filter matches a box on: its level, role and framework tags. */\nexport class NodeTags {\n    constructor(\n        public readonly level: number,\n        public readonly role: string,\n        public readonly frameworks: string[],\n    ) {}\n}\n\nexport class RenderEdge {\n    constructor(\n        public readonly from: string,\n        public readonly to: string,\n        public readonly dot: string,\n        public readonly id: string,\n        /**\n         * The statement the architecture page's Product color mode draws instead of `dot` (#1204): a\n         * dependency crossing into another product, dashed in that product's color. Null for every\n         * other edge, which draws `dot` in every mode.\n         */\n        public readonly productDot: string | null = null,\n    ) {}\n}\n\n/** The immutable drawable snapshot carried by a generated page. */\nexport class GraphRenderModel {\n    viewer: 'architecture' | 'runtime' = 'architecture';\n    readonly nodes: RenderNode[] = [];\n    readonly edges: RenderEdge[] = [];\n    bands: LevelBand[] = [];\n    fullDot = '';\n    header = '';\n    footer = '';\n    /** The colors and roles in use, so the page's legend lists exactly those (architecture graph). */\n    legend = new LegendFacts();\n\n    node(id: string, dot: string, products: string[] = [], queueKeys: string[] = []): string {\n        this.nodes.push(new RenderNode(id, dot, null, null, products, queueKeys));\n        return dot;\n    }\n\n    /**\n     * Every product a declared box (a queue, a cron trigger, an external system) inherits from the\n     * services its edges touch (#1179): it belongs to whichever product's services it is attached to.\n     * Called by the runtime graph once every edge is emitted; RenderNode is immutable, so a node gains\n     * its products by being replaced.\n     */\n    attachProducts(isService: (id: string) => boolean): void {\n        const byId = new Map<string, RenderNode>();\n        for (const node of this.nodes) byId.set(node.id, node);\n        for (let index = 0; index < this.nodes.length; index++) {\n            const node = this.nodes[index];\n            if (isService(node.id)) continue;\n            const inherited = new Set<string>();\n            for (const edge of this.edges) {\n                const other =\n                    edge.from === node.id ? edge.to : edge.to === node.id ? edge.from : null;\n                if (other === null || !isService(other)) continue;\n                for (const product of byId.get(other)?.products ?? []) inherited.add(product);\n            }\n            if (inherited.size === 0) continue;\n            this.nodes[index] = new RenderNode(\n                node.id,\n                node.dot,\n                node.modes,\n                node.tags,\n                [...inherited].sort(),\n                node.queueKeys,\n            );\n        }\n    }\n\n    /** A box drawn differently per color mode; `fullDot` carries its RUNTIME statement. */\n    styledNode(facts: NodeFacts, modes: NodeModeDots): string {\n        this.nodes.push(\n            new RenderNode(\n                facts.nodeId,\n                modes.runtime,\n                modes,\n                new NodeTags(facts.level, facts.role, facts.frameworks),\n                facts.products,\n            ),\n        );\n        return modes.runtime;\n    }\n\n    completeEndpoints(): void {\n        const ids = new Set(this.nodes.map((node) => node.id));\n        for (const edge of this.edges) {\n            for (const id of [edge.from, edge.to]) {\n                if (ids.has(id)) continue;\n                ids.add(id);\n                this.node(id, `  \"${dotValue(id)}\";\\n`);\n            }\n        }\n    }\n\n    /**\n     * One edge. `productAttrs`, when not empty, is the attribute list the Product color mode adds to\n     * the statement (a later list overrides an earlier one in DOT), e.g. a cross-product dependency's\n     * dash and color; `fullDot` always carries the plain statement.\n     */\n    edge(from: string, to: string, dot: string, productAttrs: string = ''): string {\n        const id = `wp-real-edge-${this.edges.length}`;\n        const base = `${dot.slice(0, -2)} [id=\"${id}\"]`;\n        const statement = `${base};\\n`;\n        const productDot = productAttrs === '' ? null : `${base} [${productAttrs}];\\n`;\n        this.edges.push(new RenderEdge(from, to, statement, id, productDot));\n        return statement;\n    }\n}\n\n/** Shared filter chrome and script-safe JSON for pages opened directly from disk. */\nexport class GraphFilterAssets {\n    json<T>(value: T): string {\n        return JSON.stringify(value).replace(/</g, '\\\\u003c');\n    }\n\n    html(): string {\n        return (\n            '<p id=\"wp-filter-status\" hidden>Filtering: <strong id=\"wp-filter-anchor\"></strong> ' +\n            '<button id=\"wp-filter-off\" type=\"button\">Turn off Filter</button></p>' +\n            '<p id=\"wp-graph-error\" role=\"alert\" hidden></p>'\n        );\n    }\n\n    styles(): string {\n        return (\n            '#wp-filter-status { text-align:center; } #wp-graph-error { color:#b71c1c; } ' +\n            '#graph .wp-filter-anchor polygon, #graph .wp-filter-anchor path, ' +\n            '#graph .wp-filter-anchor ellipse { stroke:#8b3cf0; stroke-width:3; }'\n        );\n    }\n}\n"]}

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

@@ -126,6 +126,8 @@ declare class GraphPage extends WpFilterPage {
     protected captureBinding(_svg: SVGSVGElement | null): () => void;
     protected wireControls(): void;
     protected nodeDot(node: RenderNodeJson): string;
+    /** Product mode dashes a dependency that crosses into another product (#1204); every other mode draws it plain. */
+    protected edgeDot(edge: RenderEdgeJson): string;
     protected usesFullDot(): boolean;
     protected narrow(retained: Set<string>): Set<string>;
     /** Filtering keeps every box in its own L-row: an emptied level stays as a thin labeled band. */

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

@@ -678,6 +678,12 @@ class GraphPage extends WpFilterPage {
             return modes.product;
         return modes.runtime;
     }
+    /** Product mode dashes a dependency that crosses into another product (#1204); every other mode draws it plain. */
+    edgeDot(edge) {
+        if (this.modes.mode === 'product' && edge.productDot !== null)
+            return edge.productDot;
+        return edge.dot;
+    }
     usesFullDot() {
         return this.modes.mode === 'runtime' && this.applied.count() === 0;
     }