@toyako/hive 1.0.0

package/dist/graph/AgentGraph.js

@@ -0,0 +1,274 @@
+"use strict";
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {
+    Object.defineProperty(o, "default", { enumerable: true, value: v });
+}) : function(o, v) {
+    o["default"] = v;
+});
+var __importStar = (this && this.__importStar) || (function () {
+    var ownKeys = function(o) {
+        ownKeys = Object.getOwnPropertyNames || function (o) {
+            var ar = [];
+            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;
+            return ar;
+        };
+        return ownKeys(o);
+    };
+    return function (mod) {
+        if (mod && mod.__esModule) return mod;
+        var result = {};
+        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== "default") __createBinding(result, mod, k[i]);
+        __setModuleDefault(result, mod);
+        return result;
+    };
+})();
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.AgentGraph = void 0;
+const fs = __importStar(require("fs"));
+const path = __importStar(require("path"));
+const GRAPH_FILE = path.resolve(process.cwd(), ".agent-hive/graph.json");
+/**
+ * AgentGraph
+ *
+ * Directed capability graph for agent relationships.
+ * Replaces v1.1's simple reportsTo tree.
+ */
+class AgentGraph {
+    agents = new Map();
+    edges = [];
+    graphFile;
+    constructor(baseDir) {
+        this.graphFile = baseDir ? path.join(baseDir, "graph.json") : GRAPH_FILE;
+        this.loadPersisted();
+    }
+    // ─── Agent Management ─────────────────────────────
+    addAgent(profile) {
+        this.agents.set(profile.id, profile);
+        this.persist();
+    }
+    removeAgent(id) {
+        const deleted = this.agents.delete(id);
+        if (deleted) {
+            this.edges = this.edges.filter(e => e.from !== id && e.to !== id);
+            this.persist();
+        }
+        return deleted;
+    }
+    getAgent(id) {
+        return this.agents.get(id);
+    }
+    allAgents() {
+        return Array.from(this.agents.values());
+    }
+    hasAgent(id) {
+        return this.agents.has(id);
+    }
+    agentsWithCapability(capability) {
+        return this.allAgents().filter(a => {
+            // We'd need to look up runtime capabilities
+            // For now, use agent role as proxy
+            return a.role === capability || a.id.includes(capability);
+        });
+    }
+    agentWithRole(role) {
+        return this.allAgents().find(a => a.role === role);
+    }
+    // ─── Edge Management ──────────────────────────────
+    addEdge(edge) {
+        // Validate agents exist
+        if (!this.agents.has(edge.from)) {
+            throw new Error(`Agent not found: ${edge.from}`);
+        }
+        if (!this.agents.has(edge.to)) {
+            throw new Error(`Agent not found: ${edge.to}`);
+        }
+        // Prevent exact duplicates
+        const exists = this.edges.some(e => e.from === edge.from && e.to === edge.to && e.relation === edge.relation);
+        if (!exists) {
+            this.edges.push(edge);
+            this.persist();
+        }
+    }
+    removeEdge(from, to, relation) {
+        const before = this.edges.length;
+        this.edges = this.edges.filter(e => !(e.from === from && e.to === to && (!relation || e.relation === relation)));
+        if (this.edges.length < before) {
+            this.persist();
+            return true;
+        }
+        return false;
+    }
+    getEdgesFrom(agentId) {
+        return this.edges.filter(e => e.from === agentId);
+    }
+    getEdgesTo(agentId) {
+        return this.edges.filter(e => e.to === agentId);
+    }
+    getEdgesByRelation(relation) {
+        return this.edges.filter(e => e.relation === relation);
+    }
+    allEdges() {
+        return [...this.edges];
+    }
+    // ─── Routing Queries ──────────────────────────────
+    /**
+     * Find the next agent(s) for a given agent based on relation.
+     * Returns sorted by weight (highest first).
+     */
+    getNextAgents(fromAgent, relation) {
+        let edges = this.getEdgesFrom(fromAgent);
+        if (relation) {
+            edges = edges.filter(e => e.relation === relation);
+        }
+        return edges.sort((a, b) => b.weight - a.weight);
+    }
+    /**
+     * Find the reviewer for an executor agent.
+     */
+    findReviewer(executorId) {
+        const reviewEdges = this.edges.filter(e => e.from === executorId && e.relation === "reviews");
+        if (reviewEdges.length > 0) {
+            // Sort by weight, return highest
+            reviewEdges.sort((a, b) => b.weight - a.weight);
+            return reviewEdges[0].to;
+        }
+        // Fallback: find any agent with reviewer role
+        const reviewer = this.agentWithRole("reviewer");
+        return reviewer?.id;
+    }
+    /**
+     * Find escalation target for an agent.
+     */
+    findEscalationTarget(agentId) {
+        const escEdges = this.edges.filter(e => e.from === agentId && e.relation === "escalates");
+        if (escEdges.length > 0) {
+            escEdges.sort((a, b) => b.weight - a.weight);
+            return escEdges[0].to;
+        }
+        return undefined;
+    }
+    /**
+     * Find a path between two agents (BFS).
+     */
+    findPath(from, to, maxDepth = 5) {
+        if (from === to)
+            return [from];
+        const visited = new Set();
+        const queue = [{ node: from, path: [from] }];
+        while (queue.length > 0) {
+            const { node, path: currentPath } = queue.shift();
+            if (currentPath.length > maxDepth)
+                continue;
+            visited.add(node);
+            const nextEdges = this.getEdgesFrom(node);
+            for (const edge of nextEdges) {
+                if (edge.to === to) {
+                    return [...currentPath, to];
+                }
+                if (!visited.has(edge.to)) {
+                    visited.add(edge.to);
+                    queue.push({ node: edge.to, path: [...currentPath, edge.to] });
+                }
+            }
+        }
+        return null; // No path found
+    }
+    /**
+     * Convert v1.1 reportsTo links to graph edges.
+     */
+    migrateFromV1(reportsToMap) {
+        for (const [from, to] of reportsToMap) {
+            // Ensure both agents exist
+            if (!this.agents.has(from)) {
+                this.addAgent({
+                    id: from,
+                    runtimeId: from,
+                    role: "executor",
+                    maxConcurrency: 1,
+                    status: "idle",
+                });
+            }
+            if (!this.agents.has(to)) {
+                this.addAgent({
+                    id: to,
+                    runtimeId: to,
+                    role: "reviewer",
+                    maxConcurrency: 1,
+                    status: "idle",
+                });
+            }
+            // Add review edge (reviews relation: reviewer reviews executor's work)
+            // In v1.1, executor reportsTo reviewer
+            // In v2.0, executor → reviewer (reviews relation)
+            this.addEdge({
+                from,
+                to,
+                relation: "reviews",
+                weight: 10,
+            });
+            // Add escalation edge (reviewer can escalate back to executor)
+            this.addEdge({
+                from: to,
+                to: from,
+                relation: "escalates",
+                weight: 5,
+            });
+        }
+    }
+    // ─── Persistence ──────────────────────────────────
+    persist() {
+        const data = {
+            agents: {},
+            edges: this.edges,
+        };
+        for (const [k, v] of this.agents) {
+            data.agents[k] = v;
+        }
+        fs.mkdirSync(path.dirname(this.graphFile), { recursive: true });
+        fs.writeFileSync(this.graphFile, JSON.stringify(data, null, 2));
+    }
+    loadPersisted() {
+        if (!fs.existsSync(this.graphFile))
+            return;
+        try {
+            const data = JSON.parse(fs.readFileSync(this.graphFile, "utf-8"));
+            for (const [k, v] of Object.entries(data.agents)) {
+                this.agents.set(k, v);
+            }
+            this.edges = data.edges || [];
+        }
+        catch {
+            // Corrupted file, start fresh
+        }
+    }
+    // ─── Serialization ────────────────────────────────
+    toJSON() {
+        const agents = {};
+        for (const [k, v] of this.agents)
+            agents[k] = v;
+        return { agents, edges: [...this.edges] };
+    }
+    toString() {
+        const lines = ["Agent Graph:"];
+        for (const agent of this.allAgents()) {
+            lines.push(`  ${agent.id} [${agent.role}] (runtime: ${agent.runtimeId})`);
+        }
+        lines.push("Edges:");
+        for (const edge of this.edges) {
+            lines.push(`  ${edge.from} --(${edge.relation})--> ${edge.to} (weight: ${edge.weight})`);
+        }
+        return lines.join("\n");
+    }
+}
+exports.AgentGraph = AgentGraph;
+//# sourceMappingURL=AgentGraph.js.map

