@decaf-ts/integrations 0.10.8 → 0.11.0

package/lib/cjs/graph/engine/validation/GraphWorkflowDocumentValidator.cjs

@@ -1,509 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.GraphWorkflowDocumentValidator = exports.GRAPH_DOCUMENT_FORBIDDEN_FIELD_KEYS = exports.DEFAULT_GRAPH_WORKFLOW_VALIDATION_LIMITS = void 0;
-exports.isGraphResolvedWorkflow = isGraphResolvedWorkflow;
-const graph_1 = require("@decaf-ts/ui-decorators/graph");
-const constants_js_1 = require("./../constants.cjs");
-const GraphNodeInstanceValidator_js_1 = require("./GraphNodeInstanceValidator.cjs");
-const GraphLooseNodeValidation_js_1 = require("./GraphLooseNodeValidation.cjs");
-const GraphParameterValidator_js_1 = require("./GraphParameterValidator.cjs");
-const GraphEdgeInstanceValidator_js_1 = require("./GraphEdgeInstanceValidator.cjs");
-const GraphConnectionPolicyValidator_js_1 = require("./GraphConnectionPolicyValidator.cjs");
-const GraphCredentialReferenceValidator_js_1 = require("./GraphCredentialReferenceValidator.cjs");
-const GraphValidationErrors_js_1 = require("./GraphValidationErrors.cjs");
-/**
- * Default resource limits (technical governance delegates the numbers to
- * implementation; these match the persistence boundary defaults).
- */
-exports.DEFAULT_GRAPH_WORKFLOW_VALIDATION_LIMITS = {
-    maxDocumentBytes: 2_000_000,
-    maxNestingDepth: 10,
-    maxNodes: 500,
-    maxEdges: 1_000,
-};
-/**
- * Field keys that must never appear on a workflow document or any of its
- * structural records: client input resembling node definitions, executors,
- * authoritative ports, or frontend component definitions is rejected before
- * kind resolution (the planner must never see raw definitions).
- */
-exports.GRAPH_DOCUMENT_FORBIDDEN_FIELD_KEYS = [
-    "node",
-    "definition",
-    "executor",
-    "execute",
-    "ports",
-    "component",
-];
-/**
- * Returns `true` when the value structurally looks like a resolved workflow
- * (resolved node instances + resolved edges + lookup maps over a canonical
- * document). Used as the planner's runtime input guard.
- */
-function isGraphResolvedWorkflow(value) {
-    if (!value || typeof value !== "object")
-        return false;
-    const record = value;
-    return ((0, graph_1.isGraphWorkflowDocumentShape)(record["document"]) &&
-        Array.isArray(record["nodes"]) &&
-        Array.isArray(record["edges"]) &&
-        record["nodeById"] instanceof Map &&
-        record["incomingByNode"] instanceof Map &&
-        record["outgoingByNode"] instanceof Map &&
-        record["nodes"].every((node) => node !== null &&
-            typeof node === "object" &&
-            typeof node["instance"] === "object" &&
-            typeof node["manifest"] === "object" &&
-            typeof node["executor"] === "object"));
-}
-function forbiddenFieldIssues(record, path) {
-    const issues = [];
-    for (const key of Object.keys(record)) {
-        if (exports.GRAPH_DOCUMENT_FORBIDDEN_FIELD_KEYS.includes(key)) {
-            issues.push({
-                code: "document.forbidden-field",
-                path: `${path}.${key}`,
-                message: `Field '${key}' is not accepted in a canonical workflow document: node, definition, executor, execute, ports and component fields are rejected`,
-                details: { field: key },
-            });
-        }
-    }
-    return issues;
-}
-/**
- * Collects, per node id, the input port ids targeted by an incoming data
- * edge. Used by the stage-3 parameter pass for cross-satisfaction
- * (§4.4.5 rules 1/5/7): a required parameter whose id matches an
- * edge-satisfied input port is carried by that edge and needs no redundant
- * `parameters[id]` entry. This only reads the raw document — edge
- * existence, direction and type are still validated at stage 5.
- */
-function collectEdgeSatisfiedInputPorts(document) {
-    const satisfied = new Map();
-    for (const edge of document.edges ?? []) {
-        if (edge.type !== "data")
-            continue;
-        const target = edge.target;
-        if (target.scope !== "node")
-            continue;
-        const ports = satisfied.get(target.nodeId) ?? new Set();
-        ports.add(target.port);
-        satisfied.set(target.nodeId, ports);
-    }
-    return satisfied;
-}
-/**
- * The nine-stage backend validation gate (DECAF-50 §4.8).
- *
- * Usage: `const result = await validator.validate(document);` — inspect
- * `result.issues` (structured, in stage order) and `result.resolved` (present
- * only when valid). Use {@link GraphWorkflowDocumentValidator.validateOrThrow}
- * for the fail-fast engine path.
- */
-class GraphWorkflowDocumentValidator {
-    constructor(options) {
-        this.options = options;
-        this.parameterValidator = new GraphParameterValidator_js_1.GraphParameterValidator();
-        this.edgeValidator = new GraphEdgeInstanceValidator_js_1.GraphEdgeInstanceValidator();
-        this.connectionPolicyValidator = new GraphConnectionPolicyValidator_js_1.GraphConnectionPolicyValidator();
-        this.nodeValidator = new GraphNodeInstanceValidator_js_1.GraphNodeInstanceValidator(options.catalogue);
-        this.credentialValidator = new GraphCredentialReferenceValidator_js_1.GraphCredentialReferenceValidator(options.credentialAuthorizer);
-    }
-    /**
-     * Fail-fast variant of {@link validate}: resolves the document or throws
-     * {@link GraphDocumentValidationError} carrying every structured issue.
-     */
-    async validateOrThrow(document) {
-        const result = await this.validate(document);
-        if (!result.valid || !result.resolved) {
-            throw new GraphValidationErrors_js_1.GraphDocumentValidationError(`Graph workflow document '${document.id}' failed validation with ${result.issues.length} issue(s)`, result.issues);
-        }
-        return result.resolved;
-    }
-    /**
-     * Runs the nine validation stages in the exact normative order 1→9 and,
-     * when the document is fully valid, resolves it against the backend
-     * catalogue.
-     *
-     * @param document - The canonical workflow document to validate.
-     * @param depth - Current nesting depth (root is 0); enforced against
-     *   `limits.maxNestingDepth` and used to guard recursive loop-body
-     *   validation.
-     * @returns The validation result with accumulated issues and, when valid,
-     *   the resolved workflow.
-     */
-    async validate(document, depth = 0) {
-        const issues = [];
-        const limits = {
-            ...exports.DEFAULT_GRAPH_WORKFLOW_VALIDATION_LIMITS,
-            ...this.options.limits,
-        };
-        // ------------------------------------------------------------------
-        // Stage 1 — workflow structure.
-        // ------------------------------------------------------------------
-        if (!(await this.validateStructure(document, limits, depth, issues))) {
-            return { valid: false, issues };
-        }
-        // ------------------------------------------------------------------
-        // Stage 2 — kind resolution (trusted backend catalogue).
-        // ------------------------------------------------------------------
-        const nodeById = await this.nodeValidator.resolveNodes(document.nodes, issues, this.options.resolutionContext);
-        const resolvedNodes = document.nodes
-            .filter((node) => nodeById.has(node.id))
-            .map((node) => nodeById.get(node.id));
-        // ------------------------------------------------------------------
-        // Stage 3 — parameters (declared-ness, required presence, typing,
-        // metadata keys, disabled behavior, binding shapes).
-        //
-        // Cross-satisfaction (§4.4.5 rules 1/5/7): a required parameter whose
-        // id matches an input port may be carried on the input surface instead.
-        // The edge-satisfied port set is derived from the raw document here so
-        // the parameter pass can see an incoming data edge without reordering
-        // the normative stages (edges are still resolved and validated at stage 5).
-        // ------------------------------------------------------------------
-        const edgeSatisfiedInputPorts = collectEdgeSatisfiedInputPorts(document);
-        for (const node of resolvedNodes) {
-            this.parameterValidator.validate(node.instance, node.manifest, issues, `nodes[${node.instance.id}]`, edgeSatisfiedInputPorts.get(node.instance.id));
-        }
-        // ------------------------------------------------------------------
-        // Stage 4 — dynamic ports (binding ids refer to effective ports).
-        // ------------------------------------------------------------------
-        for (const node of resolvedNodes) {
-            this.nodeValidator.validateEffectivePorts(node.instance, node.manifest, issues, `nodes[${node.instance.id}]`);
-        }
-        // ------------------------------------------------------------------
-        // Stage 5 — edge endpoints (existence, direction, type compatibility,
-        // boundary routing). Produces the flattened resolved edges.
-        // ------------------------------------------------------------------
-        const edges = this.edgeValidator.resolveEdges(document, nodeById, issues);
-        const incomingByNode = new Map();
-        const outgoingByNode = new Map();
-        for (const edge of edges) {
-            if (edge.targetNodeId !== constants_js_1.GRAPH_WORKFLOW_BOUNDARY) {
-                const incoming = incomingByNode.get(edge.targetNodeId) ?? [];
-                incoming.push(edge);
-                incomingByNode.set(edge.targetNodeId, incoming);
-            }
-            if (edge.sourceNodeId !== constants_js_1.GRAPH_WORKFLOW_BOUNDARY) {
-                const outgoing = outgoingByNode.get(edge.sourceNodeId) ?? [];
-                outgoing.push(edge);
-                outgoingByNode.set(edge.sourceNodeId, outgoing);
-            }
-        }
-        // ------------------------------------------------------------------
-        // Stage 6 — connection policies and counts.
-        // ------------------------------------------------------------------
-        this.connectionPolicyValidator.validate({ edges, nodeById }, issues);
-        // ------------------------------------------------------------------
-        // Stage 7 — topology (acyclicity, binding satisfaction, required-value
-        // satisfiability). Loop-body graphs are validated recursively at stage 1
-        // and are therefore independently acyclic.
-        // ------------------------------------------------------------------
-        this.validateAcyclicity(resolvedNodes, edges, document, issues);
-        (0, GraphLooseNodeValidation_js_1.collectLooseNodeIssues)(document, issues);
-        for (const node of resolvedNodes) {
-            this.parameterValidator.validateBindingSatisfaction(node.instance, node.manifest, incomingByNode.get(node.instance.id) ?? [], issues, `nodes[${node.instance.id}]`, { allowLiteralAndEdgeBindings: this.options.allowLiteralAndEdgeBindings });
-        }
-        this.validateRequiredWorkflowOutputs(document, outgoingByNode, issues);
-        // ------------------------------------------------------------------
-        // Stage 8 — credential-reference authorization.
-        // ------------------------------------------------------------------
-        for (const node of resolvedNodes) {
-            await this.credentialValidator.validate(node.instance, node.manifest, issues, `nodes[${node.instance.id}]`);
-        }
-        // ------------------------------------------------------------------
-        // Stage 9 — capability validation.
-        // ------------------------------------------------------------------
-        this.validateCapabilities(resolvedNodes, issues);
-        if (issues.length > 0) {
-            return { valid: false, issues };
-        }
-        const resolved = {
-            document,
-            nodes: resolvedNodes,
-            edges,
-            nodeById,
-            incomingByNode,
-            outgoingByNode,
-        };
-        return { valid: true, issues, resolved };
-    }
-    /**
-     * Stage 1 — document structure. Returns `true` when the document is
-     * structurally sound enough to continue (shape and JSON safety are
-     * hard preconditions); all other findings accumulate as issues.
-     */
-    async validateStructure(document, limits, depth, issues) {
-        if (!(0, graph_1.isGraphWorkflowDocumentShape)(document)) {
-            issues.push({
-                code: "document.shape",
-                path: "$",
-                message: "Payload is not a canonical GraphWorkflowDocument: id and name must be strings and inputs, outputs, nodes and edges must be arrays",
-            });
-            return false;
-        }
-        if (!document.id || !document.id.trim()) {
-            issues.push({
-                code: "document.empty-id",
-                path: "$.id",
-                message: "Workflow document id must be a non-empty string",
-            });
-        }
-        if (!(0, graph_1.isGraphJsonSafeValue)(document)) {
-            issues.push({
-                code: "document.json-unsafe",
-                path: "$",
-                message: "Document contains JSON-unsafe values: functions, class instances, undefined, NaN/Infinity, symbol keys and unsafe prototype keys are rejected",
-            });
-            return false;
-        }
-        // Forbidden fields (raw definitions/executors must never enter planning).
-        issues.push(...forbiddenFieldIssues(document, "$"));
-        for (const port of [...document.inputs, ...document.outputs]) {
-            issues.push(...forbiddenFieldIssues(port, "ports"));
-        }
-        for (const node of document.nodes) {
-            issues.push(...forbiddenFieldIssues(node, `nodes[${node.id}]`));
-        }
-        for (const edge of document.edges) {
-            issues.push(...forbiddenFieldIssues(edge, `edges[${edge.id}]`));
-        }
-        this.validateUniqueIds(document, issues);
-        this.validateLimits(document, limits, depth, issues);
-        try {
-            (0, graph_1.assertGraphWorkflowDocumentValid)(document);
-        }
-        catch (e) {
-            issues.push({
-                code: "document.structure",
-                path: "$",
-                message: e instanceof Error ? e.message : String(e),
-            });
-        }
-        // Recursive nested-workflow validation: every loop body is itself a
-        // canonical document and runs through the same nine stages.
-        await this.validateNestedBodies(document, depth, issues);
-        return true;
-    }
-    /**
-     * Stage 1 — unique node, edge, workflow-input and workflow-output ids.
-     */
-    validateUniqueIds(document, issues) {
-        const inputIds = new Set();
-        const outputIds = new Set();
-        for (const [scope, ports] of [
-            ["input", document.inputs],
-            ["output", document.outputs],
-        ]) {
-            const seen = scope === "input" ? inputIds : outputIds;
-            for (const port of ports) {
-                if (seen.has(port.id)) {
-                    issues.push({
-                        code: "document.duplicate-port-id",
-                        path: `${scope === "input" ? "inputs" : "outputs"}[${port.id}]`,
-                        message: `Workflow ${scope} port '${port.id}' is declared more than once; workflow port ids must be unique`,
-                    });
-                }
-                else {
-                    seen.add(port.id);
-                }
-            }
-        }
-        const nodeIds = new Set();
-        for (const node of document.nodes) {
-            if (nodeIds.has(node.id)) {
-                issues.push({
-                    code: "document.duplicate-node-id",
-                    path: `nodes[${node.id}]`,
-                    message: `Node '${node.id}' is declared more than once; node ids must be unique`,
-                    nodeId: node.id,
-                });
-            }
-            else {
-                nodeIds.add(node.id);
-            }
-        }
-        const edgeIds = new Set();
-        for (const edge of document.edges) {
-            if (edgeIds.has(edge.id)) {
-                issues.push({
-                    code: "document.duplicate-edge-id",
-                    path: `edges[${edge.id}]`,
-                    message: `Edge '${edge.id}' is declared more than once; edge ids must be unique`,
-                    edgeId: edge.id,
-                });
-            }
-            else {
-                edgeIds.add(edge.id);
-            }
-        }
-    }
-    /**
-     * Stage 1 — backend-enforced configurable limits: document size, nesting
-     * depth, node count, edge count.
-     */
-    validateLimits(document, limits, depth, issues) {
-        if (document.nodes.length > limits.maxNodes) {
-            issues.push({
-                code: "document.limit.nodes",
-                path: "$.nodes",
-                message: `Document declares ${document.nodes.length} nodes; at most ${limits.maxNodes} are allowed`,
-                details: { count: document.nodes.length, limit: limits.maxNodes },
-            });
-        }
-        if (document.edges.length > limits.maxEdges) {
-            issues.push({
-                code: "document.limit.edges",
-                path: "$.edges",
-                message: `Document declares ${document.edges.length} edges; at most ${limits.maxEdges} are allowed`,
-                details: { count: document.edges.length, limit: limits.maxEdges },
-            });
-        }
-        if (depth > limits.maxNestingDepth) {
-            issues.push({
-                code: "document.limit.depth",
-                path: "$",
-                message: `Document nests loop bodies ${depth} levels deep; at most ${limits.maxNestingDepth} levels are allowed`,
-                details: { depth, limit: limits.maxNestingDepth },
-            });
-        }
-        const bytes = Buffer.byteLength(JSON.stringify(document), "utf8");
-        if (bytes > limits.maxDocumentBytes) {
-            issues.push({
-                code: "document.limit.size",
-                path: "$",
-                message: `Document serializes to ${bytes} bytes; at most ${limits.maxDocumentBytes} bytes are allowed`,
-                details: { bytes, limit: limits.maxDocumentBytes },
-            });
-        }
-    }
-    /**
-     * Stage 1 — recursive nested-workflow validation. Every loop body runs
-     * through the full nine-stage gate; nested issues are merged with a path
-     * prefix identifying the owning loop node.
-     */
-    async validateNestedBodies(document, depth, issues) {
-        for (const node of document.nodes) {
-            const body = node.loop?.body;
-            if (!body)
-                continue;
-            const nested = await this.validate(body, depth + 1);
-            for (const issue of nested.issues) {
-                issues.push({
-                    ...issue,
-                    path: `nodes[${node.id}].loop.body.${issue.path}`,
-                    nodeId: issue.nodeId ?? node.id,
-                });
-            }
-        }
-    }
-    /**
-     * Stage 7 — acyclicity (DECAF-32 preserved). Kahn's algorithm over the
-     * resolved executable nodes; connection and data edges both count as
-     * dependencies. Loop constructs are excepted because their bodies are
-     * separate nested documents, validated recursively.
-     */
-    validateAcyclicity(nodes, edges, document, issues) {
-        const nodeIds = new Set(nodes.map((node) => node.instance.id));
-        const indegree = new Map(nodes.map((node) => [node.instance.id, 0]));
-        for (const edge of edges) {
-            if (nodeIds.has(edge.sourceNodeId) &&
-                indegree.has(edge.targetNodeId)) {
-                indegree.set(edge.targetNodeId, (indegree.get(edge.targetNodeId) ?? 0) + 1);
-            }
-        }
-        const queue = [...indegree.entries()]
-            .filter(([, degree]) => degree === 0)
-            .map(([id]) => id);
-        const ordered = [];
-        while (queue.length > 0) {
-            const current = queue.shift();
-            ordered.push(current);
-            for (const edge of edges) {
-                if (edge.sourceNodeId !== current)
-                    continue;
-                if (!indegree.has(edge.targetNodeId))
-                    continue;
-                const degree = (indegree.get(edge.targetNodeId) ?? 1) - 1;
-                indegree.set(edge.targetNodeId, degree);
-                if (degree === 0)
-                    queue.push(edge.targetNodeId);
-            }
-        }
-        if (ordered.length !== indegree.size) {
-            const cyclic = [...indegree.keys()].filter((id) => !ordered.includes(id));
-            issues.push({
-                code: "topology.cycle",
-                path: "$.edges",
-                message: `Workflow '${document.id}' contains an unsupported cycle involving node(s): ${cyclic.join(", ")}`,
-                details: { cyclicNodes: cyclic },
-            });
-        }
-    }
-    /**
-     * Stage 7 — required values must be satisfiable: every required workflow
-     * output port must be routable from at least one node output.
-     */
-    validateRequiredWorkflowOutputs(document, outgoingByNode, issues) {
-        const routedOutputs = new Set();
-        for (const edges of outgoingByNode.values()) {
-            for (const edge of edges) {
-                if (edge.targetNodeId === constants_js_1.GRAPH_WORKFLOW_BOUNDARY) {
-                    routedOutputs.add(edge.targetPort);
-                }
-            }
-        }
-        for (const port of document.outputs) {
-            if (port.required !== true)
-                continue;
-            if (port.defaultValue !== undefined)
-                continue;
-            if (!routedOutputs.has(port.id)) {
-                issues.push({
-                    code: "topology.required-output-unsatisfiable",
-                    path: `outputs[${port.id}]`,
-                    message: `Required workflow output '${port.id}' has no incoming edge from any node`,
-                });
-            }
-        }
-    }
-    /**
-     * Stage 9 — capability validation. Declared manifest capabilities must be
-     * known values, and document features that require a capability may only be
-     * used on kinds declaring it (loop configuration requires the `loop`
-     * capability). Lenient transition manifests (legacy executor-only
-     * registrations) are exempt until cutover (§4.18).
-     */
-    validateCapabilities(nodes, issues) {
-        for (const node of nodes) {
-            const manifest = node.manifest;
-            for (const capability of manifest.capabilities ?? []) {
-                if (!(0, graph_1.isGraphNodeCapability)(capability)) {
-                    issues.push({
-                        code: "capability.invalid",
-                        path: `nodes[${node.instance.id}]`,
-                        message: `Kind '${manifest.kind}' declares unknown capability '${String(capability)}'`,
-                        nodeId: node.instance.id,
-                        details: { capability: String(capability) },
-                    });
-                }
-            }
-            if (manifest.policies?.allowUndeclaredParameters === true)
-                continue;
-            if (node.instance.loop) {
-                const hasLoopCapability = (manifest.capabilities ?? []).includes("loop");
-                if (!hasLoopCapability) {
-                    issues.push({
-                        code: "capability.loop-not-supported",
-                        path: `nodes[${node.instance.id}].loop`,
-                        message: `Node '${node.instance.id}' carries loop configuration but kind '${manifest.kind}' does not declare the 'loop' capability`,
-                        nodeId: node.instance.id,
-                    });
-                }
-            }
-        }
-    }
-}
-exports.GraphWorkflowDocumentValidator = GraphWorkflowDocumentValidator;
-//# sourceMappingURL=GraphWorkflowDocumentValidator.js.map
-//# sourceMappingURL=GraphWorkflowDocumentValidator.cjs.map

