@unified-product-graph/cloud-server 0.9.16 → 0.9.17

package/dist/index.js

@@ -998,148 +998,6 @@ function textError(s) {
   return { content: [{ type: "text", text: s }], isError: true };
 }
 
-// ../upg-mcp-tooling/dist/tree-assemble.js
-var DEFAULT_MAX_NODES = 400;
-function shell(reader, id, includeProps) {
-  const n = reader.getNode(id);
-  if (!n)
-    return void 0;
-  const node = { id: n.id, type: n.type, title: n.title, children: [] };
-  if (n.status)
-    node.status = n.status;
-  if (includeProps && includeProps.length > 0 && n.properties) {
-    const picked = {};
-    for (const k of includeProps) {
-      if (k in n.properties)
-        picked[k] = n.properties[k];
-    }
-    if (Object.keys(picked).length > 0)
-      node.properties = picked;
-  }
-  return node;
-}
-function childrenOf(reader, nodeId2, childTypes) {
-  if (childTypes.length === 0)
-    return [];
-  const allow = new Set(childTypes);
-  const out = [];
-  const seen = /* @__PURE__ */ new Set();
-  for (const e of reader.getEdgesForNode(nodeId2)) {
-    if (e.source !== nodeId2)
-      continue;
-    if (seen.has(e.target))
-      continue;
-    const t = reader.getNode(e.target);
-    if (t && allow.has(t.type)) {
-      out.push(e.target);
-      seen.add(e.target);
-    }
-  }
-  return out;
-}
-function assembleTree(reader, pattern, opts) {
-  const maxNodes = Math.min(Math.max(opts.max_nodes ?? DEFAULT_MAX_NODES, 1), 2e3);
-  const maxDepth = Math.min(Math.max(opts.depth ?? pattern.natural_depth, 1), 12);
-  const includeProps = opts.include_properties;
-  const buildFrom = (rootIds, anchorType) => {
-    const visited = /* @__PURE__ */ new Set();
-    const gaps = [];
-    let nodes = 0;
-    let levels = 0;
-    let truncated = false;
-    let childCount = 0;
-    const expand = (node, depth) => {
-      if (depth > levels)
-        levels = depth;
-      const childTypes = pattern.child_map[node.type] ?? [];
-      if (depth >= maxDepth) {
-        if (childTypes.length > 0 && childrenOf(reader, node.id, childTypes).length > 0)
-          truncated = true;
-        return;
-      }
-      const childIds = childrenOf(reader, node.id, childTypes);
-      if (childTypes.length > 0 && childIds.length === 0) {
-        gaps.push({ node_id: node.id, type: node.type, title: node.title, missing: childTypes });
-        return;
-      }
-      for (const cid of childIds) {
-        if (visited.has(cid))
-          continue;
-        if (nodes >= maxNodes) {
-          truncated = true;
-          return;
-        }
-        const child = shell(reader, cid, includeProps);
-        if (!child)
-          continue;
-        visited.add(cid);
-        nodes++;
-        childCount++;
-        node.children.push(child);
-        expand(child, depth + 1);
-      }
-    };
-    const roots = [];
-    for (const rid of rootIds) {
-      if (visited.has(rid))
-        continue;
-      if (nodes >= maxNodes) {
-        truncated = true;
-        break;
-      }
-      const root = shell(reader, rid, includeProps);
-      if (!root)
-        continue;
-      visited.add(rid);
-      nodes++;
-      roots.push(root);
-      expand(root, 1);
-    }
-    return { anchorType, roots, nodes, levels, truncated, gaps, childCount };
-  };
-  if (opts.from_id) {
-    const n = reader.getNode(opts.from_id);
-    const anchorType = n?.type ?? pattern.anchor_type;
-    const b = buildFrom([opts.from_id], anchorType);
-    return {
-      pattern: pattern.id,
-      framework_id: pattern.framework_id,
-      anchor_type: pattern.anchor_type,
-      anchor_used: anchorType,
-      roots: b.roots,
-      stats: { nodes: b.nodes, levels: b.levels, truncated: b.truncated },
-      gaps: b.gaps
-    };
-  }
-  const candidates = [pattern.anchor_type, ...pattern.fallback_anchors];
-  const idsOfType = (type) => reader.getAllNodes().filter((n) => n.type === type).map((n) => n.id);
-  let chosen;
-  for (const cand of candidates) {
-    const rootIds = idsOfType(cand);
-    if (rootIds.length === 0)
-      continue;
-    const b = buildFrom(rootIds, cand);
-    chosen = b;
-    if (b.childCount > 0)
-      break;
-  }
-  if (!chosen) {
-    chosen = { anchorType: pattern.anchor_type, roots: [], nodes: 0, levels: 0, truncated: false, gaps: [], childCount: 0 };
-  }
-  const result = {
-    pattern: pattern.id,
-    framework_id: pattern.framework_id,
-    anchor_type: pattern.anchor_type,
-    anchor_used: chosen.anchorType,
-    roots: chosen.roots,
-    stats: { nodes: chosen.nodes, levels: chosen.levels, truncated: chosen.truncated },
-    gaps: chosen.gaps
-  };
-  if (chosen.anchorType !== pattern.anchor_type)
-    result.anchor_resolved_from = pattern.anchor_type;
-  return result;
-}
-
 // ../upg-mcp-tooling/dist/catalog.js
 import { UPG_EDGE_CATALOG, UPG_PROPERTY_SCHEMA, getDomainForType, getGuideForDomain, getLifecycleForType, getPropertySchema, resolveEntityType, UnknownEntityTypeError } from "@unified-product-graph/core";
 function buildEntitySchema(rawType, options = {}) {
@@ -1476,6 +1334,7 @@ var getChanges = async (args, { store }) => {
 
 // src/tools/tree.ts
 import { getTreePattern, UPG_TREE_PATTERNS } from "@unified-product-graph/core";
+import { assembleTree } from "@unified-product-graph/sdk";
 var getTree = async (args, { store }) => {
   if (!args.product_id) return textError("Missing required parameter: product_id");
   const productId = args.product_id;