@aquex/cmos-mcp 1.0.0

package/dist/intelligence/graph-validator.js

@@ -0,0 +1,212 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.GraphValidator = void 0;
+/**
+ * GraphValidator - Validates dependency graphs for DAG properties and cycles
+ * Based on research findings from R4.3_Intelligent_Mission_Sequencing
+ */
+class GraphValidator {
+    /**
+     * Validate a dependency graph
+     * @param graph The dependency graph to validate
+     * @returns ValidationResult
+     */
+    validate(graph) {
+        const errors = [];
+        const warnings = [];
+        const cycles = [];
+        // Check for missing dependencies
+        this.checkMissingDependencies(graph, warnings);
+        // Detect cycles using DFS with back-edge detection
+        const cycleDetection = this.detectCycles(graph);
+        if (cycleDetection.hasCycles) {
+            for (const cycle of cycleDetection.cycles) {
+                cycles.push({
+                    nodes: cycle,
+                    path: cycle.join(' -> '),
+                });
+                errors.push(`Circular dependency detected: ${cycle.join(' -> ')}`);
+            }
+        }
+        const isDAG = !cycleDetection.hasCycles;
+        const isValid = errors.length === 0;
+        return {
+            isValid,
+            isDAG,
+            cycles,
+            errors,
+            warnings,
+        };
+    }
+    /**
+     * Check for missing dependencies (dependencies referenced but not in graph)
+     */
+    checkMissingDependencies(graph, warnings) {
+        for (const [nodeId, edges] of graph.edges.entries()) {
+            for (const depId of edges) {
+                if (!graph.nodes.has(depId)) {
+                    warnings.push(`Mission ${nodeId} depends on ${depId}, but ${depId} is not in the graph`);
+                }
+            }
+        }
+    }
+    /**
+     * Detect cycles using DFS with three-color algorithm
+     * Based on R4.3: "Implement DFS-based cycle detection with back-edge identification"
+     */
+    detectCycles(graph) {
+        const WHITE = 0; // Not visited
+        const GREY = 1; // Currently visiting
+        const BLACK = 2; // Completely visited
+        const color = new Map();
+        const parent = new Map();
+        const cycles = [];
+        // Initialize all nodes as white
+        for (const nodeId of graph.nodes.keys()) {
+            color.set(nodeId, WHITE);
+            parent.set(nodeId, null);
+        }
+        // DFS helper function
+        const dfs = (nodeId, recursionStack) => {
+            color.set(nodeId, GREY);
+            recursionStack.add(nodeId);
+            const edges = graph.edges.get(nodeId);
+            if (edges) {
+                for (const neighbor of edges) {
+                    // Skip if neighbor doesn't exist in graph
+                    if (!graph.nodes.has(neighbor)) {
+                        continue;
+                    }
+                    if (color.get(neighbor) === WHITE) {
+                        parent.set(neighbor, nodeId);
+                        dfs(neighbor, recursionStack);
+                    }
+                    else if (color.get(neighbor) === GREY) {
+                        // Back edge found - we have a cycle
+                        const cycle = this.extractCycle(nodeId, neighbor, parent);
+                        cycles.push(cycle);
+                    }
+                }
+            }
+            color.set(nodeId, BLACK);
+            recursionStack.delete(nodeId);
+        };
+        // Run DFS from each unvisited node
+        for (const nodeId of graph.nodes.keys()) {
+            if (color.get(nodeId) === WHITE) {
+                dfs(nodeId, new Set());
+            }
+        }
+        return {
+            hasCycles: cycles.length > 0,
+            cycles,
+        };
+    }
+    /**
+     * Extract the cycle path when a back edge is detected
+     */
+    extractCycle(current, backEdge, parent) {
+        const cycle = [backEdge, current];
+        let node = parent.get(current);
+        while (node && node !== backEdge) {
+            cycle.unshift(node);
+            node = parent.get(node);
+        }
+        cycle.unshift(backEdge); // Complete the cycle
+        return cycle;
+    }
+    /**
+     * Check if graph is a valid DAG (Directed Acyclic Graph)
+     */
+    isDAG(graph) {
+        return !this.detectCycles(graph).hasCycles;
+    }
+    /**
+     * Validate execution order against graph
+     * Ensures topological ordering is valid
+     */
+    validateExecutionOrder(graph, executionOrder) {
+        // Create a position map
+        const position = new Map();
+        executionOrder.forEach((nodeId, index) => {
+            position.set(nodeId, index);
+        });
+        // Check that all dependencies come before dependents
+        // In our graph: edge from A to B means A depends on B, so B must execute before A
+        for (const [nodeId, edges] of graph.edges.entries()) {
+            const nodePos = position.get(nodeId);
+            if (nodePos === undefined) {
+                return false;
+            }
+            for (const depId of edges) {
+                if (!graph.nodes.has(depId)) {
+                    continue; // Skip missing dependencies
+                }
+                const depPos = position.get(depId);
+                if (depPos === undefined) {
+                    return false;
+                }
+                // Dependency (depId) must come before the node that depends on it (nodeId)
+                if (depPos >= nodePos) {
+                    return false;
+                }
+            }
+        }
+        return true;
+    }
+    /**
+     * Get strongly connected components (useful for advanced cycle analysis)
+     * Uses Tarjan's algorithm
+     */
+    getStronglyConnectedComponents(graph) {
+        const index = new Map();
+        const lowLink = new Map();
+        const onStack = new Map();
+        const stack = [];
+        const sccs = [];
+        let currentIndex = 0;
+        const strongConnect = (nodeId) => {
+            index.set(nodeId, currentIndex);
+            lowLink.set(nodeId, currentIndex);
+            currentIndex++;
+            stack.push(nodeId);
+            onStack.set(nodeId, true);
+            const edges = graph.edges.get(nodeId);
+            if (edges) {
+                for (const neighbor of edges) {
+                    if (!graph.nodes.has(neighbor)) {
+                        continue;
+                    }
+                    if (!index.has(neighbor)) {
+                        strongConnect(neighbor);
+                        lowLink.set(nodeId, Math.min(lowLink.get(nodeId), lowLink.get(neighbor)));
+                    }
+                    else if (onStack.get(neighbor)) {
+                        lowLink.set(nodeId, Math.min(lowLink.get(nodeId), index.get(neighbor)));
+                    }
+                }
+            }
+            // If nodeId is a root node, pop the stack and create an SCC
+            if (lowLink.get(nodeId) === index.get(nodeId)) {
+                const scc = [];
+                let w;
+                do {
+                    w = stack.pop();
+                    onStack.set(w, false);
+                    scc.push(w);
+                } while (w !== nodeId);
+                if (scc.length > 1 || (scc.length === 1 && graph.edges.get(scc[0])?.has(scc[0]))) {
+                    sccs.push(scc);
+                }
+            }
+        };
+        for (const nodeId of graph.nodes.keys()) {
+            if (!index.has(nodeId)) {
+                strongConnect(nodeId);
+            }
+        }
+        return sccs;
+    }
+}
+exports.GraphValidator = GraphValidator;
+//# sourceMappingURL=graph-validator.js.map

