@decaf-ts/integrations 0.3.8 → 0.3.10

package/lib/esm/graph/engine/loops/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../../src/graph/engine/loops/index.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,6CAA0C;AAC1C,kDAA+C;AAC/C,+CAA4C;AAC5C,8CAA2C;AAC3C,4CAAyC;AACzC,4CAAyC"}

package/lib/esm/graph/engine/pinning/GraphPinningDependencyResolver.js

@@ -0,0 +1,23 @@
+import { GraphTopology } from "./../planning/GraphTopology.js";
+/**
+ * Resolves the upstream dependency subtree of a node for pinning operations.
+ */
+export class GraphPinningDependencyResolver {
+    /**
+     * Returns the set of upstream node ids that the given node depends on,
+     * excluding the workflow boundary.
+     */
+    getDependencies(plan, nodeId) {
+        return GraphTopology.upstreamNodes(nodeId, plan.incomingByNode, false);
+    }
+    /**
+     * Returns the full set of node ids to pin: the node itself plus all its
+     * upstream dependencies.
+     */
+    getPinSet(plan, nodeId) {
+        const deps = this.getDependencies(plan, nodeId);
+        deps.add(nodeId);
+        return deps;
+    }
+}
+//# sourceMappingURL=GraphPinningDependencyResolver.js.map

package/lib/esm/graph/engine/pinning/GraphPinningDependencyResolver.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"GraphPinningDependencyResolver.js","sourceRoot":"","sources":["../../../../../src/graph/engine/pinning/GraphPinningDependencyResolver.ts"],"names":[],"mappings":"AAMA,OAAO,EAAE,aAAa,EAAE,uCAAkC;AAE1D;;GAEG;AACH,MAAM,OAAO,8BAA8B;IACzC;;;OAGG;IACH,eAAe,CAAC,IAAwB,EAAE,MAAc;QACtD,OAAO,aAAa,CAAC,aAAa,CAChC,MAAM,EACN,IAAI,CAAC,cAAc,EACnB,KAAK,CACN,CAAC;IACJ,CAAC;IAED;;;OAGG;IACH,SAAS,CAAC,IAAwB,EAAE,MAAc;QAChD,MAAM,IAAI,GAAG,IAAI,CAAC,eAAe,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QAChD,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACjB,OAAO,IAAI,CAAC;IACd,CAAC;CACF"}

package/lib/esm/graph/engine/pinning/GraphPinningMetadata.js

@@ -0,0 +1,15 @@
+/**
+ * Default pinning metadata applied when `@pinnable()` is used without options.
+ */
+export const DEFAULT_PINNING_METADATA = {
+    enabled: true,
+    strategy: "manual",
+    includeDependencies: true,
+};
+/**
+ * Returns `true` when the given metadata allows pinning.
+ */
+export function isPinnable(metadata) {
+    return metadata?.enabled === true && metadata.strategy !== "disabled";
+}
+//# sourceMappingURL=GraphPinningMetadata.js.map

package/lib/esm/graph/engine/pinning/GraphPinningMetadata.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"GraphPinningMetadata.js","sourceRoot":"","sources":["../../../../../src/graph/engine/pinning/GraphPinningMetadata.ts"],"names":[],"mappings":"AAOA;;GAEG;AACH,MAAM,CAAC,MAAM,wBAAwB,GAAyB;IAC5D,OAAO,EAAE,IAAI;IACb,QAAQ,EAAE,QAAQ;IAClB,mBAAmB,EAAE,IAAI;CAC1B,CAAC;AAEF;;GAEG;AACH,MAAM,UAAU,UAAU,CAAC,QAA0C;IACnE,OAAO,QAAQ,EAAE,OAAO,KAAK,IAAI,IAAI,QAAQ,CAAC,QAAQ,KAAK,UAAU,CAAC;AACxE,CAAC"}

package/lib/esm/graph/engine/pinning/GraphPinningPolicy.js

@@ -0,0 +1,29 @@
+import { DEFAULT_PINNING_METADATA, isPinnable } from "./GraphPinningMetadata.js";
+/**
+ * Policy that decides pinning behaviour for a plan node.
+ */
+export class GraphPinningPolicy {
+    /** Returns whether the node is allowed to be pinned. */
+    canPin(node) {
+        return isPinnable(this.getPinningMetadata(node));
+    }
+    /** Returns whether the engine should attempt to use a pinned value for the node. */
+    shouldUsePinnedValue(node) {
+        const metadata = this.getPinningMetadata(node);
+        return metadata.enabled === true && metadata.strategy !== "disabled";
+    }
+    /** Returns whether automatic pinning should occur after execution. */
+    shouldAutoPin(node) {
+        const metadata = this.getPinningMetadata(node);
+        return metadata.enabled === true && metadata.strategy === "automatic";
+    }
+    /** Extracts pinning metadata from a plan node. */
+    getPinningMetadata(node) {
+        const raw = node.definition?.graph?.metadata?.pinnable ??
+            node.metadata?.pinnable;
+        return raw
+            ? { ...DEFAULT_PINNING_METADATA, ...raw }
+            : { ...DEFAULT_PINNING_METADATA, enabled: false };
+    }
+}
+//# sourceMappingURL=GraphPinningPolicy.js.map

