gauss-ai 4.0.0

package/dist/chunk-C5NLWJS2.js

@@ -0,0 +1,139 @@
+// src/adapters/graph-visualization/ascii-graph.adapter.ts
+var AsciiGraphAdapter = class {
+  toAscii(graph) {
+    if (graph.nodes.length === 0) return "(empty graph)";
+    const ordered = this.topologicalSort(graph);
+    const forkMap = new Map(graph.forks.map((f) => [f.id, f.nodeIds]));
+    const lines = [];
+    const boxes = ordered.map((id) => {
+      const node = graph.nodes.find((n) => n.id === id);
+      return this.renderBox(node.label ?? node.id, node.type);
+    });
+    const topLine = boxes.map((b) => b[0]).join("     ");
+    const midLine = boxes.map((b) => b[1]).join(" \u2500\u2500\u2192 ");
+    const typLine = boxes.map((b) => b[2]).join("     ");
+    const botLine = boxes.map((b) => b[3]).join("     ");
+    lines.push(topLine, midLine, typLine, botLine);
+    for (const [forkId, nodeIds] of forkMap) {
+      const idx = ordered.indexOf(forkId);
+      if (idx < 0) continue;
+      const offset = this.computeOffset(boxes, idx);
+      lines.push("");
+      const forkLines = this.renderFork(forkId, nodeIds);
+      for (const fl of forkLines) {
+        lines.push(" ".repeat(offset) + fl);
+      }
+    }
+    return lines.join("\n");
+  }
+  toMermaid(_graph) {
+    throw new Error("Use MermaidGraphAdapter for Mermaid output");
+  }
+  renderBox(label, type) {
+    const inner = Math.max(label.length, type.length + 2);
+    const pad = (s) => s.padEnd(inner);
+    return [
+      `\u250C${"\u2500".repeat(inner + 2)}\u2510`,
+      `\u2502 ${pad(label)} \u2502`,
+      `\u2502 ${pad(`(${type})`)} \u2502`,
+      `\u2514${"\u2500".repeat(inner + 2)}\u2518`
+    ];
+  }
+  renderFork(id, nodeIds) {
+    const miniBoxLine = nodeIds.map((nid) => {
+      const w = nid.length + 2;
+      return `\u250C${"\u2500".repeat(w)}\u2510`;
+    }).join("");
+    const miniMidLine = nodeIds.map((nid) => `\u2502 ${nid} \u2502`).join("");
+    const miniBotLine = nodeIds.map((nid) => {
+      const w = nid.length + 2;
+      return `\u2514${"\u2500".repeat(w)}\u2518`;
+    }).join("");
+    const contentWidth = Math.max(id.length + 2, miniMidLine.length + 2);
+    const padCenter = (s) => {
+      const leftPad = Math.floor((contentWidth - s.length) / 2);
+      return " ".repeat(Math.max(0, leftPad)) + s;
+    };
+    const dashesTotal = contentWidth - 1;
+    const leftDashes = Math.floor(dashesTotal / 2);
+    const rightDashes = dashesTotal - leftDashes;
+    return [
+      " ".repeat(Math.floor(contentWidth / 2)) + "\u2502",
+      `\u250C${"\u2500".repeat(leftDashes)}\u2534${"\u2500".repeat(rightDashes)}\u2510`,
+      `\u2502${padCenter(id)}${" ".repeat(Math.max(0, contentWidth - padCenter(id).length))}\u2502`,
+      `\u2502${padCenter(miniBoxLine)}${" ".repeat(Math.max(0, contentWidth - padCenter(miniBoxLine).length))}\u2502`,
+      `\u2502${padCenter(miniMidLine)}${" ".repeat(Math.max(0, contentWidth - padCenter(miniMidLine).length))}\u2502`,
+      `\u2502${padCenter(miniBotLine)}${" ".repeat(Math.max(0, contentWidth - padCenter(miniBotLine).length))}\u2502`,
+      `\u2514${"\u2500".repeat(contentWidth)}\u2518`
+    ];
+  }
+  computeOffset(boxes, idx) {
+    let offset = 0;
+    for (let i = 0; i < idx; i++) {
+      offset += boxes[i][0].length + 5;
+    }
+    return offset;
+  }
+  topologicalSort(graph) {
+    const adjacency = /* @__PURE__ */ new Map();
+    const inDegree = /* @__PURE__ */ new Map();
+    for (const n of graph.nodes) {
+      adjacency.set(n.id, []);
+      inDegree.set(n.id, 0);
+    }
+    for (const e of graph.edges) {
+      adjacency.get(e.from)?.push(e.to);
+      inDegree.set(e.to, (inDegree.get(e.to) ?? 0) + 1);
+    }
+    const queue = graph.nodes.filter((n) => (inDegree.get(n.id) ?? 0) === 0).map((n) => n.id);
+    const result = [];
+    while (queue.length > 0) {
+      const id = queue.shift();
+      result.push(id);
+      for (const next of adjacency.get(id) ?? []) {
+        const deg = (inDegree.get(next) ?? 1) - 1;
+        inDegree.set(next, deg);
+        if (deg === 0) queue.push(next);
+      }
+    }
+    return result;
+  }
+};
+
+// src/adapters/graph-visualization/mermaid-graph.adapter.ts
+var MermaidGraphAdapter = class {
+  toAscii(_graph) {
+    throw new Error("Use AsciiGraphAdapter for ASCII output");
+  }
+  toMermaid(graph) {
+    const lines = ["graph LR"];
+    const forkNodeIds = new Set(graph.forks.flatMap((f) => f.nodeIds));
+    const sanitize = (id) => id.replace(/-/g, "_");
+    for (const node of graph.nodes) {
+      if (forkNodeIds.has(node.id)) continue;
+      const sid = sanitize(node.id);
+      const label = node.label ?? node.id;
+      lines.push(`  ${sid}[${label}<br>${node.type}]`);
+    }
+    for (const edge of graph.edges) {
+      lines.push(`  ${sanitize(edge.from)} --> ${sanitize(edge.to)}`);
+    }
+    for (const fork of graph.forks) {
+      lines.push(`  subgraph ${fork.id}`);
+      for (const nid of fork.nodeIds) {
+        const node = graph.nodes.find((n) => n.id === nid);
+        const label = node?.label ?? nid;
+        const type = node?.type ?? "agent";
+        lines.push(`    ${sanitize(nid)}[${label}<br>${type}]`);
+      }
+      lines.push("  end");
+    }
+    return lines.join("\n");
+  }
+};
+
+export {
+  AsciiGraphAdapter,
+  MermaidGraphAdapter
+};
+//# sourceMappingURL=chunk-C5NLWJS2.js.map