package/dist/intelligence/graph-validator.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-validator.js","sourceRoot":"","sources":["../../src/intelligence/graph-validator.ts"],"names":[],"mappings":";;;AAqBA;;;GAGG;AACH,MAAa,cAAc;IACzB;;;;OAIG;IACH,QAAQ,CAAC,KAAsB;QAC7B,MAAM,MAAM,GAAa,EAAE,CAAC;QAC5B,MAAM,QAAQ,GAAa,EAAE,CAAC;QAC9B,MAAM,MAAM,GAAgB,EAAE,CAAC;QAE/B,iCAAiC;QACjC,IAAI,CAAC,wBAAwB,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;QAE/C,mDAAmD;QACnD,MAAM,cAAc,GAAG,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;QAEhD,IAAI,cAAc,CAAC,SAAS,EAAE,CAAC;YAC7B,KAAK,MAAM,KAAK,IAAI,cAAc,CAAC,MAAM,EAAE,CAAC;gBAC1C,MAAM,CAAC,IAAI,CAAC;oBACV,KAAK,EAAE,KAAK;oBACZ,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC;iBACzB,CAAC,CAAC;gBACH,MAAM,CAAC,IAAI,CAAC,iCAAiC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YACrE,CAAC;QACH,CAAC;QAED,MAAM,KAAK,GAAG,CAAC,cAAc,CAAC,SAAS,CAAC;QACxC,MAAM,OAAO,GAAG,MAAM,CAAC,MAAM,KAAK,CAAC,CAAC;QAEpC,OAAO;YACL,OAAO;YACP,KAAK;YACL,MAAM;YACN,MAAM;YACN,QAAQ;SACT,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,wBAAwB,CAAC,KAAsB,EAAE,QAAkB;QACzE,KAAK,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,IAAI,KAAK,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;YACpD,KAAK,MAAM,KAAK,IAAI,KAAK,EAAE,CAAC;gBAC1B,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;oBAC5B,QAAQ,CAAC,IAAI,CAAC,WAAW,MAAM,eAAe,KAAK,SAAS,KAAK,sBAAsB,CAAC,CAAC;gBAC3F,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED;;;OAGG;IACH,YAAY,CAAC,KAAsB;QACjC,MAAM,KAAK,GAAG,CAAC,CAAC,CAAC,cAAc;QAC/B,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,qBAAqB;QACrC,MAAM,KAAK,GAAG,CAAC,CAAC,CAAC,qBAAqB;QAEtC,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;QACxC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAyB,CAAC;QAChD,MAAM,MAAM,GAAe,EAAE,CAAC;QAE9B,gCAAgC;QAChC,KAAK,MAAM,MAAM,IAAI,KAAK,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;YACxC,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;YACzB,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QAC3B,CAAC;QAED,sBAAsB;QACtB,MAAM,GAAG,GAAG,CAAC,MAAc,EAAE,cAA2B,EAAQ,EAAE;YAChE,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;YACxB,cAAc,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAE3B,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACtC,IAAI,KAAK,EAAE,CAAC;gBACV,KAAK,MAAM,QAAQ,IAAI,KAAK,EAAE,CAAC;oBAC7B,0CAA0C;oBAC1C,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;wBAC/B,SAAS;oBACX,CAAC;oBAED,IAAI,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,KAAK,KAAK,EAAE,CAAC;wBAClC,MAAM,CAAC,GAAG,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;wBAC7B,GAAG,CAAC,QAAQ,EAAE,cAAc,CAAC,CAAC;oBAChC,CAAC;yBAAM,IAAI,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,KAAK,IAAI,EAAE,CAAC;wBACxC,oCAAoC;wBACpC,MAAM,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;wBAC1D,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;oBACrB,CAAC;gBACH,CAAC;YACH,CAAC;YAED,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;YACzB,cAAc,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAChC,CAAC,CAAC;QAEF,mCAAmC;QACnC,KAAK,MAAM,MAAM,IAAI,KAAK,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;YACxC,IAAI,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,KAAK,EAAE,CAAC;gBAChC,GAAG,CAAC,MAAM,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;YACzB,CAAC;QACH,CAAC;QAED,OAAO;YACL,SAAS,EAAE,MAAM,CAAC,MAAM,GAAG,CAAC;YAC5B,MAAM;SACP,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,YAAY,CAClB,OAAe,EACf,QAAgB,EAChB,MAAkC;QAElC,MAAM,KAAK,GAAa,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;QAC5C,IAAI,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QAE/B,OAAO,IAAI,IAAI,IAAI,KAAK,QAAQ,EAAE,CAAC;YACjC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;YACpB,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC1B,CAAC;QAED,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,qBAAqB;QAC9C,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,KAAsB;QAC1B,OAAO,CAAC,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,SAAS,CAAC;IAC7C,CAAC;IAED;;;OAGG;IACH,sBAAsB,CAAC,KAAsB,EAAE,cAAwB;QACrE,wBAAwB;QACxB,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC3C,cAAc,CAAC,OAAO,CAAC,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE;YACvC,QAAQ,CAAC,GAAG,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QAC9B,CAAC,CAAC,CAAC;QAEH,qDAAqD;QACrD,kFAAkF;QAClF,KAAK,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,IAAI,KAAK,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;YACpD,MAAM,OAAO,GAAG,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACrC,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;gBAC1B,OAAO,KAAK,CAAC;YACf,CAAC;YAED,KAAK,MAAM,KAAK,IAAI,KAAK,EAAE,CAAC;gBAC1B,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;oBAC5B,SAAS,CAAC,4BAA4B;gBACxC,CAAC;gBAED,MAAM,MAAM,GAAG,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;gBACnC,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;oBACzB,OAAO,KAAK,CAAC;gBACf,CAAC;gBAED,2EAA2E;gBAC3E,IAAI,MAAM,IAAI,OAAO,EAAE,CAAC;oBACtB,OAAO,KAAK,CAAC;gBACf,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;OAGG;IACH,8BAA8B,CAAC,KAAsB;QACnD,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;QACxC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC1C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAmB,CAAC;QAC3C,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,MAAM,IAAI,GAAe,EAAE,CAAC;QAC5B,IAAI,YAAY,GAAG,CAAC,CAAC;QAErB,MAAM,aAAa,GAAG,CAAC,MAAc,EAAQ,EAAE;YAC7C,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;YAChC,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;YAClC,YAAY,EAAE,CAAC;YACf,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACnB,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;YAE1B,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACtC,IAAI,KAAK,EAAE,CAAC;gBACV,KAAK,MAAM,QAAQ,IAAI,KAAK,EAAE,CAAC;oBAC7B,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;wBAC/B,SAAS;oBACX,CAAC;oBAED,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;wBACzB,aAAa,CAAC,QAAQ,CAAC,CAAC;wBACxB,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAE,EAAE,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAC,CAAC,CAAC;oBAC9E,CAAC;yBAAM,IAAI,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;wBACjC,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAE,EAAE,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAC,CAAC,CAAC;oBAC5E,CAAC;gBACH,CAAC;YACH,CAAC;YAED,4DAA4D;YAC5D,IAAI,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;gBAC9C,MAAM,GAAG,GAAa,EAAE,CAAC;gBACzB,IAAI,CAAS,CAAC;gBACd,GAAG,CAAC;oBACF,CAAC,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;oBACjB,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;oBACtB,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACd,CAAC,QAAQ,CAAC,KAAK,MAAM,EAAE;gBAEvB,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,KAAK,CAAC,IAAI,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;oBACjF,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBACjB,CAAC;YACH,CAAC;QACH,CAAC,CAAC;QAEF,KAAK,MAAM,MAAM,IAAI,KAAK,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;YACxC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;gBACvB,aAAa,CAAC,MAAM,CAAC,CAAC;YACxB,CAAC;QACH,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;CACF;AA7OD,wCA6OC"}

