adaptive-memory-multi-model-router 2.14.46 → 2.14.48

package/tmlpd-pi-extension/dist/orchestration/haloOrchestrator.js

@@ -1,207 +0,0 @@
-"use strict";
-/**
- * TMLPD HALO Orchestrator Reference
- *
- * Hierarchical Autonomous Logic-Oriented Orchestration
- *
- * Reference implementation - for full features see TMLPD v2.x
- *
- * Full TMLPD includes:
- * - 3-tier hierarchical planning
- * - TaskPlanner: Decompose with dependencies
- * - RoleAssigner: Specialized agent assignment
- * - ExecutionEngine: Parallel with verification
- * - 19.6% improvement on complex tasks
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.HALOOrchestrator = void 0;
-const mctsWorkflow_1 = require("./mctsWorkflow");
-const episodicMemory_1 = require("../memory/episodicMemory");
-const DEFAULT_HALO_CONFIG = {
-    maxConcurrent: 3,
-    optimizationTarget: "balanced",
-    enableMCTS: false
-};
-/**
- * HALO Orchestrator
- *
- * Hierarchical orchestration with 3 tiers:
- * 1. Plan: Decompose task into subtasks with dependencies
- * 2. Assign: Match subtasks to optimal agents
- * 3. Execute: Run in parallel with result verification
- */
-class HALOOrchestrator {
-    config;
-    memory;
-    mcts;
-    constructor(config = {}) {
-        this.config = { ...DEFAULT_HALO_CONFIG, ...config };
-        this.memory = new episodicMemory_1.EpisodicMemoryStore();
-        this.mcts = new mctsWorkflow_1.MCTSWorkflowOptimizer({ maxIterations: 30 });
-    }
-    /**
-     * Execute task with HALO orchestration
-     */
-    async execute(taskDescription, executeFn) {
-        // Phase 1: Plan - decompose task
-        const subtasks = this.decomposeTask(taskDescription);
-        // Check memory for similar successful strategies
-        const similar = this.memory.getSimilarTasks(taskDescription, 3);
-        // Phase 2: Assign - determine optimal agent assignments
-        const strategy = this.config.enableMCTS
-            ? await this.optimizeWithMCTS(subtasks)
-            : this.quickAssign(subtasks);
-        // Phase 3: Execute - run with concurrency limit
-        const results = await this.executeParallel(subtasks, strategy, executeFn);
-        // Store in episodic memory
-        this.memory.store({
-            task: {
-                description: taskDescription,
-                type: this.classifyTask(taskDescription),
-                complexity: subtasks.length
-            },
-            result: {
-                success: results.every(r => r.success),
-                output: results.map(r => r.output).join("\n---\n"),
-                duration_ms: results.reduce((sum, r) => sum + r.duration_ms, 0)
-            },
-            agent: { id: "halo", model: "composite", provider: "multi" },
-            metadata: { strategy, subtaskCount: subtasks.length },
-            importance: subtasks.length > 5 ? 0.8 : 0.5
-        });
-        return {
-            success: results.every(r => r.success),
-            results,
-            strategy,
-            metadata: {
-                subtasks: subtasks.length,
-                optimizationTarget: this.config.optimizationTarget
-            }
-        };
-    }
-    /**
-     * Decompose task into subtasks
-     */
-    decomposeTask(taskDescription) {
-        // Simple decomposition - for full NLP-based decomposition see TMLPD
-        const words = taskDescription.toLowerCase().split(/\s+/);
-        const subtasks = [];
-        // Detect complexity indicators
-        const hasMultipleSteps = /and|then|also|plus|additionally/.test(taskDescription);
-        const hasBranching = /if|when|either|option|choice/.test(taskDescription);
-        const hasSequential = /first|then|finally|step|last/.test(taskDescription);
-        if (hasMultipleSteps || taskDescription.length > 100) {
-            // Multi-subtask decomposition
-            const segments = taskDescription.split(/[.,]+/).filter(s => s.trim().length > 10);
-            segments.forEach((seg, idx) => {
-                subtasks.push({
-                    id: `subtask-${idx}`,
-                    description: seg.trim(),
-                    dependencies: idx > 0 ? [`subtask-${idx - 1}`] : [],
-                    estimatedComplexity: seg.split(/\s+/).length / 10
-                });
-            });
-        }
-        else {
-            // Single task
-            subtasks.push({
-                id: "subtask-0",
-                description: taskDescription,
-                dependencies: [],
-                estimatedComplexity: words.length / 10
-            });
-        }
-        return subtasks;
-    }
-    /**
-     * Classify task type
-     */
-    classifyTask(description) {
-        const lower = description.toLowerCase();
-        if (/coding|code|function|class|debug/.test(lower))
-            return "coding";
-        if (/explain|what is|how to|understand/.test(lower))
-            return "explanation";
-        if (/analyze|review|evaluate|assess/.test(lower))
-            return "analysis";
-        if (/create|build|design|implement/.test(lower))
-            return "creation";
-        if (/translate|convert|transform/.test(lower))
-            return "transformation";
-        return "general";
-    }
-    /**
-     * Quick agent assignment without MCTS
-     */
-    quickAssign(subtasks) {
-        const strategy = {};
-        const agents = ["claude", "codex", "claude-minimax", "gemini"];
-        subtasks.forEach((subtask, idx) => {
-            // Round-robin assignment based on complexity
-            if (subtask.estimatedComplexity > 1.5) {
-                strategy[subtask.id] = agents[idx % agents.length];
-            }
-            else {
-                strategy[subtask.id] = "claude-minimax"; // Fast agent for simple tasks
-            }
-        });
-        return strategy;
-    }
-    /**
-     * Optimize assignment with MCTS
-     */
-    async optimizeWithMCTS(subtasks) {
-        const subtaskIds = subtasks.map(s => s.id);
-        return await this.mcts.findBestStrategy(subtaskIds, async (assignments) => {
-            // Evaluate strategy quality
-            // For reference: higher reward for balanced load + successful execution
-            const agentLoad = Object.values(assignments).reduce((acc, agentId) => {
-                acc[agentId] = (acc[agentId] || 0) + 1;
-                return acc;
-            }, {});
-            const loadBalance = 1 / (1 + Object.values(agentLoad).reduce((max, v) => Math.max(max, v), 0) - 1);
-            return loadBalance * 100; // Reward for balanced assignment
-        });
-    }
-    /**
-     * Execute subtasks in parallel with concurrency limit
-     */
-    async executeParallel(subtasks, strategy, executeFn) {
-        const results = [];
-        const pending = [];
-        let idx = 0;
-        for (const subtask of subtasks) {
-            const agentId = strategy[subtask.id] || "claude";
-            const promise = executeFn(subtask, agentId).then(result => {
-                results[idx] = result;
-            });
-            pending.push(promise);
-            if (pending.length >= this.config.maxConcurrent) {
-                await Promise.race(pending);
-            }
-            idx++;
-        }
-        await Promise.all(pending);
-        return results;
-    }
-    /**
-     * Get memory statistics
-     */
-    getMemoryStats() {
-        return this.memory.getStats();
-    }
-}
-exports.HALOOrchestrator = HALOOrchestrator;
-/**
- * Reference to Full TMLPD HALO
- *
- * Full implementation in tmlpd-clean/src/orchestration/halo_orchestrator.py
- *
- * Features:
- * - NLP-based task decomposition
- * - Dependency graph resolution
- * - Agent capability matching
- * - Result verification and retry
- * - Multi-round refinement for low confidence
- */ 
-//# sourceMappingURL=haloOrchestrator.js.map