package/lib/esm/graph/engine/pinning/GraphPinningPolicy.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"GraphPinningPolicy.js","sourceRoot":"","sources":["../../../../../src/graph/engine/pinning/GraphPinningPolicy.ts"],"names":[],"mappings":"AAOA,OAAO,EAAE,wBAAwB,EAAE,UAAU,EAAE,kCAA+B;AAE9E;;GAEG;AACH,MAAM,OAAO,kBAAkB;IAC7B,wDAAwD;IACxD,MAAM,CAAC,IAA4B;QACjC,OAAO,UAAU,CAAC,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,CAAC,CAAC;IACnD,CAAC;IAED,oFAAoF;IACpF,oBAAoB,CAAC,IAA4B;QAC/C,MAAM,QAAQ,GAAG,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,CAAC;QAC/C,OAAO,QAAQ,CAAC,OAAO,KAAK,IAAI,IAAI,QAAQ,CAAC,QAAQ,KAAK,UAAU,CAAC;IACvE,CAAC;IAED,sEAAsE;IACtE,aAAa,CAAC,IAA4B;QACxC,MAAM,QAAQ,GAAG,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,CAAC;QAC/C,OAAO,QAAQ,CAAC,OAAO,KAAK,IAAI,IAAI,QAAQ,CAAC,QAAQ,KAAK,WAAW,CAAC;IACxE,CAAC;IAED,kDAAkD;IAClD,kBAAkB,CAAC,IAA4B;QAC7C,MAAM,GAAG,GACN,IAAI,CAAC,UAAkB,EAAE,KAAK,EAAE,QAAQ,EAAE,QAAQ;YAClD,IAAI,CAAC,QAAgB,EAAE,QAAQ,CAAC;QACnC,OAAO,GAAG;YACR,CAAC,CAAC,EAAE,GAAG,wBAAwB,EAAE,GAAG,GAAG,EAAE;YACzC,CAAC,CAAC,EAAE,GAAG,wBAAwB,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC;IACtD,CAAC;CACF"}

package/lib/esm/graph/engine/pinning/GraphPinningService.js