package/lib/cjs/graph/engine/validation/GraphWorkflowDocumentValidator.cjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"graph/engine/validation/GraphWorkflowDocumentValidator.cjs","sourceRoot":"","sources":["graph/engine/validation/GraphWorkflowDocumentValidator.js"],"names":[],"mappings":";;;AAsCA,0DAeC;AArDD,yDAA6J;AAC7J,oDAA4D;AAC5D,mFAA6E;AAC7E,+EAAuE;AACvE,6EAAuE;AACvE,mFAA6E;AAC7E,2FAAqF;AACrF,iGAA2F;AAC3F,yEAA0E;AAC1E;;;GAGG;AACU,QAAA,wCAAwC,GAAG;IACpD,gBAAgB,EAAE,SAAS;IAC3B,eAAe,EAAE,EAAE;IACnB,QAAQ,EAAE,GAAG;IACb,QAAQ,EAAE,KAAK;CAClB,CAAC;AACF;;;;;GAKG;AACU,QAAA,mCAAmC,GAAG;IAC/C,MAAM;IACN,YAAY;IACZ,UAAU;IACV,SAAS;IACT,OAAO;IACP,WAAW;CACd,CAAC;AACF;;;;GAIG;AACH,SAAgB,uBAAuB,CAAC,KAAK;IACzC,IAAI,CAAC,KAAK,IAAI,OAAO,KAAK,KAAK,QAAQ;QACnC,OAAO,KAAK,CAAC;IACjB,MAAM,MAAM,GAAG,KAAK,CAAC;IACrB,OAAO,CAAC,IAAA,oCAA4B,EAAC,MAAM,CAAC,UAAU,CAAC,CAAC;QACpD,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;QAC9B,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;QAC9B,MAAM,CAAC,UAAU,CAAC,YAAY,GAAG;QACjC,MAAM,CAAC,gBAAgB,CAAC,YAAY,GAAG;QACvC,MAAM,CAAC,gBAAgB,CAAC,YAAY,GAAG;QACvC,MAAM,CAAC,OAAO,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,KAAK,IAAI;YACzC,OAAO,IAAI,KAAK,QAAQ;YACxB,OAAO,IAAI,CAAC,UAAU,CAAC,KAAK,QAAQ;YACpC,OAAO,IAAI,CAAC,UAAU,CAAC,KAAK,QAAQ;YACpC,OAAO,IAAI,CAAC,UAAU,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC;AACnD,CAAC;AACD,SAAS,oBAAoB,CAAC,MAAM,EAAE,IAAI;IACtC,MAAM,MAAM,GAAG,EAAE,CAAC;IAClB,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;QACpC,IAAI,2CAAmC,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;YACpD,MAAM,CAAC,IAAI,CAAC;gBACR,IAAI,EAAE,0BAA0B;gBAChC,IAAI,EAAE,GAAG,IAAI,IAAI,GAAG,EAAE;gBACtB,OAAO,EAAE,UAAU,GAAG,kIAAkI;gBACxJ,OAAO,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE;aAC1B,CAAC,CAAC;QACP,CAAC;IACL,CAAC;IACD,OAAO,MAAM,CAAC;AAClB,CAAC;AACD;;;;;;;GAOG;AACH,SAAS,8BAA8B,CAAC,QAAQ;IAC5C,MAAM,SAAS,GAAG,IAAI,GAAG,EAAE,CAAC;IAC5B,KAAK,MAAM,IAAI,IAAI,QAAQ,CAAC,KAAK,IAAI,EAAE,EAAE,CAAC;QACtC,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM;YACpB,SAAS;QACb,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;QAC3B,IAAI,MAAM,CAAC,KAAK,KAAK,MAAM;YACvB,SAAS;QACb,MAAM,KAAK,GAAG,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,IAAI,GAAG,EAAE,CAAC;QACxD,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACvB,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;IACxC,CAAC;IACD,OAAO,SAAS,CAAC;AACrB,CAAC;AACD;;;;;;;GAOG;AACH,MAAa,8BAA8B;IACvC,YAAY,OAAO;QACf,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;QACvB,IAAI,CAAC,kBAAkB,GAAG,IAAI,oDAAuB,EAAE,CAAC;QACxD,IAAI,CAAC,aAAa,GAAG,IAAI,0DAA0B,EAAE,CAAC;QACtD,IAAI,CAAC,yBAAyB,GAAG,IAAI,kEAA8B,EAAE,CAAC;QACtE,IAAI,CAAC,aAAa,GAAG,IAAI,0DAA0B,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;QACvE,IAAI,CAAC,mBAAmB,GAAG,IAAI,wEAAiC,CAAC,OAAO,CAAC,oBAAoB,CAAC,CAAC;IACnG,CAAC;IACD;;;OAGG;IACH,KAAK,CAAC,eAAe,CAAC,QAAQ;QAC1B,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;QAC7C,IAAI,CAAC,MAAM,CAAC,KAAK,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC;YACpC,MAAM,IAAI,uDAA4B,CAAC,4BAA4B,QAAQ,CAAC,EAAE,4BAA4B,MAAM,CAAC,MAAM,CAAC,MAAM,WAAW,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC;QAC9J,CAAC;QACD,OAAO,MAAM,CAAC,QAAQ,CAAC;IAC3B,CAAC;IACD;;;;;;;;;;;OAWG;IACH,KAAK,CAAC,QAAQ,CAAC,QAAQ,EAAE,KAAK,GAAG,CAAC;QAC9B,MAAM,MAAM,GAAG,EAAE,CAAC;QAClB,MAAM,MAAM,GAAG;YACX,GAAG,gDAAwC;YAC3C,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM;SACzB,CAAC;QACF,qEAAqE;QACrE,gCAAgC;QAChC,qEAAqE;QACrE,IAAI,CAAC,CAAC,MAAM,IAAI,CAAC,iBAAiB,CAAC,QAAQ,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC,EAAE,CAAC;YACnE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC;QACpC,CAAC;QACD,qEAAqE;QACrE,yDAAyD;QACzD,qEAAqE;QACrE,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,aAAa,CAAC,YAAY,CAAC,QAAQ,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,CAAC,OAAO,CAAC,iBAAiB,CAAC,CAAC;QAC/G,MAAM,aAAa,GAAG,QAAQ,CAAC,KAAK;aAC/B,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;aACvC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;QAC1C,qEAAqE;QACrE,kEAAkE;QAClE,qDAAqD;QACrD,EAAE;QACF,sEAAsE;QACtE,wEAAwE;QACxE,uEAAuE;QACvE,sEAAsE;QACtE,4EAA4E;QAC5E,qEAAqE;QACrE,MAAM,uBAAuB,GAAG,8BAA8B,CAAC,QAAQ,CAAC,CAAC;QACzE,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE,CAAC;YAC/B,IAAI,CAAC,kBAAkB,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,MAAM,EAAE,SAAS,IAAI,CAAC,QAAQ,CAAC,EAAE,GAAG,EAAE,uBAAuB,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC;QACxJ,CAAC;QACD,qEAAqE;QACrE,kEAAkE;QAClE,qEAAqE;QACrE,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE,CAAC;YAC/B,IAAI,CAAC,aAAa,CAAC,sBAAsB,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,MAAM,EAAE,SAAS,IAAI,CAAC,QAAQ,CAAC,EAAE,GAAG,CAAC,CAAC;QAClH,CAAC;QACD,qEAAqE;QACrE,sEAAsE;QACtE,4DAA4D;QAC5D,qEAAqE;QACrE,MAAM,KAAK,GAAG,IAAI,CAAC,aAAa,CAAC,YAAY,CAAC,QAAQ,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;QAC1E,MAAM,cAAc,GAAG,IAAI,GAAG,EAAE,CAAC;QACjC,MAAM,cAAc,GAAG,IAAI,GAAG,EAAE,CAAC;QACjC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACvB,IAAI,IAAI,CAAC,YAAY,KAAK,sCAAuB,EAAE,CAAC;gBAChD,MAAM,QAAQ,GAAG,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,EAAE,CAAC;gBAC7D,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACpB,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,EAAE,QAAQ,CAAC,CAAC;YACpD,CAAC;YACD,IAAI,IAAI,CAAC,YAAY,KAAK,sCAAuB,EAAE,CAAC;gBAChD,MAAM,QAAQ,GAAG,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,EAAE,CAAC;gBAC7D,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACpB,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,EAAE,QAAQ,CAAC,CAAC;YACpD,CAAC;QACL,CAAC;QACD,qEAAqE;QACrE,4CAA4C;QAC5C,qEAAqE;QACrE,IAAI,CAAC,yBAAyB,CAAC,QAAQ,CAAC,EAAE,KAAK,EAAE,QAAQ,EAAE,EAAE,MAAM,CAAC,CAAC;QACrE,qEAAqE;QACrE,uEAAuE;QACvE,yEAAyE;QACzE,2CAA2C;QAC3C,qEAAqE;QACrE,IAAI,CAAC,kBAAkB,CAAC,aAAa,EAAE,KAAK,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;QAChE,IAAA,oDAAsB,EAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;QACzC,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE,CAAC;YAC/B,IAAI,CAAC,kBAAkB,CAAC,2BAA2B,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,MAAM,EAAE,SAAS,IAAI,CAAC,QAAQ,CAAC,EAAE,GAAG,EAAE,EAAE,2BAA2B,EAAE,IAAI,CAAC,OAAO,CAAC,2BAA2B,EAAE,CAAC,CAAC;QACnP,CAAC;QACD,IAAI,CAAC,+BAA+B,CAAC,QAAQ,EAAE,cAAc,EAAE,MAAM,CAAC,CAAC;QACvE,qEAAqE;QACrE,gDAAgD;QAChD,qEAAqE;QACrE,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE,CAAC;YAC/B,MAAM,IAAI,CAAC,mBAAmB,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,MAAM,EAAE,SAAS,IAAI,CAAC,QAAQ,CAAC,EAAE,GAAG,CAAC,CAAC;QAChH,CAAC;QACD,qEAAqE;QACrE,mCAAmC;QACnC,qEAAqE;QACrE,IAAI,CAAC,oBAAoB,CAAC,aAAa,EAAE,MAAM,CAAC,CAAC;QACjD,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACpB,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC;QACpC,CAAC;QACD,MAAM,QAAQ,GAAG;YACb,QAAQ;YACR,KAAK,EAAE,aAAa;YACpB,KAAK;YACL,QAAQ;YACR,cAAc;YACd,cAAc;SACjB,CAAC;QACF,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC;IAC7C,CAAC;IACD;;;;OAIG;IACH,KAAK,CAAC,iBAAiB,CAAC,QAAQ,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM;QACnD,IAAI,CAAC,IAAA,oCAA4B,EAAC,QAAQ,CAAC,EAAE,CAAC;YAC1C,MAAM,CAAC,IAAI,CAAC;gBACR,IAAI,EAAE,gBAAgB;gBACtB,IAAI,EAAE,GAAG;gBACT,OAAO,EAAE,mIAAmI;aAC/I,CAAC,CAAC;YACH,OAAO,KAAK,CAAC;QACjB,CAAC;QACD,IAAI,CAAC,QAAQ,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC;YACtC,MAAM,CAAC,IAAI,CAAC;gBACR,IAAI,EAAE,mBAAmB;gBACzB,IAAI,EAAE,MAAM;gBACZ,OAAO,EAAE,iDAAiD;aAC7D,CAAC,CAAC;QACP,CAAC;QACD,IAAI,CAAC,IAAA,4BAAoB,EAAC,QAAQ,CAAC,EAAE,CAAC;YAClC,MAAM,CAAC,IAAI,CAAC;gBACR,IAAI,EAAE,sBAAsB;gBAC5B,IAAI,EAAE,GAAG;gBACT,OAAO,EAAE,+IAA+I;aAC3J,CAAC,CAAC;YACH,OAAO,KAAK,CAAC;QACjB,CAAC;QACD,0EAA0E;QAC1E,MAAM,CAAC,IAAI,CAAC,GAAG,oBAAoB,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC,CAAC;QACpD,KAAK,MAAM,IAAI,IAAI,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,GAAG,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC;YAC3D,MAAM,CAAC,IAAI,CAAC,GAAG,oBAAoB,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC,CAAC;QACxD,CAAC;QACD,KAAK,MAAM,IAAI,IAAI,QAAQ,CAAC,KAAK,EAAE,CAAC;YAChC,MAAM,CAAC,IAAI,CAAC,GAAG,oBAAoB,CAAC,IAAI,EAAE,SAAS,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;QACpE,CAAC;QACD,KAAK,MAAM,IAAI,IAAI,QAAQ,CAAC,KAAK,EAAE,CAAC;YAChC,MAAM,CAAC,IAAI,CAAC,GAAG,oBAAoB,CAAC,IAAI,EAAE,SAAS,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;QACpE,CAAC;QACD,IAAI,CAAC,iBAAiB,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;QACzC,IAAI,CAAC,cAAc,CAAC,QAAQ,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;QACrD,IAAI,CAAC;YACD,IAAA,wCAAgC,EAAC,QAAQ,CAAC,CAAC;QAC/C,CAAC;QACD,OAAO,CAAC,EAAE,CAAC;YACP,MAAM,CAAC,IAAI,CAAC;gBACR,IAAI,EAAE,oBAAoB;gBAC1B,IAAI,EAAE,GAAG;gBACT,OAAO,EAAE,CAAC,YAAY,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;aACtD,CAAC,CAAC;QACP,CAAC;QACD,oEAAoE;QACpE,4DAA4D;QAC5D,MAAM,IAAI,CAAC,oBAAoB,CAAC,QAAQ,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;QACzD,OAAO,IAAI,CAAC;IAChB,CAAC;IACD;;OAEG;IACH,iBAAiB,CAAC,QAAQ,EAAE,MAAM;QAC9B,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAE,CAAC;QAC3B,MAAM,SAAS,GAAG,IAAI,GAAG,EAAE,CAAC;QAC5B,KAAK,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI;YACzB,CAAC,OAAO,EAAE,QAAQ,CAAC,MAAM,CAAC;YAC1B,CAAC,QAAQ,EAAE,QAAQ,CAAC,OAAO,CAAC;SAC/B,EAAE,CAAC;YACA,MAAM,IAAI,GAAG,KAAK,KAAK,OAAO,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC;YACtD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACvB,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;oBACpB,MAAM,CAAC,IAAI,CAAC;wBACR,IAAI,EAAE,4BAA4B;wBAClC,IAAI,EAAE,GAAG,KAAK,KAAK,OAAO,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,IAAI,IAAI,CAAC,EAAE,GAAG;wBAC/D,OAAO,EAAE,YAAY,KAAK,UAAU,IAAI,CAAC,EAAE,gEAAgE;qBAC9G,CAAC,CAAC;gBACP,CAAC;qBACI,CAAC;oBACF,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACtB,CAAC;YACL,CAAC;QACL,CAAC;QACD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAE,CAAC;QAC1B,KAAK,MAAM,IAAI,IAAI,QAAQ,CAAC,KAAK,EAAE,CAAC;YAChC,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;gBACvB,MAAM,CAAC,IAAI,CAAC;oBACR,IAAI,EAAE,4BAA4B;oBAClC,IAAI,EAAE,SAAS,IAAI,CAAC,EAAE,GAAG;oBACzB,OAAO,EAAE,SAAS,IAAI,CAAC,EAAE,uDAAuD;oBAChF,MAAM,EAAE,IAAI,CAAC,EAAE;iBAClB,CAAC,CAAC;YACP,CAAC;iBACI,CAAC;gBACF,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACzB,CAAC;QACL,CAAC;QACD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAE,CAAC;QAC1B,KAAK,MAAM,IAAI,IAAI,QAAQ,CAAC,KAAK,EAAE,CAAC;YAChC,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;gBACvB,MAAM,CAAC,IAAI,CAAC;oBACR,IAAI,EAAE,4BAA4B;oBAClC,IAAI,EAAE,SAAS,IAAI,CAAC,EAAE,GAAG;oBACzB,OAAO,EAAE,SAAS,IAAI,CAAC,EAAE,uDAAuD;oBAChF,MAAM,EAAE,IAAI,CAAC,EAAE;iBAClB,CAAC,CAAC;YACP,CAAC;iBACI,CAAC;gBACF,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACzB,CAAC;QACL,CAAC;IACL,CAAC;IACD;;;OAGG;IACH,cAAc,CAAC,QAAQ,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM;QAC1C,IAAI,QAAQ,CAAC,KAAK,CAAC,MAAM,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC;YAC1C,MAAM,CAAC,IAAI,CAAC;gBACR,IAAI,EAAE,sBAAsB;gBAC5B,IAAI,EAAE,SAAS;gBACf,OAAO,EAAE,qBAAqB,QAAQ,CAAC,KAAK,CAAC,MAAM,mBAAmB,MAAM,CAAC,QAAQ,cAAc;gBACnG,OAAO,EAAE,EAAE,KAAK,EAAE,QAAQ,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,EAAE,MAAM,CAAC,QAAQ,EAAE;aACpE,CAAC,CAAC;QACP,CAAC;QACD,IAAI,QAAQ,CAAC,KAAK,CAAC,MAAM,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC;YAC1C,MAAM,CAAC,IAAI,CAAC;gBACR,IAAI,EAAE,sBAAsB;gBAC5B,IAAI,EAAE,SAAS;gBACf,OAAO,EAAE,qBAAqB,QAAQ,CAAC,KAAK,CAAC,MAAM,mBAAmB,MAAM,CAAC,QAAQ,cAAc;gBACnG,OAAO,EAAE,EAAE,KAAK,EAAE,QAAQ,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,EAAE,MAAM,CAAC,QAAQ,EAAE;aACpE,CAAC,CAAC;QACP,CAAC;QACD,IAAI,KAAK,GAAG,MAAM,CAAC,eAAe,EAAE,CAAC;YACjC,MAAM,CAAC,IAAI,CAAC;gBACR,IAAI,EAAE,sBAAsB;gBAC5B,IAAI,EAAE,GAAG;gBACT,OAAO,EAAE,8BAA8B,KAAK,yBAAyB,MAAM,CAAC,eAAe,qBAAqB;gBAChH,OAAO,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,CAAC,eAAe,EAAE;aACpD,CAAC,CAAC;QACP,CAAC;QACD,MAAM,KAAK,GAAG,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,EAAE,MAAM,CAAC,CAAC;QAClE,IAAI,KAAK,GAAG,MAAM,CAAC,gBAAgB,EAAE,CAAC;YAClC,MAAM,CAAC,IAAI,CAAC;gBACR,IAAI,EAAE,qBAAqB;gBAC3B,IAAI,EAAE,GAAG;gBACT,OAAO,EAAE,0BAA0B,KAAK,mBAAmB,MAAM,CAAC,gBAAgB,oBAAoB;gBACtG,OAAO,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,CAAC,gBAAgB,EAAE;aACrD,CAAC,CAAC;QACP,CAAC;IACL,CAAC;IACD;;;;OAIG;IACH,KAAK,CAAC,oBAAoB,CAAC,QAAQ,EAAE,KAAK,EAAE,MAAM;QAC9C,KAAK,MAAM,IAAI,IAAI,QAAQ,CAAC,KAAK,EAAE,CAAC;YAChC,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC;YAC7B,IAAI,CAAC,IAAI;gBACL,SAAS;YACb,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;YACpD,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,MAAM,EAAE,CAAC;gBAChC,MAAM,CAAC,IAAI,CAAC;oBACR,GAAG,KAAK;oBACR,IAAI,EAAE,SAAS,IAAI,CAAC,EAAE,eAAe,KAAK,CAAC,IAAI,EAAE;oBACjD,MAAM,EAAE,KAAK,CAAC,MAAM,IAAI,IAAI,CAAC,EAAE;iBAClC,CAAC,CAAC;YACP,CAAC;QACL,CAAC;IACL,CAAC;IACD;;;;;OAKG;IACH,kBAAkB,CAAC,KAAK,EAAE,KAAK,EAAE,QAAQ,EAAE,MAAM;QAC7C,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC;QAC/D,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACrE,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACvB,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC;gBAC9B,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC;gBAClC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAChF,CAAC;QACL,CAAC;QACD,MAAM,KAAK,GAAG,CAAC,GAAG,QAAQ,CAAC,OAAO,EAAE,CAAC;aAChC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,EAAE,EAAE,CAAC,MAAM,KAAK,CAAC,CAAC;aACpC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;QACvB,MAAM,OAAO,GAAG,EAAE,CAAC;QACnB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACtB,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;YAC9B,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACtB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACvB,IAAI,IAAI,CAAC,YAAY,KAAK,OAAO;oBAC7B,SAAS;gBACb,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC;oBAChC,SAAS;gBACb,MAAM,MAAM,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;gBAC1D,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,EAAE,MAAM,CAAC,CAAC;gBACxC,IAAI,MAAM,KAAK,CAAC;oBACZ,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;YACtC,CAAC;QACL,CAAC;QACD,IAAI,OAAO,CAAC,MAAM,KAAK,QAAQ,CAAC,IAAI,EAAE,CAAC;YACnC,MAAM,MAAM,GAAG,CAAC,GAAG,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC;YAC1E,MAAM,CAAC,IAAI,CAAC;gBACR,IAAI,EAAE,gBAAgB;gBACtB,IAAI,EAAE,SAAS;gBACf,OAAO,EAAE,aAAa,QAAQ,CAAC,EAAE,sDAAsD,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;gBAC1G,OAAO,EAAE,EAAE,WAAW,EAAE,MAAM,EAAE;aACnC,CAAC,CAAC;QACP,CAAC;IACL,CAAC;IACD;;;OAGG;IACH,+BAA+B,CAAC,QAAQ,EAAE,cAAc,EAAE,MAAM;QAC5D,MAAM,aAAa,GAAG,IAAI,GAAG,EAAE,CAAC;QAChC,KAAK,MAAM,KAAK,IAAI,cAAc,CAAC,MAAM,EAAE,EAAE,CAAC;YAC1C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACvB,IAAI,IAAI,CAAC,YAAY,KAAK,sCAAuB,EAAE,CAAC;oBAChD,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;gBACvC,CAAC;YACL,CAAC;QACL,CAAC;QACD,KAAK,MAAM,IAAI,IAAI,QAAQ,CAAC,OAAO,EAAE,CAAC;YAClC,IAAI,IAAI,CAAC,QAAQ,KAAK,IAAI;gBACtB,SAAS;YACb,IAAI,IAAI,CAAC,YAAY,KAAK,SAAS;gBAC/B,SAAS;YACb,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;gBAC9B,MAAM,CAAC,IAAI,CAAC;oBACR,IAAI,EAAE,wCAAwC;oBAC9C,IAAI,EAAE,WAAW,IAAI,CAAC,EAAE,GAAG;oBAC3B,OAAO,EAAE,6BAA6B,IAAI,CAAC,EAAE,sCAAsC;iBACtF,CAAC,CAAC;YACP,CAAC;QACL,CAAC;IACL,CAAC;IACD;;;;;;OAMG;IACH,oBAAoB,CAAC,KAAK,EAAE,MAAM;QAC9B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACvB,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;YAC/B,KAAK,MAAM,UAAU,IAAI,QAAQ,CAAC,YAAY,IAAI,EAAE,EAAE,CAAC;gBACnD,IAAI,CAAC,IAAA,6BAAqB,EAAC,UAAU,CAAC,EAAE,CAAC;oBACrC,MAAM,CAAC,IAAI,CAAC;wBACR,IAAI,EAAE,oBAAoB;wBAC1B,IAAI,EAAE,SAAS,IAAI,CAAC,QAAQ,CAAC,EAAE,GAAG;wBAClC,OAAO,EAAE,SAAS,QAAQ,CAAC,IAAI,kCAAkC,MAAM,CAAC,UAAU,CAAC,GAAG;wBACtF,MAAM,EAAE,IAAI,CAAC,QAAQ,CAAC,EAAE;wBACxB,OAAO,EAAE,EAAE,UAAU,EAAE,MAAM,CAAC,UAAU,CAAC,EAAE;qBAC9C,CAAC,CAAC;gBACP,CAAC;YACL,CAAC;YACD,IAAI,QAAQ,CAAC,QAAQ,EAAE,yBAAyB,KAAK,IAAI;gBACrD,SAAS;YACb,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC;gBACrB,MAAM,iBAAiB,GAAG,CAAC,QAAQ,CAAC,YAAY,IAAI,EAAE,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;gBACzE,IAAI,CAAC,iBAAiB,EAAE,CAAC;oBACrB,MAAM,CAAC,IAAI,CAAC;wBACR,IAAI,EAAE,+BAA+B;wBACrC,IAAI,EAAE,SAAS,IAAI,CAAC,QAAQ,CAAC,EAAE,QAAQ;wBACvC,OAAO,EAAE,SAAS,IAAI,CAAC,QAAQ,CAAC,EAAE,0CAA0C,QAAQ,CAAC,IAAI,0CAA0C;wBACnI,MAAM,EAAE,IAAI,CAAC,QAAQ,CAAC,EAAE;qBAC3B,CAAC,CAAC;gBACP,CAAC;YACL,CAAC;QACL,CAAC;IACL,CAAC;CACJ;AAnZD,wEAmZC;AACD,0DAA0D"}