package/tmlpd-pi-extension/dist/orchestration/haloOrchestrator.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"haloOrchestrator.js","sourceRoot":"","sources":["../../src/orchestration/haloOrchestrator.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;GAaG;;;AAEH,iDAAuD;AACvD,6DAA+D;AA6B/D,MAAM,mBAAmB,GAAe;IACtC,aAAa,EAAE,CAAC;IAChB,kBAAkB,EAAE,UAAU;IAC9B,UAAU,EAAE,KAAK;CAClB,CAAC;AAEF;;;;;;;GAOG;AACH,MAAa,gBAAgB;IACnB,MAAM,CAAa;IACnB,MAAM,CAAsB;IAC5B,IAAI,CAAwB;IAEpC,YAAY,SAA8B,EAAE;QAC1C,IAAI,CAAC,MAAM,GAAG,EAAE,GAAG,mBAAmB,EAAE,GAAG,MAAM,EAAE,CAAC;QACpD,IAAI,CAAC,MAAM,GAAG,IAAI,oCAAmB,EAAE,CAAC;QACxC,IAAI,CAAC,IAAI,GAAG,IAAI,oCAAqB,CAAC,EAAE,aAAa,EAAE,EAAE,EAAE,CAAC,CAAC;IAC/D,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,OAAO,CACX,eAAuB,EACvB,SAA0E;QAO1E,iCAAiC;QACjC,MAAM,QAAQ,GAAG,IAAI,CAAC,aAAa,CAAC,eAAe,CAAC,CAAC;QAErD,iDAAiD;QACjD,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,eAAe,CAAC,eAAe,EAAE,CAAC,CAAC,CAAC;QAEhE,wDAAwD;QACxD,MAAM,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,UAAU;YACrC,CAAC,CAAC,MAAM,IAAI,CAAC,gBAAgB,CAAC,QAAQ,CAAC;YACvC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;QAE/B,gDAAgD;QAChD,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,eAAe,CAAC,QAAQ,EAAE,QAAQ,EAAE,SAAS,CAAC,CAAC;QAE1E,2BAA2B;QAC3B,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC;YAChB,IAAI,EAAE;gBACJ,WAAW,EAAE,eAAe;gBAC5B,IAAI,EAAE,IAAI,CAAC,YAAY,CAAC,eAAe,CAAC;gBACxC,UAAU,EAAE,QAAQ,CAAC,MAAM;aAC5B;YACD,MAAM,EAAE;gBACN,OAAO,EAAE,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC;gBACtC,MAAM,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC;gBAClD,WAAW,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC;aAChE;YACD,KAAK,EAAE,EAAE,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,WAAW,EAAE,QAAQ,EAAE,OAAO,EAAE;YAC5D,QAAQ,EAAE,EAAE,QAAQ,EAAE,YAAY,EAAE,QAAQ,CAAC,MAAM,EAAE;YACrD,UAAU,EAAE,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG;SAC5C,CAAC,CAAC;QAEH,OAAO;YACL,OAAO,EAAE,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC;YACtC,OAAO;YACP,QAAQ;YACR,QAAQ,EAAE;gBACR,QAAQ,EAAE,QAAQ,CAAC,MAAM;gBACzB,kBAAkB,EAAE,IAAI,CAAC,MAAM,CAAC,kBAAkB;aACnD;SACF,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,aAAa,CAAC,eAAuB;QACnC,oEAAoE;QACpE,MAAM,KAAK,GAAG,eAAe,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QACzD,MAAM,QAAQ,GAAc,EAAE,CAAC;QAE/B,+BAA+B;QAC/B,MAAM,gBAAgB,GAAG,iCAAiC,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;QACjF,MAAM,YAAY,GAAG,8BAA8B,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;QAC1E,MAAM,aAAa,GAAG,8BAA8B,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;QAE3E,IAAI,gBAAgB,IAAI,eAAe,CAAC,MAAM,GAAG,GAAG,EAAE,CAAC;YACrD,8BAA8B;YAC9B,MAAM,QAAQ,GAAG,eAAe,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,MAAM,GAAG,EAAE,CAAC,CAAC;YAClF,QAAQ,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE;gBAC5B,QAAQ,CAAC,IAAI,CAAC;oBACZ,EAAE,EAAE,WAAW,GAAG,EAAE;oBACpB,WAAW,EAAE,GAAG,CAAC,IAAI,EAAE;oBACvB,YAAY,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,GAAG,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE;oBACnD,mBAAmB,EAAE,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,MAAM,GAAG,EAAE;iBAClD,CAAC,CAAC;YACL,CAAC,CAAC,CAAC;QACL,CAAC;aAAM,CAAC;YACN,cAAc;YACd,QAAQ,CAAC,IAAI,CAAC;gBACZ,EAAE,EAAE,WAAW;gBACf,WAAW,EAAE,eAAe;gBAC5B,YAAY,EAAE,EAAE;gBAChB,mBAAmB,EAAE,KAAK,CAAC,MAAM,GAAG,EAAE;aACvC,CAAC,CAAC;QACL,CAAC;QAED,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;OAEG;IACH,YAAY,CAAC,WAAmB;QAC9B,MAAM,KAAK,GAAG,WAAW,CAAC,WAAW,EAAE,CAAC;QACxC,IAAI,kCAAkC,CAAC,IAAI,CAAC,KAAK,CAAC;YAAE,OAAO,QAAQ,CAAC;QACpE,IAAI,mCAAmC,CAAC,IAAI,CAAC,KAAK,CAAC;YAAE,OAAO,aAAa,CAAC;QAC1E,IAAI,gCAAgC,CAAC,IAAI,CAAC,KAAK,CAAC;YAAE,OAAO,UAAU,CAAC;QACpE,IAAI,+BAA+B,CAAC,IAAI,CAAC,KAAK,CAAC;YAAE,OAAO,UAAU,CAAC;QACnE,IAAI,6BAA6B,CAAC,IAAI,CAAC,KAAK,CAAC;YAAE,OAAO,gBAAgB,CAAC;QACvE,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;OAEG;IACH,WAAW,CAAC,QAAmB;QAC7B,MAAM,QAAQ,GAA2B,EAAE,CAAC;QAC5C,MAAM,MAAM,GAAG,CAAC,QAAQ,EAAE,OAAO,EAAE,gBAAgB,EAAE,QAAQ,CAAC,CAAC;QAE/D,QAAQ,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,GAAG,EAAE,EAAE;YAChC,6CAA6C;YAC7C,IAAI,OAAO,CAAC,mBAAmB,GAAG,GAAG,EAAE,CAAC;gBACtC,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,GAAG,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC;YACrD,CAAC;iBAAM,CAAC;gBACN,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC,GAAG,gBAAgB,CAAC,CAAC,8BAA8B;YACzE,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,gBAAgB,CAC5B,QAAmB;QAEnB,MAAM,UAAU,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAE3C,OAAO,MAAM,IAAI,CAAC,IAAI,CAAC,gBAAgB,CAAC,UAAU,EAAE,KAAK,EAAE,WAAW,EAAE,EAAE;YACxE,4BAA4B;YAC5B,wEAAwE;YACxE,MAAM,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC,MAAM,CAAC,CAAC,GAA2B,EAAE,OAAO,EAAE,EAAE;gBAC3F,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;gBACvC,OAAO,GAAG,CAAC;YACb,CAAC,EAAE,EAAE,CAAC,CAAC;YAEP,MAAM,WAAW,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACnG,OAAO,WAAW,GAAG,GAAG,CAAC,CAAC,iCAAiC;QAC7D,CAAC,CAAC,CAAC;IACL,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,eAAe,CAC3B,QAAmB,EACnB,QAAgC,EAChC,SAA0E;QAE1E,MAAM,OAAO,GAAsB,EAAE,CAAC;QACtC,MAAM,OAAO,GAAoB,EAAE,CAAC;QACpC,IAAI,GAAG,GAAG,CAAC,CAAC;QAEZ,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;YAC/B,MAAM,OAAO,GAAG,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC,IAAI,QAAQ,CAAC;YAEjD,MAAM,OAAO,GAAG,SAAS,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE;gBACxD,OAAO,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC;YACxB,CAAC,CAAC,CAAC;YAEH,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAEtB,IAAI,OAAO,CAAC,MAAM,IAAI,IAAI,CAAC,MAAM,CAAC,aAAa,EAAE,CAAC;gBAChD,MAAM,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAC9B,CAAC;YAED,GAAG,EAAE,CAAC;QACR,CAAC;QAED,MAAM,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QAC3B,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;OAEG;IACH,cAAc;QACZ,OAAO,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC;IAChC,CAAC;CACF;AAjMD,4CAiMC;AAED;;;;;;;;;;;GAWG"}