@@ -0,0 +1,186 @@
+/**
+ * @module integrations/graph/pinning/GraphPinningService
+ * @summary Service for pinning and unpinning graph node values.
+ * @description Computes stable fingerprints, pins/unpins nodes and their upstream dependencies, reads pinned values, and emits pinning events. Pinning is all-or-nothing: if any upstream dependency is not pinnable, the operation fails.
+ */
+import { GRAPH_PINNING_METADATA_KEY } from "./../constants.js";
+import { GraphPinningError } from "./../errors/GraphPinningError.js";
+import { GraphTopology } from "./../planning/GraphTopology.js";
+/**
+ * Service that manages pinning and unpinning of graph node values.
+ */
+export class GraphPinningService {
+    constructor(store, policy, dependencyResolver) {
+        this.store = store;
+        this.policy = policy;
+        this.dependencyResolver = dependencyResolver;
+    }
+    /**
+     * Pins a node and all its upstream dependencies.
+     *
+     * @throws {GraphPinningError} when the node or any dependency is not pinnable.
+     */
+    async pinNode(options) {
+        const plan = options.plan;
+        const includeDependencies = options.includeDependencies ?? true;
+        const pinSet = includeDependencies
+            ? this.dependencyResolver.getPinSet(plan, options.nodeId)
+            : new Set([options.nodeId]);
+        // Validate all-or-nothing
+        for (const nodeId of pinSet) {
+            const node = plan.nodes.find((n) => n.id === nodeId);
+            if (!node) {
+                throw new GraphPinningError(`Node '${nodeId}' not found in plan`);
+            }
+            if (!this.policy.canPin(node)) {
+                throw new GraphPinningError(`Node '${nodeId}' is not pinnable`, { nodeId });
+            }
+        }
+        // Pin dependencies first, then the selected node
+        const ordered = this.topologicalOrder(plan, pinSet);
+        for (const nodeId of ordered) {
+            const node = plan.nodes.find((n) => n.id === nodeId);
+            const result = options.result.nodeResults[nodeId];
+            if (!result || !result.outputs) {
+                throw new GraphPinningError(`Node '${nodeId}' has no completed output to pin`);
+            }
+            const inputs = result.inputs ?? {};
+            const depFingerprints = this.dependencyFingerprints(plan, nodeId, options.result);
+            const key = this.createValueKey(options.workflow, node, inputs, depFingerprints, options.namespace);
+            const now = new Date().toISOString();
+            const cached = {
+                key,
+                outputs: result.outputs,
+                pinned: true,
+                createdAt: now,
+                updatedAt: now,
+                metadata: { ...options.result.metadata, nodeId },
+            };
+            await this.store.writeCached(key, cached);
+        }
+    }
+    /**
+     * Unpins a single node (does not unpin dependents in v1).
+     */
+    async unpinNode(options) {
+        const key = {
+            workflowId: options.workflow.name,
+            nodeId: options.nodeId,
+            fingerprint: options.fingerprint,
+            namespace: options.namespace,
+        };
+        await this.store.deleteCached(key);
+    }
+    /**
+     * Reads a pinned value for a node, returning `undefined` when no valid
+     * pinned value exists.
+     */
+    async readPinnedValue(workflow, node, inputs, dependencyFingerprints, namespace) {
+        const key = this.createValueKey(workflow, node, inputs, dependencyFingerprints, namespace);
+        const cached = await this.store.readCached(key);
+        if (cached && cached.pinned) {
+            if (cached.expiresAt && new Date(cached.expiresAt) < new Date()) {
+                return undefined;
+            }
+            return cached;
+        }
+        return undefined;
+    }
+    /**
+     * Creates a stable value key for a node.
+     */
+    createValueKey(workflow, node, inputs, dependencyFingerprints, namespace) {
+        return {
+            workflowId: workflow.name,
+            nodeId: node.id,
+            fingerprint: this.computeFingerprint(workflow, node, inputs, dependencyFingerprints),
+            namespace,
+        };
+    }
+    /**
+     * Computes a stable fingerprint for a node's inputs and dependencies.
+     */
+    computeFingerprint(workflow, node, inputs, dependencyFingerprints) {
+        const data = {
+            workflowId: workflow.name,
+            nodeId: node.id,
+            nodeKind: node.kind,
+            nodeDefinitionVersion: node.definition?.graph?.metadata?.version,
+            inputs: this.stableSerialize(inputs),
+            dependencyFingerprints: this.stableSerialize(dependencyFingerprints),
+        };
+        const json = this.stableSerialize(data);
+        // Use a deterministic non-cryptographic hash that works in both browser
+        // and Node environments without requiring `node:crypto`.
+        return this.simpleHash(json);
+    }
+    /**
+     * Returns a topological ordering of the given node set.
+     */
+    topologicalOrder(plan, nodeSet) {
+        const result = [];
+        const visited = new Set();
+        const visit = (nodeId) => {
+            if (visited.has(nodeId))
+                return;
+            visited.add(nodeId);
+            const deps = GraphTopology.upstreamNodes(nodeId, plan.incomingByNode, false);
+            for (const dep of deps) {
+                if (nodeSet.has(dep))
+                    visit(dep);
+            }
+            result.push(nodeId);
+        };
+        for (const nodeId of nodeSet)
+            visit(nodeId);
+        return result;
+    }
+    /**
+     * Computes fingerprints for all upstream dependencies of a node.
+     */
+    dependencyFingerprints(plan, nodeId, result) {
+        const deps = this.dependencyResolver.getDependencies(plan, nodeId);
+        const fingerprints = {};
+        for (const dep of deps) {
+            const node = plan.nodes.find((n) => n.id === dep);
+            if (node) {
+                const depResult = result.nodeResults[dep];
+                const inputs = depResult?.inputs ?? {};
+                const nestedDeps = this.dependencyFingerprints(plan, dep, result);
+                fingerprints[dep] = this.computeFingerprint(plan.workflow, node, inputs, nestedDeps);
+            }
+        }
+        return fingerprints;
+    }
+    /**
+     * Serializes a value with recursively sorted keys for stable hashing.
+     */
+    stableSerialize(value) {
+        if (value === null || typeof value !== "object") {
+            return JSON.stringify(value);
+        }
+        if (Array.isArray(value)) {
+            return `[${value.map((v) => this.stableSerialize(v)).join(",")}]`;
+        }
+        const keys = Object.keys(value).sort();
+        const pairs = keys.map((k) => `${JSON.stringify(k)}:${this.stableSerialize(value[k])}`);
+        return `{${pairs.join(",")}}`;
+    }
+    /**
+     * Simple non-cryptographic hash for browser environments where
+     * `node:crypto` is unavailable. Produces a deterministic hex-like string
+     * from the input. This is NOT cryptographically secure but is sufficient
+     * for fingerprint-based cache keys.
+     */
+    simpleHash(str) {
+        let hash = 0;
+        for (let i = 0; i < str.length; i++) {
+            const char = str.charCodeAt(i);
+            hash = (hash << 5) - hash + char;
+            hash |= 0;
+        }
+        return `fp_${Math.abs(hash).toString(16).padStart(8, "0")}_${str.length}`;
+    }
+}
+void GRAPH_PINNING_METADATA_KEY;
+//# sourceMappingURL=GraphPinningService.js.map

