@defai.digital/automatosx 8.0.19 → 8.0.21

package/dist/src/speckit/utils/DependencyGraph.js

@@ -1,350 +0,0 @@
-/**
- * DependencyGraph Utility
- *
- * Week 3-4 Implementation - Day 2
- * Provides topological sorting, cycle detection, and critical path analysis
- * for workflow dependency graphs
- */
-/**
- * DependencyGraph analyzes workflow step dependencies and provides
- * graph algorithms for execution planning
- */
-export class DependencyGraph {
-    nodes;
-    edges;
-    adjacencyList;
-    reverseAdjacencyList;
-    constructor(workflow) {
-        this.nodes = new Map();
-        this.edges = [];
-        this.adjacencyList = new Map();
-        this.reverseAdjacencyList = new Map();
-        this.buildGraph(workflow);
-    }
-    /**
-     * Build graph from workflow definition
-     */
-    buildGraph(workflow) {
-        // Create nodes
-        for (const step of workflow.steps) {
-            const node = {
-                id: step.id,
-                name: step.name,
-                agent: step.agent,
-                dependencies: step.dependsOn || [],
-                level: 0, // Will be calculated
-                critical: false, // Will be calculated
-                duration: step.timeout || 30000, // Default 30s
-            };
-            this.nodes.set(step.id, node);
-            this.adjacencyList.set(step.id, new Set());
-            this.reverseAdjacencyList.set(step.id, new Set());
-        }
-        // Create edges
-        for (const step of workflow.steps) {
-            if (step.dependsOn && step.dependsOn.length > 0) {
-                for (const depId of step.dependsOn) {
-                    const edge = {
-                        from: depId,
-                        to: step.id,
-                        type: 'depends',
-                    };
-                    this.edges.push(edge);
-                    // Update adjacency lists
-                    this.adjacencyList.get(depId)?.add(step.id);
-                    this.reverseAdjacencyList.get(step.id)?.add(depId);
-                }
-            }
-        }
-        // Calculate levels and critical path
-        this.calculateLevels();
-        this.markCriticalPath();
-    }
-    /**
-     * Perform topological sort using Kahn's algorithm
-     * Returns sorted node IDs or throws if cycle detected
-     */
-    topologicalSort() {
-        const sorted = [];
-        const inDegree = new Map();
-        // Initialize in-degrees
-        for (const nodeId of this.nodes.keys()) {
-            inDegree.set(nodeId, this.reverseAdjacencyList.get(nodeId)?.size || 0);
-        }
-        // Find all nodes with in-degree 0
-        const queue = [];
-        for (const [nodeId, degree] of inDegree) {
-            if (degree === 0) {
-                queue.push(nodeId);
-            }
-        }
-        // Process queue
-        while (queue.length > 0) {
-            const nodeId = queue.shift();
-            sorted.push(nodeId);
-            // Decrease in-degree for all neighbors
-            const neighbors = this.adjacencyList.get(nodeId);
-            if (neighbors) {
-                for (const neighborId of neighbors) {
-                    const newDegree = (inDegree.get(neighborId) || 0) - 1;
-                    inDegree.set(neighborId, newDegree);
-                    if (newDegree === 0) {
-                        queue.push(neighborId);
-                    }
-                }
-            }
-        }
-        // Check if all nodes were processed (no cycles)
-        if (sorted.length !== this.nodes.size) {
-            const cycles = this.detectCycles();
-            throw new Error(`Dependency graph contains cycles: ${cycles.map(c => c.join(' → ')).join('; ')}`);
-        }
-        return sorted;
-    }
-    /**
-     * Detect cycles in the dependency graph using DFS
-     * Returns array of cycles (each cycle is an array of node IDs)
-     */
-    detectCycles() {
-        const cycles = [];
-        const visited = new Set();
-        const recStack = new Set();
-        const dfs = (nodeId, path) => {
-            visited.add(nodeId);
-            recStack.add(nodeId);
-            path.push(nodeId);
-            const neighbors = this.adjacencyList.get(nodeId);
-            if (neighbors) {
-                for (const neighborId of neighbors) {
-                    if (!visited.has(neighborId)) {
-                        dfs(neighborId, [...path]);
-                    }
-                    else if (recStack.has(neighborId)) {
-                        // Cycle detected
-                        const cycleStart = path.indexOf(neighborId);
-                        const cycle = [...path.slice(cycleStart), neighborId];
-                        cycles.push(cycle);
-                    }
-                }
-            }
-            recStack.delete(nodeId);
-        };
-        for (const nodeId of this.nodes.keys()) {
-            if (!visited.has(nodeId)) {
-                dfs(nodeId, []);
-            }
-        }
-        return cycles;
-    }
-    /**
-     * Calculate execution level for each node
-     * Level = longest path from any root node
-     */
-    calculateLevels() {
-        try {
-            const sorted = this.topologicalSort();
-            const levels = new Map();
-            // Initialize all levels to 0
-            for (const nodeId of this.nodes.keys()) {
-                levels.set(nodeId, 0);
-            }
-            // Process nodes in topological order
-            for (const nodeId of sorted) {
-                const node = this.nodes.get(nodeId);
-                const deps = this.reverseAdjacencyList.get(nodeId);
-                if (deps && deps.size > 0) {
-                    // Level = max(dependency levels) + 1
-                    const maxDepLevel = Math.max(...Array.from(deps).map(depId => levels.get(depId) || 0));
-                    levels.set(nodeId, maxDepLevel + 1);
-                }
-                // Update node
-                node.level = levels.get(nodeId) || 0;
-            }
-        }
-        catch (error) {
-            // If there are cycles, set all levels to 0
-            for (const node of this.nodes.values()) {
-                node.level = 0;
-            }
-        }
-    }
-    /**
-     * Mark nodes on the critical path
-     * Critical path = longest path through the graph based on duration
-     */
-    markCriticalPath() {
-        try {
-            const sorted = this.topologicalSort();
-            // Calculate earliest start times (forward pass)
-            const earliestStart = new Map();
-            for (const nodeId of sorted) {
-                const node = this.nodes.get(nodeId);
-                const deps = this.reverseAdjacencyList.get(nodeId);
-                if (!deps || deps.size === 0) {
-                    earliestStart.set(nodeId, 0);
-                }
-                else {
-                    const maxFinish = Math.max(...Array.from(deps).map(depId => {
-                        const depNode = this.nodes.get(depId);
-                        const depStart = earliestStart.get(depId) || 0;
-                        return depStart + depNode.duration;
-                    }));
-                    earliestStart.set(nodeId, maxFinish);
-                }
-            }
-            // Calculate latest start times (backward pass)
-            const latestStart = new Map();
-            const reverseSorted = [...sorted].reverse();
-            // Find project completion time
-            const projectEnd = Math.max(...sorted.map(nodeId => {
-                const node = this.nodes.get(nodeId);
-                return (earliestStart.get(nodeId) || 0) + node.duration;
-            }));
-            for (const nodeId of reverseSorted) {
-                const node = this.nodes.get(nodeId);
-                const successors = this.adjacencyList.get(nodeId);
-                if (!successors || successors.size === 0) {
-                    // Leaf node
-                    latestStart.set(nodeId, projectEnd - node.duration);
-                }
-                else {
-                    const minSuccessorStart = Math.min(...Array.from(successors).map(succId => latestStart.get(succId) || projectEnd));
-                    latestStart.set(nodeId, minSuccessorStart - node.duration);
-                }
-            }
-            // Mark critical nodes (earliest == latest)
-            for (const nodeId of this.nodes.keys()) {
-                const node = this.nodes.get(nodeId);
-                const earliest = earliestStart.get(nodeId) || 0;
-                const latest = latestStart.get(nodeId) || 0;
-                node.critical = Math.abs(earliest - latest) < 1; // Allow 1ms tolerance
-            }
-        }
-        catch (error) {
-            // If cycles exist, don't mark critical path
-            for (const node of this.nodes.values()) {
-                node.critical = false;
-            }
-        }
-    }
-    /**
-     * Get critical path as array of node IDs
-     */
-    getCriticalPath() {
-        const criticalNodes = Array.from(this.nodes.values())
-            .filter(node => node.critical)
-            .sort((a, b) => a.level - b.level);
-        return criticalNodes.map(node => node.id);
-    }
-    /**
-     * Get total duration along critical path
-     */
-    getCriticalPathDuration() {
-        const criticalPath = this.getCriticalPath();
-        return criticalPath.reduce((total, nodeId) => {
-            const node = this.nodes.get(nodeId);
-            return total + (node?.duration || 0);
-        }, 0);
-    }
-    /**
-     * Get execution levels (groups of nodes that can run in parallel)
-     */
-    getExecutionLevels() {
-        const levelGroups = new Map();
-        for (const [nodeId, node] of this.nodes) {
-            const level = node.level;
-            if (!levelGroups.has(level)) {
-                levelGroups.set(level, []);
-            }
-            levelGroups.get(level).push(nodeId);
-        }
-        const maxLevel = Math.max(...Array.from(levelGroups.keys()));
-        const levels = [];
-        for (let i = 0; i <= maxLevel; i++) {
-            levels.push(levelGroups.get(i) || []);
-        }
-        return levels;
-    }
-    /**
-     * Get nodes that can execute in parallel
-     */
-    getParallelizableNodes() {
-        const result = new Map();
-        const levels = this.getExecutionLevels();
-        levels.forEach((nodeIds, level) => {
-            if (nodeIds.length > 1) {
-                result.set(level, nodeIds);
-            }
-        });
-        return result;
-    }
-    /**
-     * Get metadata about the dependency graph
-     */
-    getMetadata() {
-        const cycles = this.detectCycles();
-        return {
-            nodeCount: this.nodes.size,
-            edgeCount: this.edges.length,
-            maxDepth: Math.max(...Array.from(this.nodes.values()).map(n => n.level)),
-            criticalPathLength: this.getCriticalPathDuration(),
-            hasCycles: cycles.length > 0,
-            cycles: cycles.length > 0 ? cycles : undefined,
-        };
-    }
-    /**
-     * Get all nodes
-     */
-    getNodes() {
-        return Array.from(this.nodes.values());
-    }
-    /**
-     * Get all edges
-     */
-    getEdges() {
-        return this.edges;
-    }
-    /**
-     * Get node by ID
-     */
-    getNode(id) {
-        return this.nodes.get(id);
-    }
-    /**
-     * Get dependencies of a node
-     */
-    getDependencies(nodeId) {
-        return Array.from(this.reverseAdjacencyList.get(nodeId) || []);
-    }
-    /**
-     * Get dependents of a node (nodes that depend on this one)
-     */
-    getDependents(nodeId) {
-        return Array.from(this.adjacencyList.get(nodeId) || []);
-    }
-    /**
-     * Check if graph has cycles
-     */
-    hasCycles() {
-        return this.detectCycles().length > 0;
-    }
-    /**
-     * Get root nodes (nodes with no dependencies)
-     */
-    getRootNodes() {
-        return Array.from(this.nodes.keys()).filter(nodeId => {
-            const deps = this.reverseAdjacencyList.get(nodeId);
-            return !deps || deps.size === 0;
-        });
-    }
-    /**
-     * Get leaf nodes (nodes with no dependents)
-     */
-    getLeafNodes() {
-        return Array.from(this.nodes.keys()).filter(nodeId => {
-            const deps = this.adjacencyList.get(nodeId);
-            return !deps || deps.size === 0;
-        });
-    }
-}
-//# sourceMappingURL=DependencyGraph.js.map