package/tmlpd-pi-extension/dist/orchestration/mctsWorkflow.d.ts

@@ -1,85 +0,0 @@
-/**
- * TMLPD MCTS Workflow Search
- *
- * Monte Carlo Tree Search for workflow optimization.
- * Reference implementation - for full features see TMLPD v2.x
- *
- * Full TMLPD includes:
- * - UCB1 selection policy
- * - Exploration vs exploitation balancing
- * - Workflow state tree building
- * - Strategy learning from execution outcomes
- */
-export interface WorkflowState {
-    stateId: string;
-    subtasks: string[];
-    completed: string[];
-    assignments: Record<string, string>;
-    totalReward: number;
-    visits: number;
-}
-export interface WorkflowAction {
-    type: "assign" | "execute" | "parallelize";
-    subtaskId?: string;
-    agentId?: string;
-}
-export interface MCTSConfig {
-    maxIterations: number;
-    explorationConstant: number;
-    maxDepth: number;
-}
-export declare class WorkflowNode {
-    state: WorkflowState;
-    parent: WorkflowNode | null;
-    children: Map<string, WorkflowNode>;
-    untriedActions: WorkflowAction[];
-    constructor(state: WorkflowState, parent?: WorkflowNode | null);
-    get averageReward(): number;
-    get isTerminal(): boolean;
-    get isFullyExpanded(): boolean;
-}
-/**
- * MCTS Workflow Optimizer
- *
- * Uses Monte Carlo Tree Search to find optimal workflow strategies.
- *
- * @example
- * ```typescript
- * const optimizer = new MCTSWorkflowOptimizer();
- * const bestStrategy = optimizer.findBestStrategy(task);
- * ```
- */
-export declare class MCTSWorkflowOptimizer {
-    private config;
-    private root;
-    private agents;
-    constructor(config?: Partial<MCTSConfig>, agents?: string[]);
-    /**
-     * Set available agents
-     */
-    setAgents(agents: string[]): void;
-    /**
-     * Find best workflow strategy using MCTS
-     */
-    findBestStrategy(subtasks: string[], evaluateFn: (strategy: Record<string, string>) => Promise<number>): Promise<Record<string, string>>;
-    private mctsIteration;
-    private selectNode;
-    private ucb1Select;
-    private ucb;
-    private expand;
-    private generateActions;
-    private selectBestChild;
-    private backpropagate;
-}
-/**
- * Reference to Full TMLPD MCTS
- *
- * Full implementation in tmlpd-clean/src/orchestration/mcts_workflow.py
- *
- * Features:
- * - Full UCB1 with proper exploration constant
- * - Deterministic rollout simulation
- * - Strategy caching with performance tracking
- * - Adaptive depth based on task complexity
- */ 
-//# sourceMappingURL=mctsWorkflow.d.ts.map

