ai-workflows 2.1.1 → 2.3.0

package/dist/dependency-graph.d.ts

@@ -0,0 +1,157 @@
+/**
+ * Dependency Graph Architecture for Workflow Steps
+ *
+ * Provides a directed acyclic graph (DAG) for managing workflow step dependencies.
+ * Supports:
+ * - Hard vs soft dependencies
+ * - Cycle detection with path reporting
+ * - Parallel group identification for concurrent execution
+ * - Graph visualization (DOT, JSON)
+ */
+import type { EventRegistration } from './types.js';
+/**
+ * Dependency type: hard (must succeed) or soft (can proceed on failure)
+ */
+export type DependencyType = 'hard' | 'soft';
+/**
+ * Configuration for step dependencies
+ */
+export interface DependencyConfig {
+    /**
+     * Step(s) that must complete before this step runs
+     * Can be a single step ID or array of step IDs
+     */
+    dependsOn: string | string[];
+    /**
+     * Type of dependency (default: 'hard')
+     * - 'hard': Dependency must complete successfully
+     * - 'soft': Step can proceed even if dependency fails
+     */
+    type?: DependencyType;
+}
+/**
+ * A node in the dependency graph
+ */
+export interface GraphNode {
+    /** Unique identifier (e.g., 'Step1.complete') */
+    id: string;
+    /** Direct dependencies (step IDs that must complete first) */
+    dependencies: string[];
+    /** Map of dependency ID to dependency type */
+    dependencyTypes?: Record<string, DependencyType>;
+    /** Optional metadata */
+    metadata?: Record<string, unknown>;
+}
+/**
+ * A group of nodes that can execute in parallel
+ */
+export interface ParallelGroup {
+    /** Execution level (0 = no dependencies, 1 = depends on level 0, etc.) */
+    level: number;
+    /** Node IDs that can run concurrently at this level */
+    nodes: string[];
+}
+/**
+ * JSON representation of the graph
+ */
+export interface GraphJSON {
+    nodes: GraphNode[];
+    edges: Array<{
+        from: string;
+        to: string;
+        type: DependencyType;
+    }>;
+}
+/**
+ * Error thrown when a circular dependency is detected
+ */
+export declare class CircularDependencyError extends Error {
+    /** The path of nodes forming the cycle */
+    cyclePath: string[];
+    constructor(cyclePath: string[]);
+}
+/**
+ * Error thrown when a referenced dependency doesn't exist
+ */
+export declare class MissingDependencyError extends Error {
+    /** The missing dependency ID */
+    dependency: string;
+    /** The node that references the missing dependency */
+    node: string;
+    constructor(dependency: string, node: string);
+}
+/**
+ * Extended event registration with optional dependencies
+ */
+export interface EventRegistrationWithDeps extends EventRegistration {
+    dependencies?: DependencyConfig;
+}
+/**
+ * Directed Acyclic Graph for workflow step dependencies
+ */
+export declare class DependencyGraph {
+    private nodes;
+    /**
+     * Create a DependencyGraph from event registrations
+     */
+    static fromEventRegistrations(registrations: EventRegistrationWithDeps[]): DependencyGraph;
+    /**
+     * Check if a node exists
+     */
+    hasNode(id: string): boolean;
+    /**
+     * Add a node to the graph
+     */
+    addNode(id: string, config?: DependencyConfig): void;
+    /**
+     * Add an edge (dependency) between existing nodes
+     */
+    addEdge(from: string, to: string, type?: DependencyType): void;
+    /**
+     * Get all nodes in the graph
+     */
+    getNodes(): GraphNode[];
+    /**
+     * Get a specific node
+     */
+    getNode(id: string): GraphNode | undefined;
+    /**
+     * Get direct dependencies of a node
+     */
+    getDependencies(id: string): string[];
+    /**
+     * Get all transitive dependencies of a node
+     */
+    getAllDependencies(id: string): string[];
+    /**
+     * Get nodes that depend on a given node
+     */
+    getDependents(id: string): string[];
+    /**
+     * Get only hard dependencies
+     */
+    getHardDependencies(id: string): string[];
+    /**
+     * Get only soft dependencies
+     */
+    getSoftDependencies(id: string): string[];
+    /**
+     * Detect cycles using DFS
+     * Returns the cycle path if found, null otherwise
+     */
+    detectCycles(): string[] | null;
+    /**
+     * Get parallel execution groups
+     * Returns nodes grouped by execution level (0 = no deps, 1 = depends on 0, etc.)
+     */
+    getParallelGroups(): ParallelGroup[];
+    /**
+     * Export graph to DOT format for visualization
+     */
+    toDot(): string;
+    /**
+     * Export graph to JSON format
+     */
+    toJSON(): GraphJSON;
+}
+//# sourceMappingURL=dependency-graph.d.ts.map