package/dist/src/speckit/utils/DependencyGraph.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"DependencyGraph.js","sourceRoot":"","sources":["../../../../src/speckit/utils/DependencyGraph.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAUH;;;GAGG;AACH,MAAM,OAAO,eAAe;IAClB,KAAK,CAAyB;IAC9B,KAAK,CAAc;IACnB,aAAa,CAA2B;IACxC,oBAAoB,CAA2B;IAEvD,YAAY,QAA4B;QACtC,IAAI,CAAC,KAAK,GAAG,IAAI,GAAG,EAAE,CAAC;QACvB,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;QAChB,IAAI,CAAC,aAAa,GAAG,IAAI,GAAG,EAAE,CAAC;QAC/B,IAAI,CAAC,oBAAoB,GAAG,IAAI,GAAG,EAAE,CAAC;QAEtC,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;IAC5B,CAAC;IAED;;OAEG;IACK,UAAU,CAAC,QAA4B;QAC7C,eAAe;QACf,KAAK,MAAM,IAAI,IAAI,QAAQ,CAAC,KAAK,EAAE,CAAC;YAClC,MAAM,IAAI,GAAc;gBACtB,EAAE,EAAE,IAAI,CAAC,EAAE;gBACX,IAAI,EAAE,IAAI,CAAC,IAAI;gBACf,KAAK,EAAE,IAAI,CAAC,KAAK;gBACjB,YAAY,EAAE,IAAI,CAAC,SAAS,IAAI,EAAE;gBAClC,KAAK,EAAE,CAAC,EAAE,qBAAqB;gBAC/B,QAAQ,EAAE,KAAK,EAAE,qBAAqB;gBACtC,QAAQ,EAAE,IAAI,CAAC,OAAO,IAAI,KAAK,EAAE,cAAc;aAChD,CAAC;YACF,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;YAC9B,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;YAC3C,IAAI,CAAC,oBAAoB,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QACpD,CAAC;QAED,eAAe;QACf,KAAK,MAAM,IAAI,IAAI,QAAQ,CAAC,KAAK,EAAE,CAAC;YAClC,IAAI,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAChD,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;oBACnC,MAAM,IAAI,GAAc;wBACtB,IAAI,EAAE,KAAK;wBACX,EAAE,EAAE,IAAI,CAAC,EAAE;wBACX,IAAI,EAAE,SAAS;qBAChB,CAAC;oBACF,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBAEtB,yBAAyB;oBACzB,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;oBAC5C,IAAI,CAAC,oBAAoB,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC;gBACrD,CAAC;YACH,CAAC;QACH,CAAC;QAED,qCAAqC;QACrC,IAAI,CAAC,eAAe,EAAE,CAAC;QACvB,IAAI,CAAC,gBAAgB,EAAE,CAAC;IAC1B,CAAC;IAED;;;OAGG;IACH,eAAe;QACb,MAAM,MAAM,GAAa,EAAE,CAAC;QAC5B,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;QAE3C,wBAAwB;QACxB,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;YACvC,QAAQ,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,oBAAoB,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,IAAI,IAAI,CAAC,CAAC,CAAC;QACzE,CAAC;QAED,kCAAkC;QAClC,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,KAAK,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;YACxC,IAAI,MAAM,KAAK,CAAC,EAAE,CAAC;gBACjB,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACrB,CAAC;QACH,CAAC;QAED,gBAAgB;QAChB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YAC9B,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAEpB,uCAAuC;YACvC,MAAM,SAAS,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACjD,IAAI,SAAS,EAAE,CAAC;gBACd,KAAK,MAAM,UAAU,IAAI,SAAS,EAAE,CAAC;oBACnC,MAAM,SAAS,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;oBACtD,QAAQ,CAAC,GAAG,CAAC,UAAU,EAAE,SAAS,CAAC,CAAC;oBACpC,IAAI,SAAS,KAAK,CAAC,EAAE,CAAC;wBACpB,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;oBACzB,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,gDAAgD;QAChD,IAAI,MAAM,CAAC,MAAM,KAAK,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;YACtC,MAAM,MAAM,GAAG,IAAI,CAAC,YAAY,EAAE,CAAC;YACnC,MAAM,IAAI,KAAK,CACb,qCAAqC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CACjF,CAAC;QACJ,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;OAGG;IACH,YAAY;QACV,MAAM,MAAM,GAAe,EAAE,CAAC;QAC9B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;QAEnC,MAAM,GAAG,GAAG,CAAC,MAAc,EAAE,IAAc,EAAQ,EAAE;YACnD,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACpB,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACrB,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAElB,MAAM,SAAS,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACjD,IAAI,SAAS,EAAE,CAAC;gBACd,KAAK,MAAM,UAAU,IAAI,SAAS,EAAE,CAAC;oBACnC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;wBAC7B,GAAG,CAAC,UAAU,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;oBAC7B,CAAC;yBAAM,IAAI,QAAQ,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;wBACpC,iBAAiB;wBACjB,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;wBAC5C,MAAM,KAAK,GAAG,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE,UAAU,CAAC,CAAC;wBACtD,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;oBACrB,CAAC;gBACH,CAAC;YACH,CAAC;YAED,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAC1B,CAAC,CAAC;QAEF,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;YACvC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;gBACzB,GAAG,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;YAClB,CAAC;QACH,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;OAGG;IACK,eAAe;QACrB,IAAI,CAAC;YACH,MAAM,MAAM,GAAG,IAAI,CAAC,eAAe,EAAE,CAAC;YACtC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;YAEzC,6BAA6B;YAC7B,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;gBACvC,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;YACxB,CAAC;YAED,qCAAqC;YACrC,KAAK,MAAM,MAAM,IAAI,MAAM,EAAE,CAAC;gBAC5B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC;gBACrC,MAAM,IAAI,GAAG,IAAI,CAAC,oBAAoB,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;gBAEnD,IAAI,IAAI,IAAI,IAAI,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;oBAC1B,qCAAqC;oBACrC,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAC1B,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CACzD,CAAC;oBACF,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,WAAW,GAAG,CAAC,CAAC,CAAC;gBACtC,CAAC;gBAED,cAAc;gBACd,IAAI,CAAC,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YACvC,CAAC;QACH,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,2CAA2C;YAC3C,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;gBACvC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;YACjB,CAAC;QACH,CAAC;IACH,CAAC;IAED;;;OAGG;IACK,gBAAgB;QACtB,IAAI,CAAC;YACH,MAAM,MAAM,GAAG,IAAI,CAAC,eAAe,EAAE,CAAC;YAEtC,gDAAgD;YAChD,MAAM,aAAa,GAAG,IAAI,GAAG,EAAkB,CAAC;YAChD,KAAK,MAAM,MAAM,IAAI,MAAM,EAAE,CAAC;gBAC5B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC;gBACrC,MAAM,IAAI,GAAG,IAAI,CAAC,oBAAoB,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;gBAEnD,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;oBAC7B,aAAa,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;gBAC/B,CAAC;qBAAM,CAAC;oBACN,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CACxB,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE;wBAC9B,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAE,CAAC;wBACvC,MAAM,QAAQ,GAAG,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;wBAC/C,OAAO,QAAQ,GAAG,OAAO,CAAC,QAAQ,CAAC;oBACrC,CAAC,CAAC,CACH,CAAC;oBACF,aAAa,CAAC,GAAG,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;gBACvC,CAAC;YACH,CAAC;YAED,+CAA+C;YAC/C,MAAM,WAAW,GAAG,IAAI,GAAG,EAAkB,CAAC;YAC9C,MAAM,aAAa,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,OAAO,EAAE,CAAC;YAE5C,+BAA+B;YAC/B,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CACzB,GAAG,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE;gBACrB,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC;gBACrC,OAAO,CAAC,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC;YAC1D,CAAC,CAAC,CACH,CAAC;YAEF,KAAK,MAAM,MAAM,IAAI,aAAa,EAAE,CAAC;gBACnC,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC;gBACrC,MAAM,UAAU,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;gBAElD,IAAI,CAAC,UAAU,IAAI,UAAU,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;oBACzC,YAAY;oBACZ,WAAW,CAAC,GAAG,CAAC,MAAM,EAAE,UAAU,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC;gBACtD,CAAC;qBAAM,CAAC;oBACN,MAAM,iBAAiB,GAAG,IAAI,CAAC,GAAG,CAChC,GAAG,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,UAAU,CAAC,CAC/E,CAAC;oBACF,WAAW,CAAC,GAAG,CAAC,MAAM,EAAE,iBAAiB,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC;gBAC7D,CAAC;YACH,CAAC;YAED,2CAA2C;YAC3C,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;gBACvC,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC;gBACrC,MAAM,QAAQ,GAAG,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;gBAChD,MAAM,MAAM,GAAG,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;gBAC5C,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,sBAAsB;YACzE,CAAC;QACH,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,4CAA4C;YAC5C,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;gBACvC,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC;YACxB,CAAC;QACH,CAAC;IACH,CAAC;IAED;;OAEG;IACH,eAAe;QACb,MAAM,aAAa,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;aAClD,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC;aAC7B,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;QAErC,OAAO,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC5C,CAAC;IAED;;OAEG;IACH,uBAAuB;QACrB,MAAM,YAAY,GAAG,IAAI,CAAC,eAAe,EAAE,CAAC;QAC5C,OAAO,YAAY,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE;YAC3C,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACpC,OAAO,KAAK,GAAG,CAAC,IAAI,EAAE,QAAQ,IAAI,CAAC,CAAC,CAAC;QACvC,CAAC,EAAE,CAAC,CAAC,CAAC;IACR,CAAC;IAED;;OAEG;IACH,kBAAkB;QAChB,MAAM,WAAW,GAAG,IAAI,GAAG,EAAoB,CAAC;QAEhD,KAAK,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YACxC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;YACzB,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC5B,WAAW,CAAC,GAAG,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;YAC7B,CAAC;YACD,WAAW,CAAC,GAAG,CAAC,KAAK,CAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACvC,CAAC;QAED,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QAC7D,MAAM,MAAM,GAAe,EAAE,CAAC;QAE9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;YACnC,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;QACxC,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACH,sBAAsB;QACpB,MAAM,MAAM,GAAG,IAAI,GAAG,EAAoB,CAAC;QAC3C,MAAM,MAAM,GAAG,IAAI,CAAC,kBAAkB,EAAE,CAAC;QAEzC,MAAM,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,KAAK,EAAE,EAAE;YAChC,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACvB,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;YAC7B,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACH,WAAW;QACT,MAAM,MAAM,GAAG,IAAI,CAAC,YAAY,EAAE,CAAC;QAEnC,OAAO;YACL,SAAS,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI;YAC1B,SAAS,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM;YAC5B,QAAQ,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;YACxE,kBAAkB,EAAE,IAAI,CAAC,uBAAuB,EAAE;YAClD,SAAS,EAAE,MAAM,CAAC,MAAM,GAAG,CAAC;YAC5B,MAAM,EAAE,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS;SAC/C,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,QAAQ;QACN,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC;IACzC,CAAC;IAED;;OAEG;IACH,QAAQ;QACN,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAED;;OAEG;IACH,OAAO,CAAC,EAAU;QAChB,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAC5B,CAAC;IAED;;OAEG;IACH,eAAe,CAAC,MAAc;QAC5B,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,oBAAoB,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC;IACjE,CAAC;IAED;;OAEG;IACH,aAAa,CAAC,MAAc;QAC1B,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC;IAC1D,CAAC;IAED;;OAEG;IACH,SAAS;QACP,OAAO,IAAI,CAAC,YAAY,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC;IACxC,CAAC;IAED;;OAEG;IACH,YAAY;QACV,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE;YACnD,MAAM,IAAI,GAAG,IAAI,CAAC,oBAAoB,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACnD,OAAO,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,KAAK,CAAC,CAAC;QAClC,CAAC,CAAC,CAAC;IACL,CAAC;IAED;;OAEG;IACH,YAAY;QACV,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE;YACnD,MAAM,IAAI,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAC5C,OAAO,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,KAAK,CAAC,CAAC;QAClC,CAAC,CAAC,CAAC;IACL,CAAC;CACF"}

