agentic-qe 3.6.19 → 3.7.0

package/v3/dist/integrations/ruvector/mincut-wrapper.d.ts

@@ -0,0 +1,204 @@
+/**
+ * QE Wrapper for MinCut Calculator
+ *
+ * This wrapper provides a QE-specific interface on top of the TypeScript
+ * MinCutCalculator (v3/src/coordination/mincut/mincut-calculator.ts).
+ * Follows the same pattern as gnn-wrapper.ts and sona-wrapper.ts.
+ *
+ * ADR-068: Mincut-Gated Model Routing
+ *
+ * @module integrations/ruvector/mincut-wrapper
+ */
+import { SwarmGraph } from '../../coordination/mincut/swarm-graph.js';
+/**
+ * Task graph node representing a task or agent in the routing context
+ */
+export interface TaskGraphNode {
+    /** Unique node identifier */
+    readonly id: string;
+    /** Node label for display */
+    readonly label: string;
+    /**
+     * Node type:
+     * - 'task': A task to be routed
+     * - 'agent': An agent in the fleet
+     * - 'domain': A domain grouping
+     */
+    readonly type: 'task' | 'agent' | 'domain';
+    /** Associated domain name */
+    readonly domain?: string;
+    /** Node weight (importance) */
+    readonly weight: number;
+    /** Additional metadata */
+    readonly metadata?: Record<string, unknown>;
+}
+/**
+ * Edge connecting two nodes in the task graph
+ */
+export interface TaskGraphEdge {
+    /** Source node ID */
+    readonly source: string;
+    /** Target node ID */
+    readonly target: string;
+    /** Edge weight representing connection strength */
+    readonly weight: number;
+    /** Edge type */
+    readonly edgeType: 'dependency' | 'communication' | 'coordination' | 'workflow';
+}
+/**
+ * Task graph used for mincut-based routing analysis
+ */
+export interface TaskGraph {
+    /** All nodes in the graph */
+    readonly nodes: TaskGraphNode[];
+    /** All edges in the graph */
+    readonly edges: TaskGraphEdge[];
+}
+/**
+ * An agent node in the fleet topology
+ */
+export interface AgentNode {
+    /** Agent identifier */
+    readonly id: string;
+    /** Agent display name */
+    readonly name: string;
+    /** Agent domain */
+    readonly domain: string;
+    /** Agent capabilities */
+    readonly capabilities: string[];
+    /** IDs of agents this one depends on */
+    readonly dependsOn: string[];
+    /** Agent importance weight (0-1) */
+    readonly weight: number;
+}
+/**
+ * Routing tier determined by mincut analysis
+ */
+export interface RoutingTier {
+    /** Numeric tier (1 = Haiku, 2 = Sonnet, 3+ = Opus) */
+    readonly tier: number;
+    /** Tier label */
+    readonly label: string;
+    /** Lambda value that determined this tier */
+    readonly lambda: number;
+    /** Normalized lambda (0-1) */
+    readonly normalizedLambda: number;
+    /** Confidence in the routing decision */
+    readonly confidence: number;
+    /** Explanation of why this tier was selected */
+    readonly rationale: string;
+}
+/**
+ * Health report from structural analysis
+ */
+export interface HealthReport {
+    /** Overall lambda (min-cut value) */
+    readonly lambda: number;
+    /** Normalized lambda (0-1, higher = healthier) */
+    readonly normalizedLambda: number;
+    /** Whether the fleet is structurally healthy */
+    readonly healthy: boolean;
+    /** Vertices identified as weak points */
+    readonly weakPoints: string[];
+    /** Risk score (0-1, higher = riskier) */
+    readonly riskScore: number;
+    /** Number of connected components */
+    readonly componentCount: number;
+    /** Whether the graph is fully connected */
+    readonly isConnected: boolean;
+    /** Suggestions for improving structural health */
+    readonly suggestions: string[];
+    /** Timestamp of analysis */
+    readonly analyzedAt: Date;
+}
+/**
+ * QE MinCut Service - Unified interface over the TypeScript MinCutCalculator
+ *
+ * Provides mincut-based graph analysis for routing decisions, fleet health
+ * monitoring, and structural complexity assessment.
+ *
+ * @example
+ * ```typescript
+ * const service = new QEMinCutService();
+ *
+ * // Compute lambda for a task graph
+ * const lambda = service.computeLambda(taskGraph);
+ *
+ * // Determine routing tier
+ * const tier = service.computeRoutingTier('Implement auth flow', agents);
+ *
+ * // Get fleet health
+ * const health = service.getStructuralHealth(taskGraph);
+ * ```
+ */
+export declare class QEMinCutService {
+    private readonly calculator;
+    constructor();
+    /**
+     * Compute the min-cut lambda value for a task graph.
+     *
+     * Lambda represents the minimum edge weight that must be removed to
+     * disconnect the graph. Higher lambda = more connected = simpler routing.
+     *
+     * @param graph - The task graph to analyze
+     * @returns The min-cut lambda value (0 if graph is empty/disconnected)
+     */
+    computeLambda(graph: TaskGraph): number;
+    /**
+     * Determine the optimal routing tier based on task description and agent topology.
+     *
+     * Builds a task graph from the agent topology, computes lambda, and maps
+     * the normalized lambda to a routing tier:
+     * - lambda >= 0.8 (highly connected, simple) -> Tier 1 (Haiku)
+     * - lambda 0.4-0.8 (moderate connectivity) -> Tier 2 (Sonnet)
+     * - lambda < 0.4 (fragmented, complex) -> Tier 3 (Opus)
+     *
+     * @param taskDescription - Description of the task to route
+     * @param agentTopology - Current agent fleet topology
+     * @returns Routing tier recommendation
+     */
+    computeRoutingTier(taskDescription: string, agentTopology: AgentNode[]): RoutingTier;
+    /**
+     * Compute structural health of the agent fleet using mincut lambda.
+     *
+     * Uses Stoer-Wagner style analysis (via weighted degree heuristic) to
+     * assess the robustness of the fleet topology.
+     *
+     * @param graph - The task graph to analyze
+     * @returns Health report with lambda, weak points, and suggestions
+     */
+    getStructuralHealth(graph: TaskGraph): HealthReport;
+    /**
+     * Convert a TaskGraph to a SwarmGraph for use with MinCutCalculator
+     */
+    toSwarmGraph(graph: TaskGraph): SwarmGraph;
+    /**
+     * Build a TaskGraph from agent topology
+     */
+    buildTaskGraphFromTopology(agents: AgentNode[]): TaskGraph;
+    /**
+     * Map normalized lambda to routing tier
+     */
+    private lambdaToTier;
+    /**
+     * Compute confidence in the routing decision
+     */
+    private computeConfidence;
+    /**
+     * Build human-readable rationale for the routing decision
+     */
+    private buildRationale;
+    /**
+     * Generate health improvement suggestions
+     */
+    private generateHealthSuggestions;
+    /**
+     * Create an empty health report for empty graphs
+     */
+    private emptyHealthReport;
+}
+/**
+ * Create a new QEMinCutService instance
+ */
+export declare function createQEMinCutService(): QEMinCutService;
+//# sourceMappingURL=mincut-wrapper.d.ts.map