package/dist/dependency-graph.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"dependency-graph.d.ts","sourceRoot":"","sources":["../src/dependency-graph.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,YAAY,CAAA;AAEnD;;GAEG;AACH,MAAM,MAAM,cAAc,GAAG,MAAM,GAAG,MAAM,CAAA;AAE5C;;GAEG;AACH,MAAM,WAAW,gBAAgB;IAC/B;;;OAGG;IACH,SAAS,EAAE,MAAM,GAAG,MAAM,EAAE,CAAA;IAE5B;;;;OAIG;IACH,IAAI,CAAC,EAAE,cAAc,CAAA;CACtB;AAED;;GAEG;AACH,MAAM,WAAW,SAAS;IACxB,iDAAiD;IACjD,EAAE,EAAE,MAAM,CAAA;IAEV,8DAA8D;IAC9D,YAAY,EAAE,MAAM,EAAE,CAAA;IAEtB,8CAA8C;IAC9C,eAAe,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,cAAc,CAAC,CAAA;IAEhD,wBAAwB;IACxB,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAA;CACnC;AAED;;GAEG;AACH,MAAM,WAAW,aAAa;IAC5B,0EAA0E;IAC1E,KAAK,EAAE,MAAM,CAAA;IAEb,uDAAuD;IACvD,KAAK,EAAE,MAAM,EAAE,CAAA;CAChB;AAED;;GAEG;AACH,MAAM,WAAW,SAAS;IACxB,KAAK,EAAE,SAAS,EAAE,CAAA;IAClB,KAAK,EAAE,KAAK,CAAC;QACX,IAAI,EAAE,MAAM,CAAA;QACZ,EAAE,EAAE,MAAM,CAAA;QACV,IAAI,EAAE,cAAc,CAAA;KACrB,CAAC,CAAA;CACH;AAED;;GAEG;AACH,qBAAa,uBAAwB,SAAQ,KAAK;IAChD,0CAA0C;IAC1C,SAAS,EAAE,MAAM,EAAE,CAAA;gBAEP,SAAS,EAAE,MAAM,EAAE;CAMhC;AAED;;GAEG;AACH,qBAAa,sBAAuB,SAAQ,KAAK;IAC/C,gCAAgC;IAChC,UAAU,EAAE,MAAM,CAAA;IAElB,sDAAsD;IACtD,IAAI,EAAE,MAAM,CAAA;gBAEA,UAAU,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM;CAS7C;AAED;;GAEG;AACH,MAAM,WAAW,yBAA0B,SAAQ,iBAAiB;IAClE,YAAY,CAAC,EAAE,gBAAgB,CAAA;CAChC;AAED;;GAEG;AACH,qBAAa,eAAe;IAC1B,OAAO,CAAC,KAAK,CAAoC;IAEjD;;OAEG;IACH,MAAM,CAAC,sBAAsB,CAC3B,aAAa,EAAE,yBAAyB,EAAE,GACzC,eAAe;IAiDlB;;OAEG;IACH,OAAO,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO;IAI5B;;OAEG;IACH,OAAO,CAAC,EAAE,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,gBAAgB,GAAG,IAAI;IAgDpD;;OAEG;IACH,OAAO,CAAC,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,IAAI,GAAE,cAAuB,GAAG,IAAI;IAkCtE;;OAEG;IACH,QAAQ,IAAI,SAAS,EAAE;IAIvB;;OAEG;IACH,OAAO,CAAC,EAAE,EAAE,MAAM,GAAG,SAAS,GAAG,SAAS;IAI1C;;OAEG;IACH,eAAe,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM,EAAE;IAQrC;;OAEG;IACH,kBAAkB,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM,EAAE;IA2BxC;;OAEG;IACH,aAAa,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM,EAAE;IAUnC;;OAEG;IACH,mBAAmB,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM,EAAE;IAWzC;;OAEG;IACH,mBAAmB,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM,EAAE;IAWzC;;;OAGG;IACH,YAAY,IAAI,MAAM,EAAE,GAAG,IAAI;IAyC/B;;;OAGG;IACH,iBAAiB,IAAI,aAAa,EAAE;IAqDpC;;OAEG;IACH,KAAK,IAAI,MAAM;IAuBf;;OAEG;IACH,MAAM,IAAI,SAAS;CAgBpB"}

package/dist/dependency-graph.js