package/dist/src/speckit/utils/FileWriter.d.ts

@@ -1,27 +0,0 @@
-/**
- * File Writer
- *
- * Week 3-4 Implementation - Day 4
- * Writes scaffold files to disk with safety checks
- */
-import type { RenderedFile, ScaffoldOptions, ScaffoldResult, ProjectStructure } from '../types/speckit.types.js';
-/**
- * File Writer
- *
- * Responsible for writing files and creating directories with proper permissions and safety checks.
- */
-export declare class FileWriter {
-    /**
-     * Write files and directories to disk
-     */
-    write(structure: ProjectStructure, files: RenderedFile[], options: ScaffoldOptions): Promise<ScaffoldResult>;
-    /**
-     * Check if file exists
-     */
-    private fileExists;
-    /**
-     * Build summary message
-     */
-    private buildSummary;
-}
-//# sourceMappingURL=FileWriter.d.ts.map

package/dist/src/speckit/utils/FileWriter.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"FileWriter.d.ts","sourceRoot":"","sources":["../../../../src/speckit/utils/FileWriter.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAIH,OAAO,KAAK,EACV,YAAY,EACZ,eAAe,EACf,cAAc,EACd,gBAAgB,EACjB,MAAM,2BAA2B,CAAC;AAEnC;;;;GAIG;AACH,qBAAa,UAAU;IACrB;;OAEG;IACG,KAAK,CACT,SAAS,EAAE,gBAAgB,EAC3B,KAAK,EAAE,YAAY,EAAE,EACrB,OAAO,EAAE,eAAe,GACvB,OAAO,CAAC,cAAc,CAAC;IA4D1B;;OAEG;YACW,UAAU;IASxB;;OAEG;IACH,OAAO,CAAC,YAAY;CAIrB"}