package/v3/dist/integrations/ruvector/mincut-wrapper.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"mincut-wrapper.d.ts","sourceRoot":"","sources":["../../../src/integrations/ruvector/mincut-wrapper.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAGH,OAAO,EAAE,UAAU,EAAE,MAAM,0CAA0C,CAAC;AAOtE;;GAEG;AACH,MAAM,WAAW,aAAa;IAC5B,6BAA6B;IAC7B,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IAEpB,6BAA6B;IAC7B,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IAEvB;;;;;OAKG;IACH,QAAQ,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,GAAG,QAAQ,CAAC;IAE3C,6BAA6B;IAC7B,QAAQ,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC;IAEzB,+BAA+B;IAC/B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IAExB,0BAA0B;IAC1B,QAAQ,CAAC,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;CAC7C;AAED;;GAEG;AACH,MAAM,WAAW,aAAa;IAC5B,qBAAqB;IACrB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IAExB,qBAAqB;IACrB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IAExB,mDAAmD;IACnD,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IAExB,gBAAgB;IAChB,QAAQ,CAAC,QAAQ,EAAE,YAAY,GAAG,eAAe,GAAG,cAAc,GAAG,UAAU,CAAC;CACjF;AAED;;GAEG;AACH,MAAM,WAAW,SAAS;IACxB,6BAA6B;IAC7B,QAAQ,CAAC,KAAK,EAAE,aAAa,EAAE,CAAC;IAEhC,6BAA6B;IAC7B,QAAQ,CAAC,KAAK,EAAE,aAAa,EAAE,CAAC;CACjC;AAED;;GAEG;AACH,MAAM,WAAW,SAAS;IACxB,uBAAuB;IACvB,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IAEpB,yBAAyB;IACzB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IAEtB,mBAAmB;IACnB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IAExB,yBAAyB;IACzB,QAAQ,CAAC,YAAY,EAAE,MAAM,EAAE,CAAC;IAEhC,wCAAwC;IACxC,QAAQ,CAAC,SAAS,EAAE,MAAM,EAAE,CAAC;IAE7B,oCAAoC;IACpC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;CACzB;AAED;;GAEG;AACH,MAAM,WAAW,WAAW;IAC1B,sDAAsD;IACtD,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IAEtB,iBAAiB;IACjB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IAEvB,6CAA6C;IAC7C,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IAExB,8BAA8B;IAC9B,QAAQ,CAAC,gBAAgB,EAAE,MAAM,CAAC;IAElC,yCAAyC;IACzC,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAE5B,gDAAgD;IAChD,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;CAC5B;AAED;;GAEG;AACH,MAAM,WAAW,YAAY;IAC3B,qCAAqC;IACrC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IAExB,kDAAkD;IAClD,QAAQ,CAAC,gBAAgB,EAAE,MAAM,CAAC;IAElC,gDAAgD;IAChD,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC;IAE1B,yCAAyC;IACzC,QAAQ,CAAC,UAAU,EAAE,MAAM,EAAE,CAAC;IAE9B,yCAAyC;IACzC,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAE3B,qCAAqC;IACrC,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAC;IAEhC,2CAA2C;IAC3C,QAAQ,CAAC,WAAW,EAAE,OAAO,CAAC;IAE9B,kDAAkD;IAClD,QAAQ,CAAC,WAAW,EAAE,MAAM,EAAE,CAAC;IAE/B,4BAA4B;IAC5B,QAAQ,CAAC,UAAU,EAAE,IAAI,CAAC;CAC3B;AAMD;;;;;;;;;;;;;;;;;;;GAmBG;AACH,qBAAa,eAAe;IAC1B,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAmB;;IAM9C;;;;;;;;OAQG;IACH,aAAa,CAAC,KAAK,EAAE,SAAS,GAAG,MAAM;IAKvC;;;;;;;;;;;;OAYG;IACH,kBAAkB,CAChB,eAAe,EAAE,MAAM,EACvB,aAAa,EAAE,SAAS,EAAE,GACzB,WAAW;IAoCd;;;;;;;;OAQG;IACH,mBAAmB,CAAC,KAAK,EAAE,SAAS,GAAG,YAAY;IA8CnD;;OAEG;IACH,YAAY,CAAC,KAAK,EAAE,SAAS,GAAG,UAAU;IAqC1C;;OAEG;IACH,0BAA0B,CAAC,MAAM,EAAE,SAAS,EAAE,GAAG,SAAS;IAqD1D;;OAEG;IACH,OAAO,CAAC,YAAY;IAUpB;;OAEG;IACH,OAAO,CAAC,iBAAiB;IAuBzB;;OAEG;IACH,OAAO,CAAC,cAAc;IAoBtB;;OAEG;IACH,OAAO,CAAC,yBAAyB;IAuCjC;;OAEG;IACH,OAAO,CAAC,iBAAiB;CAa1B;AAMD;;GAEG;AACH,wBAAgB,qBAAqB,IAAI,eAAe,CAEvD"}