package/dist/graph/AgentGraph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"AgentGraph.js","sourceRoot":"","sources":["../../src/graph/AgentGraph.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AACA,uCAAyB;AACzB,2CAA6B;AAE7B,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,GAAG,EAAE,EAAE,wBAAwB,CAAC,CAAC;AAEzE;;;;;GAKG;AACH,MAAa,UAAU;IACb,MAAM,GAA8B,IAAI,GAAG,EAAE,CAAC;IAC9C,KAAK,GAAgB,EAAE,CAAC;IACxB,SAAS,CAAS;IAE1B,YAAY,OAAgB;QAC1B,IAAI,CAAC,SAAS,GAAG,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,YAAY,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC;QACzE,IAAI,CAAC,aAAa,EAAE,CAAC;IACvB,CAAC;IAED,qDAAqD;IAErD,QAAQ,CAAC,OAAqB;QAC5B,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;QACrC,IAAI,CAAC,OAAO,EAAE,CAAC;IACjB,CAAC;IAED,WAAW,CAAC,EAAU;QACpB,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACvC,IAAI,OAAO,EAAE,CAAC;YACZ,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,EAAE,IAAI,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC;YAClE,IAAI,CAAC,OAAO,EAAE,CAAC;QACjB,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,QAAQ,CAAC,EAAU;QACjB,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAC7B,CAAC;IAED,SAAS;QACP,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC;IAC1C,CAAC;IAED,QAAQ,CAAC,EAAU;QACjB,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAC7B,CAAC;IAED,oBAAoB,CAAC,UAAkB;QACrC,OAAO,IAAI,CAAC,SAAS,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE;YACjC,4CAA4C;YAC5C,mCAAmC;YACnC,OAAO,CAAC,CAAC,IAAI,KAAK,UAAU,IAAI,CAAC,CAAC,EAAE,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;QAC5D,CAAC,CAAC,CAAC;IACL,CAAC;IAED,aAAa,CAAC,IAAY;QACxB,OAAO,IAAI,CAAC,SAAS,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC;IACrD,CAAC;IAED,qDAAqD;IAErD,OAAO,CAAC,IAAe;QACrB,wBAAwB;QACxB,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;YAChC,MAAM,IAAI,KAAK,CAAC,oBAAoB,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;QACnD,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;YAC9B,MAAM,IAAI,KAAK,CAAC,oBAAoB,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC;QACjD,CAAC;QACD,2BAA2B;QAC3B,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAC5B,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,IAAI,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC,QAAQ,KAAK,IAAI,CAAC,QAAQ,CAC9E,CAAC;QACF,IAAI,CAAC,MAAM,EAAE,CAAC;YACZ,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACtB,IAAI,CAAC,OAAO,EAAE,CAAC;QACjB,CAAC;IACH,CAAC;IAED,UAAU,CAAC,IAAY,EAAE,EAAU,EAAE,QAAuB;QAC1D,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;QACjC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAC5B,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC,QAAQ,KAAK,QAAQ,CAAC,CAAC,CACjF,CAAC;QACF,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,MAAM,EAAE,CAAC;YAC/B,IAAI,CAAC,OAAO,EAAE,CAAC;YACf,OAAO,IAAI,CAAC;QACd,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,YAAY,CAAC,OAAe;QAC1B,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,OAAO,CAAC,CAAC;IACpD,CAAC;IAED,UAAU,CAAC,OAAe;QACxB,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,OAAO,CAAC,CAAC;IAClD,CAAC;IAED,kBAAkB,CAAC,QAAsB;QACvC,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,QAAQ,CAAC,CAAC;IACzD,CAAC;IAED,QAAQ;QACN,OAAO,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC;IACzB,CAAC;IAED,qDAAqD;IAErD;;;OAGG;IACH,aAAa,CAAC,SAAiB,EAAE,QAAuB;QACtD,IAAI,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC;QACzC,IAAI,QAAQ,EAAE,CAAC;YACb,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,QAAQ,CAAC,CAAC;QACrD,CAAC;QACD,OAAO,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC;IACnD,CAAC;IAED;;OAEG;IACH,YAAY,CAAC,UAAkB;QAC7B,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CACnC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,UAAU,IAAI,CAAC,CAAC,QAAQ,KAAK,SAAS,CACvD,CAAC;QACF,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC3B,iCAAiC;YACjC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC;YAChD,OAAO,WAAW,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QAC3B,CAAC;QACD,8CAA8C;QAC9C,MAAM,QAAQ,GAAG,IAAI,CAAC,aAAa,CAAC,UAAU,CAAC,CAAC;QAChD,OAAO,QAAQ,EAAE,EAAE,CAAC;IACtB,CAAC;IAED;;OAEG;IACH,oBAAoB,CAAC,OAAe;QAClC,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAChC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,OAAO,IAAI,CAAC,CAAC,QAAQ,KAAK,WAAW,CACtD,CAAC;QACF,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC;YAC7C,OAAO,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QACxB,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;OAEG;IACH,QAAQ,CAAC,IAAY,EAAE,EAAU,EAAE,WAAmB,CAAC;QACrD,IAAI,IAAI,KAAK,EAAE;YAAE,OAAO,CAAC,IAAI,CAAC,CAAC;QAE/B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,KAAK,GAAuC,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAEjF,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,WAAW,EAAE,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YACnD,IAAI,WAAW,CAAC,MAAM,GAAG,QAAQ;gBAAE,SAAS;YAE5C,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAClB,MAAM,SAAS,GAAG,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;YAE1C,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;gBAC7B,IAAI,IAAI,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC;oBACnB,OAAO,CAAC,GAAG,WAAW,EAAE,EAAE,CAAC,CAAC;gBAC9B,CAAC;gBACD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;oBAC1B,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;oBACrB,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,GAAG,WAAW,EAAE,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;gBACjE,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,IAAI,CAAC,CAAC,gBAAgB;IAC/B,CAAC;IAED;;OAEG;IACH,aAAa,CAAC,YAAiC;QAC7C,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,YAAY,EAAE,CAAC;YACtC,2BAA2B;YAC3B,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC3B,IAAI,CAAC,QAAQ,CAAC;oBACZ,EAAE,EAAE,IAAI;oBACR,SAAS,EAAE,IAAI;oBACf,IAAI,EAAE,UAAU;oBAChB,cAAc,EAAE,CAAC;oBACjB,MAAM,EAAE,MAAM;iBACf,CAAC,CAAC;YACL,CAAC;YACD,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;gBACzB,IAAI,CAAC,QAAQ,CAAC;oBACZ,EAAE,EAAE,EAAE;oBACN,SAAS,EAAE,EAAE;oBACb,IAAI,EAAE,UAAU;oBAChB,cAAc,EAAE,CAAC;oBACjB,MAAM,EAAE,MAAM;iBACf,CAAC,CAAC;YACL,CAAC;YAED,uEAAuE;YACvE,uCAAuC;YACvC,kDAAkD;YAClD,IAAI,CAAC,OAAO,CAAC;gBACX,IAAI;gBACJ,EAAE;gBACF,QAAQ,EAAE,SAAS;gBACnB,MAAM,EAAE,EAAE;aACX,CAAC,CAAC;YACH,+DAA+D;YAC/D,IAAI,CAAC,OAAO,CAAC;gBACX,IAAI,EAAE,EAAE;gBACR,EAAE,EAAE,IAAI;gBACR,QAAQ,EAAE,WAAW;gBACrB,MAAM,EAAE,CAAC;aACV,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,qDAAqD;IAE7C,OAAO;QACb,MAAM,IAAI,GAAmB;YAC3B,MAAM,EAAE,EAAE;YACV,KAAK,EAAE,IAAI,CAAC,KAAK;SAClB,CAAC;QACF,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YACjC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACrB,CAAC;QACD,EAAE,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;QAChE,EAAE,CAAC,aAAa,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;IAClE,CAAC;IAEO,aAAa;QACnB,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC;YAAE,OAAO;QAC3C,IAAI,CAAC;YACH,MAAM,IAAI,GAAmB,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC,CAAC;YAClF,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;gBACjD,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACxB,CAAC;YACD,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;QAChC,CAAC;QAAC,MAAM,CAAC;YACP,8BAA8B;QAChC,CAAC;IACH,CAAC;IAED,qDAAqD;IAErD,MAAM;QACJ,MAAM,MAAM,GAAiC,EAAE,CAAC;QAChD,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,IAAI,CAAC,MAAM;YAAE,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAChD,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;IAC5C,CAAC;IAED,QAAQ;QACN,MAAM,KAAK,GAAa,CAAC,cAAc,CAAC,CAAC;QACzC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,SAAS,EAAE,EAAE,CAAC;YACrC,KAAK,CAAC,IAAI,CAAC,KAAK,KAAK,CAAC,EAAE,KAAK,KAAK,CAAC,IAAI,eAAe,KAAK,CAAC,SAAS,GAAG,CAAC,CAAC;QAC5E,CAAC;QACD,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACrB,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAC9B,KAAK,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,IAAI,OAAO,IAAI,CAAC,QAAQ,QAAQ,IAAI,CAAC,EAAE,aAAa,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;QAC3F,CAAC;QACD,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC1B,CAAC;CACF;AAvQD,gCAuQC"}