package/dist/src/speckit/utils/FileWriter.js

@@ -1,87 +0,0 @@
-/**
- * File Writer
- *
- * Week 3-4 Implementation - Day 4
- * Writes scaffold files to disk with safety checks
- */
-import * as fs from 'fs/promises';
-import * as path from 'path';
-/**
- * File Writer
- *
- * Responsible for writing files and creating directories with proper permissions and safety checks.
- */
-export class FileWriter {
-    /**
-     * Write files and directories to disk
-     */
-    async write(structure, files, options) {
-        const outputPath = options.outputPath || './project';
-        const createdFiles = [];
-        const createdDirectories = [];
-        // Dry run mode - just return what would be created
-        if (options.dryRun) {
-            return {
-                outputPath,
-                createdFiles: files.map(f => f.path),
-                createdDirectories: structure.directories,
-                summary: this.buildSummary(files.map(f => f.path), structure.directories, true),
-            };
-        }
-        // Create output directory
-        await fs.mkdir(outputPath, { recursive: true });
-        // Create directories
-        for (const dir of structure.directories) {
-            const fullPath = path.join(outputPath, dir);
-            await fs.mkdir(fullPath, { recursive: true });
-            createdDirectories.push(dir);
-        }
-        // Write files
-        for (const file of files) {
-            const fullPath = path.join(outputPath, file.path);
-            // Check for existing file
-            if (await this.fileExists(fullPath)) {
-                if (!options.overwrite) {
-                    // Skip existing files if not overwriting
-                    continue;
-                }
-            }
-            // Ensure parent directory exists
-            const parentDir = path.dirname(fullPath);
-            await fs.mkdir(parentDir, { recursive: true });
-            // Write file
-            await fs.writeFile(fullPath, file.content, 'utf-8');
-            // Set executable permission if needed
-            if (file.executable) {
-                await fs.chmod(fullPath, 0o755);
-            }
-            createdFiles.push(file.path);
-        }
-        return {
-            outputPath,
-            createdFiles,
-            createdDirectories,
-            summary: this.buildSummary(createdFiles, createdDirectories),
-        };
-    }
-    /**
-     * Check if file exists
-     */
-    async fileExists(filePath) {
-        try {
-            await fs.access(filePath);
-            return true;
-        }
-        catch {
-            return false;
-        }
-    }
-    /**
-     * Build summary message
-     */
-    buildSummary(files, directories, dryRun = false) {
-        const prefix = dryRun ? 'Would create' : 'Created';
-        return `${prefix} ${files.length} files and ${directories.length} directories`;
-    }
-}
-//# sourceMappingURL=FileWriter.js.map

