@decaf-ts/integrations 0.10.8 → 0.12.0

package/lib/esm/graph/engine/validation/GraphWorkflowDocumentValidator.js

@@ -1,503 +0,0 @@
-import { assertGraphWorkflowDocumentValid, isGraphJsonSafeValue, isGraphNodeCapability, isGraphWorkflowDocumentShape, } from "@decaf-ts/ui-decorators/graph";
-import { GRAPH_WORKFLOW_BOUNDARY } from "./../constants.js";
-import { GraphNodeInstanceValidator } from "./GraphNodeInstanceValidator.js";
-import { collectLooseNodeIssues } from "./GraphLooseNodeValidation.js";
-import { GraphParameterValidator } from "./GraphParameterValidator.js";
-import { GraphEdgeInstanceValidator } from "./GraphEdgeInstanceValidator.js";
-import { GraphConnectionPolicyValidator } from "./GraphConnectionPolicyValidator.js";
-import { GraphCredentialReferenceValidator } from "./GraphCredentialReferenceValidator.js";
-import { GraphDocumentValidationError } from "./GraphValidationErrors.js";
-/**
- * Default resource limits (technical governance delegates the numbers to
- * implementation; these match the persistence boundary defaults).
- */
-export const 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).
- */
-export const 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.
- */
-export function isGraphResolvedWorkflow(value) {
-    if (!value || typeof value !== "object")
-        return false;
-    const record = value;
-    return (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 (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.
- */
-export class GraphWorkflowDocumentValidator {
-    constructor(options) {
-        this.options = options;
-        this.parameterValidator = new GraphParameterValidator();
-        this.edgeValidator = new GraphEdgeInstanceValidator();
-        this.connectionPolicyValidator = new GraphConnectionPolicyValidator();
-        this.nodeValidator = new GraphNodeInstanceValidator(options.catalogue);
-        this.credentialValidator = new 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 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 = {
-            ...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 !== GRAPH_WORKFLOW_BOUNDARY) {
-                const incoming = incomingByNode.get(edge.targetNodeId) ?? [];
-                incoming.push(edge);
-                incomingByNode.set(edge.targetNodeId, incoming);
-            }
-            if (edge.sourceNodeId !== 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);
-        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 (!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 (!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 {
-            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 === 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 (!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,
-                    });
-                }
-            }
-        }
-    }
-}
-//# sourceMappingURL=GraphWorkflowDocumentValidator.js.map

package/lib/esm/graph/engine/validation/GraphWorkflowDocumentValidator.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"GraphWorkflowDocumentValidator.js","sourceRoot":"","sources":["../../../../../src/graph/engine/validation/GraphWorkflowDocumentValidator.ts"],"names":[],"mappings":"AAiCA,OAAO,EACL,gCAAgC,EAChC,oBAAoB,EACpB,qBAAqB,EACrB,4BAA4B,GAC7B,MAAM,+BAA+B,CAAC;AAEvC,OAAO,EAAE,uBAAuB,EAAE,0BAAqB;AAMvD,OAAO,EAAE,0BAA0B,EAAE,wCAAqC;AAC1E,OAAO,EAAE,sBAAsB,EAAE,sCAAmC;AACpE,OAAO,EAAE,uBAAuB,EAAE,qCAAkC;AACpE,OAAO,EAAE,0BAA0B,EAAE,wCAAqC;AAC1E,OAAO,EAAE,8BAA8B,EAAE,4CAAyC;AAClF,OAAO,EAAE,iCAAiC,EAAE,+CAA4C;AAExF,OAAO,EAAE,4BAA4B,EAAE,mCAAgC;AAuBvE;;;GAGG;AACH,MAAM,CAAC,MAAM,wCAAwC,GACnD;IACE,gBAAgB,EAAE,SAAS;IAC3B,eAAe,EAAE,EAAE;IACnB,QAAQ,EAAE,GAAG;IACb,QAAQ,EAAE,KAAK;CAChB,CAAC;AAEJ;;;;;GAKG;AACH,MAAM,CAAC,MAAM,mCAAmC,GAAsB;IACpE,MAAM;IACN,YAAY;IACZ,UAAU;IACV,SAAS;IACT,OAAO;IACP,WAAW;CACZ,CAAC;AAsBF;;;;GAIG;AACH,MAAM,UAAU,uBAAuB,CACrC,KAAc;IAEd,IAAI,CAAC,KAAK,IAAI,OAAO,KAAK,KAAK,QAAQ;QAAE,OAAO,KAAK,CAAC;IACtD,MAAM,MAAM,GAAG,KAAgC,CAAC;IAChD,OAAO,CACL,4BAA4B,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;QAChD,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;QACtC,MAAM,CAAC,OAAO,CAAe,CAAC,KAAK,CAClC,CAAC,IAAI,EAAE,EAAE,CACP,IAAI,KAAK,IAAI;YACb,OAAO,IAAI,KAAK,QAAQ;YACxB,OAAQ,IAAgC,CAAC,UAAU,CAAC,KAAK,QAAQ;YACjE,OAAQ,IAAgC,CAAC,UAAU,CAAC,KAAK,QAAQ;YACjE,OAAQ,IAAgC,CAAC,UAAU,CAAC,KAAK,QAAQ,CACpE,CACF,CAAC;AACJ,CAAC;AAED,SAAS,oBAAoB,CAC3B,MAA+B,EAC/B,IAAY;IAEZ,MAAM,MAAM,GAA2B,EAAE,CAAC;IAC1C,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;QACtC,IAAI,mCAAmC,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;YACtD,MAAM,CAAC,IAAI,CAAC;gBACV,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;aACxB,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,8BAA8B,CACrC,QAA+B;IAE/B,MAAM,SAAS,GAAG,IAAI,GAAG,EAAuB,CAAC;IACjD,KAAK,MAAM,IAAI,IAAI,QAAQ,CAAC,KAAK,IAAI,EAAE,EAAE,CAAC;QACxC,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM;YAAE,SAAS;QACnC,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;QAC3B,IAAI,MAAM,CAAC,KAAK,KAAK,MAAM;YAAE,SAAS;QACtC,MAAM,KAAK,GAAG,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,IAAI,GAAG,EAAU,CAAC;QAChE,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACvB,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;IACtC,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,OAAO,8BAA8B;IAOzC,YAA6B,OAA8C;QAA9C,YAAO,GAAP,OAAO,CAAuC;QAL1D,uBAAkB,GAAG,IAAI,uBAAuB,EAAE,CAAC;QACnD,kBAAa,GAAG,IAAI,0BAA0B,EAAE,CAAC;QACjD,8BAAyB,GAAG,IAAI,8BAA8B,EAAE,CAAC;QAIhF,IAAI,CAAC,aAAa,GAAG,IAAI,0BAA0B,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;QACvE,IAAI,CAAC,mBAAmB,GAAG,IAAI,iCAAiC,CAC9D,OAAO,CAAC,oBAAoB,CAC7B,CAAC;IACJ,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,eAAe,CACnB,QAA+B;QAE/B,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;QAC7C,IAAI,CAAC,MAAM,CAAC,KAAK,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC;YACtC,MAAM,IAAI,4BAA4B,CACpC,4BAA4B,QAAQ,CAAC,EAAE,4BAA4B,MAAM,CAAC,MAAM,CAAC,MAAM,WAAW,EAClG,MAAM,CAAC,MAAM,CACd,CAAC;QACJ,CAAC;QACD,OAAO,MAAM,CAAC,QAAQ,CAAC;IACzB,CAAC;IAED;;;;;;;;;;;OAWG;IACH,KAAK,CAAC,QAAQ,CACZ,QAA+B,EAC/B,KAAK,GAAG,CAAC;QAET,MAAM,MAAM,GAA2B,EAAE,CAAC;QAC1C,MAAM,MAAM,GAAG;YACb,GAAG,wCAAwC;YAC3C,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM;SACvB,CAAC;QAEF,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;YACrE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC;QAClC,CAAC;QAED,qEAAqE;QACrE,yDAAyD;QACzD,qEAAqE;QACrE,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,aAAa,CAAC,YAAY,CACpD,QAAQ,CAAC,KAAK,EACd,MAAM,EACN,IAAI,CAAC,OAAO,CAAC,iBAAiB,CAC/B,CAAC;QACF,MAAM,aAAa,GAAgC,QAAQ,CAAC,KAAK;aAC9D,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,CAAE,CAAC,CAAC;QAEzC,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;YACjC,IAAI,CAAC,kBAAkB,CAAC,QAAQ,CAC9B,IAAI,CAAC,QAAQ,EACb,IAAI,CAAC,QAAQ,EACb,MAAM,EACN,SAAS,IAAI,CAAC,QAAQ,CAAC,EAAE,GAAG,EAC5B,uBAAuB,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,CAC9C,CAAC;QACJ,CAAC;QAED,qEAAqE;QACrE,kEAAkE;QAClE,qEAAqE;QACrE,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE,CAAC;YACjC,IAAI,CAAC,aAAa,CAAC,sBAAsB,CACvC,IAAI,CAAC,QAAQ,EACb,IAAI,CAAC,QAAQ,EACb,MAAM,EACN,SAAS,IAAI,CAAC,QAAQ,CAAC,EAAE,GAAG,CAC7B,CAAC;QACJ,CAAC;QAED,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,EAAuC,CAAC;QACtE,MAAM,cAAc,GAAG,IAAI,GAAG,EAAuC,CAAC;QACtE,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,IAAI,CAAC,YAAY,KAAK,uBAAuB,EAAE,CAAC;gBAClD,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;YAClD,CAAC;YACD,IAAI,IAAI,CAAC,YAAY,KAAK,uBAAuB,EAAE,CAAC;gBAClD,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;YAClD,CAAC;QACH,CAAC;QAED,qEAAqE;QACrE,4CAA4C;QAC5C,qEAAqE;QACrE,IAAI,CAAC,yBAAyB,CAAC,QAAQ,CAAC,EAAE,KAAK,EAAE,QAAQ,EAAE,EAAE,MAAM,CAAC,CAAC;QAErE,qEAAqE;QACrE,uEAAuE;QACvE,yEAAyE;QACzE,2CAA2C;QAC3C,qEAAqE;QACrE,IAAI,CAAC,kBAAkB,CAAC,aAAa,EAAE,KAAK,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;QAChE,sBAAsB,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;QACzC,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE,CAAC;YACjC,IAAI,CAAC,kBAAkB,CAAC,2BAA2B,CACjD,IAAI,CAAC,QAAQ,EACb,IAAI,CAAC,QAAQ,EACb,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,IAAI,EAAE,EAC1C,MAAM,EACN,SAAS,IAAI,CAAC,QAAQ,CAAC,EAAE,GAAG,EAC5B,EAAE,2BAA2B,EAAE,IAAI,CAAC,OAAO,CAAC,2BAA2B,EAAE,CAC1E,CAAC;QACJ,CAAC;QACD,IAAI,CAAC,+BAA+B,CAAC,QAAQ,EAAE,cAAc,EAAE,MAAM,CAAC,CAAC;QAEvE,qEAAqE;QACrE,gDAAgD;QAChD,qEAAqE;QACrE,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE,CAAC;YACjC,MAAM,IAAI,CAAC,mBAAmB,CAAC,QAAQ,CACrC,IAAI,CAAC,QAAQ,EACb,IAAI,CAAC,QAAQ,EACb,MAAM,EACN,SAAS,IAAI,CAAC,QAAQ,CAAC,EAAE,GAAG,CAC7B,CAAC;QACJ,CAAC;QAED,qEAAqE;QACrE,mCAAmC;QACnC,qEAAqE;QACrE,IAAI,CAAC,oBAAoB,CAAC,aAAa,EAAE,MAAM,CAAC,CAAC;QAEjD,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACtB,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC;QAClC,CAAC;QAED,MAAM,QAAQ,GAA0B;YACtC,QAAQ;YACR,KAAK,EAAE,aAAa;YACpB,KAAK;YACL,QAAQ;YACR,cAAc;YACd,cAAc;SACf,CAAC;QACF,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC;IAC3C,CAAC;IAED;;;;OAIG;IACK,KAAK,CAAC,iBAAiB,CAC7B,QAA+B,EAC/B,MAAuD,EACvD,KAAa,EACb,MAA8B;QAE9B,IAAI,CAAC,4BAA4B,CAAC,QAAQ,CAAC,EAAE,CAAC;YAC5C,MAAM,CAAC,IAAI,CAAC;gBACV,IAAI,EAAE,gBAAgB;gBACtB,IAAI,EAAE,GAAG;gBACT,OAAO,EACL,mIAAmI;aACtI,CAAC,CAAC;YACH,OAAO,KAAK,CAAC;QACf,CAAC;QAED,IAAI,CAAC,QAAQ,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC;YACxC,MAAM,CAAC,IAAI,CAAC;gBACV,IAAI,EAAE,mBAAmB;gBACzB,IAAI,EAAE,MAAM;gBACZ,OAAO,EAAE,iDAAiD;aAC3D,CAAC,CAAC;QACL,CAAC;QAED,IAAI,CAAC,oBAAoB,CAAC,QAAQ,CAAC,EAAE,CAAC;YACpC,MAAM,CAAC,IAAI,CAAC;gBACV,IAAI,EAAE,sBAAsB;gBAC5B,IAAI,EAAE,GAAG;gBACT,OAAO,EACL,+IAA+I;aAClJ,CAAC,CAAC;YACH,OAAO,KAAK,CAAC;QACf,CAAC;QAED,0EAA0E;QAC1E,MAAM,CAAC,IAAI,CACT,GAAG,oBAAoB,CAAC,QAA8C,EAAE,GAAG,CAAC,CAC7E,CAAC;QACF,KAAK,MAAM,IAAI,IAAI,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,GAAG,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC;YAC7D,MAAM,CAAC,IAAI,CACT,GAAG,oBAAoB,CAAC,IAA0C,EAAE,OAAO,CAAC,CAC7E,CAAC;QACJ,CAAC;QACD,KAAK,MAAM,IAAI,IAAI,QAAQ,CAAC,KAAK,EAAE,CAAC;YAClC,MAAM,CAAC,IAAI,CACT,GAAG,oBAAoB,CACrB,IAA0C,EAC1C,SAAS,IAAI,CAAC,EAAE,GAAG,CACpB,CACF,CAAC;QACJ,CAAC;QACD,KAAK,MAAM,IAAI,IAAI,QAAQ,CAAC,KAAK,EAAE,CAAC;YAClC,MAAM,CAAC,IAAI,CACT,GAAG,oBAAoB,CAAC,IAA0C,EAAE,SAAS,IAAI,CAAC,EAAE,GAAG,CAAC,CACzF,CAAC;QACJ,CAAC;QAED,IAAI,CAAC,iBAAiB,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;QACzC,IAAI,CAAC,cAAc,CAAC,QAAQ,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;QAErD,IAAI,CAAC;YACH,gCAAgC,CAAC,QAAQ,CAAC,CAAC;QAC7C,CAAC;QAAC,OAAO,CAAU,EAAE,CAAC;YACpB,MAAM,CAAC,IAAI,CAAC;gBACV,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;aACpD,CAAC,CAAC;QACL,CAAC;QAED,oEAAoE;QACpE,4DAA4D;QAC5D,MAAM,IAAI,CAAC,oBAAoB,CAAC,QAAQ,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;QAEzD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACK,iBAAiB,CACvB,QAA+B,EAC/B,MAA8B;QAE9B,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;QACnC,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;QACpC,KAAK,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI;YAC3B,CAAC,OAAO,EAAE,QAAQ,CAAC,MAAM,CAAC;YAC1B,CAAC,QAAQ,EAAE,QAAQ,CAAC,OAAO,CAAC;SACpB,EAAE,CAAC;YACX,MAAM,IAAI,GAAG,KAAK,KAAK,OAAO,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC;YACtD,KAAK,MAAM,IAAI,IAAI,KAAoC,EAAE,CAAC;gBACxD,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;oBACtB,MAAM,CAAC,IAAI,CAAC;wBACV,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;qBAC5G,CAAC,CAAC;gBACL,CAAC;qBAAM,CAAC;oBACN,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACpB,CAAC;YACH,CAAC;QACH,CAAC;QAED,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,KAAK,MAAM,IAAI,IAAI,QAAQ,CAAC,KAAK,EAAE,CAAC;YAClC,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;gBACzB,MAAM,CAAC,IAAI,CAAC;oBACV,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;iBAChB,CAAC,CAAC;YACL,CAAC;iBAAM,CAAC;gBACN,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACvB,CAAC;QACH,CAAC;QAED,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,KAAK,MAAM,IAAI,IAAI,QAAQ,CAAC,KAAK,EAAE,CAAC;YAClC,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;gBACzB,MAAM,CAAC,IAAI,CAAC;oBACV,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;iBAChB,CAAC,CAAC;YACL,CAAC;iBAAM,CAAC;gBACN,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACvB,CAAC;QACH,CAAC;IACH,CAAC;IAED;;;OAGG;IACK,cAAc,CACpB,QAA+B,EAC/B,MAAuD,EACvD,KAAa,EACb,MAA8B;QAE9B,IAAI,QAAQ,CAAC,KAAK,CAAC,MAAM,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC;YAC5C,MAAM,CAAC,IAAI,CAAC;gBACV,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;aAClE,CAAC,CAAC;QACL,CAAC;QACD,IAAI,QAAQ,CAAC,KAAK,CAAC,MAAM,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC;YAC5C,MAAM,CAAC,IAAI,CAAC;gBACV,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;aAClE,CAAC,CAAC;QACL,CAAC;QACD,IAAI,KAAK,GAAG,MAAM,CAAC,eAAe,EAAE,CAAC;YACnC,MAAM,CAAC,IAAI,CAAC;gBACV,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;aAClD,CAAC,CAAC;QACL,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;YACpC,MAAM,CAAC,IAAI,CAAC;gBACV,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;aACnD,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED;;;;OAIG;IACK,KAAK,CAAC,oBAAoB,CAChC,QAA+B,EAC/B,KAAa,EACb,MAA8B;QAE9B,KAAK,MAAM,IAAI,IAAI,QAAQ,CAAC,KAAK,EAAE,CAAC;YAClC,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC;YAC7B,IAAI,CAAC,IAAI;gBAAE,SAAS;YACpB,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;gBAClC,MAAM,CAAC,IAAI,CAAC;oBACV,GAAG,KAAK;oBACR,IAAI,EAAE,SAAS,IAAI,CAAC,EAAE,eAAe,KAAK,CAAC,IAAI,EAAE;oBACjD,MAAM,EAAE,KAAK,CAAC,MAAM,IAAI,IAAI,CAAC,EAAE;iBAChC,CAAC,CAAC;YACL,CAAC;QACH,CAAC;IACH,CAAC;IAED;;;;;OAKG;IACK,kBAAkB,CACxB,KAAkC,EAClC,KAAkC,EAClC,QAA+B,EAC/B,MAA8B;QAE9B,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,CACtB,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAC3C,CAAC;QACF,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IACE,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC;gBAC9B,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,EAC/B,CAAC;gBACD,QAAQ,CAAC,GAAG,CACV,IAAI,CAAC,YAAY,EACjB,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAC3C,CAAC;YACJ,CAAC;QACH,CAAC;QAED,MAAM,KAAK,GAAG,CAAC,GAAG,QAAQ,CAAC,OAAO,EAAE,CAAC;aAClC,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;QACrB,MAAM,OAAO,GAAa,EAAE,CAAC;QAC7B,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YAC/B,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACtB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACzB,IAAI,IAAI,CAAC,YAAY,KAAK,OAAO;oBAAE,SAAS;gBAC5C,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC;oBAAE,SAAS;gBAC/C,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;oBAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;YAClD,CAAC;QACH,CAAC;QAED,IAAI,OAAO,CAAC,MAAM,KAAK,QAAQ,CAAC,IAAI,EAAE,CAAC;YACrC,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;gBACV,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;aACjC,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED;;;OAGG;IACK,+BAA+B,CACrC,QAA+B,EAC/B,cAAwD,EACxD,MAA8B;QAE9B,MAAM,aAAa,GAAG,IAAI,GAAG,EAAU,CAAC;QACxC,KAAK,MAAM,KAAK,IAAI,cAAc,CAAC,MAAM,EAAE,EAAE,CAAC;YAC5C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACzB,IAAI,IAAI,CAAC,YAAY,KAAK,uBAAuB,EAAE,CAAC;oBAClD,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;gBACrC,CAAC;YACH,CAAC;QACH,CAAC;QACD,KAAK,MAAM,IAAI,IAAI,QAAQ,CAAC,OAAO,EAAE,CAAC;YACpC,IAAI,IAAI,CAAC,QAAQ,KAAK,IAAI;gBAAE,SAAS;YACrC,IAAI,IAAI,CAAC,YAAY,KAAK,SAAS;gBAAE,SAAS;YAC9C,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;gBAChC,MAAM,CAAC,IAAI,CAAC;oBACV,IAAI,EAAE,wCAAwC;oBAC9C,IAAI,EAAE,WAAW,IAAI,CAAC,EAAE,GAAG;oBAC3B,OAAO,EAAE,6BAA6B,IAAI,CAAC,EAAE,sCAAsC;iBACpF,CAAC,CAAC;YACL,CAAC;QACH,CAAC;IACH,CAAC;IAED;;;;;;OAMG;IACK,oBAAoB,CAC1B,KAAkC,EAClC,MAA8B;QAE9B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,QAAQ,GAA8B,IAAI,CAAC,QAAQ,CAAC;YAC1D,KAAK,MAAM,UAAU,IAAI,QAAQ,CAAC,YAAY,IAAI,EAAE,EAAE,CAAC;gBACrD,IAAI,CAAC,qBAAqB,CAAC,UAAU,CAAC,EAAE,CAAC;oBACvC,MAAM,CAAC,IAAI,CAAC;wBACV,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;qBAC5C,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;YACD,IAAI,QAAQ,CAAC,QAAQ,EAAE,yBAAyB,KAAK,IAAI;gBAAE,SAAS;YACpE,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC;gBACvB,MAAM,iBAAiB,GAAG,CAAC,QAAQ,CAAC,YAAY,IAAI,EAAE,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;gBACzE,IAAI,CAAC,iBAAiB,EAAE,CAAC;oBACvB,MAAM,CAAC,IAAI,CAAC;wBACV,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;qBACzB,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;CACF"}

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

@@ -1,21 +0,0 @@
-/**
- * @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.
- */
-export * from "./GraphDefinitionValidator.js";
-export * from "./GraphPortSchemaResolver.js";
-export * from "./GraphValueValidator.js";
-export * from "./GraphValidationIssue.js";
-export * from "./GraphValidationErrors.js";
-export * from "./GraphResolvedWorkflow.js";
-export * from "./GraphNodeInstanceValidator.js";
-export * from "./GraphParameterValidator.js";
-export * from "./GraphEdgeInstanceValidator.js";
-export * from "./GraphConnectionPolicyValidator.js";
-export * from "./GraphCredentialReferenceValidator.js";
-export * from "./GraphWorkflowDocumentValidator.js";
-export * from "./GraphLooseNodeValidation.js";
-//# sourceMappingURL=index.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../../src/graph/engine/validation/index.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,8CAA2C;AAC3C,6CAA0C;AAC1C,yCAAsC;AACtC,0CAAuC;AACvC,2CAAwC;AACxC,2CAAwC;AACxC,gDAA6C;AAC7C,6CAA0C;AAC1C,gDAA6C;AAC7C,oDAAiD;AACjD,uDAAoD;AACpD,oDAAiD;AACjD,8CAA2C"}

package/lib/esm/graph/index.js

@@ -1,13 +0,0 @@
-/**
- * @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.
- */
-import "./log/LogParameters.js";
-export * from "./engine/index.js";
-//# sourceMappingURL=index.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/graph/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AACH,gCAA6B;AAC7B,kCAAyB"}