package/lib/esm/graph/engine/pinning/GraphPinningService.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"GraphPinningService.js","sourceRoot":"","sources":["../../../../../src/graph/engine/pinning/GraphPinningService.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,OAAO,EAAE,0BAA0B,EAAE,0BAAqB;AAC1D,OAAO,EAAE,iBAAiB,EAAE,yCAAoC;AAGhE,OAAO,EAAE,aAAa,EAAE,uCAAkC;AAe1D;;GAEG;AACH,MAAM,OAAO,mBAAmB;IAC9B,YACmB,KAAsB,EACtB,MAA0B,EAC1B,kBAAkD;QAFlD,UAAK,GAAL,KAAK,CAAiB;QACtB,WAAM,GAAN,MAAM,CAAoB;QAC1B,uBAAkB,GAAlB,kBAAkB,CAAgC;IAClE,CAAC;IAEJ;;;;OAIG;IACH,KAAK,CAAC,OAAO,CAAC,OAA4B;QACxC,MAAM,IAAI,GAAG,OAAO,CAAC,IAA0B,CAAC;QAChD,MAAM,mBAAmB,GAAG,OAAO,CAAC,mBAAmB,IAAI,IAAI,CAAC;QAEhE,MAAM,MAAM,GAAG,mBAAmB;YAChC,CAAC,CAAC,IAAI,CAAC,kBAAkB,CAAC,SAAS,CAAC,IAAI,EAAE,OAAO,CAAC,MAAM,CAAC;YACzD,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC;QAE9B,0BAA0B;QAC1B,KAAK,MAAM,MAAM,IAAI,MAAM,EAAE,CAAC;YAC5B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,MAAM,CAAC,CAAC;YACrD,IAAI,CAAC,IAAI,EAAE,CAAC;gBACV,MAAM,IAAI,iBAAiB,CAAC,SAAS,MAAM,qBAAqB,CAAC,CAAC;YACpE,CAAC;YACD,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC9B,MAAM,IAAI,iBAAiB,CACzB,SAAS,MAAM,mBAAmB,EAClC,EAAE,MAAM,EAAE,CACX,CAAC;YACJ,CAAC;QACH,CAAC;QAED,iDAAiD;QACjD,MAAM,OAAO,GAAG,IAAI,CAAC,gBAAgB,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QACpD,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,MAAM,CAAE,CAAC;YACtD,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;YAClD,IAAI,CAAC,MAAM,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;gBAC/B,MAAM,IAAI,iBAAiB,CACzB,SAAS,MAAM,kCAAkC,CAClD,CAAC;YACJ,CAAC;YACD,MAAM,MAAM,GAAG,MAAM,CAAC,MAAM,IAAI,EAAE,CAAC;YACnC,MAAM,eAAe,GAAG,IAAI,CAAC,sBAAsB,CAAC,IAAI,EAAE,MAAM,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC;YAClF,MAAM,GAAG,GAAG,IAAI,CAAC,cAAc,CAAC,OAAO,CAAC,QAAQ,EAAE,IAAI,EAAE,MAAM,EAAE,eAAe,EAAE,OAAO,CAAC,SAAS,CAAC,CAAC;YACpG,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;YACrC,MAAM,MAAM,GAAqB;gBAC/B,GAAG;gBACH,OAAO,EAAE,MAAM,CAAC,OAAO;gBACvB,MAAM,EAAE,IAAI;gBACZ,SAAS,EAAE,GAAG;gBACd,SAAS,EAAE,GAAG;gBACd,QAAQ,EAAE,EAAE,GAAG,OAAO,CAAC,MAAM,CAAC,QAAQ,EAAE,MAAM,EAAE;aACjD,CAAC;YACF,MAAM,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;QAC5C,CAAC;IACH,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,SAAS,CAAC,OAA8B;QAC5C,MAAM,GAAG,GAAkB;YACzB,UAAU,EAAE,OAAO,CAAC,QAAQ,CAAC,IAAI;YACjC,MAAM,EAAE,OAAO,CAAC,MAAM;YACtB,WAAW,EAAE,OAAO,CAAC,WAAW;YAChC,SAAS,EAAE,OAAO,CAAC,SAAS;SAC7B,CAAC;QACF,MAAM,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC;IACrC,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,eAAe,CACnB,QAAiC,EACjC,IAA4B,EAC5B,MAA4B,EAC5B,sBAA8C,EAC9C,SAAkB;QAElB,MAAM,GAAG,GAAG,IAAI,CAAC,cAAc,CAAC,QAAQ,EAAE,IAAI,EAAE,MAAM,EAAE,sBAAsB,EAAE,SAAS,CAAC,CAAC;QAC3F,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;QAChD,IAAI,MAAM,IAAI,MAAM,CAAC,MAAM,EAAE,CAAC;YAC5B,IAAI,MAAM,CAAC,SAAS,IAAI,IAAI,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,GAAG,IAAI,IAAI,EAAE,EAAE,CAAC;gBAChE,OAAO,SAAS,CAAC;YACnB,CAAC;YACD,OAAO,MAAM,CAAC;QAChB,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;OAEG;IACH,cAAc,CACZ,QAAiC,EACjC,IAA4B,EAC5B,MAA4B,EAC5B,sBAA8C,EAC9C,SAAkB;QAElB,OAAO;YACL,UAAU,EAAE,QAAQ,CAAC,IAAI;YACzB,MAAM,EAAE,IAAI,CAAC,EAAE;YACf,WAAW,EAAE,IAAI,CAAC,kBAAkB,CAAC,QAAQ,EAAE,IAAI,EAAE,MAAM,EAAE,sBAAsB,CAAC;YACpF,SAAS;SACV,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,kBAAkB,CAChB,QAAiC,EACjC,IAA4B,EAC5B,MAA4B,EAC5B,sBAA8C;QAE9C,MAAM,IAAI,GAAG;YACX,UAAU,EAAE,QAAQ,CAAC,IAAI;YACzB,MAAM,EAAE,IAAI,CAAC,EAAE;YACf,QAAQ,EAAE,IAAI,CAAC,IAAI;YACnB,qBAAqB,EAAG,IAAI,CAAC,UAAkB,EAAE,KAAK,EAAE,QAAQ,EAAE,OAAO;YACzE,MAAM,EAAE,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC;YACpC,sBAAsB,EAAE,IAAI,CAAC,eAAe,CAAC,sBAAsB,CAAC;SACrE,CAAC;QACF,MAAM,IAAI,GAAG,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC;QACxC,wEAAwE;QACxE,yDAAyD;QACzD,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;IAC/B,CAAC;IAED;;OAEG;IACK,gBAAgB,CACtB,IAAwB,EACxB,OAAoB;QAEpB,MAAM,MAAM,GAAa,EAAE,CAAC;QAC5B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,KAAK,GAAG,CAAC,MAAc,EAAE,EAAE;YAC/B,IAAI,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC;gBAAE,OAAO;YAChC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACpB,MAAM,IAAI,GAAG,aAAa,CAAC,aAAa,CAAC,MAAM,EAAE,IAAI,CAAC,cAAc,EAAE,KAAK,CAAC,CAAC;YAC7E,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;gBACvB,IAAI,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC;oBAAE,KAAK,CAAC,GAAG,CAAC,CAAC;YACnC,CAAC;YACD,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACtB,CAAC,CAAC;QACF,KAAK,MAAM,MAAM,IAAI,OAAO;YAAE,KAAK,CAAC,MAAM,CAAC,CAAC;QAC5C,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACK,sBAAsB,CAC5B,IAAwB,EACxB,MAAc,EACd,MAA4B;QAE5B,MAAM,IAAI,GAAG,IAAI,CAAC,kBAAkB,CAAC,eAAe,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QACnE,MAAM,YAAY,GAA2B,EAAE,CAAC;QAChD,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC;YAClD,IAAI,IAAI,EAAE,CAAC;gBACT,MAAM,SAAS,GAAG,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;gBAC1C,MAAM,MAAM,GAAG,SAAS,EAAE,MAAM,IAAI,EAAE,CAAC;gBACvC,MAAM,UAAU,GAAG,IAAI,CAAC,sBAAsB,CAAC,IAAI,EAAE,GAAG,EAAE,MAAM,CAAC,CAAC;gBAClE,YAAY,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,EAAE,MAAM,EAAE,UAAU,CAAC,CAAC;YACvF,CAAC;QACH,CAAC;QACD,OAAO,YAAY,CAAC;IACtB,CAAC;IAED;;OAEG;IACK,eAAe,CAAC,KAAc;QACpC,IAAI,KAAK,KAAK,IAAI,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;YAChD,OAAO,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;QAC/B,CAAC;QACD,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;YACzB,OAAO,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;QACpE,CAAC;QACD,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC;QACvC,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CACpB,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,eAAe,CAAE,KAAa,CAAC,CAAC,CAAC,CAAC,EAAE,CACzE,CAAC;QACF,OAAO,IAAI,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;IAChC,CAAC;IAED;;;;;OAKG;IACK,UAAU,CAAC,GAAW;QAC5B,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACpC,MAAM,IAAI,GAAG,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YAC/B,IAAI,GAAG,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,IAAI,GAAG,IAAI,CAAC;YACjC,IAAI,IAAI,CAAC,CAAC;QACZ,CAAC;QACD,OAAO,MAAM,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,IAAI,GAAG,CAAC,MAAM,EAAE,CAAC;IAC5E,CAAC;CACF;AAED,KAAK,0BAA0B,CAAC"}