package/dist/src/speckit/utils/FileWriter.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"FileWriter.js","sourceRoot":"","sources":["../../../../src/speckit/utils/FileWriter.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,KAAK,EAAE,MAAM,aAAa,CAAC;AAClC,OAAO,KAAK,IAAI,MAAM,MAAM,CAAC;AAQ7B;;;;GAIG;AACH,MAAM,OAAO,UAAU;IACrB;;OAEG;IACH,KAAK,CAAC,KAAK,CACT,SAA2B,EAC3B,KAAqB,EACrB,OAAwB;QAExB,MAAM,UAAU,GAAG,OAAO,CAAC,UAAU,IAAI,WAAW,CAAC;QACrD,MAAM,YAAY,GAAa,EAAE,CAAC;QAClC,MAAM,kBAAkB,GAAa,EAAE,CAAC;QAExC,mDAAmD;QACnD,IAAI,OAAO,CAAC,MAAM,EAAE,CAAC;YACnB,OAAO;gBACL,UAAU;gBACV,YAAY,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;gBACpC,kBAAkB,EAAE,SAAS,CAAC,WAAW;gBACzC,OAAO,EAAE,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,SAAS,CAAC,WAAW,EAAE,IAAI,CAAC;aAChF,CAAC;QACJ,CAAC;QAED,0BAA0B;QAC1B,MAAM,EAAE,CAAC,KAAK,CAAC,UAAU,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;QAEhD,qBAAqB;QACrB,KAAK,MAAM,GAAG,IAAI,SAAS,CAAC,WAAW,EAAE,CAAC;YACxC,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,GAAG,CAAC,CAAC;YAC5C,MAAM,EAAE,CAAC,KAAK,CAAC,QAAQ,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;YAC9C,kBAAkB,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC/B,CAAC;QAED,cAAc;QACd,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;YAElD,0BAA0B;YAC1B,IAAI,MAAM,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,EAAE,CAAC;gBACpC,IAAI,CAAC,OAAO,CAAC,SAAS,EAAE,CAAC;oBACvB,yCAAyC;oBACzC,SAAS;gBACX,CAAC;YACH,CAAC;YAED,iCAAiC;YACjC,MAAM,SAAS,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;YACzC,MAAM,EAAE,CAAC,KAAK,CAAC,SAAS,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;YAE/C,aAAa;YACb,MAAM,EAAE,CAAC,SAAS,CAAC,QAAQ,EAAE,IAAI,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;YAEpD,sCAAsC;YACtC,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;gBACpB,MAAM,EAAE,CAAC,KAAK,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;YAClC,CAAC;YAED,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC/B,CAAC;QAED,OAAO;YACL,UAAU;YACV,YAAY;YACZ,kBAAkB;YAClB,OAAO,EAAE,IAAI,CAAC,YAAY,CAAC,YAAY,EAAE,kBAAkB,CAAC;SAC7D,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,UAAU,CAAC,QAAgB;QACvC,IAAI,CAAC;YACH,MAAM,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;YAC1B,OAAO,IAAI,CAAC;QACd,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,KAAK,CAAC;QACf,CAAC;IACH,CAAC;IAED;;OAEG;IACK,YAAY,CAAC,KAAe,EAAE,WAAqB,EAAE,MAAM,GAAG,KAAK;QACzE,MAAM,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,SAAS,CAAC;QACnD,OAAO,GAAG,MAAM,IAAI,KAAK,CAAC,MAAM,cAAc,WAAW,CAAC,MAAM,cAAc,CAAC;IACjF,CAAC;CACF"}