package/tmlpd-pi-extension/dist/orchestration/mctsWorkflow.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"mctsWorkflow.d.ts","sourceRoot":"","sources":["../../src/orchestration/mctsWorkflow.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAIH,MAAM,WAAW,aAAa;IAC5B,OAAO,EAAE,MAAM,CAAC;IAChB,QAAQ,EAAE,MAAM,EAAE,CAAC;IACnB,SAAS,EAAE,MAAM,EAAE,CAAC;IACpB,WAAW,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACpC,WAAW,EAAE,MAAM,CAAC;IACpB,MAAM,EAAE,MAAM,CAAC;CAChB;AAED,MAAM,WAAW,cAAc;IAC7B,IAAI,EAAE,QAAQ,GAAG,SAAS,GAAG,aAAa,CAAC;IAC3C,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,OAAO,CAAC,EAAE,MAAM,CAAC;CAClB;AAED,MAAM,WAAW,UAAU;IACzB,aAAa,EAAE,MAAM,CAAC;IACtB,mBAAmB,EAAE,MAAM,CAAC;IAC5B,QAAQ,EAAE,MAAM,CAAC;CAClB;AAQD,qBAAa,YAAY;IACvB,KAAK,EAAE,aAAa,CAAC;IACrB,MAAM,EAAE,YAAY,GAAG,IAAI,CAAC;IAC5B,QAAQ,EAAE,GAAG,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;IACpC,cAAc,EAAE,cAAc,EAAE,CAAC;gBAErB,KAAK,EAAE,aAAa,EAAE,MAAM,GAAE,YAAY,GAAG,IAAW;IAOpE,IAAI,aAAa,IAAI,MAAM,CAE1B;IAED,IAAI,UAAU,IAAI,OAAO,CAExB;IAED,IAAI,eAAe,IAAI,OAAO,CAE7B;CACF;AAED;;;;;;;;;;GAUG;AACH,qBAAa,qBAAqB;IAChC,OAAO,CAAC,MAAM,CAAa;IAC3B,OAAO,CAAC,IAAI,CAA6B;IACzC,OAAO,CAAC,MAAM,CAAW;gBAEb,MAAM,GAAE,OAAO,CAAC,UAAU,CAAM,EAAE,MAAM,GAAE,MAAM,EAAO;IAKnE;;OAEG;IACH,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE;IAI1B;;OAEG;IACG,gBAAgB,CACpB,QAAQ,EAAE,MAAM,EAAE,EAClB,UAAU,EAAE,CAAC,QAAQ,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,KAAK,OAAO,CAAC,MAAM,CAAC,GAChE,OAAO,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;YA+BpB,aAAa;IAsB3B,OAAO,CAAC,UAAU;IAWlB,OAAO,CAAC,UAAU;IAelB,OAAO,CAAC,GAAG;IAOX,OAAO,CAAC,MAAM;IAuBd,OAAO,CAAC,eAAe;IAiBvB,OAAO,CAAC,eAAe;IAcvB,OAAO,CAAC,aAAa;CAOtB;AAED;;;;;;;;;;GAUG"}

package/tmlpd-pi-extension/dist/orchestration/mctsWorkflow.js