package/dist/graph/GraphValidator.d.ts

@@ -0,0 +1,39 @@
+import { AgentGraph } from "./AgentGraph";
+/**
+ * GraphValidator
+ *
+ * Validates agent graph for cycles, isolation, and review loops.
+ */
+export declare class GraphValidator {
+    /**
+     * Detect all cycles in the graph using DFS.
+     * Returns array of cycles, each cycle is an array of agent ids.
+     */
+    detectCycles(graph: AgentGraph): string[][];
+    /**
+     * Detect tight review loops: executor → reviewer → executor with no progress.
+     * These are cycles of length 2 with reviews+escalates relations.
+     */
+    detectReviewLoops(graph: AgentGraph): Array<{
+        executor: string;
+        reviewer: string;
+    }>;
+    /**
+     * Find isolated agents (no incoming or outgoing edges).
+     */
+    findIsolatedAgents(graph: AgentGraph): string[];
+    /**
+     * Full validation report.
+     */
+    validate(graph: AgentGraph): ValidationReport;
+}
+export interface ValidationReport {
+    cycles: string[][];
+    reviewLoops: Array<{
+        executor: string;
+        reviewer: string;
+    }>;
+    isolatedAgents: string[];
+    isValid: boolean;
+}
+//# sourceMappingURL=GraphValidator.d.ts.map