package/dist/intelligence/lifecycle-analyzer.d.ts

@@ -0,0 +1,64 @@
+import { MissionRecord } from './dependency-analyzer';
+export type LifecyclePhaseType = 'PDLC' | 'SDLC';
+export interface LifecyclePhaseAssignment {
+    phaseType: LifecyclePhaseType;
+    phase: string;
+    confidence: number;
+    score: number;
+    evidence: string[];
+}
+export interface LifecycleDependencyHint {
+    from: string;
+    to: string;
+    phaseType: LifecyclePhaseType;
+    phase: string;
+    requiredPhase: string;
+    confidence: number;
+    reason: string;
+    source: 'lifecycle-sequencing' | 'artifact-flow';
+    artifactName?: string;
+}
+export interface LifecycleAnomaly {
+    missionId: string;
+    phaseType: LifecyclePhaseType;
+    phase: string;
+    issue: string;
+    severity: 'warning' | 'error';
+    missingPrerequisites?: string[];
+}
+export interface LifecycleAnalysis {
+    assignments: Record<string, LifecyclePhaseAssignment[]>;
+    dependencies: LifecycleDependencyHint[];
+    anomalies: LifecycleAnomaly[];
+}
+interface LifecycleAnalyzerConfig {
+    minAssignmentConfidence?: number;
+    dependencyConfidenceThreshold?: number;
+}
+/**
+ * LifecycleAnalyzer
+ *
+ * Detects PDLC/SDLC phases for missions and infers implicit dependencies based on canonical phase order
+ * and artifact flow. Provides lifecycle anomalies when sequencing violations are detected.
+ */
+export declare class LifecycleAnalyzer {
+    private readonly config;
+    constructor(config?: LifecycleAnalyzerConfig);
+    analyze(missions: MissionRecord[]): LifecycleAnalysis;
+    private detectPhases;
+    private evaluateHeuristic;
+    private buildLifecycleDependencies;
+    private buildArtifactDependencies;
+    private collectMissionText;
+    private collectMissionDeliverables;
+    private collectRoleEntries;
+    private extractArtifacts;
+    private selectStrongestProducer;
+    private getPrimaryAssignment;
+    private getDominantAssignment;
+    private textContains;
+    private escapeRegex;
+    private isArtifactCandidate;
+}
+export {};
+//# sourceMappingURL=lifecycle-analyzer.d.ts.map