@@ -1,210 +0,0 @@
-"use strict";
-/**
- * TMLPD MCTS Workflow Search
- *
- * Monte Carlo Tree Search for workflow optimization.
- * Reference implementation - for full features see TMLPD v2.x
- *
- * Full TMLPD includes:
- * - UCB1 selection policy
- * - Exploration vs exploitation balancing
- * - Workflow state tree building
- * - Strategy learning from execution outcomes
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.MCTSWorkflowOptimizer = exports.WorkflowNode = void 0;
-const nanoid_1 = require("nanoid");
-const DEFAULT_MCTS_CONFIG = {
-    maxIterations: 50,
-    explorationConstant: 1.414, // sqrt(2) for UCB1
-    maxDepth: 5
-};
-class WorkflowNode {
-    state;
-    parent;
-    children;
-    untriedActions;
-    constructor(state, parent = null) {
-        this.state = state;
-        this.parent = parent;
-        this.children = new Map();
-        this.untriedActions = [];
-    }
-    get averageReward() {
-        return this.state.visits > 0 ? this.state.totalReward / this.state.visits : 0;
-    }
-    get isTerminal() {
-        return this.state.subtasks.length === this.state.completed.length;
-    }
-    get isFullyExpanded() {
-        return this.untriedActions.length === 0 && this.children.size > 0;
-    }
-}
-exports.WorkflowNode = WorkflowNode;
-/**
- * MCTS Workflow Optimizer
- *
- * Uses Monte Carlo Tree Search to find optimal workflow strategies.
- *
- * @example
- * ```typescript
- * const optimizer = new MCTSWorkflowOptimizer();
- * const bestStrategy = optimizer.findBestStrategy(task);
- * ```
- */
-class MCTSWorkflowOptimizer {
-    config;
-    root = null;
-    agents;
-    constructor(config = {}, agents = []) {
-        this.config = { ...DEFAULT_MCTS_CONFIG, ...config };
-        this.agents = agents;
-    }
-    /**
-     * Set available agents
-     */
-    setAgents(agents) {
-        this.agents = agents;
-    }
-    /**
-     * Find best workflow strategy using MCTS
-     */
-    async findBestStrategy(subtasks, evaluateFn // Returns reward
-    ) {
-        const initialState = {
-            stateId: (0, nanoid_1.nanoid)(8),
-            subtasks,
-            completed: [],
-            assignments: {},
-            totalReward: 0,
-            visits: 0
-        };
-        this.root = new WorkflowNode(initialState);
-        // Initialize untried actions
-        if (this.root) {
-            this.root.untriedActions = this.generateActions(subtasks);
-        }
-        // MCTS iterations
-        for (let i = 0; i < this.config.maxIterations; i++) {
-            await this.mctsIteration(evaluateFn);
-        }
-        // Return best strategy
-        if (this.root && this.root.children.size > 0) {
-            const bestChild = this.selectBestChild(this.root);
-            return bestChild?.state.assignments || {};
-        }
-        else {
-            return {};
-        }
-    }
-    async mctsIteration(evaluateFn) {
-        if (!this.root)
-            return;
-        let node = this.selectNode(this.root);
-        if (!node)
-            return;
-        // Expansion
-        if (node.untriedActions.length > 0) {
-            const action = node.untriedActions.pop();
-            node = this.expand(node, action);
-        }
-        // Simulation (simplified - evaluate async)
-        if (node) {
-            const reward = await evaluateFn(node.state.assignments);
-            this.backpropagate(node, reward);
-        }
-    }
-    selectNode(node) {
-        while (node && !node.isTerminal) {
-            if (node.isFullyExpanded) {
-                node = this.ucb1Select(node);
-            }
-            else {
-                return node;
-            }
-        }
-        return node;
-    }
-    ucb1Select(node) {
-        let bestChild = null;
-        let bestUCB = -Infinity;
-        for (const child of node.children.values()) {
-            const ucb = this.ucb(child);
-            if (ucb > bestUCB) {
-                bestUCB = ucb;
-                bestChild = child;
-            }
-        }
-        return bestChild || node;
-    }
-    ucb(node) {
-        if (node.state.visits === 0)
-            return Infinity;
-        const parentVisits = node.parent?.state.visits || 1;
-        return node.averageReward +
-            this.config.explorationConstant * Math.sqrt(Math.log(parentVisits) / node.state.visits);
-    }
-    expand(node, action) {
-        const newAssignments = { ...node.state.assignments };
-        if (action.type === "assign" && action.subtaskId && action.agentId) {
-            newAssignments[action.subtaskId] = action.agentId;
-        }
-        const newState = {
-            stateId: (0, nanoid_1.nanoid)(8),
-            subtasks: node.state.subtasks,
-            completed: [...node.state.completed],
-            assignments: newAssignments,
-            totalReward: 0,
-            visits: 0
-        };
-        const child = new WorkflowNode(newState, node);
-        node.children.set(newState.stateId, child);
-        child.untriedActions = this.generateActions(newState.subtasks);
-        return child;
-    }
-    generateActions(subtasks) {
-        const actions = [];
-        const availableAgents = this.agents.length > 0 ? this.agents : ["claude", "codex", "gemini"];
-        subtasks.forEach(subtask => {
-            availableAgents.forEach(agent => {
-                actions.push({
-                    type: "assign",
-                    subtaskId: subtask,
-                    agentId: agent
-                });
-            });
-        });
-        return actions;
-    }
-    selectBestChild(node) {
-        let best = null;
-        let bestReward = -Infinity;
-        for (const child of node.children.values()) {
-            if (child.averageReward > bestReward) {
-                bestReward = child.averageReward;
-                best = child;
-            }
-        }
-        return best;
-    }
-    backpropagate(node, reward) {
-        while (node) {
-            node.state.visits++;
-            node.state.totalReward += reward;
-            node = node.parent;
-        }
-    }
-}
-exports.MCTSWorkflowOptimizer = MCTSWorkflowOptimizer;
-/**
- * Reference to Full TMLPD MCTS
- *
- * Full implementation in tmlpd-clean/src/orchestration/mcts_workflow.py
- *
- * Features:
- * - Full UCB1 with proper exploration constant
- * - Deterministic rollout simulation
- * - Strategy caching with performance tracking
- * - Adaptive depth based on task complexity
- */ 
-//# sourceMappingURL=mctsWorkflow.js.map

