@intentius/chant 0.18.34 → 0.18.35

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@intentius/chant",
-  "version": "0.18.34",
+  "version": "0.18.35",
   "description": "Declarative infrastructure-as-code toolkit — TypeScript on Node.js",
   "license": "Apache-2.0",
   "homepage": "https://intentius.io/chant",

package/src/graph-detail.test.ts

@@ -57,6 +57,19 @@ describe("applyDetail", () => {
     expect(ir.edges).toContainEqual({ from: "subnet", to: "vpc", kind: "ref", viaAttr: "network" });
   });
 
+  test("T1 (composites) carries the cross-stack imports forward (survive the collapse as plain nodes)", () => {
+    const withImports: GraphIR = {
+      ...base,
+      nodes: [...base.nodes, { id: "pClusterArn", kind: "AWS::CloudFormation::Parameter", lexicon: "aws", attrs: {} }],
+      imports: [{ name: "pClusterArn", node: "pClusterArn" }],
+    };
+    const ir = applyDetail(withImports, DETAIL.COMPOSITES);
+    // The import node isn't a composite, so it survives — and `imports` rides
+    // along so a viewer can hide/match it at this tier too (not just base + T3).
+    expect(ir.nodes.some((n) => n.id === "pClusterArn")).toBe(true);
+    expect(ir.imports).toEqual([{ name: "pClusterArn", node: "pClusterArn" }]);
+  });
+
   test("T1 node count is between T0 and T2", () => {
     const t0 = applyDetail(base, DETAIL.STACKS).nodes.length;
     const t1 = applyDetail(base, DETAIL.COMPOSITES).nodes.length;

package/src/graph-detail.ts

@@ -111,7 +111,18 @@ function toComposites(ir: GraphIR): GraphIR {
   }
 
   nodes.sort((a, b) => a.id.localeCompare(b.id));
-  return { nodes, edges: sortEdges([...seen.values()]), groups: { byLexicon: byLexiconOf(nodes) } };
+  // Carry the cross-stack import list forward: parameter/import nodes aren't
+  // composites, so they survive the collapse as plain nodes — a viewer that
+  // hides imports (or matches them across stacks) needs `imports` at every tier,
+  // not just the base + ATTRIBUTES. Filter to handles whose node survived.
+  const surviving = new Set(nodes.map((n) => n.id));
+  const imports = ir.imports?.filter((i) => surviving.has(i.node));
+  return {
+    nodes,
+    edges: sortEdges([...seen.values()]),
+    groups: { byLexicon: byLexiconOf(nodes) },
+    ...(imports && imports.length ? { imports } : {}),
+  };
 }
 
 /** T3 — annotate each edge with the producer attribute it references. */