package/v3/dist/integrations/ruvector/mincut-wrapper.js

@@ -0,0 +1,310 @@
+/**
+ * QE Wrapper for MinCut Calculator
+ *
+ * This wrapper provides a QE-specific interface on top of the TypeScript
+ * MinCutCalculator (v3/src/coordination/mincut/mincut-calculator.ts).
+ * Follows the same pattern as gnn-wrapper.ts and sona-wrapper.ts.
+ *
+ * ADR-068: Mincut-Gated Model Routing
+ *
+ * @module integrations/ruvector/mincut-wrapper
+ */
+import { MinCutCalculator } from '../../coordination/mincut/mincut-calculator.js';
+import { SwarmGraph } from '../../coordination/mincut/swarm-graph.js';
+// ============================================================================
+// QEMinCutService
+// ============================================================================
+/**
+ * QE MinCut Service - Unified interface over the TypeScript MinCutCalculator
+ *
+ * Provides mincut-based graph analysis for routing decisions, fleet health
+ * monitoring, and structural complexity assessment.
+ *
+ * @example
+ * ```typescript
+ * const service = new QEMinCutService();
+ *
+ * // Compute lambda for a task graph
+ * const lambda = service.computeLambda(taskGraph);
+ *
+ * // Determine routing tier
+ * const tier = service.computeRoutingTier('Implement auth flow', agents);
+ *
+ * // Get fleet health
+ * const health = service.getStructuralHealth(taskGraph);
+ * ```
+ */
+export class QEMinCutService {
+    calculator;
+    constructor() {
+        this.calculator = new MinCutCalculator();
+    }
+    /**
+     * Compute the min-cut lambda value for a task graph.
+     *
+     * Lambda represents the minimum edge weight that must be removed to
+     * disconnect the graph. Higher lambda = more connected = simpler routing.
+     *
+     * @param graph - The task graph to analyze
+     * @returns The min-cut lambda value (0 if graph is empty/disconnected)
+     */
+    computeLambda(graph) {
+        const swarmGraph = this.toSwarmGraph(graph);
+        return this.calculator.getMinCutValue(swarmGraph);
+    }
+    /**
+     * Determine the optimal routing tier based on task description and agent topology.
+     *
+     * Builds a task graph from the agent topology, computes lambda, and maps
+     * the normalized lambda to a routing tier:
+     * - lambda >= 0.8 (highly connected, simple) -> Tier 1 (Haiku)
+     * - lambda 0.4-0.8 (moderate connectivity) -> Tier 2 (Sonnet)
+     * - lambda < 0.4 (fragmented, complex) -> Tier 3 (Opus)
+     *
+     * @param taskDescription - Description of the task to route
+     * @param agentTopology - Current agent fleet topology
+     * @returns Routing tier recommendation
+     */
+    computeRoutingTier(taskDescription, agentTopology) {
+        // Build task graph from agent topology
+        const graph = this.buildTaskGraphFromTopology(agentTopology);
+        const swarmGraph = this.toSwarmGraph(graph);
+        // Get raw lambda
+        const rawLambda = this.calculator.getMinCutValue(swarmGraph);
+        // Normalize lambda to 0-1 range
+        // Use vertex count as normalization factor (fully connected = vertex count - 1)
+        const maxPossibleLambda = Math.max(agentTopology.length - 1, 1);
+        const normalizedLambda = Math.min(rawLambda / maxPossibleLambda, 1.0);
+        // Determine tier based on normalized lambda
+        const { tier, label } = this.lambdaToTier(normalizedLambda);
+        // Compute confidence based on graph size and connectivity
+        const confidence = this.computeConfidence(swarmGraph, normalizedLambda);
+        const rationale = this.buildRationale(taskDescription, normalizedLambda, tier, agentTopology.length);
+        return {
+            tier,
+            label,
+            lambda: rawLambda,
+            normalizedLambda,
+            confidence,
+            rationale,
+        };
+    }
+    /**
+     * Compute structural health of the agent fleet using mincut lambda.
+     *
+     * Uses Stoer-Wagner style analysis (via weighted degree heuristic) to
+     * assess the robustness of the fleet topology.
+     *
+     * @param graph - The task graph to analyze
+     * @returns Health report with lambda, weak points, and suggestions
+     */
+    getStructuralHealth(graph) {
+        const swarmGraph = this.toSwarmGraph(graph);
+        if (swarmGraph.isEmpty()) {
+            return this.emptyHealthReport();
+        }
+        const rawLambda = this.calculator.getMinCutValue(swarmGraph);
+        const stats = swarmGraph.getStats();
+        const maxPossibleLambda = Math.max(stats.vertexCount - 1, 1);
+        const normalizedLambda = Math.min(rawLambda / maxPossibleLambda, 1.0);
+        // Find weak vertices
+        const weakVertices = this.calculator.findWeakVertices(swarmGraph);
+        const weakPoints = weakVertices.map(wv => wv.vertexId);
+        // Compute risk score (inverse of normalized lambda)
+        const riskScore = 1 - normalizedLambda;
+        // Health threshold: lambda >= 0.4 normalized is healthy
+        const healthy = normalizedLambda >= 0.4;
+        // Generate suggestions
+        const suggestions = this.generateHealthSuggestions(normalizedLambda, weakVertices.length, stats);
+        return {
+            lambda: rawLambda,
+            normalizedLambda,
+            healthy,
+            weakPoints,
+            riskScore,
+            componentCount: stats.componentCount,
+            isConnected: stats.isConnected,
+            suggestions,
+            analyzedAt: new Date(),
+        };
+    }
+    // ==========================================================================
+    // Graph Conversion
+    // ==========================================================================
+    /**
+     * Convert a TaskGraph to a SwarmGraph for use with MinCutCalculator
+     */
+    toSwarmGraph(graph) {
+        const swarmGraph = new SwarmGraph();
+        // Add vertices
+        for (const node of graph.nodes) {
+            const vertex = {
+                id: node.id,
+                type: node.type === 'task' ? 'agent' : node.type === 'agent' ? 'agent' : 'domain',
+                domain: node.domain,
+                weight: node.weight,
+                createdAt: new Date(),
+                metadata: node.metadata,
+            };
+            swarmGraph.addVertex(vertex);
+        }
+        // Add edges
+        for (const edge of graph.edges) {
+            // Only add edges if both vertices exist
+            if (swarmGraph.hasVertex(edge.source) && swarmGraph.hasVertex(edge.target)) {
+                const swarmEdge = {
+                    source: edge.source,
+                    target: edge.target,
+                    weight: edge.weight,
+                    type: edge.edgeType === 'dependency' ? 'dependency'
+                        : edge.edgeType === 'communication' ? 'communication'
+                            : edge.edgeType === 'workflow' ? 'workflow'
+                                : 'coordination',
+                    bidirectional: edge.edgeType !== 'dependency',
+                };
+                swarmGraph.addEdge(swarmEdge);
+            }
+        }
+        return swarmGraph;
+    }
+    /**
+     * Build a TaskGraph from agent topology
+     */
+    buildTaskGraphFromTopology(agents) {
+        const nodes = agents.map(agent => ({
+            id: agent.id,
+            label: agent.name,
+            type: 'agent',
+            domain: agent.domain,
+            weight: agent.weight,
+        }));
+        const edges = [];
+        const agentIds = new Set(agents.map(a => a.id));
+        for (const agent of agents) {
+            for (const depId of agent.dependsOn) {
+                if (agentIds.has(depId)) {
+                    edges.push({
+                        source: agent.id,
+                        target: depId,
+                        weight: 1.0,
+                        edgeType: 'dependency',
+                    });
+                }
+            }
+        }
+        // Add coordination edges between agents in the same domain
+        const domainGroups = new Map();
+        for (const agent of agents) {
+            const group = domainGroups.get(agent.domain) || [];
+            group.push(agent.id);
+            domainGroups.set(agent.domain, group);
+        }
+        for (const [, group] of domainGroups) {
+            for (let i = 0; i < group.length; i++) {
+                for (let j = i + 1; j < group.length; j++) {
+                    edges.push({
+                        source: group[i],
+                        target: group[j],
+                        weight: 0.5,
+                        edgeType: 'coordination',
+                    });
+                }
+            }
+        }
+        return { nodes, edges };
+    }
+    // ==========================================================================
+    // Private Helpers
+    // ==========================================================================
+    /**
+     * Map normalized lambda to routing tier
+     */
+    lambdaToTier(normalizedLambda) {
+        if (normalizedLambda >= 0.8) {
+            return { tier: 1, label: 'Haiku' };
+        }
+        if (normalizedLambda >= 0.4) {
+            return { tier: 2, label: 'Sonnet' };
+        }
+        return { tier: 3, label: 'Opus' };
+    }
+    /**
+     * Compute confidence in the routing decision
+     */
+    computeConfidence(graph, normalizedLambda) {
+        const stats = graph.getStats();
+        // Low confidence if graph is too small
+        if (stats.vertexCount < 3) {
+            return 0.4;
+        }
+        // High confidence if lambda is clearly in a tier range (not near boundary)
+        const distFromBoundary = Math.min(Math.abs(normalizedLambda - 0.4), Math.abs(normalizedLambda - 0.8));
+        // Scale: 0.0 distance from boundary = 0.5 confidence, 0.2+ = 0.95
+        const boundaryConfidence = Math.min(0.95, 0.5 + distFromBoundary * 2.25);
+        // Also consider graph density for confidence
+        const densityFactor = Math.min(1.0, stats.density * 2);
+        return Math.min(0.99, boundaryConfidence * (0.7 + 0.3 * densityFactor));
+    }
+    /**
+     * Build human-readable rationale for the routing decision
+     */
+    buildRationale(taskDescription, normalizedLambda, tier, agentCount) {
+        const taskPreview = taskDescription.slice(0, 80);
+        const connectivity = normalizedLambda >= 0.8 ? 'highly connected'
+            : normalizedLambda >= 0.4 ? 'moderately connected'
+                : 'fragmented';
+        const tierName = tier === 1 ? 'Haiku' : tier === 2 ? 'Sonnet' : 'Opus';
+        return (`Task "${taskPreview}" routed to ${tierName} (Tier ${tier}). ` +
+            `Fleet topology is ${connectivity} (lambda=${normalizedLambda.toFixed(3)}) ` +
+            `across ${agentCount} agents.`);
+    }
+    /**
+     * Generate health improvement suggestions
+     */
+    generateHealthSuggestions(normalizedLambda, weakCount, stats) {
+        const suggestions = [];
+        if (!stats.isConnected) {
+            suggestions.push(`Graph has ${stats.componentCount} disconnected components. ` +
+                'Add cross-domain coordination edges to improve connectivity.');
+        }
+        if (normalizedLambda < 0.2) {
+            suggestions.push('Critical: Fleet connectivity is very low. Consider spawning coordination agents.');
+        }
+        else if (normalizedLambda < 0.4) {
+            suggestions.push('Warning: Fleet connectivity is below healthy threshold. Reinforce weak connections.');
+        }
+        if (weakCount > 0) {
+            suggestions.push(`${weakCount} weak point(s) detected. Add redundant connections to these agents.`);
+        }
+        if (stats.vertexCount < 3) {
+            suggestions.push('Fleet has fewer than 3 agents. MinCut analysis is most useful with larger topologies.');
+        }
+        return suggestions;
+    }
+    /**
+     * Create an empty health report for empty graphs
+     */
+    emptyHealthReport() {
+        return {
+            lambda: 0,
+            normalizedLambda: 0,
+            healthy: false,
+            weakPoints: [],
+            riskScore: 1.0,
+            componentCount: 0,
+            isConnected: true,
+            suggestions: ['No agents in fleet. Spawn agents to build a topology.'],
+            analyzedAt: new Date(),
+        };
+    }
+}
+// ============================================================================
+// Factory Functions
+// ============================================================================
+/**
+ * Create a new QEMinCutService instance
+ */
+export function createQEMinCutService() {
+    return new QEMinCutService();
+}
+//# sourceMappingURL=mincut-wrapper.js.map