package/tmlpd-pi-extension/dist/orchestration/mctsWorkflow.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"mctsWorkflow.js","sourceRoot":"","sources":["../../src/orchestration/mctsWorkflow.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;GAWG;;;AAEH,mCAAgC;AAuBhC,MAAM,mBAAmB,GAAe;IACtC,aAAa,EAAE,EAAE;IACjB,mBAAmB,EAAE,KAAK,EAAE,mBAAmB;IAC/C,QAAQ,EAAE,CAAC;CACZ,CAAC;AAEF,MAAa,YAAY;IACvB,KAAK,CAAgB;IACrB,MAAM,CAAsB;IAC5B,QAAQ,CAA4B;IACpC,cAAc,CAAmB;IAEjC,YAAY,KAAoB,EAAE,SAA8B,IAAI;QAClE,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,CAAC,QAAQ,GAAG,IAAI,GAAG,EAAE,CAAC;QAC1B,IAAI,CAAC,cAAc,GAAG,EAAE,CAAC;IAC3B,CAAC;IAED,IAAI,aAAa;QACf,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IAChF,CAAC;IAED,IAAI,UAAU;QACZ,OAAO,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,KAAK,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC;IACpE,CAAC;IAED,IAAI,eAAe;QACjB,OAAO,IAAI,CAAC,cAAc,CAAC,MAAM,KAAK,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,GAAG,CAAC,CAAC;IACpE,CAAC;CACF;AAxBD,oCAwBC;AAED;;;;;;;;;;GAUG;AACH,MAAa,qBAAqB;IACxB,MAAM,CAAa;IACnB,IAAI,GAAwB,IAAI,CAAC;IACjC,MAAM,CAAW;IAEzB,YAAY,SAA8B,EAAE,EAAE,SAAmB,EAAE;QACjE,IAAI,CAAC,MAAM,GAAG,EAAE,GAAG,mBAAmB,EAAE,GAAG,MAAM,EAAE,CAAC;QACpD,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;IACvB,CAAC;IAED;;OAEG;IACH,SAAS,CAAC,MAAgB;QACxB,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;IACvB,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,gBAAgB,CACpB,QAAkB,EAClB,UAAiE,CAAC,iBAAiB;;QAEnF,MAAM,YAAY,GAAkB;YAClC,OAAO,EAAE,IAAA,eAAM,EAAC,CAAC,CAAC;YAClB,QAAQ;YACR,SAAS,EAAE,EAAE;YACb,WAAW,EAAE,EAAE;YACf,WAAW,EAAE,CAAC;YACd,MAAM,EAAE,CAAC;SACV,CAAC;QAEF,IAAI,CAAC,IAAI,GAAG,IAAI,YAAY,CAAC,YAAY,CAAC,CAAC;QAE3C,6BAA6B;QAC7B,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;YACd,IAAI,CAAC,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC,eAAe,CAAC,QAAQ,CAAC,CAAC;QAC5D,CAAC;QAED,kBAAkB;QAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,aAAa,EAAE,CAAC,EAAE,EAAE,CAAC;YACnD,MAAM,IAAI,CAAC,aAAa,CAAC,UAAU,CAAC,CAAC;QACvC,CAAC;QAED,uBAAuB;QACvB,IAAI,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;YAC7C,MAAM,SAAS,GAAG,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAClD,OAAO,SAAS,EAAE,KAAK,CAAC,WAAW,IAAI,EAAE,CAAC;QAC5C,CAAC;aAAM,CAAC;YACN,OAAO,EAAE,CAAC;QACZ,CAAC;IACH,CAAC;IAEO,KAAK,CAAC,aAAa,CACzB,UAAiE;QAEjE,IAAI,CAAC,IAAI,CAAC,IAAI;YAAE,OAAO;QAEvB,IAAI,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAEtC,IAAI,CAAC,IAAI;YAAE,OAAO;QAElB,YAAY;QACZ,IAAI,IAAI,CAAC,cAAc,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACnC,MAAM,MAAM,GAAG,IAAI,CAAC,cAAc,CAAC,GAAG,EAAG,CAAC;YAC1C,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QACnC,CAAC;QAED,2CAA2C;QAC3C,IAAI,IAAI,EAAE,CAAC;YACT,MAAM,MAAM,GAAG,MAAM,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;YACxD,IAAI,CAAC,aAAa,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QACnC,CAAC;IACH,CAAC;IAEO,UAAU,CAAC,IAAkB;QACnC,OAAO,IAAI,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC;YAChC,IAAI,IAAI,CAAC,eAAe,EAAE,CAAC;gBACzB,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;YAC/B,CAAC;iBAAM,CAAC;gBACN,OAAO,IAAI,CAAC;YACd,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAEO,UAAU,CAAC,IAAkB;QACnC,IAAI,SAAS,GAAwB,IAAI,CAAC;QAC1C,IAAI,OAAO,GAAG,CAAC,QAAQ,CAAC;QAExB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC;YAC3C,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YAC5B,IAAI,GAAG,GAAG,OAAO,EAAE,CAAC;gBAClB,OAAO,GAAG,GAAG,CAAC;gBACd,SAAS,GAAG,KAAK,CAAC;YACpB,CAAC;QACH,CAAC;QAED,OAAO,SAAS,IAAI,IAAI,CAAC;IAC3B,CAAC;IAEO,GAAG,CAAC,IAAkB;QAC5B,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,QAAQ,CAAC;QAC7C,MAAM,YAAY,GAAG,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,MAAM,IAAI,CAAC,CAAC;QACpD,OAAO,IAAI,CAAC,aAAa;YACvB,IAAI,CAAC,MAAM,CAAC,mBAAmB,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IAC5F,CAAC;IAEO,MAAM,CAAC,IAAkB,EAAE,MAAsB;QACvD,MAAM,cAAc,GAAG,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC;QAErD,IAAI,MAAM,CAAC,IAAI,KAAK,QAAQ,IAAI,MAAM,CAAC,SAAS,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;YACnE,cAAc,CAAC,MAAM,CAAC,SAAS,CAAC,GAAG,MAAM,CAAC,OAAO,CAAC;QACpD,CAAC;QAED,MAAM,QAAQ,GAAkB;YAC9B,OAAO,EAAE,IAAA,eAAM,EAAC,CAAC,CAAC;YAClB,QAAQ,EAAE,IAAI,CAAC,KAAK,CAAC,QAAQ;YAC7B,SAAS,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC;YACpC,WAAW,EAAE,cAAc;YAC3B,WAAW,EAAE,CAAC;YACd,MAAM,EAAE,CAAC;SACV,CAAC;QAEF,MAAM,KAAK,GAAG,IAAI,YAAY,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;QAC/C,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;QAC3C,KAAK,CAAC,cAAc,GAAG,IAAI,CAAC,eAAe,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;QAE/D,OAAO,KAAK,CAAC;IACf,CAAC;IAEO,eAAe,CAAC,QAAkB;QACxC,MAAM,OAAO,GAAqB,EAAE,CAAC;QACrC,MAAM,eAAe,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC;QAE7F,QAAQ,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE;YACzB,eAAe,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE;gBAC9B,OAAO,CAAC,IAAI,CAAC;oBACX,IAAI,EAAE,QAAQ;oBACd,SAAS,EAAE,OAAO;oBAClB,OAAO,EAAE,KAAK;iBACf,CAAC,CAAC;YACL,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;QAEH,OAAO,OAAO,CAAC;IACjB,CAAC;IAEO,eAAe,CAAC,IAAkB;QACxC,IAAI,IAAI,GAAwB,IAAI,CAAC;QACrC,IAAI,UAAU,GAAG,CAAC,QAAQ,CAAC;QAE3B,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC;YAC3C,IAAI,KAAK,CAAC,aAAa,GAAG,UAAU,EAAE,CAAC;gBACrC,UAAU,GAAG,KAAK,CAAC,aAAa,CAAC;gBACjC,IAAI,GAAG,KAAK,CAAC;YACf,CAAC;QACH,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAEO,aAAa,CAAC,IAAkB,EAAE,MAAc;QACtD,OAAO,IAAI,EAAE,CAAC;YACZ,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;YACpB,IAAI,CAAC,KAAK,CAAC,WAAW,IAAI,MAAM,CAAC;YACjC,IAAI,GAAG,IAAI,CAAC,MAAsB,CAAC;QACrC,CAAC;IACH,CAAC;CACF;AA1KD,sDA0KC;AAED;;;;;;;;;;GAUG"}