package/lib/esm/graph/engine/pinning/index.js

@@ -0,0 +1,10 @@
+/**
+ * @module integrations/graph/pinning
+ * @summary Graph pinning subsystem.
+ * @description Re-exports the pinning metadata, policy, dependency resolver, and service.
+ */
+export * from "./GraphPinningMetadata.js";
+export * from "./GraphPinningPolicy.js";
+export * from "./GraphPinningDependencyResolver.js";
+export * from "./GraphPinningService.js";
+//# sourceMappingURL=index.js.map

package/lib/esm/graph/engine/pinning/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../../src/graph/engine/pinning/index.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,0CAAuC;AACvC,wCAAqC;AACrC,oDAAiD;AACjD,yCAAsC"}

package/lib/esm/graph/engine/planning/GraphExecutionPlan.js

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=GraphExecutionPlan.js.map

package/lib/esm/graph/engine/planning/GraphExecutionPlan.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"GraphExecutionPlan.js","sourceRoot":"","sources":["../../../../../src/graph/engine/planning/GraphExecutionPlan.ts"],"names":[],"mappings":""}

package/lib/esm/graph/engine/planning/GraphExecutionPlanEdge.js

@@ -0,0 +1,7 @@
+/**
+ * @module integrations/graph/planning/GraphExecutionPlanEdge
+ * @summary Plan edge type for the execution plan.
+ * @description Represents a directed value route between two endpoints (node-to-node or node-to-workflow-boundary).
+ */
+export {};
+//# sourceMappingURL=GraphExecutionPlanEdge.js.map

package/lib/esm/graph/engine/planning/GraphExecutionPlanEdge.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"GraphExecutionPlanEdge.js","sourceRoot":"","sources":["../../../../../src/graph/engine/planning/GraphExecutionPlanEdge.ts"],"names":[],"mappings":"AAAA;;;;GAIG"}

package/lib/esm/graph/engine/planning/GraphExecutionPlanLayer.js

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=GraphExecutionPlanLayer.js.map

package/lib/esm/graph/engine/planning/GraphExecutionPlanLayer.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"GraphExecutionPlanLayer.js","sourceRoot":"","sources":["../../../../../src/graph/engine/planning/GraphExecutionPlanLayer.ts"],"names":[],"mappings":""}