package/v3/dist/integrations/ruvector/mincut-wrapper.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"mincut-wrapper.js","sourceRoot":"","sources":["../../../src/integrations/ruvector/mincut-wrapper.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,OAAO,EAAE,gBAAgB,EAAE,MAAM,gDAAgD,CAAC;AAClF,OAAO,EAAE,UAAU,EAAE,MAAM,0CAA0C,CAAC;AA6ItE,+EAA+E;AAC/E,kBAAkB;AAClB,+EAA+E;AAE/E;;;;;;;;;;;;;;;;;;;GAmBG;AACH,MAAM,OAAO,eAAe;IACT,UAAU,CAAmB;IAE9C;QACE,IAAI,CAAC,UAAU,GAAG,IAAI,gBAAgB,EAAE,CAAC;IAC3C,CAAC;IAED;;;;;;;;OAQG;IACH,aAAa,CAAC,KAAgB;QAC5B,MAAM,UAAU,GAAG,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;QAC5C,OAAO,IAAI,CAAC,UAAU,CAAC,cAAc,CAAC,UAAU,CAAC,CAAC;IACpD,CAAC;IAED;;;;;;;;;;;;OAYG;IACH,kBAAkB,CAChB,eAAuB,EACvB,aAA0B;QAE1B,uCAAuC;QACvC,MAAM,KAAK,GAAG,IAAI,CAAC,0BAA0B,CAAC,aAAa,CAAC,CAAC;QAC7D,MAAM,UAAU,GAAG,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;QAE5C,iBAAiB;QACjB,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,cAAc,CAAC,UAAU,CAAC,CAAC;QAE7D,gCAAgC;QAChC,gFAAgF;QAChF,MAAM,iBAAiB,GAAG,IAAI,CAAC,GAAG,CAAC,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;QAChE,MAAM,gBAAgB,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,GAAG,iBAAiB,EAAE,GAAG,CAAC,CAAC;QAEtE,4CAA4C;QAC5C,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,IAAI,CAAC,YAAY,CAAC,gBAAgB,CAAC,CAAC;QAE5D,0DAA0D;QAC1D,MAAM,UAAU,GAAG,IAAI,CAAC,iBAAiB,CAAC,UAAU,EAAE,gBAAgB,CAAC,CAAC;QAExE,MAAM,SAAS,GAAG,IAAI,CAAC,cAAc,CACnC,eAAe,EACf,gBAAgB,EAChB,IAAI,EACJ,aAAa,CAAC,MAAM,CACrB,CAAC;QAEF,OAAO;YACL,IAAI;YACJ,KAAK;YACL,MAAM,EAAE,SAAS;YACjB,gBAAgB;YAChB,UAAU;YACV,SAAS;SACV,CAAC;IACJ,CAAC;IAED;;;;;;;;OAQG;IACH,mBAAmB,CAAC,KAAgB;QAClC,MAAM,UAAU,GAAG,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;QAE5C,IAAI,UAAU,CAAC,OAAO,EAAE,EAAE,CAAC;YACzB,OAAO,IAAI,CAAC,iBAAiB,EAAE,CAAC;QAClC,CAAC;QAED,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,cAAc,CAAC,UAAU,CAAC,CAAC;QAC7D,MAAM,KAAK,GAAG,UAAU,CAAC,QAAQ,EAAE,CAAC;QACpC,MAAM,iBAAiB,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,WAAW,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;QAC7D,MAAM,gBAAgB,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,GAAG,iBAAiB,EAAE,GAAG,CAAC,CAAC;QAEtE,qBAAqB;QACrB,MAAM,YAAY,GAAG,IAAI,CAAC,UAAU,CAAC,gBAAgB,CAAC,UAAU,CAAC,CAAC;QAClE,MAAM,UAAU,GAAG,YAAY,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,QAAQ,CAAC,CAAC;QAEvD,oDAAoD;QACpD,MAAM,SAAS,GAAG,CAAC,GAAG,gBAAgB,CAAC;QAEvC,wDAAwD;QACxD,MAAM,OAAO,GAAG,gBAAgB,IAAI,GAAG,CAAC;QAExC,uBAAuB;QACvB,MAAM,WAAW,GAAG,IAAI,CAAC,yBAAyB,CAChD,gBAAgB,EAChB,YAAY,CAAC,MAAM,EACnB,KAAK,CACN,CAAC;QAEF,OAAO;YACL,MAAM,EAAE,SAAS;YACjB,gBAAgB;YAChB,OAAO;YACP,UAAU;YACV,SAAS;YACT,cAAc,EAAE,KAAK,CAAC,cAAc;YACpC,WAAW,EAAE,KAAK,CAAC,WAAW;YAC9B,WAAW;YACX,UAAU,EAAE,IAAI,IAAI,EAAE;SACvB,CAAC;IACJ,CAAC;IAED,6EAA6E;IAC7E,mBAAmB;IACnB,6EAA6E;IAE7E;;OAEG;IACH,YAAY,CAAC,KAAgB;QAC3B,MAAM,UAAU,GAAG,IAAI,UAAU,EAAE,CAAC;QAEpC,eAAe;QACf,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YAC/B,MAAM,MAAM,GAAgB;gBAC1B,EAAE,EAAE,IAAI,CAAC,EAAE;gBACX,IAAI,EAAE,IAAI,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,KAAK,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,QAAQ;gBACjF,MAAM,EAAE,IAAI,CAAC,MAA+B;gBAC5C,MAAM,EAAE,IAAI,CAAC,MAAM;gBACnB,SAAS,EAAE,IAAI,IAAI,EAAE;gBACrB,QAAQ,EAAE,IAAI,CAAC,QAAQ;aACxB,CAAC;YACF,UAAU,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;QAC/B,CAAC;QAED,YAAY;QACZ,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YAC/B,wCAAwC;YACxC,IAAI,UAAU,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,UAAU,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;gBAC3E,MAAM,SAAS,GAAc;oBAC3B,MAAM,EAAE,IAAI,CAAC,MAAM;oBACnB,MAAM,EAAE,IAAI,CAAC,MAAM;oBACnB,MAAM,EAAE,IAAI,CAAC,MAAM;oBACnB,IAAI,EAAE,IAAI,CAAC,QAAQ,KAAK,YAAY,CAAC,CAAC,CAAC,YAAY;wBACjD,CAAC,CAAC,IAAI,CAAC,QAAQ,KAAK,eAAe,CAAC,CAAC,CAAC,eAAe;4BACrD,CAAC,CAAC,IAAI,CAAC,QAAQ,KAAK,UAAU,CAAC,CAAC,CAAC,UAAU;gCAC3C,CAAC,CAAC,cAAc;oBAClB,aAAa,EAAE,IAAI,CAAC,QAAQ,KAAK,YAAY;iBAC9C,CAAC;gBACF,UAAU,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;YAChC,CAAC;QACH,CAAC;QAED,OAAO,UAAU,CAAC;IACpB,CAAC;IAED;;OAEG;IACH,0BAA0B,CAAC,MAAmB;QAC5C,MAAM,KAAK,GAAoB,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;YAClD,EAAE,EAAE,KAAK,CAAC,EAAE;YACZ,KAAK,EAAE,KAAK,CAAC,IAAI;YACjB,IAAI,EAAE,OAAgB;YACtB,MAAM,EAAE,KAAK,CAAC,MAAM;YACpB,MAAM,EAAE,KAAK,CAAC,MAAM;SACrB,CAAC,CAAC,CAAC;QAEJ,MAAM,KAAK,GAAoB,EAAE,CAAC;QAClC,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAEhD,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,SAAS,EAAE,CAAC;gBACpC,IAAI,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;oBACxB,KAAK,CAAC,IAAI,CAAC;wBACT,MAAM,EAAE,KAAK,CAAC,EAAE;wBAChB,MAAM,EAAE,KAAK;wBACb,MAAM,EAAE,GAAG;wBACX,QAAQ,EAAE,YAAY;qBACvB,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;QACH,CAAC;QAED,2DAA2D;QAC3D,MAAM,YAAY,GAAG,IAAI,GAAG,EAAoB,CAAC;QACjD,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,MAAM,KAAK,GAAG,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;YACnD,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;YACrB,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QACxC,CAAC;QAED,KAAK,MAAM,CAAC,EAAE,KAAK,CAAC,IAAI,YAAY,EAAE,CAAC;YACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACtC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC1C,KAAK,CAAC,IAAI,CAAC;wBACT,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC;wBAChB,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC;wBAChB,MAAM,EAAE,GAAG;wBACX,QAAQ,EAAE,cAAc;qBACzB,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;IAC1B,CAAC;IAED,6EAA6E;IAC7E,kBAAkB;IAClB,6EAA6E;IAE7E;;OAEG;IACK,YAAY,CAAC,gBAAwB;QAC3C,IAAI,gBAAgB,IAAI,GAAG,EAAE,CAAC;YAC5B,OAAO,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC;QACrC,CAAC;QACD,IAAI,gBAAgB,IAAI,GAAG,EAAE,CAAC;YAC5B,OAAO,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC;QACtC,CAAC;QACD,OAAO,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC;IACpC,CAAC;IAED;;OAEG;IACK,iBAAiB,CAAC,KAAiB,EAAE,gBAAwB;QACnE,MAAM,KAAK,GAAG,KAAK,CAAC,QAAQ,EAAE,CAAC;QAE/B,uCAAuC;QACvC,IAAI,KAAK,CAAC,WAAW,GAAG,CAAC,EAAE,CAAC;YAC1B,OAAO,GAAG,CAAC;QACb,CAAC;QAED,2EAA2E;QAC3E,MAAM,gBAAgB,GAAG,IAAI,CAAC,GAAG,CAC/B,IAAI,CAAC,GAAG,CAAC,gBAAgB,GAAG,GAAG,CAAC,EAChC,IAAI,CAAC,GAAG,CAAC,gBAAgB,GAAG,GAAG,CAAC,CACjC,CAAC;QAEF,kEAAkE;QAClE,MAAM,kBAAkB,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,GAAG,gBAAgB,GAAG,IAAI,CAAC,CAAC;QAEzE,6CAA6C;QAC7C,MAAM,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC;QAEvD,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,kBAAkB,GAAG,CAAC,GAAG,GAAG,GAAG,GAAG,aAAa,CAAC,CAAC,CAAC;IAC1E,CAAC;IAED;;OAEG;IACK,cAAc,CACpB,eAAuB,EACvB,gBAAwB,EACxB,IAAY,EACZ,UAAkB;QAElB,MAAM,WAAW,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QACjD,MAAM,YAAY,GAAG,gBAAgB,IAAI,GAAG,CAAC,CAAC,CAAC,kBAAkB;YAC/D,CAAC,CAAC,gBAAgB,IAAI,GAAG,CAAC,CAAC,CAAC,sBAAsB;gBAClD,CAAC,CAAC,YAAY,CAAC;QAEjB,MAAM,QAAQ,GAAG,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC;QAEvE,OAAO,CACL,SAAS,WAAW,eAAe,QAAQ,UAAU,IAAI,KAAK;YAC9D,qBAAqB,YAAY,YAAY,gBAAgB,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI;YAC5E,UAAU,UAAU,UAAU,CAC/B,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,yBAAyB,CAC/B,gBAAwB,EACxB,SAAiB,EACjB,KAA4E;QAE5E,MAAM,WAAW,GAAa,EAAE,CAAC;QAEjC,IAAI,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC;YACvB,WAAW,CAAC,IAAI,CACd,aAAa,KAAK,CAAC,cAAc,4BAA4B;gBAC7D,8DAA8D,CAC/D,CAAC;QACJ,CAAC;QAED,IAAI,gBAAgB,GAAG,GAAG,EAAE,CAAC;YAC3B,WAAW,CAAC,IAAI,CACd,kFAAkF,CACnF,CAAC;QACJ,CAAC;aAAM,IAAI,gBAAgB,GAAG,GAAG,EAAE,CAAC;YAClC,WAAW,CAAC,IAAI,CACd,qFAAqF,CACtF,CAAC;QACJ,CAAC;QAED,IAAI,SAAS,GAAG,CAAC,EAAE,CAAC;YAClB,WAAW,CAAC,IAAI,CACd,GAAG,SAAS,qEAAqE,CAClF,CAAC;QACJ,CAAC;QAED,IAAI,KAAK,CAAC,WAAW,GAAG,CAAC,EAAE,CAAC;YAC1B,WAAW,CAAC,IAAI,CACd,uFAAuF,CACxF,CAAC;QACJ,CAAC;QAED,OAAO,WAAW,CAAC;IACrB,CAAC;IAED;;OAEG;IACK,iBAAiB;QACvB,OAAO;YACL,MAAM,EAAE,CAAC;YACT,gBAAgB,EAAE,CAAC;YACnB,OAAO,EAAE,KAAK;YACd,UAAU,EAAE,EAAE;YACd,SAAS,EAAE,GAAG;YACd,cAAc,EAAE,CAAC;YACjB,WAAW,EAAE,IAAI;YACjB,WAAW,EAAE,CAAC,uDAAuD,CAAC;YACtE,UAAU,EAAE,IAAI,IAAI,EAAE;SACvB,CAAC;IACJ,CAAC;CACF;AAED,+EAA+E;AAC/E,oBAAoB;AACpB,+EAA+E;AAE/E;;GAEG;AACH,MAAM,UAAU,qBAAqB;IACnC,OAAO,IAAI,eAAe,EAAE,CAAC;AAC/B,CAAC"}