package/dist/graph/GraphValidator.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"GraphValidator.d.ts","sourceRoot":"","sources":["../../src/graph/GraphValidator.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAG1C;;;;GAIG;AACH,qBAAa,cAAc;IACzB;;;OAGG;IACH,YAAY,CAAC,KAAK,EAAE,UAAU,GAAG,MAAM,EAAE,EAAE;IAqC3C;;;OAGG;IACH,iBAAiB,CAAC,KAAK,EAAE,UAAU,GAAG,KAAK,CAAC;QAAE,QAAQ,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAA;KAAE,CAAC;IAmBnF;;OAEG;IACH,kBAAkB,CAAC,KAAK,EAAE,UAAU,GAAG,MAAM,EAAE;IAY/C;;OAEG;IACH,QAAQ,CAAC,KAAK,EAAE,UAAU,GAAG,gBAAgB;CAQ9C;AAED,MAAM,WAAW,gBAAgB;IAC/B,MAAM,EAAE,MAAM,EAAE,EAAE,CAAC;IACnB,WAAW,EAAE,KAAK,CAAC;QAAE,QAAQ,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IAC3D,cAAc,EAAE,MAAM,EAAE,CAAC;IACzB,OAAO,EAAE,OAAO,CAAC;CAClB"}

package/dist/graph/GraphValidator.js

@@ -0,0 +1,93 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.GraphValidator = void 0;
+/**
+ * GraphValidator
+ *
+ * Validates agent graph for cycles, isolation, and review loops.
+ */
+class GraphValidator {
+    /**
+     * Detect all cycles in the graph using DFS.
+     * Returns array of cycles, each cycle is an array of agent ids.
+     */
+    detectCycles(graph) {
+        const cycles = [];
+        const visited = new Set();
+        const inStack = new Set();
+        const path = [];
+        const dfs = (agentId) => {
+            visited.add(agentId);
+            inStack.add(agentId);
+            path.push(agentId);
+            const edges = graph.getEdgesFrom(agentId);
+            for (const edge of edges) {
+                if (!visited.has(edge.to)) {
+                    dfs(edge.to);
+                }
+                else if (inStack.has(edge.to)) {
+                    // Found a cycle
+                    const cycleStart = path.indexOf(edge.to);
+                    if (cycleStart !== -1) {
+                        cycles.push(path.slice(cycleStart).concat(edge.to));
+                    }
+                }
+            }
+            path.pop();
+            inStack.delete(agentId);
+        };
+        for (const agent of graph.allAgents()) {
+            if (!visited.has(agent.id)) {
+                dfs(agent.id);
+            }
+        }
+        return cycles;
+    }
+    /**
+     * Detect tight review loops: executor → reviewer → executor with no progress.
+     * These are cycles of length 2 with reviews+escalates relations.
+     */
+    detectReviewLoops(graph) {
+        const loops = [];
+        const reviewEdges = graph.getEdgesByRelation("reviews");
+        for (const reviewEdge of reviewEdges) {
+            // Check if there's a corresponding escalation edge back
+            const escEdges = graph.getEdgesFrom(reviewEdge.to);
+            const escBack = escEdges.find(e => e.to === reviewEdge.from && e.relation === "escalates");
+            if (escBack) {
+                loops.push({
+                    executor: reviewEdge.from,
+                    reviewer: reviewEdge.to,
+                });
+            }
+        }
+        return loops;
+    }
+    /**
+     * Find isolated agents (no incoming or outgoing edges).
+     */
+    findIsolatedAgents(graph) {
+        const isolated = [];
+        for (const agent of graph.allAgents()) {
+            const incoming = graph.getEdgesTo(agent.id);
+            const outgoing = graph.getEdgesFrom(agent.id);
+            if (incoming.length === 0 && outgoing.length === 0) {
+                isolated.push(agent.id);
+            }
+        }
+        return isolated;
+    }
+    /**
+     * Full validation report.
+     */
+    validate(graph) {
+        return {
+            cycles: this.detectCycles(graph),
+            reviewLoops: this.detectReviewLoops(graph),
+            isolatedAgents: this.findIsolatedAgents(graph),
+            isValid: true, // Will be set below
+        };
+    }
+}
+exports.GraphValidator = GraphValidator;
+//# sourceMappingURL=GraphValidator.js.map

