@contentful/experience-design-system-cli 2.37.1-dev-build-182ecd7e.0 → 2.37.1-dev-build-a0a57522.0

package/dist/app.js

@@ -18438,6 +18438,9 @@ var GLYPH_TREE_MID = "\u251C\u2500";
 var GLYPH_TREE_LAST = "\u2514\u2500";
 var GLYPH_WARN = "\u26A0";
 var GLYPH_ERROR = "\u2717";
+function hasDirectChild(node) {
+  return node.slots.some((slot) => (slot.allowedComponents ?? []).some((target) => target !== node.name));
+}
 function isEmpty(entry) {
   return Object.keys(entry.$properties ?? {}).length === 0 && Object.keys(entry.$slots ?? {}).length === 0;
 }
@@ -18480,10 +18483,12 @@ function buildVisibleRows(props) {
     otherKeys2.sort();
     const otherKeySet2 = new Set(otherKeys2);
     const flatGraph = graph.filter((n) => otherKeySet2.has(n.name));
-    const closures2 = computeAllClosures(flatGraph);
     const depCountByKey = /* @__PURE__ */ new Map();
-    for (const [name, closure] of closures2) {
-      if (closure.nodes.length > 1) depCountByKey.set(name, closure.nodes.length - 1);
+    for (const node of flatGraph) {
+      const direct = new Set(
+        node.slots.flatMap((slot) => slot.allowedComponents ?? []).filter((t) => t !== node.name && otherKeySet2.has(t))
+      );
+      if (direct.size > 0) depCountByKey.set(node.name, direct.size);
     }
     for (const key of cycleKeys2) {
       const rec = itemByKey2.get(key);
@@ -18528,28 +18533,11 @@ function buildVisibleRows(props) {
   const seenCycleTierChildOccurrence = /* @__PURE__ */ new Set();
   const computeCycleMemberSubtree = (root) => {
     const out = [];
-    const visited = /* @__PURE__ */ new Set([root]);
-    const queue = [{ name: root, depth: 0 }];
-    while (queue.length > 0) {
-      const cur = queue.shift();
-      const parentItem = itemByKey.get(cur.name)?.it;
-      if (!parentItem) continue;
-      const slotTargets2 = [];
-      const seenTarget = /* @__PURE__ */ new Set();
-      for (const target of allowedComponentNames(parentItem.entry)) {
-        if (!itemByKey.has(target)) continue;
-        if (seenTarget.has(target)) continue;
-        seenTarget.add(target);
-        slotTargets2.push(target);
-      }
-      slotTargets2.sort();
-      for (const target of slotTargets2) {
-        if (visited.has(target)) continue;
-        visited.add(target);
-        const isCycleMember = cycleParticipants.has(target);
-        out.push({ name: target, depth: cur.depth + 1, isCycleMember });
-        queue.push({ name: target, depth: cur.depth + 1 });
-      }
+    const parentItem = itemByKey.get(root)?.it;
+    if (!parentItem) return out;
+    const slotTargets2 = [...new Set(allowedComponentNames(parentItem.entry))].filter((target) => target !== root && itemByKey.has(target)).sort();
+    for (const target of slotTargets2) {
+      out.push({ name: target, depth: 1, isCycleMember: cycleParticipants.has(target) });
     }
     return out;
   };
@@ -18611,7 +18599,15 @@ function buildVisibleRows(props) {
   }
   const otherKeySet = new Set(otherKeys);
   const subgraph = graph.filter((n) => otherKeySet.has(n.name));
-  const closures = computeAllClosures(subgraph);
+  const closures = /* @__PURE__ */ new Map();
+  const parentNames = /* @__PURE__ */ new Set([
+    ...findRoots(subgraph),
+    ...subgraph.filter((n) => hasDirectChild(n)).map((n) => n.name)
+  ]);
+  for (const name of [...parentNames].sort()) {
+    const full = computeClosure(name, subgraph);
+    closures.set(name, { ...full, nodes: full.nodes.filter((n) => n.depth <= 1) });
+  }
   const sharedDeps = findSharedDeps(closures);
   const hasCycleDepDirect = (name) => {
     const it = itemByKey.get(name)?.it;
@@ -18648,7 +18644,6 @@ function buildVisibleRows(props) {
       }
     };
     countInjections(root);
-    for (const n of closure.nodes) if (n.name !== root) countInjections(n.name);
     const depCount = closure.nodes.length - 1 + injectedCycleCount;
     const expanded = alwaysExpanded ? true : props.expandedGroups.has(root);
     const glyphExpand = expanded ? GLYPH_EXPAND_EXPANDED : GLYPH_EXPAND_COLLAPSED;
@@ -18684,7 +18679,6 @@ function buildVisibleRows(props) {
     emitCycleChildrenOf(root, 0);
     for (const c2 of closureChildren) {
       injectedChildren.push({ name: c2.name, depth: c2.depth, isCycleChild: false });
-      emitCycleChildrenOf(c2.name, c2.depth);
     }
     const isLastAtDepth = (idx) => {
       const own = injectedChildren[idx].depth;

package/dist/index.js

@@ -20888,6 +20888,9 @@ var init_badge = __esm({
 import figures4 from "figures";
 import { Box as Box17, Text as Text19 } from "ink";
 import { jsx as jsx22, jsxs as jsxs18 } from "react/jsx-runtime";
+function hasDirectChild(node) {
+  return node.slots.some((slot) => (slot.allowedComponents ?? []).some((target) => target !== node.name));
+}
 function isEmpty(entry) {
   return Object.keys(entry.$properties ?? {}).length === 0 && Object.keys(entry.$slots ?? {}).length === 0;
 }
@@ -20930,10 +20933,12 @@ function buildVisibleRows(props) {
     otherKeys2.sort();
     const otherKeySet2 = new Set(otherKeys2);
     const flatGraph = graph.filter((n) => otherKeySet2.has(n.name));
-    const closures2 = computeAllClosures(flatGraph);
     const depCountByKey = /* @__PURE__ */ new Map();
-    for (const [name, closure] of closures2) {
-      if (closure.nodes.length > 1) depCountByKey.set(name, closure.nodes.length - 1);
+    for (const node of flatGraph) {
+      const direct = new Set(
+        node.slots.flatMap((slot) => slot.allowedComponents ?? []).filter((t) => t !== node.name && otherKeySet2.has(t))
+      );
+      if (direct.size > 0) depCountByKey.set(node.name, direct.size);
     }
     for (const key of cycleKeys2) {
       const rec = itemByKey2.get(key);
@@ -20978,28 +20983,11 @@ function buildVisibleRows(props) {
   const seenCycleTierChildOccurrence = /* @__PURE__ */ new Set();
   const computeCycleMemberSubtree = (root) => {
     const out = [];
-    const visited = /* @__PURE__ */ new Set([root]);
-    const queue = [{ name: root, depth: 0 }];
-    while (queue.length > 0) {
-      const cur = queue.shift();
-      const parentItem = itemByKey.get(cur.name)?.it;
-      if (!parentItem) continue;
-      const slotTargets2 = [];
-      const seenTarget = /* @__PURE__ */ new Set();
-      for (const target of allowedComponentNames(parentItem.entry)) {
-        if (!itemByKey.has(target)) continue;
-        if (seenTarget.has(target)) continue;
-        seenTarget.add(target);
-        slotTargets2.push(target);
-      }
-      slotTargets2.sort();
-      for (const target of slotTargets2) {
-        if (visited.has(target)) continue;
-        visited.add(target);
-        const isCycleMember = cycleParticipants.has(target);
-        out.push({ name: target, depth: cur.depth + 1, isCycleMember });
-        queue.push({ name: target, depth: cur.depth + 1 });
-      }
+    const parentItem = itemByKey.get(root)?.it;
+    if (!parentItem) return out;
+    const slotTargets2 = [...new Set(allowedComponentNames(parentItem.entry))].filter((target) => target !== root && itemByKey.has(target)).sort();
+    for (const target of slotTargets2) {
+      out.push({ name: target, depth: 1, isCycleMember: cycleParticipants.has(target) });
     }
     return out;
   };
@@ -21061,7 +21049,15 @@ function buildVisibleRows(props) {
   }
   const otherKeySet = new Set(otherKeys);
   const subgraph = graph.filter((n) => otherKeySet.has(n.name));
-  const closures = computeAllClosures(subgraph);
+  const closures = /* @__PURE__ */ new Map();
+  const parentNames = /* @__PURE__ */ new Set([
+    ...findRoots(subgraph),
+    ...subgraph.filter((n) => hasDirectChild(n)).map((n) => n.name)
+  ]);
+  for (const name of [...parentNames].sort()) {
+    const full = computeClosure(name, subgraph);
+    closures.set(name, { ...full, nodes: full.nodes.filter((n) => n.depth <= 1) });
+  }
   const sharedDeps = findSharedDeps(closures);
   const hasCycleDepDirect = (name) => {
     const it = itemByKey.get(name)?.it;
@@ -21098,7 +21094,6 @@ function buildVisibleRows(props) {
       }
     };
     countInjections(root);
-    for (const n of closure.nodes) if (n.name !== root) countInjections(n.name);
     const depCount = closure.nodes.length - 1 + injectedCycleCount;
     const expanded = alwaysExpanded ? true : props.expandedGroups.has(root);
     const glyphExpand = expanded ? GLYPH_EXPAND_EXPANDED : GLYPH_EXPAND_COLLAPSED;
@@ -21134,7 +21129,6 @@ function buildVisibleRows(props) {
     emitCycleChildrenOf(root, 0);
     for (const c2 of closureChildren) {
       injectedChildren.push({ name: c2.name, depth: c2.depth, isCycleChild: false });
-      emitCycleChildrenOf(c2.name, c2.depth);
     }
     const isLastAtDepth = (idx) => {
       const own = injectedChildren[idx].depth;

package/dist/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@contentful/experience-design-system-cli",
-  "version": "2.37.1-dev-build-182ecd7e.0",
+  "version": "2.37.1-dev-build-a0a57522.0",
   "description": "Contentful Experiences design system import CLI",
   "license": "MIT",
   "type": "module",

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@contentful/experience-design-system-cli",
-  "version": "2.37.1-dev-build-182ecd7e.0",
+  "version": "2.37.1-dev-build-a0a57522.0",
   "description": "Contentful Experiences design system import CLI",
   "license": "MIT",
   "type": "module",
@@ -45,8 +45,8 @@
     "ts-morph": "^27.0.2",
     "typescript": "^5.9.3",
     "zod": "^4.6.5",
-    "@contentful/experience-design-system-backend-pipeline": "2.37.1-dev-build-182ecd7e.0",
-    "@contentful/experience-design-system-types": "2.37.1-dev-build-182ecd7e.0"
+    "@contentful/experience-design-system-backend-pipeline": "2.37.1-dev-build-a0a57522.0",
+    "@contentful/experience-design-system-types": "2.37.1-dev-build-a0a57522.0"
   },
   "devDependencies": {
     "@tsconfig/node24": "^24.0.4",