package/lib/esm/graph/engine/planning/GraphExecutionPlanNode.js

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=GraphExecutionPlanNode.js.map

package/lib/esm/graph/engine/planning/GraphExecutionPlanNode.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"GraphExecutionPlanNode.js","sourceRoot":"","sources":["../../../../../src/graph/engine/planning/GraphExecutionPlanNode.ts"],"names":[],"mappings":""}

package/lib/esm/graph/engine/planning/GraphExecutionPlanner.js

@@ -0,0 +1,192 @@
+import { graphDefinitionOf } from "@decaf-ts/ui-decorators/graph";
+import { GRAPH_WORKFLOW_BOUNDARY } from "./../constants.js";
+import { GraphCycleError } from "./../errors/GraphCycleError.js";
+import { GraphTopologyError } from "./../errors/GraphTopologyError.js";
+import { GraphRelationResolver } from "./GraphRelationResolver.js";
+/**
+ * Planner that turns a {@link GraphWorkflowDefinition} into a
+ * {@link GraphExecutionPlan} with topological layers.
+ */
+export class GraphExecutionPlanner {
+    constructor(resolver) {
+        this.resolver = resolver ?? new GraphRelationResolver();
+    }
+    /**
+     * Plans a workflow for execution.
+     *
+     * @param workflow - The workflow definition to plan.
+     * @returns The execution plan with nodes, edges, layers, and maps.
+     * @throws {GraphTopologyError} when node IDs are not unique.
+     * @throws {GraphCycleError} when the workflow contains an unsupported cycle.
+     */
+    plan(workflow) {
+        this.validateUniqueNodeIds(workflow);
+        const nodes = this.resolveNodes(workflow);
+        const edges = this.resolver.resolve(workflow);
+        const incomingByNode = this.buildIncomingMap(edges);
+        const outgoingByNode = this.buildOutgoingMap(edges);
+        const layers = this.topologicalLayers(nodes, edges);
+        return {
+            workflow,
+            workflowId: workflow.name,
+            nodes,
+            edges,
+            layers,
+            incomingByNode,
+            outgoingByNode,
+        };
+    }
+    /**
+     * Validates that all workflow node IDs are unique.
+     */
+    validateUniqueNodeIds(workflow) {
+        const seen = new Set();
+        for (const node of workflow.nodes ?? []) {
+            if (seen.has(node.id)) {
+                throw new GraphTopologyError(`Duplicate node id '${node.id}' in workflow '${workflow.name}'`, { nodeId: node.id, workflowId: workflow.name });
+            }
+            seen.add(node.id);
+        }
+    }
+    /**
+     * Resolves workflow node metadata into plan nodes with full definitions.
+     */
+    resolveNodes(workflow) {
+        const result = [];
+        for (const nodeMeta of workflow.nodes ?? []) {
+            const definition = this.resolveDefinition(nodeMeta);
+            const inputPorts = (definition.ports ?? [])
+                .filter((p) => p.direction === "input")
+                .map((p) => p.name);
+            const outputPorts = (definition.ports ?? [])
+                .filter((p) => p.direction === "output")
+                .map((p) => p.name);
+            result.push({
+                id: nodeMeta.id,
+                kind: nodeMeta.kind ?? definition.kind ?? nodeMeta.id,
+                label: nodeMeta.label,
+                source: nodeMeta,
+                definition,
+                inputPorts,
+                outputPorts,
+                metadata: nodeMeta.metadata,
+            });
+        }
+        return result;
+    }
+    /**
+     * Attempts to resolve the full graph node definition from metadata.
+     *
+     * Accepts either a decorated Model class/instance (resolved via
+     * `graphDefinitionOf`) or a plain `GraphNodeDefinition`-shaped object
+     * (useful for serialized workflows that inline node definitions).
+     */
+    resolveDefinition(nodeMeta) {
+        if (nodeMeta.node) {
+            if (this.isRawDefinition(nodeMeta.node)) {
+                return nodeMeta.node;
+            }
+            try {
+                return graphDefinitionOf(nodeMeta.node);
+            }
+            catch {
+                // fall through to stub
+            }
+        }
+        // Return a minimal stub definition so planning can proceed
+        return {
+            name: nodeMeta.id,
+            tag: nodeMeta.id,
+            kind: nodeMeta.kind ?? nodeMeta.id,
+            labels: [],
+            ports: [],
+        };
+    }
+    /**
+     * Returns `true` when a value looks like a raw {@link GraphNodeDefinition}
+     * (a plain object with a `ports` array and a `name` string).
+     */
+    isRawDefinition(value) {
+        return (typeof value === "object" &&
+            value !== null &&
+            !Array.isArray(value) &&
+            typeof value.name === "string" &&
+            Array.isArray(value.ports));
+    }
+    /**
+     * Builds a map of node id -> incoming edges.
+     */
+    buildIncomingMap(edges) {
+        const map = new Map();
+        for (const edge of edges) {
+            const list = map.get(edge.targetNodeId) ?? [];
+            list.push(edge);
+            map.set(edge.targetNodeId, list);
+        }
+        return map;
+    }
+    /**
+     * Builds a map of node id -> outgoing edges.
+     */
+    buildOutgoingMap(edges) {
+        const map = new Map();
+        for (const edge of edges) {
+            const list = map.get(edge.sourceNodeId) ?? [];
+            list.push(edge);
+            map.set(edge.sourceNodeId, list);
+        }
+        return map;
+    }
+    /**
+     * Produces topological layers using Kahn's algorithm.
+     *
+     * Workflow boundary edges do not count as executable-node dependencies.
+     */
+    topologicalLayers(nodes, edges) {
+        const executableNodes = nodes.filter((n) => n.id !== GRAPH_WORKFLOW_BOUNDARY);
+        const nodeIds = new Set(executableNodes.map((n) => n.id));
+        // Only edges between two executable nodes count as dependencies
+        const execEdges = edges.filter((e) => nodeIds.has(e.sourceNodeId) && nodeIds.has(e.targetNodeId));
+        // Compute in-degree
+        const indegree = new Map();
+        for (const node of executableNodes)
+            indegree.set(node.id, 0);
+        for (const edge of execEdges) {
+            indegree.set(edge.targetNodeId, (indegree.get(edge.targetNodeId) ?? 0) + 1);
+        }
+        const layers = [];
+        const planned = new Set();
+        let ready = executableNodes.filter((n) => (indegree.get(n.id) ?? 0) === 0);
+        let layerIndex = 0;
+        while (ready.length > 0) {
+            const layer = { index: layerIndex++, nodes: ready };
+            layers.push(layer);
+            const nextReady = [];
+            for (const node of ready) {
+                planned.add(node.id);
+                const outgoing = execEdges.filter((e) => e.sourceNodeId === node.id);
+                for (const edge of outgoing) {
+                    const deg = (indegree.get(edge.targetNodeId) ?? 1) - 1;
+                    indegree.set(edge.targetNodeId, deg);
+                    if (deg === 0 && !planned.has(edge.targetNodeId)) {
+                        const next = executableNodes.find((n) => n.id === edge.targetNodeId);
+                        if (next)
+                            nextReady.push(next);
+                    }
+                }
+            }
+            ready = nextReady;
+        }
+        if (planned.size !== executableNodes.length) {
+            const unplanned = executableNodes
+                .filter((n) => !planned.has(n.id))
+                .map((n) => n.id);
+            throw new GraphCycleError({
+                unplannedNodes: unplanned,
+                workflowId: nodes[0]?.definition?.name,
+            });
+        }
+        return layers;
+    }
+}
+//# sourceMappingURL=GraphExecutionPlanner.js.map