package/dist/graph/GraphValidator.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"GraphValidator.js","sourceRoot":"","sources":["../../src/graph/GraphValidator.ts"],"names":[],"mappings":";;;AAGA;;;;GAIG;AACH,MAAa,cAAc;IACzB;;;OAGG;IACH,YAAY,CAAC,KAAiB;QAC5B,MAAM,MAAM,GAAe,EAAE,CAAC;QAC9B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,IAAI,GAAa,EAAE,CAAC;QAE1B,MAAM,GAAG,GAAG,CAAC,OAAe,EAAE,EAAE;YAC9B,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YACrB,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YACrB,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAEnB,MAAM,KAAK,GAAG,KAAK,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC;YAC1C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACzB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;oBAC1B,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACf,CAAC;qBAAM,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;oBAChC,gBAAgB;oBAChB,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;oBACzC,IAAI,UAAU,KAAK,CAAC,CAAC,EAAE,CAAC;wBACtB,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;oBACtD,CAAC;gBACH,CAAC;YACH,CAAC;YAED,IAAI,CAAC,GAAG,EAAE,CAAC;YACX,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;QAC1B,CAAC,CAAC;QAEF,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,SAAS,EAAE,EAAE,CAAC;YACtC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC;gBAC3B,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;YAChB,CAAC;QACH,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;OAGG;IACH,iBAAiB,CAAC,KAAiB;QACjC,MAAM,KAAK,GAAkD,EAAE,CAAC;QAChE,MAAM,WAAW,GAAG,KAAK,CAAC,kBAAkB,CAAC,SAAS,CAAC,CAAC;QAExD,KAAK,MAAM,UAAU,IAAI,WAAW,EAAE,CAAC;YACrC,wDAAwD;YACxD,MAAM,QAAQ,GAAG,KAAK,CAAC,YAAY,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;YACnD,MAAM,OAAO,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,UAAU,CAAC,IAAI,IAAI,CAAC,CAAC,QAAQ,KAAK,WAAW,CAAC,CAAC;YAC3F,IAAI,OAAO,EAAE,CAAC;gBACZ,KAAK,CAAC,IAAI,CAAC;oBACT,QAAQ,EAAE,UAAU,CAAC,IAAI;oBACzB,QAAQ,EAAE,UAAU,CAAC,EAAE;iBACxB,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;OAEG;IACH,kBAAkB,CAAC,KAAiB;QAClC,MAAM,QAAQ,GAAa,EAAE,CAAC;QAC9B,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,SAAS,EAAE,EAAE,CAAC;YACtC,MAAM,QAAQ,GAAG,KAAK,CAAC,UAAU,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;YAC5C,MAAM,QAAQ,GAAG,KAAK,CAAC,YAAY,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;YAC9C,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACnD,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;YAC1B,CAAC;QACH,CAAC;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;OAEG;IACH,QAAQ,CAAC,KAAiB;QACxB,OAAO;YACL,MAAM,EAAE,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC;YAChC,WAAW,EAAE,IAAI,CAAC,iBAAiB,CAAC,KAAK,CAAC;YAC1C,cAAc,EAAE,IAAI,CAAC,kBAAkB,CAAC,KAAK,CAAC;YAC9C,OAAO,EAAE,IAAI,EAAE,oBAAoB;SACpC,CAAC;IACJ,CAAC;CACF;AA3FD,wCA2FC"}

package/dist/graph/TopologyTemplates.d.ts