package/tmlpd-pi-extension/dist/providers/localProvider.d.ts

@@ -1,102 +0,0 @@
-/**
- * TMLPD Local Provider Support
- *
- * Integration with local LLM runtimes:
- * - Ollama (localhost:11434)
- * - vLLM (localhost:8000)
- * - LM Studio (localhost:1234)
- *
- * Enables privacy-preserving, cost-free parallel LLM execution.
- */
-export type LocalRuntime = "ollama" | "vllm" | "lmstudio";
-export interface LocalProviderConfig {
-    runtime: LocalRuntime;
-    endpoint?: string;
-    default_model?: string;
-    timeout_ms?: number;
-}
-export interface LocalModelInfo {
-    name: string;
-    size?: string;
-    quantization?: string;
-    capabilities?: string[];
-}
-export declare class LocalProvider {
-    private runtime;
-    private endpoint;
-    private default_model;
-    private timeout_ms;
-    constructor(config: LocalProviderConfig);
-    /**
-     * List available models on this runtime.
-     */
-    listModels(): Promise<LocalModelInfo[]>;
-    private listOllamaModels;
-    private listVLLMModels;
-    private listLMStudioModels;
-    /**
-     * Generate completion (generic, works with all runtimes).
-     */
-    generate(prompt: string, model?: string, options?: Record<string, any>): Promise<LocalGenerationResult>;
-    private ollamaGenerate;
-    private vllmGenerate;
-    private lmstudioGenerate;
-    /**
-     * Check if this runtime is available/healthy.
-     */
-    healthCheck(): Promise<boolean>;
-    /**
-     * Get runtime info.
-     */
-    getInfo(): {
-        runtime: LocalRuntime;
-        endpoint: string;
-        default_model: string;
-        timeout_ms: number;
-    };
-    private formatSize;
-}
-export interface LocalGenerationResult {
-    success: boolean;
-    error: string | null;
-    model: string;
-    provider: string;
-    content: string;
-    duration_ms: number;
-    tokens: number;
-    cost: number;
-}
-/**
- * Manager for multiple local providers.
- */
-export declare class LocalProviderManager {
-    private providers;
-    addProvider(name: string, config: LocalProviderConfig): void;
-    executeParallel(prompt: string, options?: {
-        models?: string[];
-        provider_priority?: string[];
-        fallback_to_cloud?: boolean;
-    }): Promise<LocalParallelResult>;
-    healthCheckAll(): Promise<Record<string, boolean>>;
-    listProviders(): string[];
-}
-export interface LocalParallelResult {
-    success: boolean;
-    responses: LocalGenerationResult[];
-    total_models: number;
-    successful_models: number;
-    total_cost: number;
-    duration_ms: number;
-}
-export declare function createOllamaProvider(model?: string): LocalProvider;
-export declare function createVLLMProvider(endpoint?: string, model?: string): LocalProvider;
-export declare function createLMStudioProvider(model?: string): LocalProvider;
-declare const _default: {
-    LocalProvider: typeof LocalProvider;
-    LocalProviderManager: typeof LocalProviderManager;
-    createOllamaProvider: typeof createOllamaProvider;
-    createVLLMProvider: typeof createVLLMProvider;
-    createLMStudioProvider: typeof createLMStudioProvider;
-};
-export default _default;
-//# sourceMappingURL=localProvider.d.ts.map