@@ -0,0 +1,382 @@
+/**
+ * Dependency Graph Architecture for Workflow Steps
+ *
+ * Provides a directed acyclic graph (DAG) for managing workflow step dependencies.
+ * Supports:
+ * - Hard vs soft dependencies
+ * - Cycle detection with path reporting
+ * - Parallel group identification for concurrent execution
+ * - Graph visualization (DOT, JSON)
+ */
+/**
+ * Error thrown when a circular dependency is detected
+ */
+export class CircularDependencyError extends Error {
+    /** The path of nodes forming the cycle */
+    cyclePath;
+    constructor(cyclePath) {
+        const pathStr = cyclePath.join(' -> ');
+        super(`Circular dependency detected: ${pathStr}`);
+        this.name = 'CircularDependencyError';
+        this.cyclePath = cyclePath;
+    }
+}
+/**
+ * Error thrown when a referenced dependency doesn't exist
+ */
+export class MissingDependencyError extends Error {
+    /** The missing dependency ID */
+    dependency;
+    /** The node that references the missing dependency */
+    node;
+    constructor(dependency, node) {
+        super(`Missing dependency '${dependency}' referenced by '${node}'. ` +
+            `Ensure '${dependency}' is added to the graph before '${node}'.`);
+        this.name = 'MissingDependencyError';
+        this.dependency = dependency;
+        this.node = node;
+    }
+}
+/**
+ * Directed Acyclic Graph for workflow step dependencies
+ */
+export class DependencyGraph {
+    nodes = new Map();
+    /**
+     * Create a DependencyGraph from event registrations
+     */
+    static fromEventRegistrations(registrations) {
+        const graph = new DependencyGraph();
+        // First pass: add all nodes without dependencies
+        for (const reg of registrations) {
+            const nodeId = `${reg.noun}.${reg.event}`;
+            if (!graph.hasNode(nodeId)) {
+                // Add as placeholder first (will be updated with deps in second pass)
+                graph.nodes.set(nodeId, {
+                    id: nodeId,
+                    dependencies: [],
+                    dependencyTypes: {},
+                });
+            }
+        }
+        // Second pass: add dependencies
+        for (const reg of registrations) {
+            const nodeId = `${reg.noun}.${reg.event}`;
+            if (reg.dependencies) {
+                const deps = Array.isArray(reg.dependencies.dependsOn)
+                    ? reg.dependencies.dependsOn
+                    : [reg.dependencies.dependsOn];
+                const depType = reg.dependencies.type || 'hard';
+                for (const dep of deps) {
+                    if (!graph.hasNode(dep)) {
+                        throw new MissingDependencyError(dep, nodeId);
+                    }
+                    const node = graph.nodes.get(nodeId);
+                    if (!node.dependencies.includes(dep)) {
+                        node.dependencies.push(dep);
+                        node.dependencyTypes = node.dependencyTypes || {};
+                        node.dependencyTypes[dep] = depType;
+                    }
+                }
+                // Check for cycles after adding edges
+                const cycle = graph.detectCycles();
+                if (cycle) {
+                    throw new CircularDependencyError(cycle);
+                }
+            }
+        }
+        return graph;
+    }
+    /**
+     * Check if a node exists
+     */
+    hasNode(id) {
+        return this.nodes.has(id);
+    }
+    /**
+     * Add a node to the graph
+     */
+    addNode(id, config) {
+        // Check for self-reference
+        if (config?.dependsOn) {
+            const deps = Array.isArray(config.dependsOn)
+                ? config.dependsOn
+                : [config.dependsOn];
+            if (deps.includes(id)) {
+                throw new CircularDependencyError([id, id]);
+            }
+            // Verify all dependencies exist
+            for (const dep of deps) {
+                if (!this.nodes.has(dep)) {
+                    throw new MissingDependencyError(dep, id);
+                }
+            }
+        }
+        const dependencies = config?.dependsOn
+            ? Array.isArray(config.dependsOn)
+                ? config.dependsOn
+                : [config.dependsOn]
+            : [];
+        const depType = config?.type || 'hard';
+        const dependencyTypes = {};
+        for (const dep of dependencies) {
+            dependencyTypes[dep] = depType;
+        }
+        this.nodes.set(id, {
+            id,
+            dependencies,
+            dependencyTypes,
+        });
+        // Check for cycles after adding node with dependencies
+        if (dependencies.length > 0) {
+            const cycle = this.detectCycles();
+            if (cycle) {
+                // Remove the node we just added
+                this.nodes.delete(id);
+                throw new CircularDependencyError(cycle);
+            }
+        }
+    }
+    /**
+     * Add an edge (dependency) between existing nodes
+     */
+    addEdge(from, to, type = 'hard') {
+        if (!this.nodes.has(from)) {
+            throw new MissingDependencyError(from, to);
+        }
+        if (!this.nodes.has(to)) {
+            throw new MissingDependencyError(to, from);
+        }
+        const toNode = this.nodes.get(to);
+        // Check for self-reference
+        if (from === to) {
+            throw new CircularDependencyError([from, to]);
+        }
+        // Add the dependency
+        if (!toNode.dependencies.includes(from)) {
+            toNode.dependencies.push(from);
+            toNode.dependencyTypes = toNode.dependencyTypes || {};
+            toNode.dependencyTypes[from] = type;
+        }
+        // Check for cycles
+        const cycle = this.detectCycles();
+        if (cycle) {
+            // Rollback the edge
+            toNode.dependencies = toNode.dependencies.filter((d) => d !== from);
+            if (toNode.dependencyTypes) {
+                delete toNode.dependencyTypes[from];
+            }
+            throw new CircularDependencyError(cycle);
+        }
+    }
+    /**
+     * Get all nodes in the graph
+     */
+    getNodes() {
+        return Array.from(this.nodes.values());
+    }
+    /**
+     * Get a specific node
+     */
+    getNode(id) {
+        return this.nodes.get(id);
+    }
+    /**
+     * Get direct dependencies of a node
+     */
+    getDependencies(id) {
+        const node = this.nodes.get(id);
+        if (!node) {
+            throw new MissingDependencyError(id, 'getDependencies()');
+        }
+        return [...node.dependencies];
+    }
+    /**
+     * Get all transitive dependencies of a node
+     */
+    getAllDependencies(id) {
+        const node = this.nodes.get(id);
+        if (!node) {
+            throw new MissingDependencyError(id, 'getAllDependencies()');
+        }
+        const visited = new Set();
+        const stack = [...node.dependencies];
+        while (stack.length > 0) {
+            const current = stack.pop();
+            if (visited.has(current))
+                continue;
+            visited.add(current);
+            const currentNode = this.nodes.get(current);
+            if (currentNode) {
+                for (const dep of currentNode.dependencies) {
+                    if (!visited.has(dep)) {
+                        stack.push(dep);
+                    }
+                }
+            }
+        }
+        return Array.from(visited);
+    }
+    /**
+     * Get nodes that depend on a given node
+     */
+    getDependents(id) {
+        const dependents = [];
+        for (const node of this.nodes.values()) {
+            if (node.dependencies.includes(id)) {
+                dependents.push(node.id);
+            }
+        }
+        return dependents;
+    }
+    /**
+     * Get only hard dependencies
+     */
+    getHardDependencies(id) {
+        const node = this.nodes.get(id);
+        if (!node) {
+            throw new MissingDependencyError(id, 'getHardDependencies()');
+        }
+        return node.dependencies.filter((dep) => (node.dependencyTypes?.[dep] || 'hard') === 'hard');
+    }
+    /**
+     * Get only soft dependencies
+     */
+    getSoftDependencies(id) {
+        const node = this.nodes.get(id);
+        if (!node) {
+            throw new MissingDependencyError(id, 'getSoftDependencies()');
+        }
+        return node.dependencies.filter((dep) => node.dependencyTypes?.[dep] === 'soft');
+    }
+    /**
+     * Detect cycles using DFS
+     * Returns the cycle path if found, null otherwise
+     */
+    detectCycles() {
+        const visited = new Set();
+        const recursionStack = new Set();
+        const path = [];
+        const dfs = (nodeId) => {
+            visited.add(nodeId);
+            recursionStack.add(nodeId);
+            path.push(nodeId);
+            const node = this.nodes.get(nodeId);
+            if (node) {
+                for (const dep of node.dependencies) {
+                    if (!visited.has(dep)) {
+                        const cycle = dfs(dep);
+                        if (cycle)
+                            return cycle;
+                    }
+                    else if (recursionStack.has(dep)) {
+                        // Found a cycle - construct the cycle path
+                        const cycleStart = path.indexOf(dep);
+                        const cyclePath = path.slice(cycleStart);
+                        cyclePath.push(dep); // Complete the cycle
+                        return cyclePath;
+                    }
+                }
+            }
+            path.pop();
+            recursionStack.delete(nodeId);
+            return null;
+        };
+        for (const nodeId of this.nodes.keys()) {
+            if (!visited.has(nodeId)) {
+                const cycle = dfs(nodeId);
+                if (cycle)
+                    return cycle;
+            }
+        }
+        return null;
+    }
+    /**
+     * Get parallel execution groups
+     * Returns nodes grouped by execution level (0 = no deps, 1 = depends on 0, etc.)
+     */
+    getParallelGroups() {
+        const levels = new Map();
+        // Calculate level for each node
+        const calculateLevel = (nodeId) => {
+            if (levels.has(nodeId)) {
+                return levels.get(nodeId);
+            }
+            const node = this.nodes.get(nodeId);
+            if (!node || node.dependencies.length === 0) {
+                levels.set(nodeId, 0);
+                return 0;
+            }
+            let maxDepLevel = -1;
+            for (const dep of node.dependencies) {
+                const depLevel = calculateLevel(dep);
+                maxDepLevel = Math.max(maxDepLevel, depLevel);
+            }
+            const level = maxDepLevel + 1;
+            levels.set(nodeId, level);
+            return level;
+        };
+        // Calculate levels for all nodes
+        for (const nodeId of this.nodes.keys()) {
+            calculateLevel(nodeId);
+        }
+        // Group nodes by level
+        const groups = new Map();
+        for (const [nodeId, level] of levels) {
+            if (!groups.has(level)) {
+                groups.set(level, []);
+            }
+            groups.get(level).push(nodeId);
+        }
+        // Convert to sorted array of ParallelGroups
+        const result = [];
+        const sortedLevels = Array.from(groups.keys()).sort((a, b) => a - b);
+        for (const level of sortedLevels) {
+            result.push({
+                level,
+                nodes: groups.get(level),
+            });
+        }
+        return result;
+    }
+    /**
+     * Export graph to DOT format for visualization
+     */
+    toDot() {
+        const lines = ['digraph DependencyGraph {'];
+        lines.push('  rankdir=TB;');
+        lines.push('  node [shape=box];');
+        // Add nodes
+        for (const node of this.nodes.values()) {
+            const label = node.id.replace(/\./g, '\\n');
+            lines.push(`  "${node.id}" [label="${label}"];`);
+        }
+        // Add edges
+        for (const node of this.nodes.values()) {
+            for (const dep of node.dependencies) {
+                const style = node.dependencyTypes?.[dep] === 'soft' ? 'dashed' : 'solid';
+                lines.push(`  "${dep}" -> "${node.id}" [style=${style}];`);
+            }
+        }
+        lines.push('}');
+        return lines.join('\n');
+    }
+    /**
+     * Export graph to JSON format
+     */
+    toJSON() {
+        const nodes = this.getNodes();
+        const edges = [];
+        for (const node of nodes) {
+            for (const dep of node.dependencies) {
+                edges.push({
+                    from: dep,
+                    to: node.id,
+                    type: node.dependencyTypes?.[dep] || 'hard',
+                });
+            }
+        }
+        return { nodes, edges };
+    }
+}
+//# sourceMappingURL=dependency-graph.js.map