package/dist/chunk-C5NLWJS2.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/adapters/graph-visualization/ascii-graph.adapter.ts","../src/adapters/graph-visualization/mermaid-graph.adapter.ts"],"sourcesContent":["// =============================================================================\n// AsciiGraphAdapter — Renders a GraphDescriptor as ASCII box art\n// =============================================================================\n\nimport type {\n  GraphVisualizationPort,\n  GraphDescriptor,\n} from \"../../ports/graph-visualization.port.js\";\n\nexport class AsciiGraphAdapter implements GraphVisualizationPort {\n  toAscii(graph: GraphDescriptor): string {\n    if (graph.nodes.length === 0) return \"(empty graph)\";\n\n    const ordered = this.topologicalSort(graph);\n    const forkMap = new Map(graph.forks.map((f) => [f.id, f.nodeIds]));\n    const lines: string[] = [];\n\n    // Render main flow\n    const boxes = ordered.map((id) => {\n      const node = graph.nodes.find((n) => n.id === id)!;\n      return this.renderBox(node.label ?? node.id, node.type);\n    });\n    const topLine = boxes.map((b) => b[0]).join(\"     \");\n    const midLine = boxes.map((b) => b[1]).join(\" ──→ \");\n    const typLine = boxes.map((b) => b[2]).join(\"     \");\n    const botLine = boxes.map((b) => b[3]).join(\"     \");\n    lines.push(topLine, midLine, typLine, botLine);\n\n    // Render forks below their parent node\n    for (const [forkId, nodeIds] of forkMap) {\n      const idx = ordered.indexOf(forkId);\n      if (idx < 0) continue;\n      const offset = this.computeOffset(boxes, idx);\n      lines.push(\"\");\n      const forkLines = this.renderFork(forkId, nodeIds);\n      for (const fl of forkLines) {\n        lines.push(\" \".repeat(offset) + fl);\n      }\n    }\n\n    return lines.join(\"\\n\");\n  }\n\n  toMermaid(_graph: GraphDescriptor): string {\n    throw new Error(\"Use MermaidGraphAdapter for Mermaid output\");\n  }\n\n  private renderBox(label: string, type: string): [string, string, string, string] {\n    const inner = Math.max(label.length, type.length + 2);\n    const pad = (s: string) => s.padEnd(inner);\n    return [\n      `┌${\"─\".repeat(inner + 2)}┐`,\n      `│ ${pad(label)} │`,\n      `│ ${pad(`(${type})`)} │`,\n      `└${\"─\".repeat(inner + 2)}┘`,\n    ];\n  }\n\n  private renderFork(id: string, nodeIds: string[]): string[] {\n    const miniBoxLine = nodeIds.map((nid) => {\n      const w = nid.length + 2;\n      return `┌${\"─\".repeat(w)}┐`;\n    }).join(\"\");\n    const miniMidLine = nodeIds.map((nid) => `│ ${nid} │`).join(\"\");\n    const miniBotLine = nodeIds.map((nid) => {\n      const w = nid.length + 2;\n      return `└${\"─\".repeat(w)}┘`;\n    }).join(\"\");\n    const contentWidth = Math.max(id.length + 2, miniMidLine.length + 2);\n    const padCenter = (s: string) => {\n      const leftPad = Math.floor((contentWidth - s.length) / 2);\n      return \" \".repeat(Math.max(0, leftPad)) + s;\n    };\n\n    const dashesTotal = contentWidth - 1; // -1 for the ┴ character\n    const leftDashes = Math.floor(dashesTotal / 2);\n    const rightDashes = dashesTotal - leftDashes;\n\n    return [\n      \" \".repeat(Math.floor(contentWidth / 2)) + \"│\",\n      `┌${\"─\".repeat(leftDashes)}┴${\"─\".repeat(rightDashes)}┐`,\n      `│${padCenter(id)}${\" \".repeat(Math.max(0, contentWidth - padCenter(id).length))}│`,\n      `│${padCenter(miniBoxLine)}${\" \".repeat(Math.max(0, contentWidth - padCenter(miniBoxLine).length))}│`,\n      `│${padCenter(miniMidLine)}${\" \".repeat(Math.max(0, contentWidth - padCenter(miniMidLine).length))}│`,\n      `│${padCenter(miniBotLine)}${\" \".repeat(Math.max(0, contentWidth - padCenter(miniBotLine).length))}│`,\n      `└${\"─\".repeat(contentWidth)}┘`,\n    ];\n  }\n\n  private computeOffset(boxes: [string, string, string, string][], idx: number): number {\n    let offset = 0;\n    for (let i = 0; i < idx; i++) {\n      offset += boxes[i][0].length + 5; // 5 = \"     \" or \" ──→ \"\n    }\n    return offset;\n  }\n\n  private topologicalSort(graph: GraphDescriptor): string[] {\n    const adjacency = new Map<string, string[]>();\n    const inDegree = new Map<string, number>();\n    for (const n of graph.nodes) {\n      adjacency.set(n.id, []);\n      inDegree.set(n.id, 0);\n    }\n    for (const e of graph.edges) {\n      adjacency.get(e.from)?.push(e.to);\n      inDegree.set(e.to, (inDegree.get(e.to) ?? 0) + 1);\n    }\n    const queue = graph.nodes.filter((n) => (inDegree.get(n.id) ?? 0) === 0).map((n) => n.id);\n    const result: string[] = [];\n    while (queue.length > 0) {\n      const id = queue.shift()!;\n      result.push(id);\n      for (const next of adjacency.get(id) ?? []) {\n        const deg = (inDegree.get(next) ?? 1) - 1;\n        inDegree.set(next, deg);\n        if (deg === 0) queue.push(next);\n      }\n    }\n    return result;\n  }\n}\n","// =============================================================================\n// MermaidGraphAdapter — Renders a GraphDescriptor as Mermaid flowchart syntax\n// =============================================================================\n\nimport type {\n  GraphVisualizationPort,\n  GraphDescriptor,\n} from \"../../ports/graph-visualization.port.js\";\n\nexport class MermaidGraphAdapter implements GraphVisualizationPort {\n  toAscii(_graph: GraphDescriptor): string {\n    throw new Error(\"Use AsciiGraphAdapter for ASCII output\");\n  }\n\n  toMermaid(graph: GraphDescriptor): string {\n    const lines: string[] = [\"graph LR\"];\n    const forkNodeIds = new Set(graph.forks.flatMap((f) => f.nodeIds));\n    const sanitize = (id: string) => id.replace(/-/g, \"_\");\n\n    // Node declarations (skip fork-internal nodes, they go inside subgraph)\n    for (const node of graph.nodes) {\n      if (forkNodeIds.has(node.id)) continue;\n      const sid = sanitize(node.id);\n      const label = node.label ?? node.id;\n      lines.push(`  ${sid}[${label}<br>${node.type}]`);\n    }\n\n    // Edges\n    for (const edge of graph.edges) {\n      lines.push(`  ${sanitize(edge.from)} --> ${sanitize(edge.to)}`);\n    }\n\n    // Forks as subgraphs\n    for (const fork of graph.forks) {\n      lines.push(`  subgraph ${fork.id}`);\n      for (const nid of fork.nodeIds) {\n        const node = graph.nodes.find((n) => n.id === nid);\n        const label = node?.label ?? nid;\n        const type = node?.type ?? \"agent\";\n        lines.push(`    ${sanitize(nid)}[${label}<br>${type}]`);\n      }\n      lines.push(\"  end\");\n    }\n\n    return lines.join(\"\\n\");\n  }\n}\n"],"mappings":";AASO,IAAM,oBAAN,MAA0D;AAAA,EAC/D,QAAQ,OAAgC;AACtC,QAAI,MAAM,MAAM,WAAW,EAAG,QAAO;AAErC,UAAM,UAAU,KAAK,gBAAgB,KAAK;AAC1C,UAAM,UAAU,IAAI,IAAI,MAAM,MAAM,IAAI,CAAC,MAAM,CAAC,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;AACjE,UAAM,QAAkB,CAAC;AAGzB,UAAM,QAAQ,QAAQ,IAAI,CAAC,OAAO;AAChC,YAAM,OAAO,MAAM,MAAM,KAAK,CAAC,MAAM,EAAE,OAAO,EAAE;AAChD,aAAO,KAAK,UAAU,KAAK,SAAS,KAAK,IAAI,KAAK,IAAI;AAAA,IACxD,CAAC;AACD,UAAM,UAAU,MAAM,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,KAAK,OAAO;AACnD,UAAM,UAAU,MAAM,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,KAAK,sBAAO;AACnD,UAAM,UAAU,MAAM,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,KAAK,OAAO;AACnD,UAAM,UAAU,MAAM,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,KAAK,OAAO;AACnD,UAAM,KAAK,SAAS,SAAS,SAAS,OAAO;AAG7C,eAAW,CAAC,QAAQ,OAAO,KAAK,SAAS;AACvC,YAAM,MAAM,QAAQ,QAAQ,MAAM;AAClC,UAAI,MAAM,EAAG;AACb,YAAM,SAAS,KAAK,cAAc,OAAO,GAAG;AAC5C,YAAM,KAAK,EAAE;AACb,YAAM,YAAY,KAAK,WAAW,QAAQ,OAAO;AACjD,iBAAW,MAAM,WAAW;AAC1B,cAAM,KAAK,IAAI,OAAO,MAAM,IAAI,EAAE;AAAA,MACpC;AAAA,IACF;AAEA,WAAO,MAAM,KAAK,IAAI;AAAA,EACxB;AAAA,EAEA,UAAU,QAAiC;AACzC,UAAM,IAAI,MAAM,4CAA4C;AAAA,EAC9D;AAAA,EAEQ,UAAU,OAAe,MAAgD;AAC/E,UAAM,QAAQ,KAAK,IAAI,MAAM,QAAQ,KAAK,SAAS,CAAC;AACpD,UAAM,MAAM,CAAC,MAAc,EAAE,OAAO,KAAK;AACzC,WAAO;AAAA,MACL,SAAI,SAAI,OAAO,QAAQ,CAAC,CAAC;AAAA,MACzB,UAAK,IAAI,KAAK,CAAC;AAAA,MACf,UAAK,IAAI,IAAI,IAAI,GAAG,CAAC;AAAA,MACrB,SAAI,SAAI,OAAO,QAAQ,CAAC,CAAC;AAAA,IAC3B;AAAA,EACF;AAAA,EAEQ,WAAW,IAAY,SAA6B;AAC1D,UAAM,cAAc,QAAQ,IAAI,CAAC,QAAQ;AACvC,YAAM,IAAI,IAAI,SAAS;AACvB,aAAO,SAAI,SAAI,OAAO,CAAC,CAAC;AAAA,IAC1B,CAAC,EAAE,KAAK,EAAE;AACV,UAAM,cAAc,QAAQ,IAAI,CAAC,QAAQ,UAAK,GAAG,SAAI,EAAE,KAAK,EAAE;AAC9D,UAAM,cAAc,QAAQ,IAAI,CAAC,QAAQ;AACvC,YAAM,IAAI,IAAI,SAAS;AACvB,aAAO,SAAI,SAAI,OAAO,CAAC,CAAC;AAAA,IAC1B,CAAC,EAAE,KAAK,EAAE;AACV,UAAM,eAAe,KAAK,IAAI,GAAG,SAAS,GAAG,YAAY,SAAS,CAAC;AACnE,UAAM,YAAY,CAAC,MAAc;AAC/B,YAAM,UAAU,KAAK,OAAO,eAAe,EAAE,UAAU,CAAC;AACxD,aAAO,IAAI,OAAO,KAAK,IAAI,GAAG,OAAO,CAAC,IAAI;AAAA,IAC5C;AAEA,UAAM,cAAc,eAAe;AACnC,UAAM,aAAa,KAAK,MAAM,cAAc,CAAC;AAC7C,UAAM,cAAc,cAAc;AAElC,WAAO;AAAA,MACL,IAAI,OAAO,KAAK,MAAM,eAAe,CAAC,CAAC,IAAI;AAAA,MAC3C,SAAI,SAAI,OAAO,UAAU,CAAC,SAAI,SAAI,OAAO,WAAW,CAAC;AAAA,MACrD,SAAI,UAAU,EAAE,CAAC,GAAG,IAAI,OAAO,KAAK,IAAI,GAAG,eAAe,UAAU,EAAE,EAAE,MAAM,CAAC,CAAC;AAAA,MAChF,SAAI,UAAU,WAAW,CAAC,GAAG,IAAI,OAAO,KAAK,IAAI,GAAG,eAAe,UAAU,WAAW,EAAE,MAAM,CAAC,CAAC;AAAA,MAClG,SAAI,UAAU,WAAW,CAAC,GAAG,IAAI,OAAO,KAAK,IAAI,GAAG,eAAe,UAAU,WAAW,EAAE,MAAM,CAAC,CAAC;AAAA,MAClG,SAAI,UAAU,WAAW,CAAC,GAAG,IAAI,OAAO,KAAK,IAAI,GAAG,eAAe,UAAU,WAAW,EAAE,MAAM,CAAC,CAAC;AAAA,MAClG,SAAI,SAAI,OAAO,YAAY,CAAC;AAAA,IAC9B;AAAA,EACF;AAAA,EAEQ,cAAc,OAA2C,KAAqB;AACpF,QAAI,SAAS;AACb,aAAS,IAAI,GAAG,IAAI,KAAK,KAAK;AAC5B,gBAAU,MAAM,CAAC,EAAE,CAAC,EAAE,SAAS;AAAA,IACjC;AACA,WAAO;AAAA,EACT;AAAA,EAEQ,gBAAgB,OAAkC;AACxD,UAAM,YAAY,oBAAI,IAAsB;AAC5C,UAAM,WAAW,oBAAI,IAAoB;AACzC,eAAW,KAAK,MAAM,OAAO;AAC3B,gBAAU,IAAI,EAAE,IAAI,CAAC,CAAC;AACtB,eAAS,IAAI,EAAE,IAAI,CAAC;AAAA,IACtB;AACA,eAAW,KAAK,MAAM,OAAO;AAC3B,gBAAU,IAAI,EAAE,IAAI,GAAG,KAAK,EAAE,EAAE;AAChC,eAAS,IAAI,EAAE,KAAK,SAAS,IAAI,EAAE,EAAE,KAAK,KAAK,CAAC;AAAA,IAClD;AACA,UAAM,QAAQ,MAAM,MAAM,OAAO,CAAC,OAAO,SAAS,IAAI,EAAE,EAAE,KAAK,OAAO,CAAC,EAAE,IAAI,CAAC,MAAM,EAAE,EAAE;AACxF,UAAM,SAAmB,CAAC;AAC1B,WAAO,MAAM,SAAS,GAAG;AACvB,YAAM,KAAK,MAAM,MAAM;AACvB,aAAO,KAAK,EAAE;AACd,iBAAW,QAAQ,UAAU,IAAI,EAAE,KAAK,CAAC,GAAG;AAC1C,cAAM,OAAO,SAAS,IAAI,IAAI,KAAK,KAAK;AACxC,iBAAS,IAAI,MAAM,GAAG;AACtB,YAAI,QAAQ,EAAG,OAAM,KAAK,IAAI;AAAA,MAChC;AAAA,IACF;AACA,WAAO;AAAA,EACT;AACF;;;AChHO,IAAM,sBAAN,MAA4D;AAAA,EACjE,QAAQ,QAAiC;AACvC,UAAM,IAAI,MAAM,wCAAwC;AAAA,EAC1D;AAAA,EAEA,UAAU,OAAgC;AACxC,UAAM,QAAkB,CAAC,UAAU;AACnC,UAAM,cAAc,IAAI,IAAI,MAAM,MAAM,QAAQ,CAAC,MAAM,EAAE,OAAO,CAAC;AACjE,UAAM,WAAW,CAAC,OAAe,GAAG,QAAQ,MAAM,GAAG;AAGrD,eAAW,QAAQ,MAAM,OAAO;AAC9B,UAAI,YAAY,IAAI,KAAK,EAAE,EAAG;AAC9B,YAAM,MAAM,SAAS,KAAK,EAAE;AAC5B,YAAM,QAAQ,KAAK,SAAS,KAAK;AACjC,YAAM,KAAK,KAAK,GAAG,IAAI,KAAK,OAAO,KAAK,IAAI,GAAG;AAAA,IACjD;AAGA,eAAW,QAAQ,MAAM,OAAO;AAC9B,YAAM,KAAK,KAAK,SAAS,KAAK,IAAI,CAAC,QAAQ,SAAS,KAAK,EAAE,CAAC,EAAE;AAAA,IAChE;AAGA,eAAW,QAAQ,MAAM,OAAO;AAC9B,YAAM,KAAK,cAAc,KAAK,EAAE,EAAE;AAClC,iBAAW,OAAO,KAAK,SAAS;AAC9B,cAAM,OAAO,MAAM,MAAM,KAAK,CAAC,MAAM,EAAE,OAAO,GAAG;AACjD,cAAM,QAAQ,MAAM,SAAS;AAC7B,cAAM,OAAO,MAAM,QAAQ;AAC3B,cAAM,KAAK,OAAO,SAAS,GAAG,CAAC,IAAI,KAAK,OAAO,IAAI,GAAG;AAAA,MACxD;AACA,YAAM,KAAK,OAAO;AAAA,IACpB;AAEA,WAAO,MAAM,KAAK,IAAI;AAAA,EACxB;AACF;","names":[]}