@@ -0,0 +1,39 @@
+import { AgentGraph } from "./AgentGraph";
+import { AgentProfile, GraphEdge } from "../types";
+/**
+ * TopologyTemplates
+ *
+ * Pre-built graph templates for common multi-agent patterns.
+ */
+export declare class TopologyTemplates {
+    /**
+     * Simple chain (v1.1 compatible): Executor → Reviewer
+     */
+    static simpleChain(executorRuntime: string, reviewerRuntime: string): TemplateResult;
+    /**
+     * Plan-Execute-Review: Planner → Executor → Reviewer
+     */
+    static planExecuteReview(plannerRuntime: string, executorRuntime: string, reviewerRuntime: string): TemplateResult;
+    /**
+     * Fan-out Review: Executor → [Reviewer1, Reviewer2, Reviewer3] (majority vote)
+     */
+    static fanOutReview(executorRuntime: string, reviewerRuntimes: string[]): TemplateResult;
+    /**
+     * Pipeline: Agent1 → Agent2 → Agent3 → ... (sequential)
+     */
+    static pipeline(runtimes: string[]): TemplateResult;
+    /**
+     * Peer Review: AgentA ↔ AgentB (mutual review)
+     */
+    static peerReview(runtimeA: string, runtimeB: string): TemplateResult;
+    /**
+     * Apply a template to an existing graph.
+     */
+    static apply(graph: AgentGraph, template: TemplateResult): void;
+}
+export interface TemplateResult {
+    agents: AgentProfile[];
+    edges: GraphEdge[];
+    description: string;
+}
+//# sourceMappingURL=TopologyTemplates.d.ts.map

package/dist/graph/TopologyTemplates.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"TopologyTemplates.d.ts","sourceRoot":"","sources":["../../src/graph/TopologyTemplates.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAC1C,OAAO,EAAE,YAAY,EAAE,SAAS,EAAE,MAAM,UAAU,CAAC;AAEnD;;;;GAIG;AACH,qBAAa,iBAAiB;IAC5B;;OAEG;IACH,MAAM,CAAC,WAAW,CAAC,eAAe,EAAE,MAAM,EAAE,eAAe,EAAE,MAAM,GAAG,cAAc;IAYpF;;OAEG;IACH,MAAM,CAAC,iBAAiB,CACtB,cAAc,EAAE,MAAM,EACtB,eAAe,EAAE,MAAM,EACvB,eAAe,EAAE,MAAM,GACtB,cAAc;IAejB;;OAEG;IACH,MAAM,CAAC,YAAY,CACjB,eAAe,EAAE,MAAM,EACvB,gBAAgB,EAAE,MAAM,EAAE,GACzB,cAAc;IA8BjB;;OAEG;IACH,MAAM,CAAC,QAAQ,CAAC,QAAQ,EAAE,MAAM,EAAE,GAAG,cAAc;IA8BnD;;OAEG;IACH,MAAM,CAAC,UAAU,CAAC,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,cAAc;IAcrE;;OAEG;IACH,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,UAAU,EAAE,QAAQ,EAAE,cAAc,GAAG,IAAI;CAUhE;AAED,MAAM,WAAW,cAAc;IAC7B,MAAM,EAAE,YAAY,EAAE,CAAC;IACvB,KAAK,EAAE,SAAS,EAAE,CAAC;IACnB,WAAW,EAAE,MAAM,CAAC;CACrB"}

package/dist/graph/TopologyTemplates.js

@@ -0,0 +1,131 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.TopologyTemplates = void 0;
+/**
+ * TopologyTemplates
+ *
+ * Pre-built graph templates for common multi-agent patterns.
+ */
+class TopologyTemplates {
+    /**
+     * Simple chain (v1.1 compatible): Executor → Reviewer
+     */
+    static simpleChain(executorRuntime, reviewerRuntime) {
+        const agents = [
+            { id: "executor", runtimeId: executorRuntime, role: "executor", maxConcurrency: 1, status: "idle" },
+            { id: "reviewer", runtimeId: reviewerRuntime, role: "reviewer", maxConcurrency: 1, status: "idle" },
+        ];
+        const edges = [
+            { from: "executor", to: "reviewer", relation: "reviews", weight: 10 },
+            { from: "reviewer", to: "executor", relation: "escalates", weight: 5 },
+        ];
+        return { agents, edges, description: "v1.1 compatible: Executor → Reviewer" };
+    }
+    /**
+     * Plan-Execute-Review: Planner → Executor → Reviewer
+     */
+    static planExecuteReview(plannerRuntime, executorRuntime, reviewerRuntime) {
+        const agents = [
+            { id: "planner", runtimeId: plannerRuntime, role: "planner", maxConcurrency: 1, status: "idle" },
+            { id: "executor", runtimeId: executorRuntime, role: "executor", maxConcurrency: 1, status: "idle" },
+            { id: "reviewer", runtimeId: reviewerRuntime, role: "reviewer", maxConcurrency: 1, status: "idle" },
+        ];
+        const edges = [
+            { from: "planner", to: "executor", relation: "delegates", weight: 10 },
+            { from: "executor", to: "reviewer", relation: "reviews", weight: 10 },
+            { from: "reviewer", to: "executor", relation: "escalates", weight: 5 },
+            { from: "reviewer", to: "planner", relation: "provides", weight: 3 },
+        ];
+        return { agents, edges, description: "Planner → Executor → Reviewer" };
+    }
+    /**
+     * Fan-out Review: Executor → [Reviewer1, Reviewer2, Reviewer3] (majority vote)
+     */
+    static fanOutReview(executorRuntime, reviewerRuntimes) {
+        const agents = [
+            { id: "executor", runtimeId: executorRuntime, role: "executor", maxConcurrency: 1, status: "idle" },
+        ];
+        const edges = [];
+        reviewerRuntimes.forEach((runtime, i) => {
+            const reviewerId = `reviewer-${i + 1}`;
+            agents.push({
+                id: reviewerId,
+                runtimeId: runtime,
+                role: "reviewer",
+                maxConcurrency: 1,
+                status: "idle",
+            });
+            edges.push({
+                from: "executor",
+                to: reviewerId,
+                relation: "reviews",
+                weight: 10,
+            });
+        });
+        return {
+            agents,
+            edges,
+            description: `Executor → [${reviewerRuntimes.length} Reviewers] (majority vote)`,
+        };
+    }
+    /**
+     * Pipeline: Agent1 → Agent2 → Agent3 → ... (sequential)
+     */
+    static pipeline(runtimes) {
+        if (runtimes.length < 2) {
+            throw new Error("Pipeline requires at least 2 runtimes");
+        }
+        const agents = runtimes.map((runtime, i) => ({
+            id: `stage-${i + 1}`,
+            runtimeId: runtime,
+            role: i === 0 ? "executor" : i === runtimes.length - 1 ? "reviewer" : "coordinator",
+            maxConcurrency: 1,
+            status: "idle",
+        }));
+        const edges = [];
+        for (let i = 0; i < runtimes.length - 1; i++) {
+            edges.push({
+                from: `stage-${i + 1}`,
+                to: `stage-${i + 2}`,
+                relation: "delegates",
+                weight: 10,
+            });
+        }
+        return {
+            agents,
+            edges,
+            description: `Pipeline: ${runtimes.length} stages sequential`,
+        };
+    }
+    /**
+     * Peer Review: AgentA ↔ AgentB (mutual review)
+     */
+    static peerReview(runtimeA, runtimeB) {
+        const agents = [
+            { id: "agent-a", runtimeId: runtimeA, role: "executor", maxConcurrency: 1, status: "idle" },
+            { id: "agent-b", runtimeId: runtimeB, role: "executor", maxConcurrency: 1, status: "idle" },
+        ];
+        const edges = [
+            { from: "agent-a", to: "agent-b", relation: "reviews", weight: 10 },
+            { from: "agent-b", to: "agent-a", relation: "reviews", weight: 10 },
+            { from: "agent-a", to: "agent-b", relation: "collaborates", weight: 5 },
+            { from: "agent-b", to: "agent-a", relation: "collaborates", weight: 5 },
+        ];
+        return { agents, edges, description: "Peer Review: AgentA ↔ AgentB (mutual)" };
+    }
+    /**
+     * Apply a template to an existing graph.
+     */
+    static apply(graph, template) {
+        for (const agent of template.agents) {
+            if (!graph.hasAgent(agent.id)) {
+                graph.addAgent(agent);
+            }
+        }
+        for (const edge of template.edges) {
+            graph.addEdge(edge);
+        }
+    }
+}
+exports.TopologyTemplates = TopologyTemplates;
+//# sourceMappingURL=TopologyTemplates.js.map