package/lib/esm/graph/engine/planning/GraphExecutionPlanner.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"GraphExecutionPlanner.js","sourceRoot":"","sources":["../../../../../src/graph/engine/planning/GraphExecutionPlanner.ts"],"names":[],"mappings":"AASA,OAAO,EAAE,iBAAiB,EAAE,MAAM,+BAA+B,CAAC;AAElE,OAAO,EAAE,uBAAuB,EAAE,0BAAqB;AACvD,OAAO,EAAE,eAAe,EAAE,uCAAkC;AAC5D,OAAO,EAAE,kBAAkB,EAAE,0CAAqC;AAKlE,OAAO,EAAE,qBAAqB,EAAE,mCAAgC;AAEhE;;;GAGG;AACH,MAAM,OAAO,qBAAqB;IAGhC,YAAY,QAAgC;QAC1C,IAAI,CAAC,QAAQ,GAAG,QAAQ,IAAI,IAAI,qBAAqB,EAAE,CAAC;IAC1D,CAAC;IAED;;;;;;;OAOG;IACH,IAAI,CAAC,QAAiC;QACpC,IAAI,CAAC,qBAAqB,CAAC,QAAQ,CAAC,CAAC;QAErC,MAAM,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC;QAC1C,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;QAE9C,MAAM,cAAc,GAAG,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAC;QACpD,MAAM,cAAc,GAAG,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAC;QAEpD,MAAM,MAAM,GAAG,IAAI,CAAC,iBAAiB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QAEpD,OAAO;YACL,QAAQ;YACR,UAAU,EAAE,QAAQ,CAAC,IAAI;YACzB,KAAK;YACL,KAAK;YACL,MAAM;YACN,cAAc;YACd,cAAc;SACf,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,qBAAqB,CAAC,QAAiC;QAC7D,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;QAC/B,KAAK,MAAM,IAAI,IAAI,QAAQ,CAAC,KAAK,IAAI,EAAE,EAAE,CAAC;YACxC,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;gBACtB,MAAM,IAAI,kBAAkB,CAC1B,sBAAsB,IAAI,CAAC,EAAE,kBAAkB,QAAQ,CAAC,IAAI,GAAG,EAC/D,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,EAAE,UAAU,EAAE,QAAQ,CAAC,IAAI,EAAE,CAC/C,CAAC;YACJ,CAAC;YACD,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACpB,CAAC;IACH,CAAC;IAED;;OAEG;IACK,YAAY,CAClB,QAAiC;QAEjC,MAAM,MAAM,GAA6B,EAAE,CAAC;QAC5C,KAAK,MAAM,QAAQ,IAAI,QAAQ,CAAC,KAAK,IAAI,EAAE,EAAE,CAAC;YAC5C,MAAM,UAAU,GAAG,IAAI,CAAC,iBAAiB,CAAC,QAAQ,CAAC,CAAC;YACpD,MAAM,UAAU,GAAG,CAAC,UAAU,CAAC,KAAK,IAAI,EAAE,CAAC;iBACxC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,KAAK,OAAO,CAAC;iBACtC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YACtB,MAAM,WAAW,GAAG,CAAC,UAAU,CAAC,KAAK,IAAI,EAAE,CAAC;iBACzC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,KAAK,QAAQ,CAAC;iBACvC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YACtB,MAAM,CAAC,IAAI,CAAC;gBACV,EAAE,EAAE,QAAQ,CAAC,EAAE;gBACf,IAAI,EAAE,QAAQ,CAAC,IAAI,IAAI,UAAU,CAAC,IAAI,IAAI,QAAQ,CAAC,EAAE;gBACrD,KAAK,EAAE,QAAQ,CAAC,KAAK;gBACrB,MAAM,EAAE,QAAQ;gBAChB,UAAU;gBACV,UAAU;gBACV,WAAW;gBACX,QAAQ,EAAE,QAAQ,CAAC,QAAQ;aAC5B,CAAC,CAAC;QACL,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;;OAMG;IACK,iBAAiB,CAAC,QAIzB;QACC,IAAI,QAAQ,CAAC,IAAI,EAAE,CAAC;YAClB,IAAI,IAAI,CAAC,eAAe,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;gBACxC,OAAO,QAAQ,CAAC,IAA2B,CAAC;YAC9C,CAAC;YACD,IAAI,CAAC;gBACH,OAAO,iBAAiB,CAAC,QAAQ,CAAC,IAAW,CAAC,CAAC;YACjD,CAAC;YAAC,MAAM,CAAC;gBACP,uBAAuB;YACzB,CAAC;QACH,CAAC;QACD,2DAA2D;QAC3D,OAAO;YACL,IAAI,EAAE,QAAQ,CAAC,EAAE;YACjB,GAAG,EAAE,QAAQ,CAAC,EAAE;YAChB,IAAI,EAAE,QAAQ,CAAC,IAAI,IAAI,QAAQ,CAAC,EAAE;YAClC,MAAM,EAAE,EAAE;YACV,KAAK,EAAE,EAAE;SACV,CAAC;IACJ,CAAC;IAED;;;OAGG;IACK,eAAe,CAAC,KAAc;QACpC,OAAO,CACL,OAAO,KAAK,KAAK,QAAQ;YACzB,KAAK,KAAK,IAAI;YACd,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;YACrB,OAAQ,KAA4B,CAAC,IAAI,KAAK,QAAQ;YACtD,KAAK,CAAC,OAAO,CAAE,KAA6B,CAAC,KAAK,CAAC,CACpD,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,gBAAgB,CACtB,KAA+B;QAE/B,MAAM,GAAG,GAAG,IAAI,GAAG,EAAoC,CAAC;QACxD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,EAAE,CAAC;YAC9C,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAChB,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;QACnC,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED;;OAEG;IACK,gBAAgB,CACtB,KAA+B;QAE/B,MAAM,GAAG,GAAG,IAAI,GAAG,EAAoC,CAAC;QACxD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,EAAE,CAAC;YAC9C,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAChB,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;QACnC,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED;;;;OAIG;IACK,iBAAiB,CACvB,KAA+B,EAC/B,KAA+B;QAE/B,MAAM,eAAe,GAAG,KAAK,CAAC,MAAM,CAClC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,uBAAuB,CACxC,CAAC;QACF,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAE1D,gEAAgE;QAChE,MAAM,SAAS,GAAG,KAAK,CAAC,MAAM,CAC5B,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,YAAY,CAAC,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,YAAY,CAAC,CAClE,CAAC;QAEF,oBAAoB;QACpB,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC3C,KAAK,MAAM,IAAI,IAAI,eAAe;YAAE,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QAC7D,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;YAC7B,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC9E,CAAC;QAED,MAAM,MAAM,GAA8B,EAAE,CAAC;QAC7C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,IAAI,KAAK,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;QAC3E,IAAI,UAAU,GAAG,CAAC,CAAC;QAEnB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,KAAK,GAA4B,EAAE,KAAK,EAAE,UAAU,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;YAC7E,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACnB,MAAM,SAAS,GAA6B,EAAE,CAAC;YAC/C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACzB,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACrB,MAAM,QAAQ,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,YAAY,KAAK,IAAI,CAAC,EAAE,CAAC,CAAC;gBACrE,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;oBAC5B,MAAM,GAAG,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;oBACvD,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,EAAE,GAAG,CAAC,CAAC;oBACrC,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC;wBACjD,MAAM,IAAI,GAAG,eAAe,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC,YAAY,CAAC,CAAC;wBACrE,IAAI,IAAI;4BAAE,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBACjC,CAAC;gBACH,CAAC;YACH,CAAC;YACD,KAAK,GAAG,SAAS,CAAC;QACpB,CAAC;QAED,IAAI,OAAO,CAAC,IAAI,KAAK,eAAe,CAAC,MAAM,EAAE,CAAC;YAC5C,MAAM,SAAS,GAAG,eAAe;iBAC9B,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;iBACjC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACpB,MAAM,IAAI,eAAe,CAAC;gBACxB,cAAc,EAAE,SAAS;gBACzB,UAAU,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,IAAI;aACvC,CAAC,CAAC;QACL,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;CACF"}