package/v3/dist/integrations/ruvector/rvf-dual-writer.d.ts

@@ -0,0 +1,141 @@
+/**
+ * RVF Dual-Writer Service
+ *
+ * Phase 3 Task 3.1: Writes learning data to both SQLite (existing) and
+ * an RVF container (new native backend). Ensures SQLite writes are never
+ * broken by RVF failures, and supports gradual promotion from SQLite-only
+ * to dual-write to RVF-primary mode.
+ *
+ * The dual-writer sits between the QEReasoningBank and the storage layer,
+ * intercepting pattern embedding writes/deletes/searches and routing them
+ * to one or both backends depending on the configured mode.
+ */
+/**
+ * Simplified RVF store interface used internally by the dual-writer.
+ * Abstracts over the native adapter so tests can provide mocks
+ * without depending on the @ruvector/rvf-node native binding.
+ */
+export interface RvfStore {
+    ingest(entries: Array<{
+        id: string;
+        vector: number[] | Float32Array;
+    }>): void;
+    search(query: number[] | Float32Array, k: number): Array<{
+        id: string;
+        score: number;
+    }>;
+    delete(ids: string[]): void;
+    status(): RvfStatus;
+    close(): void;
+}
+export interface RvfStatus {
+    totalVectors: number;
+    dimensions?: number;
+    /** Fields from the native adapter, forwarded when available */
+    totalSegments?: number;
+    fileSizeBytes?: number;
+    epoch?: number;
+    witnessValid?: boolean;
+    witnessEntries?: number;
+}
+export interface DualWriteConfig {
+    /** Path to the RVF container file */
+    rvfPath: string;
+    /** Vector dimensions (default 384) */
+    dimensions?: number;
+    /** Write mode */
+    mode: 'dual-write' | 'rvf-primary' | 'sqlite-only';
+    /** Whether to verify witness chain on startup */
+    verifyOnStartup?: boolean;
+}
+export interface DualWriteResult {
+    sqliteSuccess: boolean;
+    rvfSuccess: boolean;
+    divergence?: string;
+}
+export interface DivergenceReport {
+    totalChecked: number;
+    divergences: number;
+    details: Array<{
+        patternId: string;
+        issue: 'missing-in-rvf' | 'missing-in-sqlite' | 'count-mismatch';
+    }>;
+}
+export declare class RvfDualWriter {
+    private readonly db;
+    private readonly config;
+    private rvfStore;
+    private rvfAvailable;
+    constructor(db: unknown, config: DualWriteConfig);
+    /**
+     * Initialize the RVF store (create or open).
+     *
+     * If the native adapter is not available, the writer degrades gracefully
+     * to sqlite-only regardless of the configured mode.
+     */
+    initialize(): Promise<void>;
+    /**
+     * Allow injecting an RVF store directly (useful for testing).
+     */
+    setRvfStore(store: RvfStore): void;
+    /**
+     * Write a pattern embedding to both stores.
+     *
+     * SQLite is always written first. RVF failures never propagate to SQLite.
+     */
+    writePattern(patternId: string, embedding: number[] | Float32Array): DualWriteResult;
+    /**
+     * Delete a pattern embedding from both stores.
+     */
+    deletePattern(patternId: string): DualWriteResult;
+    /**
+     * Search for similar vectors. In rvf-primary mode, tries RVF first and
+     * falls back to SQLite on error. Otherwise uses SQLite.
+     */
+    search(query: number[] | Float32Array, k: number): Array<{
+        id: string;
+        score: number;
+    }>;
+    /**
+     * Generate a divergence report between SQLite embeddings and RVF vectors.
+     */
+    getDivergenceReport(): DivergenceReport;
+    /**
+     * Returns true when promotion from dual-write to rvf-primary is safe
+     * (zero divergences between the two stores).
+     */
+    isPromotionSafe(): boolean;
+    /**
+     * Combined status from both backends.
+     */
+    status(): {
+        sqlite: {
+            patternCount: number;
+            vectorCount: number;
+        };
+        rvf: RvfStatus | null;
+        mode: string;
+    };
+    /**
+     * Close the RVF store. SQLite is managed externally.
+     */
+    close(): void;
+    private shouldWriteRvf;
+    private writeSqliteEmbedding;
+    private deleteSqliteEmbedding;
+    private getSqliteEmbeddingCount;
+    private getSqlitePatternCount;
+    /**
+     * Brute-force cosine similarity search over SQLite embeddings.
+     * This is the fallback when RVF is unavailable.
+     */
+    private searchSqlite;
+}
+/**
+ * Create a new RvfDualWriter instance.
+ *
+ * @param db - better-sqlite3 Database instance
+ * @param config - Dual-write configuration
+ */
+export declare function createDualWriter(db: unknown, config: DualWriteConfig): RvfDualWriter;
+//# sourceMappingURL=rvf-dual-writer.d.ts.map