package/dist/dependency-graph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dependency-graph.js","sourceRoot":"","sources":["../src/dependency-graph.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAmEH;;GAEG;AACH,MAAM,OAAO,uBAAwB,SAAQ,KAAK;IAChD,0CAA0C;IAC1C,SAAS,CAAU;IAEnB,YAAY,SAAmB;QAC7B,MAAM,OAAO,GAAG,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;QACtC,KAAK,CAAC,iCAAiC,OAAO,EAAE,CAAC,CAAA;QACjD,IAAI,CAAC,IAAI,GAAG,yBAAyB,CAAA;QACrC,IAAI,CAAC,SAAS,GAAG,SAAS,CAAA;IAC5B,CAAC;CACF;AAED;;GAEG;AACH,MAAM,OAAO,sBAAuB,SAAQ,KAAK;IAC/C,gCAAgC;IAChC,UAAU,CAAQ;IAElB,sDAAsD;IACtD,IAAI,CAAQ;IAEZ,YAAY,UAAkB,EAAE,IAAY;QAC1C,KAAK,CACH,uBAAuB,UAAU,oBAAoB,IAAI,KAAK;YAC5D,WAAW,UAAU,mCAAmC,IAAI,IAAI,CACnE,CAAA;QACD,IAAI,CAAC,IAAI,GAAG,wBAAwB,CAAA;QACpC,IAAI,CAAC,UAAU,GAAG,UAAU,CAAA;QAC5B,IAAI,CAAC,IAAI,GAAG,IAAI,CAAA;IAClB,CAAC;CACF;AASD;;GAEG;AACH,MAAM,OAAO,eAAe;IAClB,KAAK,GAA2B,IAAI,GAAG,EAAE,CAAA;IAEjD;;OAEG;IACH,MAAM,CAAC,sBAAsB,CAC3B,aAA0C;QAE1C,MAAM,KAAK,GAAG,IAAI,eAAe,EAAE,CAAA;QAEnC,iDAAiD;QACjD,KAAK,MAAM,GAAG,IAAI,aAAa,EAAE,CAAC;YAChC,MAAM,MAAM,GAAG,GAAG,GAAG,CAAC,IAAI,IAAI,GAAG,CAAC,KAAK,EAAE,CAAA;YACzC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;gBAC3B,sEAAsE;gBACtE,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE;oBACtB,EAAE,EAAE,MAAM;oBACV,YAAY,EAAE,EAAE;oBAChB,eAAe,EAAE,EAAE;iBACpB,CAAC,CAAA;YACJ,CAAC;QACH,CAAC;QAED,gCAAgC;QAChC,KAAK,MAAM,GAAG,IAAI,aAAa,EAAE,CAAC;YAChC,MAAM,MAAM,GAAG,GAAG,GAAG,CAAC,IAAI,IAAI,GAAG,CAAC,KAAK,EAAE,CAAA;YACzC,IAAI,GAAG,CAAC,YAAY,EAAE,CAAC;gBACrB,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,YAAY,CAAC,SAAS,CAAC;oBACpD,CAAC,CAAC,GAAG,CAAC,YAAY,CAAC,SAAS;oBAC5B,CAAC,CAAC,CAAC,GAAG,CAAC,YAAY,CAAC,SAAS,CAAC,CAAA;gBAEhC,MAAM,OAAO,GAAG,GAAG,CAAC,YAAY,CAAC,IAAI,IAAI,MAAM,CAAA;gBAE/C,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;oBACvB,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;wBACxB,MAAM,IAAI,sBAAsB,CAAC,GAAG,EAAE,MAAM,CAAC,CAAA;oBAC/C,CAAC;oBACD,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAE,CAAA;oBACrC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;wBACrC,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;wBAC3B,IAAI,CAAC,eAAe,GAAG,IAAI,CAAC,eAAe,IAAI,EAAE,CAAA;wBACjD,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,GAAG,OAAO,CAAA;oBACrC,CAAC;gBACH,CAAC;gBAED,sCAAsC;gBACtC,MAAM,KAAK,GAAG,KAAK,CAAC,YAAY,EAAE,CAAA;gBAClC,IAAI,KAAK,EAAE,CAAC;oBACV,MAAM,IAAI,uBAAuB,CAAC,KAAK,CAAC,CAAA;gBAC1C,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,KAAK,CAAA;IACd,CAAC;IAED;;OAEG;IACH,OAAO,CAAC,EAAU;QAChB,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;IAC3B,CAAC;IAED;;OAEG;IACH,OAAO,CAAC,EAAU,EAAE,MAAyB;QAC3C,2BAA2B;QAC3B,IAAI,MAAM,EAAE,SAAS,EAAE,CAAC;YACtB,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,SAAS,CAAC;gBAC1C,CAAC,CAAC,MAAM,CAAC,SAAS;gBAClB,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAA;YAEtB,IAAI,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC;gBACtB,MAAM,IAAI,uBAAuB,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAA;YAC7C,CAAC;YAED,gCAAgC;YAChC,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;gBACvB,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;oBACzB,MAAM,IAAI,sBAAsB,CAAC,GAAG,EAAE,EAAE,CAAC,CAAA;gBAC3C,CAAC;YACH,CAAC;QACH,CAAC;QAED,MAAM,YAAY,GAAG,MAAM,EAAE,SAAS;YACpC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,SAAS,CAAC;gBAC/B,CAAC,CAAC,MAAM,CAAC,SAAS;gBAClB,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC;YACtB,CAAC,CAAC,EAAE,CAAA;QAEN,MAAM,OAAO,GAAG,MAAM,EAAE,IAAI,IAAI,MAAM,CAAA;QACtC,MAAM,eAAe,GAAmC,EAAE,CAAA;QAC1D,KAAK,MAAM,GAAG,IAAI,YAAY,EAAE,CAAC;YAC/B,eAAe,CAAC,GAAG,CAAC,GAAG,OAAO,CAAA;QAChC,CAAC;QAED,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE;YACjB,EAAE;YACF,YAAY;YACZ,eAAe;SAChB,CAAC,CAAA;QAEF,uDAAuD;QACvD,IAAI,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC5B,MAAM,KAAK,GAAG,IAAI,CAAC,YAAY,EAAE,CAAA;YACjC,IAAI,KAAK,EAAE,CAAC;gBACV,gCAAgC;gBAChC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,CAAA;gBACrB,MAAM,IAAI,uBAAuB,CAAC,KAAK,CAAC,CAAA;YAC1C,CAAC;QACH,CAAC;IACH,CAAC;IAED;;OAEG;IACH,OAAO,CAAC,IAAY,EAAE,EAAU,EAAE,OAAuB,MAAM;QAC7D,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YAC1B,MAAM,IAAI,sBAAsB,CAAC,IAAI,EAAE,EAAE,CAAC,CAAA;QAC5C,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;YACxB,MAAM,IAAI,sBAAsB,CAAC,EAAE,EAAE,IAAI,CAAC,CAAA;QAC5C,CAAC;QAED,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAE,CAAA;QAElC,2BAA2B;QAC3B,IAAI,IAAI,KAAK,EAAE,EAAE,CAAC;YAChB,MAAM,IAAI,uBAAuB,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,CAAA;QAC/C,CAAC;QAED,qBAAqB;QACrB,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;YACxC,MAAM,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;YAC9B,MAAM,CAAC,eAAe,GAAG,MAAM,CAAC,eAAe,IAAI,EAAE,CAAA;YACrD,MAAM,CAAC,eAAe,CAAC,IAAI,CAAC,GAAG,IAAI,CAAA;QACrC,CAAC;QAED,mBAAmB;QACnB,MAAM,KAAK,GAAG,IAAI,CAAC,YAAY,EAAE,CAAA;QACjC,IAAI,KAAK,EAAE,CAAC;YACV,oBAAoB;YACpB,MAAM,CAAC,YAAY,GAAG,MAAM,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC,CAAA;YACnE,IAAI,MAAM,CAAC,eAAe,EAAE,CAAC;gBAC3B,OAAO,MAAM,CAAC,eAAe,CAAC,IAAI,CAAC,CAAA;YACrC,CAAC;YACD,MAAM,IAAI,uBAAuB,CAAC,KAAK,CAAC,CAAA;QAC1C,CAAC;IACH,CAAC;IAED;;OAEG;IACH,QAAQ;QACN,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAA;IACxC,CAAC;IAED;;OAEG;IACH,OAAO,CAAC,EAAU;QAChB,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;IAC3B,CAAC;IAED;;OAEG;IACH,eAAe,CAAC,EAAU;QACxB,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;QAC/B,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,MAAM,IAAI,sBAAsB,CAAC,EAAE,EAAE,mBAAmB,CAAC,CAAA;QAC3D,CAAC;QACD,OAAO,CAAC,GAAG,IAAI,CAAC,YAAY,CAAC,CAAA;IAC/B,CAAC;IAED;;OAEG;IACH,kBAAkB,CAAC,EAAU;QAC3B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;QAC/B,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,MAAM,IAAI,sBAAsB,CAAC,EAAE,EAAE,sBAAsB,CAAC,CAAA;QAC9D,CAAC;QAED,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAA;QACjC,MAAM,KAAK,GAAG,CAAC,GAAG,IAAI,CAAC,YAAY,CAAC,CAAA;QAEpC,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,EAAG,CAAA;YAC5B,IAAI,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC;gBAAE,SAAQ;YAClC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAA;YAEpB,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,CAAA;YAC3C,IAAI,WAAW,EAAE,CAAC;gBAChB,KAAK,MAAM,GAAG,IAAI,WAAW,CAAC,YAAY,EAAE,CAAC;oBAC3C,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;wBACtB,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;oBACjB,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;IAC5B,CAAC;IAED;;OAEG;IACH,aAAa,CAAC,EAAU;QACtB,MAAM,UAAU,GAAa,EAAE,CAAA;QAC/B,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YACvC,IAAI,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC;gBACnC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;YAC1B,CAAC;QACH,CAAC;QACD,OAAO,UAAU,CAAA;IACnB,CAAC;IAED;;OAEG;IACH,mBAAmB,CAAC,EAAU;QAC5B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;QAC/B,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,MAAM,IAAI,sBAAsB,CAAC,EAAE,EAAE,uBAAuB,CAAC,CAAA;QAC/D,CAAC;QAED,OAAO,IAAI,CAAC,YAAY,CAAC,MAAM,CAC7B,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,eAAe,EAAE,CAAC,GAAG,CAAC,IAAI,MAAM,CAAC,KAAK,MAAM,CAC5D,CAAA;IACH,CAAC;IAED;;OAEG;IACH,mBAAmB,CAAC,EAAU;QAC5B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;QAC/B,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,MAAM,IAAI,sBAAsB,CAAC,EAAE,EAAE,uBAAuB,CAAC,CAAA;QAC/D,CAAC;QAED,OAAO,IAAI,CAAC,YAAY,CAAC,MAAM,CAC7B,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,CAAC,eAAe,EAAE,CAAC,GAAG,CAAC,KAAK,MAAM,CAChD,CAAA;IACH,CAAC;IAED;;;OAGG;IACH,YAAY;QACV,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAA;QACjC,MAAM,cAAc,GAAG,IAAI,GAAG,EAAU,CAAA;QACxC,MAAM,IAAI,GAAa,EAAE,CAAA;QAEzB,MAAM,GAAG,GAAG,CAAC,MAAc,EAAmB,EAAE;YAC9C,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;YACnB,cAAc,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;YAC1B,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;YAEjB,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;YACnC,IAAI,IAAI,EAAE,CAAC;gBACT,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;oBACpC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;wBACtB,MAAM,KAAK,GAAG,GAAG,CAAC,GAAG,CAAC,CAAA;wBACtB,IAAI,KAAK;4BAAE,OAAO,KAAK,CAAA;oBACzB,CAAC;yBAAM,IAAI,cAAc,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;wBACnC,2CAA2C;wBAC3C,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAA;wBACpC,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,CAAA;wBACxC,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA,CAAC,qBAAqB;wBACzC,OAAO,SAAS,CAAA;oBAClB,CAAC;gBACH,CAAC;YACH,CAAC;YAED,IAAI,CAAC,GAAG,EAAE,CAAA;YACV,cAAc,CAAC,MAAM,CAAC,MAAM,CAAC,CAAA;YAC7B,OAAO,IAAI,CAAA;QACb,CAAC,CAAA;QAED,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;YACvC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;gBACzB,MAAM,KAAK,GAAG,GAAG,CAAC,MAAM,CAAC,CAAA;gBACzB,IAAI,KAAK;oBAAE,OAAO,KAAK,CAAA;YACzB,CAAC;QACH,CAAC;QAED,OAAO,IAAI,CAAA;IACb,CAAC;IAED;;;OAGG;IACH,iBAAiB;QACf,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAA;QAExC,gCAAgC;QAChC,MAAM,cAAc,GAAG,CAAC,MAAc,EAAU,EAAE;YAChD,IAAI,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;gBACvB,OAAO,MAAM,CAAC,GAAG,CAAC,MAAM,CAAE,CAAA;YAC5B,CAAC;YAED,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;YACnC,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,YAAY,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBAC5C,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,CAAA;gBACrB,OAAO,CAAC,CAAA;YACV,CAAC;YAED,IAAI,WAAW,GAAG,CAAC,CAAC,CAAA;YACpB,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;gBACpC,MAAM,QAAQ,GAAG,cAAc,CAAC,GAAG,CAAC,CAAA;gBACpC,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,WAAW,EAAE,QAAQ,CAAC,CAAA;YAC/C,CAAC;YAED,MAAM,KAAK,GAAG,WAAW,GAAG,CAAC,CAAA;YAC7B,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,KAAK,CAAC,CAAA;YACzB,OAAO,KAAK,CAAA;QACd,CAAC,CAAA;QAED,iCAAiC;QACjC,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;YACvC,cAAc,CAAC,MAAM,CAAC,CAAA;QACxB,CAAC;QAED,uBAAuB;QACvB,MAAM,MAAM,GAAG,IAAI,GAAG,EAAoB,CAAA;QAC1C,KAAK,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,IAAI,MAAM,EAAE,CAAC;YACrC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBACvB,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE,EAAE,CAAC,CAAA;YACvB,CAAC;YACD,MAAM,CAAC,GAAG,CAAC,KAAK,CAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;QACjC,CAAC;QAED,4CAA4C;QAC5C,MAAM,MAAM,GAAoB,EAAE,CAAA;QAClC,MAAM,YAAY,GAAG,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;QACpE,KAAK,MAAM,KAAK,IAAI,YAAY,EAAE,CAAC;YACjC,MAAM,CAAC,IAAI,CAAC;gBACV,KAAK;gBACL,KAAK,EAAE,MAAM,CAAC,GAAG,CAAC,KAAK,CAAE;aAC1B,CAAC,CAAA;QACJ,CAAC;QAED,OAAO,MAAM,CAAA;IACf,CAAC;IAED;;OAEG;IACH,KAAK;QACH,MAAM,KAAK,GAAa,CAAC,2BAA2B,CAAC,CAAA;QACrD,KAAK,CAAC,IAAI,CAAC,eAAe,CAAC,CAAA;QAC3B,KAAK,CAAC,IAAI,CAAC,qBAAqB,CAAC,CAAA;QAEjC,YAAY;QACZ,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YACvC,MAAM,KAAK,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,KAAK,EAAE,KAAK,CAAC,CAAA;YAC3C,KAAK,CAAC,IAAI,CAAC,MAAM,IAAI,CAAC,EAAE,aAAa,KAAK,KAAK,CAAC,CAAA;QAClD,CAAC;QAED,YAAY;QACZ,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YACvC,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;gBACpC,MAAM,KAAK,GAAG,IAAI,CAAC,eAAe,EAAE,CAAC,GAAG,CAAC,KAAK,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAA;gBACzE,KAAK,CAAC,IAAI,CAAC,MAAM,GAAG,SAAS,IAAI,CAAC,EAAE,YAAY,KAAK,IAAI,CAAC,CAAA;YAC5D,CAAC;QACH,CAAC;QAED,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;QACf,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;IACzB,CAAC;IAED;;OAEG;IACH,MAAM;QACJ,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAA;QAC7B,MAAM,KAAK,GAAuB,EAAE,CAAA;QAEpC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;gBACpC,KAAK,CAAC,IAAI,CAAC;oBACT,IAAI,EAAE,GAAG;oBACT,EAAE,EAAE,IAAI,CAAC,EAAE;oBACX,IAAI,EAAE,IAAI,CAAC,eAAe,EAAE,CAAC,GAAG,CAAC,IAAI,MAAM;iBAC5C,CAAC,CAAA;YACJ,CAAC;QACH,CAAC;QAED,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,CAAA;IACzB,CAAC;CACF"}