@yuaone/core 0.1.0

package/dist/model-router.js

@@ -0,0 +1,632 @@
+/**
+ * @module model-router
+ * @description ModelRouter — 태스크·역할·복잡도·API 키 조합으로 최적 LLM 모델을 결정하는 라우터.
+ *
+ * 라우팅 알고리즘:
+ * 1. 태스크 유형에서 필요 역량(strengths) 추출
+ * 2. 사용 가능한 프로바이더(API 키 보유)로 모델 필터링
+ * 3. 역량 매칭·비용·성능 통계·복잡도 적합성을 가중 합산하여 스코어링
+ * 4. 최고 스코어 모델을 primary로, 차순위 2개를 fallback으로 반환
+ *
+ * 통합 지점:
+ * - ParallelExecutor: 태스크별 모델 할당
+ * - Planner: PlannedTask에 추천 모델 주석
+ * - AgentLoop: 단일 에이전트 모드 기본 모델 선택
+ */
+import { PROVIDER_BASE_URLS } from "./constants.js";
+import { RoleConfigRegistry } from "./role-registry.js";
+// ─── Model Catalog ───
+/** 지원 모델 카탈로그 — 프로바이더별 모델, 티어, 비용, 역량 정의 */
+const MODEL_CATALOG = [
+    // Anthropic
+    {
+        provider: "anthropic",
+        model: "claude-opus-4-20250514",
+        tier: "flagship",
+        costPer1kInput: 0.015,
+        costPer1kOutput: 0.075,
+        strengths: ["reasoning", "planning", "analysis", "debugging"],
+        maxContext: 200_000,
+    },
+    {
+        provider: "anthropic",
+        model: "claude-sonnet-4-20250514",
+        tier: "premium",
+        costPer1kInput: 0.003,
+        costPer1kOutput: 0.015,
+        strengths: ["coding", "editing", "review", "security"],
+        maxContext: 200_000,
+    },
+    {
+        provider: "anthropic",
+        model: "claude-haiku-4-5-20251001",
+        tier: "economy",
+        costPer1kInput: 0.0008,
+        costPer1kOutput: 0.004,
+        strengths: ["simple", "search", "documentation"],
+        maxContext: 200_000,
+    },
+    // OpenAI
+    {
+        provider: "openai",
+        model: "gpt-4o",
+        tier: "premium",
+        costPer1kInput: 0.0025,
+        costPer1kOutput: 0.01,
+        strengths: ["coding", "testing", "data", "function_calling"],
+        maxContext: 128_000,
+    },
+    {
+        provider: "openai",
+        model: "gpt-4o-mini",
+        tier: "economy",
+        costPer1kInput: 0.00015,
+        costPer1kOutput: 0.0006,
+        strengths: ["simple", "boilerplate", "search", "automation"],
+        maxContext: 128_000,
+    },
+    {
+        provider: "openai",
+        model: "o3",
+        tier: "flagship",
+        costPer1kInput: 0.01,
+        costPer1kOutput: 0.04,
+        strengths: ["reasoning", "planning", "debugging", "analysis"],
+        maxContext: 200_000,
+    },
+    // Google
+    {
+        provider: "google",
+        model: "gemini-2.5-pro",
+        tier: "premium",
+        costPer1kInput: 0.00125,
+        costPer1kOutput: 0.005,
+        strengths: ["review", "analysis", "large_context"],
+        maxContext: 1_000_000,
+    },
+    {
+        provider: "google",
+        model: "gemini-2.5-flash",
+        tier: "standard",
+        costPer1kInput: 0.00015,
+        costPer1kOutput: 0.0006,
+        strengths: ["coding", "fast", "search", "boilerplate"],
+        maxContext: 1_000_000,
+    },
+    // YUA (OpenAI-compatible, self-hosted)
+    {
+        provider: "yua",
+        model: "yua-pro",
+        tier: "premium",
+        costPer1kInput: 0.003,
+        costPer1kOutput: 0.015,
+        strengths: ["coding", "review", "planning", "analysis"],
+        maxContext: 128_000,
+    },
+    {
+        provider: "yua",
+        model: "yua-basic",
+        tier: "economy",
+        costPer1kInput: 0.0005,
+        costPer1kOutput: 0.002,
+        strengths: ["simple", "search", "boilerplate", "documentation"],
+        maxContext: 128_000,
+    },
+    // DeepSeek
+    {
+        provider: "deepseek",
+        model: "deepseek-chat",
+        tier: "standard",
+        costPer1kInput: 0.00014,
+        costPer1kOutput: 0.00028,
+        strengths: ["coding", "review", "debugging", "refactoring"],
+        maxContext: 128_000,
+    },
+    {
+        provider: "deepseek",
+        model: "deepseek-reasoner",
+        tier: "premium",
+        costPer1kInput: 0.00055,
+        costPer1kOutput: 0.0022,
+        strengths: ["reasoning", "planning", "analysis", "debugging"],
+        maxContext: 128_000,
+    },
+];
+// ─── Task → Strengths Mapping ───
+/** 태스크 유형별 요구 역량 매핑 */
+const TASK_STRENGTH_MAP = {
+    planning: ["reasoning", "planning", "analysis"],
+    coding: ["coding", "editing"],
+    code_review: ["review", "analysis", "security"],
+    testing: ["testing", "coding", "boilerplate"],
+    debugging: ["debugging", "reasoning", "analysis"],
+    refactoring: ["coding", "review", "analysis"],
+    search: ["search", "fast", "simple"],
+    documentation: ["documentation", "simple"],
+    security_scan: ["security", "review", "analysis"],
+    data_processing: ["data", "function_calling"],
+    simple_edit: ["simple", "fast", "editing"],
+    boilerplate: ["boilerplate", "fast", "simple"],
+};
+// ─── Tier Weights ───
+/** 티어별 가중치 (quality 전략용) */
+const TIER_WEIGHT = {
+    economy: 0.25,
+    standard: 0.5,
+    premium: 0.75,
+    flagship: 1.0,
+};
+/** 복잡도 → 최소 적합 티어 매핑 */
+const COMPLEXITY_MIN_TIER = {
+    trivial: "economy",
+    simple: "economy",
+    moderate: "standard",
+    complex: "premium",
+    critical: "flagship",
+};
+/** 티어 순서 (숫자 비교용) */
+const TIER_ORDER = {
+    economy: 0,
+    standard: 1,
+    premium: 2,
+    flagship: 3,
+};
+// ─── Complexity Keywords ───
+/** 복잡도 추정을 위한 키워드 → 복잡도 매핑 (순서대로 매칭 — 첫 번째 매칭 사용) */
+const COMPLEXITY_KEYWORDS = [
+    { pattern: /\b(full\s+rewrite|security\s+audit|complete\s+overhaul)\b/i, level: "critical" },
+    { pattern: /\b(redesign|migrat(e|ion)|architecture|large[- ]scale)\b/i, level: "complex" },
+    { pattern: /\b(implement\s+feature|refactor|restructure|integrate)\b/i, level: "moderate" },
+    { pattern: /\b(add\s+field|update\s+config|minor\s+change|small\s+fix)\b/i, level: "simple" },
+    { pattern: /\b(fix\s+typo|rename|formatting|whitespace|comment)\b/i, level: "trivial" },
+];
+// ─── Role → Task Type Mapping ───
+/** 고정 역할 → 기본 태스크 유형 매핑 */
+const ROLE_TASK_MAP = {
+    orchestrator: "planning",
+    coder: "coding",
+    reviewer: "code_review",
+    memory: "documentation",
+    search: "search",
+    security: "security_scan",
+    data: "data_processing",
+    automation: "boilerplate",
+};
+// ─── ModelRouter ───
+/**
+ * ModelRouter — 태스크·역할·복잡도·API 키 조합으로 최적 LLM 모델을 선택하는 라우터.
+ *
+ * 동일한 입력에 대해 항상 동일한 결과를 반환한다 (결정론적).
+ * 단, `recordStats()`로 축적된 성능 통계가 변하면 스코어가 달라질 수 있다.
+ *
+ * @example
+ * ```typescript
+ * const router = new ModelRouter({
+ *   providers: { anthropic: { apiKey: "sk-..." } },
+ *   costStrategy: "balanced",
+ * });
+ *
+ * const decision = router.route("coding", "coder", "moderate");
+ * const config = router.toBYOKConfig(decision);
+ * ```
+ */
+export class ModelRouter {
+    config;
+    stats = new Map();
+    roleRegistry = new RoleConfigRegistry();
+    accumulatedCostUsd = 0;
+    constructor(config) {
+        this.config = config;
+    }
+    // ─── Public API ───
+    /**
+     * 태스크를 최적 모델로 라우팅한다.
+     *
+     * @param taskType - 태스크 유형 (TASK_STRENGTH_MAP 키 또는 임의 문자열)
+     * @param role - 에이전트 역할 (선택적, 역할에서 태스크 유형을 추론할 수 있음)
+     * @param complexity - 태스크 복잡도 (선택적, 기본 "moderate")
+     * @returns 라우팅 결정 (모델, 티어, fallback, 예상 비용 포함)
+     * @throws 사용 가능한 프로바이더가 없으면 Error
+     */
+    route(taskType, role, complexity = "moderate") {
+        if (!this.hasProvider()) {
+            throw new Error("ModelRouter: No API keys configured. Provide at least one provider in config.providers.");
+        }
+        // Budget check
+        if (this.isBudgetExhausted()) {
+            throw new Error(`ModelRouter: Session budget exhausted ($${this.accumulatedCostUsd.toFixed(4)} / $${this.config.maxSessionCostUsd}).`);
+        }
+        // Resolve effective task type from role if needed
+        const effectiveTaskType = this.resolveTaskType(taskType, role);
+        // Force overrides
+        if (this.config.forceProvider || this.config.forceModel) {
+            return this.buildForcedDecision(effectiveTaskType, complexity);
+        }
+        // Score and rank models
+        const scored = this.scoreModels(effectiveTaskType, complexity);
+        if (scored.length === 0) {
+            throw new Error("ModelRouter: No models available for configured providers.");
+        }
+        const primary = scored[0];
+        const fallbacks = scored
+            .slice(1, 3)
+            .map((s) => ({ provider: s.entry.provider, model: s.entry.model }));
+        return {
+            provider: primary.entry.provider,
+            model: primary.entry.model,
+            tier: primary.entry.tier,
+            reason: primary.reason,
+            fallbacks,
+            estimatedCostPer1kTokens: this.avgCostPer1k(primary.entry),
+        };
+    }
+    /**
+     * TaskContract를 기반으로 최적 모델을 라우팅한다.
+     * 계약의 목표, 역할, 파일 수, 예상 반복 횟수에서 복잡도를 자동 추정한다.
+     *
+     * @param contract - 태스크 계약
+     * @returns 라우팅 결정
+     */
+    routeForContract(contract) {
+        const fileCount = contract.inputSchema.files.length +
+            contract.outputSchema.expectedFiles.length;
+        const complexity = this.estimateComplexity(contract.goal, fileCount);
+        // Infer task type from role
+        const taskType = this.taskTypeFromRole(contract.assignedRole);
+        return this.route(taskType, contract.assignedRole, complexity);
+    }
+    /**
+     * 태스크 설명·파일 수·예상 반복 횟수에서 복잡도를 추정한다.
+     *
+     * 우선순위:
+     * 1. fileCount / estimatedIterations 기반 범위 판정
+     * 2. description 키워드 매칭
+     * 3. 기본값 "moderate"
+     *
+     * @param description - 태스크 설명
+     * @param fileCount - 관련 파일 수 (선택적)
+     * @param estimatedIterations - 예상 반복 횟수 (선택적)
+     * @returns 추정된 복잡도 수준
+     */
+    estimateComplexity(description, fileCount, estimatedIterations) {
+        // 1. Numeric heuristic (higher priority — more objective)
+        const numericLevel = this.complexityFromMetrics(fileCount ?? 0, estimatedIterations ?? 0);
+        // 2. Keyword heuristic
+        const keywordLevel = this.complexityFromKeywords(description);
+        // Return the higher complexity of the two (conservative)
+        if (numericLevel && keywordLevel) {
+            return TIER_ORDER[COMPLEXITY_MIN_TIER[numericLevel]] >=
+                TIER_ORDER[COMPLEXITY_MIN_TIER[keywordLevel]]
+                ? numericLevel
+                : keywordLevel;
+        }
+        return numericLevel ?? keywordLevel ?? "moderate";
+    }
+    /**
+     * 라우팅 결정을 BYOKConfig로 변환한다.
+     *
+     * @param decision - 라우팅 결정
+     * @returns BYOKConfig (BYOKClient 생성자에 전달 가능)
+     * @throws 해당 프로바이더의 API 키가 없으면 Error
+     */
+    toBYOKConfig(decision) {
+        const providerConfig = this.config.providers[decision.provider];
+        if (!providerConfig) {
+            throw new Error(`ModelRouter: No API key configured for provider "${decision.provider}".`);
+        }
+        return {
+            provider: decision.provider,
+            apiKey: providerConfig.apiKey,
+            model: decision.model,
+            baseUrl: providerConfig.baseUrl ?? PROVIDER_BASE_URLS[decision.provider],
+        };
+    }
+    /**
+     * 모델 성능 통계를 기록한다 (적응형 라우팅용).
+     * 호출 수, 평균 레이턴시, 성공률, 평균 토큰을 누적 평균으로 갱신한다.
+     *
+     * @param provider - 프로바이더
+     * @param model - 모델 ID
+     * @param latencyMs - 응답 레이턴시 (ms)
+     * @param success - 성공 여부
+     * @param tokensUsed - 사용된 토큰 수
+     */
+    recordStats(provider, model, latencyMs, success, tokensUsed) {
+        const key = `${provider}:${model}`;
+        const existing = this.stats.get(key);
+        if (!existing) {
+            this.stats.set(key, {
+                provider,
+                model,
+                avgLatencyMs: latencyMs,
+                successRate: success ? 1.0 : 0.0,
+                avgTokensPerTask: tokensUsed,
+                totalCalls: 1,
+                lastError: success ? undefined : "Failed",
+                lastUsed: Date.now(),
+            });
+            return;
+        }
+        const n = existing.totalCalls;
+        existing.avgLatencyMs = (existing.avgLatencyMs * n + latencyMs) / (n + 1);
+        existing.successRate = (existing.successRate * n + (success ? 1 : 0)) / (n + 1);
+        existing.avgTokensPerTask =
+            (existing.avgTokensPerTask * n + tokensUsed) / (n + 1);
+        existing.totalCalls = n + 1;
+        existing.lastUsed = Date.now();
+        if (!success) {
+            existing.lastError = "Failed";
+        }
+    }
+    /**
+     * 축적된 모델 성능 통계를 반환한다.
+     *
+     * @returns 모든 모델의 성능 통계 배열
+     */
+    getStats() {
+        return Array.from(this.stats.values());
+    }
+    /**
+     * 사용 가능한 모델 목록을 반환한다 (API 키가 설정된 프로바이더만 필터링).
+     *
+     * @returns 사용 가능한 모델 카탈로그 엔트리 배열
+     */
+    getAvailableModels() {
+        return MODEL_CATALOG.filter((entry) => this.isProviderAvailable(entry.provider));
+    }
+    /**
+     * 최소 하나의 프로바이더가 설정되어 있는지 확인한다.
+     *
+     * @returns true면 사용 가능한 프로바이더가 있음
+     */
+    hasProvider() {
+        const { providers } = this.config;
+        return !!(providers.anthropic?.apiKey ||
+            providers.openai?.apiKey ||
+            providers.google?.apiKey);
+    }
+    /**
+     * 누적 비용을 추가한다 (세션 예산 추적용).
+     *
+     * @param costUsd - 추가할 비용 (USD)
+     */
+    addCost(costUsd) {
+        this.accumulatedCostUsd += costUsd;
+    }
+    /**
+     * 현재 누적 비용을 반환한다.
+     *
+     * @returns 누적 비용 (USD)
+     */
+    getAccumulatedCost() {
+        return this.accumulatedCostUsd;
+    }
+    // ─── Private: Scoring ───
+    /**
+     * 사용 가능한 모든 모델에 대해 스코어를 계산하고 내림차순 정렬한다.
+     *
+     * 스코어 공식:
+     *   finalScore = strengthMatch * 0.4 + costScore * 0.2 + performanceScore * 0.2 + complexityFit * 0.2
+     */
+    scoreModels(taskType, complexity) {
+        const available = this.getAvailableModels();
+        if (available.length === 0)
+            return [];
+        const requiredStrengths = TASK_STRENGTH_MAP[taskType] ?? [];
+        // Pre-compute cost normalization range
+        const costs = available.map((e) => this.avgCostPer1k(e));
+        const maxCost = Math.max(...costs, 0.001); // avoid division by zero
+        const minCost = Math.min(...costs, 0.001);
+        const costRange = maxCost - minCost || 0.001;
+        const scored = available.map((entry) => {
+            // 1. Strength match (0..1)
+            const strengthMatch = requiredStrengths.length > 0
+                ? requiredStrengths.filter((s) => entry.strengths.includes(s)).length /
+                    requiredStrengths.length
+                : 0.5; // no preference → neutral
+            // 2. Cost score (0..1) — strategy-dependent
+            const entryCost = this.avgCostPer1k(entry);
+            const costScore = this.computeCostScore(entryCost, minCost, costRange, entry.tier);
+            // 3. Performance score from stats (0..1)
+            const performanceScore = this.computePerformanceScore(entry);
+            // 4. Complexity fit (0..1)
+            const complexityFit = this.computeComplexityFit(entry.tier, complexity);
+            const finalScore = strengthMatch * 0.4 +
+                costScore * 0.2 +
+                performanceScore * 0.2 +
+                complexityFit * 0.2;
+            const matchedStrengths = requiredStrengths.filter((s) => entry.strengths.includes(s));
+            const reason = [
+                `score=${finalScore.toFixed(3)}`,
+                `strengths=[${matchedStrengths.join(",")}]`,
+                `tier=${entry.tier}`,
+                `strategy=${this.config.costStrategy}`,
+            ].join(" ");
+            return { entry, score: finalScore, reason };
+        });
+        // Sort descending by score — deterministic tiebreak by model name
+        scored.sort((a, b) => {
+            const diff = b.score - a.score;
+            if (Math.abs(diff) > 1e-9)
+                return diff;
+            return a.entry.model.localeCompare(b.entry.model);
+        });
+        return scored;
+    }
+    /**
+     * 비용 전략에 따른 비용 스코어 계산.
+     * - economy: 저비용일수록 높은 스코어
+     * - quality: 고티어일수록 높은 스코어
+     * - balanced: 비용과 티어의 균형
+     */
+    computeCostScore(entryCost, minCost, costRange, tier) {
+        switch (this.config.costStrategy) {
+            case "economy": {
+                // Inverse cost normalized to 0..1 (cheapest = 1.0)
+                return 1.0 - (entryCost - minCost) / costRange;
+            }
+            case "quality": {
+                // Tier weight directly
+                return TIER_WEIGHT[tier];
+            }
+            case "balanced": {
+                // Average of inverse cost and tier weight
+                const inverseCost = 1.0 - (entryCost - minCost) / costRange;
+                return (inverseCost + TIER_WEIGHT[tier]) / 2;
+            }
+            default:
+                return 0.5;
+        }
+    }
+    /**
+     * 축적된 성능 통계에서 성능 스코어를 계산한다.
+     * 통계가 없으면 중립값 0.5를 반환한다.
+     */
+    computePerformanceScore(entry) {
+        const key = `${entry.provider}:${entry.model}`;
+        const stat = this.stats.get(key);
+        if (!stat || stat.totalCalls === 0) {
+            return 0.5; // neutral — no data
+        }
+        // successRate: 0..1 → contributes directly
+        // latency: lower is better → normalize with a reference (5000ms = 0, 0ms = 1)
+        const latencyScore = Math.max(0, Math.min(1, 1 - stat.avgLatencyMs / 10_000));
+        return stat.successRate * 0.7 + latencyScore * 0.3;
+    }
+    /**
+     * 모델 티어가 태스크 복잡도에 적합한지 평가한다 (0..1).
+     * 정확히 매칭하면 1.0, 한 단계 차이면 0.7, 그 이상이면 감소.
+     */
+    computeComplexityFit(tier, complexity) {
+        const idealTier = COMPLEXITY_MIN_TIER[complexity];
+        const tierDiff = Math.abs(TIER_ORDER[tier] - TIER_ORDER[idealTier]);
+        switch (tierDiff) {
+            case 0:
+                return 1.0;
+            case 1:
+                return 0.7;
+            case 2:
+                return 0.4;
+            default:
+                return 0.2;
+        }
+    }
+    // ─── Private: Complexity Estimation ───
+    /** 파일 수·반복 횟수에서 복잡도 추정 */
+    complexityFromMetrics(fileCount, estimatedIterations) {
+        // Both zero → cannot determine
+        if (fileCount === 0 && estimatedIterations === 0)
+            return null;
+        if (fileCount <= 1 && estimatedIterations <= 2)
+            return "trivial";
+        if (fileCount <= 3 && estimatedIterations <= 5)
+            return "simple";
+        if (fileCount <= 10 && estimatedIterations <= 15)
+            return "moderate";
+        if (fileCount <= 30 && estimatedIterations <= 50)
+            return "complex";
+        return "critical";
+    }
+    /** 설명 키워드에서 복잡도 추정 */
+    complexityFromKeywords(description) {
+        for (const { pattern, level } of COMPLEXITY_KEYWORDS) {
+            if (pattern.test(description)) {
+                return level;
+            }
+        }
+        return null;
+    }
+    // ─── Private: Helpers ───
+    /** 프로바이더에 API 키가 설정되어 있는지 확인 */
+    isProviderAvailable(provider) {
+        return !!this.config.providers[provider]?.apiKey;
+    }
+    /** 모델의 평균 비용 (input + output) / 2 per 1K tokens */
+    avgCostPer1k(entry) {
+        return (entry.costPer1kInput + entry.costPer1kOutput) / 2;
+    }
+    /** 세션 예산이 소진되었는지 확인 */
+    isBudgetExhausted() {
+        if (this.config.maxSessionCostUsd == null)
+            return false;
+        return this.accumulatedCostUsd >= this.config.maxSessionCostUsd;
+    }
+    /** role에서 taskType 추론 */
+    taskTypeFromRole(role) {
+        if (typeof role === "string" && this.roleRegistry.isFixedRole(role)) {
+            return ROLE_TASK_MAP[role] ?? "coding";
+        }
+        // Dynamic role — fall back to "coding"
+        return "coding";
+    }
+    /** taskType과 role 조합에서 유효한 taskType 결정 */
+    resolveTaskType(taskType, role) {
+        // If taskType is in the map, use it directly
+        if (TASK_STRENGTH_MAP[taskType]) {
+            return taskType;
+        }
+        // Try to infer from role
+        if (role) {
+            const inferred = this.taskTypeFromRole(role);
+            if (TASK_STRENGTH_MAP[inferred]) {
+                return inferred;
+            }
+        }
+        // Fall back to "coding" as the most common task type
+        return "coding";
+    }
+    /**
+     * forceProvider/forceModel 설정 시 강제 결정 생성.
+     * 강제된 모델이 카탈로그에 있으면 해당 엔트리 사용,
+     * 없으면 기본값으로 구성하되 fallback은 정상 스코어링으로 계산.
+     */
+    buildForcedDecision(taskType, complexity) {
+        const { forceProvider, forceModel } = this.config;
+        // Find forced model in catalog
+        const forced = MODEL_CATALOG.find((entry) => {
+            if (forceProvider && forceModel) {
+                return entry.provider === forceProvider && entry.model === forceModel;
+            }
+            if (forceModel) {
+                return entry.model === forceModel && this.isProviderAvailable(entry.provider);
+            }
+            if (forceProvider) {
+                return entry.provider === forceProvider && this.isProviderAvailable(entry.provider);
+            }
+            return false;
+        });
+        if (forced) {
+            // Compute fallbacks from remaining available models
+            const fallbacks = this.scoreModels(taskType, complexity)
+                .filter((s) => !(s.entry.provider === forced.provider && s.entry.model === forced.model))
+                .slice(0, 2)
+                .map((s) => ({ provider: s.entry.provider, model: s.entry.model }));
+            return {
+                provider: forced.provider,
+                model: forced.model,
+                tier: forced.tier,
+                reason: `Forced: provider=${forced.provider} model=${forced.model}`,
+                fallbacks,
+                estimatedCostPer1kTokens: this.avgCostPer1k(forced),
+            };
+        }
+        // Forced model/provider not in catalog — construct minimal decision
+        const provider = forceProvider ?? "openai";
+        const model = forceModel ?? "unknown";
+        if (!this.isProviderAvailable(provider)) {
+            throw new Error(`ModelRouter: Forced provider "${provider}" has no API key configured.`);
+        }
+        const fallbacks = this.scoreModels(taskType, complexity)
+            .slice(0, 2)
+            .map((s) => ({ provider: s.entry.provider, model: s.entry.model }));
+        return {
+            provider,
+            model,
+            tier: "standard",
+            reason: `Forced (not in catalog): provider=${provider} model=${model}`,
+            fallbacks,
+            estimatedCostPer1kTokens: 0,
+        };
+    }
+}
+//# sourceMappingURL=model-router.js.map