package/dist/graph/TopologyTemplates.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"TopologyTemplates.js","sourceRoot":"","sources":["../../src/graph/TopologyTemplates.ts"],"names":[],"mappings":";;;AAGA;;;;GAIG;AACH,MAAa,iBAAiB;IAC5B;;OAEG;IACH,MAAM,CAAC,WAAW,CAAC,eAAuB,EAAE,eAAuB;QACjE,MAAM,MAAM,GAAmB;YAC7B,EAAE,EAAE,EAAE,UAAU,EAAE,SAAS,EAAE,eAAe,EAAE,IAAI,EAAE,UAAU,EAAE,cAAc,EAAE,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE;YACnG,EAAE,EAAE,EAAE,UAAU,EAAE,SAAS,EAAE,eAAe,EAAE,IAAI,EAAE,UAAU,EAAE,cAAc,EAAE,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE;SACpG,CAAC;QACF,MAAM,KAAK,GAAgB;YACzB,EAAE,IAAI,EAAE,UAAU,EAAE,EAAE,EAAE,UAAU,EAAE,QAAQ,EAAE,SAAS,EAAE,MAAM,EAAE,EAAE,EAAE;YACrE,EAAE,IAAI,EAAE,UAAU,EAAE,EAAE,EAAE,UAAU,EAAE,QAAQ,EAAE,WAAW,EAAE,MAAM,EAAE,CAAC,EAAE;SACvE,CAAC;QACF,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,WAAW,EAAE,sCAAsC,EAAE,CAAC;IAChF,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,iBAAiB,CACtB,cAAsB,EACtB,eAAuB,EACvB,eAAuB;QAEvB,MAAM,MAAM,GAAmB;YAC7B,EAAE,EAAE,EAAE,SAAS,EAAE,SAAS,EAAE,cAAc,EAAE,IAAI,EAAE,SAAS,EAAE,cAAc,EAAE,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE;YAChG,EAAE,EAAE,EAAE,UAAU,EAAE,SAAS,EAAE,eAAe,EAAE,IAAI,EAAE,UAAU,EAAE,cAAc,EAAE,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE;YACnG,EAAE,EAAE,EAAE,UAAU,EAAE,SAAS,EAAE,eAAe,EAAE,IAAI,EAAE,UAAU,EAAE,cAAc,EAAE,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE;SACpG,CAAC;QACF,MAAM,KAAK,GAAgB;YACzB,EAAE,IAAI,EAAE,SAAS,EAAE,EAAE,EAAE,UAAU,EAAE,QAAQ,EAAE,WAAW,EAAE,MAAM,EAAE,EAAE,EAAE;YACtE,EAAE,IAAI,EAAE,UAAU,EAAE,EAAE,EAAE,UAAU,EAAE,QAAQ,EAAE,SAAS,EAAE,MAAM,EAAE,EAAE,EAAE;YACrE,EAAE,IAAI,EAAE,UAAU,EAAE,EAAE,EAAE,UAAU,EAAE,QAAQ,EAAE,WAAW,EAAE,MAAM,EAAE,CAAC,EAAE;YACtE,EAAE,IAAI,EAAE,UAAU,EAAE,EAAE,EAAE,SAAS,EAAE,QAAQ,EAAE,UAAU,EAAE,MAAM,EAAE,CAAC,EAAE;SACrE,CAAC;QACF,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,WAAW,EAAE,+BAA+B,EAAE,CAAC;IACzE,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,YAAY,CACjB,eAAuB,EACvB,gBAA0B;QAE1B,MAAM,MAAM,GAAmB;YAC7B,EAAE,EAAE,EAAE,UAAU,EAAE,SAAS,EAAE,eAAe,EAAE,IAAI,EAAE,UAAU,EAAE,cAAc,EAAE,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE;SACpG,CAAC;QACF,MAAM,KAAK,GAAgB,EAAE,CAAC;QAE9B,gBAAgB,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,CAAC,EAAE,EAAE;YACtC,MAAM,UAAU,GAAG,YAAY,CAAC,GAAG,CAAC,EAAE,CAAC;YACvC,MAAM,CAAC,IAAI,CAAC;gBACV,EAAE,EAAE,UAAU;gBACd,SAAS,EAAE,OAAO;gBAClB,IAAI,EAAE,UAAU;gBAChB,cAAc,EAAE,CAAC;gBACjB,MAAM,EAAE,MAAM;aACf,CAAC,CAAC;YACH,KAAK,CAAC,IAAI,CAAC;gBACT,IAAI,EAAE,UAAU;gBAChB,EAAE,EAAE,UAAU;gBACd,QAAQ,EAAE,SAAS;gBACnB,MAAM,EAAE,EAAE;aACX,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;QAEH,OAAO;YACL,MAAM;YACN,KAAK;YACL,WAAW,EAAE,eAAe,gBAAgB,CAAC,MAAM,6BAA6B;SACjF,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,QAAQ,CAAC,QAAkB;QAChC,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,IAAI,KAAK,CAAC,uCAAuC,CAAC,CAAC;QAC3D,CAAC;QAED,MAAM,MAAM,GAAmB,QAAQ,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;YAC3D,EAAE,EAAE,SAAS,CAAC,GAAG,CAAC,EAAE;YACpB,SAAS,EAAE,OAAO;YAClB,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,UAAmB,CAAC,CAAC,CAAC,CAAC,KAAK,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,UAAmB,CAAC,CAAC,CAAC,aAAsB;YAC9G,cAAc,EAAE,CAAC;YACjB,MAAM,EAAE,MAAe;SACxB,CAAC,CAAC,CAAC;QAEJ,MAAM,KAAK,GAAgB,EAAE,CAAC;QAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7C,KAAK,CAAC,IAAI,CAAC;gBACT,IAAI,EAAE,SAAS,CAAC,GAAG,CAAC,EAAE;gBACtB,EAAE,EAAE,SAAS,CAAC,GAAG,CAAC,EAAE;gBACpB,QAAQ,EAAE,WAAW;gBACrB,MAAM,EAAE,EAAE;aACX,CAAC,CAAC;QACL,CAAC;QAED,OAAO;YACL,MAAM;YACN,KAAK;YACL,WAAW,EAAE,aAAa,QAAQ,CAAC,MAAM,oBAAoB;SAC9D,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,UAAU,CAAC,QAAgB,EAAE,QAAgB;QAClD,MAAM,MAAM,GAAmB;YAC7B,EAAE,EAAE,EAAE,SAAS,EAAE,SAAS,EAAE,QAAQ,EAAE,IAAI,EAAE,UAAU,EAAE,cAAc,EAAE,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE;YAC3F,EAAE,EAAE,EAAE,SAAS,EAAE,SAAS,EAAE,QAAQ,EAAE,IAAI,EAAE,UAAU,EAAE,cAAc,EAAE,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE;SAC5F,CAAC;QACF,MAAM,KAAK,GAAgB;YACzB,EAAE,IAAI,EAAE,SAAS,EAAE,EAAE,EAAE,SAAS,EAAE,QAAQ,EAAE,SAAS,EAAE,MAAM,EAAE,EAAE,EAAE;YACnE,EAAE,IAAI,EAAE,SAAS,EAAE,EAAE,EAAE,SAAS,EAAE,QAAQ,EAAE,SAAS,EAAE,MAAM,EAAE,EAAE,EAAE;YACnE,EAAE,IAAI,EAAE,SAAS,EAAE,EAAE,EAAE,SAAS,EAAE,QAAQ,EAAE,cAAc,EAAE,MAAM,EAAE,CAAC,EAAE;YACvE,EAAE,IAAI,EAAE,SAAS,EAAE,EAAE,EAAE,SAAS,EAAE,QAAQ,EAAE,cAAc,EAAE,MAAM,EAAE,CAAC,EAAE;SACxE,CAAC;QACF,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,WAAW,EAAE,uCAAuC,EAAE,CAAC;IACjF,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,KAAK,CAAC,KAAiB,EAAE,QAAwB;QACtD,KAAK,MAAM,KAAK,IAAI,QAAQ,CAAC,MAAM,EAAE,CAAC;YACpC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC;gBAC9B,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;YACxB,CAAC;QACH,CAAC;QACD,KAAK,MAAM,IAAI,IAAI,QAAQ,CAAC,KAAK,EAAE,CAAC;YAClC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QACtB,CAAC;IACH,CAAC;CACF;AAzID,8CAyIC"}