package/dist/src/speckit/utils/FixtureBuilder.d.ts

@@ -1,47 +0,0 @@
-/**
- * Fixture Builder
- *
- * Week 3-4 Implementation - Day 5
- * Generates test fixtures and sample data
- */
-import type { WorkflowDefinition, TestableStep, FixtureFile } from '../types/speckit.types.js';
-/**
- * Fixture Builder
- *
- * Generates test data fixtures for workflows, steps, errors, and edge cases.
- */
-export declare class FixtureBuilder {
-    /**
-     * Generate all fixtures for a workflow
-     */
-    generateFixtures(workflow: WorkflowDefinition, steps: TestableStep[]): FixtureFile[];
-    /**
-     * Build workflow fixture
-     */
-    private buildWorkflowFixture;
-    /**
-     * Build steps fixture
-     */
-    private buildStepsFixture;
-    /**
-     * Build error fixtures
-     */
-    private buildErrorFixtures;
-    /**
-     * Build edge case fixtures
-     */
-    private buildEdgeCaseFixtures;
-    /**
-     * Estimate total duration
-     */
-    private estimateTotalDuration;
-    /**
-     * Estimate total cost
-     */
-    private estimateTotalCost;
-    /**
-     * Convert string to kebab-case
-     */
-    private kebabCase;
-}
-//# sourceMappingURL=FixtureBuilder.d.ts.map

package/dist/src/speckit/utils/FixtureBuilder.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"FixtureBuilder.d.ts","sourceRoot":"","sources":["../../../../src/speckit/utils/FixtureBuilder.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,KAAK,EACV,kBAAkB,EAElB,YAAY,EACZ,WAAW,EACZ,MAAM,2BAA2B,CAAC;AAEnC;;;;GAIG;AACH,qBAAa,cAAc;IACzB;;OAEG;IACH,gBAAgB,CACd,QAAQ,EAAE,kBAAkB,EAC5B,KAAK,EAAE,YAAY,EAAE,GACpB,WAAW,EAAE;IAWhB;;OAEG;IACH,OAAO,CAAC,oBAAoB;IAuC5B;;OAEG;IACH,OAAO,CAAC,iBAAiB;IAuCzB;;OAEG;IACH,OAAO,CAAC,kBAAkB;IA2D1B;;OAEG;IACH,OAAO,CAAC,qBAAqB;IAsF7B;;OAEG;IACH,OAAO,CAAC,qBAAqB;IAI7B;;OAEG;IACH,OAAO,CAAC,iBAAiB;IAKzB;;OAEG;IACH,OAAO,CAAC,SAAS;CAMlB"}