package/dist/model-router.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"model-router.js","sourceRoot":"","sources":["../src/model-router.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AASH,OAAO,EAAE,kBAAkB,EAAE,MAAM,gBAAgB,CAAC;AACpD,OAAO,EAAE,kBAAkB,EAAE,MAAM,oBAAoB,CAAC;AAsFxD,wBAAwB;AAExB,4CAA4C;AAC5C,MAAM,aAAa,GAAiB;IAClC,YAAY;IACZ;QACE,QAAQ,EAAE,WAAW;QACrB,KAAK,EAAE,wBAAwB;QAC/B,IAAI,EAAE,UAAU;QAChB,cAAc,EAAE,KAAK;QACrB,eAAe,EAAE,KAAK;QACtB,SAAS,EAAE,CAAC,WAAW,EAAE,UAAU,EAAE,UAAU,EAAE,WAAW,CAAC;QAC7D,UAAU,EAAE,OAAO;KACpB;IACD;QACE,QAAQ,EAAE,WAAW;QACrB,KAAK,EAAE,0BAA0B;QACjC,IAAI,EAAE,SAAS;QACf,cAAc,EAAE,KAAK;QACrB,eAAe,EAAE,KAAK;QACtB,SAAS,EAAE,CAAC,QAAQ,EAAE,SAAS,EAAE,QAAQ,EAAE,UAAU,CAAC;QACtD,UAAU,EAAE,OAAO;KACpB;IACD;QACE,QAAQ,EAAE,WAAW;QACrB,KAAK,EAAE,2BAA2B;QAClC,IAAI,EAAE,SAAS;QACf,cAAc,EAAE,MAAM;QACtB,eAAe,EAAE,KAAK;QACtB,SAAS,EAAE,CAAC,QAAQ,EAAE,QAAQ,EAAE,eAAe,CAAC;QAChD,UAAU,EAAE,OAAO;KACpB;IACD,SAAS;IACT;QACE,QAAQ,EAAE,QAAQ;QAClB,KAAK,EAAE,QAAQ;QACf,IAAI,EAAE,SAAS;QACf,cAAc,EAAE,MAAM;QACtB,eAAe,EAAE,IAAI;QACrB,SAAS,EAAE,CAAC,QAAQ,EAAE,SAAS,EAAE,MAAM,EAAE,kBAAkB,CAAC;QAC5D,UAAU,EAAE,OAAO;KACpB;IACD;QACE,QAAQ,EAAE,QAAQ;QAClB,KAAK,EAAE,aAAa;QACpB,IAAI,EAAE,SAAS;QACf,cAAc,EAAE,OAAO;QACvB,eAAe,EAAE,MAAM;QACvB,SAAS,EAAE,CAAC,QAAQ,EAAE,aAAa,EAAE,QAAQ,EAAE,YAAY,CAAC;QAC5D,UAAU,EAAE,OAAO;KACpB;IACD;QACE,QAAQ,EAAE,QAAQ;QAClB,KAAK,EAAE,IAAI;QACX,IAAI,EAAE,UAAU;QAChB,cAAc,EAAE,IAAI;QACpB,eAAe,EAAE,IAAI;QACrB,SAAS,EAAE,CAAC,WAAW,EAAE,UAAU,EAAE,WAAW,EAAE,UAAU,CAAC;QAC7D,UAAU,EAAE,OAAO;KACpB;IACD,SAAS;IACT;QACE,QAAQ,EAAE,QAAQ;QAClB,KAAK,EAAE,gBAAgB;QACvB,IAAI,EAAE,SAAS;QACf,cAAc,EAAE,OAAO;QACvB,eAAe,EAAE,KAAK;QACtB,SAAS,EAAE,CAAC,QAAQ,EAAE,UAAU,EAAE,eAAe,CAAC;QAClD,UAAU,EAAE,SAAS;KACtB;IACD;QACE,QAAQ,EAAE,QAAQ;QAClB,KAAK,EAAE,kBAAkB;QACzB,IAAI,EAAE,UAAU;QAChB,cAAc,EAAE,OAAO;QACvB,eAAe,EAAE,MAAM;QACvB,SAAS,EAAE,CAAC,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,aAAa,CAAC;QACtD,UAAU,EAAE,SAAS;KACtB;IACD,uCAAuC;IACvC;QACE,QAAQ,EAAE,KAAK;QACf,KAAK,EAAE,SAAS;QAChB,IAAI,EAAE,SAAS;QACf,cAAc,EAAE,KAAK;QACrB,eAAe,EAAE,KAAK;QACtB,SAAS,EAAE,CAAC,QAAQ,EAAE,QAAQ,EAAE,UAAU,EAAE,UAAU,CAAC;QACvD,UAAU,EAAE,OAAO;KACpB;IACD;QACE,QAAQ,EAAE,KAAK;QACf,KAAK,EAAE,WAAW;QAClB,IAAI,EAAE,SAAS;QACf,cAAc,EAAE,MAAM;QACtB,eAAe,EAAE,KAAK;QACtB,SAAS,EAAE,CAAC,QAAQ,EAAE,QAAQ,EAAE,aAAa,EAAE,eAAe,CAAC;QAC/D,UAAU,EAAE,OAAO;KACpB;IACD,WAAW;IACX;QACE,QAAQ,EAAE,UAAU;QACpB,KAAK,EAAE,eAAe;QACtB,IAAI,EAAE,UAAU;QAChB,cAAc,EAAE,OAAO;QACvB,eAAe,EAAE,OAAO;QACxB,SAAS,EAAE,CAAC,QAAQ,EAAE,QAAQ,EAAE,WAAW,EAAE,aAAa,CAAC;QAC3D,UAAU,EAAE,OAAO;KACpB;IACD;QACE,QAAQ,EAAE,UAAU;QACpB,KAAK,EAAE,mBAAmB;QAC1B,IAAI,EAAE,SAAS;QACf,cAAc,EAAE,OAAO;QACvB,eAAe,EAAE,MAAM;QACvB,SAAS,EAAE,CAAC,WAAW,EAAE,UAAU,EAAE,UAAU,EAAE,WAAW,CAAC;QAC7D,UAAU,EAAE,OAAO;KACpB;CACF,CAAC;AAEF,mCAAmC;AAEnC,uBAAuB;AACvB,MAAM,iBAAiB,GAA6B;IAClD,QAAQ,EAAE,CAAC,WAAW,EAAE,UAAU,EAAE,UAAU,CAAC;IAC/C,MAAM,EAAE,CAAC,QAAQ,EAAE,SAAS,CAAC;IAC7B,WAAW,EAAE,CAAC,QAAQ,EAAE,UAAU,EAAE,UAAU,CAAC;IAC/C,OAAO,EAAE,CAAC,SAAS,EAAE,QAAQ,EAAE,aAAa,CAAC;IAC7C,SAAS,EAAE,CAAC,WAAW,EAAE,WAAW,EAAE,UAAU,CAAC;IACjD,WAAW,EAAE,CAAC,QAAQ,EAAE,QAAQ,EAAE,UAAU,CAAC;IAC7C,MAAM,EAAE,CAAC,QAAQ,EAAE,MAAM,EAAE,QAAQ,CAAC;IACpC,aAAa,EAAE,CAAC,eAAe,EAAE,QAAQ,CAAC;IAC1C,aAAa,EAAE,CAAC,UAAU,EAAE,QAAQ,EAAE,UAAU,CAAC;IACjD,eAAe,EAAE,CAAC,MAAM,EAAE,kBAAkB,CAAC;IAC7C,WAAW,EAAE,CAAC,QAAQ,EAAE,MAAM,EAAE,SAAS,CAAC;IAC1C,WAAW,EAAE,CAAC,aAAa,EAAE,MAAM,EAAE,QAAQ,CAAC;CAC/C,CAAC;AAEF,uBAAuB;AAEvB,4BAA4B;AAC5B,MAAM,WAAW,GAAmC;IAClD,OAAO,EAAE,IAAI;IACb,QAAQ,EAAE,GAAG;IACb,OAAO,EAAE,IAAI;IACb,QAAQ,EAAE,GAAG;CACd,CAAC;AAEF,wBAAwB;AACxB,MAAM,mBAAmB,GAAgD;IACvE,OAAO,EAAE,SAAS;IAClB,MAAM,EAAE,SAAS;IACjB,QAAQ,EAAE,UAAU;IACpB,OAAO,EAAE,SAAS;IAClB,QAAQ,EAAE,UAAU;CACrB,CAAC;AAEF,qBAAqB;AACrB,MAAM,UAAU,GAAmC;IACjD,OAAO,EAAE,CAAC;IACV,QAAQ,EAAE,CAAC;IACX,OAAO,EAAE,CAAC;IACV,QAAQ,EAAE,CAAC;CACZ,CAAC;AAEF,8BAA8B;AAE9B,qDAAqD;AACrD,MAAM,mBAAmB,GAGpB;IACH,EAAE,OAAO,EAAE,4DAA4D,EAAE,KAAK,EAAE,UAAU,EAAE;IAC5F,EAAE,OAAO,EAAE,2DAA2D,EAAE,KAAK,EAAE,SAAS,EAAE;IAC1F,EAAE,OAAO,EAAE,2DAA2D,EAAE,KAAK,EAAE,UAAU,EAAE;IAC3F,EAAE,OAAO,EAAE,+DAA+D,EAAE,KAAK,EAAE,QAAQ,EAAE;IAC7F,EAAE,OAAO,EAAE,wDAAwD,EAAE,KAAK,EAAE,SAAS,EAAE;CACxF,CAAC;AAEF,mCAAmC;AAEnC,2BAA2B;AAC3B,MAAM,aAAa,GAAmC;IACpD,YAAY,EAAE,UAAU;IACxB,KAAK,EAAE,QAAQ;IACf,QAAQ,EAAE,aAAa;IACvB,MAAM,EAAE,eAAe;IACvB,MAAM,EAAE,QAAQ;IAChB,QAAQ,EAAE,eAAe;IACzB,IAAI,EAAE,iBAAiB;IACvB,UAAU,EAAE,aAAa;CAC1B,CAAC;AAEF,sBAAsB;AAEtB;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,OAAO,WAAW;IACL,MAAM,CAAoB;IAC1B,KAAK,GAAG,IAAI,GAAG,EAAsB,CAAC;IACtC,YAAY,GAAG,IAAI,kBAAkB,EAAE,CAAC;IACjD,kBAAkB,GAAG,CAAC,CAAC;IAE/B,YAAY,MAAyB;QACnC,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;IACvB,CAAC;IAED,qBAAqB;IAErB;;;;;;;;OAQG;IACH,KAAK,CACH,QAAgB,EAChB,IAAgB,EAChB,aAAkC,UAAU;QAE5C,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,EAAE,CAAC;YACxB,MAAM,IAAI,KAAK,CACb,yFAAyF,CAC1F,CAAC;QACJ,CAAC;QAED,eAAe;QACf,IAAI,IAAI,CAAC,iBAAiB,EAAE,EAAE,CAAC;YAC7B,MAAM,IAAI,KAAK,CACb,2CAA2C,IAAI,CAAC,kBAAkB,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,IAAI,CAAC,MAAM,CAAC,iBAAiB,IAAI,CACtH,CAAC;QACJ,CAAC;QAED,kDAAkD;QAClD,MAAM,iBAAiB,GAAG,IAAI,CAAC,eAAe,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;QAE/D,kBAAkB;QAClB,IAAI,IAAI,CAAC,MAAM,CAAC,aAAa,IAAI,IAAI,CAAC,MAAM,CAAC,UAAU,EAAE,CAAC;YACxD,OAAO,IAAI,CAAC,mBAAmB,CAAC,iBAAiB,EAAE,UAAU,CAAC,CAAC;QACjE,CAAC;QAED,wBAAwB;QACxB,MAAM,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC,iBAAiB,EAAE,UAAU,CAAC,CAAC;QAC/D,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACxB,MAAM,IAAI,KAAK,CACb,4DAA4D,CAC7D,CAAC;QACJ,CAAC;QAED,MAAM,OAAO,GAAG,MAAM,CAAC,CAAC,CAAE,CAAC;QAC3B,MAAM,SAAS,GAAG,MAAM;aACrB,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;aACX,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC,KAAK,CAAC,QAAQ,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QAEtE,OAAO;YACL,QAAQ,EAAE,OAAO,CAAC,KAAK,CAAC,QAAQ;YAChC,KAAK,EAAE,OAAO,CAAC,KAAK,CAAC,KAAK;YAC1B,IAAI,EAAE,OAAO,CAAC,KAAK,CAAC,IAAI;YACxB,MAAM,EAAE,OAAO,CAAC,MAAM;YACtB,SAAS;YACT,wBAAwB,EAAE,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,KAAK,CAAC;SAC3D,CAAC;IACJ,CAAC;IAED;;;;;;OAMG;IACH,gBAAgB,CAAC,QAAsB;QACrC,MAAM,SAAS,GACb,QAAQ,CAAC,WAAW,CAAC,KAAK,CAAC,MAAM;YACjC,QAAQ,CAAC,YAAY,CAAC,aAAa,CAAC,MAAM,CAAC;QAE7C,MAAM,UAAU,GAAG,IAAI,CAAC,kBAAkB,CACxC,QAAQ,CAAC,IAAI,EACb,SAAS,CACV,CAAC;QAEF,4BAA4B;QAC5B,MAAM,QAAQ,GAAG,IAAI,CAAC,gBAAgB,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC;QAE9D,OAAO,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,QAAQ,CAAC,YAAY,EAAE,UAAU,CAAC,CAAC;IACjE,CAAC;IAED;;;;;;;;;;;;OAYG;IACH,kBAAkB,CAChB,WAAmB,EACnB,SAAkB,EAClB,mBAA4B;QAE5B,0DAA0D;QAC1D,MAAM,YAAY,GAAG,IAAI,CAAC,qBAAqB,CAC7C,SAAS,IAAI,CAAC,EACd,mBAAmB,IAAI,CAAC,CACzB,CAAC;QAEF,uBAAuB;QACvB,MAAM,YAAY,GAAG,IAAI,CAAC,sBAAsB,CAAC,WAAW,CAAC,CAAC;QAE9D,yDAAyD;QACzD,IAAI,YAAY,IAAI,YAAY,EAAE,CAAC;YACjC,OAAO,UAAU,CAAC,mBAAmB,CAAC,YAAY,CAAC,CAAC;gBAClD,UAAU,CAAC,mBAAmB,CAAC,YAAY,CAAC,CAAC;gBAC7C,CAAC,CAAC,YAAY;gBACd,CAAC,CAAC,YAAY,CAAC;QACnB,CAAC;QAED,OAAO,YAAY,IAAI,YAAY,IAAI,UAAU,CAAC;IACpD,CAAC;IAED;;;;;;OAMG;IACH,YAAY,CAAC,QAAyB;QACpC,MAAM,cAAc,GAAG,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;QAChE,IAAI,CAAC,cAAc,EAAE,CAAC;YACpB,MAAM,IAAI,KAAK,CACb,oDAAoD,QAAQ,CAAC,QAAQ,IAAI,CAC1E,CAAC;QACJ,CAAC;QAED,OAAO;YACL,QAAQ,EAAE,QAAQ,CAAC,QAAQ;YAC3B,MAAM,EAAE,cAAc,CAAC,MAAM;YAC7B,KAAK,EAAE,QAAQ,CAAC,KAAK;YACrB,OAAO,EACL,cAAc,CAAC,OAAO,IAAI,kBAAkB,CAAC,QAAQ,CAAC,QAAQ,CAAC;SAClE,CAAC;IACJ,CAAC;IAED;;;;;;;;;OASG;IACH,WAAW,CACT,QAAqB,EACrB,KAAa,EACb,SAAiB,EACjB,OAAgB,EAChB,UAAkB;QAElB,MAAM,GAAG,GAAG,GAAG,QAAQ,IAAI,KAAK,EAAE,CAAC;QACnC,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAErC,IAAI,CAAC,QAAQ,EAAE,CAAC;YACd,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE;gBAClB,QAAQ;gBACR,KAAK;gBACL,YAAY,EAAE,SAAS;gBACvB,WAAW,EAAE,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG;gBAChC,gBAAgB,EAAE,UAAU;gBAC5B,UAAU,EAAE,CAAC;gBACb,SAAS,EAAE,OAAO,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,QAAQ;gBACzC,QAAQ,EAAE,IAAI,CAAC,GAAG,EAAE;aACrB,CAAC,CAAC;YACH,OAAO;QACT,CAAC;QAED,MAAM,CAAC,GAAG,QAAQ,CAAC,UAAU,CAAC;QAC9B,QAAQ,CAAC,YAAY,GAAG,CAAC,QAAQ,CAAC,YAAY,GAAG,CAAC,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC1E,QAAQ,CAAC,WAAW,GAAG,CAAC,QAAQ,CAAC,WAAW,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAChF,QAAQ,CAAC,gBAAgB;YACvB,CAAC,QAAQ,CAAC,gBAAgB,GAAG,CAAC,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACzD,QAAQ,CAAC,UAAU,GAAG,CAAC,GAAG,CAAC,CAAC;QAC5B,QAAQ,CAAC,QAAQ,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAC/B,IAAI,CAAC,OAAO,EAAE,CAAC;YACb,QAAQ,CAAC,SAAS,GAAG,QAAQ,CAAC;QAChC,CAAC;IACH,CAAC;IAED;;;;OAIG;IACH,QAAQ;QACN,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC;IACzC,CAAC;IAED;;;;OAIG;IACH,kBAAkB;QAChB,OAAO,aAAa,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC,mBAAmB,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC;IACnF,CAAC;IAED;;;;OAIG;IACH,WAAW;QACT,MAAM,EAAE,SAAS,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC;QAClC,OAAO,CAAC,CAAC,CACP,SAAS,CAAC,SAAS,EAAE,MAAM;YAC3B,SAAS,CAAC,MAAM,EAAE,MAAM;YACxB,SAAS,CAAC,MAAM,EAAE,MAAM,CACzB,CAAC;IACJ,CAAC;IAED;;;;OAIG;IACH,OAAO,CAAC,OAAe;QACrB,IAAI,CAAC,kBAAkB,IAAI,OAAO,CAAC;IACrC,CAAC;IAED;;;;OAIG;IACH,kBAAkB;QAChB,OAAO,IAAI,CAAC,kBAAkB,CAAC;IACjC,CAAC;IAED,2BAA2B;IAE3B;;;;;OAKG;IACK,WAAW,CACjB,QAAgB,EAChB,UAA+B;QAE/B,MAAM,SAAS,GAAG,IAAI,CAAC,kBAAkB,EAAE,CAAC;QAC5C,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QAEtC,MAAM,iBAAiB,GAAG,iBAAiB,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC;QAE5D,uCAAuC;QACvC,MAAM,KAAK,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;QACzD,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,yBAAyB;QACpE,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,KAAK,EAAE,KAAK,CAAC,CAAC;QAC1C,MAAM,SAAS,GAAG,OAAO,GAAG,OAAO,IAAI,KAAK,CAAC;QAE7C,MAAM,MAAM,GAAkB,SAAS,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE;YACpD,2BAA2B;YAC3B,MAAM,aAAa,GACjB,iBAAiB,CAAC,MAAM,GAAG,CAAC;gBAC1B,CAAC,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM;oBACnE,iBAAiB,CAAC,MAAM;gBAC1B,CAAC,CAAC,GAAG,CAAC,CAAC,0BAA0B;YAErC,4CAA4C;YAC5C,MAAM,SAAS,GAAG,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;YAC3C,MAAM,SAAS,GAAG,IAAI,CAAC,gBAAgB,CACrC,SAAS,EACT,OAAO,EACP,SAAS,EACT,KAAK,CAAC,IAAI,CACX,CAAC;YAEF,yCAAyC;YACzC,MAAM,gBAAgB,GAAG,IAAI,CAAC,uBAAuB,CAAC,KAAK,CAAC,CAAC;YAE7D,2BAA2B;YAC3B,MAAM,aAAa,GAAG,IAAI,CAAC,oBAAoB,CAAC,KAAK,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;YAExE,MAAM,UAAU,GACd,aAAa,GAAG,GAAG;gBACnB,SAAS,GAAG,GAAG;gBACf,gBAAgB,GAAG,GAAG;gBACtB,aAAa,GAAG,GAAG,CAAC;YAEtB,MAAM,gBAAgB,GAAG,iBAAiB,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CACtD,KAAK,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,CAC5B,CAAC;YACF,MAAM,MAAM,GAAG;gBACb,SAAS,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;gBAChC,cAAc,gBAAgB,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG;gBAC3C,QAAQ,KAAK,CAAC,IAAI,EAAE;gBACpB,YAAY,IAAI,CAAC,MAAM,CAAC,YAAY,EAAE;aACvC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAEZ,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,UAAU,EAAE,MAAM,EAAE,CAAC;QAC9C,CAAC,CAAC,CAAC;QAEH,kEAAkE;QAClE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;YACnB,MAAM,IAAI,GAAG,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;YAC/B,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,IAAI;gBAAE,OAAO,IAAI,CAAC;YACvC,OAAO,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QACpD,CAAC,CAAC,CAAC;QAEH,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;OAKG;IACK,gBAAgB,CACtB,SAAiB,EACjB,OAAe,EACf,SAAiB,EACjB,IAAoB;QAEpB,QAAQ,IAAI,CAAC,MAAM,CAAC,YAAY,EAAE,CAAC;YACjC,KAAK,SAAS,CAAC,CAAC,CAAC;gBACf,mDAAmD;gBACnD,OAAO,GAAG,GAAG,CAAC,SAAS,GAAG,OAAO,CAAC,GAAG,SAAS,CAAC;YACjD,CAAC;YACD,KAAK,SAAS,CAAC,CAAC,CAAC;gBACf,uBAAuB;gBACvB,OAAO,WAAW,CAAC,IAAI,CAAC,CAAC;YAC3B,CAAC;YACD,KAAK,UAAU,CAAC,CAAC,CAAC;gBAChB,0CAA0C;gBAC1C,MAAM,WAAW,GAAG,GAAG,GAAG,CAAC,SAAS,GAAG,OAAO,CAAC,GAAG,SAAS,CAAC;gBAC5D,OAAO,CAAC,WAAW,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;YAC/C,CAAC;YACD;gBACE,OAAO,GAAG,CAAC;QACf,CAAC;IACH,CAAC;IAED;;;OAGG;IACK,uBAAuB,CAAC,KAAiB;QAC/C,MAAM,GAAG,GAAG,GAAG,KAAK,CAAC,QAAQ,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAC/C,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAEjC,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,UAAU,KAAK,CAAC,EAAE,CAAC;YACnC,OAAO,GAAG,CAAC,CAAC,oBAAoB;QAClC,CAAC;QAED,2CAA2C;QAC3C,8EAA8E;QAC9E,MAAM,YAAY,GAAG,IAAI,CAAC,GAAG,CAC3B,CAAC,EACD,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,YAAY,GAAG,MAAM,CAAC,CAC5C,CAAC;QAEF,OAAO,IAAI,CAAC,WAAW,GAAG,GAAG,GAAG,YAAY,GAAG,GAAG,CAAC;IACrD,CAAC;IAED;;;OAGG;IACK,oBAAoB,CAC1B,IAAoB,EACpB,UAA+B;QAE/B,MAAM,SAAS,GAAG,mBAAmB,CAAC,UAAU,CAAC,CAAC;QAClD,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,UAAU,CAAC,SAAS,CAAC,CAAC,CAAC;QAEpE,QAAQ,QAAQ,EAAE,CAAC;YACjB,KAAK,CAAC;gBACJ,OAAO,GAAG,CAAC;YACb,KAAK,CAAC;gBACJ,OAAO,GAAG,CAAC;YACb,KAAK,CAAC;gBACJ,OAAO,GAAG,CAAC;YACb;gBACE,OAAO,GAAG,CAAC;QACf,CAAC;IACH,CAAC;IAED,yCAAyC;IAEzC,0BAA0B;IAClB,qBAAqB,CAC3B,SAAiB,EACjB,mBAA2B;QAE3B,+BAA+B;QAC/B,IAAI,SAAS,KAAK,CAAC,IAAI,mBAAmB,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC;QAE9D,IAAI,SAAS,IAAI,CAAC,IAAI,mBAAmB,IAAI,CAAC;YAAE,OAAO,SAAS,CAAC;QACjE,IAAI,SAAS,IAAI,CAAC,IAAI,mBAAmB,IAAI,CAAC;YAAE,OAAO,QAAQ,CAAC;QAChE,IAAI,SAAS,IAAI,EAAE,IAAI,mBAAmB,IAAI,EAAE;YAAE,OAAO,UAAU,CAAC;QACpE,IAAI,SAAS,IAAI,EAAE,IAAI,mBAAmB,IAAI,EAAE;YAAE,OAAO,SAAS,CAAC;QACnE,OAAO,UAAU,CAAC;IACpB,CAAC;IAED,sBAAsB;IACd,sBAAsB,CAC5B,WAAmB;QAEnB,KAAK,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,mBAAmB,EAAE,CAAC;YACrD,IAAI,OAAO,CAAC,IAAI,CAAC,WAAW,CAAC,EAAE,CAAC;gBAC9B,OAAO,KAAK,CAAC;YACf,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,2BAA2B;IAE3B,gCAAgC;IACxB,mBAAmB,CAAC,QAAqB;QAC/C,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,QAAQ,CAAC,EAAE,MAAM,CAAC;IACnD,CAAC;IAED,mDAAmD;IAC3C,YAAY,CAAC,KAAiB;QACpC,OAAO,CAAC,KAAK,CAAC,cAAc,GAAG,KAAK,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC;IAC5D,CAAC;IAED,uBAAuB;IACf,iBAAiB;QACvB,IAAI,IAAI,CAAC,MAAM,CAAC,iBAAiB,IAAI,IAAI;YAAE,OAAO,KAAK,CAAC;QACxD,OAAO,IAAI,CAAC,kBAAkB,IAAI,IAAI,CAAC,MAAM,CAAC,iBAAiB,CAAC;IAClE,CAAC;IAED,yBAAyB;IACjB,gBAAgB,CAAC,IAAe;QACtC,IAAI,OAAO,IAAI,KAAK,QAAQ,IAAI,IAAI,CAAC,YAAY,CAAC,WAAW,CAAC,IAAI,CAAC,EAAE,CAAC;YACpE,OAAO,aAAa,CAAC,IAAI,CAAC,IAAI,QAAQ,CAAC;QACzC,CAAC;QACD,uCAAuC;QACvC,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,0CAA0C;IAClC,eAAe,CAAC,QAAgB,EAAE,IAAgB;QACxD,6CAA6C;QAC7C,IAAI,iBAAiB,CAAC,QAAQ,CAAC,EAAE,CAAC;YAChC,OAAO,QAAQ,CAAC;QAClB,CAAC;QAED,yBAAyB;QACzB,IAAI,IAAI,EAAE,CAAC;YACT,MAAM,QAAQ,GAAG,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC;YAC7C,IAAI,iBAAiB,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAChC,OAAO,QAAQ,CAAC;YAClB,CAAC;QACH,CAAC;QAED,qDAAqD;QACrD,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;;;OAIG;IACK,mBAAmB,CACzB,QAAgB,EAChB,UAA+B;QAE/B,MAAM,EAAE,aAAa,EAAE,UAAU,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC;QAElD,+BAA+B;QAC/B,MAAM,MAAM,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE;YAC1C,IAAI,aAAa,IAAI,UAAU,EAAE,CAAC;gBAChC,OAAO,KAAK,CAAC,QAAQ,KAAK,aAAa,IAAI,KAAK,CAAC,KAAK,KAAK,UAAU,CAAC;YACxE,CAAC;YACD,IAAI,UAAU,EAAE,CAAC;gBACf,OAAO,KAAK,CAAC,KAAK,KAAK,UAAU,IAAI,IAAI,CAAC,mBAAmB,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;YAChF,CAAC;YACD,IAAI,aAAa,EAAE,CAAC;gBAClB,OAAO,KAAK,CAAC,QAAQ,KAAK,aAAa,IAAI,IAAI,CAAC,mBAAmB,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;YACtF,CAAC;YACD,OAAO,KAAK,CAAC;QACf,CAAC,CAAC,CAAC;QAEH,IAAI,MAAM,EAAE,CAAC;YACX,oDAAoD;YACpD,MAAM,SAAS,GAAG,IAAI,CAAC,WAAW,CAAC,QAAQ,EAAE,UAAU,CAAC;iBACrD,MAAM,CACL,CAAC,CAAC,EAAE,EAAE,CACJ,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,QAAQ,KAAK,MAAM,CAAC,QAAQ,IAAI,CAAC,CAAC,KAAK,CAAC,KAAK,KAAK,MAAM,CAAC,KAAK,CAAC,CAC5E;iBACA,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;iBACX,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC,KAAK,CAAC,QAAQ,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YAEtE,OAAO;gBACL,QAAQ,EAAE,MAAM,CAAC,QAAQ;gBACzB,KAAK,EAAE,MAAM,CAAC,KAAK;gBACnB,IAAI,EAAE,MAAM,CAAC,IAAI;gBACjB,MAAM,EAAE,oBAAoB,MAAM,CAAC,QAAQ,UAAU,MAAM,CAAC,KAAK,EAAE;gBACnE,SAAS;gBACT,wBAAwB,EAAE,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC;aACpD,CAAC;QACJ,CAAC;QAED,oEAAoE;QACpE,MAAM,QAAQ,GAAG,aAAa,IAAI,QAAQ,CAAC;QAC3C,MAAM,KAAK,GAAG,UAAU,IAAI,SAAS,CAAC;QAEtC,IAAI,CAAC,IAAI,CAAC,mBAAmB,CAAC,QAAQ,CAAC,EAAE,CAAC;YACxC,MAAM,IAAI,KAAK,CACb,iCAAiC,QAAQ,8BAA8B,CACxE,CAAC;QACJ,CAAC;QAED,MAAM,SAAS,GAAG,IAAI,CAAC,WAAW,CAAC,QAAQ,EAAE,UAAU,CAAC;aACrD,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;aACX,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC,KAAK,CAAC,QAAQ,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QAEtE,OAAO;YACL,QAAQ;YACR,KAAK;YACL,IAAI,EAAE,UAAU;YAChB,MAAM,EAAE,qCAAqC,QAAQ,UAAU,KAAK,EAAE;YACtE,SAAS;YACT,wBAAwB,EAAE,CAAC;SAC5B,CAAC;IACJ,CAAC;CACF"}