package/tmlpd-pi-extension/dist/providers/localProvider.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"localProvider.d.ts","sourceRoot":"","sources":["../../src/providers/localProvider.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAIH,MAAM,MAAM,YAAY,GAAG,QAAQ,GAAG,MAAM,GAAG,UAAU,CAAC;AAE1D,MAAM,WAAW,mBAAmB;IAClC,OAAO,EAAE,YAAY,CAAC;IACtB,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,UAAU,CAAC,EAAE,MAAM,CAAC;CACrB;AAED,MAAM,WAAW,cAAc;IAC7B,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,YAAY,CAAC,EAAE,MAAM,EAAE,CAAC;CACzB;AASD,qBAAa,aAAa;IACxB,OAAO,CAAC,OAAO,CAAe;IAC9B,OAAO,CAAC,QAAQ,CAAS;IACzB,OAAO,CAAC,aAAa,CAAS;IAC9B,OAAO,CAAC,UAAU,CAAS;gBAEf,MAAM,EAAE,mBAAmB;IAOvC;;OAEG;IACG,UAAU,IAAI,OAAO,CAAC,cAAc,EAAE,CAAC;YAgB/B,gBAAgB;YAiBhB,cAAc;YAgBd,kBAAkB;IAiBhC;;OAEG;IACG,QAAQ,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,CAAC,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,GAAG,OAAO,CAAC,qBAAqB,CAAC;YAyB/F,cAAc;YA2Bd,YAAY;YA6BZ,gBAAgB;IA6B9B;;OAEG;IACG,WAAW,IAAI,OAAO,CAAC,OAAO,CAAC;IAerC;;OAEG;IACH,OAAO;;;;;;IASP,OAAO,CAAC,UAAU;CAYnB;AAED,MAAM,WAAW,qBAAqB;IACpC,OAAO,EAAE,OAAO,CAAC;IACjB,KAAK,EAAE,MAAM,GAAG,IAAI,CAAC;IACrB,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,EAAE,MAAM,CAAC;IACjB,OAAO,EAAE,MAAM,CAAC;IAChB,WAAW,EAAE,MAAM,CAAC;IACpB,MAAM,EAAE,MAAM,CAAC;IACf,IAAI,EAAE,MAAM,CAAC;CACd;AAED;;GAEG;AACH,qBAAa,oBAAoB;IAC/B,OAAO,CAAC,SAAS,CAAyC;IAE1D,WAAW,CAAC,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,mBAAmB,GAAG,IAAI;IAItD,eAAe,CACnB,MAAM,EAAE,MAAM,EACd,OAAO,CAAC,EAAE;QACR,MAAM,CAAC,EAAE,MAAM,EAAE,CAAC;QAClB,iBAAiB,CAAC,EAAE,MAAM,EAAE,CAAC;QAC7B,iBAAiB,CAAC,EAAE,OAAO,CAAC;KAC7B,GACA,OAAO,CAAC,mBAAmB,CAAC;IAiDzB,cAAc,IAAI,OAAO,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IAUxD,aAAa,IAAI,MAAM,EAAE;CAG1B;AAED,MAAM,WAAW,mBAAmB;IAClC,OAAO,EAAE,OAAO,CAAC;IACjB,SAAS,EAAE,qBAAqB,EAAE,CAAC;IACnC,YAAY,EAAE,MAAM,CAAC;IACrB,iBAAiB,EAAE,MAAM,CAAC;IAC1B,UAAU,EAAE,MAAM,CAAC;IACnB,WAAW,EAAE,MAAM,CAAC;CACrB;AAGD,wBAAgB,oBAAoB,CAAC,KAAK,CAAC,EAAE,MAAM,GAAG,aAAa,CAKlE;AAED,wBAAgB,kBAAkB,CAAC,QAAQ,CAAC,EAAE,MAAM,EAAE,KAAK,CAAC,EAAE,MAAM,GAAG,aAAa,CAMnF;AAED,wBAAgB,sBAAsB,CAAC,KAAK,CAAC,EAAE,MAAM,GAAG,aAAa,CAKpE;;;;;;;;AAED,wBAME"}