package/lib/cjs/graph/engine/validation/index.cjs

@@ -1,38 +0,0 @@
-"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 __exportStar = (this && this.__exportStar) || function(m, exports) {
-    for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-/**
- * @module integrations/graph/validation
- * @summary Graph validation utilities.
- * @description Re-exports the legacy definition/port/value validators plus
- * the DECAF-50 §4.8 nine-stage document validation gate, structured issues,
- * resolved-workflow types, and the normative validation error hierarchy.
- */
-__exportStar(require("./GraphDefinitionValidator.cjs"), exports);
-__exportStar(require("./GraphPortSchemaResolver.cjs"), exports);
-__exportStar(require("./GraphValueValidator.cjs"), exports);
-__exportStar(require("./GraphValidationIssue.cjs"), exports);
-__exportStar(require("./GraphValidationErrors.cjs"), exports);
-__exportStar(require("./GraphResolvedWorkflow.cjs"), exports);
-__exportStar(require("./GraphNodeInstanceValidator.cjs"), exports);
-__exportStar(require("./GraphParameterValidator.cjs"), exports);
-__exportStar(require("./GraphEdgeInstanceValidator.cjs"), exports);
-__exportStar(require("./GraphConnectionPolicyValidator.cjs"), exports);
-__exportStar(require("./GraphCredentialReferenceValidator.cjs"), exports);
-__exportStar(require("./GraphWorkflowDocumentValidator.cjs"), exports);
-__exportStar(require("./GraphLooseNodeValidation.cjs"), exports);
-//# sourceMappingURL=index.js.map
-//# sourceMappingURL=index.cjs.map