package/v3/dist/integrations/ruvector/rvf-dual-writer.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"rvf-dual-writer.d.ts","sourceRoot":"","sources":["../../../src/integrations/ruvector/rvf-dual-writer.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAWH;;;;GAIG;AACH,MAAM,WAAW,QAAQ;IACvB,MAAM,CAAC,OAAO,EAAE,KAAK,CAAC;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,EAAE,GAAG,YAAY,CAAA;KAAE,CAAC,GAAG,IAAI,CAAC;IAC9E,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,YAAY,EAAE,CAAC,EAAE,MAAM,GAAG,KAAK,CAAC;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IACxF,MAAM,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,IAAI,CAAC;IAC5B,MAAM,IAAI,SAAS,CAAC;IACpB,KAAK,IAAI,IAAI,CAAC;CACf;AAED,MAAM,WAAW,SAAS;IACxB,YAAY,EAAE,MAAM,CAAC;IACrB,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,+DAA+D;IAC/D,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,YAAY,CAAC,EAAE,OAAO,CAAC;IACvB,cAAc,CAAC,EAAE,MAAM,CAAC;CACzB;AAED,MAAM,WAAW,eAAe;IAC9B,qCAAqC;IACrC,OAAO,EAAE,MAAM,CAAC;IAChB,sCAAsC;IACtC,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,iBAAiB;IACjB,IAAI,EAAE,YAAY,GAAG,aAAa,GAAG,aAAa,CAAC;IACnD,iDAAiD;IACjD,eAAe,CAAC,EAAE,OAAO,CAAC;CAC3B;AAED,MAAM,WAAW,eAAe;IAC9B,aAAa,EAAE,OAAO,CAAC;IACvB,UAAU,EAAE,OAAO,CAAC;IACpB,UAAU,CAAC,EAAE,MAAM,CAAC;CACrB;AAED,MAAM,WAAW,gBAAgB;IAC/B,YAAY,EAAE,MAAM,CAAC;IACrB,WAAW,EAAE,MAAM,CAAC;IACpB,OAAO,EAAE,KAAK,CAAC;QACb,SAAS,EAAE,MAAM,CAAC;QAClB,KAAK,EAAE,gBAAgB,GAAG,mBAAmB,GAAG,gBAAgB,CAAC;KAClE,CAAC,CAAC;CACJ;AA+DD,qBAAa,aAAa;IACxB,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAW;IAC9B,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAuF;IAC9G,OAAO,CAAC,QAAQ,CAAyB;IACzC,OAAO,CAAC,YAAY,CAAS;gBAEjB,EAAE,EAAE,OAAO,EAAE,MAAM,EAAE,eAAe;IAQhD;;;;;OAKG;IACG,UAAU,IAAI,OAAO,CAAC,IAAI,CAAC;IA+BjC;;OAEG;IACH,WAAW,CAAC,KAAK,EAAE,QAAQ,GAAG,IAAI;IASlC;;;;OAIG;IACH,YAAY,CAAC,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,GAAG,YAAY,GAAG,eAAe;IAmCpF;;OAEG;IACH,aAAa,CAAC,SAAS,EAAE,MAAM,GAAG,eAAe;IAgCjD;;;OAGG;IACH,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,YAAY,EAAE,CAAC,EAAE,MAAM,GAAG,KAAK,CAAC;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC;IAiBvF;;OAEG;IACH,mBAAmB,IAAI,gBAAgB;IAsCvC;;;OAGG;IACH,eAAe,IAAI,OAAO;IAS1B;;OAEG;IACH,MAAM,IAAI;QACR,MAAM,EAAE;YAAE,YAAY,EAAE,MAAM,CAAC;YAAC,WAAW,EAAE,MAAM,CAAA;SAAE,CAAC;QACtD,GAAG,EAAE,SAAS,GAAG,IAAI,CAAC;QACtB,IAAI,EAAE,MAAM,CAAC;KACd;IA2BD;;OAEG;IACH,KAAK,IAAI,IAAI;IAgBb,OAAO,CAAC,cAAc;IAQtB,OAAO,CAAC,oBAAoB;IAqB5B,OAAO,CAAC,qBAAqB;IAM7B,OAAO,CAAC,uBAAuB;IAM/B,OAAO,CAAC,qBAAqB;IAM7B;;;OAGG;IACH,OAAO,CAAC,YAAY;CAoCrB;AAMD;;;;;GAKG;AACH,wBAAgB,gBAAgB,CAAC,EAAE,EAAE,OAAO,EAAE,MAAM,EAAE,eAAe,GAAG,aAAa,CAEpF"}