package/dist/intelligence/lifecycle-analyzer.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"lifecycle-analyzer.d.ts","sourceRoot":"","sources":["../../src/intelligence/lifecycle-analyzer.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,aAAa,EAAE,MAAM,uBAAuB,CAAC;AAEtD,MAAM,MAAM,kBAAkB,GAAG,MAAM,GAAG,MAAM,CAAC;AAEjD,MAAM,WAAW,wBAAwB;IACvC,SAAS,EAAE,kBAAkB,CAAC;IAC9B,KAAK,EAAE,MAAM,CAAC;IACd,UAAU,EAAE,MAAM,CAAC;IACnB,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,EAAE,MAAM,EAAE,CAAC;CACpB;AAED,MAAM,WAAW,uBAAuB;IACtC,IAAI,EAAE,MAAM,CAAC;IACb,EAAE,EAAE,MAAM,CAAC;IACX,SAAS,EAAE,kBAAkB,CAAC;IAC9B,KAAK,EAAE,MAAM,CAAC;IACd,aAAa,EAAE,MAAM,CAAC;IACtB,UAAU,EAAE,MAAM,CAAC;IACnB,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,EAAE,sBAAsB,GAAG,eAAe,CAAC;IACjD,YAAY,CAAC,EAAE,MAAM,CAAC;CACvB;AAED,MAAM,WAAW,gBAAgB;IAC/B,SAAS,EAAE,MAAM,CAAC;IAClB,SAAS,EAAE,kBAAkB,CAAC;IAC9B,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,EAAE,SAAS,GAAG,OAAO,CAAC;IAC9B,oBAAoB,CAAC,EAAE,MAAM,EAAE,CAAC;CACjC;AAED,MAAM,WAAW,iBAAiB;IAChC,WAAW,EAAE,MAAM,CAAC,MAAM,EAAE,wBAAwB,EAAE,CAAC,CAAC;IACxD,YAAY,EAAE,uBAAuB,EAAE,CAAC;IACxC,SAAS,EAAE,gBAAgB,EAAE,CAAC;CAC/B;AAED,UAAU,uBAAuB;IAC/B,uBAAuB,CAAC,EAAE,MAAM,CAAC;IACjC,6BAA6B,CAAC,EAAE,MAAM,CAAC;CACxC;AA0ND;;;;;GAKG;AACH,qBAAa,iBAAiB;IAC5B,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAoC;gBAE/C,MAAM,GAAE,uBAA4B;IAQhD,OAAO,CAAC,QAAQ,EAAE,aAAa,EAAE,GAAG,iBAAiB;IAkDrD,OAAO,CAAC,YAAY;IAcpB,OAAO,CAAC,iBAAiB;IAsFzB,OAAO,CAAC,0BAA0B;IAiGlC,OAAO,CAAC,yBAAyB;IAgEjC,OAAO,CAAC,kBAAkB;IA+B1B,OAAO,CAAC,0BAA0B;IAkBlC,OAAO,CAAC,kBAAkB;IAsB1B,OAAO,CAAC,gBAAgB;IAsBxB,OAAO,CAAC,uBAAuB;IAuB/B,OAAO,CAAC,oBAAoB;IAY5B,OAAO,CAAC,qBAAqB;IAS7B,OAAO,CAAC,YAAY;IAkBpB,OAAO,CAAC,WAAW;IAInB,OAAO,CAAC,mBAAmB;CAY5B"}