package/lib/cjs/graph/engine/validation/index.cjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"graph/engine/validation/index.cjs","sourceRoot":"","sources":["graph/engine/validation/index.js"],"names":[],"mappings":";;;;;;;;;;;;;;;;AAAA;;;;;;GAMG;AACH,gEAA8C;AAC9C,+DAA6C;AAC7C,2DAAyC;AACzC,4DAA0C;AAC1C,6DAA2C;AAC3C,6DAA2C;AAC3C,kEAAgD;AAChD,+DAA6C;AAC7C,kEAAgD;AAChD,sEAAoD;AACpD,yEAAuD;AACvD,sEAAoD;AACpD,gEAA8C;AAC9C,iCAAiC"}

package/lib/cjs/graph/index.cjs

@@ -1,30 +0,0 @@
-"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 __exportStar = (this && this.__exportStar) || function(m, exports) {
-    for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-/**
- * @module integrations/graph
- * @summary Decaf Graph Execution Engine (backend convenience export).
- * @description Re-exports `./engine` (all engine modules). Backend consumers
- * import from `@decaf-ts/integrations/graph` and get a single unified surface.
- *
- * Frontend-safe shared declarations (node kinds, types, constants) live in
- * `@decaf-ts/ui-decorators/graph` — frontend bundles MUST import from there
- * to avoid pulling in the execution engine.
- */
-require("./log/LogParameters.cjs");
-__exportStar(require("./engine/index.cjs"), exports);
-//# sourceMappingURL=index.js.map
-//# sourceMappingURL=index.cjs.map

package/lib/cjs/graph/index.cjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"graph/index.cjs","sourceRoot":"","sources":["graph/index.js"],"names":[],"mappings":";;;;;;;;;;;;;;;;AAAA;;;;;;;;;GASG;AACH,kCAAgC;AAChC,oDAAkC;AAClC,iCAAiC"}