@liendev/lien 0.19.1 → 0.19.3

package/dist/index.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/utils/version.ts","../src/constants.ts","../src/config/schema.ts","../src/config/migration.ts","../src/config/merge.ts","../src/errors/codes.ts","../src/errors/index.ts","../src/config/service.ts","../src/git/utils.ts","../src/vectordb/version.ts","../src/indexer/scanner.ts","../src/indexer/symbol-extractor.ts","../src/indexer/ast/parser.ts","../src/indexer/ast/complexity/cyclomatic.ts","../src/indexer/ast/complexity/cognitive.ts","../src/indexer/ast/complexity/halstead.ts","../src/indexer/ast/complexity/index.ts","../src/indexer/ast/symbols.ts","../src/indexer/ast/traversers/typescript.ts","../src/indexer/ast/traversers/php.ts","../src/indexer/ast/traversers/python.ts","../src/indexer/ast/traversers/index.ts","../src/indexer/ast/chunker.ts","../src/indexer/liquid-chunker.ts","../src/indexer/json-template-chunker.ts","../src/indexer/chunker.ts","../src/embeddings/local.ts","../src/embeddings/types.ts","../src/vectordb/relevance.ts","../src/vectordb/intent-classifier.ts","../src/vectordb/boosting/types.ts","../src/vectordb/boosting/strategies.ts","../src/vectordb/boosting/composer.ts","../src/vectordb/boosting/index.ts","../src/vectordb/query.ts","../src/vectordb/batch-insert.ts","../src/vectordb/maintenance.ts","../src/vectordb/lancedb.ts","../src/indexer/manifest.ts","../src/git/tracker.ts","../src/utils/result.ts","../src/indexer/incremental.ts","../src/indexer/change-detector.ts","../src/utils/loading-messages.ts","../src/indexer/progress-tracker.ts","../src/indexer/index.ts","../src/cli/index.ts","../src/cli/init.ts","../src/utils/banner.ts","../src/config/migration-manager.ts","../src/frameworks/detector-service.ts","../src/frameworks/types.ts","../src/frameworks/nodejs/detector.ts","../src/frameworks/nodejs/config.ts","../src/frameworks/php/detector.ts","../src/frameworks/php/config.ts","../src/frameworks/laravel/detector.ts","../src/frameworks/laravel/config.ts","../src/frameworks/shopify/detector.ts","../src/frameworks/shopify/config.ts","../src/frameworks/registry.ts","../src/cli/status.ts","../src/cli/index-cmd.ts","../src/cli/serve.ts","../src/mcp/server.ts","../src/mcp/utils/zod-to-json-schema.ts","../src/mcp/schemas/search.schema.ts","../src/mcp/schemas/similarity.schema.ts","../src/mcp/schemas/file.schema.ts","../src/mcp/schemas/symbols.schema.ts","../src/mcp/schemas/dependents.schema.ts","../src/mcp/schemas/complexity.schema.ts","../src/mcp/tools.ts","../src/mcp/utils/tool-wrapper.ts","../src/mcp/handlers/semantic-search.ts","../src/mcp/handlers/find-similar.ts","../src/mcp/utils/path-matching.ts","../src/mcp/handlers/get-files-context.ts","../src/mcp/handlers/list-functions.ts","../src/mcp/handlers/get-dependents.ts","../src/mcp/handlers/get-complexity.ts","../src/insights/types.ts","../src/indexer/dependency-analyzer.ts","../src/insights/complexity-analyzer.ts","../src/mcp/handlers/index.ts","../src/watcher/index.ts","../src/cli/complexity.ts","../src/insights/formatters/text.ts","../src/insights/formatters/json.ts","../src/insights/formatters/sarif.ts","../src/insights/formatters/index.ts","../src/index.ts"],"sourcesContent":["import { createRequire } from 'module';\nimport { fileURLToPath } from 'url';\nimport { dirname, join } from 'path';\n\n/**\n * Centralized package version loader.\n * Handles different build output structures (development vs production).\n * \n * Build scenarios:\n * - Development (ts-node): src/utils/version.ts → ../package.json\n * - Production (dist): dist/utils/version.js → ../package.json\n * - Nested builds: dist/something/version.js → ../../package.json\n */\n\n// Setup require for ESM\nconst __filename = fileURLToPath(import.meta.url);\nconst __dirname = dirname(__filename);\nconst require = createRequire(import.meta.url);\n\nlet packageJson: { version: string; name?: string };\n\ntry {\n  // Try relative to current file (works in most scenarios)\n  packageJson = require(join(__dirname, '../package.json'));\n} catch {\n  try {\n    // Fallback: go up one more level (nested build output)\n    packageJson = require(join(__dirname, '../../package.json'));\n  } catch {\n    // Last resort: hardcoded fallback (should never happen in production)\n    console.warn('[Lien] Warning: Could not load package.json, using fallback version');\n    packageJson = { version: '0.0.0-unknown' };\n  }\n}\n\n/**\n * Get the current package version\n */\nexport function getPackageVersion(): string {\n  return packageJson.version;\n}\n\n/**\n * Get the full package.json (for compatibility)\n */\nexport function getPackageInfo(): { version: string; name?: string } {\n  return packageJson;\n}\n\n","/**\n * Centralized constants for the Lien project.\n * This file contains all magic numbers and configuration defaults\n * to ensure consistency across the codebase.\n */\n\nimport { getPackageVersion } from './utils/version.js';\n\n// Chunking settings\nexport const DEFAULT_CHUNK_SIZE = 75;\nexport const DEFAULT_CHUNK_OVERLAP = 10;\n\n// Concurrency and batching\nexport const DEFAULT_CONCURRENCY = 4;\nexport const DEFAULT_EMBEDDING_BATCH_SIZE = 50;\n\n// Micro-batching for event loop yielding\n// Process N embeddings at a time, then yield to event loop\n// This prevents UI freezing during CPU-intensive embedding generation\nexport const EMBEDDING_MICRO_BATCH_SIZE = 10;\n\n// Vector database batch size limits\n// Maximum batch size before splitting (prevents LanceDB errors on very large batches)\nexport const VECTOR_DB_MAX_BATCH_SIZE = 1000;\n// Minimum batch size for retry logic (stop splitting below this size)\nexport const VECTOR_DB_MIN_BATCH_SIZE = 10;\n\n// Embedding model configuration\nexport const EMBEDDING_DIMENSIONS = 384; // all-MiniLM-L6-v2\nexport const DEFAULT_EMBEDDING_MODEL = 'Xenova/all-MiniLM-L6-v2';\n\n// MCP server configuration\nexport const DEFAULT_PORT = 7133; // LIEN in leetspeak\nexport const VERSION_CHECK_INTERVAL_MS = 2000;\n\n// Git detection\nexport const DEFAULT_GIT_POLL_INTERVAL_MS = 10000; // Check every 10 seconds\n\n// File watching\nexport const DEFAULT_DEBOUNCE_MS = 1000;\n\n// Configuration version - always matches package version\n// Config format is tied to the package release that introduces it\nexport const CURRENT_CONFIG_VERSION = getPackageVersion();\n\n// Index format version - bump on ANY breaking change to indexing\n// Examples that require version bump:\n// - Chunking algorithm changes\n// - Embedding model changes (e.g., switch from all-MiniLM-L6-v2 to another model)\n// - Vector DB schema changes (new metadata fields)\n// - Metadata structure changes\n// v2: AST-based chunking + enhanced metadata (symbolName, complexity, etc.)\n// v3: Added cognitiveComplexity field to schema\n// v4: Added Halstead metrics (volume, difficulty, effort, bugs)\nexport const INDEX_FORMAT_VERSION = 4;\n\n","import {\n  DEFAULT_CHUNK_SIZE,\n  DEFAULT_CHUNK_OVERLAP,\n  DEFAULT_CONCURRENCY,\n  DEFAULT_EMBEDDING_BATCH_SIZE,\n  DEFAULT_PORT,\n  DEFAULT_GIT_POLL_INTERVAL_MS,\n  DEFAULT_DEBOUNCE_MS,\n  CURRENT_CONFIG_VERSION,\n} from '../constants.js';\n\n/**\n * Framework-specific configuration\n */\nexport interface FrameworkConfig {\n  include: string[];     // File patterns relative to framework path\n  exclude: string[];     // Exclude patterns relative to framework path\n}\n\n/**\n * Framework instance in a monorepo\n */\nexport interface FrameworkInstance {\n  name: string;          // 'nodejs', 'laravel'\n  path: string;          // '.', 'cognito-backend', 'packages/cli'\n  enabled: boolean;\n  config: FrameworkConfig;\n}\n\n/**\n * Main Lien configuration supporting monorepo setups\n */\nexport interface LienConfig {\n  version: string;\n  core: {\n    chunkSize: number;\n    chunkOverlap: number;\n    concurrency: number;\n    embeddingBatchSize: number;\n  };\n  chunking: {\n    useAST: boolean;          // Enable AST-based chunking (v0.13.0)\n    astFallback: 'line-based' | 'error';  // Fallback strategy on AST errors\n  };\n  mcp: {\n    port: number;\n    transport: 'stdio' | 'socket';\n    autoIndexOnFirstRun: boolean;\n  };\n  gitDetection: {\n    enabled: boolean;\n    pollIntervalMs: number;\n  };\n  fileWatching: {\n    enabled: boolean;\n    debounceMs: number;\n  };\n  complexity?: {\n    enabled: boolean;\n    thresholds: {\n      testPaths: number;             // 🔀 Max test paths per function (default: 15)\n      mentalLoad: number;            // 🧠 Max mental load score (default: 15)\n      timeToUnderstandMinutes?: number;  // ⏱️ Max minutes to understand (default: 60)\n      estimatedBugs?: number;            // 🐛 Max estimated bugs (default: 1.5)\n    };\n    // Severity multipliers are hardcoded: warning = 1x threshold, error = 2x threshold\n  };\n  frameworks: FrameworkInstance[];\n}\n\n/**\n * Legacy config format for backwards compatibility\n * @deprecated Use LienConfig with frameworks array instead\n */\nexport interface LegacyLienConfig {\n  version: string;\n  indexing: {\n    exclude: string[];\n    include: string[];\n    chunkSize: number;\n    chunkOverlap: number;\n    concurrency: number;\n    embeddingBatchSize: number;\n  };\n  mcp: {\n    port: number;\n    transport: 'stdio' | 'socket';\n    autoIndexOnFirstRun: boolean;\n  };\n  gitDetection: {\n    enabled: boolean;\n    pollIntervalMs: number;\n  };\n  fileWatching: {\n    enabled: boolean;\n    debounceMs: number;\n  };\n}\n\n/**\n * Type guard to check if a config is the legacy format\n * @param config - Config object to check\n * @returns True if config is LegacyLienConfig\n */\nexport function isLegacyConfig(\n  config: LienConfig | LegacyLienConfig\n): config is LegacyLienConfig {\n  return 'indexing' in config && !('frameworks' in config);\n}\n\n/**\n * Type guard to check if a config is the modern format\n * @param config - Config object to check\n * @returns True if config is LienConfig\n */\nexport function isModernConfig(\n  config: LienConfig | LegacyLienConfig\n): config is LienConfig {\n  return 'frameworks' in config;\n}\n\n/**\n * Default configuration with empty frameworks array\n * Frameworks should be detected and added via lien init\n */\nexport const defaultConfig: LienConfig = {\n  version: CURRENT_CONFIG_VERSION,\n  core: {\n    chunkSize: DEFAULT_CHUNK_SIZE,\n    chunkOverlap: DEFAULT_CHUNK_OVERLAP,\n    concurrency: DEFAULT_CONCURRENCY,\n    embeddingBatchSize: DEFAULT_EMBEDDING_BATCH_SIZE,\n  },\n  chunking: {\n    useAST: true,              // AST-based chunking enabled by default (v0.13.0)\n    astFallback: 'line-based', // Fallback to line-based on errors\n  },\n  mcp: {\n    port: DEFAULT_PORT,\n    transport: 'stdio',\n    autoIndexOnFirstRun: true,\n  },\n  gitDetection: {\n    enabled: true,\n    pollIntervalMs: DEFAULT_GIT_POLL_INTERVAL_MS,\n  },\n  fileWatching: {\n    enabled: true, // Enabled by default (fast with incremental indexing!)\n    debounceMs: DEFAULT_DEBOUNCE_MS,\n  },\n  complexity: {\n    enabled: true,\n    thresholds: {\n      testPaths: 15,            // 🔀 Max test paths per function\n      mentalLoad: 15,           // 🧠 Max mental load score\n      timeToUnderstandMinutes: 60,  // ⏱️ Functions taking >1 hour to understand\n      estimatedBugs: 1.5,           // 🐛 Functions estimated to have >1.5 bugs\n    },\n  },\n  frameworks: [], // Will be populated by lien init via framework detection\n};\n\n","import fs from 'fs/promises';\nimport path from 'path';\nimport { LienConfig, LegacyLienConfig, FrameworkInstance, defaultConfig } from './schema.js';\nimport { CURRENT_CONFIG_VERSION } from '../constants.js';\n\n/**\n * Checks if a config object needs migration from v0.2.0 to v0.3.0\n */\nexport function needsMigration(config: any): boolean {\n  // Check if config uses old structure:\n  // - Has 'indexing' field instead of 'core' and 'frameworks'\n  // - Or has no 'frameworks' field at all\n  // - Or version is explicitly set to something < 0.3.0\n  // - Or missing 'chunking' field (v0.13.0)\n  if (!config) {\n    return false;\n  }\n\n  // If missing chunking config, needs migration to v0.13.0\n  if (config.frameworks !== undefined && !config.chunking) {\n    return true;\n  }\n\n  // If it has frameworks array and chunking, it's already in new format\n  if (config.frameworks !== undefined && config.chunking !== undefined) {\n    return false;\n  }\n\n  // If it has 'indexing' field, it's the old format\n  if (config.indexing !== undefined) {\n    return true;\n  }\n\n  // If version is explicitly < 0.3.0\n  if (config.version && config.version.startsWith('0.2')) {\n    return true;\n  }\n\n  return false;\n}\n\n/**\n * Migrates a v0.2.0 config to v0.3.0+ format\n */\nexport function migrateConfig(oldConfig: Partial<LegacyLienConfig | LienConfig>): LienConfig {\n  // Start with default config structure\n  const newConfig: LienConfig = {\n    version: CURRENT_CONFIG_VERSION,\n    core: {\n      chunkSize: (oldConfig as any).indexing?.chunkSize ?? (oldConfig as any).core?.chunkSize ?? defaultConfig.core.chunkSize,\n      chunkOverlap: (oldConfig as any).indexing?.chunkOverlap ?? (oldConfig as any).core?.chunkOverlap ?? defaultConfig.core.chunkOverlap,\n      concurrency: (oldConfig as any).indexing?.concurrency ?? (oldConfig as any).core?.concurrency ?? defaultConfig.core.concurrency,\n      embeddingBatchSize: (oldConfig as any).indexing?.embeddingBatchSize ?? (oldConfig as any).core?.embeddingBatchSize ?? defaultConfig.core.embeddingBatchSize,\n    },\n    chunking: {\n      useAST: (oldConfig as any).chunking?.useAST ?? defaultConfig.chunking.useAST,\n      astFallback: (oldConfig as any).chunking?.astFallback ?? defaultConfig.chunking.astFallback,\n    },\n    mcp: {\n      port: oldConfig.mcp?.port ?? defaultConfig.mcp.port,\n      transport: oldConfig.mcp?.transport ?? defaultConfig.mcp.transport,\n      autoIndexOnFirstRun: oldConfig.mcp?.autoIndexOnFirstRun ?? defaultConfig.mcp.autoIndexOnFirstRun,\n    },\n    gitDetection: {\n      enabled: oldConfig.gitDetection?.enabled ?? defaultConfig.gitDetection.enabled,\n      pollIntervalMs: oldConfig.gitDetection?.pollIntervalMs ?? defaultConfig.gitDetection.pollIntervalMs,\n    },\n    fileWatching: {\n      enabled: oldConfig.fileWatching?.enabled ?? defaultConfig.fileWatching.enabled,\n      debounceMs: oldConfig.fileWatching?.debounceMs ?? defaultConfig.fileWatching.debounceMs,\n    },\n    frameworks: (oldConfig as any).frameworks ?? [],\n  };\n\n  // Convert old indexing config to a single \"generic\" framework (only for legacy configs)\n  if ((oldConfig as any).indexing && newConfig.frameworks.length === 0) {\n    const genericFramework: FrameworkInstance = {\n      name: 'generic',\n      path: '.',\n      enabled: true,\n      config: {\n        include: (oldConfig as any).indexing.include ?? ['**/*.{ts,tsx,js,jsx,py,php,go,rs,java,c,cpp,cs}'],\n        exclude: (oldConfig as any).indexing.exclude ?? [\n          '**/node_modules/**',\n          '**/dist/**',\n          '**/build/**',\n          '**/.git/**',\n          '**/coverage/**',\n          '**/.next/**',\n          '**/.nuxt/**',\n          '**/vendor/**',\n        ],\n      },\n    };\n\n    newConfig.frameworks.push(genericFramework);\n  } else if (newConfig.frameworks.length === 0) {\n    // No indexing config and no frameworks present, use defaults for generic framework\n    const genericFramework: FrameworkInstance = {\n      name: 'generic',\n      path: '.',\n      enabled: true,\n      config: {\n        include: ['**/*.{ts,tsx,js,jsx,py,php,go,rs,java,c,cpp,cs}'],\n        exclude: [\n          '**/node_modules/**',\n          '**/dist/**',\n          '**/build/**',\n          '**/.git/**',\n          '**/coverage/**',\n          '**/.next/**',\n          '**/.nuxt/**',\n          '**/vendor/**',\n        ],\n      },\n    };\n\n    newConfig.frameworks.push(genericFramework);\n  }\n\n  return newConfig;\n}\n\n/**\n * Migrates config file and creates backup\n */\nexport async function migrateConfigFile(rootDir: string = process.cwd()): Promise<{\n  migrated: boolean;\n  backupPath?: string;\n  config: LienConfig;\n}> {\n  const configPath = path.join(rootDir, '.lien.config.json');\n\n  try {\n    // Read existing config\n    const configContent = await fs.readFile(configPath, 'utf-8');\n    const oldConfig = JSON.parse(configContent);\n\n    // Check if migration is needed\n    if (!needsMigration(oldConfig)) {\n      return {\n        migrated: false,\n        config: oldConfig as LienConfig,\n      };\n    }\n\n    // Perform migration\n    const newConfig = migrateConfig(oldConfig);\n\n    // Create backup\n    const backupPath = `${configPath}.v0.2.0.backup`;\n    await fs.copyFile(configPath, backupPath);\n\n    // Write migrated config\n    await fs.writeFile(configPath, JSON.stringify(newConfig, null, 2) + '\\n', 'utf-8');\n\n    return {\n      migrated: true,\n      backupPath,\n      config: newConfig,\n    };\n  } catch (error) {\n    // If config doesn't exist, return default\n    if ((error as NodeJS.ErrnoException).code === 'ENOENT') {\n      return {\n        migrated: false,\n        config: defaultConfig,\n      };\n    }\n    throw error;\n  }\n}\n\n","import { LienConfig } from './schema.js';\n\n/**\n * Deep merges user config with defaults, preserving user customizations.\n * User values always take precedence over defaults.\n * \n * @param defaults - The default configuration\n * @param user - The user's partial configuration\n * @returns Complete merged configuration\n */\nexport function deepMergeConfig(defaults: LienConfig, user: Partial<LienConfig>): LienConfig {\n  return {\n    version: user.version ?? defaults.version,\n    core: {\n      ...defaults.core,\n      ...user.core,\n    },\n    chunking: {\n      ...defaults.chunking,\n      ...user.chunking,\n    },\n    mcp: {\n      ...defaults.mcp,\n      ...user.mcp,\n    },\n    gitDetection: {\n      ...defaults.gitDetection,\n      ...user.gitDetection,\n    },\n    fileWatching: {\n      ...defaults.fileWatching,\n      ...user.fileWatching,\n    },\n    complexity: user.complexity ? {\n      enabled: user.complexity.enabled ?? defaults.complexity?.enabled ?? true,\n      thresholds: {\n        ...defaults.complexity?.thresholds,\n        ...(user.complexity.thresholds || {}),\n      },\n    } : defaults.complexity,\n    frameworks: user.frameworks ?? defaults.frameworks,\n  };\n}\n\n/**\n * Detects new fields that exist in the 'after' config but not in the 'before' config.\n * Returns a list of human-readable field paths.\n * \n * @param before - The existing config (potentially missing fields)\n * @param after - The complete config with all fields\n * @returns Array of new field paths (e.g., [\"mcp.autoIndexOnFirstRun\", \"gitDetection\"])\n */\nexport function detectNewFields(before: Record<string, any>, after: Record<string, any>): string[] {\n  const newFields: string[] = [];\n\n  // Check top-level sections\n  for (const key of Object.keys(after)) {\n    if (!(key in before)) {\n      newFields.push(key);\n      continue;\n    }\n\n    // Check nested fields for object sections\n    if (typeof after[key] === 'object' && after[key] !== null && !Array.isArray(after[key])) {\n      const beforeSection = (before[key] as Record<string, any>) || {};\n      const afterSection = after[key] as Record<string, any>;\n\n      for (const nestedKey of Object.keys(afterSection)) {\n        if (!(nestedKey in beforeSection)) {\n          newFields.push(`${key}.${nestedKey}`);\n        }\n      }\n    }\n  }\n\n  return newFields;\n}\n\n","/**\n * Error codes for all Lien-specific errors.\n * Used to identify error types programmatically.\n */\nexport enum LienErrorCode {\n  // Configuration\n  CONFIG_NOT_FOUND = 'CONFIG_NOT_FOUND',\n  CONFIG_INVALID = 'CONFIG_INVALID',\n  \n  // Index\n  INDEX_NOT_FOUND = 'INDEX_NOT_FOUND',\n  INDEX_CORRUPTED = 'INDEX_CORRUPTED',\n  \n  // Embeddings\n  EMBEDDING_MODEL_FAILED = 'EMBEDDING_MODEL_FAILED',\n  EMBEDDING_GENERATION_FAILED = 'EMBEDDING_GENERATION_FAILED',\n  \n  // File System\n  FILE_NOT_FOUND = 'FILE_NOT_FOUND',\n  FILE_NOT_READABLE = 'FILE_NOT_READABLE',\n  INVALID_PATH = 'INVALID_PATH',\n  \n  // Tool Input\n  INVALID_INPUT = 'INVALID_INPUT',\n  \n  // System\n  INTERNAL_ERROR = 'INTERNAL_ERROR',\n}\n\n","import { LienErrorCode } from './codes.js';\n\n// Re-export for consumers\nexport { LienErrorCode } from './codes.js';\n\n/**\n * Severity levels for errors\n */\nexport type ErrorSeverity = 'low' | 'medium' | 'high' | 'critical';\n\n/**\n * Base error class for all Lien-specific errors\n */\nexport class LienError extends Error {\n  constructor(\n    message: string,\n    public readonly code: LienErrorCode,\n    public readonly context?: Record<string, unknown>,\n    public readonly severity: ErrorSeverity = 'medium',\n    public readonly recoverable: boolean = true,\n    public readonly retryable: boolean = false\n  ) {\n    super(message);\n    this.name = 'LienError';\n    \n    // Maintains proper stack trace for where our error was thrown (only available on V8)\n    if (Error.captureStackTrace) {\n      Error.captureStackTrace(this, this.constructor);\n    }\n  }\n  \n  /**\n   * Serialize error to JSON for MCP responses\n   */\n  toJSON() {\n    return {\n      error: this.message,\n      code: this.code,\n      severity: this.severity,\n      recoverable: this.recoverable,\n      context: this.context,\n    };\n  }\n  \n  /**\n   * Check if this error is retryable\n   */\n  isRetryable(): boolean {\n    return this.retryable;\n  }\n  \n  /**\n   * Check if this error is recoverable\n   */\n  isRecoverable(): boolean {\n    return this.recoverable;\n  }\n}\n\n/**\n * Configuration-related errors (loading, parsing, migration)\n */\nexport class ConfigError extends LienError {\n  constructor(message: string, context?: Record<string, unknown>) {\n    super(message, LienErrorCode.CONFIG_INVALID, context, 'medium', true, false);\n    this.name = 'ConfigError';\n  }\n}\n\n/**\n * Indexing-related errors (file processing, chunking)\n */\nexport class IndexingError extends LienError {\n  constructor(\n    message: string,\n    public readonly file?: string,\n    context?: Record<string, unknown>\n  ) {\n    super(message, LienErrorCode.INTERNAL_ERROR, { ...context, file }, 'medium', true, false);\n    this.name = 'IndexingError';\n  }\n}\n\n/**\n * Embedding generation errors\n */\nexport class EmbeddingError extends LienError {\n  constructor(message: string, context?: Record<string, unknown>) {\n    super(message, LienErrorCode.EMBEDDING_GENERATION_FAILED, context, 'high', true, true);\n    this.name = 'EmbeddingError';\n  }\n}\n\n/**\n * Vector database errors (connection, query, storage)\n */\nexport class DatabaseError extends LienError {\n  constructor(message: string, context?: Record<string, unknown>) {\n    super(message, LienErrorCode.INTERNAL_ERROR, context, 'high', true, true);\n    this.name = 'DatabaseError';\n  }\n}\n\n/**\n * Helper function to wrap unknown errors with context\n * @param error - Unknown error object to wrap\n * @param context - Context message describing what operation failed\n * @param additionalContext - Optional additional context data\n * @returns LienError with proper message and context\n */\nexport function wrapError(\n  error: unknown,\n  context: string,\n  additionalContext?: Record<string, unknown>\n): LienError {\n  const message = error instanceof Error ? error.message : String(error);\n  const stack = error instanceof Error ? error.stack : undefined;\n  \n  const wrappedError = new LienError(\n    `${context}: ${message}`,\n    LienErrorCode.INTERNAL_ERROR,\n    additionalContext\n  );\n  \n  // Preserve original stack trace if available\n  if (stack) {\n    wrappedError.stack = `${wrappedError.stack}\\n\\nCaused by:\\n${stack}`;\n  }\n  \n  return wrappedError;\n}\n\n/**\n * Type guard to check if an error is a LienError\n */\nexport function isLienError(error: unknown): error is LienError {\n  return error instanceof LienError;\n}\n\n/**\n * Extract error message from unknown error type\n * @param error - Unknown error object\n * @returns Error message string\n */\nexport function getErrorMessage(error: unknown): string {\n  if (error instanceof Error) {\n    return error.message;\n  }\n  return String(error);\n}\n\n/**\n * Extract stack trace from unknown error type\n * @param error - Unknown error object\n * @returns Stack trace string or undefined\n */\nexport function getErrorStack(error: unknown): string | undefined {\n  if (error instanceof Error) {\n    return error.stack;\n  }\n  return undefined;\n}\n\n","import fs from 'fs/promises';\nimport path from 'path';\nimport { LienConfig, LegacyLienConfig, defaultConfig, isLegacyConfig, isModernConfig } from './schema.js';\nimport { deepMergeConfig } from './merge.js';\nimport { needsMigration as checkNeedsMigration, migrateConfig as performMigration } from './migration.js';\nimport { ConfigError, wrapError } from '../errors/index.js';\n\n/**\n * Validation result with errors and warnings\n */\nexport interface ValidationResult {\n  valid: boolean;\n  errors: string[];\n  warnings: string[];\n}\n\n/**\n * Migration result with status and config\n */\nexport interface MigrationResult {\n  migrated: boolean;\n  backupPath?: string;\n  config: LienConfig;\n}\n\n/**\n * ConfigService encapsulates all configuration operations including\n * loading, saving, migration, and validation.\n * \n * This service provides a single point of truth for config management\n * with comprehensive error handling and validation.\n */\nexport class ConfigService {\n  private static readonly CONFIG_FILENAME = '.lien.config.json';\n  \n  /**\n   * Load configuration from the specified directory.\n   * Automatically handles migration if needed.\n   * \n   * @param rootDir - Root directory containing the config file\n   * @returns Loaded and validated configuration\n   * @throws {ConfigError} If config is invalid or cannot be loaded\n   */\n  async load(rootDir: string = process.cwd()): Promise<LienConfig> {\n    const configPath = this.getConfigPath(rootDir);\n    \n    try {\n      const configContent = await fs.readFile(configPath, 'utf-8');\n      const userConfig = JSON.parse(configContent);\n      \n      // Check if migration is needed\n      if (this.needsMigration(userConfig)) {\n        console.log('🔄 Migrating config from v0.2.0 to v0.3.0...');\n        \n        const result = await this.migrate(rootDir);\n        \n        if (result.migrated && result.backupPath) {\n          const backupFilename = path.basename(result.backupPath);\n          console.log(`✅ Migration complete! Backup saved as ${backupFilename}`);\n          console.log('📝 Your config now uses the framework-based structure.');\n        }\n        \n        return result.config;\n      }\n      \n      // Merge with defaults first\n      const mergedConfig = deepMergeConfig(defaultConfig, userConfig as Partial<LienConfig>);\n      \n      // Then validate the merged config\n      const validation = this.validate(mergedConfig);\n      if (!validation.valid) {\n        throw new ConfigError(\n          `Invalid configuration:\\n${validation.errors.join('\\n')}`,\n          { errors: validation.errors, warnings: validation.warnings }\n        );\n      }\n      \n      // Show warnings if any\n      if (validation.warnings.length > 0) {\n        console.warn('⚠️  Configuration warnings:');\n        validation.warnings.forEach(warning => console.warn(`   ${warning}`));\n      }\n      \n      return mergedConfig;\n    } catch (error) {\n      if ((error as NodeJS.ErrnoException).code === 'ENOENT') {\n        // Config doesn't exist, return defaults\n        return defaultConfig;\n      }\n      \n      if (error instanceof ConfigError) {\n        throw error;\n      }\n      \n      if (error instanceof SyntaxError) {\n        throw new ConfigError(\n          'Failed to parse config file: Invalid JSON syntax',\n          { path: configPath, originalError: error.message }\n        );\n      }\n      \n      throw wrapError(error, 'Failed to load configuration', { path: configPath });\n    }\n  }\n  \n  /**\n   * Save configuration to the specified directory.\n   * Validates the config before saving.\n   * \n   * @param rootDir - Root directory to save the config file\n   * @param config - Configuration to save\n   * @throws {ConfigError} If config is invalid or cannot be saved\n   */\n  async save(rootDir: string, config: LienConfig): Promise<void> {\n    const configPath = this.getConfigPath(rootDir);\n    \n    // Validate before saving\n    const validation = this.validate(config);\n    if (!validation.valid) {\n      throw new ConfigError(\n        `Cannot save invalid configuration:\\n${validation.errors.join('\\n')}`,\n        { errors: validation.errors }\n      );\n    }\n    \n    try {\n      const configJson = JSON.stringify(config, null, 2) + '\\n';\n      await fs.writeFile(configPath, configJson, 'utf-8');\n    } catch (error) {\n      throw wrapError(error, 'Failed to save configuration', { path: configPath });\n    }\n  }\n  \n  /**\n   * Check if a configuration file exists in the specified directory.\n   * \n   * @param rootDir - Root directory to check\n   * @returns True if config file exists\n   */\n  async exists(rootDir: string = process.cwd()): Promise<boolean> {\n    const configPath = this.getConfigPath(rootDir);\n    try {\n      await fs.access(configPath);\n      return true;\n    } catch {\n      return false;\n    }\n  }\n  \n  /**\n   * Migrate configuration from v0.2.0 to v0.3.0 format.\n   * Creates a backup of the original config file.\n   * \n   * @param rootDir - Root directory containing the config file\n   * @returns Migration result with status and new config\n   * @throws {ConfigError} If migration fails\n   */\n  async migrate(rootDir: string = process.cwd()): Promise<MigrationResult> {\n    const configPath = this.getConfigPath(rootDir);\n    \n    try {\n      // Read existing config\n      const configContent = await fs.readFile(configPath, 'utf-8');\n      const oldConfig = JSON.parse(configContent);\n      \n      // Check if migration is needed\n      if (!this.needsMigration(oldConfig)) {\n        return {\n          migrated: false,\n          config: oldConfig as LienConfig,\n        };\n      }\n      \n      // Perform migration\n      const newConfig = performMigration(oldConfig);\n      \n      // Validate migrated config\n      const validation = this.validate(newConfig);\n      if (!validation.valid) {\n        throw new ConfigError(\n          `Migration produced invalid configuration:\\n${validation.errors.join('\\n')}`,\n          { errors: validation.errors }\n        );\n      }\n      \n      // Create backup\n      const backupPath = `${configPath}.v0.2.0.backup`;\n      await fs.copyFile(configPath, backupPath);\n      \n      // Write migrated config\n      await this.save(rootDir, newConfig);\n      \n      return {\n        migrated: true,\n        backupPath,\n        config: newConfig,\n      };\n    } catch (error) {\n      if ((error as NodeJS.ErrnoException).code === 'ENOENT') {\n        return {\n          migrated: false,\n          config: defaultConfig,\n        };\n      }\n      \n      if (error instanceof ConfigError) {\n        throw error;\n      }\n      \n      throw wrapError(error, 'Configuration migration failed', { path: configPath });\n    }\n  }\n  \n  /**\n   * Check if a config object needs migration from v0.2.0 to v0.3.0.\n   * \n   * @param config - Config object to check\n   * @returns True if migration is needed\n   */\n  needsMigration(config: unknown): boolean {\n    return checkNeedsMigration(config);\n  }\n  \n  /**\n   * Validate a configuration object.\n   * Checks all constraints and returns detailed validation results.\n   * \n   * @param config - Configuration to validate\n   * @returns Validation result with errors and warnings\n   */\n  validate(config: unknown): ValidationResult {\n    const errors: string[] = [];\n    const warnings: string[] = [];\n    \n    // Type check\n    if (!config || typeof config !== 'object') {\n      return {\n        valid: false,\n        errors: ['Configuration must be an object'],\n        warnings: [],\n      };\n    }\n    \n    const cfg = config as Partial<LienConfig>;\n    \n    // Check for required top-level fields\n    if (!cfg.version) {\n      errors.push('Missing required field: version');\n    }\n    \n    // Validate based on config type\n    if (isModernConfig(cfg as LienConfig | LegacyLienConfig)) {\n      this.validateModernConfig(cfg as LienConfig, errors, warnings);\n    } else if (isLegacyConfig(cfg as LienConfig | LegacyLienConfig)) {\n      this.validateLegacyConfig(cfg as LegacyLienConfig, errors, warnings);\n    } else {\n      errors.push('Configuration format not recognized. Must have either \"frameworks\" or \"indexing\" field');\n    }\n    \n    return {\n      valid: errors.length === 0,\n      errors,\n      warnings,\n    };\n  }\n  \n  /**\n   * Validate a partial configuration object.\n   * Useful for validating user input before merging with defaults.\n   * \n   * @param config - Partial configuration to validate\n   * @returns Validation result with errors and warnings\n   */\n  validatePartial(config: Partial<LienConfig>): ValidationResult {\n    const errors: string[] = [];\n    const warnings: string[] = [];\n    \n    // Validate core settings if present\n    if (config.core) {\n      this.validateCoreConfig(config.core, errors, warnings);\n    }\n    \n    // Validate MCP settings if present\n    if (config.mcp) {\n      this.validateMCPConfig(config.mcp, errors, warnings);\n    }\n    \n    // Validate git detection settings if present\n    if (config.gitDetection) {\n      this.validateGitDetectionConfig(config.gitDetection, errors, warnings);\n    }\n    \n    // Validate file watching settings if present\n    if (config.fileWatching) {\n      this.validateFileWatchingConfig(config.fileWatching, errors, warnings);\n    }\n    \n    // Validate frameworks if present\n    if (config.frameworks) {\n      this.validateFrameworks(config.frameworks, errors, warnings);\n    }\n    \n    return {\n      valid: errors.length === 0,\n      errors,\n      warnings,\n    };\n  }\n  \n  /**\n   * Get the full path to the config file\n   */\n  private getConfigPath(rootDir: string): string {\n    return path.join(rootDir, ConfigService.CONFIG_FILENAME);\n  }\n  \n  /**\n   * Validate modern (v0.3.0+) configuration\n   */\n  private validateModernConfig(\n    config: LienConfig,\n    errors: string[],\n    warnings: string[]\n  ): void {\n    // Validate core settings\n    if (!config.core) {\n      errors.push('Missing required field: core');\n      return;\n    }\n    this.validateCoreConfig(config.core, errors, warnings);\n    \n    // Validate MCP settings\n    if (!config.mcp) {\n      errors.push('Missing required field: mcp');\n      return;\n    }\n    this.validateMCPConfig(config.mcp, errors, warnings);\n    \n    // Validate git detection settings\n    if (!config.gitDetection) {\n      errors.push('Missing required field: gitDetection');\n      return;\n    }\n    this.validateGitDetectionConfig(config.gitDetection, errors, warnings);\n    \n    // Validate file watching settings\n    if (!config.fileWatching) {\n      errors.push('Missing required field: fileWatching');\n      return;\n    }\n    this.validateFileWatchingConfig(config.fileWatching, errors, warnings);\n    \n    // Validate frameworks\n    if (!config.frameworks) {\n      errors.push('Missing required field: frameworks');\n      return;\n    }\n    this.validateFrameworks(config.frameworks, errors, warnings);\n  }\n  \n  /**\n   * Validate legacy (v0.2.0) configuration\n   */\n  private validateLegacyConfig(\n    config: LegacyLienConfig,\n    errors: string[],\n    warnings: string[]\n  ): void {\n    warnings.push('Using legacy configuration format. Consider running \"lien init\" to migrate to v0.3.0');\n    \n    // Validate indexing settings\n    if (!config.indexing) {\n      errors.push('Missing required field: indexing');\n      return;\n    }\n    \n    const { indexing } = config;\n    \n    if (typeof indexing.chunkSize !== 'number' || indexing.chunkSize <= 0) {\n      errors.push('indexing.chunkSize must be a positive number');\n    }\n    \n    if (typeof indexing.chunkOverlap !== 'number' || indexing.chunkOverlap < 0) {\n      errors.push('indexing.chunkOverlap must be a non-negative number');\n    }\n    \n    if (typeof indexing.concurrency !== 'number' || indexing.concurrency < 1 || indexing.concurrency > 16) {\n      errors.push('indexing.concurrency must be between 1 and 16');\n    }\n    \n    if (typeof indexing.embeddingBatchSize !== 'number' || indexing.embeddingBatchSize <= 0) {\n      errors.push('indexing.embeddingBatchSize must be a positive number');\n    }\n    \n    // Validate MCP settings (same for both)\n    if (config.mcp) {\n      this.validateMCPConfig(config.mcp, errors, warnings);\n    }\n  }\n  \n  /**\n   * Validate core configuration settings\n   */\n  private validateCoreConfig(\n    core: Partial<LienConfig['core']>,\n    errors: string[],\n    warnings: string[]\n  ): void {\n    if (core.chunkSize !== undefined) {\n      if (typeof core.chunkSize !== 'number' || core.chunkSize <= 0) {\n        errors.push('core.chunkSize must be a positive number');\n      } else if (core.chunkSize < 50) {\n        warnings.push('core.chunkSize is very small (<50 lines). This may result in poor search quality');\n      } else if (core.chunkSize > 500) {\n        warnings.push('core.chunkSize is very large (>500 lines). This may impact performance');\n      }\n    }\n    \n    if (core.chunkOverlap !== undefined) {\n      if (typeof core.chunkOverlap !== 'number' || core.chunkOverlap < 0) {\n        errors.push('core.chunkOverlap must be a non-negative number');\n      }\n    }\n    \n    if (core.concurrency !== undefined) {\n      if (typeof core.concurrency !== 'number' || core.concurrency < 1 || core.concurrency > 16) {\n        errors.push('core.concurrency must be between 1 and 16');\n      }\n    }\n    \n    if (core.embeddingBatchSize !== undefined) {\n      if (typeof core.embeddingBatchSize !== 'number' || core.embeddingBatchSize <= 0) {\n        errors.push('core.embeddingBatchSize must be a positive number');\n      } else if (core.embeddingBatchSize > 100) {\n        warnings.push('core.embeddingBatchSize is very large (>100). This may cause memory issues');\n      }\n    }\n  }\n  \n  /**\n   * Validate MCP configuration settings\n   */\n  private validateMCPConfig(\n    mcp: Partial<LienConfig['mcp']>,\n    errors: string[],\n    _warnings: string[]\n  ): void {\n    if (mcp.port !== undefined) {\n      if (typeof mcp.port !== 'number' || mcp.port < 1024 || mcp.port > 65535) {\n        errors.push('mcp.port must be between 1024 and 65535');\n      }\n    }\n    \n    if (mcp.transport !== undefined) {\n      if (mcp.transport !== 'stdio' && mcp.transport !== 'socket') {\n        errors.push('mcp.transport must be either \"stdio\" or \"socket\"');\n      }\n    }\n    \n    if (mcp.autoIndexOnFirstRun !== undefined) {\n      if (typeof mcp.autoIndexOnFirstRun !== 'boolean') {\n        errors.push('mcp.autoIndexOnFirstRun must be a boolean');\n      }\n    }\n  }\n  \n  /**\n   * Validate git detection configuration settings\n   */\n  private validateGitDetectionConfig(\n    gitDetection: Partial<LienConfig['gitDetection']>,\n    errors: string[],\n    _warnings: string[]\n  ): void {\n    if (gitDetection.enabled !== undefined) {\n      if (typeof gitDetection.enabled !== 'boolean') {\n        errors.push('gitDetection.enabled must be a boolean');\n      }\n    }\n    \n    if (gitDetection.pollIntervalMs !== undefined) {\n      if (typeof gitDetection.pollIntervalMs !== 'number' || gitDetection.pollIntervalMs < 100) {\n        errors.push('gitDetection.pollIntervalMs must be at least 100ms');\n      } else if (gitDetection.pollIntervalMs < 1000) {\n        _warnings.push('gitDetection.pollIntervalMs is very short (<1s). This may impact performance');\n      }\n    }\n  }\n  \n  /**\n   * Validate file watching configuration settings\n   */\n  private validateFileWatchingConfig(\n    fileWatching: Partial<LienConfig['fileWatching']>,\n    errors: string[],\n    warnings: string[]\n  ): void {\n    if (fileWatching.enabled !== undefined) {\n      if (typeof fileWatching.enabled !== 'boolean') {\n        errors.push('fileWatching.enabled must be a boolean');\n      }\n    }\n    \n    if (fileWatching.debounceMs !== undefined) {\n      if (typeof fileWatching.debounceMs !== 'number' || fileWatching.debounceMs < 0) {\n        errors.push('fileWatching.debounceMs must be a non-negative number');\n      } else if (fileWatching.debounceMs < 100) {\n        warnings.push('fileWatching.debounceMs is very short (<100ms). This may cause excessive reindexing');\n      }\n    }\n  }\n  \n  /**\n   * Validate frameworks configuration\n   */\n  private validateFrameworks(\n    frameworks: unknown[],\n    errors: string[],\n    warnings: string[]\n  ): void {\n    if (!Array.isArray(frameworks)) {\n      errors.push('frameworks must be an array');\n      return;\n    }\n    \n    frameworks.forEach((framework, index) => {\n      if (!framework || typeof framework !== 'object') {\n        errors.push(`frameworks[${index}] must be an object`);\n        return;\n      }\n      \n      const fw = framework as Partial<any>;\n      \n      // Validate required fields\n      if (!fw.name) {\n        errors.push(`frameworks[${index}] missing required field: name`);\n      }\n      \n      if (fw.path === undefined) {\n        errors.push(`frameworks[${index}] missing required field: path`);\n      } else if (typeof fw.path !== 'string') {\n        errors.push(`frameworks[${index}].path must be a string`);\n      } else if (path.isAbsolute(fw.path)) {\n        errors.push(`frameworks[${index}].path must be relative, got: ${fw.path}`);\n      }\n      \n      if (fw.enabled === undefined) {\n        errors.push(`frameworks[${index}] missing required field: enabled`);\n      } else if (typeof fw.enabled !== 'boolean') {\n        errors.push(`frameworks[${index}].enabled must be a boolean`);\n      }\n      \n      if (!fw.config) {\n        errors.push(`frameworks[${index}] missing required field: config`);\n      } else {\n        this.validateFrameworkConfig(fw.config, `frameworks[${index}].config`, errors, warnings);\n      }\n    });\n  }\n  \n  /**\n   * Validate framework-specific configuration\n   */\n  private validateFrameworkConfig(\n    config: any,\n    prefix: string,\n    errors: string[],\n    _warnings: string[]\n  ): void {\n    if (!config || typeof config !== 'object') {\n      errors.push(`${prefix} must be an object`);\n      return;\n    }\n    \n    // Validate include patterns\n    if (!Array.isArray(config.include)) {\n      errors.push(`${prefix}.include must be an array`);\n    } else {\n      config.include.forEach((pattern: unknown, i: number) => {\n        if (typeof pattern !== 'string') {\n          errors.push(`${prefix}.include[${i}] must be a string`);\n        }\n      });\n    }\n    \n    // Validate exclude patterns\n    if (!Array.isArray(config.exclude)) {\n      errors.push(`${prefix}.exclude must be an array`);\n    } else {\n      config.exclude.forEach((pattern: unknown, i: number) => {\n        if (typeof pattern !== 'string') {\n          errors.push(`${prefix}.exclude[${i}] must be a string`);\n        }\n      });\n    }\n  }\n}\n\n// Export a singleton instance for convenience\nexport const configService = new ConfigService();\n\n","import { exec } from 'child_process';\nimport { promisify } from 'util';\nimport fs from 'fs/promises';\nimport path from 'path';\n\nconst execAsync = promisify(exec);\n\n/**\n * Checks if a directory is a git repository.\n * \n * @param rootDir - Directory to check\n * @returns true if directory is a git repo, false otherwise\n */\nexport async function isGitRepo(rootDir: string): Promise<boolean> {\n  try {\n    const gitDir = path.join(rootDir, '.git');\n    await fs.access(gitDir);\n    return true;\n  } catch {\n    return false;\n  }\n}\n\n/**\n * Gets the current git branch name.\n * \n * @param rootDir - Root directory of the git repository\n * @returns Branch name (e.g., \"main\", \"feature-branch\")\n * @throws Error if not a git repo or git command fails\n */\nexport async function getCurrentBranch(rootDir: string): Promise<string> {\n  try {\n    const { stdout } = await execAsync('git rev-parse --abbrev-ref HEAD', {\n      cwd: rootDir,\n      timeout: 5000, // 5 second timeout\n    });\n    return stdout.trim();\n  } catch (error) {\n    throw new Error(`Failed to get current branch: ${error}`);\n  }\n}\n\n/**\n * Gets the current git commit SHA (HEAD).\n * \n * @param rootDir - Root directory of the git repository\n * @returns Commit SHA (full 40-character hash)\n * @throws Error if not a git repo or git command fails\n */\nexport async function getCurrentCommit(rootDir: string): Promise<string> {\n  try {\n    const { stdout } = await execAsync('git rev-parse HEAD', {\n      cwd: rootDir,\n      timeout: 5000,\n    });\n    return stdout.trim();\n  } catch (error) {\n    throw new Error(`Failed to get current commit: ${error}`);\n  }\n}\n\n/**\n * Gets the list of files that changed between two git references.\n * \n * @param rootDir - Root directory of the git repository\n * @param fromRef - Starting reference (branch name, commit SHA, or tag)\n * @param toRef - Ending reference (branch name, commit SHA, or tag)\n * @returns Array of file paths (relative to repo root) that changed\n * @throws Error if git command fails\n */\nexport async function getChangedFiles(\n  rootDir: string,\n  fromRef: string,\n  toRef: string\n): Promise<string[]> {\n  try {\n    const { stdout } = await execAsync(\n      `git diff --name-only ${fromRef}...${toRef}`,\n      {\n        cwd: rootDir,\n        timeout: 10000, // 10 second timeout for diffs\n      }\n    );\n    \n    const files = stdout\n      .trim()\n      .split('\\n')\n      .filter(Boolean)\n      .map(file => path.join(rootDir, file)); // Convert to absolute paths\n    \n    return files;\n  } catch (error) {\n    throw new Error(`Failed to get changed files: ${error}`);\n  }\n}\n\n/**\n * Gets the list of files that changed in a specific commit.\n * \n * @param rootDir - Root directory of the git repository\n * @param commitSha - Commit SHA to check\n * @returns Array of file paths (absolute) that changed in this commit\n * @throws Error if git command fails\n */\nexport async function getChangedFilesInCommit(\n  rootDir: string,\n  commitSha: string\n): Promise<string[]> {\n  try {\n    const { stdout } = await execAsync(\n      `git diff-tree --no-commit-id --name-only -r ${commitSha}`,\n      {\n        cwd: rootDir,\n        timeout: 10000,\n      }\n    );\n    \n    const files = stdout\n      .trim()\n      .split('\\n')\n      .filter(Boolean)\n      .map(file => path.join(rootDir, file)); // Convert to absolute paths\n    \n    return files;\n  } catch (error) {\n    throw new Error(`Failed to get changed files in commit: ${error}`);\n  }\n}\n\n/**\n * Gets the list of files that changed between two commits.\n * More efficient than getChangedFiles for commit-to-commit comparisons.\n * \n * @param rootDir - Root directory of the git repository\n * @param fromCommit - Starting commit SHA\n * @param toCommit - Ending commit SHA\n * @returns Array of file paths (absolute) that changed between commits\n * @throws Error if git command fails\n */\nexport async function getChangedFilesBetweenCommits(\n  rootDir: string,\n  fromCommit: string,\n  toCommit: string\n): Promise<string[]> {\n  try {\n    const { stdout } = await execAsync(\n      `git diff --name-only ${fromCommit} ${toCommit}`,\n      {\n        cwd: rootDir,\n        timeout: 10000,\n      }\n    );\n    \n    const files = stdout\n      .trim()\n      .split('\\n')\n      .filter(Boolean)\n      .map(file => path.join(rootDir, file)); // Convert to absolute paths\n    \n    return files;\n  } catch (error) {\n    throw new Error(`Failed to get changed files between commits: ${error}`);\n  }\n}\n\n/**\n * Checks if git is installed and available.\n * \n * @returns true if git is available, false otherwise\n */\nexport async function isGitAvailable(): Promise<boolean> {\n  try {\n    await execAsync('git --version', { timeout: 3000 });\n    return true;\n  } catch {\n    return false;\n  }\n}\n\n","import fs from 'fs/promises';\nimport path from 'path';\n\nconst VERSION_FILE = '.lien-index-version';\n\n/**\n * Writes a version timestamp file to mark when the index was last updated.\n * This file is used by the MCP server to detect when it needs to reconnect.\n * \n * @param indexPath - Path to the index directory\n */\nexport async function writeVersionFile(indexPath: string): Promise<void> {\n  try {\n    const versionFilePath = path.join(indexPath, VERSION_FILE);\n    const timestamp = Date.now().toString();\n    await fs.writeFile(versionFilePath, timestamp, 'utf-8');\n  } catch (error) {\n    // Don't throw - version file is a convenience feature, not critical\n    console.error(`Warning: Failed to write version file: ${error}`);\n  }\n}\n\n/**\n * Reads the version timestamp from the index directory.\n * Returns 0 if the file doesn't exist (e.g., old index).\n * \n * @param indexPath - Path to the index directory\n * @returns Version timestamp, or 0 if not found\n */\nexport async function readVersionFile(indexPath: string): Promise<number> {\n  try {\n    const versionFilePath = path.join(indexPath, VERSION_FILE);\n    const content = await fs.readFile(versionFilePath, 'utf-8');\n    const timestamp = parseInt(content.trim(), 10);\n    return isNaN(timestamp) ? 0 : timestamp;\n  } catch (error) {\n    // File doesn't exist or can't be read - treat as version 0\n    return 0;\n  }\n}\n\n","import { glob } from 'glob';\nimport ignore from 'ignore';\nimport fs from 'fs/promises';\nimport path from 'path';\nimport { ScanOptions } from './types.js';\nimport { LienConfig, FrameworkInstance } from '../config/schema.js';\n\n/**\n * Scan codebase using framework-aware configuration\n * @param rootDir - Project root directory\n * @param config - Lien configuration with frameworks\n * @returns Array of file paths relative to rootDir\n */\nexport async function scanCodebaseWithFrameworks(\n  rootDir: string,\n  config: LienConfig\n): Promise<string[]> {\n  const allFiles: string[] = [];\n  \n  // Scan each framework\n  for (const framework of config.frameworks) {\n    if (!framework.enabled) {\n      continue;\n    }\n    \n    const frameworkFiles = await scanFramework(rootDir, framework);\n    allFiles.push(...frameworkFiles);\n  }\n  \n  return allFiles;\n}\n\n/**\n * Scan files for a specific framework instance\n */\nasync function scanFramework(\n  rootDir: string,\n  framework: FrameworkInstance\n): Promise<string[]> {\n  const frameworkPath = path.join(rootDir, framework.path);\n  \n  // Load .gitignore from framework path\n  const gitignorePath = path.join(frameworkPath, '.gitignore');\n  let ig = ignore();\n  \n  try {\n    const gitignoreContent = await fs.readFile(gitignorePath, 'utf-8');\n    ig = ignore().add(gitignoreContent);\n  } catch (e) {\n    // No .gitignore in framework path, try root\n    const rootGitignorePath = path.join(rootDir, '.gitignore');\n    try {\n      const gitignoreContent = await fs.readFile(rootGitignorePath, 'utf-8');\n      ig = ignore().add(gitignoreContent);\n    } catch (e) {\n      // No .gitignore at all, that's fine\n    }\n  }\n  \n  // Add framework-specific exclusions\n  ig.add([\n    ...framework.config.exclude,\n    '.lien/**',\n  ]);\n  \n  // Find all files matching framework patterns\n  const allFiles: string[] = [];\n  \n  for (const pattern of framework.config.include) {\n    const files = await glob(pattern, {\n      cwd: frameworkPath,\n      absolute: false, // Get paths relative to framework path\n      nodir: true,\n      ignore: framework.config.exclude,\n    });\n    allFiles.push(...files);\n  }\n  \n  // Remove duplicates\n  const uniqueFiles = Array.from(new Set(allFiles));\n  \n  // Filter using ignore patterns and prefix with framework path\n  return uniqueFiles\n    .filter(file => !ig.ignores(file))\n    .map(file => {\n      // Return path relative to root: framework.path/file\n      return framework.path === '.' \n        ? file \n        : path.join(framework.path, file);\n    });\n}\n\n/**\n * Legacy scan function for backwards compatibility\n * @deprecated Use scanCodebaseWithFrameworks instead\n */\nexport async function scanCodebase(options: ScanOptions): Promise<string[]> {\n  const { rootDir, includePatterns = [], excludePatterns = [] } = options;\n  \n  // Load .gitignore\n  const gitignorePath = path.join(rootDir, '.gitignore');\n  let ig = ignore();\n  \n  try {\n    const gitignoreContent = await fs.readFile(gitignorePath, 'utf-8');\n    ig = ignore().add(gitignoreContent);\n  } catch (e) {\n    // No .gitignore, that's fine\n  }\n  \n  // Add default exclusions\n  ig.add([\n    'node_modules/**',\n    '.git/**',\n    'dist/**',\n    'build/**',\n    '*.min.js',\n    '*.min.css',\n    '.lien/**',\n    ...excludePatterns,\n  ]);\n  \n  // Determine patterns to search for\n  const patterns = includePatterns.length > 0 \n    ? includePatterns \n    : ['**/*.{ts,tsx,js,jsx,py,php,go,rs,java,cpp,c,cs,h,md,mdx}'];\n  \n  // Find all code files\n  const allFiles: string[] = [];\n  \n  for (const pattern of patterns) {\n    const files = await glob(pattern, {\n      cwd: rootDir,\n      absolute: true,\n      nodir: true,\n      ignore: ['node_modules/**', '.git/**'],\n    });\n    allFiles.push(...files);\n  }\n  \n  // Remove duplicates\n  const uniqueFiles = Array.from(new Set(allFiles));\n  \n  // Filter using ignore patterns\n  return uniqueFiles.filter(file => {\n    const relativePath = path.relative(rootDir, file);\n    return !ig.ignores(relativePath);\n  });\n}\n\nexport function detectLanguage(filepath: string): string {\n  const ext = path.extname(filepath).toLowerCase();\n  \n  const languageMap: Record<string, string> = {\n    '.ts': 'typescript',\n    '.tsx': 'typescript',\n    '.js': 'javascript',\n    '.jsx': 'javascript',\n    '.mjs': 'javascript',\n    '.cjs': 'javascript',\n    '.vue': 'vue',\n    '.py': 'python',\n    '.go': 'go',\n    '.rs': 'rust',\n    '.java': 'java',\n    '.cpp': 'cpp',\n    '.cc': 'cpp',\n    '.cxx': 'cpp',\n    '.c': 'c',\n    '.h': 'c',\n    '.hpp': 'cpp',\n    '.php': 'php',\n    '.rb': 'ruby',\n    '.swift': 'swift',\n    '.kt': 'kotlin',\n    '.cs': 'csharp',\n    '.scala': 'scala',\n    '.liquid': 'liquid',\n    '.md': 'markdown',\n    '.mdx': 'markdown',\n    '.markdown': 'markdown',\n  };\n  \n  return languageMap[ext] || 'unknown';\n}\n\n","/**\n * Symbol extraction utilities for different programming languages.\n * Extracts function, class, and interface names from code chunks for better indexing.\n */\n\nexport interface ExtractedSymbols {\n  functions: string[];\n  classes: string[];\n  interfaces: string[];\n}\n\n/**\n * Extract symbols (functions, classes, interfaces) from code content.\n * \n * @param content - The code content to extract symbols from\n * @param language - The programming language of the content\n * @returns Extracted symbols organized by type\n */\nexport function extractSymbols(\n  content: string,\n  language: string\n): ExtractedSymbols {\n  const symbols: ExtractedSymbols = {\n    functions: [],\n    classes: [],\n    interfaces: [],\n  };\n  \n  const normalizedLang = language.toLowerCase();\n  \n  switch (normalizedLang) {\n    case 'typescript':\n    case 'tsx':\n      symbols.functions = extractTSFunctions(content);\n      symbols.classes = extractTSClasses(content);\n      symbols.interfaces = extractTSInterfaces(content);\n      break;\n    \n    case 'javascript':\n    case 'jsx':\n      symbols.functions = extractJSFunctions(content);\n      symbols.classes = extractJSClasses(content);\n      break;\n    \n    case 'python':\n    case 'py':\n      symbols.functions = extractPythonFunctions(content);\n      symbols.classes = extractPythonClasses(content);\n      break;\n    \n    case 'php':\n      symbols.functions = extractPHPFunctions(content);\n      symbols.classes = extractPHPClasses(content);\n      symbols.interfaces = extractPHPInterfaces(content);\n      break;\n    \n    case 'vue':\n      // Extract from <script> blocks (handles both Options API and Composition API)\n      symbols.functions = extractVueFunctions(content);\n      symbols.classes = extractVueComponents(content);\n      break;\n    \n    case 'go':\n      symbols.functions = extractGoFunctions(content);\n      symbols.interfaces = extractGoInterfaces(content);\n      break;\n    \n    case 'java':\n      symbols.functions = extractJavaFunctions(content);\n      symbols.classes = extractJavaClasses(content);\n      symbols.interfaces = extractJavaInterfaces(content);\n      break;\n    \n    case 'csharp':\n    case 'cs':\n      symbols.functions = extractCSharpFunctions(content);\n      symbols.classes = extractCSharpClasses(content);\n      symbols.interfaces = extractCSharpInterfaces(content);\n      break;\n    \n    case 'ruby':\n    case 'rb':\n      symbols.functions = extractRubyFunctions(content);\n      symbols.classes = extractRubyClasses(content);\n      break;\n    \n    case 'rust':\n    case 'rs':\n      symbols.functions = extractRustFunctions(content);\n      break;\n  }\n  \n  return symbols;\n}\n\n// TypeScript / JavaScript Functions\nfunction extractTSFunctions(content: string): string[] {\n  const names = new Set<string>();\n  \n  // Regular functions: function name(...) or async function name(...)\n  const functionMatches = content.matchAll(/(?:async\\s+)?function\\s+(\\w+)\\s*\\(/g);\n  for (const match of functionMatches) {\n    names.add(match[1]);\n  }\n  \n  // Arrow functions: const/let/var name = (...) =>\n  const arrowMatches = content.matchAll(/(?:const|let|var)\\s+(\\w+)\\s*=\\s*(?:async\\s*)?\\([^)]*\\)\\s*=>/g);\n  for (const match of arrowMatches) {\n    names.add(match[1]);\n  }\n  \n  // Method definitions: name(...) { or async name(...) {\n  const methodMatches = content.matchAll(/(?:async\\s+)?(\\w+)\\s*\\([^)]*\\)\\s*[:{]/g);\n  for (const match of methodMatches) {\n    // Exclude common keywords\n    if (!['if', 'for', 'while', 'switch', 'catch'].includes(match[1])) {\n      names.add(match[1]);\n    }\n  }\n  \n  // Export function\n  const exportMatches = content.matchAll(/export\\s+(?:async\\s+)?function\\s+(\\w+)\\s*\\(/g);\n  for (const match of exportMatches) {\n    names.add(match[1]);\n  }\n  \n  return Array.from(names);\n}\n\nfunction extractJSFunctions(content: string): string[] {\n  return extractTSFunctions(content); // Same patterns\n}\n\nfunction extractTSClasses(content: string): string[] {\n  const names = new Set<string>();\n  \n  // Class declarations: class Name or export class Name\n  const classMatches = content.matchAll(/(?:export\\s+)?(?:abstract\\s+)?class\\s+(\\w+)/g);\n  for (const match of classMatches) {\n    names.add(match[1]);\n  }\n  \n  return Array.from(names);\n}\n\nfunction extractJSClasses(content: string): string[] {\n  return extractTSClasses(content); // Same patterns\n}\n\nfunction extractTSInterfaces(content: string): string[] {\n  const names = new Set<string>();\n  \n  // Interface declarations: interface Name or export interface Name\n  const interfaceMatches = content.matchAll(/(?:export\\s+)?interface\\s+(\\w+)/g);\n  for (const match of interfaceMatches) {\n    names.add(match[1]);\n  }\n  \n  // Type aliases: type Name = or export type Name =\n  const typeMatches = content.matchAll(/(?:export\\s+)?type\\s+(\\w+)\\s*=/g);\n  for (const match of typeMatches) {\n    names.add(match[1]);\n  }\n  \n  return Array.from(names);\n}\n\n// Python Functions\nfunction extractPythonFunctions(content: string): string[] {\n  const names = new Set<string>();\n  \n  // Function definitions: def name(...):\n  const functionMatches = content.matchAll(/def\\s+(\\w+)\\s*\\(/g);\n  for (const match of functionMatches) {\n    names.add(match[1]);\n  }\n  \n  // Async functions: async def name(...):\n  const asyncMatches = content.matchAll(/async\\s+def\\s+(\\w+)\\s*\\(/g);\n  for (const match of asyncMatches) {\n    names.add(match[1]);\n  }\n  \n  return Array.from(names);\n}\n\nfunction extractPythonClasses(content: string): string[] {\n  const names = new Set<string>();\n  \n  // Class definitions: class Name or class Name(Base):\n  const classMatches = content.matchAll(/class\\s+(\\w+)(?:\\s*\\(|:)/g);\n  for (const match of classMatches) {\n    names.add(match[1]);\n  }\n  \n  return Array.from(names);\n}\n\n// PHP Functions\nfunction extractPHPFunctions(content: string): string[] {\n  const names = new Set<string>();\n  \n  // Function definitions: function name(...) or public function name(...)\n  const functionMatches = content.matchAll(/(?:public|private|protected)?\\s*function\\s+(\\w+)\\s*\\(/g);\n  for (const match of functionMatches) {\n    names.add(match[1]);\n  }\n  \n  return Array.from(names);\n}\n\nfunction extractPHPClasses(content: string): string[] {\n  const names = new Set<string>();\n  \n  // Class definitions: class Name or abstract class Name\n  const classMatches = content.matchAll(/(?:abstract\\s+)?class\\s+(\\w+)/g);\n  for (const match of classMatches) {\n    names.add(match[1]);\n  }\n  \n  return Array.from(names);\n}\n\nfunction extractPHPInterfaces(content: string): string[] {\n  const names = new Set<string>();\n  \n  // Interface definitions: interface Name\n  const interfaceMatches = content.matchAll(/interface\\s+(\\w+)/g);\n  for (const match of interfaceMatches) {\n    names.add(match[1]);\n  }\n  \n  // Trait definitions: trait Name\n  const traitMatches = content.matchAll(/trait\\s+(\\w+)/g);\n  for (const match of traitMatches) {\n    names.add(match[1]);\n  }\n  \n  return Array.from(names);\n}\n\n// Go Functions\nfunction extractGoFunctions(content: string): string[] {\n  const names = new Set<string>();\n  \n  // Function definitions: func Name(...) or func (r *Receiver) Name(...)\n  const functionMatches = content.matchAll(/func\\s+(?:\\(\\w+\\s+\\*?\\w+\\)\\s+)?(\\w+)\\s*\\(/g);\n  for (const match of functionMatches) {\n    names.add(match[1]);\n  }\n  \n  return Array.from(names);\n}\n\nfunction extractGoInterfaces(content: string): string[] {\n  const names = new Set<string>();\n  \n  // Interface definitions: type Name interface {\n  const interfaceMatches = content.matchAll(/type\\s+(\\w+)\\s+interface\\s*\\{/g);\n  for (const match of interfaceMatches) {\n    names.add(match[1]);\n  }\n  \n  // Struct definitions: type Name struct {\n  const structMatches = content.matchAll(/type\\s+(\\w+)\\s+struct\\s*\\{/g);\n  for (const match of structMatches) {\n    names.add(match[1]);\n  }\n  \n  return Array.from(names);\n}\n\n// Java Functions\nfunction extractJavaFunctions(content: string): string[] {\n  const names = new Set<string>();\n  \n  // Method definitions: public/private/protected return_type name(...)\n  const methodMatches = content.matchAll(/(?:public|private|protected)\\s+(?:static\\s+)?(?:\\w+(?:<[^>]+>)?)\\s+(\\w+)\\s*\\(/g);\n  for (const match of methodMatches) {\n    names.add(match[1]);\n  }\n  \n  return Array.from(names);\n}\n\nfunction extractJavaClasses(content: string): string[] {\n  const names = new Set<string>();\n  \n  // Class definitions: public class Name or abstract class Name\n  const classMatches = content.matchAll(/(?:public\\s+)?(?:abstract\\s+)?class\\s+(\\w+)/g);\n  for (const match of classMatches) {\n    names.add(match[1]);\n  }\n  \n  return Array.from(names);\n}\n\nfunction extractJavaInterfaces(content: string): string[] {\n  const names = new Set<string>();\n  \n  // Interface definitions: public interface Name\n  const interfaceMatches = content.matchAll(/(?:public\\s+)?interface\\s+(\\w+)/g);\n  for (const match of interfaceMatches) {\n    names.add(match[1]);\n  }\n  \n  return Array.from(names);\n}\n\n// C# Functions\nfunction extractCSharpFunctions(content: string): string[] {\n  const names = new Set<string>();\n  \n  // Method definitions: public/private/protected return_type Name(...)\n  const methodMatches = content.matchAll(/(?:public|private|protected|internal)\\s+(?:static\\s+)?(?:async\\s+)?(?:\\w+(?:<[^>]+>)?)\\s+(\\w+)\\s*\\(/g);\n  for (const match of methodMatches) {\n    names.add(match[1]);\n  }\n  \n  return Array.from(names);\n}\n\nfunction extractCSharpClasses(content: string): string[] {\n  const names = new Set<string>();\n  \n  // Class definitions: public class Name or abstract class Name\n  const classMatches = content.matchAll(/(?:public|internal)?\\s*(?:abstract\\s+)?class\\s+(\\w+)/g);\n  for (const match of classMatches) {\n    names.add(match[1]);\n  }\n  \n  return Array.from(names);\n}\n\nfunction extractCSharpInterfaces(content: string): string[] {\n  const names = new Set<string>();\n  \n  // Interface definitions: public interface Name\n  const interfaceMatches = content.matchAll(/(?:public|internal)?\\s*interface\\s+(\\w+)/g);\n  for (const match of interfaceMatches) {\n    names.add(match[1]);\n  }\n  \n  return Array.from(names);\n}\n\n// Ruby Functions\nfunction extractRubyFunctions(content: string): string[] {\n  const names = new Set<string>();\n  \n  // Method definitions: def name or def self.name\n  const methodMatches = content.matchAll(/def\\s+(?:self\\.)?(\\w+)/g);\n  for (const match of methodMatches) {\n    names.add(match[1]);\n  }\n  \n  return Array.from(names);\n}\n\nfunction extractRubyClasses(content: string): string[] {\n  const names = new Set<string>();\n  \n  // Class definitions: class Name or class Name < Base\n  const classMatches = content.matchAll(/class\\s+(\\w+)/g);\n  for (const match of classMatches) {\n    names.add(match[1]);\n  }\n  \n  // Module definitions: module Name\n  const moduleMatches = content.matchAll(/module\\s+(\\w+)/g);\n  for (const match of moduleMatches) {\n    names.add(match[1]);\n  }\n  \n  return Array.from(names);\n}\n\n// Rust Functions\nfunction extractRustFunctions(content: string): string[] {\n  const names = new Set<string>();\n  \n  // Function definitions: fn name(...) or pub fn name(...)\n  const functionMatches = content.matchAll(/(?:pub\\s+)?fn\\s+(\\w+)\\s*\\(/g);\n  for (const match of functionMatches) {\n    names.add(match[1]);\n  }\n  \n  // Struct definitions: struct Name {\n  const structMatches = content.matchAll(/(?:pub\\s+)?struct\\s+(\\w+)/g);\n  for (const match of structMatches) {\n    names.add(match[1]);\n  }\n  \n  // Trait definitions: trait Name {\n  const traitMatches = content.matchAll(/(?:pub\\s+)?trait\\s+(\\w+)/g);\n  for (const match of traitMatches) {\n    names.add(match[1]);\n  }\n  \n  return Array.from(names);\n}\n\n// Vue Functions\nfunction extractVueFunctions(content: string): string[] {\n  const names = new Set<string>();\n  \n  // Extract script content from Vue SFC\n  const scriptMatch = content.match(/<script[^>]*>([\\s\\S]*?)<\\/script>/);\n  if (!scriptMatch) return [];\n  \n  const scriptContent = scriptMatch[1];\n  \n  // Composition API: const/function name = ...\n  const compositionMatches = scriptContent.matchAll(/(?:const|function)\\s+(\\w+)\\s*=/g);\n  for (const match of compositionMatches) {\n    names.add(match[1]);\n  }\n  \n  // Options API methods\n  const methodMatches = scriptContent.matchAll(/(\\w+)\\s*\\([^)]*\\)\\s*{/g);\n  for (const match of methodMatches) {\n    names.add(match[1]);\n  }\n  \n  return Array.from(names);\n}\n\n// Vue Components\nfunction extractVueComponents(content: string): string[] {\n  const names = new Set<string>();\n  \n  // Extract component name from filename convention or export\n  const scriptMatch = content.match(/<script[^>]*>([\\s\\S]*?)<\\/script>/);\n  if (!scriptMatch) return [];\n  \n  const scriptContent = scriptMatch[1];\n  \n  // export default { name: 'ComponentName' }\n  const nameMatch = scriptContent.match(/name:\\s*['\"](\\w+)['\"]/);\n  if (nameMatch) {\n    names.add(nameMatch[1]);\n  }\n  \n  // defineComponent or <script setup> components\n  const defineComponentMatch = scriptContent.match(/defineComponent\\s*\\(/);\n  if (defineComponentMatch) {\n    names.add('VueComponent');\n  }\n  \n  return Array.from(names);\n}\n\n","import Parser from 'tree-sitter';\nimport TypeScript from 'tree-sitter-typescript';\nimport JavaScript from 'tree-sitter-javascript';\nimport PHPParser from 'tree-sitter-php';\nimport Python from 'tree-sitter-python';\nimport { extname } from 'path';\nimport type { ASTParseResult, SupportedLanguage } from './types.js';\n\n/**\n * Cache for parser instances to avoid recreating them\n */\nconst parserCache = new Map<SupportedLanguage, Parser>();\n\n/**\n * Tree-sitter language grammar type\n * Using any here due to type incompatibility between parser packages and tree-sitter core\n */\ntype TreeSitterLanguage = any;\n\n/**\n * Language configuration mapping\n */\nconst languageConfig: Record<SupportedLanguage, TreeSitterLanguage> = {\n  typescript: TypeScript.typescript,\n  javascript: JavaScript,\n  php: PHPParser.php, // Note: tree-sitter-php exports both 'php' (mixed HTML/PHP) and 'php_only'\n  python: Python,\n};\n\n/**\n * Get or create a cached parser instance for a language\n */\nfunction getParser(language: SupportedLanguage): Parser {\n  if (!parserCache.has(language)) {\n    const parser = new Parser();\n    const grammar = languageConfig[language];\n    \n    if (!grammar) {\n      throw new Error(`No grammar available for language: ${language}`);\n    }\n    \n    parser.setLanguage(grammar);\n    parserCache.set(language, parser);\n  }\n  \n  return parserCache.get(language)!;\n}\n\n/**\n * Detect language from file extension\n * Uses path.extname() to handle edge cases like multiple dots in filenames\n */\nexport function detectLanguage(filePath: string): SupportedLanguage | null {\n  // extname returns extension with leading dot (e.g., '.ts')\n  // Remove the dot and convert to lowercase\n  const ext = extname(filePath).slice(1).toLowerCase();\n  \n  switch (ext) {\n    case 'ts':\n    case 'tsx':\n      return 'typescript';\n    case 'js':\n    case 'jsx':\n    case 'mjs':\n    case 'cjs':\n      return 'javascript';\n    case 'php':\n      return 'php';\n    case 'py':\n      return 'python';\n    default:\n      return null;\n  }\n}\n\n/**\n * Check if a file is supported for AST parsing\n */\nexport function isASTSupported(filePath: string): boolean {\n  return detectLanguage(filePath) !== null;\n}\n\n/**\n * Parse source code into an AST using Tree-sitter\n * \n * **Known Limitation:** Tree-sitter may throw \"Invalid argument\" errors on very large files\n * (1000+ lines). This is a limitation of Tree-sitter's internal buffer handling. When this\n * occurs, callers should fall back to line-based chunking (handled automatically by chunker.ts).\n * \n * @param content - Source code to parse\n * @param language - Programming language\n * @returns Parse result with tree or error\n */\nexport function parseAST(content: string, language: SupportedLanguage): ASTParseResult {\n  try {\n    const parser = getParser(language);\n    const tree = parser.parse(content);\n    \n    // Check for parse errors (hasError is a property, not a method)\n    if (tree.rootNode.hasError) {\n      return {\n        tree,\n        error: 'Parse completed with errors',\n      };\n    }\n    \n    return { tree };\n  } catch (error) {\n    return {\n      tree: null,\n      error: error instanceof Error ? error.message : 'Unknown parse error',\n    };\n  }\n}\n\n/**\n * Clear parser cache (useful for testing)\n */\nexport function clearParserCache(): void {\n  parserCache.clear();\n}\n\n","import type Parser from 'tree-sitter';\n\n/**\n * Decision point node types for cyclomatic complexity calculation.\n * \n * These AST node types represent branch points in code flow.\n */\nconst DECISION_POINTS = [\n  // Common across languages (TypeScript/JavaScript/Python/PHP)\n  'if_statement',          // if conditions\n  'while_statement',       // while loops\n  'for_statement',         // for loops\n  'switch_case',           // switch/case statements\n  'catch_clause',          // try/catch error handling\n  'ternary_expression',    // Ternary operator (a ? b : c)\n  'binary_expression',     // For && and || logical operators\n  \n  // TypeScript/JavaScript specific\n  'do_statement',          // do...while loops\n  'for_in_statement',      // for...in loops\n  'for_of_statement',      // for...of loops\n  \n  // PHP specific\n  'foreach_statement',     // PHP foreach loops\n  \n  // Python specific\n  'elif_clause',           // Python elif (adds decision point)\n  // Note: 'else_clause' is NOT a decision point (it's the default path)\n  'except_clause',         // Python except (try/except)\n  'conditional_expression', // Python ternary (x if cond else y)\n];\n\n/**\n * Calculate cyclomatic complexity of a function\n * \n * Complexity = 1 (base) + number of decision points\n * Decision points: if, while, do...while, for, for...in, for...of, foreach, case, catch, &&, ||, ?:\n * \n * @param node - AST node to analyze (typically a function/method)\n * @returns Cyclomatic complexity score (minimum 1)\n */\nexport function calculateComplexity(node: Parser.SyntaxNode): number {\n  let complexity = 1; // Base complexity\n  \n  function traverse(n: Parser.SyntaxNode) {\n    if (DECISION_POINTS.includes(n.type)) {\n      // For binary expressions, only count && and ||\n      if (n.type === 'binary_expression') {\n        const operator = n.childForFieldName('operator');\n        if (operator && (operator.text === '&&' || operator.text === '||')) {\n          complexity++;\n        }\n      } else {\n        complexity++;\n      }\n    }\n    \n    // Traverse children\n    for (let i = 0; i < n.namedChildCount; i++) {\n      const child = n.namedChild(i);\n      if (child) traverse(child);\n    }\n  }\n  \n  traverse(node);\n  return complexity;\n}\n","import type Parser from 'tree-sitter';\n\n// Node types that increase complexity AND increment nesting for children\nconst NESTING_TYPES = new Set([\n  'if_statement', 'for_statement', 'while_statement', 'switch_statement',\n  'catch_clause', 'except_clause', 'do_statement', 'for_in_statement',\n  'for_of_statement', 'foreach_statement', 'match_statement',\n]);\n\n// Types that add complexity but DON'T nest (hybrid increments)\nconst NON_NESTING_TYPES = new Set([\n  'else_clause', 'elif_clause', 'ternary_expression', 'conditional_expression',\n]);\n\n// Lambda types that add complexity when nested\nconst LAMBDA_TYPES = new Set(['arrow_function', 'function_expression', 'lambda']);\n\n/** Traversal context passed to handlers */\ninterface TraversalContext {\n  traverse: (n: Parser.SyntaxNode, level: number, lastOp: string | null) => void;\n}\n\n/**\n * Check if node is a logical operator and return normalized form\n */\nfunction getLogicalOperator(node: Parser.SyntaxNode): string | null {\n  if (node.type !== 'binary_expression' && node.type !== 'boolean_operator') {\n    return null;\n  }\n  const operator = node.childForFieldName('operator');\n  const opText = operator?.text;\n  \n  if (opText === '&&' || opText === 'and') return '&&';\n  if (opText === '||' || opText === 'or') return '||';\n  return null;\n}\n\n/**\n * Determine nesting level for a child node based on SonarSource spec.\n */\nfunction getChildNestingLevel(\n  parent: Parser.SyntaxNode,\n  child: Parser.SyntaxNode,\n  currentLevel: number\n): number {\n  const isCondition = parent.childForFieldName('condition') === child;\n  const isElseClause = NON_NESTING_TYPES.has(child.type);\n  return (!isCondition && !isElseClause) ? currentLevel + 1 : currentLevel;\n}\n\n/**\n * Get complexity increment for nested lambda (only adds if already nested)\n */\nfunction getNestedLambdaIncrement(nodeType: string, nestingLevel: number): number {\n  return (LAMBDA_TYPES.has(nodeType) && nestingLevel > 0) ? 1 : 0;\n}\n\n/** Traverse logical operator children, passing the operator type */\nfunction traverseLogicalChildren(\n  n: Parser.SyntaxNode,\n  level: number,\n  op: string,\n  ctx: TraversalContext\n): void {\n  const operator = n.childForFieldName('operator');\n  for (let i = 0; i < n.namedChildCount; i++) {\n    const child = n.namedChild(i);\n    if (child && child !== operator) ctx.traverse(child, level, op);\n  }\n}\n\n/** Traverse nesting type children with proper nesting level adjustment */\nfunction traverseNestingChildren(\n  n: Parser.SyntaxNode,\n  level: number,\n  ctx: TraversalContext\n): void {\n  for (let i = 0; i < n.namedChildCount; i++) {\n    const child = n.namedChild(i);\n    if (child) ctx.traverse(child, getChildNestingLevel(n, child, level), null);\n  }\n}\n\n/** Traverse all children at specified level */\nfunction traverseAllChildren(\n  n: Parser.SyntaxNode,\n  level: number,\n  ctx: TraversalContext\n): void {\n  for (let i = 0; i < n.namedChildCount; i++) {\n    const child = n.namedChild(i);\n    if (child) ctx.traverse(child, level, null);\n  }\n}\n\n/**\n * Calculate cognitive complexity of a function\n * \n * Based on SonarSource's Cognitive Complexity specification:\n * - +1 for each break from linear flow (if, for, while, catch, etc.)\n * - +1 for each nesting level when inside a control structure\n * - +1 for each logical operator sequence break (a && b || c)\n * \n * @see https://www.sonarsource.com/docs/CognitiveComplexity.pdf\n * \n * @param node - AST node to analyze (typically a function/method)\n * @returns Cognitive complexity score (minimum 0)\n */\nexport function calculateCognitiveComplexity(node: Parser.SyntaxNode): number {\n  let complexity = 0;\n  const ctx: TraversalContext = { traverse };\n  \n  function traverse(n: Parser.SyntaxNode, nestingLevel: number, lastLogicalOp: string | null): void {\n    const logicalOp = getLogicalOperator(n);\n    \n    if (logicalOp) {\n      complexity += (lastLogicalOp !== logicalOp) ? 1 : 0;\n      traverseLogicalChildren(n, nestingLevel, logicalOp, ctx);\n      return;\n    }\n    \n    if (NESTING_TYPES.has(n.type)) {\n      complexity += 1 + nestingLevel;\n      traverseNestingChildren(n, nestingLevel, ctx);\n      return;\n    }\n    \n    if (NON_NESTING_TYPES.has(n.type)) {\n      complexity += 1;\n      traverseAllChildren(n, nestingLevel + 1, ctx);\n      return;\n    }\n    \n    complexity += getNestedLambdaIncrement(n.type, nestingLevel);\n    traverseAllChildren(n, nestingLevel, ctx);\n  }\n  \n  traverse(node, 0, null);\n  return complexity;\n}\n","import type Parser from 'tree-sitter';\n\n/** Raw Halstead counts from AST */\nexport interface HalsteadCounts {\n  n1: number;  // distinct operators\n  n2: number;  // distinct operands\n  N1: number;  // total operators\n  N2: number;  // total operands\n  operators: Map<string, number>;  // operator -> count\n  operands: Map<string, number>;   // operand -> count\n}\n\n/** Calculated Halstead metrics */\nexport interface HalsteadMetrics {\n  vocabulary: number;   // n = n1 + n2\n  length: number;       // N = N1 + N2\n  volume: number;       // V = N × log₂(n)\n  difficulty: number;   // D = (n1/2) × (N2/n2)\n  effort: number;       // E = D × V\n  time: number;         // T = E / 18 (seconds to understand)\n  bugs: number;         // B = V / 3000 (estimated delivered bugs)\n}\n\n/** \n * Language-specific operator symbols.\n * These are the actual text values we match against.\n */\nconst OPERATOR_SYMBOLS: Record<string, Set<string>> = {\n  typescript: new Set([\n    // Arithmetic\n    '+', '-', '*', '/', '%', '**',\n    // Comparison\n    '==', '===', '!=', '!==', '<', '>', '<=', '>=',\n    // Logical\n    '&&', '||', '!', '??',\n    // Assignment\n    '=', '+=', '-=', '*=', '/=', '%=', '**=', '&&=', '||=', '??=',\n    // Bitwise\n    '&', '|', '^', '~', '<<', '>>', '>>>',\n    '&=', '|=', '^=', '<<=', '>>=', '>>>=',\n    // Other\n    '?', ':', '.', '?.', '++', '--', '...', '=>',\n    // Brackets/parens (counted as operators)\n    '(', ')', '[', ']', '{', '}',\n  ]),\n  python: new Set([\n    // Arithmetic\n    '+', '-', '*', '/', '%', '**', '//',\n    // Comparison\n    '==', '!=', '<', '>', '<=', '>=',\n    // Logical (handled via keywords below)\n    // Assignment\n    '=', '+=', '-=', '*=', '/=', '%=', '**=', '//=',\n    '&=', '|=', '^=', '<<=', '>>=',\n    // Bitwise\n    '&', '|', '^', '~', '<<', '>>',\n    // Other\n    '.', ':', '->', '@',\n    '(', ')', '[', ']', '{', '}',\n  ]),\n  php: new Set([\n    // Arithmetic\n    '+', '-', '*', '/', '%', '**',\n    // Comparison\n    '==', '===', '!=', '!==', '<>', '<', '>', '<=', '>=', '<=>',\n    // Logical\n    '&&', '||', '!', 'and', 'or', 'xor',\n    // Assignment\n    '=', '+=', '-=', '*=', '/=', '%=', '**=', '.=',\n    '&=', '|=', '^=', '<<=', '>>=', '??=',\n    // Bitwise\n    '&', '|', '^', '~', '<<', '>>',\n    // String\n    '.',\n    // Other\n    '?', ':', '::', '->', '=>', '??', '@',\n    '(', ')', '[', ']', '{', '}',\n  ]),\n};\n\n/** \n * Language-specific operator keywords.\n * These are keywords that act as operators.\n */\nconst OPERATOR_KEYWORDS: Record<string, Set<string>> = {\n  typescript: new Set([\n    'if', 'else', 'for', 'while', 'do', 'switch', 'case', 'default',\n    'return', 'throw', 'try', 'catch', 'finally',\n    'new', 'delete', 'typeof', 'instanceof', 'in', 'of',\n    'await', 'yield', 'break', 'continue',\n    'const', 'let', 'var', 'function', 'class', 'extends', 'implements',\n    'import', 'export', 'from', 'as',\n  ]),\n  python: new Set([\n    'if', 'elif', 'else', 'for', 'while', 'match', 'case',\n    'return', 'raise', 'try', 'except', 'finally',\n    'and', 'or', 'not', 'is', 'in',\n    'await', 'yield', 'break', 'continue', 'pass',\n    'def', 'class', 'lambda', 'async',\n    'import', 'from', 'as', 'with',\n    'global', 'nonlocal', 'del', 'assert',\n  ]),\n  php: new Set([\n    'if', 'elseif', 'else', 'for', 'foreach', 'while', 'do', 'switch', 'case', 'default', 'match',\n    'return', 'throw', 'try', 'catch', 'finally',\n    'new', 'clone', 'instanceof',\n    'yield', 'break', 'continue',\n    'function', 'class', 'extends', 'implements', 'trait', 'interface',\n    'use', 'namespace', 'as',\n    'echo', 'print', 'include', 'require', 'include_once', 'require_once',\n    'global', 'static', 'const', 'public', 'private', 'protected', 'readonly',\n  ]),\n};\n\n/** \n * AST node types that represent operators (language-agnostic).\n * These are the tree-sitter node types, not the text content.\n */\nconst OPERATOR_NODE_TYPES = new Set([\n  // Expression operators\n  'binary_expression',\n  'unary_expression',\n  'update_expression',\n  'assignment_expression',\n  'augmented_assignment_expression',\n  'ternary_expression',\n  'conditional_expression',\n  \n  // Call/access operators\n  'call_expression',\n  'method_call',\n  'member_expression',\n  'subscript_expression',\n  'attribute',\n  \n  // Object/array literals ([] and {} are operators)\n  'array',\n  'object',\n  'dictionary',\n  'list',\n]);\n\n/**\n * AST node types that represent operands.\n */\nconst OPERAND_NODE_TYPES = new Set([\n  // Identifiers\n  'identifier',\n  'property_identifier',\n  'shorthand_property_identifier',\n  'variable_name',\n  'name',\n  \n  // Literals\n  'number',\n  'integer',\n  'float',\n  'string',\n  'string_fragment',\n  'template_string',\n  'true',\n  'false',\n  'null',\n  'undefined',\n  'none',\n  \n  // Special\n  'this',\n  'self',\n  'super',\n]);\n\n/**\n * Get the operator set for a language (with fallback to typescript)\n */\nfunction getOperatorSymbols(language: string): Set<string> {\n  return OPERATOR_SYMBOLS[language] || OPERATOR_SYMBOLS.typescript;\n}\n\n/**\n * Get the keyword set for a language (with fallback to typescript)\n */\nfunction getOperatorKeywords(language: string): Set<string> {\n  return OPERATOR_KEYWORDS[language] || OPERATOR_KEYWORDS.typescript;\n}\n\n/**\n * Check if a node represents an operator\n */\nfunction isOperator(node: Parser.SyntaxNode, language: string): boolean {\n  const nodeType = node.type;\n  const nodeText = node.text;\n  \n  // Check if it's an operator node type\n  if (OPERATOR_NODE_TYPES.has(nodeType)) {\n    return true;\n  }\n  \n  // Check if it's an operator symbol or keyword\n  const symbols = getOperatorSymbols(language);\n  const keywords = getOperatorKeywords(language);\n  \n  return symbols.has(nodeText) || keywords.has(nodeText);\n}\n\n/**\n * Check if a node represents an operand\n */\nfunction isOperand(node: Parser.SyntaxNode): boolean {\n  return OPERAND_NODE_TYPES.has(node.type);\n}\n\n/**\n * Get the canonical key for an operator (for counting distinct operators)\n */\nfunction getOperatorKey(node: Parser.SyntaxNode): string {\n  // For complex expressions, use the operator type\n  if (OPERATOR_NODE_TYPES.has(node.type)) {\n    // For binary/unary expressions, extract the actual operator\n    const operator = node.childForFieldName('operator');\n    if (operator) {\n      return operator.text;\n    }\n    return node.type;\n  }\n  return node.text;\n}\n\n/**\n * Get the canonical key for an operand (for counting distinct operands)\n */\nfunction getOperandKey(node: Parser.SyntaxNode): string {\n  return node.text;\n}\n\n/**\n * Sum all values in a map\n */\nfunction sumValues(map: Map<string, number>): number {\n  let sum = 0;\n  for (const count of map.values()) {\n    sum += count;\n  }\n  return sum;\n}\n\n/**\n * Count operators and operands in an AST node\n * \n * @param node - AST node to analyze (typically a function/method)\n * @param language - Programming language for language-specific handling\n * @returns HalsteadCounts with raw operator/operand counts\n */\nexport function countHalstead(node: Parser.SyntaxNode, language: string): HalsteadCounts {\n  const operators = new Map<string, number>();\n  const operands = new Map<string, number>();\n  \n  function traverse(n: Parser.SyntaxNode): void {\n    // Check if this is an operator\n    if (isOperator(n, language)) {\n      const key = getOperatorKey(n);\n      operators.set(key, (operators.get(key) || 0) + 1);\n    }\n    \n    // Check if this is an operand\n    if (isOperand(n)) {\n      const key = getOperandKey(n);\n      operands.set(key, (operands.get(key) || 0) + 1);\n    }\n    \n    // Recurse into children\n    for (const child of n.children) {\n      traverse(child);\n    }\n  }\n  \n  traverse(node);\n  \n  return {\n    n1: operators.size,\n    n2: operands.size,\n    N1: sumValues(operators),\n    N2: sumValues(operands),\n    operators,\n    operands,\n  };\n}\n\n/**\n * Calculate derived Halstead metrics from raw counts\n * \n * Formulas based on Maurice Halstead's \"Elements of Software Science\" (1977):\n * - Vocabulary (n) = n1 + n2\n * - Length (N) = N1 + N2\n * - Volume (V) = N × log₂(n) - size of implementation\n * - Difficulty (D) = (n1/2) × (N2/n2) - error-proneness\n * - Effort (E) = D × V - mental effort required\n * - Time (T) = E / 18 - seconds to understand (Stroud number)\n * - Bugs (B) = V / 3000 - estimated delivered bugs\n * \n * @param counts - Raw Halstead counts from countHalstead()\n * @returns Calculated HalsteadMetrics\n */\nexport function calculateHalsteadMetrics(counts: HalsteadCounts): HalsteadMetrics {\n  const { n1, n2, N1, N2 } = counts;\n  \n  const vocabulary = n1 + n2;\n  const length = N1 + N2;\n  \n  // Avoid log(0) and division by zero\n  const volume = vocabulary > 0 ? length * Math.log2(vocabulary) : 0;\n  const difficulty = n2 > 0 ? (n1 / 2) * (N2 / n2) : 0;\n  const effort = difficulty * volume;\n  const time = effort / 18;  // Stroud number (18 mental discriminations per second)\n  const bugs = volume / 3000;\n  \n  return {\n    vocabulary: Math.round(vocabulary),\n    length: Math.round(length),\n    volume: Math.round(volume * 100) / 100,\n    difficulty: Math.round(difficulty * 100) / 100,\n    effort: Math.round(effort),\n    time: Math.round(time),\n    bugs: Math.round(bugs * 1000) / 1000,\n  };\n}\n\n/**\n * Calculate Halstead metrics for an AST node in one call\n * \n * Convenience function that combines countHalstead and calculateHalsteadMetrics.\n * \n * @param node - AST node to analyze\n * @param language - Programming language\n * @returns Calculated HalsteadMetrics\n */\nexport function calculateHalstead(node: Parser.SyntaxNode, language: string): HalsteadMetrics {\n  const counts = countHalstead(node, language);\n  return calculateHalsteadMetrics(counts);\n}\n","/**\n * Complexity metrics module\n * \n * This module provides various code complexity metrics:\n * - Cyclomatic complexity: Counts decision points (branches) in code\n * - Cognitive complexity: Measures mental effort to understand code (SonarSource spec)\n * - Halstead metrics: Measures complexity based on operators/operands\n */\n\nexport { calculateComplexity } from './cyclomatic.js';\nexport { calculateCognitiveComplexity } from './cognitive.js';\nexport { \n  countHalstead, \n  calculateHalsteadMetrics, \n  calculateHalstead,\n} from './halstead.js';\nexport type { HalsteadCounts, HalsteadMetrics } from './halstead.js';\n","import type Parser from 'tree-sitter';\nimport type { SymbolInfo } from './types.js';\nimport { calculateComplexity } from './complexity/index.js';\n\n/**\n * Type for symbol extractor functions\n */\ntype SymbolExtractor = (\n  node: Parser.SyntaxNode,\n  content: string,\n  parentClass?: string\n) => SymbolInfo | null;\n\n/**\n * Extract function declaration info (function_declaration, function)\n */\nfunction extractFunctionInfo(\n  node: Parser.SyntaxNode,\n  content: string,\n  parentClass?: string\n): SymbolInfo | null {\n    const nameNode = node.childForFieldName('name');\n    if (!nameNode) return null;\n    \n    return {\n      name: nameNode.text,\n      type: parentClass ? 'method' : 'function',\n      startLine: node.startPosition.row + 1,\n      endLine: node.endPosition.row + 1,\n      parentClass,\n      signature: extractSignature(node, content),\n      parameters: extractParameters(node, content),\n      returnType: extractReturnType(node, content),\n      complexity: calculateComplexity(node),\n    };\n  }\n  \n/**\n * Extract arrow function or function expression info\n */\nfunction extractArrowFunctionInfo(\n  node: Parser.SyntaxNode,\n  content: string,\n  parentClass?: string\n): SymbolInfo | null {\n    // Try to find variable name for arrow functions\n    const parent = node.parent;\n    let name = 'anonymous';\n    \n    if (parent?.type === 'variable_declarator') {\n      const nameNode = parent.childForFieldName('name');\n      name = nameNode?.text || 'anonymous';\n    }\n    \n    return {\n      name,\n      type: parentClass ? 'method' : 'function',\n      startLine: node.startPosition.row + 1,\n      endLine: node.endPosition.row + 1,\n      parentClass,\n      signature: extractSignature(node, content),\n      parameters: extractParameters(node, content),\n      complexity: calculateComplexity(node),\n    };\n  }\n  \n/**\n * Extract method definition info\n */\nfunction extractMethodInfo(\n  node: Parser.SyntaxNode,\n  content: string,\n  parentClass?: string\n): SymbolInfo | null {\n    const nameNode = node.childForFieldName('name');\n    if (!nameNode) return null;\n    \n    return {\n      name: nameNode.text,\n      type: 'method',\n      startLine: node.startPosition.row + 1,\n      endLine: node.endPosition.row + 1,\n      parentClass,\n      signature: extractSignature(node, content),\n      parameters: extractParameters(node, content),\n      returnType: extractReturnType(node, content),\n      complexity: calculateComplexity(node),\n    };\n  }\n  \n/**\n * Extract class declaration info\n */\nfunction extractClassInfo(\n  node: Parser.SyntaxNode,\n  _content: string,\n  _parentClass?: string\n): SymbolInfo | null {\n    const nameNode = node.childForFieldName('name');\n    if (!nameNode) return null;\n    \n    return {\n      name: nameNode.text,\n      type: 'class',\n      startLine: node.startPosition.row + 1,\n      endLine: node.endPosition.row + 1,\n      signature: `class ${nameNode.text}`,\n    };\n  }\n  \n/**\n * Extract interface declaration info (TypeScript)\n */\nfunction extractInterfaceInfo(\n  node: Parser.SyntaxNode,\n  _content: string,\n  _parentClass?: string\n): SymbolInfo | null {\n    const nameNode = node.childForFieldName('name');\n    if (!nameNode) return null;\n    \n    return {\n      name: nameNode.text,\n      type: 'interface',\n      startLine: node.startPosition.row + 1,\n      endLine: node.endPosition.row + 1,\n      signature: `interface ${nameNode.text}`,\n    };\n  }\n\n/**\n * Extract Python function info (def and async def)\n */\nfunction extractPythonFunctionInfo(\n  node: Parser.SyntaxNode,\n  content: string,\n  parentClass?: string\n): SymbolInfo | null {\n    const nameNode = node.childForFieldName('name');\n    if (!nameNode) return null;\n    \n    return {\n      name: nameNode.text,\n      type: parentClass ? 'method' : 'function',\n      startLine: node.startPosition.row + 1,\n      endLine: node.endPosition.row + 1,\n      parentClass,\n      signature: extractSignature(node, content),\n      parameters: extractParameters(node, content),\n      complexity: calculateComplexity(node),\n    };\n  }\n\n/**\n * Extract Python class info\n */\nfunction extractPythonClassInfo(\n  node: Parser.SyntaxNode,\n  _content: string,\n  _parentClass?: string\n): SymbolInfo | null {\n    const nameNode = node.childForFieldName('name');\n    if (!nameNode) return null;\n    \n    return {\n      name: nameNode.text,\n      type: 'class',\n      startLine: node.startPosition.row + 1,\n      endLine: node.endPosition.row + 1,\n      signature: `class ${nameNode.text}`,\n    };\n  }\n  \n/**\n * Map of AST node types to their specialized extractors\n * \n * Note: There is intentional overlap in node type names across languages:\n * - 'function_definition': Used by both PHP and Python\n * - 'class_declaration': Used by TypeScript/JavaScript\n * - 'class_definition': Used by Python\n * \n * This is handled correctly because each file is parsed with its specific language parser.\n */\nconst symbolExtractors: Record<string, SymbolExtractor> = {\n  // TypeScript/JavaScript\n  'function_declaration': extractFunctionInfo,\n  'function': extractFunctionInfo,\n  'arrow_function': extractArrowFunctionInfo,\n  'function_expression': extractArrowFunctionInfo,\n  'method_definition': extractMethodInfo,\n  'class_declaration': extractClassInfo,\n  'interface_declaration': extractInterfaceInfo,\n  \n  // PHP\n  'function_definition': extractFunctionInfo,   // PHP functions (Python handled via language check in extractSymbolInfo)\n  'method_declaration': extractMethodInfo,       // PHP methods\n  \n  // Python\n  'async_function_definition': extractPythonFunctionInfo,  // Python async functions\n  'class_definition': extractPythonClassInfo,              // Python classes\n  // Note: Python regular functions use 'function_definition' (same as PHP)\n  // They are dispatched to extractPythonFunctionInfo via language check in extractSymbolInfo()\n};\n\n/**\n * Extract symbol information from an AST node using specialized extractors\n * \n * @param node - AST node to extract info from\n * @param content - Source code content\n * @param parentClass - Parent class name if this is a method\n * @param language - Programming language (for disambiguating shared node types)\n * @returns Symbol information or null\n */\nexport function extractSymbolInfo(\n  node: Parser.SyntaxNode,\n  content: string,\n  parentClass?: string,\n  language?: string\n): SymbolInfo | null {\n  // Handle ambiguous node types that are shared between languages\n  // PHP and Python both use 'function_definition', but need different extractors\n  if (node.type === 'function_definition' && language === 'python') {\n    return extractPythonFunctionInfo(node, content, parentClass);\n  }\n  \n  const extractor = symbolExtractors[node.type];\n  return extractor ? extractor(node, content, parentClass) : null;\n}\n\n/**\n * Extract function/method signature\n */\nfunction extractSignature(node: Parser.SyntaxNode, content: string): string {\n  // Get the first line of the function (up to opening brace or arrow)\n  const startLine = node.startPosition.row;\n  const lines = content.split('\\n');\n  let signature = lines[startLine] || '';\n  \n  // If signature spans multiple lines, try to get up to the opening brace\n  let currentLine = startLine;\n  while (currentLine < node.endPosition.row && !signature.includes('{') && !signature.includes('=>')) {\n    currentLine++;\n    signature += ' ' + (lines[currentLine] || '');\n  }\n  \n  // Clean up signature\n  signature = signature.split('{')[0].split('=>')[0].trim();\n  \n  // Limit length\n  if (signature.length > 200) {\n    signature = signature.substring(0, 197) + '...';\n  }\n  \n  return signature;\n}\n\n/**\n * Extract parameter list from function node\n * \n * Note: The `_content` parameter is unused in this function, but is kept for API consistency\n * with other extract functions (e.g., extractSignature).\n */\nfunction extractParameters(node: Parser.SyntaxNode, _content: string): string[] {\n  const parameters: string[] = [];\n  \n  // Find parameters node\n  const paramsNode = node.childForFieldName('parameters');\n  if (!paramsNode) return parameters;\n  \n  // Traverse parameter nodes\n  for (let i = 0; i < paramsNode.namedChildCount; i++) {\n    const param = paramsNode.namedChild(i);\n    if (param) {\n      parameters.push(param.text);\n    }\n  }\n  \n  return parameters;\n}\n\n/**\n * Extract return type from function node (TypeScript)\n * \n * Note: The `_content` parameter is unused in this function, but is kept for API consistency\n * with other extract functions (e.g., extractSignature).\n */\nfunction extractReturnType(node: Parser.SyntaxNode, _content: string): string | undefined {\n  const returnTypeNode = node.childForFieldName('return_type');\n  if (!returnTypeNode) return undefined;\n  \n  return returnTypeNode.text;\n}\n\n/**\n * Extract import statements from a file\n */\nexport function extractImports(rootNode: Parser.SyntaxNode): string[] {\n  const imports: string[] = [];\n  \n  function traverse(node: Parser.SyntaxNode) {\n    // Handle import statements (shared node type between languages)\n    if (node.type === 'import_statement') {\n      // TypeScript/JavaScript: Extract just the module path from 'source' field\n      const sourceNode = node.childForFieldName('source');\n      if (sourceNode) {\n        // TS/JS import with source field\n        const importPath = sourceNode.text.replace(/['\"]/g, '');\n        imports.push(importPath);\n      } else {\n        // Python import without source field (e.g., \"import os\")\n        const importText = node.text.split('\\n')[0];\n        imports.push(importText);\n      }\n    }\n    // Python-specific: from...import statements\n    else if (node.type === 'import_from_statement') {\n      // Python: Get the entire import line (first line only)\n      const importText = node.text.split('\\n')[0];\n      imports.push(importText);\n    }\n    \n    // Only traverse top-level nodes for imports\n    if (node === rootNode) {\n      for (let i = 0; i < node.namedChildCount; i++) {\n        const child = node.namedChild(i);\n        if (child) traverse(child);\n      }\n    }\n  }\n  \n  traverse(rootNode);\n  return imports;\n}\n","import type Parser from 'tree-sitter';\nimport type { LanguageTraverser, DeclarationFunctionInfo } from './types.js';\n\n/**\n * TypeScript/JavaScript AST traverser\n * \n * Handles TypeScript and JavaScript AST node types and traversal patterns.\n * Both languages share the same AST structure (via tree-sitter-typescript).\n */\nexport class TypeScriptTraverser implements LanguageTraverser {\n  targetNodeTypes = [\n    'function_declaration',\n    'function',\n    'interface_declaration',\n    'method_definition',\n    'lexical_declaration',    // For const/let with arrow functions\n    'variable_declaration',   // For var with functions\n  ];\n  \n  containerTypes = [\n    'class_declaration',      // We extract methods, not the class itself\n  ];\n  \n  declarationTypes = [\n    'lexical_declaration',    // const/let\n    'variable_declaration',   // var\n  ];\n  \n  functionTypes = [\n    'arrow_function',\n    'function_expression',\n    'function',\n  ];\n  \n  shouldExtractChildren(node: Parser.SyntaxNode): boolean {\n    return this.containerTypes.includes(node.type);\n  }\n  \n  isDeclarationWithFunction(node: Parser.SyntaxNode): boolean {\n    return this.declarationTypes.includes(node.type);\n  }\n  \n  getContainerBody(node: Parser.SyntaxNode): Parser.SyntaxNode | null {\n    if (node.type === 'class_declaration') {\n      return node.childForFieldName('body');\n    }\n    return null;\n  }\n  \n  shouldTraverseChildren(node: Parser.SyntaxNode): boolean {\n    return node.type === 'program' || \n           node.type === 'export_statement' ||\n           node.type === 'class_body';\n  }\n  \n  findParentContainerName(node: Parser.SyntaxNode): string | undefined {\n    let current = node.parent;\n    while (current) {\n      if (current.type === 'class_declaration') {\n        const nameNode = current.childForFieldName('name');\n        return nameNode?.text;\n      }\n      current = current.parent;\n    }\n    return undefined;\n  }\n  \n  /**\n   * Check if a declaration node contains a function (arrow, function expression, etc.)\n   */\n  findFunctionInDeclaration(node: Parser.SyntaxNode): DeclarationFunctionInfo {\n    const search = (n: Parser.SyntaxNode, depth: number): Parser.SyntaxNode | null => {\n      if (depth > 3) return null; // Don't search too deep\n      \n      if (this.functionTypes.includes(n.type)) {\n        return n;\n      }\n      \n      for (let i = 0; i < n.childCount; i++) {\n        const child = n.child(i);\n        if (child) {\n          const result = search(child, depth + 1);\n          if (result) return result;\n        }\n      }\n      \n      return null;\n    };\n    \n    const functionNode = search(node, 0);\n    return {\n      hasFunction: functionNode !== null,\n      functionNode,\n    };\n  }\n}\n\n/**\n * JavaScript uses the same traverser as TypeScript\n */\nexport class JavaScriptTraverser extends TypeScriptTraverser {}\n\n","import type Parser from 'tree-sitter';\nimport type { LanguageTraverser, DeclarationFunctionInfo } from './types.js';\n\n/**\n * PHP AST traverser\n * \n * Handles PHP AST node types and traversal patterns.\n * PHP uses tree-sitter-php grammar.\n */\nexport class PHPTraverser implements LanguageTraverser {\n  targetNodeTypes = [\n    'function_definition',      // function foo() {}\n    'method_declaration',       // public function bar() {}\n  ];\n  \n  containerTypes = [\n    'class_declaration',        // We extract methods, not the class itself\n    'trait_declaration',        // PHP traits\n    'interface_declaration',    // PHP interfaces (for interface methods)\n  ];\n  \n  declarationTypes = [\n    // PHP doesn't have arrow functions or const/let like JS\n    // Functions are always defined with 'function' keyword\n  ];\n  \n  functionTypes = [\n    'function_definition',\n    'method_declaration',\n  ];\n  \n  shouldExtractChildren(node: Parser.SyntaxNode): boolean {\n    return this.containerTypes.includes(node.type);\n  }\n  \n  isDeclarationWithFunction(_node: Parser.SyntaxNode): boolean {\n    // PHP doesn't have variable declarations with functions like JS/TS\n    // Functions are always defined with 'function' keyword\n    return false;\n  }\n  \n  getContainerBody(node: Parser.SyntaxNode): Parser.SyntaxNode | null {\n    if (node.type === 'class_declaration' || \n        node.type === 'trait_declaration' ||\n        node.type === 'interface_declaration') {\n      // In PHP, the body is called 'declaration_list'\n      return node.childForFieldName('body');\n    }\n    return null;\n  }\n  \n  shouldTraverseChildren(node: Parser.SyntaxNode): boolean {\n    return node.type === 'program' ||           // Top-level PHP file\n           node.type === 'php' ||               // PHP block\n           node.type === 'declaration_list';    // Body of class/trait/interface\n  }\n  \n  findParentContainerName(node: Parser.SyntaxNode): string | undefined {\n    let current = node.parent;\n    while (current) {\n      if (current.type === 'class_declaration' || \n          current.type === 'trait_declaration') {\n        const nameNode = current.childForFieldName('name');\n        return nameNode?.text;\n      }\n      current = current.parent;\n    }\n    return undefined;\n  }\n  \n  findFunctionInDeclaration(_node: Parser.SyntaxNode): DeclarationFunctionInfo {\n    // PHP doesn't have this pattern\n    return {\n      hasFunction: false,\n      functionNode: null,\n    };\n  }\n}\n\n","import type Parser from 'tree-sitter';\nimport type { LanguageTraverser, DeclarationFunctionInfo } from './types.js';\n\n/**\n * Python AST traverser\n * \n * Handles Python AST node types and traversal patterns.\n * Python has a simpler structure than TypeScript/JavaScript:\n * - Functions are defined with 'def' or 'async def'\n * - No variable declarations with functions (unlike JS const x = () => {})\n * - Classes contain methods (which are just functions)\n */\nexport class PythonTraverser implements LanguageTraverser {\n  targetNodeTypes = [\n    'function_definition',\n    'async_function_definition',\n  ];\n  \n  containerTypes = [\n    'class_definition',  // We extract methods, not the class itself\n  ];\n  \n  declarationTypes = [\n    // Python doesn't have const/let/var declarations like JS/TS\n    // Functions are always defined with 'def' or 'async def'\n  ];\n  \n  functionTypes = [\n    'function_definition',\n    'async_function_definition',\n  ];\n  \n  shouldExtractChildren(node: Parser.SyntaxNode): boolean {\n    return this.containerTypes.includes(node.type);\n  }\n  \n  isDeclarationWithFunction(_node: Parser.SyntaxNode): boolean {\n    // Python doesn't have variable declarations with functions like JS/TS\n    // Functions are always defined with 'def' or 'async def'\n    return false;\n  }\n  \n  getContainerBody(node: Parser.SyntaxNode): Parser.SyntaxNode | null {\n    if (node.type === 'class_definition') {\n      // In Python, the class body is called 'block'\n      return node.childForFieldName('body');\n    }\n    return null;\n  }\n  \n  shouldTraverseChildren(node: Parser.SyntaxNode): boolean {\n    return node.type === 'module' ||  // Top-level Python file\n           node.type === 'block';     // Body of class/function\n  }\n  \n  findParentContainerName(node: Parser.SyntaxNode): string | undefined {\n    let current = node.parent;\n    while (current) {\n      if (current.type === 'class_definition') {\n        const nameNode = current.childForFieldName('name');\n        return nameNode?.text;\n      }\n      current = current.parent;\n    }\n    return undefined;\n  }\n  \n  /**\n   * Python doesn't have this pattern (const x = () => {})\n   * Functions are always defined with 'def' or 'async def'\n   */\n  findFunctionInDeclaration(_node: Parser.SyntaxNode): DeclarationFunctionInfo {\n    return {\n      hasFunction: false,\n      functionNode: null,\n    };\n  }\n}\n\n","import type { SupportedLanguage } from '../types.js';\nimport type { LanguageTraverser } from './types.js';\nimport { TypeScriptTraverser, JavaScriptTraverser } from './typescript.js';\nimport { PHPTraverser } from './php.js';\nimport { PythonTraverser } from './python.js';\n\nexport type { LanguageTraverser, DeclarationFunctionInfo } from './types.js';\n\n/**\n * Registry of language traversers\n * \n * Maps each supported language to its traverser implementation.\n * When adding a new language:\n * 1. Create a new traverser class implementing LanguageTraverser\n * 2. Add it to this registry\n * 3. Update SupportedLanguage type in ../types.ts\n */\nconst traverserRegistry: Record<SupportedLanguage, LanguageTraverser> = {\n  typescript: new TypeScriptTraverser(),\n  javascript: new JavaScriptTraverser(),\n  php: new PHPTraverser(),\n  python: new PythonTraverser(),\n};\n\n/**\n * Get the traverser for a specific language\n * \n * @param language - Programming language\n * @returns Language-specific traverser\n * @throws Error if language is not supported\n */\nexport function getTraverser(language: SupportedLanguage): LanguageTraverser {\n  const traverser = traverserRegistry[language];\n  \n  if (!traverser) {\n    throw new Error(`No traverser available for language: ${language}`);\n  }\n  \n  return traverser;\n}\n\n/**\n * Check if a language has a traverser implementation\n * \n * @param language - Programming language\n * @returns True if traverser exists\n */\nexport function hasTraverser(language: SupportedLanguage): boolean {\n  return language in traverserRegistry;\n}\n\n","import type Parser from 'tree-sitter';\nimport type { ASTChunk } from './types.js';\nimport { parseAST, detectLanguage, isASTSupported } from './parser.js';\nimport { extractSymbolInfo, extractImports } from './symbols.js';\nimport { calculateCognitiveComplexity, calculateHalstead } from './complexity/index.js';\nimport { getTraverser } from './traversers/index.js';\n\nexport interface ASTChunkOptions {\n  maxChunkSize?: number; // Reserved for future use (smart splitting of large functions)\n  minChunkSize?: number;\n}\n\n/**\n * Chunk a file using AST-based semantic boundaries\n * \n * Uses Tree-sitter to parse code into an AST and extract semantic chunks\n * (functions, classes, methods) that respect code structure.\n * \n * **Known Limitations:**\n * - Tree-sitter may fail with \"Invalid argument\" error on very large files (1000+ lines)\n * - When this occurs, Lien automatically falls back to line-based chunking\n * - Configure fallback behavior via `chunking.astFallback` ('line-based' or 'error')\n * \n * @param filepath - Path to the file\n * @param content - File content\n * @param options - Chunking options\n * @returns Array of AST-aware chunks\n * @throws Error if AST parsing fails and astFallback is 'error'\n */\nexport function chunkByAST(\n  filepath: string,\n  content: string,\n  options: ASTChunkOptions = {}\n): ASTChunk[] {\n  const { minChunkSize = 5 } = options;\n  \n  // Check if AST is supported for this file\n  const language = detectLanguage(filepath);\n  if (!language) {\n    throw new Error(`Unsupported language for file: ${filepath}`);\n  }\n  \n  // Parse the file\n  const parseResult = parseAST(content, language);\n  \n  // If parsing failed, throw error (caller should fallback to line-based)\n  if (!parseResult.tree) {\n    throw new Error(`Failed to parse ${filepath}: ${parseResult.error}`);\n  }\n  \n  const chunks: ASTChunk[] = [];\n  const lines = content.split('\\n');\n  const rootNode = parseResult.tree.rootNode;\n  \n  // Get language-specific traverser\n  const traverser = getTraverser(language);\n  \n  // Extract file-level imports once\n  const fileImports = extractImports(rootNode);\n  \n  // Find all top-level function and class declarations\n  const topLevelNodes = findTopLevelNodes(rootNode, traverser);\n  \n  for (const node of topLevelNodes) {\n    // For variable declarations, try to find the function inside\n    let actualNode = node;\n    if (traverser.isDeclarationWithFunction(node)) {\n      const declInfo = traverser.findFunctionInDeclaration(node);\n      if (declInfo.functionNode) {\n        actualNode = declInfo.functionNode;\n      }\n    }\n    \n    // For methods, find the parent container name (e.g., class name)\n    const parentClassName = traverser.findParentContainerName(actualNode);\n    \n    const symbolInfo = extractSymbolInfo(actualNode, content, parentClassName, language);\n    \n    // Extract the code for this node (use original node for full declaration)\n    const nodeContent = getNodeContent(node, lines);\n    \n    // Create a chunk for this semantic unit\n    // Note: Large functions are kept as single chunks (may exceed maxChunkSize)\n    // This preserves semantic boundaries - better than splitting mid-function\n    chunks.push(createChunk(filepath, node, nodeContent, symbolInfo, fileImports, language));\n  }\n  \n  // Handle remaining code (imports, exports, top-level statements)\n  const coveredRanges = topLevelNodes.map(n => ({\n    start: n.startPosition.row,\n    end: n.endPosition.row,\n  }));\n  \n  const uncoveredChunks = extractUncoveredCode(\n    lines,\n    coveredRanges,\n    filepath,\n    minChunkSize,\n    fileImports,\n    language\n  );\n  \n  chunks.push(...uncoveredChunks);\n  \n  // Sort chunks by line number\n  chunks.sort((a, b) => a.metadata.startLine - b.metadata.startLine);\n  \n  return chunks;\n}\n\n/** Check if node is a function-containing declaration at top level */\nfunction isFunctionDeclaration(\n  node: Parser.SyntaxNode,\n  depth: number,\n  traverser: ReturnType<typeof getTraverser>\n): boolean {\n  if (depth !== 0 || !traverser.isDeclarationWithFunction(node)) return false;\n  return traverser.findFunctionInDeclaration(node).hasFunction;\n}\n\n/** Check if node is a target type at valid depth */\nfunction isTargetNode(\n  node: Parser.SyntaxNode,\n  depth: number,\n  traverser: ReturnType<typeof getTraverser>\n): boolean {\n  return depth <= 1 && traverser.targetNodeTypes.includes(node.type);\n}\n\n/**\n * Find all top-level nodes that should become chunks\n * \n * Uses a language-specific traverser to handle different AST structures.\n * This function is now language-agnostic - all language-specific logic\n * is delegated to the traverser.\n * \n * @param rootNode - Root AST node\n * @param traverser - Language-specific traverser\n * @returns Array of nodes to extract as chunks\n */\nfunction findTopLevelNodes(\n  rootNode: Parser.SyntaxNode,\n  traverser: ReturnType<typeof getTraverser>\n): Parser.SyntaxNode[] {\n  const nodes: Parser.SyntaxNode[] = [];\n  \n  function traverse(node: Parser.SyntaxNode, depth: number): void {\n    // Capture function declarations and target nodes\n    if (isFunctionDeclaration(node, depth, traverser) || isTargetNode(node, depth, traverser)) {\n      nodes.push(node);\n      return;\n    }\n    \n    // Handle containers - traverse body at increased depth\n    if (traverser.shouldExtractChildren(node)) {\n      const body = traverser.getContainerBody(node);\n      if (body) traverse(body, depth + 1);\n      return;\n    }\n    \n    // Traverse children of traversable nodes\n    if (!traverser.shouldTraverseChildren(node)) return;\n    for (let i = 0; i < node.namedChildCount; i++) {\n      const child = node.namedChild(i);\n      if (child) traverse(child, depth);\n    }\n  }\n  \n  traverse(rootNode, 0);\n  return nodes;\n}\n\n/**\n * Extract content for a specific AST node\n */\nfunction getNodeContent(node: Parser.SyntaxNode, lines: string[]): string {\n  const startLine = node.startPosition.row;\n  const endLine = node.endPosition.row;\n  \n  return lines.slice(startLine, endLine + 1).join('\\n');\n}\n\n/** Maps symbol types to legacy symbol array keys */\nconst SYMBOL_TYPE_TO_ARRAY: Record<string, 'functions' | 'classes' | 'interfaces'> = {\n  function: 'functions',\n  method: 'functions',\n  class: 'classes',\n  interface: 'interfaces',\n};\n\n/** Symbol types that have meaningful complexity metrics */\nconst COMPLEXITY_SYMBOL_TYPES = new Set(['function', 'method']);\n\n/**\n * Build legacy symbols object for backward compatibility\n */\nfunction buildLegacySymbols(symbolInfo: ReturnType<typeof extractSymbolInfo>): {\n  functions: string[];\n  classes: string[];\n  interfaces: string[];\n} {\n  const symbols = { functions: [] as string[], classes: [] as string[], interfaces: [] as string[] };\n  \n  if (symbolInfo?.name && symbolInfo.type) {\n    const arrayKey = SYMBOL_TYPE_TO_ARRAY[symbolInfo.type];\n    if (arrayKey) symbols[arrayKey].push(symbolInfo.name);\n  }\n  \n  return symbols;\n}\n\n/**\n * Determine chunk type from symbol info\n */\nfunction getChunkType(symbolInfo: ReturnType<typeof extractSymbolInfo>): 'block' | 'class' | 'function' {\n  if (!symbolInfo) return 'block';\n  return symbolInfo.type === 'class' ? 'class' : 'function';\n}\n\n/**\n * Create a chunk from an AST node\n */\nfunction createChunk(\n  filepath: string,\n  node: Parser.SyntaxNode,\n  content: string,\n  symbolInfo: ReturnType<typeof extractSymbolInfo>,\n  imports: string[],\n  language: string\n): ASTChunk {\n  const symbols = buildLegacySymbols(symbolInfo);\n  const shouldCalcComplexity = symbolInfo?.type && COMPLEXITY_SYMBOL_TYPES.has(symbolInfo.type);\n  \n  // Calculate complexity metrics only for functions and methods\n  const cognitiveComplexity = shouldCalcComplexity\n    ? calculateCognitiveComplexity(node)\n    : undefined;\n  \n  // Calculate Halstead metrics only for functions and methods\n  const halstead = shouldCalcComplexity\n    ? calculateHalstead(node, language)\n    : undefined;\n  \n  return {\n    content,\n    metadata: {\n      file: filepath,\n      startLine: node.startPosition.row + 1,\n      endLine: node.endPosition.row + 1,\n      type: getChunkType(symbolInfo),\n      language,\n      symbols,\n      symbolName: symbolInfo?.name,\n      symbolType: symbolInfo?.type,\n      parentClass: symbolInfo?.parentClass,\n      complexity: symbolInfo?.complexity,\n      cognitiveComplexity,\n      parameters: symbolInfo?.parameters,\n      signature: symbolInfo?.signature,\n      imports,\n      // Halstead metrics\n      halsteadVolume: halstead?.volume,\n      halsteadDifficulty: halstead?.difficulty,\n      halsteadEffort: halstead?.effort,\n      halsteadBugs: halstead?.bugs,\n    },\n  };\n}\n\n/**\n * Represents a range of lines in a file\n */\ninterface LineRange {\n  start: number;\n  end: number;\n}\n\n/**\n * Find gaps between covered ranges (uncovered code)\n */\nfunction findUncoveredRanges(\n  coveredRanges: LineRange[],\n  totalLines: number\n): LineRange[] {\n  const uncoveredRanges: LineRange[] = [];\n  let currentStart = 0;\n  \n  // Sort covered ranges\n  const sortedRanges = [...coveredRanges].sort((a, b) => a.start - b.start);\n  \n  for (const range of sortedRanges) {\n    if (currentStart < range.start) {\n      // There's a gap before this range\n      uncoveredRanges.push({\n        start: currentStart,\n        end: range.start - 1,\n      });\n    }\n    currentStart = range.end + 1;\n  }\n  \n  // Handle remaining code after last covered range\n  if (currentStart < totalLines) {\n    uncoveredRanges.push({\n      start: currentStart,\n      end: totalLines - 1,\n    });\n  }\n  \n  return uncoveredRanges;\n}\n\n/**\n * Create a chunk from a line range\n */\nfunction createChunkFromRange(\n  range: LineRange,\n  lines: string[],\n  filepath: string,\n  language: string,\n  imports: string[]\n): ASTChunk {\n  const uncoveredLines = lines.slice(range.start, range.end + 1);\n  const content = uncoveredLines.join('\\n').trim();\n  \n  return {\n    content,\n    metadata: {\n      file: filepath,\n      startLine: range.start + 1,\n      endLine: range.end + 1,\n      type: 'block',\n      language,\n      // Empty symbols for uncovered code (imports, exports, etc.)\n      symbols: { functions: [], classes: [], interfaces: [] },\n      imports,\n    },\n  };\n}\n\n/**\n * Validate that a chunk meets the minimum size requirements\n */\nfunction isValidChunk(chunk: ASTChunk, minChunkSize: number): boolean {\n  const lineCount = chunk.metadata.endLine - chunk.metadata.startLine + 1;\n  return chunk.content.length > 0 && lineCount >= minChunkSize;\n}\n\n/**\n * Extract code that wasn't covered by function/class chunks\n * (imports, exports, top-level statements)\n */\nfunction extractUncoveredCode(\n  lines: string[],\n  coveredRanges: Array<{ start: number; end: number }>,\n  filepath: string,\n  minChunkSize: number,\n  imports: string[],\n  language: string\n): ASTChunk[] {\n  const uncoveredRanges = findUncoveredRanges(coveredRanges, lines.length);\n  \n  return uncoveredRanges\n    .map(range => createChunkFromRange(range, lines, filepath, language, imports))\n    .filter(chunk => isValidChunk(chunk, minChunkSize));\n}\n\n/**\n * Check if AST chunking should be used for a file\n */\nexport function shouldUseAST(filepath: string): boolean {\n  return isASTSupported(filepath);\n}\n\n","import type { CodeChunk } from './types.js';\n\n/**\n * Liquid-specific chunking for Shopify themes\n * \n * Uses regex to identify special Liquid blocks (schema, style, javascript)\n * and keeps them as single semantic units\n */\n\ninterface LiquidBlock {\n  type: 'schema' | 'style' | 'javascript' | 'template';\n  startLine: number;\n  endLine: number;\n  content: string;\n}\n\n/**\n * Extract schema name from JSON content\n * \n * Extracts the \"name\" field from Shopify schema JSON.\n * Uses JSON.parse to properly handle escaped quotes and other JSON edge cases.\n * \n * Example:\n * {% schema %}\n * {\n *   \"name\": \"My \\\"Special\\\" Section\",\n *   \"settings\": []\n * }\n * {% endschema %}\n * \n * Returns: 'My \"Special\" Section' (with literal quotes, unescaped)\n */\nfunction extractSchemaName(schemaContent: string): string | undefined {\n  try {\n    // Remove Liquid tags to isolate JSON content\n    // Replace {% schema %} and {% endschema %} (with optional whitespace control)\n    let jsonContent = schemaContent\n      .replace(/\\{%-?\\s*schema\\s*-?%\\}/g, '')\n      .replace(/\\{%-?\\s*endschema\\s*-?%\\}/g, '')\n      .trim();\n    \n    // Parse the JSON\n    const schema = JSON.parse(jsonContent);\n    // Ensure name is a string before returning\n    return typeof schema.name === 'string' ? schema.name : undefined;\n  } catch (error) {\n    // Invalid JSON - return undefined\n    // This is acceptable: schema blocks with invalid JSON won't have names extracted\n  }\n  return undefined;\n}\n\n/**\n * Remove Liquid comment blocks from content to avoid extracting tags from comments\n * \n * Example:\n * {% comment %}Don't use {% render 'old-snippet' %}{% endcomment %}\n * → (removed)\n */\nfunction removeComments(content: string): string {\n  // Remove {% comment %}...{% endcomment %} blocks (with optional whitespace control)\n  return content.replace(/\\{%-?\\s*comment\\s*-?%\\}[\\s\\S]*?\\{%-?\\s*endcomment\\s*-?%\\}/g, '');\n}\n\n/**\n * Extract dependencies from {% render %}, {% include %}, and {% section %} tags\n * \n * Examples:\n * - {% render 'product-card' %} → 'product-card'\n * - {% render \"cart-item\", product: product %} → 'cart-item'\n * - {% include 'snippets/header' %} → 'snippets/header'\n * - {% section 'announcement-bar' %} → 'announcement-bar'\n * \n * Limitations:\n * - Does not handle escaped quotes in snippet names (e.g., {% render 'name\\'s' %})\n * - This is acceptable because Shopify snippet names map to filenames, and\n *   filesystem restrictions prevent quotes in filenames (snippets/name's.liquid is invalid)\n * - In practice, Shopify snippet names use only alphanumeric, dash, and underscore\n * \n * Note: Expects content with comments already removed for performance\n * \n * @param contentWithoutComments - Content with Liquid comments already removed\n */\nfunction extractRenderTags(contentWithoutComments: string): string[] {\n  const dependencies = new Set<string>();\n  \n  // Match {% render 'snippet-name' %} or {% render \"snippet-name\" %}\n  // Note: Does not handle escaped quotes - see function docs for rationale\n  const renderPattern = /\\{%-?\\s*render\\s+['\"]([^'\"]+)['\"]/g;\n  let match;\n  \n  while ((match = renderPattern.exec(contentWithoutComments)) !== null) {\n    dependencies.add(match[1]);\n  }\n  \n  // Match {% include 'snippet-name' %} or {% include \"snippet-name\" %}\n  const includePattern = /\\{%-?\\s*include\\s+['\"]([^'\"]+)['\"]/g;\n  \n  while ((match = includePattern.exec(contentWithoutComments)) !== null) {\n    dependencies.add(match[1]);\n  }\n  \n  // Match {% section 'section-name' %} or {% section \"section-name\" %}\n  const sectionPattern = /\\{%-?\\s*section\\s+['\"]([^'\"]+)['\"]/g;\n  \n  while ((match = sectionPattern.exec(contentWithoutComments)) !== null) {\n    dependencies.add(match[1]);\n  }\n  \n  return Array.from(dependencies);\n}\n\n/**\n * Find all special Liquid blocks in the template\n * \n * Limitation: Does not support nested blocks of the same type.\n * - Matches first start tag with first end tag\n * - This is acceptable because Shopify Liquid does not allow nested blocks\n * - Example invalid: {% schema %}...{% schema %}...{% endschema %} (Shopify rejects this)\n * - If malformed input contains nested blocks, only outermost block is extracted\n */\nfunction findLiquidBlocks(content: string): LiquidBlock[] {\n  const lines = content.split('\\n');\n  const blocks: LiquidBlock[] = [];\n  \n  // Regex patterns for Liquid blocks\n  // Note: Matches first start → first end (no nesting support, which is correct for Shopify)\n  const blockPatterns = [\n    { type: 'schema' as const, start: /\\{%-?\\s*schema\\s*-?%\\}/, end: /\\{%-?\\s*endschema\\s*-?%\\}/ },\n    { type: 'style' as const, start: /\\{%-?\\s*style\\s*-?%\\}/, end: /\\{%-?\\s*endstyle\\s*-?%\\}/ },\n    { type: 'javascript' as const, start: /\\{%-?\\s*javascript\\s*-?%\\}/, end: /\\{%-?\\s*endjavascript\\s*-?%\\}/ },\n  ];\n  \n  for (const pattern of blockPatterns) {\n    let searchStart = 0;\n    \n    while (searchStart < lines.length) {\n      // Find start tag\n      const startIdx = lines.findIndex((line, idx) => \n        idx >= searchStart && pattern.start.test(line)\n      );\n      \n      if (startIdx === -1) break;\n      \n      // Find end tag (allow same line for single-line blocks)\n      const endIdx = lines.findIndex((line, idx) => \n        idx >= startIdx && pattern.end.test(line)\n      );\n      \n      if (endIdx === -1) {\n        // No end tag found, treat rest as template\n        break;\n      }\n      \n      // Extract block content\n      const blockContent = lines.slice(startIdx, endIdx + 1).join('\\n');\n      \n      blocks.push({\n        type: pattern.type,\n        startLine: startIdx,\n        endLine: endIdx,\n        content: blockContent,\n      });\n      \n      searchStart = endIdx + 1;\n    }\n  }\n  \n  return blocks.sort((a, b) => a.startLine - b.startLine);\n}\n\n/**\n * Chunk a Liquid template file\n * \n * Special handling for:\n * - {% schema %} blocks (kept together, extract section name)\n * - {% style %} blocks (kept together)  \n * - {% javascript %} blocks (kept together)\n * - {% render %}, {% include %}, and {% section %} tags (tracked as imports)\n * - Regular template content (chunked by lines)\n */\nexport function chunkLiquidFile(\n  filepath: string,\n  content: string,\n  chunkSize: number = 75,\n  chunkOverlap: number = 10\n): CodeChunk[] {\n  const lines = content.split('\\n');\n  const blocks = findLiquidBlocks(content);\n  const chunks: CodeChunk[] = [];\n  \n  // Remove comments once for performance (avoids repeated regex operations)\n  const contentWithoutComments = removeComments(content);\n  const linesWithoutComments = contentWithoutComments.split('\\n');\n  \n  // Track which lines are covered by special blocks\n  const coveredLines = new Set<number>();\n  \n  // Create chunks for special blocks\n  for (const block of blocks) {\n    // Mark lines as covered\n    for (let i = block.startLine; i <= block.endLine; i++) {\n      coveredLines.add(i);\n    }\n    \n    // Extract metadata\n    let symbolName: string | undefined;\n    if (block.type === 'schema') {\n      symbolName = extractSchemaName(block.content);\n    }\n    \n    // Extract render/include tags from cleaned content (comments already removed)\n    const blockContentWithoutComments = linesWithoutComments\n      .slice(block.startLine, block.endLine + 1)\n      .join('\\n');\n    const imports = extractRenderTags(blockContentWithoutComments);\n    \n    const blockLineCount = block.endLine - block.startLine + 1;\n    const maxBlockSize = chunkSize * 3; // Allow blocks up to 3x chunk size before splitting\n    \n    // If block is reasonably sized, keep it as one chunk\n    if (blockLineCount <= maxBlockSize) {\n      chunks.push({\n        content: block.content,\n        metadata: {\n          file: filepath,\n          startLine: block.startLine + 1, // 1-indexed\n          endLine: block.endLine + 1,\n          language: 'liquid',\n          type: 'block',\n          symbolName,\n          symbolType: block.type,\n          imports: imports.length > 0 ? imports : undefined,\n        },\n      });\n    } else {\n      // Block is too large - split it into multiple chunks with overlap\n      const blockLines = block.content.split('\\n');\n      \n      for (let offset = 0; offset < blockLines.length; offset += chunkSize - chunkOverlap) {\n        const endOffset = Math.min(offset + chunkSize, blockLines.length);\n        const chunkContent = blockLines.slice(offset, endOffset).join('\\n');\n        \n        if (chunkContent.trim().length > 0) {\n          chunks.push({\n            content: chunkContent,\n            metadata: {\n              file: filepath,\n              startLine: block.startLine + offset + 1, // 1-indexed\n              endLine: block.startLine + endOffset, // 1-indexed (endOffset already accounts for exclusivity)\n              language: 'liquid',\n              type: 'block',\n              symbolName, // Preserve symbol name for all split chunks\n              symbolType: block.type,\n              imports: imports.length > 0 ? imports : undefined,\n            },\n          });\n        }\n        \n        if (endOffset >= blockLines.length) break;\n      }\n    }\n  }\n  \n  // Chunk uncovered template content\n  let currentChunk: string[] = [];\n  let chunkStartLine = 0;\n  \n  for (let i = 0; i < lines.length; i++) {\n    // Skip lines covered by special blocks\n    if (coveredLines.has(i)) {\n      // Flush current chunk if any\n      if (currentChunk.length > 0) {\n        const chunkContent = currentChunk.join('\\n');\n        \n        // Only push non-empty chunks\n        if (chunkContent.trim().length > 0) {\n          // Extract from cleaned content (comments already removed)\n          const cleanedChunk = linesWithoutComments.slice(chunkStartLine, i).join('\\n');\n          const imports = extractRenderTags(cleanedChunk);\n          \n          chunks.push({\n            content: chunkContent,\n            metadata: {\n              file: filepath,\n              startLine: chunkStartLine + 1,\n              endLine: i,\n              language: 'liquid',\n              type: 'template',\n              imports: imports.length > 0 ? imports : undefined,\n            },\n          });\n        }\n        currentChunk = [];\n      }\n      continue;\n    }\n    \n    // Start new chunk if needed\n    if (currentChunk.length === 0) {\n      chunkStartLine = i;\n    }\n    \n    currentChunk.push(lines[i]);\n    \n    // Flush if chunk is full\n    if (currentChunk.length >= chunkSize) {\n      const chunkContent = currentChunk.join('\\n');\n      \n      // Only push non-empty chunks\n      if (chunkContent.trim().length > 0) {\n        // Extract from cleaned content (comments already removed)\n        const cleanedChunk = linesWithoutComments.slice(chunkStartLine, i + 1).join('\\n');\n        const imports = extractRenderTags(cleanedChunk);\n        \n        chunks.push({\n          content: chunkContent,\n          metadata: {\n            file: filepath,\n            startLine: chunkStartLine + 1,\n            endLine: i + 1,\n            language: 'liquid',\n            type: 'template',\n            imports: imports.length > 0 ? imports : undefined,\n          },\n        });\n      }\n      \n      // Add overlap for next chunk\n      currentChunk = currentChunk.slice(-chunkOverlap);\n      chunkStartLine = Math.max(0, i + 1 - chunkOverlap);\n    }\n  }\n  \n  // Flush remaining chunk\n  if (currentChunk.length > 0) {\n    const chunkContent = currentChunk.join('\\n');\n    \n    // Skip empty or whitespace-only chunks\n    if (chunkContent.trim().length === 0) {\n      return chunks.sort((a, b) => a.metadata.startLine - b.metadata.startLine);\n    }\n    \n    // Extract from cleaned content (comments already removed)\n    const cleanedChunk = linesWithoutComments.slice(chunkStartLine, lines.length).join('\\n');\n    const imports = extractRenderTags(cleanedChunk);\n    \n    chunks.push({\n      content: chunkContent,\n      metadata: {\n        file: filepath,\n        startLine: chunkStartLine + 1,\n        endLine: lines.length,\n        language: 'liquid',\n        type: 'template',\n        imports: imports.length > 0 ? imports : undefined,\n      },\n    });\n  }\n  \n  // Sort by line number\n  return chunks.sort((a, b) => a.metadata.startLine - b.metadata.startLine);\n}\n\n","import type { CodeChunk } from './types.js';\n\n/**\n * Shopify JSON template chunking\n * \n * JSON template files define which sections appear on a template page.\n * We extract section references to track dependencies.\n * \n * Example structure:\n * {\n *   \"sections\": {\n *     \"main\": { \"type\": \"main-product\", \"settings\": {...} },\n *     \"recommendations\": { \"type\": \"product-recommendations\", \"settings\": {...} }\n *   },\n *   \"order\": [\"main\", \"recommendations\"]\n * }\n */\n\n/**\n * Extract section types from a Shopify JSON template\n * \n * These are the actual section file names (e.g., \"main-product\" → sections/main-product.liquid)\n */\nfunction extractSectionReferences(jsonContent: string): string[] {\n  try {\n    const template = JSON.parse(jsonContent);\n    const sectionTypes = new Set<string>();\n    \n    // Extract from sections object\n    if (template.sections && typeof template.sections === 'object') {\n      for (const section of Object.values(template.sections)) {\n        if (\n          typeof section === 'object' && \n          section !== null && \n          'type' in section && \n          typeof section.type === 'string'\n        ) {\n          sectionTypes.add(section.type);\n        }\n      }\n    }\n    \n    return Array.from(sectionTypes);\n  } catch (error) {\n    // Invalid JSON - return empty array\n    console.warn(`[Lien] Failed to parse JSON template: ${error instanceof Error ? error.message : String(error)}`);\n    return [];\n  }\n}\n\n/**\n * Extract the template name from the filepath\n * \n * templates/customers/account.json → \"customers/account\"\n * templates/product.json → \"product\"\n */\nfunction extractTemplateName(filepath: string): string | undefined {\n  // Match everything after templates/ up to .json\n  const match = filepath.match(/templates\\/(.+)\\.json$/);\n  return match ? match[1] : undefined;\n}\n\n/**\n * Chunk a Shopify JSON template file\n * \n * JSON templates are typically small (define section layout),\n * so we keep them as a single chunk and extract section references.\n */\nexport function chunkJSONTemplate(\n  filepath: string,\n  content: string\n): CodeChunk[] {\n  // Skip empty files\n  if (content.trim().length === 0) {\n    return [];\n  }\n  \n  const lines = content.split('\\n');\n  const templateName = extractTemplateName(filepath);\n  const sectionReferences = extractSectionReferences(content);\n  \n  return [{\n    content,\n    metadata: {\n      file: filepath,\n      startLine: 1,\n      endLine: lines.length,\n      language: 'json',\n      type: 'template',\n      symbolName: templateName,\n      symbolType: 'template',\n      imports: sectionReferences.length > 0 ? sectionReferences : undefined,\n    },\n  }];\n}\n\n","import { CodeChunk } from './types.js';\nimport { detectLanguage } from './scanner.js';\nimport { extractSymbols } from './symbol-extractor.js';\nimport { shouldUseAST, chunkByAST } from './ast/chunker.js';\nimport { chunkLiquidFile } from './liquid-chunker.js';\nimport { chunkJSONTemplate } from './json-template-chunker.js';\n\nexport interface ChunkOptions {\n  chunkSize?: number;\n  chunkOverlap?: number;\n  useAST?: boolean; // Flag to enable AST-based chunking\n  astFallback?: 'line-based' | 'error'; // How to handle AST parsing errors\n}\n\nexport function chunkFile(\n  filepath: string,\n  content: string,\n  options: ChunkOptions = {}\n): CodeChunk[] {\n  const { chunkSize = 75, chunkOverlap = 10, useAST = true, astFallback = 'line-based' } = options;\n  \n  // Special handling for Liquid files\n  if (filepath.endsWith('.liquid')) {\n    return chunkLiquidFile(filepath, content, chunkSize, chunkOverlap);\n  }\n  \n  // Special handling for Shopify JSON template files (templates/**/*.json)\n  // Use regex to ensure 'templates/' is a path segment, not part of another name\n  // Matches: templates/product.json OR some-path/templates/customers/account.json\n  // Rejects: my-templates/config.json OR node_modules/pkg/templates/file.json (filtered by scanner)\n  if (filepath.endsWith('.json') && /(?:^|\\/)templates\\//.test(filepath)) {\n    return chunkJSONTemplate(filepath, content);\n  }\n  \n  // Try AST-based chunking for supported languages\n  if (useAST && shouldUseAST(filepath)) {\n    try {\n      return chunkByAST(filepath, content, {\n        minChunkSize: Math.floor(chunkSize / 10),\n      });\n    } catch (error) {\n      // Handle AST errors based on configuration\n      if (astFallback === 'error') {\n        // Throw error if user wants strict AST-only behavior\n        throw new Error(`AST chunking failed for ${filepath}: ${error instanceof Error ? error.message : String(error)}`);\n      }\n      // Otherwise fallback to line-based chunking\n      console.warn(`AST chunking failed for ${filepath}, falling back to line-based:`, error);\n    }\n  }\n  \n  // Line-based chunking (original implementation)\n  return chunkByLines(filepath, content, chunkSize, chunkOverlap);\n}\n\n/**\n * Original line-based chunking implementation\n */\nfunction chunkByLines(\n  filepath: string,\n  content: string,\n  chunkSize: number,\n  chunkOverlap: number\n): CodeChunk[] {\n  const lines = content.split('\\n');\n  const chunks: CodeChunk[] = [];\n  const language = detectLanguage(filepath);\n  \n  // Handle empty files\n  if (lines.length === 0 || (lines.length === 1 && lines[0].trim() === '')) {\n    return chunks;\n  }\n  \n  // Chunk by lines with overlap\n  for (let i = 0; i < lines.length; i += chunkSize - chunkOverlap) {\n    const endLine = Math.min(i + chunkSize, lines.length);\n    const chunkLines = lines.slice(i, endLine);\n    const chunkContent = chunkLines.join('\\n');\n    \n    // Skip empty chunks\n    if (chunkContent.trim().length === 0) {\n      continue;\n    }\n    \n    // Extract symbols from the chunk\n    const symbols = extractSymbols(chunkContent, language);\n    \n    chunks.push({\n      content: chunkContent,\n      metadata: {\n        file: filepath,\n        startLine: i + 1,\n        endLine: endLine,\n        type: 'block', // MVP: all chunks are 'block' type\n        language,\n        symbols,\n      },\n    });\n    \n    // If we've reached the end, break\n    if (endLine >= lines.length) {\n      break;\n    }\n  }\n  \n  return chunks;\n}\n\nexport function chunkText(text: string, options: ChunkOptions = {}): string[] {\n  const { chunkSize = 75, chunkOverlap = 10 } = options;\n  \n  const lines = text.split('\\n');\n  const chunks: string[] = [];\n  \n  for (let i = 0; i < lines.length; i += chunkSize - chunkOverlap) {\n    const endLine = Math.min(i + chunkSize, lines.length);\n    const chunkLines = lines.slice(i, endLine);\n    const chunkContent = chunkLines.join('\\n');\n    \n    if (chunkContent.trim().length > 0) {\n      chunks.push(chunkContent);\n    }\n    \n    if (endLine >= lines.length) {\n      break;\n    }\n  }\n  \n  return chunks;\n}\n\n","import { pipeline, env, type FeatureExtractionPipeline } from '@xenova/transformers';\nimport { EmbeddingService } from './types.js';\nimport { EmbeddingError, wrapError } from '../errors/index.js';\nimport { DEFAULT_EMBEDDING_MODEL } from '../constants.js';\n\n// Configure transformers.js to cache models locally\nenv.allowRemoteModels = true;\nenv.allowLocalModels = true;\n\nexport class LocalEmbeddings implements EmbeddingService {\n  private extractor: FeatureExtractionPipeline | null = null;\n  private readonly modelName = DEFAULT_EMBEDDING_MODEL;\n  private initPromise: Promise<void> | null = null;\n  \n  async initialize(): Promise<void> {\n    // Prevent multiple simultaneous initializations\n    if (this.initPromise) {\n      return this.initPromise;\n    }\n    \n    if (this.extractor) {\n      return;\n    }\n    \n    this.initPromise = (async () => {\n      try {\n        // This downloads ~100MB on first run, then caches in ~/.cache/huggingface\n        this.extractor = await pipeline('feature-extraction', this.modelName) as FeatureExtractionPipeline;\n      } catch (error: unknown) {\n        this.initPromise = null;\n        throw wrapError(error, 'Failed to initialize embedding model');\n      }\n    })();\n    \n    return this.initPromise;\n  }\n  \n  async embed(text: string): Promise<Float32Array> {\n    await this.initialize();\n    \n    if (!this.extractor) {\n      throw new EmbeddingError('Embedding model not initialized');\n    }\n    \n    try {\n      const output = await this.extractor(text, {\n        pooling: 'mean',\n        normalize: true,\n      });\n      \n      return output.data as Float32Array;\n    } catch (error: unknown) {\n      throw wrapError(error, 'Failed to generate embedding', { textLength: text.length });\n    }\n  }\n  \n  async embedBatch(texts: string[]): Promise<Float32Array[]> {\n    await this.initialize();\n    \n    if (!this.extractor) {\n      throw new EmbeddingError('Embedding model not initialized');\n    }\n    \n    try {\n      // Process embeddings with Promise.all for concurrent execution\n      // Each call is sequential but Promise.all allows task interleaving\n      const results = await Promise.all(\n        texts.map(text => this.embed(text))\n      );\n      return results;\n    } catch (error: unknown) {\n      throw wrapError(error, 'Failed to generate batch embeddings', { batchSize: texts.length });\n    }\n  }\n}\n\n","import { EMBEDDING_DIMENSIONS } from '../constants.js';\n\nexport interface EmbeddingService {\n  initialize(): Promise<void>;\n  embed(text: string): Promise<Float32Array>;\n  embedBatch(texts: string[]): Promise<Float32Array[]>;\n}\n\nexport const EMBEDDING_DIMENSION = EMBEDDING_DIMENSIONS;\n\n","/**\n * Relevance category based on semantic similarity score\n */\nexport type RelevanceCategory = 'highly_relevant' | 'relevant' | 'loosely_related' | 'not_relevant';\n\n/**\n * Calculate relevance category from cosine distance score.\n * \n * Lower scores indicate higher similarity (closer in vector space).\n * Thresholds based on observed score distributions from dogfooding.\n * \n * @param score - Cosine distance score from vector search\n * @returns Human-readable relevance category\n */\nexport function calculateRelevance(score: number): RelevanceCategory {\n  if (score < 1.0) return 'highly_relevant';\n  if (score < 1.3) return 'relevant';\n  if (score < 1.5) return 'loosely_related';\n  return 'not_relevant';\n}\n\n","/**\n * Query Intent Classification\n * \n * Classifies user search queries into three categories to apply\n * appropriate relevance boosting strategies:\n * \n * - LOCATION: \"Where is X?\" - User wants to find specific files/code\n * - CONCEPTUAL: \"How does X work?\" - User wants to understand concepts\n * - IMPLEMENTATION: \"How is X implemented?\" - User wants implementation details\n * \n * Examples:\n * - \"where is the auth handler\" → LOCATION\n * - \"how does authentication work\" → CONCEPTUAL\n * - \"how is authentication implemented\" → IMPLEMENTATION\n */\n\n/**\n * Query intent types for semantic search\n */\nexport enum QueryIntent {\n  /** User wants to locate specific files or code (e.g., \"where is X\") */\n  LOCATION = 'location',\n  \n  /** User wants to understand concepts/processes (e.g., \"how does X work\") */\n  CONCEPTUAL = 'conceptual',\n  \n  /** User wants implementation details (e.g., \"how is X implemented\") */\n  IMPLEMENTATION = 'implementation',\n}\n\n/**\n * Intent classification rule with patterns and priority\n */\nexport interface IntentRule {\n  intent: QueryIntent;\n  patterns: RegExp[];\n  priority: number;\n}\n\n/**\n * Intent classification rules.\n * Rules are checked in priority order (higher priority first).\n */\nconst INTENT_RULES: IntentRule[] = [\n  // LOCATION intent (highest priority - most specific)\n  {\n    intent: QueryIntent.LOCATION,\n    priority: 3,\n    patterns: [\n      /where\\s+(is|are|does|can\\s+i\\s+find)/,\n      /find\\s+the\\s+/,\n      /locate\\s+/,\n    ],\n  },\n  \n  // CONCEPTUAL intent (medium priority)\n  {\n    intent: QueryIntent.CONCEPTUAL,\n    priority: 2,\n    patterns: [\n      /how\\s+does\\s+.*\\s+work/,\n      /what\\s+(is|are|does)/,\n      /explain\\s+/,\n      /understand\\s+/,\n      /\\b(process|workflow|architecture)\\b/,\n    ],\n  },\n  \n  // IMPLEMENTATION intent (low priority - catches \"how is X implemented\")\n  {\n    intent: QueryIntent.IMPLEMENTATION,\n    priority: 1,\n    patterns: [\n      /how\\s+(is|are)\\s+.*\\s+(implemented|built|coded)/,\n      /implementation\\s+of/,\n      /source\\s+code\\s+for/,\n    ],\n  },\n];\n\n/**\n * Capture the initial number of built-in rules.\n * This is used by resetIntentRules() to distinguish built-in rules from custom rules.\n */\nconst INITIAL_RULE_COUNT = INTENT_RULES.length;\n\n/**\n * Cached sorted rules to avoid re-sorting on every query.\n * Invalidated when rules are modified via addIntentRule() or resetIntentRules().\n */\nlet cachedSortedRules: IntentRule[] | null = null;\n\n/**\n * Get sorted rules (cached).\n * Lazy-computes and caches the sorted array on first access.\n */\nfunction getSortedRules(): IntentRule[] {\n  if (cachedSortedRules === null) {\n    cachedSortedRules = [...INTENT_RULES].sort((a, b) => b.priority - a.priority);\n  }\n  return cachedSortedRules;\n}\n\n/**\n * Invalidate the sorted rules cache.\n * Called when rules are modified.\n */\nfunction invalidateSortedRulesCache(): void {\n  cachedSortedRules = null;\n}\n\n/**\n * Classifies a search query into one of three intent categories.\n * \n * Uses data-driven pattern matching to detect query intent.\n * Rules are checked in priority order, with the first match winning.\n * \n * @param query - The search query string\n * @returns The detected query intent (defaults to IMPLEMENTATION)\n * \n * @example\n * classifyQueryIntent(\"where is the user controller\") // → LOCATION\n * classifyQueryIntent(\"how does authentication work\") // → CONCEPTUAL\n * classifyQueryIntent(\"how is the API implemented\") // → IMPLEMENTATION\n */\nexport function classifyQueryIntent(query: string): QueryIntent {\n  const lower = query.toLowerCase().trim();\n  \n  // Use cached sorted rules to avoid re-sorting on every query\n  const sortedRules = getSortedRules();\n  \n  for (const rule of sortedRules) {\n    if (rule.patterns.some(pattern => pattern.test(lower))) {\n      return rule.intent;\n    }\n  }\n  \n  // Default to IMPLEMENTATION for ambiguous queries\n  // This is the most common use case for code search\n  return QueryIntent.IMPLEMENTATION;\n}\n\n/**\n * Add a custom intent rule (useful for testing or extensions).\n * \n * Returns a cleanup function that removes the added rule.\n * This prevents test pollution and allows proper cleanup.\n * \n * @param rule - The intent rule to add\n * @returns A cleanup function that removes the added rule\n * \n * @example\n * const cleanup = addIntentRule({\n *   intent: QueryIntent.LOCATION,\n *   priority: 4,\n *   patterns: [/custom pattern/]\n * });\n * // ... use the rule ...\n * cleanup(); // removes the rule\n */\nexport function addIntentRule(rule: IntentRule): () => void {\n  INTENT_RULES.push(rule);\n  \n  // Invalidate cache since rules have changed\n  invalidateSortedRulesCache();\n  \n  // Return cleanup function to remove the rule\n  return () => {\n    const idx = INTENT_RULES.indexOf(rule);\n    if (idx !== -1) {\n      INTENT_RULES.splice(idx, 1);\n      // Invalidate cache since rules have changed\n      invalidateSortedRulesCache();\n    }\n  };\n}\n\n/**\n * Get all patterns for a specific intent (useful for debugging).\n * \n * @param intent - The intent to get patterns for\n * @returns Array of regex patterns for the intent\n * \n * @example\n * const locationPatterns = getPatternsForIntent(QueryIntent.LOCATION);\n */\nexport function getPatternsForIntent(intent: QueryIntent): RegExp[] {\n  return INTENT_RULES\n    .filter(rule => rule.intent === intent)\n    .flatMap(rule => rule.patterns);\n}\n\n/**\n * Get all intent rules (useful for testing/debugging).\n * \n * @returns A copy of the current intent rules\n */\nexport function getIntentRules(): IntentRule[] {\n  return [...INTENT_RULES];\n}\n\n/**\n * Reset intent rules to initial state.\n * \n * WARNING: This function is intended for testing only.\n * It removes all custom rules added via addIntentRule().\n * The original built-in rules are preserved.\n * \n * @example\n * // In test cleanup\n * afterEach(() => {\n *   resetIntentRules();\n * });\n */\nexport function resetIntentRules(): void {\n  // Remove all custom rules, preserving only the original built-in rules\n  INTENT_RULES.splice(INITIAL_RULE_COUNT);\n  \n  // Invalidate cache since rules have changed\n  invalidateSortedRulesCache();\n}\n\n","/**\n * Boosting strategy interface.\n * \n * Each strategy applies a specific relevance boosting technique\n * to search results based on file characteristics.\n */\nexport interface BoostingStrategy {\n  /** Name of the strategy (for debugging/logging) */\n  name: string;\n  \n  /**\n   * Apply the boosting strategy to a score.\n   * \n   * @param query - The search query string\n   * @param filepath - The file path being scored\n   * @param baseScore - The base relevance score from vector similarity\n   * @returns The boosted score (lower is better, following LanceDB distance metric)\n   */\n  apply(query: string, filepath: string, baseScore: number): number;\n}\n\n","import type { BoostingStrategy } from './types.js';\nimport path from 'path';\nimport { QueryIntent } from '../intent-classifier.js';\n\n/**\n * File type detection helpers\n */\n\nfunction isDocumentationFile(filepath: string): boolean {\n  const lower = filepath.toLowerCase();\n  const filename = path.basename(filepath).toLowerCase();\n  \n  if (filename.startsWith('readme')) return true;\n  if (filename.startsWith('changelog')) return true;\n  if (filename.endsWith('.md') || filename.endsWith('.mdx') || filename.endsWith('.markdown')) {\n    return true;\n  }\n  if (\n    lower.includes('/docs/') ||\n    lower.includes('/documentation/') ||\n    lower.includes('/wiki/') ||\n    lower.includes('/.github/')\n  ) {\n    return true;\n  }\n  if (\n    lower.includes('architecture') ||\n    lower.includes('workflow') ||\n    lower.includes('/flow/')\n  ) {\n    return true;\n  }\n  \n  return false;\n}\n\nfunction isTestFile(filepath: string): boolean {\n  const lower = filepath.toLowerCase();\n  \n  if (\n    lower.includes('/test/') ||\n    lower.includes('/tests/') ||\n    lower.includes('/__tests__/')\n  ) {\n    return true;\n  }\n  \n  if (\n    lower.includes('.test.') ||\n    lower.includes('.spec.') ||\n    lower.includes('_test.') ||\n    lower.includes('_spec.')\n  ) {\n    return true;\n  }\n  \n  return false;\n}\n\nfunction isUtilityFile(filepath: string): boolean {\n  const lower = filepath.toLowerCase();\n  \n  if (\n    lower.includes('/utils/') ||\n    lower.includes('/utilities/') ||\n    lower.includes('/helpers/') ||\n    lower.includes('/lib/')\n  ) {\n    return true;\n  }\n  \n  if (\n    lower.includes('.util.') ||\n    lower.includes('.helper.') ||\n    lower.includes('-util.') ||\n    lower.includes('-helper.')\n  ) {\n    return true;\n  }\n  \n  return false;\n}\n\n/**\n * Boosting Strategies\n */\n\n/**\n * Boosts relevance based on path segment matching.\n * Files with query tokens in their path are boosted.\n */\nexport class PathBoostingStrategy implements BoostingStrategy {\n  name = 'path-matching';\n  \n  apply(query: string, filepath: string, baseScore: number): number {\n    const queryTokens = query.toLowerCase().split(/\\s+/);\n    const pathSegments = filepath.toLowerCase().split('/');\n    \n    let boostFactor = 1.0;\n    \n    for (const token of queryTokens) {\n      if (token.length <= 2) continue;\n      if (pathSegments.some(seg => seg.includes(token))) {\n        boostFactor *= 0.9; // Reduce distance = increase relevance\n      }\n    }\n    \n    return baseScore * boostFactor;\n  }\n}\n\n/**\n * Boosts relevance based on filename matching.\n * Files with query tokens in their filename are strongly boosted.\n */\nexport class FilenameBoostingStrategy implements BoostingStrategy {\n  name = 'filename-matching';\n  \n  apply(query: string, filepath: string, baseScore: number): number {\n    const filename = path.basename(filepath, path.extname(filepath)).toLowerCase();\n    const queryTokens = query.toLowerCase().split(/\\s+/);\n    \n    let boostFactor = 1.0;\n    \n    for (const token of queryTokens) {\n      if (token.length <= 2) continue;\n      \n      if (filename === token) {\n        boostFactor *= 0.70; // Strong boost for exact match\n      } else if (filename.includes(token)) {\n        boostFactor *= 0.80; // Moderate boost for partial match\n      }\n    }\n    \n    return baseScore * boostFactor;\n  }\n}\n\n/**\n * Boosts relevance based on file type and query intent.\n * Different file types are boosted for different query intents.\n * \n * Note: This strategy focuses on file-type-specific boosting (test files,\n * documentation files, utility files, etc.). Path and filename boosting\n * are handled separately by PathBoostingStrategy and FilenameBoostingStrategy\n * in the BoostingComposer to avoid double-boosting.\n */\nexport class FileTypeBoostingStrategy implements BoostingStrategy {\n  name = 'file-type';\n  \n  constructor(private intent: QueryIntent) {}\n  \n  apply(query: string, filepath: string, baseScore: number): number {\n    switch (this.intent) {\n      case QueryIntent.LOCATION:\n        return this.applyLocationBoosting(query, filepath, baseScore);\n      \n      case QueryIntent.CONCEPTUAL:\n        return this.applyConceptualBoosting(query, filepath, baseScore);\n      \n      case QueryIntent.IMPLEMENTATION:\n        return this.applyImplementationBoosting(query, filepath, baseScore);\n      \n      default:\n        return baseScore;\n    }\n  }\n  \n  private applyLocationBoosting(_query: string, filepath: string, score: number): number {\n    // Note: Path and filename boosting are handled by PathBoostingStrategy and\n    // FilenameBoostingStrategy in the composer. This method only handles\n    // file-type-specific boosting for location queries.\n    \n    // Slightly deprioritize test files (users want implementation location, not tests)\n    if (isTestFile(filepath)) {\n      score *= 1.10;\n    }\n    \n    return score;\n  }\n  \n  private applyConceptualBoosting(_query: string, filepath: string, score: number): number {\n    // Note: Path and filename boosting are handled by PathBoostingStrategy and\n    // FilenameBoostingStrategy in the composer. This method only handles\n    // file-type-specific boosting for conceptual queries.\n    \n    // Strong boost for documentation files\n    if (isDocumentationFile(filepath)) {\n      score *= 0.65;\n      \n      const lower = filepath.toLowerCase();\n      if (\n        lower.includes('architecture') ||\n        lower.includes('workflow') ||\n        lower.includes('flow')\n      ) {\n        score *= 0.90; // Extra boost for architectural docs\n      }\n    }\n    \n    // Slight boost for utility files (often contain reusable logic)\n    if (isUtilityFile(filepath)) {\n      score *= 0.95;\n    }\n    \n    return score;\n  }\n  \n  private applyImplementationBoosting(_query: string, filepath: string, score: number): number {\n    // Note: Path and filename boosting are handled by PathBoostingStrategy and\n    // FilenameBoostingStrategy in the composer. This method only handles\n    // file-type-specific boosting for implementation queries.\n    \n    // Slightly deprioritize test files (user wants implementation, not tests)\n    if (isTestFile(filepath)) {\n      score *= 1.10;\n    }\n    \n    return score;\n  }\n}\n\n","import type { BoostingStrategy } from './types.js';\n\n/**\n * Composes multiple boosting strategies into a single pipeline.\n * \n * Strategies are applied sequentially, with each strategy\n * receiving the output of the previous strategy as input.\n * \n * @example\n * ```typescript\n * const composer = new BoostingComposer()\n *   .addStrategy(new PathBoostingStrategy())\n *   .addStrategy(new FilenameBoostingStrategy())\n *   .addStrategy(new FileTypeBoostingStrategy(intent));\n * \n * const boostedScore = composer.apply(query, filepath, baseScore);\n * ```\n */\nexport class BoostingComposer {\n  private strategies: BoostingStrategy[] = [];\n  \n  /**\n   * Add a boosting strategy to the pipeline.\n   * Strategies are applied in the order they are added.\n   * \n   * @param strategy - The strategy to add\n   * @returns This composer for chaining\n   */\n  addStrategy(strategy: BoostingStrategy): this {\n    this.strategies.push(strategy);\n    return this;\n  }\n  \n  /**\n   * Apply all strategies to a base score.\n   * \n   * @param query - The search query\n   * @param filepath - The file path being scored\n   * @param baseScore - The initial score from vector similarity\n   * @returns The final boosted score after all strategies\n   */\n  apply(query: string, filepath: string, baseScore: number): number {\n    let score = baseScore;\n    \n    for (const strategy of this.strategies) {\n      score = strategy.apply(query, filepath, score);\n    }\n    \n    return score;\n  }\n  \n  /**\n   * Get the names of all strategies in this composer.\n   * Useful for debugging and logging.\n   */\n  getStrategyNames(): string[] {\n    return this.strategies.map(s => s.name);\n  }\n  \n  /**\n   * Get the number of strategies in this composer.\n   */\n  getStrategyCount(): number {\n    return this.strategies.length;\n  }\n  \n  /**\n   * Clear all strategies from this composer.\n   */\n  clear(): void {\n    this.strategies = [];\n  }\n}\n\n","/**\n * Composable boosting strategies for semantic search relevance.\n * \n * This module provides a strategy pattern implementation for applying\n * relevance boosting to search results. Strategies can be composed\n * together to create complex boosting pipelines.\n * \n * @example\n * ```typescript\n * import { BoostingComposer, PathBoostingStrategy, FilenameBoostingStrategy } from './boosting';\n * \n * const composer = new BoostingComposer()\n *   .addStrategy(new PathBoostingStrategy())\n *   .addStrategy(new FilenameBoostingStrategy());\n * \n * const boostedScore = composer.apply(query, filepath, baseScore);\n * ```\n */\n\nexport * from './types.js';\nexport * from './strategies.js';\nexport * from './composer.js';\n\n","import { SearchResult } from './types.js';\nimport { EMBEDDING_DIMENSION } from '../embeddings/types.js';\nimport { DatabaseError, wrapError } from '../errors/index.js';\nimport { calculateRelevance } from './relevance.js';\nimport { classifyQueryIntent, QueryIntent } from './intent-classifier.js';\nimport { BoostingComposer, PathBoostingStrategy, FilenameBoostingStrategy, FileTypeBoostingStrategy } from './boosting/index.js';\n\n// TODO: Replace with proper type from lancedb-types.ts\n// Currently using 'any' because tests use incomplete mocks that don't satisfy full LanceDB interface\n// See: https://github.com/getlien/lien/issues/XXX\ntype LanceDBTable = any;\n\n/**\n * Cached strategy instances to avoid repeated instantiation overhead.\n * These strategies are stateless and can be safely reused across queries.\n */\nconst PATH_STRATEGY = new PathBoostingStrategy();\nconst FILENAME_STRATEGY = new FilenameBoostingStrategy();\n\n/**\n * Cached FileTypeBoostingStrategy instances for each intent.\n * Since there are only three possible intents, we can cache all three.\n */\nconst FILE_TYPE_STRATEGIES = {\n  [QueryIntent.LOCATION]: new FileTypeBoostingStrategy(QueryIntent.LOCATION),\n  [QueryIntent.CONCEPTUAL]: new FileTypeBoostingStrategy(QueryIntent.CONCEPTUAL),\n  [QueryIntent.IMPLEMENTATION]: new FileTypeBoostingStrategy(QueryIntent.IMPLEMENTATION),\n};\n\n/**\n * Cached BoostingComposer instances for each intent.\n * Pre-configured with the appropriate strategy pipeline for each intent type.\n * This avoids creating a new composer instance on every search result.\n */\nconst BOOSTING_COMPOSERS = {\n  [QueryIntent.LOCATION]: new BoostingComposer()\n    .addStrategy(PATH_STRATEGY)\n    .addStrategy(FILENAME_STRATEGY)\n    .addStrategy(FILE_TYPE_STRATEGIES[QueryIntent.LOCATION]),\n  [QueryIntent.CONCEPTUAL]: new BoostingComposer()\n    .addStrategy(PATH_STRATEGY)\n    .addStrategy(FILENAME_STRATEGY)\n    .addStrategy(FILE_TYPE_STRATEGIES[QueryIntent.CONCEPTUAL]),\n  [QueryIntent.IMPLEMENTATION]: new BoostingComposer()\n    .addStrategy(PATH_STRATEGY)\n    .addStrategy(FILENAME_STRATEGY)\n    .addStrategy(FILE_TYPE_STRATEGIES[QueryIntent.IMPLEMENTATION]),\n};\n\n/**\n * Database record structure as stored in LanceDB\n */\ninterface DBRecord {\n  vector: number[];\n  content: string;\n  file: string;\n  startLine: number;\n  endLine: number;\n  type: string;\n  language: string;\n  functionNames: string[];\n  classNames: string[];\n  interfaceNames: string[];\n  // AST-derived metadata (v0.13.0)\n  symbolName?: string;\n  symbolType?: string;\n  parentClass?: string;\n  complexity?: number;\n  cognitiveComplexity?: number;\n  parameters?: string[];\n  signature?: string;\n  imports?: string[];\n  // Halstead metrics (v0.19.0)\n  halsteadVolume?: number;\n  halsteadDifficulty?: number;\n  halsteadEffort?: number;\n  halsteadBugs?: number;\n  _distance?: number; // Added by LanceDB for search results\n}\n\n/**\n * Check if a DB record has valid content and file path.\n * Used to filter out empty/invalid records from query results.\n */\nfunction isValidRecord(r: DBRecord): boolean {\n  return Boolean(\n    r.content && \n    r.content.trim().length > 0 &&\n    r.file && \n    r.file.length > 0\n  );\n}\n\n/**\n * Check if an array field has valid (non-empty) entries.\n * LanceDB stores empty arrays as [''] which we need to filter out.\n */\nfunction hasValidArrayEntries(arr: string[] | undefined): boolean {\n  return Boolean(arr && arr.length > 0 && arr[0] !== '');\n}\n\n/**\n * Get symbols for a specific type from a DB record.\n * Consolidates the symbol extraction logic used across query functions.\n */\nfunction getSymbolsForType(\n  r: DBRecord, \n  symbolType?: 'function' | 'class' | 'interface'\n): string[] {\n  if (symbolType === 'function') return r.functionNames || [];\n  if (symbolType === 'class') return r.classNames || [];\n  if (symbolType === 'interface') return r.interfaceNames || [];\n  return [\n    ...(r.functionNames || []),\n    ...(r.classNames || []),\n    ...(r.interfaceNames || []),\n  ];\n}\n\n/**\n * Convert a DB record to base SearchResult metadata.\n * Shared between all query functions to avoid duplication.\n */\nfunction buildSearchResultMetadata(r: DBRecord): SearchResult['metadata'] {\n  return {\n    file: r.file,\n    startLine: r.startLine,\n    endLine: r.endLine,\n    type: r.type as 'function' | 'class' | 'block',\n    language: r.language,\n    symbolName: r.symbolName || undefined,\n    symbolType: r.symbolType as 'function' | 'method' | 'class' | 'interface' | undefined,\n    parentClass: r.parentClass || undefined,\n    complexity: r.complexity || undefined,\n    cognitiveComplexity: r.cognitiveComplexity || undefined,\n    parameters: hasValidArrayEntries(r.parameters) ? r.parameters : undefined,\n    signature: r.signature || undefined,\n    imports: hasValidArrayEntries(r.imports) ? r.imports : undefined,\n    // Halstead metrics (v0.19.0) - use explicit null check to preserve valid 0 values\n    halsteadVolume: r.halsteadVolume != null ? r.halsteadVolume : undefined,\n    halsteadDifficulty: r.halsteadDifficulty != null ? r.halsteadDifficulty : undefined,\n    halsteadEffort: r.halsteadEffort != null ? r.halsteadEffort : undefined,\n    halsteadBugs: r.halsteadBugs != null ? r.halsteadBugs : undefined,\n  };\n}\n\n/**\n * Apply relevance boosting strategies to a search score.\n * \n * Uses composable boosting strategies based on query intent:\n * - Path matching: Boost files with query tokens in path\n * - Filename matching: Boost files with query tokens in filename\n * - File type boosting: Intent-specific boosting (docs for conceptual, etc.)\n */\nfunction applyRelevanceBoosting(\n  query: string | undefined,\n  filepath: string,\n  baseScore: number\n): number {\n  if (!query) {\n    return baseScore;\n  }\n  \n  const intent = classifyQueryIntent(query);\n  \n  // Use cached composer instance configured for this intent\n  return BOOSTING_COMPOSERS[intent].apply(query, filepath, baseScore);\n}\n\n/**\n * Convert a DBRecord to a SearchResult\n */\nfunction dbRecordToSearchResult(\n  r: DBRecord,\n  query?: string\n): SearchResult {\n  const baseScore = r._distance ?? 0;\n  const boostedScore = applyRelevanceBoosting(query, r.file, baseScore);\n  \n  return {\n    content: r.content,\n    metadata: buildSearchResultMetadata(r),\n    score: boostedScore,\n    relevance: calculateRelevance(boostedScore),\n  };\n}\n\n/**\n * Search the vector database\n */\nexport async function search(\n  table: LanceDBTable,\n  queryVector: Float32Array,\n  limit: number = 5,\n  query?: string\n): Promise<SearchResult[]> {\n  if (!table) {\n    throw new DatabaseError('Vector database not initialized');\n  }\n  \n  try {\n    const results = await table\n      .search(Array.from(queryVector))\n      .limit(limit + 20)\n      .toArray();\n    \n    const filtered = (results as unknown as DBRecord[])\n      .filter(isValidRecord)\n      .map((r: DBRecord) => dbRecordToSearchResult(r, query))\n      .sort((a, b) => a.score - b.score)\n      .slice(0, limit);\n    \n    return filtered;\n  } catch (error) {\n    const errorMsg = String(error);\n    \n    // Detect corrupted index\n    if (errorMsg.includes('Not found:') || errorMsg.includes('.lance')) {\n      throw new DatabaseError(\n        `Index appears corrupted or outdated. Please restart the MCP server or run 'lien reindex' in the project directory.`,\n        { originalError: error }\n      );\n    }\n    \n    throw wrapError(error, 'Failed to search vector database');\n  }\n}\n\n/**\n * Scan the database with filters\n */\nexport async function scanWithFilter(\n  table: LanceDBTable,\n  options: {\n    language?: string;\n    pattern?: string;\n    limit?: number;\n  }\n): Promise<SearchResult[]> {\n  if (!table) {\n    throw new DatabaseError('Vector database not initialized');\n  }\n  \n  const { language, pattern, limit = 100 } = options;\n  \n  try {\n    const zeroVector = Array(EMBEDDING_DIMENSION).fill(0);\n    const query = table.search(zeroVector)\n      .where('file != \"\"')\n      .limit(Math.max(limit * 5, 200));\n    \n    const results = await query.toArray();\n    \n    let filtered = (results as unknown as DBRecord[]).filter(isValidRecord);\n    \n    if (language) {\n      filtered = filtered.filter((r: DBRecord) => \n        r.language && r.language.toLowerCase() === language.toLowerCase()\n      );\n    }\n    \n    if (pattern) {\n      const regex = new RegExp(pattern, 'i');\n      filtered = filtered.filter((r: DBRecord) =>\n        regex.test(r.content) || regex.test(r.file)\n      );\n    }\n    \n    return filtered.slice(0, limit).map((r: DBRecord) => ({\n      content: r.content,\n      metadata: buildSearchResultMetadata(r),\n      score: 0,\n      relevance: calculateRelevance(0),\n    }));\n  } catch (error) {\n    throw wrapError(error, 'Failed to scan with filter');\n  }\n}\n\n/**\n * Helper to check if a record matches the requested symbol type\n */\n/** Maps query symbolType to acceptable AST symbolType values */\nconst SYMBOL_TYPE_MATCHES: Record<string, Set<string>> = {\n  function: new Set(['function', 'method']),\n  class: new Set(['class']),\n  interface: new Set(['interface']),\n};\n\nfunction matchesSymbolType(\n  record: DBRecord,\n  symbolType: 'function' | 'class' | 'interface',\n  symbols: string[]\n): boolean {\n  // If AST-based symbolType exists, use lookup table\n  if (record.symbolType) {\n    return SYMBOL_TYPE_MATCHES[symbolType]?.has(record.symbolType) ?? false;\n  }\n\n  // Fallback: check if pre-AST symbols array has valid entries\n  return symbols.length > 0 && symbols.some((s: string) => s.length > 0 && s !== '');\n}\n\ninterface SymbolQueryOptions {\n  language?: string;\n  pattern?: string;\n  symbolType?: 'function' | 'class' | 'interface';\n}\n\n/**\n * Check if a record matches the symbol query filters.\n * Extracted to reduce complexity of querySymbols.\n */\nfunction matchesSymbolFilter(\n  r: DBRecord, \n  { language, pattern, symbolType }: SymbolQueryOptions\n): boolean {\n  // Language filter\n  if (language && (!r.language || r.language.toLowerCase() !== language.toLowerCase())) {\n    return false;\n  }\n  \n  const symbols = getSymbolsForType(r, symbolType);\n  const astSymbolName = r.symbolName || '';\n  \n  // Must have at least one symbol (legacy or AST-based)\n  if (symbols.length === 0 && !astSymbolName) {\n    return false;\n  }\n  \n  // Pattern filter (if provided)\n  if (pattern) {\n    const regex = new RegExp(pattern, 'i');\n    const nameMatches = symbols.some((s: string) => regex.test(s)) || regex.test(astSymbolName);\n    if (!nameMatches) return false;\n  }\n  \n  // Symbol type filter (if provided)\n  if (symbolType) {\n    return matchesSymbolType(r, symbolType, symbols);\n  }\n  \n  return true;\n}\n\n/**\n * Build legacy symbols object for backwards compatibility.\n */\nfunction buildLegacySymbols(r: DBRecord) {\n  return {\n    functions: hasValidArrayEntries(r.functionNames) ? r.functionNames : [],\n    classes: hasValidArrayEntries(r.classNames) ? r.classNames : [],\n    interfaces: hasValidArrayEntries(r.interfaceNames) ? r.interfaceNames : [],\n  };\n}\n\n/**\n * Query symbols (functions, classes, interfaces)\n */\nexport async function querySymbols(\n  table: LanceDBTable,\n  options: {\n    language?: string;\n    pattern?: string;\n    symbolType?: 'function' | 'class' | 'interface';\n    limit?: number;\n  }\n): Promise<SearchResult[]> {\n  if (!table) {\n    throw new DatabaseError('Vector database not initialized');\n  }\n  \n  const { language, pattern, symbolType, limit = 50 } = options;\n  const filterOpts: SymbolQueryOptions = { language, pattern, symbolType };\n  \n  try {\n    const zeroVector = Array(EMBEDDING_DIMENSION).fill(0);\n    const query = table.search(zeroVector)\n      .where('file != \"\"')\n      .limit(Math.max(limit * 10, 500));\n    \n    const results = await query.toArray();\n    \n    const filtered = (results as unknown as DBRecord[])\n      .filter((r) => isValidRecord(r) && matchesSymbolFilter(r, filterOpts));\n    \n    return filtered.slice(0, limit).map((r: DBRecord) => ({\n      content: r.content,\n      metadata: {\n        ...buildSearchResultMetadata(r),\n        symbols: buildLegacySymbols(r),\n      },\n      score: 0,\n      relevance: calculateRelevance(0),\n    }));\n  } catch (error) {\n    throw wrapError(error, 'Failed to query symbols');\n  }\n}\n\n/**\n * Scan all chunks in the database\n * First gets the total count, then fetches all with a single query\n * This is more efficient than pagination for local/embedded databases like LanceDB\n */\nexport async function scanAll(\n  table: LanceDBTable,\n  options: {\n    language?: string;\n    pattern?: string;\n  } = {}\n): Promise<SearchResult[]> {\n  if (!table) {\n    throw new DatabaseError('Vector database not initialized');\n  }\n  \n  try {\n    // Get total row count to determine limit\n    const totalRows = await table.countRows();\n    \n    // Fetch all rows in one query (LanceDB is local, this is efficient)\n    // Note: scanWithFilter internally fetches 5x the limit to handle filtering overhead,\n    // then caps output to 'limit'. We pass totalRows so we get all rows back after\n    // filtering. The 5x overfetch is acceptable overhead for local DBs.\n    const MIN_SCAN_LIMIT = 1000;\n    const results = await scanWithFilter(table, {\n      ...options,\n      limit: Math.max(totalRows, MIN_SCAN_LIMIT),\n    });\n    \n    return results;\n  } catch (error) {\n    throw wrapError(error, 'Failed to scan all chunks');\n  }\n}\n","import { ChunkMetadata } from '../indexer/types.js';\nimport { DatabaseError } from '../errors/index.js';\nimport { VECTOR_DB_MAX_BATCH_SIZE, VECTOR_DB_MIN_BATCH_SIZE } from '../constants.js';\n\n// TODO: Replace with proper types from lancedb-types.ts\n// Currently using 'any' because tests use incomplete mocks that don't satisfy full LanceDB interface\n// Proper types: Awaited<ReturnType<typeof lancedb.connect>> and Awaited<ReturnType<Connection['openTable']>>\ntype LanceDBConnection = any;\ntype LanceDBTable = any;\n\n/**\n * Batch of data to be inserted into the vector database\n */\ninterface BatchToProcess {\n  vectors: Float32Array[];\n  metadatas: ChunkMetadata[];\n  contents: string[];\n}\n\n/**\n * Database record format for LanceDB storage\n */\ninterface DatabaseRecord {\n  vector: number[];\n  content: string;\n  file: string;\n  startLine: number;\n  endLine: number;\n  type: string;\n  language: string;\n  functionNames: string[];\n  classNames: string[];\n  interfaceNames: string[];\n  symbolName: string;\n  symbolType: string;\n  parentClass: string;\n  complexity: number;\n  cognitiveComplexity: number;\n  parameters: string[];\n  signature: string;\n  imports: string[];\n  // Halstead metrics (v0.19.0)\n  halsteadVolume: number;\n  halsteadDifficulty: number;\n  halsteadEffort: number;\n  halsteadBugs: number;\n}\n\n/**\n * Transform a chunk's data into a database record.\n * Handles missing/empty metadata by providing defaults for Arrow type inference.\n */\nfunction transformChunkToRecord(\n  vector: Float32Array,\n  content: string,\n  metadata: ChunkMetadata\n): DatabaseRecord {\n  return {\n    vector: Array.from(vector),\n    content,\n    file: metadata.file,\n    startLine: metadata.startLine,\n    endLine: metadata.endLine,\n    type: metadata.type,\n    language: metadata.language,\n    // Ensure arrays have at least empty string for Arrow type inference\n    functionNames: getNonEmptyArray(metadata.symbols?.functions),\n    classNames: getNonEmptyArray(metadata.symbols?.classes),\n    interfaceNames: getNonEmptyArray(metadata.symbols?.interfaces),\n    // AST-derived metadata (v0.13.0)\n    symbolName: metadata.symbolName || '',\n    symbolType: metadata.symbolType || '',\n    parentClass: metadata.parentClass || '',\n    complexity: metadata.complexity || 0,\n    cognitiveComplexity: metadata.cognitiveComplexity || 0,\n    parameters: getNonEmptyArray(metadata.parameters),\n    signature: metadata.signature || '',\n    imports: getNonEmptyArray(metadata.imports),\n    // Halstead metrics (v0.19.0)\n    halsteadVolume: metadata.halsteadVolume || 0,\n    halsteadDifficulty: metadata.halsteadDifficulty || 0,\n    halsteadEffort: metadata.halsteadEffort || 0,\n    halsteadBugs: metadata.halsteadBugs || 0,\n  };\n}\n\n/**\n * Returns the array if non-empty, otherwise returns [''] for Arrow type inference\n */\nfunction getNonEmptyArray(arr: string[] | undefined): string[] {\n  return arr && arr.length > 0 ? arr : [''];\n}\n\n/**\n * Split a batch in half for retry logic\n */\nfunction splitBatchInHalf(batch: BatchToProcess): [BatchToProcess, BatchToProcess] {\n  const half = Math.floor(batch.vectors.length / 2);\n  return [\n    {\n      vectors: batch.vectors.slice(0, half),\n      metadatas: batch.metadatas.slice(0, half),\n      contents: batch.contents.slice(0, half),\n    },\n    {\n      vectors: batch.vectors.slice(half),\n      metadatas: batch.metadatas.slice(half),\n      contents: batch.contents.slice(half),\n    },\n  ];\n}\n\n/**\n * Transform all chunks in a batch to database records\n */\nfunction transformBatchToRecords(batch: BatchToProcess): DatabaseRecord[] {\n  return batch.vectors.map((vector, i) =>\n    transformChunkToRecord(vector, batch.contents[i], batch.metadatas[i])\n  );\n}\n\n/**\n * Insert a batch of vectors into the database\n * \n * @returns The table instance after insertion, or null only when:\n *          - vectors.length === 0 AND table === null (no-op case)\n *          For non-empty batches, always returns a valid table or throws.\n * @throws {DatabaseError} If database not initialized or insertion fails\n */\nexport async function insertBatch(\n  db: LanceDBConnection,\n  table: LanceDBTable | null,\n  tableName: string,\n  vectors: Float32Array[],\n  metadatas: ChunkMetadata[],\n  contents: string[]\n): Promise<LanceDBTable | null> {\n  if (!db) {\n    throw new DatabaseError('Vector database not initialized');\n  }\n  \n  if (vectors.length !== metadatas.length || vectors.length !== contents.length) {\n    throw new DatabaseError('Vectors, metadatas, and contents arrays must have the same length', {\n      vectorsLength: vectors.length,\n      metadatasLength: metadatas.length,\n      contentsLength: contents.length,\n    });\n  }\n  \n  // Handle empty batch gracefully - return table as-is (could be null)\n  if (vectors.length === 0) {\n    return table;\n  }\n  \n  // Split large batches into smaller chunks\n  if (vectors.length > VECTOR_DB_MAX_BATCH_SIZE) {\n    let currentTable = table;\n    for (let i = 0; i < vectors.length; i += VECTOR_DB_MAX_BATCH_SIZE) {\n      const batchVectors = vectors.slice(i, Math.min(i + VECTOR_DB_MAX_BATCH_SIZE, vectors.length));\n      const batchMetadata = metadatas.slice(i, Math.min(i + VECTOR_DB_MAX_BATCH_SIZE, vectors.length));\n      const batchContents = contents.slice(i, Math.min(i + VECTOR_DB_MAX_BATCH_SIZE, vectors.length));\n      \n      currentTable = await insertBatchInternal(db, currentTable, tableName, batchVectors, batchMetadata, batchContents);\n    }\n    if (!currentTable) {\n      throw new DatabaseError('Failed to create table during batch insert');\n    }\n    return currentTable;\n  } else {\n    return insertBatchInternal(db, table, tableName, vectors, metadatas, contents);\n  }\n}\n\n/**\n * Internal method to insert a single batch with iterative retry logic.\n * Uses a queue-based approach to handle batch splitting on failure.\n * \n * @returns Always returns a valid LanceDBTable or throws DatabaseError\n */\nasync function insertBatchInternal(\n  db: LanceDBConnection,\n  table: LanceDBTable | null,\n  tableName: string,\n  vectors: Float32Array[],\n  metadatas: ChunkMetadata[],\n  contents: string[]\n): Promise<LanceDBTable> {\n  const queue: BatchToProcess[] = [{ vectors, metadatas, contents }];\n  const failedBatches: BatchToProcess[] = [];\n  let currentTable = table;\n  let lastError: Error | undefined;\n  \n  while (queue.length > 0) {\n    const batch = queue.shift()!;\n    const insertResult = await tryInsertBatch(db, currentTable, tableName, batch);\n    \n    if (insertResult.success) {\n      currentTable = insertResult.table;\n    } else {\n      lastError = insertResult.error;\n      handleBatchFailure(batch, queue, failedBatches);\n    }\n  }\n  \n  throwIfBatchesFailed(failedBatches, lastError);\n  \n  if (!currentTable) {\n    throw new DatabaseError('Failed to create table during batch insert');\n  }\n  \n  return currentTable;\n}\n\n/**\n * Result of attempting to insert a batch\n */\ninterface InsertResult {\n  success: boolean;\n  table: LanceDBTable | null;\n  error?: Error;\n}\n\n/**\n * Attempt to insert a batch of records into the database.\n * Errors are captured and returned (not thrown) to support retry logic.\n */\nasync function tryInsertBatch(\n  db: LanceDBConnection,\n  currentTable: LanceDBTable | null,\n  tableName: string,\n  batch: BatchToProcess\n): Promise<InsertResult> {\n  try {\n    const records = transformBatchToRecords(batch);\n    \n    if (!currentTable) {\n      const newTable = await db.createTable(tableName, records);\n      return { success: true, table: newTable };\n    } else {\n      await currentTable.add(records);\n      return { success: true, table: currentTable };\n    }\n  } catch (error) {\n    // Error is captured for retry logic - will be included in final error if all retries fail\n    return { success: false, table: currentTable, error: error as Error };\n  }\n}\n\n/**\n * Handle a failed batch insertion by either splitting and retrying or marking as failed\n */\nfunction handleBatchFailure(\n  batch: BatchToProcess,\n  queue: BatchToProcess[],\n  failedBatches: BatchToProcess[]\n): void {\n  if (batch.vectors.length > VECTOR_DB_MIN_BATCH_SIZE) {\n    // Split and retry\n    const [firstHalf, secondHalf] = splitBatchInHalf(batch);\n    queue.push(firstHalf, secondHalf);\n  } else {\n    // Can't split further, mark as failed\n    failedBatches.push(batch);\n  }\n}\n\n/**\n * Throw an error if any batches failed after all retry attempts.\n * Includes the last error encountered for debugging.\n */\nfunction throwIfBatchesFailed(failedBatches: BatchToProcess[], lastError?: Error): void {\n  if (failedBatches.length === 0) return;\n  \n  const totalFailed = failedBatches.reduce((sum, batch) => sum + batch.vectors.length, 0);\n  throw new DatabaseError(\n    `Failed to insert ${totalFailed} record(s) after retry attempts`,\n    {\n      failedBatches: failedBatches.length,\n      totalRecords: totalFailed,\n      sampleFile: failedBatches[0].metadatas[0].file,\n      lastError: lastError?.message,\n    }\n  );\n}\n","import fs from 'fs/promises';\nimport path from 'path';\nimport { ChunkMetadata } from '../indexer/types.js';\nimport { DatabaseError, wrapError } from '../errors/index.js';\nimport { writeVersionFile } from './version.js';\nimport { insertBatch } from './batch-insert.js';\n\n// TODO: Replace with proper types from lancedb-types.ts\n// Currently using 'any' because tests use incomplete mocks that don't satisfy full LanceDB interface\n// Proper types: Awaited<ReturnType<typeof lancedb.connect>> and Awaited<ReturnType<Connection['openTable']>>\ntype LanceDBConnection = any;\ntype LanceDBTable = any;\n\n/**\n * Clear all data from the vector database.\n * Drops the table AND cleans up the .lance directory to prevent corrupted state.\n */\nexport async function clear(\n  db: LanceDBConnection,\n  table: LanceDBTable | null,\n  tableName: string,\n  dbPath?: string\n): Promise<void> {\n  if (!db) {\n    throw new DatabaseError('Vector database not initialized');\n  }\n  \n  try {\n    // Drop table if it exists\n    if (table) {\n      await db.dropTable(tableName);\n    }\n    \n    // Clean up the .lance directory if dbPath provided\n    // This prevents corrupted state after dropTable\n    if (dbPath) {\n      const lanceDir = path.join(dbPath, `${tableName}.lance`);\n      try {\n        await fs.rm(lanceDir, { recursive: true, force: true });\n      } catch {\n        // Ignore errors - directory may not exist\n      }\n    }\n  } catch (error) {\n    throw wrapError(error, 'Failed to clear vector database');\n  }\n}\n\n/**\n * Delete all chunks from a specific file\n */\nexport async function deleteByFile(\n  table: LanceDBTable,\n  filepath: string\n): Promise<void> {\n  if (!table) {\n    throw new DatabaseError('Vector database not initialized');\n  }\n  \n  try {\n    await table.delete(`file = \"${filepath}\"`);\n  } catch (error) {\n    throw wrapError(error, 'Failed to delete file from vector database');\n  }\n}\n\n/**\n * Update a file in the index by atomically deleting old chunks and inserting new ones\n */\nexport async function updateFile(\n  db: LanceDBConnection,\n  table: LanceDBTable | null,\n  tableName: string,\n  dbPath: string,\n  filepath: string,\n  vectors: Float32Array[],\n  metadatas: ChunkMetadata[],\n  contents: string[]\n): Promise<LanceDBTable> {\n  if (!table) {\n    throw new DatabaseError('Vector database not initialized');\n  }\n  \n  try {\n    // 1. Delete old chunks from this file\n    await deleteByFile(table, filepath);\n    \n    // 2. Insert new chunks (if any)\n    let updatedTable = table;\n    if (vectors.length > 0) {\n      updatedTable = await insertBatch(db, table, tableName, vectors, metadatas, contents);\n      if (!updatedTable) {\n        throw new DatabaseError('insertBatch unexpectedly returned null');\n      }\n    }\n    \n    // 3. Update version file to trigger MCP reconnection\n    await writeVersionFile(dbPath);\n    \n    return updatedTable;\n  } catch (error) {\n    throw wrapError(error, 'Failed to update file in vector database');\n  }\n}\n\n","import * as lancedb from '@lancedb/lancedb';\nimport path from 'path';\nimport os from 'os';\nimport crypto from 'crypto';\nimport { SearchResult, VectorDBInterface } from './types.js';\nimport { ChunkMetadata } from '../indexer/types.js';\nimport { EMBEDDING_DIMENSION } from '../embeddings/types.js';\nimport { readVersionFile } from './version.js';\nimport { DatabaseError, wrapError } from '../errors/index.js';\nimport * as queryOps from './query.js';\nimport * as batchOps from './batch-insert.js';\nimport * as maintenanceOps from './maintenance.js';\n\ntype LanceDBConnection = Awaited<ReturnType<typeof lancedb.connect>>;\ntype LanceDBTable = Awaited<ReturnType<LanceDBConnection['openTable']>>;\n\nexport class VectorDB implements VectorDBInterface {\n  private db: LanceDBConnection | null = null;\n  private table: LanceDBTable | null = null;\n  public readonly dbPath: string;\n  private readonly tableName = 'code_chunks';\n  private lastVersionCheck: number = 0;\n  private currentVersion: number = 0;\n  \n  constructor(projectRoot: string) {\n    // Store in user's home directory under ~/.lien/indices/{projectName-hash}\n    const projectName = path.basename(projectRoot);\n    \n    // Create unique identifier from full path to prevent collisions\n    const pathHash = crypto\n      .createHash('md5')\n      .update(projectRoot)\n      .digest('hex')\n      .substring(0, 8);\n    \n    this.dbPath = path.join(\n      os.homedir(),\n      '.lien',\n      'indices',\n      `${projectName}-${pathHash}`\n    );\n  }\n  \n  async initialize(): Promise<void> {\n    try {\n      this.db = await lancedb.connect(this.dbPath);\n      \n      try {\n        this.table = await this.db.openTable(this.tableName);\n      } catch {\n        // Table doesn't exist yet - will be created on first insert\n        this.table = null;\n      }\n      \n      // Read and cache the current version\n      try {\n        this.currentVersion = await readVersionFile(this.dbPath);\n      } catch {\n        // Version file doesn't exist yet, will be created on first index\n        this.currentVersion = 0;\n      }\n    } catch (error: unknown) {\n      throw wrapError(error, 'Failed to initialize vector database', { dbPath: this.dbPath });\n    }\n  }\n  \n  async insertBatch(\n    vectors: Float32Array[],\n    metadatas: ChunkMetadata[],\n    contents: string[]\n  ): Promise<void> {\n    if (!this.db) {\n      throw new DatabaseError('Vector database not initialized');\n    }\n    // Note: insertBatch may return null for empty batches when table is null\n    // This is correct behavior - empty batches are no-ops and don't create tables\n    this.table = await batchOps.insertBatch(\n      this.db,\n      this.table,\n      this.tableName,\n      vectors,\n      metadatas,\n      contents\n    );\n  }\n  \n  async search(\n    queryVector: Float32Array,\n    limit: number = 5,\n    query?: string\n  ): Promise<SearchResult[]> {\n    if (!this.table) {\n      throw new DatabaseError('Vector database not initialized');\n    }\n    \n    try {\n      return await queryOps.search(this.table, queryVector, limit, query);\n    } catch (error) {\n      const errorMsg = String(error);\n      \n      // Detect corrupted index or missing data files\n      if (errorMsg.includes('Not found:') || errorMsg.includes('.lance')) {\n        // Attempt to reconnect - index may have been rebuilt\n        try {\n          await this.initialize();\n          if (!this.table) {\n            throw new DatabaseError('Vector database not initialized after reconnection');\n          }\n          return await queryOps.search(this.table, queryVector, limit, query);\n        } catch (retryError: unknown) {\n          throw new DatabaseError(\n            `Index appears corrupted or outdated. Please restart the MCP server or run 'lien reindex' in the project directory.`,\n            { originalError: retryError }\n          );\n        }\n      }\n      \n      throw error;\n    }\n  }\n  \n  async scanWithFilter(options: {\n    language?: string;\n    pattern?: string;\n    limit?: number;\n  }): Promise<SearchResult[]> {\n    if (!this.table) {\n      throw new DatabaseError('Vector database not initialized');\n    }\n    return queryOps.scanWithFilter(this.table, options);\n  }\n  \n  /**\n   * Scan all chunks in the database\n   * Fetches total count first, then retrieves all chunks in a single optimized query\n   * @param options - Filter options (language, pattern)\n   * @returns All matching chunks\n   */\n  async scanAll(options: {\n    language?: string;\n    pattern?: string;\n  } = {}): Promise<SearchResult[]> {\n    if (!this.table) {\n      throw new DatabaseError('Vector database not initialized');\n    }\n    return queryOps.scanAll(this.table, options);\n  }\n  \n  async querySymbols(options: {\n    language?: string;\n    pattern?: string;\n    symbolType?: 'function' | 'class' | 'interface';\n    limit?: number;\n  }): Promise<SearchResult[]> {\n    if (!this.table) {\n      throw new DatabaseError('Vector database not initialized');\n    }\n    return queryOps.querySymbols(this.table, options);\n  }\n  \n  async clear(): Promise<void> {\n    if (!this.db) {\n      throw new DatabaseError('Vector database not initialized');\n    }\n    await maintenanceOps.clear(this.db, this.table, this.tableName, this.dbPath);\n    this.table = null;\n  }\n  \n  async deleteByFile(filepath: string): Promise<void> {\n    if (!this.table) {\n      throw new DatabaseError('Vector database not initialized');\n    }\n    await maintenanceOps.deleteByFile(this.table, filepath);\n  }\n  \n  async updateFile(\n    filepath: string,\n    vectors: Float32Array[],\n    metadatas: ChunkMetadata[],\n    contents: string[]\n  ): Promise<void> {\n    if (!this.db) {\n      throw new DatabaseError('Vector database connection not initialized');\n    }\n    if (!this.table) {\n      throw new DatabaseError('Vector database table not initialized');\n    }\n    this.table = await maintenanceOps.updateFile(\n      this.db,\n      this.table,\n      this.tableName,\n      this.dbPath,\n      filepath,\n      vectors,\n      metadatas,\n      contents\n    );\n  }\n  \n  async checkVersion(): Promise<boolean> {\n    const now = Date.now();\n    \n    // Cache version checks for 1 second to minimize I/O\n    if (now - this.lastVersionCheck < 1000) {\n      return false;\n    }\n    \n    this.lastVersionCheck = now;\n    \n    try {\n      const version = await readVersionFile(this.dbPath);\n      \n      if (version > this.currentVersion) {\n        this.currentVersion = version;\n        return true;\n      }\n      \n      return false;\n    } catch (error) {\n      // If we can't read version file, don't reconnect\n      return false;\n    }\n  }\n  \n  async reconnect(): Promise<void> {\n    try {\n      // Close existing connections to force reload from disk\n      this.table = null;\n      this.db = null;\n      \n      // Reinitialize with fresh connection\n      await this.initialize();\n    } catch (error) {\n      throw wrapError(error, 'Failed to reconnect to vector database');\n    }\n  }\n  \n  getCurrentVersion(): number {\n    return this.currentVersion;\n  }\n  \n  getVersionDate(): string {\n    if (this.currentVersion === 0) {\n      return 'Unknown';\n    }\n    return new Date(this.currentVersion).toLocaleString();\n  }\n  \n  async hasData(): Promise<boolean> {\n    if (!this.table) {\n      return false;\n    }\n    \n    try {\n      const count = await this.table.countRows();\n      \n      if (count === 0) {\n        return false;\n      }\n      \n      // Sample a few rows to verify they contain real data\n      const sample = await this.table\n        .search(Array(EMBEDDING_DIMENSION).fill(0))\n        .limit(Math.min(count, 5))\n        .toArray();\n      \n      const hasRealData = (sample as unknown as any[]).some((r: any) => \n        r.content && \n        r.content.trim().length > 0\n      );\n      \n      return hasRealData;\n    } catch {\n      // If any error occurs, assume no data\n      return false;\n    }\n  }\n  \n  static async load(projectRoot: string): Promise<VectorDB> {\n    const db = new VectorDB(projectRoot);\n    await db.initialize();\n    return db;\n  }\n}\n","import fs from 'fs/promises';\nimport path from 'path';\nimport { INDEX_FORMAT_VERSION } from '../constants.js';\nimport { GitState } from '../git/tracker.js';\nimport { getPackageVersion } from '../utils/version.js';\n\nconst MANIFEST_FILE = 'manifest.json';\n\n/**\n * Represents a single file in the index manifest\n */\nexport interface FileEntry {\n  filepath: string;\n  lastModified: number;\n  chunkCount: number;\n}\n\n/**\n * Index manifest tracking all indexed files and version information\n */\nexport interface IndexManifest {\n  formatVersion: number;      // Index format version for compatibility checking\n  lienVersion: string;         // Lien package version (for reference)\n  lastIndexed: number;         // Timestamp of last indexing operation\n  gitState?: GitState;         // Last known git state\n  files: Record<string, FileEntry>;  // Map of filepath -> FileEntry (stored as object for JSON)\n}\n\n/**\n * Manages the index manifest file, tracking which files are indexed\n * and their metadata for incremental indexing support.\n * \n * The manifest includes version checking to invalidate indices when\n * Lien's indexing format changes (e.g., new chunking algorithm,\n * different embedding model, schema changes).\n */\nexport class ManifestManager {\n  private manifestPath: string;\n  private indexPath: string;\n  \n  /**\n   * Promise-based lock to prevent race conditions during concurrent updates.\n   * Ensures read-modify-write operations are atomic.\n   */\n  private updateLock = Promise.resolve();\n  \n  /**\n   * Creates a new ManifestManager\n   * @param indexPath - Path to the index directory (same as VectorDB path)\n   */\n  constructor(indexPath: string) {\n    this.indexPath = indexPath;\n    this.manifestPath = path.join(indexPath, MANIFEST_FILE);\n  }\n  \n  /**\n   * Loads the manifest from disk.\n   * Returns null if:\n   * - Manifest doesn't exist (first run)\n   * - Manifest is corrupt\n   * - Format version is incompatible (triggers full reindex)\n   * \n   * @returns Loaded manifest or null\n   */\n  async load(): Promise<IndexManifest | null> {\n    try {\n      const content = await fs.readFile(this.manifestPath, 'utf-8');\n      const manifest = JSON.parse(content) as IndexManifest;\n      \n      // VERSION CHECK: Invalidate if format version doesn't match\n      if (manifest.formatVersion !== INDEX_FORMAT_VERSION) {\n        console.error(\n          `[Lien] Index format v${manifest.formatVersion} is incompatible with current v${INDEX_FORMAT_VERSION}`\n        );\n        console.error(`[Lien] Full reindex required after Lien upgrade`);\n        \n        // Clear old manifest and return null (triggers full reindex)\n        await this.clear();\n        return null;\n      }\n      \n      return manifest;\n    } catch (error) {\n      // File doesn't exist or is invalid - return null for first run\n      if ((error as NodeJS.ErrnoException).code === 'ENOENT') {\n        return null;\n      }\n      \n      // Corrupt manifest - log warning and return null\n      console.error(`[Lien] Warning: Failed to load manifest: ${error}`);\n      return null;\n    }\n  }\n  \n  /**\n   * Saves the manifest to disk.\n   * Always saves with current format and package versions.\n   * \n   * @param manifest - Manifest to save\n   */\n  async save(manifest: IndexManifest): Promise<void> {\n    try {\n      // Ensure index directory exists\n      await fs.mkdir(this.indexPath, { recursive: true });\n      \n      // Always save with current versions\n      const manifestToSave: IndexManifest = {\n        ...manifest,\n        formatVersion: INDEX_FORMAT_VERSION,\n        lienVersion: getPackageVersion(),\n        lastIndexed: Date.now(),\n      };\n      \n      const content = JSON.stringify(manifestToSave, null, 2);\n      await fs.writeFile(this.manifestPath, content, 'utf-8');\n    } catch (error) {\n      // Don't throw - manifest is best-effort\n      console.error(`[Lien] Warning: Failed to save manifest: ${error}`);\n    }\n  }\n  \n  /**\n   * Adds or updates a file entry in the manifest.\n   * Protected by lock to prevent race conditions during concurrent updates.\n   * \n   * @param filepath - Path to the file\n   * @param entry - File entry metadata\n   */\n  async updateFile(filepath: string, entry: FileEntry): Promise<void> {\n    // Chain this operation to the lock to ensure atomicity\n    this.updateLock = this.updateLock.then(async () => {\n      const manifest = await this.load() || this.createEmpty();\n      manifest.files[filepath] = entry;\n      await this.save(manifest);\n    }).catch(error => {\n      console.error(`[Lien] Failed to update manifest for ${filepath}: ${error}`);\n      // Return to reset lock - don't let errors block future operations\n      return undefined;\n    });\n    \n    // Wait for this operation to complete\n    await this.updateLock;\n  }\n  \n  /**\n   * Removes a file entry from the manifest.\n   * Protected by lock to prevent race conditions during concurrent updates.\n   * \n   * Note: If the manifest doesn't exist, this is a no-op (not an error).\n   * This can happen legitimately after clearing the index or on fresh installs.\n   * \n   * @param filepath - Path to the file to remove\n   */\n  async removeFile(filepath: string): Promise<void> {\n    // Chain this operation to the lock to ensure atomicity\n    this.updateLock = this.updateLock.then(async () => {\n      const manifest = await this.load();\n      if (!manifest) {\n        // No manifest exists - nothing to remove from (expected in some scenarios)\n        return;\n      }\n      \n      delete manifest.files[filepath];\n      await this.save(manifest);\n    }).catch(error => {\n      console.error(`[Lien] Failed to remove manifest entry for ${filepath}: ${error}`);\n      // Return to reset lock - don't let errors block future operations\n      return undefined;\n    });\n    \n    // Wait for this operation to complete\n    await this.updateLock;\n  }\n  \n  /**\n   * Updates multiple files at once (more efficient than individual updates).\n   * Protected by lock to prevent race conditions during concurrent updates.\n   * \n   * @param entries - Array of file entries to update\n   */\n  async updateFiles(entries: FileEntry[]): Promise<void> {\n    // Chain this operation to the lock to ensure atomicity\n    this.updateLock = this.updateLock.then(async () => {\n      const manifest = await this.load() || this.createEmpty();\n      \n      for (const entry of entries) {\n        manifest.files[entry.filepath] = entry;\n      }\n      \n      await this.save(manifest);\n    }).catch(error => {\n      console.error(`[Lien] Failed to update manifest for ${entries.length} files: ${error}`);\n      // Return to reset lock - don't let errors block future operations\n      return undefined;\n    });\n    \n    // Wait for this operation to complete\n    await this.updateLock;\n  }\n  \n  /**\n   * Updates the git state in the manifest.\n   * Protected by lock to prevent race conditions during concurrent updates.\n   * \n   * @param gitState - Current git state\n   */\n  async updateGitState(gitState: GitState): Promise<void> {\n    // Chain this operation to the lock to ensure atomicity\n    this.updateLock = this.updateLock.then(async () => {\n      const manifest = await this.load() || this.createEmpty();\n      \n      manifest.gitState = gitState;\n      await this.save(manifest);\n    }).catch(error => {\n      console.error(`[Lien] Failed to update git state in manifest: ${error}`);\n      // Return to reset lock - don't let errors block future operations\n      return undefined;\n    });\n    \n    // Wait for this operation to complete\n    await this.updateLock;\n  }\n  \n  /**\n   * Gets the list of files currently in the manifest\n   * \n   * @returns Array of filepaths\n   */\n  async getIndexedFiles(): Promise<string[]> {\n    const manifest = await this.load();\n    if (!manifest) return [];\n    \n    return Object.keys(manifest.files);\n  }\n  \n  /**\n   * Detects which files have changed based on mtime comparison\n   * \n   * @param currentFiles - Map of current files with their mtimes\n   * @returns Array of filepaths that have changed\n   */\n  async getChangedFiles(currentFiles: Map<string, number>): Promise<string[]> {\n    const manifest = await this.load();\n    if (!manifest) {\n      // No manifest = all files are \"changed\" (need full index)\n      return Array.from(currentFiles.keys());\n    }\n    \n    const changedFiles: string[] = [];\n    \n    for (const [filepath, mtime] of currentFiles) {\n      const entry = manifest.files[filepath];\n      \n      if (!entry) {\n        // New file\n        changedFiles.push(filepath);\n      } else if (entry.lastModified < mtime) {\n        // File modified since last index\n        changedFiles.push(filepath);\n      }\n    }\n    \n    return changedFiles;\n  }\n  \n  /**\n   * Gets files that are in the manifest but not in the current file list\n   * (i.e., deleted files)\n   * \n   * @param currentFiles - Set of current file paths\n   * @returns Array of deleted file paths\n   */\n  async getDeletedFiles(currentFiles: Set<string>): Promise<string[]> {\n    const manifest = await this.load();\n    if (!manifest) return [];\n    \n    const deletedFiles: string[] = [];\n    \n    for (const filepath of Object.keys(manifest.files)) {\n      if (!currentFiles.has(filepath)) {\n        deletedFiles.push(filepath);\n      }\n    }\n    \n    return deletedFiles;\n  }\n  \n  /**\n   * Clears the manifest file\n   */\n  async clear(): Promise<void> {\n    try {\n      await fs.unlink(this.manifestPath);\n    } catch (error) {\n      // Ignore error if file doesn't exist\n      if ((error as NodeJS.ErrnoException).code !== 'ENOENT') {\n        console.error(`[Lien] Warning: Failed to clear manifest: ${error}`);\n      }\n    }\n  }\n  \n  /**\n   * Creates an empty manifest with current version information\n   * \n   * @returns Empty manifest\n   */\n  private createEmpty(): IndexManifest {\n    return {\n      formatVersion: INDEX_FORMAT_VERSION,\n      lienVersion: getPackageVersion(),\n      lastIndexed: Date.now(),\n      files: {},\n    };\n  }\n}\n\n","import fs from 'fs/promises';\nimport path from 'path';\nimport {\n  isGitRepo,\n  getCurrentBranch,\n  getCurrentCommit,\n  getChangedFiles,\n  getChangedFilesBetweenCommits,\n} from './utils.js';\n\nexport interface GitState {\n  branch: string;\n  commit: string;\n  timestamp: number;\n}\n\n/**\n * Tracks git state (branch and commit) and detects changes.\n * Persists state to disk to survive server restarts.\n */\nexport class GitStateTracker {\n  private stateFile: string;\n  private rootDir: string;\n  private currentState: GitState | null = null;\n  \n  constructor(rootDir: string, indexPath: string) {\n    this.rootDir = rootDir;\n    this.stateFile = path.join(indexPath, '.git-state.json');\n  }\n  \n  /**\n   * Loads the last known git state from disk.\n   * Returns null if no state file exists (first run).\n   */\n  private async loadState(): Promise<GitState | null> {\n    try {\n      const content = await fs.readFile(this.stateFile, 'utf-8');\n      return JSON.parse(content);\n    } catch {\n      // File doesn't exist or is invalid - this is fine for first run\n      return null;\n    }\n  }\n  \n  /**\n   * Saves the current git state to disk.\n   */\n  private async saveState(state: GitState): Promise<void> {\n    try {\n      const content = JSON.stringify(state, null, 2);\n      await fs.writeFile(this.stateFile, content, 'utf-8');\n    } catch (error) {\n      // Log but don't throw - state persistence is best-effort\n      console.error(`[Lien] Warning: Failed to save git state: ${error}`);\n    }\n  }\n  \n  /**\n   * Gets the current git state from the repository.\n   * \n   * @returns Current git state\n   * @throws Error if git commands fail\n   */\n  private async getCurrentGitState(): Promise<GitState> {\n    const branch = await getCurrentBranch(this.rootDir);\n    const commit = await getCurrentCommit(this.rootDir);\n    \n    return {\n      branch,\n      commit,\n      timestamp: Date.now(),\n    };\n  }\n  \n  /**\n   * Initializes the tracker by loading saved state and checking current state.\n   * Should be called once when MCP server starts.\n   * \n   * @returns Array of changed files if state changed, null if no changes or first run\n   */\n  async initialize(): Promise<string[] | null> {\n    // Check if this is a git repo\n    const isRepo = await isGitRepo(this.rootDir);\n    if (!isRepo) {\n      return null;\n    }\n    \n    try {\n      // Get current state\n      this.currentState = await this.getCurrentGitState();\n      \n      // Load previous state\n      const previousState = await this.loadState();\n      \n      if (!previousState) {\n        // First run - save current state\n        await this.saveState(this.currentState);\n        return null;\n      }\n      \n      // Check if state changed\n      const branchChanged = previousState.branch !== this.currentState.branch;\n      const commitChanged = previousState.commit !== this.currentState.commit;\n      \n      if (!branchChanged && !commitChanged) {\n        // No changes\n        return null;\n      }\n      \n      // State changed - get list of changed files\n      let changedFiles: string[] = [];\n      \n      if (branchChanged) {\n        // Branch changed - compare current branch with previous branch\n        try {\n          changedFiles = await getChangedFiles(\n            this.rootDir,\n            previousState.branch,\n            this.currentState.branch\n          );\n        } catch (error) {\n          // If branches diverged too much or don't exist, fall back to commit diff\n          console.error(`[Lien] Branch diff failed, using commit diff: ${error}`);\n          changedFiles = await getChangedFilesBetweenCommits(\n            this.rootDir,\n            previousState.commit,\n            this.currentState.commit\n          );\n        }\n      } else if (commitChanged) {\n        // Same branch, different commit\n        changedFiles = await getChangedFilesBetweenCommits(\n          this.rootDir,\n          previousState.commit,\n          this.currentState.commit\n        );\n      }\n      \n      // Save new state\n      await this.saveState(this.currentState);\n      \n      return changedFiles;\n    } catch (error) {\n      console.error(`[Lien] Failed to initialize git tracker: ${error}`);\n      return null;\n    }\n  }\n  \n  /**\n   * Checks for git state changes since last check.\n   * This is called periodically by the MCP server.\n   * \n   * @returns Array of changed files if state changed, null if no changes\n   */\n  async detectChanges(): Promise<string[] | null> {\n    // Check if this is a git repo\n    const isRepo = await isGitRepo(this.rootDir);\n    if (!isRepo) {\n      return null;\n    }\n    \n    try {\n      // Get current state\n      const newState = await this.getCurrentGitState();\n      \n      // If we don't have a previous state, just save current and return\n      if (!this.currentState) {\n        this.currentState = newState;\n        await this.saveState(newState);\n        return null;\n      }\n      \n      // Check if state changed\n      const branchChanged = this.currentState.branch !== newState.branch;\n      const commitChanged = this.currentState.commit !== newState.commit;\n      \n      if (!branchChanged && !commitChanged) {\n        // No changes\n        return null;\n      }\n      \n      // State changed - get list of changed files\n      let changedFiles: string[] = [];\n      \n      if (branchChanged) {\n        // Branch changed\n        try {\n          changedFiles = await getChangedFiles(\n            this.rootDir,\n            this.currentState.branch,\n            newState.branch\n          );\n        } catch (error) {\n          // Fall back to commit diff\n          console.error(`[Lien] Branch diff failed, using commit diff: ${error}`);\n          changedFiles = await getChangedFilesBetweenCommits(\n            this.rootDir,\n            this.currentState.commit,\n            newState.commit\n          );\n        }\n      } else if (commitChanged) {\n        // Same branch, different commit\n        changedFiles = await getChangedFilesBetweenCommits(\n          this.rootDir,\n          this.currentState.commit,\n          newState.commit\n        );\n      }\n      \n      // Update current state\n      this.currentState = newState;\n      await this.saveState(newState);\n      \n      return changedFiles;\n    } catch (error) {\n      console.error(`[Lien] Failed to detect git changes: ${error}`);\n      return null;\n    }\n  }\n  \n  /**\n   * Gets the current git state.\n   * Useful for status display.\n   */\n  getState(): GitState | null {\n    return this.currentState;\n  }\n  \n  /**\n   * Manually updates the saved state.\n   * Useful after manual reindexing to sync state.\n   */\n  async updateState(): Promise<void> {\n    try {\n      this.currentState = await this.getCurrentGitState();\n      await this.saveState(this.currentState);\n    } catch (error) {\n      console.error(`[Lien] Failed to update git state: ${error}`);\n    }\n  }\n}\n\n","/**\n * Result type for explicit error handling.\n * \n * Provides a type-safe alternative to throwing exceptions, making error\n * handling explicit in function signatures.\n * \n * @example\n * ```typescript\n * function divide(a: number, b: number): Result<number, string> {\n *   if (b === 0) {\n *     return Err('Division by zero');\n *   }\n *   return Ok(a / b);\n * }\n * \n * const result = divide(10, 2);\n * if (isOk(result)) {\n *   console.log(result.value); // 5\n * } else {\n *   console.error(result.error);\n * }\n * ```\n */\n\n/**\n * Result type representing either success (Ok) or failure (Err)\n */\nexport type Result<T, E = Error> = \n  | { ok: true; value: T }\n  | { ok: false; error: E };\n\n/**\n * Creates a successful Result containing a value\n */\nexport function Ok<T>(value: T): Result<T, never> {\n  return { ok: true, value };\n}\n\n/**\n * Creates a failed Result containing an error\n */\nexport function Err<E>(error: E): Result<never, E> {\n  return { ok: false, error };\n}\n\n/**\n * Type guard to check if a Result is Ok\n */\nexport function isOk<T, E>(result: Result<T, E>): result is { ok: true; value: T } {\n  return result.ok;\n}\n\n/**\n * Type guard to check if a Result is Err\n */\nexport function isErr<T, E>(result: Result<T, E>): result is { ok: false; error: E } {\n  return !result.ok;\n}\n\n/**\n * Unwraps a Result, throwing if it's an error\n * @throws {E} The error if Result is Err\n */\nexport function unwrap<T, E>(result: Result<T, E>): T {\n  if (isOk(result)) {\n    return result.value;\n  }\n  throw result.error;\n}\n\n/**\n * Unwraps a Result or returns a default value if it's an error\n */\nexport function unwrapOr<T, E>(result: Result<T, E>, defaultValue: T): T {\n  if (isOk(result)) {\n    return result.value;\n  }\n  return defaultValue;\n}\n\n","import fs from 'fs/promises';\nimport path from 'path';\nimport { chunkFile } from './chunker.js';\nimport { EmbeddingService } from '../embeddings/types.js';\nimport { VectorDB } from '../vectordb/lancedb.js';\nimport { LienConfig, LegacyLienConfig, isModernConfig, isLegacyConfig } from '../config/schema.js';\nimport { ManifestManager } from './manifest.js';\nimport { EMBEDDING_MICRO_BATCH_SIZE } from '../constants.js';\nimport { CodeChunk } from './types.js';\nimport { Result, Ok, Err, isOk } from '../utils/result.js';\n\n/**\n * Normalize a file path to a consistent relative format.\n * This ensures paths from different sources (git diff, scanner, etc.)\n * are stored and queried consistently in the index.\n * \n * @param filepath - Absolute or relative file path\n * @param rootDir - Workspace root directory (defaults to cwd)\n * @returns Relative path from rootDir\n */\nexport function normalizeToRelativePath(filepath: string, rootDir?: string): string {\n  // Normalize root and strip trailing slash to ensure consistent comparison\n  const root = (rootDir || process.cwd()).replace(/\\\\/g, '/').replace(/\\/$/, '');\n  const normalized = filepath.replace(/\\\\/g, '/');\n  \n  // If already relative, return as-is\n  if (!path.isAbsolute(filepath)) {\n    return normalized;\n  }\n  \n  // Convert absolute to relative\n  if (normalized.startsWith(root + '/')) {\n    return normalized.slice(root.length + 1);\n  }\n  if (normalized.startsWith(root)) {\n    return normalized.slice(root.length);\n  }\n  \n  // Fallback: use path.relative\n  return path.relative(root, filepath).replace(/\\\\/g, '/');\n}\n\nexport interface IncrementalIndexOptions {\n  verbose?: boolean;\n}\n\n/**\n * Result of processing a file's content into chunks and embeddings.\n */\ninterface ProcessFileResult {\n  chunkCount: number;\n  vectors: Float32Array[];\n  chunks: CodeChunk[];\n  texts: string[];\n}\n\n/**\n * Result of processing a single file for incremental indexing.\n */\ninterface FileProcessResult {\n  filepath: string;\n  result: ProcessFileResult | null; // null for empty files\n  mtime: number;\n}\n\n/**\n * Shared helper that processes file content into chunks and embeddings.\n * This is the core logic shared between indexSingleFile and indexMultipleFiles.\n * \n * Returns null for empty files (0 chunks), which callers should handle appropriately.\n * \n * @param filepath - Path to the file being processed\n * @param content - File content\n * @param embeddings - Embeddings service\n * @param config - Lien configuration\n * @param verbose - Whether to log verbose output\n * @returns ProcessFileResult for non-empty files, null for empty files\n */\nasync function processFileContent(\n  filepath: string,\n  content: string,\n  embeddings: EmbeddingService,\n  config: LienConfig | LegacyLienConfig,\n  verbose: boolean\n): Promise<ProcessFileResult | null> {\n  // Get chunk settings (support both v0.3.0 and legacy v0.2.0 configs)\n  const chunkSize = isModernConfig(config)\n    ? config.core.chunkSize\n    : (isLegacyConfig(config) ? config.indexing.chunkSize : 75);\n  const chunkOverlap = isModernConfig(config)\n    ? config.core.chunkOverlap\n    : (isLegacyConfig(config) ? config.indexing.chunkOverlap : 10);\n  const useAST = isModernConfig(config)\n    ? config.chunking.useAST\n    : true;\n  const astFallback = isModernConfig(config)\n    ? config.chunking.astFallback\n    : 'line-based';\n  \n  // Chunk the file\n  const chunks = chunkFile(filepath, content, {\n    chunkSize,\n    chunkOverlap,\n    useAST,\n    astFallback,\n  });\n  \n  if (chunks.length === 0) {\n    // Empty file - return null so caller can handle appropriately\n    if (verbose) {\n      console.error(`[Lien] Empty file: ${filepath}`);\n    }\n    return null;\n  }\n  \n  // Generate embeddings for all chunks\n  // Use micro-batching to prevent event loop blocking\n  const texts = chunks.map(c => c.content);\n  const vectors: Float32Array[] = [];\n  \n  for (let j = 0; j < texts.length; j += EMBEDDING_MICRO_BATCH_SIZE) {\n    const microBatch = texts.slice(j, Math.min(j + EMBEDDING_MICRO_BATCH_SIZE, texts.length));\n    const microResults = await embeddings.embedBatch(microBatch);\n    vectors.push(...microResults);\n    \n    // Yield to event loop for responsiveness\n    if (texts.length > EMBEDDING_MICRO_BATCH_SIZE) {\n      await new Promise(resolve => setImmediate(resolve));\n    }\n  }\n  \n  return {\n    chunkCount: chunks.length,\n    vectors,\n    chunks,\n    texts,\n  };\n}\n\n/**\n * Indexes a single file incrementally by updating its chunks in the vector database.\n * This is the core function for incremental reindexing - it handles file changes,\n * deletions, and additions.\n * \n * @param filepath - Absolute path to the file to index\n * @param vectorDB - Initialized VectorDB instance\n * @param embeddings - Initialized embeddings service\n * @param config - Lien configuration\n * @param options - Optional settings\n */\nexport async function indexSingleFile(\n  filepath: string,\n  vectorDB: VectorDB,\n  embeddings: EmbeddingService,\n  config: LienConfig | LegacyLienConfig,\n  options: IncrementalIndexOptions = {}\n): Promise<void> {\n  const { verbose } = options;\n  \n  // Normalize to relative path for consistent storage and queries\n  // This ensures paths from git diff (absolute) match paths from scanner (relative)\n  const normalizedPath = normalizeToRelativePath(filepath);\n  \n  try {\n    // Check if file exists (use original filepath for filesystem operations)\n    try {\n      await fs.access(filepath);\n    } catch {\n      // File doesn't exist - delete from index and manifest using normalized path\n      if (verbose) {\n        console.error(`[Lien] File deleted: ${normalizedPath}`);\n      }\n      await vectorDB.deleteByFile(normalizedPath);\n      \n      const manifest = new ManifestManager(vectorDB.dbPath);\n      await manifest.removeFile(normalizedPath);\n      return;\n    }\n    \n    // Read file content\n    const content = await fs.readFile(filepath, 'utf-8');\n    \n    // Process file content (chunking + embeddings) - use normalized path for storage\n    const result = await processFileContent(normalizedPath, content, embeddings, config, verbose || false);\n    \n    // Get actual file mtime for manifest\n    const stats = await fs.stat(filepath);\n    const manifest = new ManifestManager(vectorDB.dbPath);\n    \n    if (result === null) {\n      // Empty file - remove from vector DB but keep in manifest with chunkCount: 0\n      await vectorDB.deleteByFile(normalizedPath);\n      await manifest.updateFile(normalizedPath, {\n        filepath: normalizedPath,\n        lastModified: stats.mtimeMs,\n        chunkCount: 0,\n      });\n      return;\n    }\n    \n    // Non-empty file - update in database (atomic: delete old + insert new)\n    await vectorDB.updateFile(\n      normalizedPath,\n      result.vectors,\n      result.chunks.map(c => c.metadata),\n      result.texts\n    );\n    \n    // Update manifest after successful indexing\n    await manifest.updateFile(normalizedPath, {\n      filepath: normalizedPath,\n      lastModified: stats.mtimeMs,\n      chunkCount: result.chunkCount,\n    });\n    \n    if (verbose) {\n      console.error(`[Lien] ✓ Updated ${normalizedPath} (${result.chunkCount} chunks)`);\n    }\n  } catch (error) {\n    // Log error but don't throw - we want to continue with other files\n    console.error(`[Lien] ⚠️  Failed to index ${normalizedPath}: ${error}`);\n  }\n}\n\n/**\n * Process a single file, returning a Result type.\n * This helper makes error handling explicit and testable.\n * \n * @param filepath - Original filepath (may be absolute)\n * @param normalizedPath - Normalized relative path for storage\n */\nasync function processSingleFileForIndexing(\n  filepath: string,\n  normalizedPath: string,\n  embeddings: EmbeddingService,\n  config: LienConfig | LegacyLienConfig,\n  verbose: boolean\n): Promise<Result<FileProcessResult, string>> {\n  try {\n    // Read file stats and content using original path (for filesystem access)\n    const stats = await fs.stat(filepath);\n    const content = await fs.readFile(filepath, 'utf-8');\n    \n    // Process content using normalized path (for storage)\n    const result = await processFileContent(normalizedPath, content, embeddings, config, verbose);\n    \n    return Ok({\n      filepath: normalizedPath,  // Store normalized path\n      result,\n      mtime: stats.mtimeMs,\n    });\n  } catch (error) {\n    return Err(`Failed to process ${normalizedPath}: ${error}`);\n  }\n}\n\n/**\n * Indexes multiple files incrementally.\n * Processes files sequentially for simplicity and reliability.\n * \n * Uses Result type for explicit error handling, making it easier to test\n * and reason about failure modes.\n * \n * Note: This function counts both successfully indexed files AND successfully\n * handled deletions (files that don't exist but were removed from the index).\n * \n * @param filepaths - Array of absolute file paths to index\n * @param vectorDB - Initialized VectorDB instance\n * @param embeddings - Initialized embeddings service\n * @param config - Lien configuration\n * @param options - Optional settings\n * @returns Number of successfully processed files (indexed or deleted)\n */\nexport async function indexMultipleFiles(\n  filepaths: string[],\n  vectorDB: VectorDB,\n  embeddings: EmbeddingService,\n  config: LienConfig | LegacyLienConfig,\n  options: IncrementalIndexOptions = {}\n): Promise<number> {\n  const { verbose } = options;\n  let processedCount = 0;\n  \n  // Batch manifest updates for performance\n  const manifestEntries: Array<{ filepath: string; chunkCount: number; mtime: number }> = [];\n  \n  // Process each file sequentially (simple and reliable)\n  for (const filepath of filepaths) {\n    // Normalize to relative path for consistent storage and queries\n    // This ensures paths from git diff (absolute) match paths from scanner (relative)\n    const normalizedPath = normalizeToRelativePath(filepath);\n    \n    const result = await processSingleFileForIndexing(filepath, normalizedPath, embeddings, config, verbose || false);\n    \n    if (isOk(result)) {\n      const { filepath: storedPath, result: processResult, mtime } = result.value;\n      \n      if (processResult === null) {\n        // Empty file - remove from vector DB but keep in manifest with chunkCount: 0\n        try {\n          await vectorDB.deleteByFile(storedPath);\n        } catch (error) {\n          // Ignore errors if file wasn't in index\n        }\n        \n        // Update manifest immediately for empty files (not batched)\n        const manifest = new ManifestManager(vectorDB.dbPath);\n        await manifest.updateFile(storedPath, {\n          filepath: storedPath,\n          lastModified: mtime,\n          chunkCount: 0,\n        });\n        \n        processedCount++;\n        continue;\n      }\n      \n      // Non-empty file - delete old chunks if they exist\n      try {\n        await vectorDB.deleteByFile(storedPath);\n      } catch (error) {\n        // Ignore - file might not be in index yet\n      }\n      \n      // Insert new chunks\n      await vectorDB.insertBatch(\n        processResult.vectors,\n        processResult.chunks.map(c => c.metadata),\n        processResult.texts\n      );\n      \n      // Queue manifest update (batch at end)\n      manifestEntries.push({\n        filepath: storedPath,\n        chunkCount: processResult.chunkCount,\n        mtime,\n      });\n      \n      if (verbose) {\n        console.error(`[Lien] ✓ Updated ${storedPath} (${processResult.chunkCount} chunks)`);\n      }\n      \n      processedCount++;\n    } else {\n      // File doesn't exist or couldn't be read - handle deletion\n      if (verbose) {\n        console.error(`[Lien] ${result.error}`);\n      }\n      \n      try {\n        await vectorDB.deleteByFile(normalizedPath);\n        const manifest = new ManifestManager(vectorDB.dbPath);\n        await manifest.removeFile(normalizedPath);\n      } catch (error) {\n        // Ignore errors if file wasn't in index\n        if (verbose) {\n          console.error(`[Lien] Note: ${normalizedPath} not in index`);\n        }\n      }\n      \n      // Count as processed regardless of deletion success/failure\n      processedCount++;\n    }\n  }\n  \n  // Batch update manifest at the end (much faster than updating after each file)\n  if (manifestEntries.length > 0) {\n    const manifest = new ManifestManager(vectorDB.dbPath);\n    await manifest.updateFiles(\n      manifestEntries.map(entry => ({\n        filepath: entry.filepath,\n        lastModified: entry.mtime, // Use actual file mtime for accurate change detection\n        chunkCount: entry.chunkCount,\n      }))\n    );\n  }\n  \n  return processedCount;\n}\n\n","import fs from 'fs/promises';\nimport path from 'path';\nimport { VectorDB } from '../vectordb/lancedb.js';\nimport { ManifestManager, IndexManifest } from './manifest.js';\nimport { scanCodebase, scanCodebaseWithFrameworks } from './scanner.js';\nimport { LienConfig, LegacyLienConfig, isModernConfig, isLegacyConfig } from '../config/schema.js';\nimport { GitStateTracker } from '../git/tracker.js';\nimport { isGitAvailable, isGitRepo, getChangedFiles } from '../git/utils.js';\nimport { normalizeToRelativePath } from './incremental.js';\n\n/**\n * Result of change detection, categorized by type of change\n */\nexport interface ChangeDetectionResult {\n  added: string[];      // New files not in previous index\n  modified: string[];   // Existing files that have been modified\n  deleted: string[];    // Files that were indexed but no longer exist\n  reason: 'mtime' | 'full' | 'git-state-changed';  // How changes were detected\n}\n\n/**\n * Check if git state has changed (branch switch, new commits).\n */\nasync function hasGitStateChanged(\n  rootDir: string,\n  dbPath: string,\n  savedGitState: IndexManifest['gitState']\n): Promise<{ changed: boolean; currentState?: ReturnType<GitStateTracker['getState']> }> {\n  if (!savedGitState) return { changed: false };\n\n  const gitAvailable = await isGitAvailable();\n  const isRepo = await isGitRepo(rootDir);\n  if (!gitAvailable || !isRepo) return { changed: false };\n\n  const gitTracker = new GitStateTracker(rootDir, dbPath);\n  await gitTracker.initialize();\n  const currentState = gitTracker.getState();\n\n  if (!currentState) return { changed: false };\n\n  const changed = currentState.branch !== savedGitState.branch ||\n                  currentState.commit !== savedGitState.commit;\n\n  return { changed, currentState };\n}\n\n/**\n * Categorize files from git diff into added, modified, deleted.\n */\nfunction categorizeChangedFiles(\n  changedFilesPaths: string[],\n  currentFileSet: Set<string>,\n  normalizedManifestFiles: Set<string>,\n  allFiles: string[]\n): { added: string[]; modified: string[]; deleted: string[] } {\n  const changedFilesSet = new Set(changedFilesPaths);\n  const added: string[] = [];\n  const modified: string[] = [];\n  const deleted: string[] = [];\n\n  // Categorize files from git diff\n  for (const filepath of changedFilesPaths) {\n    if (currentFileSet.has(filepath)) {\n      if (normalizedManifestFiles.has(filepath)) {\n        modified.push(filepath);\n      } else {\n        added.push(filepath);\n      }\n    }\n  }\n\n  // Find truly new files (not in git diff, but not in old manifest)\n  for (const filepath of allFiles) {\n    if (!normalizedManifestFiles.has(filepath) && !changedFilesSet.has(filepath)) {\n      added.push(filepath);\n    }\n  }\n\n  // Find deleted files (in old manifest but not in current)\n  for (const normalizedPath of normalizedManifestFiles) {\n    if (!currentFileSet.has(normalizedPath)) {\n      deleted.push(normalizedPath);\n    }\n  }\n\n  return { added, modified, deleted };\n}\n\n/**\n * Build normalized set of manifest file paths for comparison.\n */\nfunction normalizeManifestPaths(\n  manifestFiles: IndexManifest['files'],\n  rootDir: string\n): Set<string> {\n  const normalized = new Set<string>();\n  for (const filepath of Object.keys(manifestFiles)) {\n    normalized.add(normalizeToRelativePath(filepath, rootDir));\n  }\n  return normalized;\n}\n\n/**\n * Detect changes using git diff between commits.\n */\nasync function detectGitBasedChanges(\n  rootDir: string,\n  savedManifest: IndexManifest,\n  currentCommit: string,\n  config: LienConfig | LegacyLienConfig\n): Promise<ChangeDetectionResult> {\n  const changedFilesAbsolute = await getChangedFiles(\n    rootDir,\n    savedManifest.gitState!.commit,\n    currentCommit\n  );\n  const changedFilesPaths = changedFilesAbsolute.map(fp => normalizeToRelativePath(fp, rootDir));\n\n  const allFiles = await getAllFiles(rootDir, config);\n  const currentFileSet = new Set(allFiles);\n  const normalizedManifestFiles = normalizeManifestPaths(savedManifest.files, rootDir);\n\n  const { added, modified, deleted } = categorizeChangedFiles(\n    changedFilesPaths,\n    currentFileSet,\n    normalizedManifestFiles,\n    allFiles\n  );\n\n  return { added, modified, deleted, reason: 'git-state-changed' };\n}\n\n/**\n * Fall back to full reindex when git diff fails.\n */\nasync function fallbackToFullReindex(\n  rootDir: string,\n  savedManifest: IndexManifest,\n  config: LienConfig | LegacyLienConfig\n): Promise<ChangeDetectionResult> {\n  const allFiles = await getAllFiles(rootDir, config);\n  const currentFileSet = new Set(allFiles);\n\n  const deleted: string[] = [];\n  for (const filepath of Object.keys(savedManifest.files)) {\n    const normalizedPath = normalizeToRelativePath(filepath, rootDir);\n    if (!currentFileSet.has(normalizedPath)) {\n      deleted.push(normalizedPath);\n    }\n  }\n\n  return { added: allFiles, modified: [], deleted, reason: 'git-state-changed' };\n}\n\n/**\n * Detects which files have changed since last indexing.\n * Uses git state detection to handle branch switches, then falls back to mtime.\n */\nexport async function detectChanges(\n  rootDir: string,\n  vectorDB: VectorDB,\n  config: LienConfig | LegacyLienConfig\n): Promise<ChangeDetectionResult> {\n  const manifest = new ManifestManager(vectorDB.dbPath);\n  const savedManifest = await manifest.load();\n\n  // No manifest = first run = full index\n  if (!savedManifest) {\n    const allFiles = await getAllFiles(rootDir, config);\n    return { added: allFiles, modified: [], deleted: [], reason: 'full' };\n  }\n\n  // Check if git state has changed\n  const gitCheck = await hasGitStateChanged(rootDir, vectorDB.dbPath, savedManifest.gitState);\n\n  if (gitCheck.changed && gitCheck.currentState) {\n    try {\n      return await detectGitBasedChanges(rootDir, savedManifest, gitCheck.currentState.commit, config);\n    } catch (error) {\n      console.warn(`[Lien] Git diff failed, falling back to full reindex: ${error}`);\n      return await fallbackToFullReindex(rootDir, savedManifest, config);\n    }\n  }\n\n  // Use mtime-based detection for file-level changes\n  return await mtimeBasedDetection(rootDir, savedManifest, config);\n}\n\n/**\n * Gets all files in the project based on configuration.\n * Always returns relative paths for consistent comparison with manifest and git diff.\n */\nasync function getAllFiles(\n  rootDir: string,\n  config: LienConfig | LegacyLienConfig\n): Promise<string[]> {\n  let files: string[];\n  \n  if (isModernConfig(config) && config.frameworks.length > 0) {\n    files = await scanCodebaseWithFrameworks(rootDir, config);\n  } else if (isLegacyConfig(config)) {\n    files = await scanCodebase({\n      rootDir,\n      includePatterns: config.indexing.include,\n      excludePatterns: config.indexing.exclude,\n    });\n  } else {\n    files = await scanCodebase({\n      rootDir,\n      includePatterns: [],\n      excludePatterns: [],\n    });\n  }\n  \n  // Normalize all paths to relative for consistent comparison\n  return files.map(fp => normalizeToRelativePath(fp, rootDir));\n}\n\n/**\n * Detects changes by comparing file modification times\n */\nasync function mtimeBasedDetection(\n  rootDir: string,\n  savedManifest: IndexManifest,\n  config: LienConfig | LegacyLienConfig\n): Promise<ChangeDetectionResult> {\n  const added: string[] = [];\n  const modified: string[] = [];\n  const deleted: string[] = [];\n  \n  // Get all current files (already normalized to relative paths by getAllFiles)\n  const currentFiles = await getAllFiles(rootDir, config);\n  const currentFileSet = new Set(currentFiles);\n  \n  // Build a normalized map of manifest files for comparison\n  // This handles cases where manifest has absolute paths (from tests or legacy data)\n  const normalizedManifestFiles = new Map<string, typeof savedManifest.files[string]>();\n  for (const [filepath, entry] of Object.entries(savedManifest.files)) {\n    const normalizedPath = normalizeToRelativePath(filepath, rootDir);\n    normalizedManifestFiles.set(normalizedPath, entry);\n  }\n  \n  // Get mtimes for all current files\n  // Note: need to construct absolute path for fs.stat since currentFiles are relative\n  const fileStats = new Map<string, number>();\n  \n  for (const filepath of currentFiles) {\n    try {\n      // Construct absolute path for filesystem access (use path.join for cross-platform)\n      const absolutePath = path.isAbsolute(filepath) ? filepath : path.join(rootDir, filepath);\n      const stats = await fs.stat(absolutePath);\n      fileStats.set(filepath, stats.mtimeMs);\n    } catch {\n      // Ignore files we can't stat\n      continue;\n    }\n  }\n  \n  // Check for new and modified files\n  for (const [filepath, mtime] of fileStats) {\n    const entry = normalizedManifestFiles.get(filepath);\n    \n    if (!entry) {\n      // New file\n      added.push(filepath);\n    } else if (entry.lastModified < mtime) {\n      // File modified since last index\n      modified.push(filepath);\n    }\n  }\n  \n  // Check for deleted files (use normalized manifest paths)\n  for (const normalizedPath of normalizedManifestFiles.keys()) {\n    if (!currentFileSet.has(normalizedPath)) {\n      deleted.push(normalizedPath);\n    }\n  }\n  \n  return {\n    added,\n    modified,\n    deleted,\n    reason: 'mtime',\n  };\n}\n\n","/**\n * Witty loading messages to keep users entertained during long operations.\n * Inspired by tools like npm, yarn, and other personality-driven CLIs.\n */\n\nconst INDEXING_MESSAGES = [\n  'Teaching AI to read your spaghetti code...',\n  'Convincing the LLM that your variable names make sense...',\n  'Indexing your TODO comments (so many TODOs)...',\n  'Building semantic links faster than you can say \"grep\"...',\n  'Making your codebase searchable (the good, the bad, and the ugly)...',\n  'Chunking code like a boss...',\n  \"Feeding your code to the neural network (it's hungry)...\",\n  \"Creating embeddings (it's like compression, but fancier)...\",\n  'Teaching machines to understand your midnight commits...',\n  'Vectorizing your technical debt...',\n  \"Indexing... because Ctrl+F wasn't cutting it anymore...\",\n  'Making semantic connections (unlike your last refactor)...',\n  'Processing files faster than your CI pipeline...',\n  'Embedding wisdom from your comments (all 3 of them)...',\n  'Analyzing code semantics (yes, even that one function)...',\n  'Building search index (now with 100% more AI)...',\n  \"Crunching vectors like it's nobody's business...\",\n  'Linking code fragments across the spacetime continuum...',\n  'Teaching transformers about your coding style...',\n  'Preparing for semantic search domination...',\n  'Indexing your genius (and that hacky workaround from 2019)...',\n  \"Making your codebase AI-readable (you're welcome, future you)...\",\n  'Converting code to math (engineers love this trick)...',\n  \"Building the neural net's mental model of your app...\",\n  'Chunking files like a lumberjack, but for code...',\n];\n\nconst EMBEDDING_MESSAGES = [\n  'Generating embeddings (math is happening)...',\n  'Teaching transformers about your forEach loops...',\n  'Converting code to 384-dimensional space (wild, right?)...',\n  'Running the neural network (the Matrix, but for code)...',\n  'Creating semantic vectors (fancy word for AI magic)...',\n  'Embedding your code into hyperspace...',\n  'Teaching the model what \"clean code\" means in your codebase...',\n  'Generating vectors faster than you can say \"AI\"...',\n  'Making math from your methods...',\n  'Transforming code into numbers (the AI way)...',\n  'Processing with transformers.js (yes, it runs locally!)...',\n  \"Embedding semantics (your code's hidden meaning)...\",\n  'Vectorizing variables (alliteration achieved)...',\n  'Teaching AI the difference between foo and bar...',\n  'Creating embeddings (384 dimensions of awesome)...',\n];\n\nconst MODEL_LOADING_MESSAGES = [\n  'Waking up the neural network...',\n  'Loading transformer model (patience, young padawan)...',\n  'Downloading AI brain (first run only, promise!)...',\n  'Initializing the semantic search engine...',\n  'Booting up the language model (coffee break recommended)...',\n  'Loading 100MB of pure AI goodness...',\n  'Preparing the transformer for action...',\n  'Model loading (this is why we run locally)...',\n  'Spinning up the embedding generator...',\n  'Getting the AI ready for your codebase...',\n];\n\nlet currentIndexingIndex = 0;\nlet currentEmbeddingIndex = 0;\nlet currentModelIndex = 0;\n\n/**\n * Get the next witty message for the indexing process.\n * Messages are returned sequentially in a round-robin fashion.\n */\nexport function getIndexingMessage(): string {\n  const message = INDEXING_MESSAGES[currentIndexingIndex % INDEXING_MESSAGES.length];\n  currentIndexingIndex++;\n  return message;\n}\n\n/**\n * Get the next witty message for the embedding generation process.\n * Messages are returned sequentially in a round-robin fashion.\n */\nexport function getEmbeddingMessage(): string {\n  const message = EMBEDDING_MESSAGES[currentEmbeddingIndex % EMBEDDING_MESSAGES.length];\n  currentEmbeddingIndex++;\n  return message;\n}\n\n/**\n * Get the next witty message for the model loading process.\n * Messages are returned sequentially in a round-robin fashion.\n */\nexport function getModelLoadingMessage(): string {\n  const message = MODEL_LOADING_MESSAGES[currentModelIndex % MODEL_LOADING_MESSAGES.length];\n  currentModelIndex++;\n  return message;\n}\n\n/**\n * Reset all message counters (useful for testing)\n */\nexport function resetMessageCounters(): void {\n  currentIndexingIndex = 0;\n  currentEmbeddingIndex = 0;\n  currentModelIndex = 0;\n}\n\n","import type { Ora } from 'ora';\nimport { getIndexingMessage } from '../utils/loading-messages.js';\n\n/**\n * Manages progress tracking and spinner updates during indexing.\n * \n * Handles:\n * - Periodic progress updates (files processed count)\n * - Message rotation (witty messages every 8 seconds)\n * - Clean separation from business logic\n * \n * @example\n * ```typescript\n * const tracker = new IndexingProgressTracker(1000, spinner);\n * tracker.start();\n * \n * // ... process files ...\n * tracker.incrementFiles();\n * \n * tracker.setMessage('Generating embeddings...');\n * tracker.stop();\n * ```\n */\nexport class IndexingProgressTracker {\n  private processedFiles = 0;\n  private totalFiles: number;\n  private wittyMessage: string;\n  private spinner: Ora;\n  private updateInterval?: NodeJS.Timeout;\n  \n  // Configuration constants\n  private static readonly SPINNER_UPDATE_INTERVAL_MS = 200;  // How often to update spinner\n  private static readonly MESSAGE_ROTATION_INTERVAL_MS = 8000;  // How often to rotate message\n  \n  constructor(totalFiles: number, spinner: Ora) {\n    this.totalFiles = totalFiles;\n    this.spinner = spinner;\n    this.wittyMessage = getIndexingMessage();\n  }\n  \n  /**\n   * Start the progress tracker.\n   * Sets up periodic updates for spinner and message rotation.\n   * \n   * Safe to call multiple times - will not create duplicate intervals.\n   */\n  start(): void {\n    // Prevent creating multiple intervals (resource leak)\n    if (this.updateInterval) {\n      return;\n    }\n    \n    const MESSAGE_ROTATION_TICKS = Math.floor(\n      IndexingProgressTracker.MESSAGE_ROTATION_INTERVAL_MS / \n      IndexingProgressTracker.SPINNER_UPDATE_INTERVAL_MS\n    );\n    \n    let spinnerTick = 0;\n    this.updateInterval = setInterval(() => {\n      // Rotate witty message periodically\n      spinnerTick++;\n      if (spinnerTick >= MESSAGE_ROTATION_TICKS) {\n        this.wittyMessage = getIndexingMessage();\n        spinnerTick = 0;  // Reset counter to prevent unbounded growth\n      }\n      \n      // Update spinner text with current progress\n      this.spinner.text = `${this.processedFiles}/${this.totalFiles} files | ${this.wittyMessage}`;\n    }, IndexingProgressTracker.SPINNER_UPDATE_INTERVAL_MS);\n  }\n  \n  /**\n   * Increment the count of processed files.\n   * \n   * Safe for async operations in Node.js's single-threaded event loop.\n   * Note: Not thread-safe for true concurrent operations (e.g., worker threads).\n   */\n  incrementFiles(): void {\n    this.processedFiles++;\n  }\n  \n  /**\n   * Set a custom message (e.g., for special operations like embedding generation).\n   * The message will be displayed until the next automatic rotation.\n   */\n  setMessage(message: string): void {\n    this.wittyMessage = message;\n  }\n  \n  /**\n   * Stop the progress tracker and clean up intervals.\n   * Must be called when indexing completes or fails.\n   */\n  stop(): void {\n    if (this.updateInterval) {\n      clearInterval(this.updateInterval);\n      this.updateInterval = undefined;\n    }\n  }\n  \n  /**\n   * Get the current count of processed files.\n   */\n  getProcessedCount(): number {\n    return this.processedFiles;\n  }\n  \n  /**\n   * Get the total number of files to process.\n   */\n  getTotalFiles(): number {\n    return this.totalFiles;\n  }\n  \n  /**\n   * Get the current message being displayed.\n   */\n  getCurrentMessage(): string {\n    return this.wittyMessage;\n  }\n}\n\n","import fs from 'fs/promises';\nimport ora, { type Ora } from 'ora';\nimport chalk from 'chalk';\nimport pLimit from 'p-limit';\nimport { scanCodebase, scanCodebaseWithFrameworks } from './scanner.js';\nimport { chunkFile } from './chunker.js';\nimport { LocalEmbeddings } from '../embeddings/local.js';\nimport { VectorDB } from '../vectordb/lancedb.js';\nimport { configService } from '../config/service.js';\nimport { CodeChunk } from './types.js';\nimport { writeVersionFile } from '../vectordb/version.js';\nimport { isLegacyConfig, isModernConfig, type LienConfig, type LegacyLienConfig } from '../config/schema.js';\nimport { ManifestManager } from './manifest.js';\nimport { detectChanges } from './change-detector.js';\nimport { indexMultipleFiles } from './incremental.js';\nimport { getIndexingMessage, getEmbeddingMessage, getModelLoadingMessage } from '../utils/loading-messages.js';\nimport { EMBEDDING_MICRO_BATCH_SIZE } from '../constants.js';\nimport { IndexingProgressTracker } from './progress-tracker.js';\nimport type { EmbeddingService } from '../embeddings/types.js';\n\nexport interface IndexingOptions {\n  rootDir?: string;\n  verbose?: boolean;\n  force?: boolean;  // Force full reindex, skip incremental\n}\n\ninterface ChunkWithContent {\n  chunk: CodeChunk;\n  content: string;\n}\n\n/** Extracted config values with defaults for indexing */\ninterface IndexingConfig {\n  concurrency: number;\n  embeddingBatchSize: number;\n  chunkSize: number;\n  chunkOverlap: number;\n  useAST: boolean;\n  astFallback: 'line-based' | 'error';\n}\n\n/** Extract indexing config values with defaults */\nfunction getIndexingConfig(config: LienConfig | LegacyLienConfig): IndexingConfig {\n  if (isModernConfig(config)) {\n    return {\n      concurrency: config.core.concurrency,\n      embeddingBatchSize: config.core.embeddingBatchSize,\n      chunkSize: config.core.chunkSize,\n      chunkOverlap: config.core.chunkOverlap,\n      useAST: config.chunking.useAST,\n      astFallback: config.chunking.astFallback,\n    };\n  }\n  // Legacy defaults\n  return {\n    concurrency: 4,\n    embeddingBatchSize: 50,\n    chunkSize: 75,\n    chunkOverlap: 10,\n    useAST: true,\n    astFallback: 'line-based',\n  };\n}\n\n/** Scan files based on config type */\nasync function scanFilesToIndex(\n  rootDir: string,\n  config: LienConfig | LegacyLienConfig\n): Promise<string[]> {\n  if (isModernConfig(config) && config.frameworks.length > 0) {\n    return scanCodebaseWithFrameworks(rootDir, config);\n  }\n  if (isLegacyConfig(config)) {\n    return scanCodebase({\n      rootDir,\n      includePatterns: config.indexing.include,\n      excludePatterns: config.indexing.exclude,\n    });\n  }\n  return scanCodebase({ rootDir, includePatterns: [], excludePatterns: [] });\n}\n\n/** Process embeddings in micro-batches to prevent event loop blocking */\nasync function processEmbeddingMicroBatches(\n  texts: string[],\n  embeddings: EmbeddingService\n): Promise<Float32Array[]> {\n  const results: Float32Array[] = [];\n  for (let j = 0; j < texts.length; j += EMBEDDING_MICRO_BATCH_SIZE) {\n    const microBatch = texts.slice(j, Math.min(j + EMBEDDING_MICRO_BATCH_SIZE, texts.length));\n    const microResults = await embeddings.embedBatch(microBatch);\n    results.push(...microResults);\n    await new Promise(resolve => setImmediate(resolve));\n  }\n  return results;\n}\n\n/**\n * Helper functions extracted from indexCodebase\n * These make the main function more readable and testable\n */\n\n/**\n * Update git state after indexing (if in a git repo).\n */\nasync function updateGitState(\n  rootDir: string,\n  vectorDB: VectorDB,\n  manifest: ManifestManager\n): Promise<void> {\n  const { isGitAvailable, isGitRepo } = await import('../git/utils.js');\n  const { GitStateTracker } = await import('../git/tracker.js');\n  \n  const gitAvailable = await isGitAvailable();\n  const isRepo = await isGitRepo(rootDir);\n  \n  if (!gitAvailable || !isRepo) {\n    return;\n  }\n  \n  const gitTracker = new GitStateTracker(rootDir, vectorDB.dbPath);\n  await gitTracker.initialize();\n  const gitState = gitTracker.getState();\n  \n  if (gitState) {\n    await manifest.updateGitState(gitState);\n  }\n}\n\n/**\n * Handle file deletions during incremental indexing.\n */\nasync function handleDeletions(\n  deletedFiles: string[],\n  vectorDB: VectorDB,\n  manifest: ManifestManager,\n  spinner: Ora\n): Promise<void> {\n  if (deletedFiles.length === 0) {\n    return;\n  }\n  \n  spinner.start(`Removing ${deletedFiles.length} deleted files...`);\n  let removedCount = 0;\n  \n  for (const filepath of deletedFiles) {\n    try {\n      await vectorDB.deleteByFile(filepath);\n      await manifest.removeFile(filepath);\n      removedCount++;\n    } catch (err) {\n      spinner.warn(\n        `Failed to remove file \"${filepath}\": ${err instanceof Error ? err.message : String(err)}`\n      );\n    }\n  }\n  \n  spinner.succeed(`Removed ${removedCount}/${deletedFiles.length} deleted files`);\n}\n\n/**\n * Handle file updates (additions and modifications) during incremental indexing.\n */\nasync function handleUpdates(\n  addedFiles: string[],\n  modifiedFiles: string[],\n  vectorDB: VectorDB,\n  embeddings: EmbeddingService,\n  config: LienConfig | LegacyLienConfig,\n  options: IndexingOptions,\n  spinner: Ora\n): Promise<void> {\n  const filesToIndex = [...addedFiles, ...modifiedFiles];\n  \n  if (filesToIndex.length === 0) {\n    return;\n  }\n  \n  spinner.start(`Reindexing ${filesToIndex.length} changed files...`);\n  const count = await indexMultipleFiles(\n    filesToIndex,\n    vectorDB,\n    embeddings,\n    config,\n    { verbose: options.verbose }\n  );\n  \n  await writeVersionFile(vectorDB.dbPath);\n  spinner.succeed(\n    `Incremental reindex complete: ${count}/${filesToIndex.length} files indexed successfully`\n  );\n}\n\n/**\n * Try incremental indexing if a manifest exists.\n * Returns true if incremental indexing completed, false if full index needed.\n */\nasync function tryIncrementalIndex(\n  rootDir: string,\n  vectorDB: VectorDB,\n  config: LienConfig | LegacyLienConfig,\n  options: IndexingOptions,\n  spinner: Ora\n): Promise<boolean> {\n  spinner.text = 'Checking for changes...';\n  const manifest = new ManifestManager(vectorDB.dbPath);\n  const savedManifest = await manifest.load();\n  \n  if (!savedManifest) {\n    return false; // No manifest, need full index\n  }\n  \n  const changes = await detectChanges(rootDir, vectorDB, config);\n  \n  if (changes.reason === 'full') {\n    spinner.text = 'Full reindex required...';\n    return false;\n  }\n  \n  const totalChanges = changes.added.length + changes.modified.length;\n  const totalDeleted = changes.deleted.length;\n  \n  if (totalChanges === 0 && totalDeleted === 0) {\n    spinner.succeed('No changes detected - index is up to date!');\n    return true;\n  }\n  \n  spinner.succeed(\n    `Detected changes: ${totalChanges} files to index, ${totalDeleted} to remove (${changes.reason} detection)`\n  );\n  \n  // Initialize embeddings for incremental update\n  spinner.start(getModelLoadingMessage());\n  const embeddings = new LocalEmbeddings();\n  await embeddings.initialize();\n  spinner.succeed('Embedding model loaded');\n  \n  // Process changes\n  await handleDeletions(changes.deleted, vectorDB, manifest, spinner);\n  await handleUpdates(changes.added, changes.modified, vectorDB, embeddings, config, options, spinner);\n  \n  // Update git state\n  await updateGitState(rootDir, vectorDB, manifest);\n  \n  console.log(chalk.dim('\\nNext step: Run'), chalk.bold('lien serve'), chalk.dim('to start the MCP server'));\n  return true;\n}\n\n/**\n * Perform a full index of the codebase.\n */\nasync function performFullIndex(\n  rootDir: string,\n  vectorDB: VectorDB,\n  config: LienConfig | LegacyLienConfig,\n  options: IndexingOptions,\n  spinner: Ora\n): Promise<void> {\n  // 0. Clear existing index (required for schema changes)\n  spinner.text = 'Clearing existing index...';\n  await vectorDB.clear();\n  \n  // 1. Scan for files\n  spinner.text = 'Scanning codebase...';\n  const files = await scanFilesToIndex(rootDir, config);\n  \n  if (files.length === 0) {\n    spinner.fail('No files found to index');\n    return;\n  }\n  \n  spinner.text = `Found ${files.length} files`;\n  \n  // 2. Initialize embeddings model\n  spinner.text = getModelLoadingMessage();\n  const embeddings = new LocalEmbeddings();\n  await embeddings.initialize();\n  spinner.succeed('Embedding model loaded');\n  \n  // 3. Get config values and process files\n  const indexConfig = getIndexingConfig(config);\n  const vectorDBBatchSize = 100; // Smaller batch for UI responsiveness\n  \n  spinner.start(`Processing files with ${indexConfig.concurrency}x concurrency...`);\n  \n  const startTime = Date.now();\n  let processedChunks = 0;\n  \n  // Accumulator for chunks across multiple files\n  const chunkAccumulator: ChunkWithContent[] = [];\n  const limit = pLimit(indexConfig.concurrency);\n  \n  // Track successfully indexed files for manifest\n  const indexedFileEntries: Array<{ filepath: string; chunkCount: number; mtime: number }> = [];\n  \n  // Create progress tracker\n  const progressTracker = new IndexingProgressTracker(files.length, spinner);\n  progressTracker.start();\n  \n  try {\n    // Mutex to prevent concurrent access to shared state (chunkAccumulator, indexedFileEntries)\n    // This prevents race conditions when multiple concurrent tasks try to:\n    // 1. Push to shared arrays\n    // 2. Check accumulator length threshold\n    // 3. Trigger processing\n    let addChunksLock: Promise<void> | null = null;\n    let processingQueue: Promise<void> | null = null;\n    \n    // Function to process accumulated chunks\n    // Uses queue-based synchronization to prevent TOCTOU race conditions\n    const processAccumulatedChunks = async (): Promise<void> => {\n      // Chain onto existing processing promise to create a queue\n      // This prevents the race condition where multiple tasks check processingQueue\n      // simultaneously and both proceed to process\n      if (processingQueue) {\n        processingQueue = processingQueue.then(() => doProcessChunks());\n      } else {\n        processingQueue = doProcessChunks();\n      }\n      return processingQueue;\n    };\n    \n    // The actual processing logic (separated for queue-based synchronization)\n    const doProcessChunks = async (): Promise<void> => {\n      if (chunkAccumulator.length === 0) return;\n      \n      const currentPromise = processingQueue;\n      \n      try {\n        const toProcess = chunkAccumulator.splice(0, chunkAccumulator.length);\n        \n        // Process in batches for UI responsiveness\n        for (let i = 0; i < toProcess.length; i += indexConfig.embeddingBatchSize) {\n          const batch = toProcess.slice(i, Math.min(i + indexConfig.embeddingBatchSize, toProcess.length));\n          const texts = batch.map(item => item.content);\n          \n          progressTracker.setMessage(getEmbeddingMessage());\n          const embeddingVectors = await processEmbeddingMicroBatches(texts, embeddings);\n          processedChunks += batch.length;\n          \n          progressTracker.setMessage(`Inserting ${batch.length} chunks into vector space...`);\n          await vectorDB.insertBatch(embeddingVectors, batch.map(item => item.chunk.metadata), texts);\n          await new Promise(resolve => setImmediate(resolve));\n        }\n        \n        progressTracker.setMessage(getIndexingMessage());\n      } finally {\n        if (processingQueue === currentPromise) processingQueue = null;\n      }\n    };\n  \n  // Process files with concurrency limit\n  const filePromises = files.map((file) =>\n    limit(async () => {\n      try {\n        // Get file stats to capture actual modification time\n        const stats = await fs.stat(file);\n        const content = await fs.readFile(file, 'utf-8');\n        \n        const chunks = chunkFile(file, content, {\n          chunkSize: indexConfig.chunkSize,\n          chunkOverlap: indexConfig.chunkOverlap,\n          useAST: indexConfig.useAST,\n          astFallback: indexConfig.astFallback,\n        });\n        \n        if (chunks.length === 0) {\n          progressTracker.incrementFiles();\n          return;\n        }\n        \n        // Critical section: add chunks to shared state and check threshold\n        // Must be protected with mutex to prevent race conditions\n        {\n          // Wait for any in-progress add operation\n          if (addChunksLock) {\n            await addChunksLock;\n          }\n          \n          // Acquire lock\n          let releaseAddLock!: () => void;\n          addChunksLock = new Promise<void>(resolve => {\n            releaseAddLock = resolve;\n          });\n          \n          try {\n            // Add chunks to accumulator\n            for (const chunk of chunks) {\n              chunkAccumulator.push({\n                chunk,\n                content: chunk.content,\n              });\n            }\n            \n            // Track this file for manifest with actual file mtime\n            indexedFileEntries.push({\n              filepath: file,\n              chunkCount: chunks.length,\n              mtime: stats.mtimeMs,\n            });\n            \n            progressTracker.incrementFiles();\n            \n            // Process when batch is large enough (use smaller batch for responsiveness)\n            // Check is done inside the mutex to prevent multiple tasks from triggering processing\n            if (chunkAccumulator.length >= vectorDBBatchSize) {\n              await processAccumulatedChunks();\n            }\n          } finally {\n            // Release lock (always defined by Promise constructor)\n            releaseAddLock();\n            addChunksLock = null;\n          }\n        }\n      } catch (error) {\n        if (options.verbose) {\n          console.error(chalk.yellow(`\\n⚠️  Skipping ${file}: ${error}`));\n        }\n        progressTracker.incrementFiles();\n      }\n    })\n  );\n  \n    // Wait for all files to be processed\n    await Promise.all(filePromises);\n    \n    // Process remaining chunks\n    progressTracker.setMessage('Processing final chunks...');\n    await processAccumulatedChunks();\n  } finally {\n    // Always stop the progress tracker to clean up the interval\n    progressTracker.stop();\n  }\n  \n  // Save manifest with all indexed files\n  spinner.start('Saving index manifest...');\n  const manifest = new ManifestManager(vectorDB.dbPath);\n  await manifest.updateFiles(\n    indexedFileEntries.map(entry => ({\n      filepath: entry.filepath,\n      // Use actual file mtime for accurate change detection\n      lastModified: entry.mtime,\n      chunkCount: entry.chunkCount,\n    }))\n  );\n  \n  // Save git state if in a git repo\n  await updateGitState(rootDir, vectorDB, manifest);\n  \n  spinner.succeed('Manifest saved');\n  \n  // Write version file to mark successful completion\n  await writeVersionFile(vectorDB.dbPath);\n  \n  const totalTime = ((Date.now() - startTime) / 1000).toFixed(1);\n  spinner.succeed(\n    `Indexed ${progressTracker.getProcessedCount()} files (${processedChunks} chunks) in ${totalTime}s using ${indexConfig.concurrency}x concurrency`\n  );\n  \n  console.log(chalk.dim('\\nNext step: Run'), chalk.bold('lien serve'), chalk.dim('to start the MCP server'));\n}\n\n/**\n * Index a codebase, creating vector embeddings for semantic search.\n * \n * Refactored to be more maintainable:\n * - Tries incremental indexing first (if not forced)\n * - Falls back to full indexing if needed\n * - Delegates to helper functions for specific tasks\n * \n * @param options - Indexing options\n */\nexport async function indexCodebase(options: IndexingOptions = {}): Promise<void> {\n  const rootDir = options.rootDir ?? process.cwd();\n  const spinner = ora('Starting indexing process...').start();\n  \n  try {\n    // Load configuration\n    spinner.text = 'Loading configuration...';\n    const config = await configService.load(rootDir);\n    \n    // Initialize vector database\n    spinner.text = 'Initializing vector database...';\n    const vectorDB = new VectorDB(rootDir);\n    await vectorDB.initialize();\n    \n    // Try incremental indexing first (unless forced)\n    if (!options.force) {\n      const completed = await tryIncrementalIndex(rootDir, vectorDB, config, options, spinner);\n      if (completed) {\n        return; // Incremental index completed\n      }\n    } else {\n      spinner.text = 'Force flag enabled, performing full reindex...';\n    }\n    \n    // Fall back to full index\n    await performFullIndex(rootDir, vectorDB, config, options, spinner);\n    \n  } catch (error) {\n    spinner.fail(`Indexing failed: ${error}`);\n    throw error;\n  }\n}\n\n","import { Command } from 'commander';\nimport { createRequire } from 'module';\nimport { fileURLToPath } from 'url';\nimport { dirname, join } from 'path';\nimport { initCommand } from './init.js';\nimport { statusCommand } from './status.js';\nimport { indexCommand } from './index-cmd.js';\nimport { serveCommand } from './serve.js';\nimport { complexityCommand } from './complexity.js';\n\n// Get version from package.json dynamically\nconst __filename = fileURLToPath(import.meta.url);\nconst __dirname = dirname(__filename);\nconst require = createRequire(import.meta.url);\n\nlet packageJson;\ntry {\n  packageJson = require(join(__dirname, '../package.json'));\n} catch {\n  packageJson = require(join(__dirname, '../../package.json'));\n}\n\nexport const program = new Command();\n\nprogram\n  .name('lien')\n  .description('Local semantic code search for AI assistants via MCP')\n  .version(packageJson.version);\n\nprogram\n  .command('init')\n  .description('Initialize Lien in the current directory')\n  .option('-u, --upgrade', 'Upgrade existing config with new options')\n  .option('-y, --yes', 'Skip interactive prompts and use defaults')\n  .option('-p, --path <path>', 'Path to initialize (defaults to current directory)')\n  .action(initCommand);\n\nprogram\n  .command('index')\n  .description('Index the codebase for semantic search')\n  .option('-f, --force', 'Force full reindex (skip incremental)')\n  .option('-w, --watch', 'Watch for changes and re-index automatically')\n  .option('-v, --verbose', 'Show detailed logging during indexing')\n  .action(indexCommand);\n\nprogram\n  .command('serve')\n  .description('Start the MCP server for Cursor integration')\n  .option('-p, --port <port>', 'Port number (for future use)', '7133')\n  .option('--no-watch', 'Disable file watching for this session')\n  .option('-w, --watch', '[DEPRECATED] File watching is now enabled by default')\n  .option('-r, --root <path>', 'Root directory to serve (defaults to current directory)')\n  .action(serveCommand);\n\nprogram\n  .command('status')\n  .description('Show indexing status and statistics')\n  .action(statusCommand);\n\nprogram\n  .command('complexity')\n  .description('Analyze code complexity')\n  .option('--files <paths...>', 'Specific files to analyze')\n  .option('--format <type>', 'Output format: text, json, sarif', 'text')\n  .option('--threshold <n>', 'Override both complexity thresholds (cyclomatic & cognitive)')\n  .option('--cyclomatic-threshold <n>', 'Override cyclomatic complexity threshold only')\n  .option('--cognitive-threshold <n>', 'Override cognitive complexity threshold only')\n  .option('--fail-on <severity>', 'Exit 1 if violations: error, warning')\n  .action(complexityCommand);\n\n","import fs from 'fs/promises';\nimport path from 'path';\nimport { fileURLToPath } from 'url';\nimport chalk from 'chalk';\nimport inquirer from 'inquirer';\nimport { defaultConfig, LienConfig, FrameworkInstance, FrameworkConfig } from '../config/schema.js';\nimport { showCompactBanner } from '../utils/banner.js';\nimport { MigrationManager } from '../config/migration-manager.js';\nimport { detectAllFrameworks } from '../frameworks/detector-service.js';\nimport { getFrameworkDetector } from '../frameworks/registry.js';\n\n// ES module equivalent of __dirname\nconst __filename = fileURLToPath(import.meta.url);\nconst __dirname = path.dirname(__filename);\n\nexport interface InitOptions {\n  upgrade?: boolean;\n  yes?: boolean;\n  path?: string;\n}\n\nexport async function initCommand(options: InitOptions = {}) {\n  const rootDir = options.path || process.cwd();\n  const configPath = path.join(rootDir, '.lien.config.json');\n  \n  try {\n    // Check if config already exists\n    let configExists = false;\n    try {\n      await fs.access(configPath);\n      configExists = true;\n    } catch {\n      // File doesn't exist\n    }\n    \n    // Handle upgrade scenario\n    if (configExists && options.upgrade) {\n      const migrationManager = new MigrationManager(rootDir);\n      await migrationManager.upgradeInteractive();\n      return;\n    }\n    \n    // Warn if config exists and not upgrading\n    if (configExists && !options.upgrade) {\n      console.log(chalk.yellow('⚠️  .lien.config.json already exists'));\n      console.log(chalk.dim('Run'), chalk.bold('lien init --upgrade'), chalk.dim('to merge new config options'));\n      return;\n    }\n    \n    // Create new config with framework detection\n    if (!configExists) {\n      await createNewConfig(rootDir, options);\n    }\n  } catch (error) {\n    console.error(chalk.red('Error creating config file:'), error);\n    process.exit(1);\n  }\n}\n\nasync function createNewConfig(rootDir: string, options: InitOptions) {\n  // Show banner for new initialization\n  showCompactBanner();\n  console.log(chalk.bold('Initializing Lien...\\n'));\n  \n  // 1. Run framework detection\n  console.log(chalk.dim('🔍 Detecting frameworks in'), chalk.bold(rootDir));\n  const detections = await detectAllFrameworks(rootDir);\n  \n  let frameworks: FrameworkInstance[] = [];\n  \n  if (detections.length === 0) {\n    console.log(chalk.yellow('\\n⚠️  No frameworks detected'));\n    \n    if (!options.yes) {\n      const { useGeneric } = await inquirer.prompt([\n        {\n          type: 'confirm',\n          name: 'useGeneric',\n          message: 'Create a generic config (index all supported file types)?',\n          default: true,\n        },\n      ]);\n      \n      if (!useGeneric) {\n        console.log(chalk.dim('Aborted.'));\n        return;\n      }\n    }\n    \n    // Create generic framework\n    frameworks.push({\n      name: 'generic',\n      path: '.',\n      enabled: true,\n      config: {\n        include: ['**/*.{ts,tsx,js,jsx,py,php,go,rs,java,c,cpp,cs}'],\n        exclude: [\n          '**/node_modules/**',\n          '**/dist/**',\n          '**/build/**',\n          '**/.git/**',\n          '**/coverage/**',\n          '**/.next/**',\n          '**/.nuxt/**',\n          '**/vendor/**',\n        ],\n      },\n    });\n  } else {\n    // 2. Display detected frameworks\n    console.log(chalk.green(`\\n✓ Found ${detections.length} framework(s):\\n`));\n    \n    for (const det of detections) {\n      const pathDisplay = det.path === '.' ? 'root' : det.path;\n      console.log(chalk.bold(`  ${det.name}`), chalk.dim(`(${det.confidence} confidence)`));\n      console.log(chalk.dim(`    Location: ${pathDisplay}`));\n      \n      if (det.evidence.length > 0) {\n        det.evidence.forEach((e) => {\n          console.log(chalk.dim(`    • ${e}`));\n        });\n      }\n      console.log();\n    }\n    \n    // 3. Interactive confirmation\n    if (!options.yes) {\n      const { confirm } = await inquirer.prompt([\n        {\n          type: 'confirm',\n          name: 'confirm',\n          message: 'Configure these frameworks?',\n          default: true,\n        },\n      ]);\n      \n      if (!confirm) {\n        console.log(chalk.dim('Aborted.'));\n        return;\n      }\n    }\n    \n    // 4. Generate configs for each detected framework\n    for (const det of detections) {\n      const detector = getFrameworkDetector(det.name);\n      if (!detector) {\n        console.warn(chalk.yellow(`⚠️  No detector found for ${det.name}, skipping`));\n        continue;\n      }\n      \n      // Generate default config\n      const frameworkConfig = await detector.generateConfig(rootDir, det.path);\n      \n      // Optional: Ask to customize (only in interactive mode)\n      let shouldCustomize = false;\n      if (!options.yes) {\n        const { customize } = await inquirer.prompt([\n          {\n            type: 'confirm',\n            name: 'customize',\n            message: `Customize ${det.name} settings?`,\n            default: false,\n          },\n        ]);\n        shouldCustomize = customize;\n      }\n      \n      let finalConfig = frameworkConfig;\n      if (shouldCustomize) {\n        const customized = await promptForCustomization(det.name, frameworkConfig);\n        finalConfig = { ...frameworkConfig, ...customized };\n      } else {\n        const pathDisplay = det.path === '.' ? 'root' : det.path;\n        console.log(chalk.dim(`  → Using defaults for ${det.name} at ${pathDisplay}`));\n      }\n      \n      frameworks.push({\n        name: det.name,\n        path: det.path,\n        enabled: true,\n        config: finalConfig,\n      });\n    }\n  }\n  \n  // 5. Ask about Cursor rules installation\n  if (!options.yes) {\n    const { installCursorRules } = await inquirer.prompt([\n      {\n        type: 'confirm',\n        name: 'installCursorRules',\n        message: 'Install recommended Cursor rules?',\n        default: true,\n      },\n    ]);\n    \n    if (installCursorRules) {\n      try {\n        const cursorRulesDir = path.join(rootDir, '.cursor');\n        await fs.mkdir(cursorRulesDir, { recursive: true });\n        \n        // Find template - it's in the package root (same dir as package.json)\n        // When compiled: everything bundles to dist/index.js, so __dirname is dist/\n        // Go up one level from dist/ to reach package root\n        const templatePath = path.join(__dirname, '../CURSOR_RULES_TEMPLATE.md');\n        \n        const rulesPath = path.join(cursorRulesDir, 'rules');\n        let targetPath: string;\n        let isDirectory = false;\n        let isFile = false;\n\n        try {\n          const stats = await fs.stat(rulesPath);\n          isDirectory = stats.isDirectory();\n          isFile = stats.isFile();\n        } catch {\n          // Doesn't exist, that's fine\n        }\n\n        if (isDirectory) {\n          // .cursor/rules is already a directory, create lien.mdc inside it\n          targetPath = path.join(rulesPath, 'lien.mdc');\n          await fs.copyFile(templatePath, targetPath);\n          console.log(chalk.green('✓ Installed Cursor rules as .cursor/rules/lien.mdc'));\n        } else if (isFile) {\n          // .cursor/rules exists as a file - ask to convert to directory structure\n          const { convertToDir } = await inquirer.prompt([\n            {\n              type: 'confirm',\n              name: 'convertToDir',\n              message: 'Existing .cursor/rules file found. Convert to directory and preserve your rules?',\n              default: true,\n            },\n          ]);\n\n          if (convertToDir) {\n            // Convert file to directory structure\n            // 1. Read existing rules\n            const existingRules = await fs.readFile(rulesPath, 'utf-8');\n            // 2. Delete the file\n            await fs.unlink(rulesPath);\n            // 3. Create rules as a directory\n            await fs.mkdir(rulesPath);\n            // 4. Save original rules as project.mdc\n            await fs.writeFile(path.join(rulesPath, 'project.mdc'), existingRules);\n            // 5. Add Lien rules as lien.mdc\n            await fs.copyFile(templatePath, path.join(rulesPath, 'lien.mdc'));\n            console.log(chalk.green('✓ Converted .cursor/rules to directory'));\n            console.log(chalk.green('  - Your project rules: .cursor/rules/project.mdc'));\n            console.log(chalk.green('  - Lien rules: .cursor/rules/lien.mdc'));\n          } else {\n            console.log(chalk.dim('Skipped Cursor rules installation (preserving existing file)'));\n          }\n        } else {\n          // .cursor/rules doesn't exist, create it as a directory\n          await fs.mkdir(rulesPath, { recursive: true });\n          targetPath = path.join(rulesPath, 'lien.mdc');\n          await fs.copyFile(templatePath, targetPath);\n          console.log(chalk.green('✓ Installed Cursor rules as .cursor/rules/lien.mdc'));\n        }\n      } catch (error) {\n        console.log(chalk.yellow('⚠️  Could not install Cursor rules'));\n        console.log(chalk.dim(`Error: ${error instanceof Error ? error.message : 'Unknown error'}`));\n        console.log(chalk.dim('You can manually copy CURSOR_RULES_TEMPLATE.md to .cursor/rules/lien.mdc'));\n      }\n    }\n  }\n  \n  // 6. Build final config\n  const config: LienConfig = {\n    ...defaultConfig,\n    frameworks,\n  };\n  \n  // 7. Write config\n  const configPath = path.join(rootDir, '.lien.config.json');\n  await fs.writeFile(configPath, JSON.stringify(config, null, 2) + '\\n', 'utf-8');\n  \n  // 8. Show success message\n  console.log(chalk.green('\\n✓ Created .lien.config.json'));\n  console.log(chalk.green(`✓ Configured ${frameworks.length} framework(s)`));\n  console.log(chalk.dim('\\nNext steps:'));\n  console.log(chalk.dim('  1. Run'), chalk.bold('lien index'), chalk.dim('to index your codebase'));\n  console.log(chalk.dim('  2. Run'), chalk.bold('lien serve'), chalk.dim('to start the MCP server'));\n  console.log(chalk.dim('  3. Configure Cursor to use the MCP server (see README.md)'));\n}\n\nasync function promptForCustomization(frameworkName: string, config: FrameworkConfig): Promise<Partial<FrameworkConfig>> {\n  console.log(chalk.bold(`\\nCustomizing ${frameworkName} settings:`));\n  \n  const answers = await inquirer.prompt([\n    {\n      type: 'input',\n      name: 'include',\n      message: 'File patterns to include (comma-separated):',\n      default: config.include.join(', '),\n      filter: (input: string) => input.split(',').map(s => s.trim()),\n    },\n    {\n      type: 'input',\n      name: 'exclude',\n      message: 'File patterns to exclude (comma-separated):',\n      default: config.exclude.join(', '),\n      filter: (input: string) => input.split(',').map(s => s.trim()),\n    },\n  ]);\n  \n  return {\n    include: answers.include,\n    exclude: answers.exclude,\n  };\n}\n\n// Removed: upgradeConfig function is now handled by MigrationManager.upgradeInteractive()\n","import figlet from 'figlet';\nimport chalk from 'chalk';\nimport { createRequire } from 'module';\nimport { fileURLToPath } from 'url';\nimport { dirname, join } from 'path';\n\n// Get package.json dynamically\n// In development: src/utils/banner.ts -> ../../package.json\n// In production (bundled): dist/index.js -> ../package.json\nconst __filename = fileURLToPath(import.meta.url);\nconst __dirname = dirname(__filename);\nconst require = createRequire(import.meta.url);\n\n// Try production path first (dist -> package.json), then dev path\nlet packageJson;\ntry {\n  packageJson = require(join(__dirname, '../package.json'));\n} catch {\n  packageJson = require(join(__dirname, '../../package.json'));\n}\n\n// Package info\nconst PACKAGE_NAME = packageJson.name;\nconst VERSION = packageJson.version;\n\n/**\n * Wrap text in a box with a footer line\n */\nfunction wrapInBox(text: string, footer: string, padding = 1): string {\n  const lines = text.split('\\n').filter(line => line.trim().length > 0);\n  \n  // Use only the main content (logo) to determine box width\n  const maxLength = Math.max(...lines.map(line => line.length));\n  \n  const horizontalBorder = '─'.repeat(maxLength + padding * 2);\n  const top = `┌${horizontalBorder}┐`;\n  const bottom = `└${horizontalBorder}┘`;\n  const separator = `├${horizontalBorder}┤`;\n  \n  const paddedLines = lines.map(line => {\n    const padRight = ' '.repeat(maxLength - line.length + padding);\n    const padLeft = ' '.repeat(padding);\n    return `│${padLeft}${line}${padRight}│`;\n  });\n  \n  // Center the footer line\n  const totalPad = maxLength - footer.length;\n  const leftPad = Math.floor(totalPad / 2);\n  const rightPad = totalPad - leftPad;\n  const centeredFooter = ' '.repeat(leftPad) + footer + ' '.repeat(rightPad);\n  \n  const paddedFooter = `│${' '.repeat(padding)}${centeredFooter}${' '.repeat(padding)}│`;\n  \n  return [top, ...paddedLines, separator, paddedFooter, bottom].join('\\n');\n}\n\n/**\n * Display the gorgeous ANSI Shadow banner (uses stderr for MCP server)\n */\nexport function showBanner(): void {\n  const banner = figlet.textSync('LIEN', {\n    font: 'ANSI Shadow',\n    horizontalLayout: 'fitted',\n    verticalLayout: 'fitted',\n  });\n\n  const footer = `${PACKAGE_NAME} - v${VERSION}`;\n  const boxedBanner = wrapInBox(banner.trim(), footer);\n  console.error(chalk.cyan(boxedBanner));\n  console.error(); // Empty line\n}\n\n/**\n * Display the gorgeous ANSI Shadow banner (uses stdout for CLI commands)\n */\nexport function showCompactBanner(): void {\n  const banner = figlet.textSync('LIEN', {\n    font: 'ANSI Shadow',\n    horizontalLayout: 'fitted',\n    verticalLayout: 'fitted',\n  });\n\n  const footer = `${PACKAGE_NAME} - v${VERSION}`;\n  const boxedBanner = wrapInBox(banner.trim(), footer);\n  console.log(chalk.cyan(boxedBanner));\n  console.log(); // Empty line\n}\n\n","import fs from 'fs/promises';\nimport path from 'path';\nimport chalk from 'chalk';\nimport { LienConfig, defaultConfig } from './schema.js';\nimport { needsMigration, migrateConfig, migrateConfigFile } from './migration.js';\nimport { deepMergeConfig, detectNewFields } from './merge.js';\nimport { CURRENT_CONFIG_VERSION } from '../constants.js';\n\n/**\n * Result of a migration operation\n */\nexport interface MigrationResult {\n  migrated: boolean;\n  backupPath?: string;\n  config: LienConfig;\n}\n\n/**\n * Centralized migration orchestration service\n * \n * Handles all config migration scenarios:\n * - Auto-migration during config loading\n * - Interactive upgrade via CLI\n * - Migration status checking\n */\nexport class MigrationManager {\n  constructor(private readonly rootDir: string = process.cwd()) {}\n  \n  /**\n   * Get the config file path\n   */\n  private getConfigPath(): string {\n    return path.join(this.rootDir, '.lien.config.json');\n  }\n  \n  /**\n   * Check if the current config needs migration\n   */\n  async needsMigration(): Promise<boolean> {\n    try {\n      const configPath = this.getConfigPath();\n      const content = await fs.readFile(configPath, 'utf-8');\n      const config = JSON.parse(content);\n      return needsMigration(config);\n    } catch (error) {\n      // If config doesn't exist or can't be read, no migration needed\n      return false;\n    }\n  }\n  \n  /**\n   * Perform silent migration (for auto-migration during load)\n   * Returns the migrated config without user interaction\n   */\n  async autoMigrate(): Promise<LienConfig> {\n    const result = await migrateConfigFile(this.rootDir);\n    \n    if (result.migrated && result.backupPath) {\n      const backupFilename = path.basename(result.backupPath);\n      console.log(`✅ Migration complete! Backup saved as ${backupFilename}`);\n      console.log('📝 Your config now uses the framework-based structure.');\n    }\n    \n    return result.config;\n  }\n  \n  /**\n   * Perform interactive upgrade (for CLI upgrade command)\n   * Provides detailed feedback and handles edge cases\n   */\n  async upgradeInteractive(): Promise<void> {\n    const configPath = this.getConfigPath();\n    \n    try {\n      // 1. Read existing config\n      const existingContent = await fs.readFile(configPath, 'utf-8');\n      const existingConfig = JSON.parse(existingContent);\n      \n      // 2. Check if any changes are needed\n      const migrationNeeded = needsMigration(existingConfig);\n      const newFields = migrationNeeded ? [] : detectNewFields(existingConfig, defaultConfig);\n      const hasChanges = migrationNeeded || newFields.length > 0;\n      \n      if (!hasChanges) {\n        console.log(chalk.green('✓ Config is already up to date'));\n        console.log(chalk.dim('No changes needed'));\n        return;\n      }\n      \n      // 3. Backup existing config (only if changes are needed)\n      const backupPath = `${configPath}.backup`;\n      await fs.copyFile(configPath, backupPath);\n      \n      // 4. Perform upgrade\n      let upgradedConfig: LienConfig;\n      let migrated = false;\n      \n      if (migrationNeeded) {\n        console.log(chalk.blue(`🔄 Migrating config from v0.2.0 to v${CURRENT_CONFIG_VERSION}...`));\n        upgradedConfig = migrateConfig(existingConfig);\n        migrated = true;\n      } else {\n        // Just merge with defaults for current version configs\n        upgradedConfig = deepMergeConfig(defaultConfig, existingConfig as Partial<LienConfig>);\n        \n        console.log(chalk.dim('\\nNew options added:'));\n        newFields.forEach(field => console.log(chalk.dim('  •'), chalk.bold(field)));\n      }\n      \n      // 5. Write upgraded config\n      await fs.writeFile(\n        configPath,\n        JSON.stringify(upgradedConfig, null, 2) + '\\n',\n        'utf-8'\n      );\n      \n      // 6. Show results\n      console.log(chalk.green('✓ Config upgraded successfully'));\n      console.log(chalk.dim('Backup saved to:'), backupPath);\n      \n      if (migrated) {\n        console.log(chalk.dim('\\n📝 Your config now uses the framework-based structure.'));\n      }\n    } catch (error) {\n      if ((error as NodeJS.ErrnoException).code === 'ENOENT') {\n        console.log(chalk.red('Error: No config file found'));\n        console.log(chalk.dim('Run'), chalk.bold('lien init'), chalk.dim('to create a config file'));\n        return;\n      }\n      throw error;\n    }\n  }\n  \n  /**\n   * Perform migration and return result\n   * Used when programmatic access to migration result is needed\n   */\n  async migrate(): Promise<MigrationResult> {\n    return migrateConfigFile(this.rootDir);\n  }\n}\n\n","import fs from 'fs/promises';\nimport path from 'path';\nimport { DetectionResult, DetectionOptions, defaultDetectionOptions } from './types.js';\nimport { frameworkDetectors } from './registry.js';\n\n/**\n * Detect all frameworks in a monorepo by recursively scanning subdirectories\n * @param rootDir - Absolute path to project root\n * @param options - Detection options (max depth, skip dirs)\n * @returns Array of detected frameworks with their paths\n */\nexport async function detectAllFrameworks(\n  rootDir: string,\n  options: Partial<DetectionOptions> = {}\n): Promise<DetectionResult[]> {\n  const opts = { ...defaultDetectionOptions, ...options };\n  const results: DetectionResult[] = [];\n  const visited = new Set<string>();\n  \n  // Detect at root first\n  await detectAtPath(rootDir, '.', results, visited);\n  \n  // Recursively scan subdirectories\n  await scanSubdirectories(rootDir, '.', results, visited, 0, opts);\n  \n  return results;\n}\n\n/**\n * Detect frameworks at a specific path\n */\nasync function detectAtPath(\n  rootDir: string,\n  relativePath: string,\n  results: DetectionResult[],\n  visited: Set<string>\n): Promise<void> {\n  // Mark as visited\n  const fullPath = path.join(rootDir, relativePath);\n  if (visited.has(fullPath)) {\n    return;\n  }\n  visited.add(fullPath);\n  \n  // Run all detectors and collect results\n  const detectedAtPath: Array<DetectionResult & { priority: number }> = [];\n  \n  for (const detector of frameworkDetectors) {\n    try {\n      const result = await detector.detect(rootDir, relativePath);\n      if (result.detected) {\n        detectedAtPath.push({\n          ...result,\n          priority: detector.priority ?? 0,\n        });\n      }\n    } catch (error) {\n      // Log error but continue with other detectors\n      console.error(`Error running detector '${detector.name}' at ${relativePath}:`, error);\n    }\n  }\n  \n  // Conflict resolution: Allow multiple HIGH-confidence frameworks to coexist\n  // This enables hybrid projects (e.g., Shopify + Node.js, Laravel + Node.js)\n  if (detectedAtPath.length > 1) {\n    // Separate frameworks by confidence level\n    const highConfidence = detectedAtPath.filter(d => d.confidence === 'high');\n    const mediumConfidence = detectedAtPath.filter(d => d.confidence === 'medium');\n    const lowConfidence = detectedAtPath.filter(d => d.confidence === 'low');\n    \n    if (highConfidence.length > 1) {\n      // Multiple HIGH-confidence frameworks -> keep all (hybrid/monorepo behavior)\n      // Strip internal priority property before adding to results\n      const cleanResults = highConfidence.map(({ priority, ...result }) => result);\n      results.push(...cleanResults);\n      const names = highConfidence.map(d => d.name).join(' + ');\n      console.log(`  → Detected hybrid project: ${names}`);\n      \n      // Log skipped medium/low confidence detections\n      if (mediumConfidence.length > 0 || lowConfidence.length > 0) {\n        const skippedNames = [...mediumConfidence, ...lowConfidence].map(d => d.name).join(', ');\n        console.log(`  → Skipping lower confidence detections: ${skippedNames}`);\n      }\n    } else if (highConfidence.length === 1) {\n      // Only one HIGH-confidence framework\n      const { priority, ...result } = highConfidence[0];\n      results.push(result);\n      \n      // Log skipped medium/low confidence detections\n      if (mediumConfidence.length > 0 || lowConfidence.length > 0) {\n        const skippedNames = [...mediumConfidence, ...lowConfidence].map(d => d.name).join(', ');\n        console.log(`  → Skipping lower confidence detections: ${skippedNames}`);\n      }\n    } else if (mediumConfidence.length > 0) {\n      // No HIGH confidence, but have MEDIUM -> use priority system\n      mediumConfidence.sort((a, b) => b.priority - a.priority);\n      const { priority, ...winner } = mediumConfidence[0];\n      results.push(winner);\n      \n      // Skipped = remaining medium + all low confidence\n      const skipped = [...mediumConfidence.slice(1), ...lowConfidence];\n      if (skipped.length > 0) {\n        const skippedNames = skipped.map(d => d.name).join(', ');\n        console.log(`  → Skipping ${skippedNames} at ${relativePath} (${winner.name} takes precedence)`);\n      }\n    } else if (lowConfidence.length > 0) {\n      // Only LOW confidence -> use priority system\n      lowConfidence.sort((a, b) => b.priority - a.priority);\n      const { priority, ...winner } = lowConfidence[0];\n    results.push(winner);\n    \n      // Skipped = remaining low confidence\n      const skipped = lowConfidence.slice(1);\n    if (skipped.length > 0) {\n      const skippedNames = skipped.map(d => d.name).join(', ');\n      console.log(`  → Skipping ${skippedNames} at ${relativePath} (${winner.name} takes precedence)`);\n      }\n    }\n  } else if (detectedAtPath.length === 1) {\n    const { priority, ...result } = detectedAtPath[0];\n    results.push(result);\n  }\n}\n\n/**\n * Recursively scan subdirectories for frameworks\n */\nasync function scanSubdirectories(\n  rootDir: string,\n  relativePath: string,\n  results: DetectionResult[],\n  visited: Set<string>,\n  depth: number,\n  options: DetectionOptions\n): Promise<void> {\n  // Check depth limit\n  if (depth >= options.maxDepth) {\n    return;\n  }\n  \n  const fullPath = path.join(rootDir, relativePath);\n  \n  try {\n    const entries = await fs.readdir(fullPath, { withFileTypes: true });\n    \n    // Process only directories\n    const dirs = entries.filter(e => e.isDirectory());\n    \n    for (const dir of dirs) {\n      // Skip directories in the skip list\n      if (options.skipDirs.includes(dir.name)) {\n        continue;\n      }\n      \n      // Skip hidden directories (except .git, .github which are already in skipDirs)\n      if (dir.name.startsWith('.')) {\n        continue;\n      }\n      \n      const subPath = relativePath === '.' \n        ? dir.name \n        : path.join(relativePath, dir.name);\n      \n      // Detect at this subdirectory\n      await detectAtPath(rootDir, subPath, results, visited);\n      \n      // Recurse deeper\n      await scanSubdirectories(rootDir, subPath, results, visited, depth + 1, options);\n    }\n  } catch (error) {\n    // Silently skip directories we can't read (permission errors, etc.)\n    return;\n  }\n}\n\n/**\n * Get a human-readable summary of detected frameworks\n */\nexport function getDetectionSummary(results: DetectionResult[]): string {\n  if (results.length === 0) {\n    return 'No frameworks detected';\n  }\n  \n  const lines: string[] = [];\n  \n  for (const result of results) {\n    const pathDisplay = result.path === '.' ? 'root' : result.path;\n    lines.push(`${result.name} at ${pathDisplay} (${result.confidence} confidence)`);\n    \n    if (result.evidence.length > 0) {\n      result.evidence.forEach(e => {\n        lines.push(`  - ${e}`);\n      });\n    }\n  }\n  \n  return lines.join('\\n');\n}\n\n","import { FrameworkConfig } from '../config/schema.js';\n\n/**\n * Result of framework detection\n */\nexport interface DetectionResult {\n  detected: boolean;\n  name: string;          // 'nodejs', 'laravel'\n  path: string;          // Relative path from root: '.', 'packages/cli', 'cognito-backend'\n  confidence: 'high' | 'medium' | 'low';\n  evidence: string[];    // Human-readable evidence (e.g., \"Found package.json with jest\")\n  version?: string;      // Framework/language version if detectable\n}\n\n/**\n * Interface for framework detectors\n */\nexport interface FrameworkDetector {\n  name: string;          // Unique framework identifier\n  \n  /**\n   * Priority for conflict resolution (higher = takes precedence)\n   * - 100: Specific frameworks (Laravel, Rails, Django)\n   * - 50: Generic frameworks (Node.js, Python)\n   * - 0: Fallback/generic\n   */\n  priority?: number;\n  \n  /**\n   * Detect if this framework exists at the given path\n   * @param rootDir - Absolute path to project root\n   * @param relativePath - Relative path from root to check (e.g., '.' or 'packages/cli')\n   * @returns Detection result with evidence\n   */\n  detect(rootDir: string, relativePath: string): Promise<DetectionResult>;\n  \n  /**\n   * Generate default configuration for this framework\n   * @param rootDir - Absolute path to project root\n   * @param relativePath - Relative path where framework was detected\n   * @returns Framework-specific configuration\n   */\n  generateConfig(rootDir: string, relativePath: string): Promise<FrameworkConfig>;\n}\n\n/**\n * Options for framework detection\n */\nexport interface DetectionOptions {\n  maxDepth: number;      // Maximum directory depth to scan\n  skipDirs: string[];    // Directories to skip (node_modules, vendor, etc.)\n}\n\n/**\n * Default detection options\n */\nexport const defaultDetectionOptions: DetectionOptions = {\n  maxDepth: 3,\n  skipDirs: [\n    'node_modules',\n    'vendor',\n    'dist',\n    'build',\n    '.next',\n    '.nuxt',\n    'coverage',\n    '.git',\n    '.idea',\n    '.vscode',\n    'tmp',\n    'temp',\n  ],\n};\n\n","import fs from 'fs/promises';\nimport path from 'path';\nimport { FrameworkDetector, DetectionResult } from '../types.js';\nimport { generateNodeJsConfig } from './config.js';\n\n/**\n * Node.js/TypeScript/JavaScript framework detector\n */\nexport const nodejsDetector: FrameworkDetector = {\n  name: 'nodejs',\n  priority: 50, // Generic, yields to specific frameworks like Laravel\n  \n  async detect(rootDir: string, relativePath: string): Promise<DetectionResult> {\n    const fullPath = path.join(rootDir, relativePath);\n    const result: DetectionResult = {\n      detected: false,\n      name: 'nodejs',\n      path: relativePath,\n      confidence: 'low',\n      evidence: [],\n    };\n    \n    // Check for package.json\n    const packageJsonPath = path.join(fullPath, 'package.json');\n    let packageJson: any = null;\n    \n    try {\n      const content = await fs.readFile(packageJsonPath, 'utf-8');\n      packageJson = JSON.parse(content);\n      result.evidence.push('Found package.json');\n    } catch {\n      // No package.json, not a Node.js project\n      return result;\n    }\n    \n    // At this point, we know it's a Node.js project\n    result.detected = true;\n    result.confidence = 'high';\n    \n    // Check for TypeScript\n    if (packageJson.devDependencies?.typescript || packageJson.dependencies?.typescript) {\n      result.evidence.push('TypeScript detected');\n    }\n    \n    // Check for testing frameworks\n    const testFrameworks = [\n      { name: 'jest', display: 'Jest' },\n      { name: 'vitest', display: 'Vitest' },\n      { name: 'mocha', display: 'Mocha' },\n      { name: 'ava', display: 'AVA' },\n      { name: '@playwright/test', display: 'Playwright' },\n    ];\n    \n    for (const framework of testFrameworks) {\n      if (\n        packageJson.devDependencies?.[framework.name] || \n        packageJson.dependencies?.[framework.name]\n      ) {\n        result.evidence.push(`${framework.display} test framework detected`);\n        break; // Only mention first test framework found\n      }\n    }\n    \n    // Check for common frameworks/libraries\n    const frameworks = [\n      { name: 'next', display: 'Next.js' },\n      { name: 'react', display: 'React' },\n      { name: 'vue', display: 'Vue' },\n      { name: 'express', display: 'Express' },\n      { name: '@nestjs/core', display: 'NestJS' },\n    ];\n    \n    for (const fw of frameworks) {\n      if (packageJson.dependencies?.[fw.name]) {\n        result.evidence.push(`${fw.display} detected`);\n        break; // Only mention first framework found\n      }\n    }\n    \n    // Try to detect version from package.json engines or node version\n    if (packageJson.engines?.node) {\n      result.version = packageJson.engines.node;\n    }\n    \n    return result;\n  },\n  \n  async generateConfig(rootDir: string, relativePath: string) {\n    return generateNodeJsConfig(rootDir, relativePath);\n  },\n};\n\n","import { FrameworkConfig } from '../../config/schema.js';\n\n/**\n * Generate Node.js framework configuration\n */\nexport async function generateNodeJsConfig(\n  _rootDir: string,\n  _relativePath: string\n): Promise<FrameworkConfig> {\n  return {\n    include: [\n      // Broader patterns to catch all common project structures\n      // (frontend/, src/, lib/, app/, components/, etc.)\n      '**/*.ts',\n      '**/*.tsx',\n      '**/*.js',\n      '**/*.jsx',\n      '**/*.vue',\n      '**/*.mjs',\n      '**/*.cjs',\n      '**/*.md',\n      '**/*.mdx',\n    ],\n    exclude: [\n      // Node.js dependencies (with ** prefix for nested projects)\n      '**/node_modules/**',\n      'node_modules/**',\n      \n      // PHP/Composer dependencies (for monorepos with PHP)\n      '**/vendor/**',\n      'vendor/**',\n      \n      // Build outputs\n      '**/dist/**',\n      'dist/**',\n      '**/build/**',\n      'build/**',\n      '**/public/build/**',\n      'public/build/**',\n      'out/**',\n      \n      // Framework build caches\n      '.next/**',\n      '.nuxt/**',\n      '.vite/**',\n      '.lien/**',\n      \n      // Test artifacts\n      'coverage/**',\n      'playwright-report/**',\n      'test-results/**',\n      \n      // Build/generated artifacts\n      '__generated__/**',\n      \n      // Common build/cache directories\n      '.cache/**',\n      '.turbo/**',\n      '.vercel/**',\n      '.netlify/**',\n      \n      // Minified/bundled files\n      '**/*.min.js',\n      '**/*.min.css',\n      '**/*.bundle.js',\n    ],\n  };\n}\n\n","import fs from 'fs/promises';\nimport path from 'path';\nimport { FrameworkDetector, DetectionResult } from '../types.js';\nimport { generatePhpConfig } from './config.js';\n\n/**\n * Generic PHP framework detector\n * Detects any PHP project with composer.json\n */\nexport const phpDetector: FrameworkDetector = {\n  name: 'php',\n  priority: 50, // Generic, yields to specific frameworks like Laravel\n  \n  async detect(rootDir: string, relativePath: string): Promise<DetectionResult> {\n    const fullPath = path.join(rootDir, relativePath);\n    const result: DetectionResult = {\n      detected: false,\n      name: 'php',\n      path: relativePath,\n      confidence: 'low',\n      evidence: [],\n    };\n    \n    // Check for composer.json\n    const composerJsonPath = path.join(fullPath, 'composer.json');\n    let composerJson: any = null;\n    \n    try {\n      const content = await fs.readFile(composerJsonPath, 'utf-8');\n      composerJson = JSON.parse(content);\n      result.evidence.push('Found composer.json');\n    } catch {\n      // No composer.json, not a PHP project\n      return result;\n    }\n    \n    // Check if this is a Laravel project (Laravel detector should handle it)\n    const hasLaravel = \n      composerJson.require?.['laravel/framework'] ||\n      composerJson['require-dev']?.['laravel/framework'];\n    \n    if (hasLaravel) {\n      // This is a Laravel project - let the Laravel detector handle it\n      // Return not detected to avoid redundant \"php\" + \"laravel\" detection\n      return result;\n    }\n    \n    // At this point, we know it's a generic PHP project (not Laravel)\n    result.detected = true;\n    result.confidence = 'high';\n    \n    // Check for common PHP directories\n    const phpDirs = ['src', 'lib', 'app', 'tests'];\n    let foundDirs = 0;\n    \n    for (const dir of phpDirs) {\n      try {\n        const dirPath = path.join(fullPath, dir);\n        const stats = await fs.stat(dirPath);\n        if (stats.isDirectory()) {\n          foundDirs++;\n        }\n      } catch {\n        // Directory doesn't exist\n      }\n    }\n    \n    if (foundDirs > 0) {\n      result.evidence.push(`Found PHP project structure (${foundDirs} directories)`);\n    }\n    \n    // Check for PHP version\n    if (composerJson.require?.php) {\n      result.version = composerJson.require.php;\n      result.evidence.push(`PHP ${composerJson.require.php}`);\n    }\n    \n    // Check for testing frameworks\n    const testFrameworks = [\n      { name: 'phpunit/phpunit', display: 'PHPUnit' },\n      { name: 'pestphp/pest', display: 'Pest' },\n      { name: 'codeception/codeception', display: 'Codeception' },\n      { name: 'behat/behat', display: 'Behat' },\n    ];\n    \n    for (const framework of testFrameworks) {\n      if (\n        composerJson.require?.[framework.name] || \n        composerJson['require-dev']?.[framework.name]\n      ) {\n        result.evidence.push(`${framework.display} test framework detected`);\n        break; // Only mention first test framework found\n      }\n    }\n    \n    // Check for common PHP tools/frameworks\n    const tools = [\n      { name: 'symfony/framework-bundle', display: 'Symfony' },\n      { name: 'symfony/http-kernel', display: 'Symfony' },\n      { name: 'symfony/symfony', display: 'Symfony (monolithic)' },\n      { name: 'doctrine/orm', display: 'Doctrine ORM' },\n      { name: 'guzzlehttp/guzzle', display: 'Guzzle HTTP' },\n      { name: 'monolog/monolog', display: 'Monolog' },\n    ];\n    \n    for (const tool of tools) {\n      if (composerJson.require?.[tool.name]) {\n        result.evidence.push(`${tool.display} detected`);\n        break; // Only mention first tool found\n      }\n    }\n    \n    return result;\n  },\n  \n  async generateConfig(rootDir: string, relativePath: string) {\n    return generatePhpConfig(rootDir, relativePath);\n  },\n};\n\n","import { FrameworkConfig } from '../../config/schema.js';\n\n/**\n * Generate generic PHP framework configuration\n */\nexport async function generatePhpConfig(\n  _rootDir: string,\n  _relativePath: string\n): Promise<FrameworkConfig> {\n  return {\n    include: [\n      // PHP source code\n      'src/**/*.php',\n      'lib/**/*.php',\n      'app/**/*.php',\n      'tests/**/*.php',\n      '*.php',\n      \n      // Common PHP project files\n      'config/**/*.php',\n      'public/**/*.php',\n      \n      // Documentation\n      '**/*.md',\n      '**/*.mdx',\n      'docs/**/*.md',\n      'README.md',\n      'CHANGELOG.md',\n    ],\n    exclude: [\n      // Composer dependencies (CRITICAL)\n      '**/vendor/**',\n      'vendor/**',\n      \n      // Node.js dependencies\n      '**/node_modules/**',\n      'node_modules/**',\n      \n      // Build outputs\n      '**/dist/**',\n      'dist/**',\n      '**/build/**',\n      'build/**',\n      '**/public/build/**',\n      'public/build/**',\n      \n      // Laravel/PHP system directories\n      'storage/**',\n      'cache/**',\n      'bootstrap/cache/**',\n      \n      // Test artifacts\n      'coverage/**',\n      'test-results/**',\n      '.phpunit.cache/**',\n      \n      // Build outputs\n      '__generated__/**',\n      \n      // Minified files\n      '**/*.min.js',\n      '**/*.min.css',\n    ],\n  };\n}\n\n","import fs from 'fs/promises';\nimport path from 'path';\nimport { FrameworkDetector, DetectionResult } from '../types.js';\nimport { generateLaravelConfig } from './config.js';\n\n/**\n * Laravel/PHP framework detector\n */\nexport const laravelDetector: FrameworkDetector = {\n  name: 'laravel',\n  priority: 100, // Laravel takes precedence over Node.js\n  \n  async detect(rootDir: string, relativePath: string): Promise<DetectionResult> {\n    const fullPath = path.join(rootDir, relativePath);\n    const result: DetectionResult = {\n      detected: false,\n      name: 'laravel',\n      path: relativePath,\n      confidence: 'low',\n      evidence: [],\n    };\n    \n    // Check for composer.json with Laravel\n    const composerJsonPath = path.join(fullPath, 'composer.json');\n    let composerJson: any = null;\n    \n    try {\n      const content = await fs.readFile(composerJsonPath, 'utf-8');\n      composerJson = JSON.parse(content);\n      result.evidence.push('Found composer.json');\n    } catch {\n      // No composer.json, not a Laravel project\n      return result;\n    }\n    \n    // Check if Laravel framework is in dependencies\n    const hasLaravel = \n      composerJson.require?.['laravel/framework'] ||\n      composerJson['require-dev']?.['laravel/framework'];\n    \n    if (!hasLaravel) {\n      // Has composer.json but not Laravel\n      return result;\n    }\n    \n    result.evidence.push('Laravel framework detected in composer.json');\n    \n    // Check for artisan file (strong indicator of Laravel)\n    const artisanPath = path.join(fullPath, 'artisan');\n    try {\n      await fs.access(artisanPath);\n      result.evidence.push('Found artisan file');\n      result.confidence = 'high';\n    } catch {\n      result.confidence = 'medium';\n    }\n    \n    // Check for typical Laravel directory structure\n    const laravelDirs = ['app', 'routes', 'config', 'database'];\n    let foundDirs = 0;\n    \n    for (const dir of laravelDirs) {\n      try {\n        const dirPath = path.join(fullPath, dir);\n        const stats = await fs.stat(dirPath);\n        if (stats.isDirectory()) {\n          foundDirs++;\n        }\n      } catch {\n        // Directory doesn't exist\n      }\n    }\n    \n    if (foundDirs >= 2) {\n      result.evidence.push(`Laravel directory structure detected (${foundDirs}/${laravelDirs.length} dirs)`);\n      result.confidence = 'high';\n    }\n    \n    // Check for test directories\n    const testDirsToCheck = [\n      path.join(fullPath, 'tests', 'Feature'),\n      path.join(fullPath, 'tests', 'Unit'),\n    ];\n    \n    for (const testDir of testDirsToCheck) {\n      try {\n        const stats = await fs.stat(testDir);\n        if (stats.isDirectory()) {\n          const dirName = path.basename(path.dirname(testDir)) + '/' + path.basename(testDir);\n          result.evidence.push(`Found ${dirName} test directory`);\n        }\n      } catch {\n        // Test directory doesn't exist\n      }\n    }\n    \n    // Extract Laravel version if available\n    if (composerJson.require?.['laravel/framework']) {\n      result.version = composerJson.require['laravel/framework'];\n    }\n    \n    result.detected = true;\n    return result;\n  },\n  \n  async generateConfig(rootDir: string, relativePath: string) {\n    return generateLaravelConfig(rootDir, relativePath);\n  },\n};\n\n","import { FrameworkConfig } from '../../config/schema.js';\n\n/**\n * Generate Laravel framework configuration\n */\nexport async function generateLaravelConfig(\n  _rootDir: string,\n  _relativePath: string\n): Promise<FrameworkConfig> {\n  return {\n    include: [\n      // PHP backend\n      'app/**/*.php',\n      'routes/**/*.php',\n      'config/**/*.php',\n      'database/**/*.php',\n      'resources/**/*.php',\n      'tests/**/*.php',\n      '*.php',\n      // Frontend assets (Vue/React/Inertia) - Scoped to resources/ to avoid build output\n      'resources/**/*.js',\n      'resources/**/*.ts',\n      'resources/**/*.jsx',\n      'resources/**/*.tsx',\n      'resources/**/*.vue',\n      // Blade templates\n      'resources/views/**/*.blade.php',\n      // Documentation\n      'docs/**/*.md',\n      'README.md',\n      'CHANGELOG.md',\n    ],\n    exclude: [\n      // Composer dependencies (CRITICAL: exclude before any include patterns)\n      '**/vendor/**',\n      'vendor/**',\n      \n      // Build outputs (Vite/Mix compiled assets)\n      '**/public/build/**',\n      'public/build/**',\n      'public/hot',\n      '**/dist/**',\n      'dist/**',\n      '**/build/**',\n      'build/**',\n      \n      // Laravel system directories\n      'storage/**',\n      'bootstrap/cache/**',\n      'public/**/*.js',  // Compiled JS in public\n      'public/**/*.css', // Compiled CSS in public\n      \n      // Node.js dependencies\n      '**/node_modules/**',\n      'node_modules/**',\n      \n      // Test artifacts\n      'playwright-report/**',\n      'test-results/**',\n      'coverage/**',\n      \n      // Build/generated artifacts\n      '__generated__/**',\n      \n      // Frontend build outputs\n      '.vite/**',\n      '.nuxt/**',\n      '.next/**',\n      \n      // Minified files\n      '**/*.min.js',\n      '**/*.min.css',\n    ],\n  };\n}\n\n","import fs from 'fs/promises';\nimport path from 'path';\nimport { FrameworkDetector, DetectionResult } from '../types.js';\nimport { generateShopifyConfig } from './config.js';\n\n/**\n * Shopify Liquid theme framework detector\n */\nexport const shopifyDetector: FrameworkDetector = {\n  name: 'shopify',\n  priority: 100, // High priority (same as Laravel)\n  \n  async detect(rootDir: string, relativePath: string): Promise<DetectionResult> {\n    const fullPath = path.join(rootDir, relativePath);\n    const result: DetectionResult = {\n      detected: false,\n      name: 'shopify',\n      path: relativePath,\n      confidence: 'low',\n      evidence: [],\n    };\n    \n    // 1. Check for config/settings_schema.json (STRONGEST signal)\n    const settingsSchemaPath = path.join(fullPath, 'config', 'settings_schema.json');\n    let hasSettingsSchema = false;\n    \n    try {\n      await fs.access(settingsSchemaPath);\n      hasSettingsSchema = true;\n      result.evidence.push('Found config/settings_schema.json');\n    } catch {\n      // Not present, continue checking other markers\n    }\n    \n    // 2. Check for layout/theme.liquid\n    const themeLayoutPath = path.join(fullPath, 'layout', 'theme.liquid');\n    let hasThemeLayout = false;\n    \n    try {\n      await fs.access(themeLayoutPath);\n      hasThemeLayout = true;\n      result.evidence.push('Found layout/theme.liquid');\n    } catch {\n      // Not present\n    }\n    \n    // 3. Check for typical Shopify directories\n    const shopifyDirs = ['sections', 'snippets', 'templates', 'locales'];\n    let foundDirs = 0;\n    \n    for (const dir of shopifyDirs) {\n      try {\n        const dirPath = path.join(fullPath, dir);\n        const stats = await fs.stat(dirPath);\n        if (stats.isDirectory()) {\n          foundDirs++;\n        }\n      } catch {\n        // Directory doesn't exist\n      }\n    }\n    \n    if (foundDirs >= 2) {\n      result.evidence.push(`Shopify directory structure detected (${foundDirs}/${shopifyDirs.length} dirs)`);\n    }\n    \n    // 4. Check for shopify.theme.toml (Shopify CLI)\n    try {\n      const tomlPath = path.join(fullPath, 'shopify.theme.toml');\n      await fs.access(tomlPath);\n      result.evidence.push('Found shopify.theme.toml');\n    } catch {\n      // Optional file\n    }\n    \n    // 5. Check for .shopifyignore\n    try {\n      const ignorePath = path.join(fullPath, '.shopifyignore');\n      await fs.access(ignorePath);\n      result.evidence.push('Found .shopifyignore');\n    } catch {\n      // Optional file\n    }\n    \n    // Determine detection confidence with early returns\n    // High: Has settings_schema.json + 2+ directories\n    if (hasSettingsSchema && foundDirs >= 2) {\n      result.detected = true;\n      result.confidence = 'high';\n      return result;\n    }\n    \n    // Medium: Has settings_schema alone, OR has theme.liquid + 1+ directory\n    if (hasSettingsSchema || (hasThemeLayout && foundDirs >= 1)) {\n      result.detected = true;\n      result.confidence = 'medium';\n      return result;\n    }\n    \n    // Medium: Has 3+ typical directories but no strong markers\n    if (foundDirs >= 3) {\n      result.detected = true;\n      result.confidence = 'medium';\n      return result;\n    }\n    \n    // Not detected\n    return result;\n  },\n  \n  async generateConfig(rootDir: string, relativePath: string) {\n    return generateShopifyConfig(rootDir, relativePath);\n  },\n};\n\n","import { FrameworkConfig } from '../../config/schema.js';\n\n/**\n * Generate Shopify theme framework configuration\n */\nexport async function generateShopifyConfig(\n  _rootDir: string,\n  _relativePath: string\n): Promise<FrameworkConfig> {\n  return {\n    include: [\n      // Core Liquid templates\n      'layout/**/*.liquid',\n      'sections/**/*.liquid',\n      'snippets/**/*.liquid',\n      'templates/**/*.liquid', // Matches any nesting level (e.g., templates/customers/account.liquid)\n      'templates/**/*.json',   // JSON template definitions (Shopify 2.0+)\n      \n      // Theme editor blocks (Online Store 2.0)\n      'blocks/**/*.liquid',\n      \n      // Assets (CSS, JS with optional Liquid templating)\n      'assets/**/*.js',\n      'assets/**/*.js.liquid',\n      'assets/**/*.css',\n      'assets/**/*.css.liquid',\n      'assets/**/*.scss',\n      'assets/**/*.scss.liquid',\n      \n      // Configuration files\n      'config/*.json',\n      \n      // Locales (i18n)\n      'locales/*.json',\n      \n      // Documentation\n      '*.md',\n      'docs/**/*.md',\n      \n      // Shopify-specific config files\n      'shopify.theme.toml',\n      '.shopifyignore',\n    ],\n    exclude: [\n      'node_modules/**',\n      'dist/**',\n      'build/**',\n      '.git/**',\n      \n      // Playwright/testing artifacts\n      'playwright-report/**',\n      'test-results/**',\n      \n      // Build/generated artifacts\n      '__generated__/**',\n      \n      // Common frontend build outputs\n      '.vite/**',\n      '.nuxt/**',\n      '.next/**',\n    ],\n  };\n}\n\n","import { FrameworkDetector } from './types.js';\nimport { nodejsDetector } from './nodejs/detector.js';\nimport { phpDetector } from './php/detector.js';\nimport { laravelDetector } from './laravel/detector.js';\nimport { shopifyDetector } from './shopify/detector.js';\n\n/**\n * Registry of all available framework detectors\n * Frameworks will be added as they are implemented\n * \n * Order doesn't matter for detection as priority system handles conflicts,\n * but listed here in order from generic to specific for clarity:\n * - Generic language detectors (Node.js, PHP)\n * - Specific framework detectors (Laravel, Shopify)\n */\nexport const frameworkDetectors: FrameworkDetector[] = [\n  nodejsDetector,\n  phpDetector,\n  laravelDetector,\n  shopifyDetector,\n];\n\n/**\n * Register a framework detector\n */\nexport function registerFramework(detector: FrameworkDetector): void {\n  // Check if already registered\n  const existing = frameworkDetectors.find(d => d.name === detector.name);\n  if (existing) {\n    console.warn(`Framework detector '${detector.name}' is already registered, skipping`);\n    return;\n  }\n  \n  frameworkDetectors.push(detector);\n}\n\n/**\n * Get a framework detector by name\n */\nexport function getFrameworkDetector(name: string): FrameworkDetector | undefined {\n  return frameworkDetectors.find(d => d.name === name);\n}\n\n","import chalk from 'chalk';\nimport fs from 'fs/promises';\nimport path from 'path';\nimport os from 'os';\nimport crypto from 'crypto';\nimport { configService } from '../config/service.js';\nimport { isGitRepo, getCurrentBranch, getCurrentCommit } from '../git/utils.js';\nimport { readVersionFile } from '../vectordb/version.js';\nimport { showCompactBanner } from '../utils/banner.js';\nimport { isModernConfig } from '../config/schema.js';\n\nexport async function statusCommand() {\n  const rootDir = process.cwd();\n  const projectName = path.basename(rootDir);\n  \n  // Use same hashing logic as VectorDB to show correct path\n  const pathHash = crypto\n    .createHash('md5')\n    .update(rootDir)\n    .digest('hex')\n    .substring(0, 8);\n  \n  const indexPath = path.join(os.homedir(), '.lien', 'indices', `${projectName}-${pathHash}`);\n  \n  showCompactBanner();\n  console.log(chalk.bold('Status\\n'));\n  \n  // Check if config exists\n  const hasConfig = await configService.exists(rootDir);\n  console.log(chalk.dim('Configuration:'), hasConfig ? chalk.green('✓ Found') : chalk.red('✗ Not initialized'));\n  \n  if (!hasConfig) {\n    console.log(chalk.yellow('\\nRun'), chalk.bold('lien init'), chalk.yellow('to initialize'));\n    return;\n  }\n  \n  // Check if index exists\n  try {\n    const stats = await fs.stat(indexPath);\n    console.log(chalk.dim('Index location:'), indexPath);\n    console.log(chalk.dim('Index status:'), chalk.green('✓ Exists'));\n    \n    // Try to get directory size\n    try {\n      const files = await fs.readdir(indexPath, { recursive: true });\n      console.log(chalk.dim('Index files:'), files.length);\n    } catch (e) {\n      // Ignore\n    }\n    \n    console.log(chalk.dim('Last modified:'), stats.mtime.toLocaleString());\n    \n    // Show version file info\n    try {\n      const version = await readVersionFile(indexPath);\n      if (version > 0) {\n        const versionDate = new Date(version);\n        console.log(chalk.dim('Last reindex:'), versionDate.toLocaleString());\n      }\n    } catch {\n      // Ignore\n    }\n  } catch (error) {\n    console.log(chalk.dim('Index status:'), chalk.yellow('✗ Not indexed'));\n    console.log(chalk.yellow('\\nRun'), chalk.bold('lien index'), chalk.yellow('to index your codebase'));\n  }\n  \n  // Load and show configuration settings\n  try {\n    const config = await configService.load(rootDir);\n    \n    console.log(chalk.bold('\\nFeatures:'));\n    \n    // Git detection status\n    const isRepo = await isGitRepo(rootDir);\n    if (config.gitDetection.enabled && isRepo) {\n      console.log(chalk.dim('Git detection:'), chalk.green('✓ Enabled'));\n      console.log(chalk.dim('  Poll interval:'), `${config.gitDetection.pollIntervalMs / 1000}s`);\n      \n      // Show current git state\n      try {\n        const branch = await getCurrentBranch(rootDir);\n        const commit = await getCurrentCommit(rootDir);\n        console.log(chalk.dim('  Current branch:'), branch);\n        console.log(chalk.dim('  Current commit:'), commit.substring(0, 8));\n        \n        // Check if git state file exists\n        const gitStateFile = path.join(indexPath, '.git-state.json');\n        try {\n          const gitStateContent = await fs.readFile(gitStateFile, 'utf-8');\n          const gitState = JSON.parse(gitStateContent);\n          if (gitState.branch !== branch || gitState.commit !== commit) {\n            console.log(chalk.yellow('  ⚠️  Git state changed - will reindex on next serve'));\n          }\n        } catch {\n          // Git state file doesn't exist yet\n        }\n      } catch {\n        // Ignore git command errors\n      }\n    } else if (config.gitDetection.enabled && !isRepo) {\n      console.log(chalk.dim('Git detection:'), chalk.yellow('Enabled (not a git repo)'));\n    } else {\n      console.log(chalk.dim('Git detection:'), chalk.gray('Disabled'));\n    }\n    \n    // File watching status\n    if (config.fileWatching.enabled) {\n      console.log(chalk.dim('File watching:'), chalk.green('✓ Enabled'));\n      console.log(chalk.dim('  Debounce:'), `${config.fileWatching.debounceMs}ms`);\n    } else {\n      console.log(chalk.dim('File watching:'), chalk.gray('Disabled'));\n      console.log(chalk.dim('  Enable with:'), chalk.bold('lien serve --watch'));\n    }\n    \n    // Indexing settings\n    console.log(chalk.bold('\\nIndexing Settings:'));\n    if (isModernConfig(config)) {\n      console.log(chalk.dim('Concurrency:'), config.core.concurrency);\n      console.log(chalk.dim('Batch size:'), config.core.embeddingBatchSize);\n      console.log(chalk.dim('Chunk size:'), config.core.chunkSize);\n      console.log(chalk.dim('Chunk overlap:'), config.core.chunkOverlap);\n    }\n    \n  } catch (error) {\n    console.log(chalk.yellow('\\nWarning: Could not load configuration'));\n  }\n}\n\n","import chalk from 'chalk';\nimport { indexCodebase } from '../indexer/index.js';\nimport { showCompactBanner } from '../utils/banner.js';\n\nexport async function indexCommand(options: { watch?: boolean; verbose?: boolean; force?: boolean }) {\n  showCompactBanner();\n  \n  try {\n    // If force flag is set, clear the index and manifest first (clean slate)\n    if (options.force) {\n      const { VectorDB } = await import('../vectordb/lancedb.js');\n      const { ManifestManager } = await import('../indexer/manifest.js');\n      \n      console.log(chalk.yellow('Clearing existing index and manifest...'));\n      const vectorDB = new VectorDB(process.cwd());\n      await vectorDB.initialize();\n      await vectorDB.clear();\n      \n      // Also clear manifest\n      const manifest = new ManifestManager(vectorDB.dbPath);\n      await manifest.clear();\n      \n      console.log(chalk.green('✓ Index and manifest cleared\\n'));\n    }\n    \n    await indexCodebase({\n      rootDir: process.cwd(),\n      verbose: options.verbose || false,\n      force: options.force || false,\n    });\n    \n    if (options.watch) {\n      console.log(chalk.yellow('\\n⚠️  Watch mode not yet implemented'));\n      // TODO: Implement file watching with chokidar\n    }\n  } catch (error) {\n    console.error(chalk.red('Error during indexing:'), error);\n    process.exit(1);\n  }\n}\n\n","import chalk from 'chalk';\nimport fs from 'fs/promises';\nimport path from 'path';\nimport { startMCPServer } from '../mcp/server.js';\nimport { showBanner } from '../utils/banner.js';\n\nexport async function serveCommand(options: { port?: string; watch?: boolean; noWatch?: boolean; root?: string }) {\n  const rootDir = options.root ? path.resolve(options.root) : process.cwd();\n  \n  try {\n    // Validate root directory if --root was specified\n    if (options.root) {\n      try {\n        const stats = await fs.stat(rootDir);\n        if (!stats.isDirectory()) {\n          console.error(chalk.red(`Error: --root path is not a directory: ${rootDir}`));\n          process.exit(1);\n        }\n      } catch (error) {\n        if ((error as NodeJS.ErrnoException).code === 'ENOENT') {\n          console.error(chalk.red(`Error: --root directory does not exist: ${rootDir}`));\n        } else if ((error as NodeJS.ErrnoException).code === 'EACCES') {\n          console.error(chalk.red(`Error: --root directory is not accessible: ${rootDir}`));\n        } else {\n          console.error(chalk.red(`Error: Failed to access --root directory: ${rootDir}`));\n          console.error(chalk.dim((error as Error).message));\n        }\n        process.exit(1);\n      }\n    }\n    \n    // Log to stderr since stdout is for MCP protocol\n    showBanner();\n    console.error(chalk.bold('Starting MCP server...\\n'));\n    \n    if (options.root) {\n      console.error(chalk.dim(`Serving from: ${rootDir}\\n`));\n    }\n    \n    // Handle deprecated --watch flag\n    if (options.watch) {\n      console.error(chalk.yellow('⚠️  --watch flag is deprecated (file watching is now default)'));\n      console.error(chalk.dim('    Use --no-watch to disable file watching\\n'));\n    }\n    \n    // Determine file watching state\n    // Priority: --no-watch > --watch (deprecated) > config default\n    const watch = options.noWatch ? false : options.watch ? true : undefined;\n    \n    await startMCPServer({\n      rootDir,\n      verbose: true,\n      watch,\n    });\n  } catch (error) {\n    console.error(chalk.red('Failed to start MCP server:'), error);\n    process.exit(1);\n  }\n}\n\n","import { Server } from '@modelcontextprotocol/sdk/server/index.js';\nimport { StdioServerTransport } from '@modelcontextprotocol/sdk/server/stdio.js';\nimport {\n  CallToolRequestSchema,\n  ListToolsRequestSchema,\n} from '@modelcontextprotocol/sdk/types.js';\nimport { createRequire } from 'module';\nimport { fileURLToPath } from 'url';\nimport { dirname, join } from 'path';\nimport { tools } from './tools.js';\nimport { toolHandlers } from './handlers/index.js';\nimport { VectorDB } from '../vectordb/lancedb.js';\nimport { LocalEmbeddings } from '../embeddings/local.js';\nimport { GitStateTracker } from '../git/tracker.js';\nimport { indexMultipleFiles, indexSingleFile } from '../indexer/incremental.js';\nimport { configService } from '../config/service.js';\nimport { ManifestManager } from '../indexer/manifest.js';\nimport { isGitAvailable, isGitRepo } from '../git/utils.js';\nimport { FileWatcher } from '../watcher/index.js';\nimport { VERSION_CHECK_INTERVAL_MS } from '../constants.js';\nimport { LienError, LienErrorCode } from '../errors/index.js';\nimport type { ToolContext, LogFn, LogLevel } from './types.js';\n\n// Get version from package.json dynamically\nconst __filename = fileURLToPath(import.meta.url);\nconst __dirname = dirname(__filename);\nconst require = createRequire(import.meta.url);\n\nlet packageJson: { name: string; version: string };\ntry {\n  packageJson = require(join(__dirname, '../package.json'));\n} catch {\n  packageJson = require(join(__dirname, '../../package.json'));\n}\n\nexport interface MCPServerOptions {\n  rootDir: string;\n  verbose?: boolean;\n  watch?: boolean;\n}\n\n/**\n * Initialize embeddings and vector database.\n */\nasync function initializeDatabase(\n  rootDir: string,\n  log: LogFn\n): Promise<{ embeddings: LocalEmbeddings; vectorDB: VectorDB }> {\n  const embeddings = new LocalEmbeddings();\n  const vectorDB = new VectorDB(rootDir);\n\n  log('Loading embedding model...');\n  await embeddings.initialize();\n\n  log('Loading vector database...');\n  await vectorDB.initialize();\n\n  log('Embeddings and vector DB ready');\n  return { embeddings, vectorDB };\n}\n\n/**\n * Run auto-indexing if needed (first run with no index).\n */\nasync function handleAutoIndexing(\n  vectorDB: VectorDB,\n  config: Awaited<ReturnType<typeof configService.load>>,\n  rootDir: string,\n  log: LogFn\n): Promise<void> {\n  const hasIndex = await vectorDB.hasData();\n\n  if (!hasIndex && config.mcp.autoIndexOnFirstRun) {\n    log('📦 No index found - running initial indexing...');\n    log('⏱️  This may take 5-20 minutes depending on project size');\n\n    try {\n      const { indexCodebase } = await import('../indexer/index.js');\n      await indexCodebase({ rootDir, verbose: true });\n      log('✅ Initial indexing complete!');\n    } catch (error) {\n      log(`⚠️  Initial indexing failed: ${error}`, 'warning');\n      log('You can manually run: lien index', 'warning');\n    }\n  } else if (!hasIndex) {\n    log('⚠️  No index found. Auto-indexing is disabled in config.', 'warning');\n    log('Run \"lien index\" to index your codebase.', 'warning');\n  }\n}\n\n/**\n * Setup git detection and background polling.\n */\nasync function setupGitDetection(\n  config: Awaited<ReturnType<typeof configService.load>>,\n  rootDir: string,\n  vectorDB: VectorDB,\n  embeddings: LocalEmbeddings,\n  verbose: boolean | undefined,\n  log: LogFn\n): Promise<{ gitTracker: GitStateTracker | null; gitPollInterval: NodeJS.Timeout | null }> {\n  if (!config.gitDetection.enabled) {\n    log('Git detection disabled by configuration');\n    return { gitTracker: null, gitPollInterval: null };\n  }\n\n  const gitAvailable = await isGitAvailable();\n  const isRepo = await isGitRepo(rootDir);\n\n  if (!gitAvailable) {\n    log('Git not available - git detection disabled');\n    return { gitTracker: null, gitPollInterval: null };\n  }\n  if (!isRepo) {\n    log('Not a git repository - git detection disabled');\n    return { gitTracker: null, gitPollInterval: null };\n  }\n\n  log('✓ Detected git repository');\n  const gitTracker = new GitStateTracker(rootDir, vectorDB.dbPath);\n\n  // Check for git changes on startup\n  try {\n    log('Checking for git changes...');\n    const changedFiles = await gitTracker.initialize();\n\n    if (changedFiles && changedFiles.length > 0) {\n      log(`🌿 Git changes detected: ${changedFiles.length} files changed`);\n      const count = await indexMultipleFiles(changedFiles, vectorDB, embeddings, config, { verbose });\n      log(`✓ Reindexed ${count} files`);\n    } else {\n      log('✓ Index is up to date with git state');\n    }\n  } catch (error) {\n    log(`Failed to check git state on startup: ${error}`, 'warning');\n  }\n\n  // Start background polling\n  log(`✓ Git detection enabled (checking every ${config.gitDetection.pollIntervalMs / 1000}s)`);\n\n  const gitPollInterval = setInterval(async () => {\n    try {\n      const changedFiles = await gitTracker.detectChanges();\n      if (changedFiles && changedFiles.length > 0) {\n        log(`🌿 Git change detected: ${changedFiles.length} files changed`);\n        indexMultipleFiles(changedFiles, vectorDB, embeddings, config, { verbose })\n          .then(count => log(`✓ Background reindex complete: ${count} files`))\n          .catch(error => log(`Background reindex failed: ${error}`, 'warning'));\n      }\n    } catch (error) {\n      log(`Git detection check failed: ${error}`, 'warning');\n    }\n  }, config.gitDetection.pollIntervalMs);\n\n  return { gitTracker, gitPollInterval };\n}\n\n/**\n * Setup file watching for real-time updates.\n */\nasync function setupFileWatching(\n  watch: boolean | undefined,\n  config: Awaited<ReturnType<typeof configService.load>>,\n  rootDir: string,\n  vectorDB: VectorDB,\n  embeddings: LocalEmbeddings,\n  verbose: boolean | undefined,\n  log: LogFn\n): Promise<FileWatcher | null> {\n  const fileWatchingEnabled = watch !== undefined ? watch : config.fileWatching.enabled;\n  if (!fileWatchingEnabled) return null;\n\n  log('👀 Starting file watcher...');\n  const fileWatcher = new FileWatcher(rootDir, config);\n\n  try {\n    await fileWatcher.start(async (event) => {\n      const { type, filepath } = event;\n\n      if (type === 'unlink') {\n        log(`🗑️  File deleted: ${filepath}`);\n        try {\n          await vectorDB.deleteByFile(filepath);\n          const manifest = new ManifestManager(vectorDB.dbPath);\n          await manifest.removeFile(filepath);\n          log(`✓ Removed ${filepath} from index`);\n        } catch (error) {\n          log(`Failed to remove ${filepath}: ${error}`, 'warning');\n        }\n      } else {\n        const action = type === 'add' ? 'added' : 'changed';\n        log(`📝 File ${action}: ${filepath}`);\n        indexSingleFile(filepath, vectorDB, embeddings, config, { verbose })\n          .catch((error) => log(`Failed to reindex ${filepath}: ${error}`, 'warning'));\n      }\n    });\n\n    log(`✓ File watching enabled (watching ${fileWatcher.getWatchedFiles().length} files)`);\n    return fileWatcher;\n  } catch (error) {\n    log(`Failed to start file watcher: ${error}`, 'warning');\n    return null;\n  }\n}\n\n/**\n * Register tool call handler on the MCP server.\n */\nfunction registerToolCallHandler(\n  server: Server,\n  toolContext: ToolContext,\n  log: LogFn\n): void {\n  server.setRequestHandler(CallToolRequestSchema, async (request) => {\n    const { name, arguments: args } = request.params;\n    log(`Handling tool call: ${name}`);\n\n    const handler = toolHandlers[name];\n    if (!handler) {\n      const error = new LienError(\n        `Unknown tool: ${name}`,\n        LienErrorCode.INVALID_INPUT,\n        { requestedTool: name, availableTools: tools.map(t => t.name) },\n        'medium', false, false\n      );\n      return { isError: true, content: [{ type: 'text' as const, text: JSON.stringify(error.toJSON(), null, 2) }] };\n    }\n\n    try {\n      return await handler(args, toolContext);\n    } catch (error) {\n      if (error instanceof LienError) {\n        return { isError: true, content: [{ type: 'text' as const, text: JSON.stringify(error.toJSON(), null, 2) }] };\n      }\n      console.error(`Unexpected error handling tool call ${name}:`, error);\n      return {\n        isError: true,\n        content: [{\n          type: 'text' as const,\n          text: JSON.stringify({ error: error instanceof Error ? error.message : 'Unknown error', code: LienErrorCode.INTERNAL_ERROR, tool: name }, null, 2),\n        }],\n      };\n    }\n  });\n}\n\nexport async function startMCPServer(options: MCPServerOptions): Promise<void> {\n  const { rootDir, verbose, watch } = options;\n  \n  // Early log function before server is ready (falls back to stderr)\n  const earlyLog: LogFn = (message, level = 'info') => { \n    if (verbose || level === 'warning' || level === 'error') {\n      console.error(`[Lien MCP] [${level}] ${message}`); \n    }\n  };\n\n  earlyLog('Initializing MCP server...');\n\n  // Initialize core components\n  const { embeddings, vectorDB } = await initializeDatabase(rootDir, earlyLog).catch(error => {\n    console.error(`Failed to initialize: ${error}`);\n    process.exit(1);\n  });\n\n  // Create MCP server with logging capability\n  const server = new Server(\n    { name: 'lien', version: packageJson.version },\n    { capabilities: { tools: {}, logging: {} } }\n  );\n\n  // Create proper log function that uses MCP logging notifications\n  // - In verbose mode: all levels (debug, info, notice, warning, error)\n  // - In non-verbose mode: only warnings and errors\n  const log: LogFn = (message, level: LogLevel = 'info') => {\n    if (verbose || level === 'warning' || level === 'error') {\n      server.sendLoggingMessage({\n        level,\n        logger: 'lien',\n        data: message,\n      }).catch(() => {\n        // Fallback to stderr if MCP notification fails (e.g., not connected yet)\n        console.error(`[Lien MCP] [${level}] ${message}`);\n      });\n    }\n  };\n\n  server.setRequestHandler(ListToolsRequestSchema, async () => ({ tools }));\n\n  // Version check helpers\n  const checkAndReconnect = async () => {\n    try {\n      if (await vectorDB.checkVersion()) {\n        log('Index version changed, reconnecting...');\n        await vectorDB.reconnect();\n      }\n    } catch (error) {\n      log(`Version check failed: ${error}`, 'warning');\n    }\n  };\n\n  const getIndexMetadata = () => ({\n    indexVersion: vectorDB.getCurrentVersion(),\n    indexDate: vectorDB.getVersionDate(),\n  });\n\n  const versionCheckInterval = setInterval(checkAndReconnect, VERSION_CHECK_INTERVAL_MS);\n\n  // Load config and create tool context\n  const config = await configService.load(rootDir);\n  const toolContext: ToolContext = { vectorDB, embeddings, config, rootDir, log, checkAndReconnect, getIndexMetadata };\n\n  // Register handlers and setup features\n  registerToolCallHandler(server, toolContext, log);\n  await handleAutoIndexing(vectorDB, config, rootDir, log);\n  const { gitPollInterval } = await setupGitDetection(config, rootDir, vectorDB, embeddings, verbose, log);\n  const fileWatcher = await setupFileWatching(watch, config, rootDir, vectorDB, embeddings, verbose, log);\n\n  // Cleanup handler\n  const cleanup = async () => {\n    log('Shutting down MCP server...');\n    clearInterval(versionCheckInterval);\n    if (gitPollInterval) clearInterval(gitPollInterval);\n    if (fileWatcher) await fileWatcher.stop();\n    process.exit(0);\n  };\n\n  process.on('SIGINT', cleanup);\n  process.on('SIGTERM', cleanup);\n\n  // Connect transport\n  const transport = new StdioServerTransport();\n  transport.onclose = () => { log('Transport closed'); cleanup().catch(() => process.exit(0)); };\n  transport.onerror = (error) => log(`Transport error: ${error}`);\n\n  await server.connect(transport);\n  log('MCP server started and listening on stdio');\n}\n","import { z } from 'zod';\nimport { zodToJsonSchema } from 'zod-to-json-schema';\n\n/**\n * Convert a Zod schema to an MCP tool schema.\n * \n * This utility generates JSON Schema from Zod schemas for use in MCP tool definitions.\n * The resulting schema includes all validation rules and descriptions from the Zod schema.\n * \n * @param zodSchema - The Zod schema to convert\n * @param name - The tool name\n * @param description - The tool description\n * @returns MCP-compatible tool schema object\n * \n * @example\n * ```typescript\n * const SearchSchema = z.object({\n *   query: z.string().min(3).describe(\"Search query\"),\n *   limit: z.number().default(5)\n * });\n * \n * const tool = toMCPToolSchema(\n *   SearchSchema,\n *   'semantic_search',\n *   'Search the codebase semantically'\n * );\n * ```\n */\nexport function toMCPToolSchema(\n  zodSchema: z.ZodSchema,\n  name: string,\n  description: string\n) {\n  return {\n    name,\n    description,\n    inputSchema: zodToJsonSchema(zodSchema, {\n      target: 'jsonSchema7',\n      $refStrategy: 'none',\n    }),\n  };\n}\n\n","import { z } from 'zod';\n\n/**\n * Schema for semantic search tool input.\n * \n * Validates query strings and result limits for semantic code search.\n * Includes rich descriptions to guide AI assistants on proper usage.\n */\nexport const SemanticSearchSchema = z.object({\n  query: z.string()\n    .min(3, \"Query must be at least 3 characters\")\n    .max(500, \"Query too long (max 500 characters)\")\n    .describe(\n      \"Natural language description of what you're looking for.\\n\\n\" +\n      \"Use full sentences describing functionality, not exact names.\\n\\n\" +\n      \"Good examples:\\n\" +\n      \"  - 'handles user authentication'\\n\" +\n      \"  - 'validates email format'\\n\" +\n      \"  - 'processes payment transactions'\\n\\n\" +\n      \"Bad examples:\\n\" +\n      \"  - 'auth' (too vague)\\n\" +\n      \"  - 'validateEmail' (use grep for exact names)\"\n    ),\n    \n  limit: z.number()\n    .int()\n    .min(1, \"Limit must be at least 1\")\n    .max(50, \"Limit cannot exceed 50\")\n    .default(5)\n    .describe(\n      \"Number of results to return.\\n\\n\" +\n      \"Default: 5\\n\" +\n      \"Increase to 10-15 for broad exploration.\"\n    ),\n});\n\n/**\n * Inferred TypeScript type for semantic search input\n */\nexport type SemanticSearchInput = z.infer<typeof SemanticSearchSchema>;\n\n","import { z } from 'zod';\n\n/**\n * Schema for find_similar tool input.\n * \n * Validates code snippets and result limits for similarity search.\n */\nexport const FindSimilarSchema = z.object({\n  code: z.string()\n    .min(10, \"Code snippet must be at least 10 characters\")\n    .describe(\n      \"Code snippet to find similar implementations for.\\n\\n\" +\n      \"Provide a representative code sample that demonstrates the pattern \" +\n      \"you want to find similar examples of in the codebase.\"\n    ),\n    \n  limit: z.number()\n    .int()\n    .min(1, \"Limit must be at least 1\")\n    .max(20, \"Limit cannot exceed 20\")\n    .default(5)\n    .describe(\n      \"Number of similar code blocks to return.\\n\\n\" +\n      \"Default: 5\"\n    ),\n});\n\n/**\n * Inferred TypeScript type for find similar input\n */\nexport type FindSimilarInput = z.infer<typeof FindSimilarSchema>;\n\n","import { z } from 'zod';\n\n/**\n * Schema for get_files_context tool input.\n * \n * Validates file paths and context options for retrieving file-specific code chunks.\n * Supports both single file and batch operations.\n */\nexport const GetFilesContextSchema = z.object({\n  filepaths: z.union([\n    z.string().min(1, \"Filepath cannot be empty\"),\n    z.array(z.string().min(1, \"Filepath cannot be empty\")).min(1, \"Array must contain at least one filepath\").max(50, \"Maximum 50 files per request\")\n  ]).describe(\n    \"Single filepath or array of filepaths (relative to workspace root).\\n\\n\" +\n    \"Single file: 'src/components/Button.tsx'\\n\" +\n    \"Multiple files: ['src/auth.ts', 'src/user.ts']\\n\\n\" +\n    \"Maximum 50 files per request for batch operations.\"\n  ),\n    \n  includeRelated: z.boolean()\n    .default(true)\n    .describe(\n      \"Include semantically related chunks from nearby code.\\n\\n\" +\n      \"Default: true\\n\\n\" +\n      \"When enabled, also returns related code from other files that are \" +\n      \"semantically similar to the target file's contents.\"\n    ),\n});\n\n/**\n * Inferred TypeScript type for file context input\n */\nexport type GetFilesContextInput = z.infer<typeof GetFilesContextSchema>;\n\n","import { z } from 'zod';\n\n/**\n * Schema for list_functions tool input.\n * \n * Validates pattern and language filters for symbol listing.\n */\nexport const ListFunctionsSchema = z.object({\n  pattern: z.string()\n    .optional()\n    .describe(\n      \"Regex pattern to match symbol names.\\n\\n\" +\n      \"Examples:\\n\" +\n      \"  - '.*Controller.*' to find all Controllers\\n\" +\n      \"  - 'handle.*' to find handlers\\n\" +\n      \"  - '.*Service$' to find Services\\n\\n\" +\n      \"If omitted, returns all symbols.\"\n    ),\n    \n  language: z.string()\n    .optional()\n    .describe(\n      \"Filter by programming language.\\n\\n\" +\n      \"Examples: 'typescript', 'python', 'javascript', 'php'\\n\\n\" +\n      \"If omitted, searches all languages.\"\n    ),\n});\n\n/**\n * Inferred TypeScript type for list functions input\n */\nexport type ListFunctionsInput = z.infer<typeof ListFunctionsSchema>;\n\n","import { z } from 'zod';\n\n/**\n * Schema for get_dependents tool input.\n * \n * Validates file paths and options for finding reverse dependencies\n * (which files import/depend on a given file).\n * \n * Limitations:\n * - Scans up to 10,000 code chunks. For very large codebases (>1M lines),\n *   results may be incomplete. A warning is returned if the limit is reached.\n */\nexport const GetDependentsSchema = z.object({\n  filepath: z.string()\n    .min(1, \"Filepath cannot be empty\")\n    .describe(\n      \"Path to file to find dependents for (relative to workspace root).\\n\\n\" +\n      \"Example: 'src/utils/validate.ts'\\n\\n\" +\n      \"Returns all files that import or depend on this file.\\n\\n\" +\n      \"Note: Scans up to 10,000 code chunks. For very large codebases,\\n\" +\n      \"results may be incomplete (a warning will be included if truncated).\"\n    ),\n    \n  depth: z.number()\n    .int()\n    .min(1)\n    .max(1)\n    .default(1)\n    .describe(\n      \"Depth of transitive dependencies. Only depth=1 (direct dependents) is currently supported.\\n\\n\" +\n      \"1 = Direct dependents only\"\n    ),\n});\n\n/**\n * Inferred TypeScript type for get_dependents input\n */\nexport type GetDependentsInput = z.infer<typeof GetDependentsSchema>;\n\n","import { z } from 'zod';\n\n/**\n * Schema for get_complexity tool input.\n * \n * Validates parameters for complexity analysis queries,\n * enabling tech debt analysis and refactoring prioritization.\n */\nexport const GetComplexitySchema = z.object({\n  files: z.array(z.string().min(1, \"Filepath cannot be empty\"))\n    .optional()\n    .describe(\n      \"Specific files to analyze. If omitted, analyzes entire codebase.\\n\\n\" +\n      \"Example: ['src/auth.ts', 'src/api/user.ts']\"\n    ),\n    \n  top: z.number()\n    .int()\n    .min(1, \"Top must be at least 1\")\n    .max(50, \"Top cannot exceed 50\")\n    .default(10)\n    .describe(\n      \"Return top N most complex functions. Default: 10\\n\\n\" +\n      \"Use higher values to see more violations.\"\n    ),\n    \n  threshold: z.number()\n    .int()\n    .min(1, \"Threshold must be at least 1\")\n    .optional()\n    .describe(\n      \"Only return functions above this complexity threshold.\\n\\n\" +\n      \"Note: Violations are first identified using the threshold from lien.config.json (default: 15). \" +\n      \"This parameter filters those violations to show only items above the specified value. \" +\n      \"Setting threshold below the config threshold will not show additional functions.\"\n    ),\n});\n\n/**\n * Inferred TypeScript type for get_complexity input\n */\nexport type GetComplexityInput = z.infer<typeof GetComplexitySchema>;\n\n","import { toMCPToolSchema } from './utils/zod-to-json-schema.js';\nimport {\n  SemanticSearchSchema,\n  FindSimilarSchema,\n  GetFilesContextSchema,\n  ListFunctionsSchema,\n  GetDependentsSchema,\n  GetComplexitySchema,\n} from './schemas/index.js';\n\n/**\n * MCP tool definitions with Zod-generated schemas.\n * \n * All schemas are automatically generated from Zod definitions,\n * providing type safety and rich validation at runtime.\n */\nexport const tools = [\n  toMCPToolSchema(\n    SemanticSearchSchema,\n    'semantic_search',\n    `Search codebase by MEANING, not text. USE THIS INSTEAD OF grep/ripgrep for finding implementations, features, or understanding how code works.\n\nExamples:\n- \"Where is authentication handled?\" → semantic_search({ query: \"handles user authentication\" })\n- \"How does payment work?\" → semantic_search({ query: \"processes payment transactions\" })\n\nUse natural language describing what the code DOES, not function names. For exact string matching, use grep instead.\n\nResults include a relevance category (highly_relevant, relevant, loosely_related, not_relevant) for each match.`\n  ),\n  toMCPToolSchema(\n    FindSimilarSchema,\n    'find_similar',\n    `Find code structurally similar to a given snippet. Use for:\n- Ensuring consistency when adding new code\n- Finding duplicate implementations\n- Refactoring similar patterns together\n\nProvide at least 10 characters of code to match against. Results include a relevance category for each match.`\n  ),\n  toMCPToolSchema(\n    GetFilesContextSchema,\n    'get_files_context',\n    `Get context for one or more files including dependencies and test coverage.\n\nMANDATORY: Call this BEFORE editing any file. Accepts single path or array of paths.\n\nSingle file:\n  get_files_context({ filepaths: \"src/auth.ts\" })\n  \n  Returns:\n  {\n    file: \"src/auth.ts\",\n    chunks: [...],\n    testAssociations: [\"src/__tests__/auth.test.ts\"]\n  }\n\nMultiple files (batch):\n  get_files_context({ filepaths: [\"src/auth.ts\", \"src/user.ts\"] })\n  \n  Returns:\n  {\n    files: {\n      \"src/auth.ts\": {\n        chunks: [...],\n        testAssociations: [\"src/__tests__/auth.test.ts\"]\n      },\n      \"src/user.ts\": {\n        chunks: [...],\n        testAssociations: [\"src/__tests__/user.test.ts\"]\n      }\n    }\n  }\n\nReturns for each file:\n- All chunks and related code\n- testAssociations: Array of test files that import this file (reverse dependency lookup)\n- Relevance scoring\n\nALWAYS check testAssociations before modifying source code.\nAfter changes, remind the user to run the associated tests.\n\nBatch calls are more efficient than multiple single-file calls.`\n  ),\n  toMCPToolSchema(\n    ListFunctionsSchema,\n    'list_functions',\n    `Fast symbol lookup by naming pattern. Use when searching by NAME, not behavior.\n\nExamples:\n- \"Show all controllers\" → list_functions({ pattern: \".*Controller.*\" })\n- \"Find service classes\" → list_functions({ pattern: \".*Service$\" })\n\n10x faster than semantic_search for structural/architectural queries. Use semantic_search instead when searching by what code DOES.`\n  ),\n  toMCPToolSchema(\n    GetDependentsSchema,\n    'get_dependents',\n    `Find all code that depends on a file (reverse dependency lookup). Use for impact analysis:\n- \"What breaks if I change this?\"\n- \"Is this safe to delete?\"\n- \"What imports this module?\"\n\nReturns:\n- List of files that import the target\n- Risk level (low/medium/high/critical) based on dependent count and complexity\n\nExample: get_dependents({ filepath: \"src/utils/validate.ts\" })`\n  ),\n  toMCPToolSchema(\n    GetComplexitySchema,\n    'get_complexity',\n    `Get complexity analysis for files or the entire codebase.\n\nAnalyzes multiple complexity metrics:\n- **Test paths**: Number of test cases needed for full coverage (cyclomatic)\n- **Mental load**: How hard to follow - penalizes nesting (cognitive)\n- **Time to understand**: Estimated reading time based on Halstead effort\n- **Estimated bugs**: Predicted bug count based on Halstead volume\n\nUse for tech debt analysis and refactoring prioritization:\n- \"What are the most complex functions?\"\n- \"Show me tech debt hotspots\"\n- \"What should I refactor?\"\n\nExamples:\n  get_complexity({ top: 10 })\n  get_complexity({ files: [\"src/auth.ts\", \"src/api/user.ts\"] })\n  get_complexity({ threshold: 15 })\n\nReturns violations with metricType ('cyclomatic', 'cognitive', 'halstead_effort',\nor 'halstead_bugs'), risk levels, and dependent counts.\nHuman-readable output: \"23 (needs ~23 tests)\", \"🧠 45\", \"~2h 30m\", \"2.27 bugs\".`\n  ),\n];","import { ZodSchema, ZodError } from 'zod';\nimport { LienError, LienErrorCode } from '../../errors/index.js';\n\n/**\n * Wrap a tool handler with Zod validation and error handling.\n * \n * This utility provides automatic:\n * - Input validation using Zod schemas\n * - Type-safe handler execution with inferred types\n * - Consistent error formatting for validation, Lien, and unexpected errors\n * - MCP-compatible response structure\n * \n * @param schema - Zod schema to validate tool inputs against\n * @param handler - Tool handler function that receives validated inputs\n * @returns Wrapped handler that validates inputs and handles errors\n * \n * @example\n * ```typescript\n * const SearchSchema = z.object({\n *   query: z.string().min(3),\n *   limit: z.number().default(5)\n * });\n * \n * const searchHandler = wrapToolHandler(\n *   SearchSchema,\n *   async (args) => {\n *     // args is fully typed: { query: string; limit: number }\n *     const results = await search(args.query, args.limit);\n *     return { results };\n *   }\n * );\n * \n * // Use in MCP server\n * return await searchHandler(request.params.arguments);\n * ```\n */\nexport function wrapToolHandler<T>(\n  schema: ZodSchema<T>,\n  handler: (validated: T) => Promise<any>\n) {\n  return async (args: unknown) => {\n    try {\n      // Validate input with Zod\n      const validated = schema.parse(args);\n      \n      // Execute handler with validated, typed input\n      const result = await handler(validated);\n      \n      // Return MCP-compatible success response\n      return {\n        content: [{\n          type: 'text' as const,\n          text: JSON.stringify(result, null, 2),\n        }],\n      };\n      \n    } catch (error) {\n      // Handle Zod validation errors\n      if (error instanceof ZodError) {\n        return {\n          isError: true,\n          content: [{\n            type: 'text' as const,\n            text: JSON.stringify({\n              error: 'Invalid parameters',\n              code: LienErrorCode.INVALID_INPUT,\n              details: error.errors.map(e => ({\n                field: e.path.join('.'),\n                message: e.message,\n              })),\n            }, null, 2),\n          }],\n        };\n      }\n      \n      // Handle known Lien errors\n      if (error instanceof LienError) {\n        return {\n          isError: true,\n          content: [{\n            type: 'text' as const,\n            text: JSON.stringify(error.toJSON(), null, 2),\n          }],\n        };\n      }\n      \n      // Handle unexpected errors\n      console.error('Unexpected error in tool handler:', error);\n      return {\n        isError: true,\n        content: [{\n          type: 'text' as const,\n          text: JSON.stringify({\n            error: error instanceof Error ? error.message : 'Unknown error',\n            code: LienErrorCode.INTERNAL_ERROR,\n          }, null, 2),\n        }],\n      };\n    }\n  };\n}\n\n","import { wrapToolHandler } from '../utils/tool-wrapper.js';\nimport { SemanticSearchSchema } from '../schemas/index.js';\nimport type { ToolContext, MCPToolResult } from '../types.js';\n\n/**\n * Handle semantic_search tool calls.\n * Searches the codebase by meaning using embeddings.\n */\nexport async function handleSemanticSearch(\n  args: unknown,\n  ctx: ToolContext\n): Promise<MCPToolResult> {\n  const { vectorDB, embeddings, log, checkAndReconnect, getIndexMetadata } = ctx;\n\n  return await wrapToolHandler(\n    SemanticSearchSchema,\n    async (validatedArgs) => {\n      log(`Searching for: \"${validatedArgs.query}\"`);\n\n      // Check if index has been updated and reconnect if needed\n      await checkAndReconnect();\n\n      const queryEmbedding = await embeddings.embed(validatedArgs.query);\n      const results = await vectorDB.search(queryEmbedding, validatedArgs.limit, validatedArgs.query);\n\n      log(`Found ${results.length} results`);\n\n      return {\n        indexInfo: getIndexMetadata(),\n        results,\n      };\n    }\n  )(args);\n}\n","import { wrapToolHandler } from '../utils/tool-wrapper.js';\nimport { FindSimilarSchema } from '../schemas/index.js';\nimport type { ToolContext, MCPToolResult } from '../types.js';\n\n/**\n * Handle find_similar tool calls.\n * Finds code structurally similar to a given snippet.\n */\nexport async function handleFindSimilar(\n  args: unknown,\n  ctx: ToolContext\n): Promise<MCPToolResult> {\n  const { vectorDB, embeddings, log, checkAndReconnect, getIndexMetadata } = ctx;\n\n  return await wrapToolHandler(\n    FindSimilarSchema,\n    async (validatedArgs) => {\n      log(`Finding similar code...`);\n\n      // Check if index has been updated and reconnect if needed\n      await checkAndReconnect();\n\n      const codeEmbedding = await embeddings.embed(validatedArgs.code);\n      // Pass code as query for relevance boosting\n      const results = await vectorDB.search(codeEmbedding, validatedArgs.limit, validatedArgs.code);\n\n      log(`Found ${results.length} similar chunks`);\n\n      return {\n        indexInfo: getIndexMetadata(),\n        results,\n      };\n    }\n  )(args);\n}\n","/**\n * Shared path matching utilities for dependency analysis.\n * \n * These functions handle path normalization and matching logic used by\n * the get_dependents tool to find reverse dependencies.\n */\n\n/**\n * Normalizes a file path for comparison.\n * \n * - Removes quotes and trims whitespace\n * - Converts backslashes to forward slashes\n * - Strips file extensions (.ts, .tsx, .js, .jsx)\n * - Converts absolute paths to relative (if within workspace root)\n * \n * @param path - The path to normalize\n * @param workspaceRoot - The workspace root directory (normalized with forward slashes)\n * @returns Normalized path\n */\nexport function normalizePath(path: string, workspaceRoot: string): string {\n  let normalized = path.replace(/['\"]/g, '').trim().replace(/\\\\/g, '/');\n  \n  // Normalize extensions: .ts/.tsx/.js/.jsx → all treated as equivalent\n  // This handles TypeScript's ESM requirement of .js imports for .ts files\n  normalized = normalized.replace(/\\.(ts|tsx|js|jsx)$/, '');\n  \n  // Normalize to relative path if it starts with workspace root\n  if (normalized.startsWith(workspaceRoot + '/')) {\n    normalized = normalized.substring(workspaceRoot.length + 1);\n  }\n  \n  return normalized;\n}\n\n/**\n * Checks if a pattern matches at path component boundaries.\n * \n * Ensures matches occur at proper boundaries (/, .) to avoid false positives like:\n * - \"logger\" matching \"logger-utils\" ❌\n * - \"src/logger\" matching \"src/logger-service\" ❌\n * \n * @param str - The string to search in\n * @param pattern - The pattern to search for\n * @returns True if pattern matches at a boundary\n */\nexport function matchesAtBoundary(str: string, pattern: string): boolean {\n  const index = str.indexOf(pattern);\n  if (index === -1) return false;\n  \n  // Check character before match (must be start or path separator)\n  const charBefore = index > 0 ? str[index - 1] : '/';\n  if (charBefore !== '/' && index !== 0) return false;\n  \n  // Check character after match (must be end or path separator)\n  // Extensions are already stripped during normalization, so we only need to check for '/' as a valid path separator\n  const endIndex = index + pattern.length;\n  if (endIndex === str.length) return true;\n  const charAfter = str[endIndex];\n  return charAfter === '/';\n}\n\n/**\n * Determines if an import path matches a target file path.\n * \n * Handles various matching strategies:\n * 1. Exact match\n * 2. Target path appears in import (at boundaries)\n * 3. Import path appears in target (at boundaries)\n * 4. Relative imports (./logger vs src/utils/logger)\n * \n * @param normalizedImport - Normalized import path\n * @param normalizedTarget - Normalized target file path\n * @returns True if the import matches the target file\n */\nexport function matchesFile(normalizedImport: string, normalizedTarget: string): boolean {\n  // Exact match\n  if (normalizedImport === normalizedTarget) return true;\n  \n  // Strategy 1: Check if target path appears in import at path boundaries\n  if (matchesAtBoundary(normalizedImport, normalizedTarget)) {\n    return true;\n  }\n  \n  // Strategy 2: Check if import path appears in target (for longer target paths)\n  if (matchesAtBoundary(normalizedTarget, normalizedImport)) {\n    return true;\n  }\n  \n  // Strategy 3: Handle relative imports (./logger vs src/utils/logger)\n  // Remove leading ./ and ../ from import\n  const cleanedImport = normalizedImport.replace(/^(\\.\\.?\\/)+/, '');\n  if (matchesAtBoundary(cleanedImport, normalizedTarget) || \n      matchesAtBoundary(normalizedTarget, cleanedImport)) {\n    return true;\n  }\n  \n  return false;\n}\n\n/**\n * Gets a canonical path representation (relative to workspace, with extension).\n * \n * @param filepath - The file path to canonicalize\n * @param workspaceRoot - The workspace root directory (normalized with forward slashes)\n * @returns Canonical path\n */\nexport function getCanonicalPath(filepath: string, workspaceRoot: string): string {\n  let canonical = filepath.replace(/\\\\/g, '/');\n  if (canonical.startsWith(workspaceRoot + '/')) {\n    canonical = canonical.substring(workspaceRoot.length + 1);\n  }\n  return canonical;\n}\n\n/**\n * Determines if a file is a test file based on naming conventions.\n * \n * Uses precise regex patterns to avoid false positives:\n * - Files with .test. or .spec. extensions (e.g., foo.test.ts, bar.spec.js)\n * - Files in test/, tests/, or __tests__/ directories\n * \n * Avoids false positives like:\n * - contest.ts (contains \".test.\" but isn't a test)\n * - latest/config.ts (contains \"/test/\" but isn't a test)\n * \n * @param filepath - The file path to check\n * @returns True if the file is a test file\n */\nexport function isTestFile(filepath: string): boolean {\n  return /\\.(test|spec)\\.[^/]+$/.test(filepath) ||\n         /(^|[/\\\\])(test|tests|__tests__)[/\\\\]/.test(filepath);\n}\n\n","import { wrapToolHandler } from '../utils/tool-wrapper.js';\nimport { GetFilesContextSchema } from '../schemas/index.js';\nimport { normalizePath, matchesFile, getCanonicalPath, isTestFile } from '../utils/path-matching.js';\nimport type { ToolContext, MCPToolResult } from '../types.js';\n\n/**\n * Maximum number of chunks to scan for test association analysis.\n * Larger codebases may have incomplete results if they exceed this limit.\n */\nconst SCAN_LIMIT = 10000;\n\n/**\n * Handle get_files_context tool calls.\n * Gets context for one or more files including dependencies and test coverage.\n */\nexport async function handleGetFilesContext(\n  args: unknown,\n  ctx: ToolContext\n): Promise<MCPToolResult> {\n  const { vectorDB, embeddings, log, checkAndReconnect, getIndexMetadata } = ctx;\n\n  return await wrapToolHandler(\n    GetFilesContextSchema,\n    async (validatedArgs) => {\n      // Normalize input: convert single string to array\n      const filepaths = Array.isArray(validatedArgs.filepaths)\n        ? validatedArgs.filepaths\n        : [validatedArgs.filepaths];\n\n      const isSingleFile = !Array.isArray(validatedArgs.filepaths);\n\n      log(`Getting context for: ${filepaths.join(', ')}`);\n\n      // Check if index has been updated and reconnect if needed\n      await checkAndReconnect();\n\n      // Compute workspace root for path matching\n      const workspaceRoot = process.cwd().replace(/\\\\/g, '/');\n\n      // Batch embedding calls for all filepaths at once to reduce latency\n      const fileEmbeddings = await Promise.all(filepaths.map(fp => embeddings.embed(fp)));\n\n      // Batch all initial file searches in parallel\n      const allFileSearches = await Promise.all(\n        fileEmbeddings.map((embedding, i) =>\n          vectorDB.search(embedding, 50, filepaths[i])\n        )\n      );\n\n      // Filter results to only include chunks from each target file\n      // Use exact matching with getCanonicalPath to avoid false positives\n      const fileChunksMap = filepaths.map((filepath, i) => {\n        const allResults = allFileSearches[i];\n        const targetCanonical = getCanonicalPath(filepath, workspaceRoot);\n\n        return allResults.filter(r => {\n          const chunkCanonical = getCanonicalPath(r.metadata.file, workspaceRoot);\n          return chunkCanonical === targetCanonical;\n        });\n      });\n\n      // Batch related chunk operations if includeRelated is true\n      let relatedChunksMap: any[][] = [];\n      if (validatedArgs.includeRelated) {\n        // Get files that have chunks (need first chunk for related search)\n        const filesWithChunks = fileChunksMap\n          .map((chunks, i) => ({ chunks, filepath: filepaths[i], index: i }))\n          .filter(({ chunks }) => chunks.length > 0);\n\n        if (filesWithChunks.length > 0) {\n          // Batch embedding calls for all first chunks\n          const relatedEmbeddings = await Promise.all(\n            filesWithChunks.map(({ chunks }) => embeddings.embed(chunks[0].content))\n          );\n\n          // Batch all related chunk searches\n          const relatedSearches = await Promise.all(\n            relatedEmbeddings.map((embedding, i) =>\n              vectorDB.search(embedding, 5, filesWithChunks[i].chunks[0].content)\n            )\n          );\n\n          // Map back to original indices\n          relatedChunksMap = Array.from({ length: filepaths.length }, () => []);\n          filesWithChunks.forEach(({ filepath, index }, i) => {\n            const related = relatedSearches[i];\n            const targetCanonical = getCanonicalPath(filepath, workspaceRoot);\n            // Filter out chunks from the same file using exact matching\n            relatedChunksMap[index] = related.filter(r => {\n              const chunkCanonical = getCanonicalPath(r.metadata.file, workspaceRoot);\n              return chunkCanonical !== targetCanonical;\n            });\n          });\n        }\n      }\n\n      // Compute test associations for each file\n      // Scan once for all files to avoid repeated database queries (performance optimization)\n      const allChunks = await vectorDB.scanWithFilter({ limit: SCAN_LIMIT });\n\n      // Warn if we hit the limit (similar to get_dependents tool)\n      if (allChunks.length === SCAN_LIMIT) {\n        log(`Scanned ${SCAN_LIMIT} chunks (limit reached). Test associations may be incomplete for large codebases.`, 'warning');\n      }\n\n      // Path normalization cache to avoid repeated string operations\n      const pathCache = new Map<string, string>();\n      const normalizePathCached = (path: string): string => {\n        if (pathCache.has(path)) return pathCache.get(path)!;\n        const normalized = normalizePath(path, workspaceRoot);\n        pathCache.set(path, normalized);\n        return normalized;\n      };\n\n      // Compute test associations for each file using the same scan result\n      const testAssociationsMap = filepaths.map((filepath) => {\n        const normalizedTarget = normalizePathCached(filepath);\n\n        // Find chunks that:\n        // 1. Are from test files\n        // 2. Import the target file\n        const testFiles = new Set<string>();\n        for (const chunk of allChunks) {\n          const chunkFile = getCanonicalPath(chunk.metadata.file, workspaceRoot);\n\n          // Skip if not a test file\n          if (!isTestFile(chunkFile)) continue;\n\n          // Check if this test file imports the target\n          const imports = chunk.metadata.imports || [];\n          for (const imp of imports) {\n            const normalizedImport = normalizePathCached(imp);\n            if (matchesFile(normalizedImport, normalizedTarget)) {\n              testFiles.add(chunkFile);\n              break;\n            }\n          }\n        }\n\n        return Array.from(testFiles);\n      });\n\n      // Combine file chunks with related chunks and test associations\n      const filesData: Record<string, { chunks: any[]; testAssociations: string[] }> = {};\n      filepaths.forEach((filepath, i) => {\n        const fileChunks = fileChunksMap[i];\n        const relatedChunks = relatedChunksMap[i] || [];\n\n        // Deduplicate chunks (by canonical file path + line range)\n        // Use canonical paths to avoid duplicates from absolute vs relative paths\n        const seenChunks = new Set<string>();\n        const dedupedChunks = [...fileChunks, ...relatedChunks].filter(chunk => {\n          const canonicalFile = getCanonicalPath(chunk.metadata.file, workspaceRoot);\n          const chunkId = `${canonicalFile}:${chunk.metadata.startLine}-${chunk.metadata.endLine}`;\n          if (seenChunks.has(chunkId)) return false;\n          seenChunks.add(chunkId);\n          return true;\n        });\n\n        filesData[filepath] = {\n          chunks: dedupedChunks,\n          testAssociations: testAssociationsMap[i],\n        };\n      });\n\n      log(`Found ${Object.values(filesData).reduce((sum, f) => sum + f.chunks.length, 0)} total chunks`);\n\n      // Return format depends on single vs multi file\n      if (isSingleFile) {\n        // Single file: return old format for backward compatibility\n        const filepath = filepaths[0];\n        return {\n          indexInfo: getIndexMetadata(),\n          file: filepath,\n          chunks: filesData[filepath].chunks,\n          testAssociations: filesData[filepath].testAssociations,\n        };\n      } else {\n        // Multiple files: return new format\n        return {\n          indexInfo: getIndexMetadata(),\n          files: filesData,\n        };\n      }\n    }\n  )(args);\n}\n","import { wrapToolHandler } from '../utils/tool-wrapper.js';\nimport { ListFunctionsSchema } from '../schemas/index.js';\nimport type { ToolContext, MCPToolResult } from '../types.js';\n\n/**\n * Handle list_functions tool calls.\n * Fast symbol lookup by naming pattern.\n */\nexport async function handleListFunctions(\n  args: unknown,\n  ctx: ToolContext\n): Promise<MCPToolResult> {\n  const { vectorDB, log, checkAndReconnect, getIndexMetadata } = ctx;\n\n  return await wrapToolHandler(\n    ListFunctionsSchema,\n    async (validatedArgs) => {\n      log('Listing functions with symbol metadata...');\n\n      // Check if index has been updated and reconnect if needed\n      await checkAndReconnect();\n\n      let results;\n      let usedMethod = 'symbols';\n\n      try {\n        // Try using symbol-based query first (v0.5.0+)\n        results = await vectorDB.querySymbols({\n          language: validatedArgs.language,\n          pattern: validatedArgs.pattern,\n          limit: 50,\n        });\n\n        // If no results and pattern was provided, it might be an old index\n        // Fall back to content scanning\n        if (results.length === 0 && (validatedArgs.language || validatedArgs.pattern)) {\n          log('No symbol results, falling back to content scan...');\n          results = await vectorDB.scanWithFilter({\n            language: validatedArgs.language,\n            pattern: validatedArgs.pattern,\n            limit: 50,\n          });\n          usedMethod = 'content';\n        }\n      } catch (error) {\n        // If querySymbols fails (e.g., old index without symbol fields), fall back\n        log(`Symbol query failed, falling back to content scan: ${error}`);\n        results = await vectorDB.scanWithFilter({\n          language: validatedArgs.language,\n          pattern: validatedArgs.pattern,\n          limit: 50,\n        });\n        usedMethod = 'content';\n      }\n\n      log(`Found ${results.length} matches using ${usedMethod} method`);\n\n      return {\n        indexInfo: getIndexMetadata(),\n        method: usedMethod,\n        results,\n        note: usedMethod === 'content'\n          ? 'Using content search. Run \"lien reindex\" to enable faster symbol-based queries.'\n          : undefined,\n      };\n    }\n  )(args);\n}\n","import { wrapToolHandler } from '../utils/tool-wrapper.js';\nimport { GetDependentsSchema } from '../schemas/index.js';\nimport { normalizePath, matchesFile, getCanonicalPath, isTestFile } from '../utils/path-matching.js';\nimport type { ToolContext, MCPToolResult } from '../types.js';\nimport type { SearchResult } from '../../vectordb/types.js';\n\n/**\n * Complexity metrics for a single dependent file.\n */\ninterface FileComplexity {\n  filepath: string;\n  avgComplexity: number;\n  maxComplexity: number;\n  complexityScore: number; // Sum of all complexities\n  chunksWithComplexity: number;\n}\n\n/**\n * Aggregate complexity metrics for all dependents.\n */\ninterface ComplexityMetrics {\n  averageComplexity: number;\n  maxComplexity: number;\n  filesWithComplexityData: number;\n  highComplexityDependents: Array<{\n    filepath: string;\n    maxComplexity: number;\n    avgComplexity: number;\n  }>;\n  complexityRiskBoost: 'low' | 'medium' | 'high' | 'critical';\n}\n\n/**\n * Risk level thresholds for dependent count.\n * Based on impact analysis: more dependents = higher risk of breaking changes.\n */\nconst DEPENDENT_COUNT_THRESHOLDS = {\n  LOW: 5,       // Few dependents, safe to change\n  MEDIUM: 15,   // Moderate impact, review dependents\n  HIGH: 30,     // High impact, careful planning needed\n} as const;\n\n/**\n * Complexity thresholds for risk assessment.\n * Based on cyclomatic complexity: higher complexity = harder to change safely.\n */\nconst COMPLEXITY_THRESHOLDS = {\n  HIGH_COMPLEXITY_DEPENDENT: 10,  // Individual file is complex\n  CRITICAL_AVG: 15,              // Average complexity indicates systemic complexity\n  CRITICAL_MAX: 25,              // Peak complexity indicates hotspot\n  HIGH_AVG: 10,                  // Moderately complex on average\n  HIGH_MAX: 20,                  // Some complex functions exist\n  MEDIUM_AVG: 6,                 // Slightly above simple code\n  MEDIUM_MAX: 15,                // Occasional branching\n} as const;\n\n/**\n * Maximum number of chunks to scan for dependency analysis.\n * Larger codebases may have incomplete results if they exceed this limit.\n */\nconst SCAN_LIMIT = 10000;\n\n/** Risk level ordering for comparison */\nconst RISK_ORDER = { low: 0, medium: 1, high: 2, critical: 3 } as const;\ntype RiskLevel = keyof typeof RISK_ORDER;\n\n/**\n * Build import-to-chunk index for O(n) instead of O(n*m) lookup.\n */\nfunction buildImportIndex(\n  allChunks: SearchResult[],\n  normalizePathCached: (path: string) => string\n): Map<string, SearchResult[]> {\n  const importIndex = new Map<string, SearchResult[]>();\n  \n  for (const chunk of allChunks) {\n    const imports = chunk.metadata.imports || [];\n    for (const imp of imports) {\n      const normalizedImport = normalizePathCached(imp);\n      if (!importIndex.has(normalizedImport)) {\n        importIndex.set(normalizedImport, []);\n      }\n      importIndex.get(normalizedImport)!.push(chunk);\n    }\n  }\n  \n  return importIndex;\n}\n\n/**\n * Find dependent chunks using direct lookup and fuzzy matching.\n */\nfunction findDependentChunks(\n  importIndex: Map<string, SearchResult[]>,\n  normalizedTarget: string\n): SearchResult[] {\n  const dependentChunks: SearchResult[] = [];\n  const seenChunkIds = new Set<string>();\n\n  const addChunk = (chunk: SearchResult) => {\n    const chunkId = `${chunk.metadata.file}:${chunk.metadata.startLine}-${chunk.metadata.endLine}`;\n    if (!seenChunkIds.has(chunkId)) {\n      dependentChunks.push(chunk);\n      seenChunkIds.add(chunkId);\n    }\n  };\n\n  // Direct index lookup (fastest path)\n  if (importIndex.has(normalizedTarget)) {\n    for (const chunk of importIndex.get(normalizedTarget)!) {\n      addChunk(chunk);\n    }\n  }\n\n  // Fuzzy match for relative imports and path variations\n  for (const [normalizedImport, chunks] of importIndex.entries()) {\n    if (normalizedImport !== normalizedTarget && matchesFile(normalizedImport, normalizedTarget)) {\n      for (const chunk of chunks) {\n        addChunk(chunk);\n      }\n    }\n  }\n\n  return dependentChunks;\n}\n\n/**\n * Calculate complexity metrics for each file from its chunks.\n */\nfunction calculateFileComplexities(\n  chunksByFile: Map<string, SearchResult[]>\n): FileComplexity[] {\n  const fileComplexities: FileComplexity[] = [];\n\n  for (const [filepath, chunks] of chunksByFile.entries()) {\n    const complexities = chunks\n      .map(c => c.metadata.complexity)\n      .filter((c): c is number => typeof c === 'number' && c > 0);\n\n    if (complexities.length > 0) {\n      const sum = complexities.reduce((a, b) => a + b, 0);\n      fileComplexities.push({\n        filepath,\n        avgComplexity: Math.round((sum / complexities.length) * 10) / 10,\n        maxComplexity: Math.max(...complexities),\n        complexityScore: sum,\n        chunksWithComplexity: complexities.length,\n      });\n    }\n  }\n\n  return fileComplexities;\n}\n\n/**\n * Calculate overall complexity metrics from per-file complexities.\n */\nfunction calculateOverallComplexityMetrics(\n  fileComplexities: FileComplexity[]\n): ComplexityMetrics {\n  if (fileComplexities.length === 0) {\n    return {\n      averageComplexity: 0,\n      maxComplexity: 0,\n      filesWithComplexityData: 0,\n      highComplexityDependents: [],\n      complexityRiskBoost: 'low',\n    };\n  }\n\n  const allAvgs = fileComplexities.map(f => f.avgComplexity);\n  const allMaxes = fileComplexities.map(f => f.maxComplexity);\n  const totalAvg = allAvgs.reduce((a, b) => a + b, 0) / allAvgs.length;\n  const globalMax = Math.max(...allMaxes);\n\n  const highComplexityDependents = fileComplexities\n    .filter(f => f.maxComplexity > COMPLEXITY_THRESHOLDS.HIGH_COMPLEXITY_DEPENDENT)\n    .sort((a, b) => b.maxComplexity - a.maxComplexity)\n    .slice(0, 5)\n    .map(f => ({ filepath: f.filepath, maxComplexity: f.maxComplexity, avgComplexity: f.avgComplexity }));\n\n  const complexityRiskBoost = calculateComplexityRiskBoost(totalAvg, globalMax);\n\n  return {\n    averageComplexity: Math.round(totalAvg * 10) / 10,\n    maxComplexity: globalMax,\n    filesWithComplexityData: fileComplexities.length,\n    highComplexityDependents,\n    complexityRiskBoost,\n  };\n}\n\n/**\n * Calculate complexity-based risk boost level.\n */\nfunction calculateComplexityRiskBoost(avgComplexity: number, maxComplexity: number): RiskLevel {\n  if (avgComplexity > COMPLEXITY_THRESHOLDS.CRITICAL_AVG || maxComplexity > COMPLEXITY_THRESHOLDS.CRITICAL_MAX) {\n    return 'critical';\n  }\n  if (avgComplexity > COMPLEXITY_THRESHOLDS.HIGH_AVG || maxComplexity > COMPLEXITY_THRESHOLDS.HIGH_MAX) {\n    return 'high';\n  }\n  if (avgComplexity > COMPLEXITY_THRESHOLDS.MEDIUM_AVG || maxComplexity > COMPLEXITY_THRESHOLDS.MEDIUM_MAX) {\n    return 'medium';\n  }\n  return 'low';\n}\n\n/**\n * Calculate risk level based on dependent count and complexity.\n */\nfunction calculateRiskLevel(dependentCount: number, complexityRiskBoost: RiskLevel): RiskLevel {\n  let riskLevel: RiskLevel =\n    dependentCount === 0 ? 'low' :\n    dependentCount <= DEPENDENT_COUNT_THRESHOLDS.LOW ? 'low' :\n    dependentCount <= DEPENDENT_COUNT_THRESHOLDS.MEDIUM ? 'medium' :\n    dependentCount <= DEPENDENT_COUNT_THRESHOLDS.HIGH ? 'high' : 'critical';\n\n  // Boost if complexity risk is higher\n  if (RISK_ORDER[complexityRiskBoost] > RISK_ORDER[riskLevel]) {\n    riskLevel = complexityRiskBoost;\n  }\n\n  return riskLevel;\n}\n\n/**\n * Handle get_dependents tool calls.\n * Finds all code that depends on a file (reverse dependency lookup).\n */\nexport async function handleGetDependents(\n  args: unknown,\n  ctx: ToolContext\n): Promise<MCPToolResult> {\n  const { vectorDB, log, checkAndReconnect, getIndexMetadata } = ctx;\n\n  return await wrapToolHandler(\n    GetDependentsSchema,\n    async (validatedArgs) => {\n      log(`Finding dependents of: ${validatedArgs.filepath}`);\n      await checkAndReconnect();\n\n      const allChunks = await vectorDB.scanWithFilter({ limit: SCAN_LIMIT });\n      const hitLimit = allChunks.length === SCAN_LIMIT;\n      if (hitLimit) {\n        log(`Scanned ${SCAN_LIMIT} chunks (limit reached). Results may be incomplete.`, 'warning');\n      }\n      log(`Scanning ${allChunks.length} chunks for imports...`);\n\n      const workspaceRoot = process.cwd().replace(/\\\\/g, '/');\n      const pathCache = new Map<string, string>();\n      const normalizePathCached = (path: string): string => {\n        if (!pathCache.has(path)) pathCache.set(path, normalizePath(path, workspaceRoot));\n        return pathCache.get(path)!;\n      };\n\n      // Build index and find dependents\n      const importIndex = buildImportIndex(allChunks, normalizePathCached);\n      const normalizedTarget = normalizePathCached(validatedArgs.filepath);\n      const dependentChunks = findDependentChunks(importIndex, normalizedTarget);\n\n      // Group by canonical file path\n      const chunksByFile = new Map<string, typeof dependentChunks>();\n      for (const chunk of dependentChunks) {\n        const canonical = getCanonicalPath(chunk.metadata.file, workspaceRoot);\n        const existing = chunksByFile.get(canonical) || [];\n        existing.push(chunk);\n        chunksByFile.set(canonical, existing);\n      }\n\n      // Calculate metrics\n      const fileComplexities = calculateFileComplexities(chunksByFile);\n      const complexityMetrics = calculateOverallComplexityMetrics(fileComplexities);\n\n      const uniqueFiles = Array.from(chunksByFile.keys()).map(filepath => ({\n        filepath,\n        isTestFile: isTestFile(filepath),\n      }));\n\n      const riskLevel = calculateRiskLevel(uniqueFiles.length, complexityMetrics.complexityRiskBoost);\n      log(`Found ${uniqueFiles.length} dependent files (risk: ${riskLevel}${complexityMetrics.filesWithComplexityData > 0 ? ', complexity-boosted' : ''})`);\n\n      return {\n        indexInfo: getIndexMetadata(),\n        filepath: validatedArgs.filepath,\n        dependentCount: uniqueFiles.length,\n        riskLevel,\n        dependents: uniqueFiles,\n        complexityMetrics,\n        note: hitLimit ? `Warning: Scanned ${SCAN_LIMIT} chunks (limit reached). Results may be incomplete.` : undefined,\n      };\n    }\n  )(args);\n}\n","import collect from 'collect.js';\nimport { wrapToolHandler } from '../utils/tool-wrapper.js';\nimport { GetComplexitySchema } from '../schemas/index.js';\nimport { ComplexityAnalyzer } from '../../insights/complexity-analyzer.js';\nimport type { ToolContext, MCPToolResult } from '../types.js';\nimport type { ComplexityViolation, FileComplexityData } from '../../insights/types.js';\n\n/**\n * Transform a violation with file-level metadata for API response\n */\nfunction transformViolation(v: ComplexityViolation, fileData: FileComplexityData) {\n  return {\n    filepath: v.filepath,\n    symbolName: v.symbolName,\n    symbolType: v.symbolType,\n    startLine: v.startLine,\n    endLine: v.endLine,\n    complexity: v.complexity,\n    metricType: v.metricType,\n    threshold: v.threshold,\n    severity: v.severity,\n    language: v.language,\n    message: v.message,\n    dependentCount: fileData.dependentCount || 0,\n    riskLevel: fileData.riskLevel,\n    ...(v.halsteadDetails && { halsteadDetails: v.halsteadDetails }),\n  };\n}\n\n/**\n * Handle get_complexity tool calls.\n * Analyzes complexity for files or the entire codebase.\n */\nexport async function handleGetComplexity(\n  args: unknown,\n  ctx: ToolContext\n): Promise<MCPToolResult> {\n  const { vectorDB, config, log, checkAndReconnect, getIndexMetadata } = ctx;\n\n  return await wrapToolHandler(\n    GetComplexitySchema,\n    async (validatedArgs) => {\n      log('Analyzing complexity...');\n      await checkAndReconnect();\n\n      const analyzer = new ComplexityAnalyzer(vectorDB, config);\n      const report = await analyzer.analyze(validatedArgs.files);\n      log(`Analyzed ${report.summary.filesAnalyzed} files`);\n\n      // Transform violations using collect.js\n      type TransformedViolation = ReturnType<typeof transformViolation>;\n      const allViolations: TransformedViolation[] = collect(Object.entries(report.files))\n        .flatMap(([/* filepath unused */, fileData]) => \n          fileData.violations.map(v => transformViolation(v, fileData))\n        )\n        .sortByDesc('complexity')\n        .all() as unknown as TransformedViolation[];\n\n      // Apply custom threshold filter if provided\n      const violations = validatedArgs.threshold !== undefined\n        ? allViolations.filter(v => v.complexity >= validatedArgs.threshold!)\n        : allViolations;\n\n      const topViolations = violations.slice(0, validatedArgs.top);\n\n      // Calculate severity counts - countBy returns { error?: number, warning?: number }\n      const bySeverity = collect(violations).countBy('severity').all() as { error?: number; warning?: number };\n\n      return {\n        indexInfo: getIndexMetadata(),\n        summary: {\n          filesAnalyzed: report.summary.filesAnalyzed,\n          avgComplexity: report.summary.avgComplexity,\n          maxComplexity: report.summary.maxComplexity,\n          violationCount: violations.length,\n          bySeverity: {\n            error: bySeverity['error'] || 0,\n            warning: bySeverity['warning'] || 0,\n          },\n        },\n        violations: topViolations,\n      };\n    }\n  )(args);\n}\n","/**\n * Complexity analysis types for code quality insights\n */\n\n/**\n * Risk level ordering for comparison operations.\n * Higher value = higher risk.\n */\nexport const RISK_ORDER = { low: 0, medium: 1, high: 2, critical: 3 } as const;\n\n/**\n * Risk level type derived from RISK_ORDER keys\n */\nexport type RiskLevel = keyof typeof RISK_ORDER;\n\n/**\n * Type of complexity metric being measured\n */\nexport type ComplexityMetricType = 'cyclomatic' | 'cognitive' | 'halstead_effort' | 'halstead_bugs';\n\n/**\n * Halstead metric details for Halstead-type violations\n */\nexport interface HalsteadDetails {\n  volume: number;\n  difficulty: number;\n  effort: number;\n  bugs: number;\n}\n\nexport interface ComplexityViolation {\n  filepath: string;\n  startLine: number;\n  endLine: number;\n  symbolName: string;\n  symbolType: 'function' | 'method' | 'class' | 'file';\n  language: string;\n  complexity: number;\n  threshold: number;\n  severity: 'warning' | 'error';\n  message: string;\n  /** Type of complexity metric (cyclomatic vs cognitive vs halstead) */\n  metricType: ComplexityMetricType;\n  /** Halstead-specific details when metricType is halstead_* */\n  halsteadDetails?: HalsteadDetails;\n}\n\nexport interface FileComplexityData {\n  violations: ComplexityViolation[];\n  dependents: string[];\n  dependentCount?: number;\n  /** Test files associated with this source file. TODO: Populate when test-to-code mapping is implemented */\n  testAssociations: string[];\n  riskLevel: RiskLevel;\n  dependentComplexityMetrics?: {\n    averageComplexity: number;\n    maxComplexity: number;\n    filesWithComplexityData: number;\n  };\n}\n\nexport interface ComplexityReport {\n  summary: {\n    filesAnalyzed: number;\n    totalViolations: number;\n    bySeverity: { error: number; warning: number };\n    avgComplexity: number;\n    maxComplexity: number;\n  };\n  files: Record<string, FileComplexityData>;\n}\n\n","import { SearchResult } from '../vectordb/types.js';\nimport { normalizePath, getCanonicalPath, matchesFile, isTestFile } from '../mcp/utils/path-matching.js';\nimport { RISK_ORDER, RiskLevel } from '../insights/types.js';\n\n/**\n * Risk level thresholds for dependent count.\n * Based on impact analysis: more dependents = higher risk of breaking changes.\n */\nexport const DEPENDENT_COUNT_THRESHOLDS = {\n  LOW: 5,       // Few dependents, safe to change\n  MEDIUM: 15,   // Moderate impact, review dependents\n  HIGH: 30,     // High impact, careful planning needed\n} as const;\n\n/**\n * Complexity thresholds for risk assessment.\n * Based on cyclomatic complexity: higher complexity = harder to change safely.\n */\nexport const COMPLEXITY_THRESHOLDS = {\n  HIGH_COMPLEXITY_DEPENDENT: 10,  // Individual file is complex\n  CRITICAL_AVG: 15,              // Average complexity indicates systemic complexity\n  CRITICAL_MAX: 25,              // Peak complexity indicates hotspot\n  HIGH_AVG: 10,                  // Moderately complex on average\n  HIGH_MAX: 20,                  // Some complex functions exist\n  MEDIUM_AVG: 6,                 // Slightly above simple code\n  MEDIUM_MAX: 15,                // Occasional branching\n} as const;\n\nexport interface FileComplexityInfo {\n  filepath: string;\n  avgComplexity: number;\n  maxComplexity: number;\n  complexityScore: number;\n  chunksWithComplexity: number;\n}\n\nexport interface DependencyAnalysisResult {\n  dependents: Array<{\n    filepath: string;\n    isTestFile: boolean;\n  }>;\n  dependentCount: number;\n  riskLevel: RiskLevel;\n  complexityMetrics?: {\n    averageComplexity: number;\n    maxComplexity: number;\n    filesWithComplexityData: number;\n    highComplexityDependents: Array<{\n      filepath: string;\n      maxComplexity: number;\n      avgComplexity: number;\n    }>;\n    complexityRiskBoost: RiskLevel;\n  };\n}\n\n/**\n * Creates a cached path normalizer to avoid repeated string operations.\n * \n * @param workspaceRoot - The workspace root directory for path normalization\n * @returns A function that normalizes and caches file paths\n */\nfunction createPathNormalizer(workspaceRoot: string): (path: string) => string {\n  const cache = new Map<string, string>();\n  return (path: string): string => {\n    const cached = cache.get(path);\n    if (cached !== undefined) return cached;\n    const normalized = normalizePath(path, workspaceRoot);\n    cache.set(path, normalized);\n    return normalized;\n  };\n}\n\n/**\n * Builds an index mapping normalized import paths to chunks that import them.\n * Enables O(1) lookup instead of O(n*m) iteration.\n * \n * @param chunks - All chunks from the vector database\n * @param normalizePathCached - Cached path normalization function\n * @returns Map of normalized import paths to chunks that import them\n */\nfunction buildImportIndex(\n  chunks: SearchResult[],\n  normalizePathCached: (path: string) => string\n): Map<string, SearchResult[]> {\n  const importIndex = new Map<string, SearchResult[]>();\n  \n  for (const chunk of chunks) {\n    const imports = chunk.metadata.imports || [];\n    for (const imp of imports) {\n      const normalizedImport = normalizePathCached(imp);\n      let chunkList = importIndex.get(normalizedImport);\n      if (!chunkList) {\n        chunkList = [];\n        importIndex.set(normalizedImport, chunkList);\n      }\n      chunkList.push(chunk);\n    }\n  }\n  \n  return importIndex;\n}\n\n/**\n * Finds all chunks that import the target file using index + fuzzy matching.\n * \n * @param normalizedTarget - The normalized path of the target file\n * @param importIndex - Index mapping import paths to chunks\n * @returns Array of chunks that import the target file (deduplicated)\n */\nfunction findDependentChunks(\n  normalizedTarget: string,\n  importIndex: Map<string, SearchResult[]>\n): SearchResult[] {\n  const dependentChunks: SearchResult[] = [];\n  const seenChunkIds = new Set<string>();\n  \n  const addChunk = (chunk: SearchResult): void => {\n    const chunkId = `${chunk.metadata.file}:${chunk.metadata.startLine}-${chunk.metadata.endLine}`;\n    if (!seenChunkIds.has(chunkId)) {\n      dependentChunks.push(chunk);\n      seenChunkIds.add(chunkId);\n    }\n  };\n  \n  // Direct index lookup (fastest path)\n  const directMatches = importIndex.get(normalizedTarget);\n  if (directMatches) {\n    for (const chunk of directMatches) {\n      addChunk(chunk);\n    }\n  }\n  \n  // Fuzzy match for relative imports and path variations\n  // Note: This is O(M) where M = unique import paths. For large codebases with many\n  // violations, consider caching fuzzy match results at a higher level.\n  for (const [normalizedImport, chunks] of importIndex.entries()) {\n    if (normalizedImport !== normalizedTarget && matchesFile(normalizedImport, normalizedTarget)) {\n      for (const chunk of chunks) {\n        addChunk(chunk);\n      }\n    }\n  }\n  \n  return dependentChunks;\n}\n\n/**\n * Groups chunks by their canonical file path.\n * \n * @param chunks - Array of chunks to group\n * @param workspaceRoot - The workspace root directory\n * @returns Map of canonical file paths to their chunks\n */\nfunction groupChunksByFile(\n  chunks: SearchResult[],\n  workspaceRoot: string\n): Map<string, SearchResult[]> {\n  const chunksByFile = new Map<string, SearchResult[]>();\n  \n  for (const chunk of chunks) {\n    const canonical = getCanonicalPath(chunk.metadata.file, workspaceRoot);\n    let existing = chunksByFile.get(canonical);\n    if (!existing) {\n      existing = [];\n      chunksByFile.set(canonical, existing);\n    }\n    existing.push(chunk);\n  }\n  \n  return chunksByFile;\n}\n\n/**\n * Calculates complexity metrics for each file based on its chunks.\n * \n * @param chunksByFile - Map of file paths to their chunks\n * @returns Array of complexity info for files with complexity data\n */\nfunction calculateFileComplexities(\n  chunksByFile: Map<string, SearchResult[]>\n): FileComplexityInfo[] {\n  const fileComplexities: FileComplexityInfo[] = [];\n  \n  for (const [filepath, chunks] of chunksByFile.entries()) {\n    const complexities = chunks\n      .map(c => c.metadata.complexity)\n      .filter((c): c is number => typeof c === 'number' && c > 0);\n    \n    if (complexities.length > 0) {\n      const sum = complexities.reduce((a, b) => a + b, 0);\n      const avg = sum / complexities.length;\n      const max = Math.max(...complexities);\n      \n      fileComplexities.push({\n        filepath,\n        avgComplexity: Math.round(avg * 10) / 10,\n        maxComplexity: max,\n        complexityScore: sum,\n        chunksWithComplexity: complexities.length,\n      });\n    }\n  }\n  \n  return fileComplexities;\n}\n\n/**\n * Calculates overall complexity metrics from per-file data.\n * \n * @param fileComplexities - Array of per-file complexity info\n * @returns Aggregated complexity metrics, or undefined if no data\n */\nfunction calculateOverallComplexityMetrics(\n  fileComplexities: FileComplexityInfo[]\n): DependencyAnalysisResult['complexityMetrics'] | undefined {\n  if (fileComplexities.length === 0) {\n    return undefined;\n  }\n  \n  const allAvgs = fileComplexities.map(f => f.avgComplexity);\n  const allMaxes = fileComplexities.map(f => f.maxComplexity);\n  const totalAvg = allAvgs.reduce((a, b) => a + b, 0) / allAvgs.length;\n  const globalMax = Math.max(...allMaxes);\n  \n  // Identify high-complexity dependents (top 5)\n  const highComplexityDependents = fileComplexities\n    .filter(f => f.maxComplexity > COMPLEXITY_THRESHOLDS.HIGH_COMPLEXITY_DEPENDENT)\n    .sort((a, b) => b.maxComplexity - a.maxComplexity)\n    .slice(0, 5)\n    .map(f => ({\n      filepath: f.filepath,\n      maxComplexity: f.maxComplexity,\n      avgComplexity: f.avgComplexity,\n    }));\n  \n  // Calculate complexity-based risk boost\n  const complexityRiskBoost = calculateComplexityRiskBoost(totalAvg, globalMax);\n  \n  return {\n    averageComplexity: Math.round(totalAvg * 10) / 10,\n    maxComplexity: globalMax,\n    filesWithComplexityData: fileComplexities.length,\n    highComplexityDependents,\n    complexityRiskBoost,\n  };\n}\n\n/**\n * Determines risk level based on complexity thresholds.\n * \n * @param avgComplexity - Average complexity across all files\n * @param maxComplexity - Maximum complexity found in any file\n * @returns Risk level based on complexity thresholds\n */\nfunction calculateComplexityRiskBoost(avgComplexity: number, maxComplexity: number): RiskLevel {\n  if (avgComplexity > COMPLEXITY_THRESHOLDS.CRITICAL_AVG || maxComplexity > COMPLEXITY_THRESHOLDS.CRITICAL_MAX) {\n    return 'critical';\n  }\n  if (avgComplexity > COMPLEXITY_THRESHOLDS.HIGH_AVG || maxComplexity > COMPLEXITY_THRESHOLDS.HIGH_MAX) {\n    return 'high';\n  }\n  if (avgComplexity > COMPLEXITY_THRESHOLDS.MEDIUM_AVG || maxComplexity > COMPLEXITY_THRESHOLDS.MEDIUM_MAX) {\n    return 'medium';\n  }\n  return 'low';\n}\n\n/**\n * Calculates risk level based on dependent count.\n * \n * @param count - Number of dependent files\n * @returns Risk level based on dependent count thresholds\n */\nfunction calculateRiskLevelFromCount(count: number): RiskLevel {\n  if (count <= DEPENDENT_COUNT_THRESHOLDS.LOW) {\n    return 'low';\n  }\n  if (count <= DEPENDENT_COUNT_THRESHOLDS.MEDIUM) {\n    return 'medium';\n  }\n  if (count <= DEPENDENT_COUNT_THRESHOLDS.HIGH) {\n    return 'high';\n  }\n  return 'critical';\n}\n\n/**\n * Analyzes dependencies for a given file by finding all chunks that import it.\n * \n * @param targetFilepath - The file to analyze dependencies for\n * @param allChunks - All chunks from the vector database\n * @param workspaceRoot - The workspace root directory\n * @returns Dependency analysis including dependents, count, and risk level\n */\nexport function analyzeDependencies(\n  targetFilepath: string,\n  allChunks: SearchResult[],\n  workspaceRoot: string\n): DependencyAnalysisResult {\n  // Create cached path normalizer\n  const normalizePathCached = createPathNormalizer(workspaceRoot);\n  \n  // Build import index for efficient lookup\n  const importIndex = buildImportIndex(allChunks, normalizePathCached);\n  \n  // Find all dependent chunks\n  const normalizedTarget = normalizePathCached(targetFilepath);\n  const dependentChunks = findDependentChunks(normalizedTarget, importIndex);\n  \n  // Group by file for analysis\n  const chunksByFile = groupChunksByFile(dependentChunks, workspaceRoot);\n  \n  // Calculate complexity metrics\n  const fileComplexities = calculateFileComplexities(chunksByFile);\n  const complexityMetrics = calculateOverallComplexityMetrics(fileComplexities);\n  \n  // Build dependents list\n  const dependents = Array.from(chunksByFile.keys()).map(filepath => ({\n    filepath,\n    isTestFile: isTestFile(filepath),\n  }));\n  \n  // Calculate risk level\n  let riskLevel = calculateRiskLevelFromCount(dependents.length);\n  \n  // Boost risk level if complexity warrants it\n  if (complexityMetrics?.complexityRiskBoost) {\n    if (RISK_ORDER[complexityMetrics.complexityRiskBoost] > RISK_ORDER[riskLevel]) {\n      riskLevel = complexityMetrics.complexityRiskBoost;\n    }\n  }\n  \n  return {\n    dependents,\n    dependentCount: dependents.length,\n    riskLevel,\n    complexityMetrics,\n  };\n}\n","import { VectorDB } from '../vectordb/lancedb.js';\nimport { LienConfig } from '../config/schema.js';\nimport { ComplexityViolation, ComplexityReport, FileComplexityData, RISK_ORDER, RiskLevel, HalsteadDetails } from './types.js';\nimport { ChunkMetadata } from '../indexer/types.js';\nimport { analyzeDependencies } from '../indexer/dependency-analyzer.js';\nimport { SearchResult } from '../vectordb/types.js';\n\n/**\n * Hardcoded severity multipliers:\n * - Warning: triggers at 1x threshold (e.g., testPaths >= 15)\n * - Error: triggers at 2x threshold (e.g., testPaths >= 30)\n */\nconst SEVERITY = { warning: 1.0, error: 2.0 } as const;\n\n/**\n * Analyzer for code complexity based on indexed codebase\n */\nexport class ComplexityAnalyzer {\n  constructor(\n    private vectorDB: VectorDB,\n    private config: LienConfig\n  ) {}\n\n  /**\n   * Analyze complexity of codebase or specific files\n   * @param files - Optional list of specific files to analyze\n   * @returns Complexity report with violations and summary\n   */\n  async analyze(files?: string[]): Promise<ComplexityReport> {\n    // 1. Get all chunks from index (uses full scan internally for LanceDB)\n    // Note: We fetch all chunks even with --files filter because dependency analysis\n    // needs the complete dataset to find dependents accurately\n    const allChunks = await this.vectorDB.scanAll();\n    \n    // 2. Filter to specified files if provided\n    const chunks = files \n      ? allChunks.filter(c => this.matchesAnyFile(c.metadata.file, files))\n      : allChunks;\n    \n    // 3. Find violations from filtered chunks\n    const violations = this.findViolations(chunks);\n    \n    // 4. Build report - pass filtered chunks for file list, but keep violations from those files\n    const report = this.buildReport(violations, chunks);\n    \n    // 5. Enrich files with violations with dependency data\n    this.enrichWithDependencies(report, allChunks as SearchResult[]);\n    \n    return report;\n  }\n\n  /**\n   * Normalize a file path to a consistent relative format\n   * Converts absolute paths to relative paths from workspace root\n   */\n  private normalizeFilePath(filepath: string): string {\n    const workspaceRoot = process.cwd();\n    // Convert to forward slashes first\n    const normalized = filepath.replace(/\\\\/g, '/');\n    const normalizedRoot = workspaceRoot.replace(/\\\\/g, '/');\n    \n    // Convert absolute paths to relative\n    if (normalized.startsWith(normalizedRoot + '/')) {\n      return normalized.slice(normalizedRoot.length + 1);\n    }\n    if (normalized.startsWith(normalizedRoot)) {\n      return normalized.slice(normalizedRoot.length);\n    }\n    return normalized;\n  }\n\n  /**\n   * Check if a chunk's file matches any of the target files\n   * Uses exact match or suffix matching to avoid unintended matches\n   */\n  private matchesAnyFile(chunkFile: string, targetFiles: string[]): boolean {\n    // Normalize to forward slashes for cross-platform consistency\n    // Don't use path.normalize() as its behavior is platform-dependent\n    const normalizedChunkFile = chunkFile.replace(/\\\\/g, '/');\n    return targetFiles.some(target => {\n      const normalizedTarget = target.replace(/\\\\/g, '/');\n      // Exact match or target is a suffix of the chunk file\n      return normalizedChunkFile === normalizedTarget || \n             normalizedChunkFile.endsWith('/' + normalizedTarget);\n    });\n  }\n\n  /**\n   * Create a violation if complexity exceeds threshold\n   */\n  private createViolation(\n    metadata: ChunkMetadata,\n    complexity: number,\n    baseThreshold: number,\n    metricType: ComplexityViolation['metricType']\n  ): ComplexityViolation | null {\n    const warningThreshold = baseThreshold * SEVERITY.warning;\n    const errorThreshold = baseThreshold * SEVERITY.error;\n\n    if (complexity < warningThreshold) return null;\n\n    const violationSeverity = complexity >= errorThreshold ? 'error' : 'warning';\n    const effectiveThreshold = violationSeverity === 'error' ? errorThreshold : warningThreshold;\n    \n    // Human-friendly messages\n    const message = metricType === 'cyclomatic'\n      ? `Needs ~${complexity} test cases for full coverage (threshold: ${Math.round(effectiveThreshold)})`\n      : `Mental load ${complexity} exceeds threshold ${Math.round(effectiveThreshold)} (hard to follow)`;\n\n    return {\n      filepath: metadata.file,\n      startLine: metadata.startLine,\n      endLine: metadata.endLine,\n      symbolName: metadata.symbolName || 'unknown',\n      symbolType: metadata.symbolType as 'function' | 'method',\n      language: metadata.language,\n      complexity,\n      threshold: Math.round(effectiveThreshold),\n      severity: violationSeverity,\n      message,\n      metricType,\n    };\n  }\n\n  /**\n   * Deduplicate and filter chunks to only function/method types.\n   * Handles potential index duplicates by tracking file+line ranges.\n   */\n  private getUniqueFunctionChunks(\n    chunks: Array<{ content: string; metadata: ChunkMetadata }>\n  ): ChunkMetadata[] {\n    const seen = new Set<string>();\n    const result: ChunkMetadata[] = [];\n    \n    for (const { metadata } of chunks) {\n      if (metadata.symbolType !== 'function' && metadata.symbolType !== 'method') continue;\n      \n      const key = `${metadata.file}:${metadata.startLine}-${metadata.endLine}`;\n      if (seen.has(key)) continue;\n      \n      seen.add(key);\n      result.push(metadata);\n    }\n    \n    return result;\n  }\n\n  /**\n   * Convert Halstead effort to time in minutes.\n   * Formula: Time (seconds) = Effort / 18 (Stroud number for mental discrimination)\n   *          Time (minutes) = Effort / (18 * 60) = Effort / 1080\n   */\n  private effortToMinutes(effort: number): number {\n    return effort / 1080;\n  }\n\n  /**\n   * Format minutes as human-readable time (e.g., \"2h 30m\" or \"45m\")\n   */\n  private formatTime(minutes: number): string {\n    if (minutes >= 60) {\n      const hours = Math.floor(minutes / 60);\n      const mins = Math.round(minutes % 60);\n      return mins > 0 ? `${hours}h ${mins}m` : `${hours}h`;\n    }\n    return `${Math.round(minutes)}m`;\n  }\n\n  /**\n   * Create a Halstead violation if metrics exceed thresholds\n   */\n  private createHalsteadViolation(\n    metadata: ChunkMetadata,\n    metricValue: number,\n    threshold: number,\n    metricType: 'halstead_effort' | 'halstead_bugs'\n  ): ComplexityViolation | null {\n    const warningThreshold = threshold * SEVERITY.warning;\n    const errorThreshold = threshold * SEVERITY.error;\n\n    if (metricValue < warningThreshold) return null;\n\n    const violationSeverity = metricValue >= errorThreshold ? 'error' : 'warning';\n    const effectiveThreshold = violationSeverity === 'error' ? errorThreshold : warningThreshold;\n    \n    // For effort, show time in minutes; for bugs, show decimal with 2 places\n    let message: string;\n    if (metricType === 'halstead_effort') {\n      const timeMinutes = this.effortToMinutes(metricValue);\n      const thresholdMinutes = this.effortToMinutes(effectiveThreshold);\n      message = `Time to understand ~${this.formatTime(timeMinutes)} exceeds threshold ${this.formatTime(thresholdMinutes)}`;\n    } else {\n      message = `Estimated bugs ${metricValue.toFixed(2)} exceeds threshold ${effectiveThreshold.toFixed(1)}`;\n    }\n\n    const halsteadDetails: HalsteadDetails = {\n      volume: metadata.halsteadVolume || 0,\n      difficulty: metadata.halsteadDifficulty || 0,\n      effort: metadata.halsteadEffort || 0,\n      bugs: metadata.halsteadBugs || 0,\n    };\n\n    // Store human-scale values for complexity/threshold:\n    // - halstead_effort: rounded to integer minutes for readability (typical values 60-300)\n    // - halstead_bugs: kept as decimal for precision (typical values < 5, e.g. 1.5, 2.27)\n    let complexity: number;\n    let displayThreshold: number;\n    if (metricType === 'halstead_effort') {\n      // Convert raw effort to minutes and round for comparable deltas\n      complexity = Math.round(this.effortToMinutes(metricValue));\n      displayThreshold = Math.round(this.effortToMinutes(effectiveThreshold));\n    } else {\n      // halstead_bugs: store as decimal for precision in small values\n      complexity = metricValue;\n      displayThreshold = effectiveThreshold;\n    }\n\n    return {\n      filepath: metadata.file,\n      startLine: metadata.startLine,\n      endLine: metadata.endLine,\n      symbolName: metadata.symbolName || 'unknown',\n      symbolType: metadata.symbolType as 'function' | 'method',\n      language: metadata.language,\n      complexity,\n      threshold: displayThreshold,\n      severity: violationSeverity,\n      message,\n      metricType,\n      halsteadDetails,\n    };\n  }\n\n  /**\n   * Check complexity metrics and create violations for a single chunk.\n   */\n  private checkChunkComplexity(\n    metadata: ChunkMetadata,\n    thresholds: { testPaths: number; mentalLoad: number; halsteadEffort?: number; estimatedBugs?: number }\n  ): ComplexityViolation[] {\n    const violations: ComplexityViolation[] = [];\n    \n    // Check test paths (cyclomatic complexity)\n    if (metadata.complexity) {\n      const v = this.createViolation(metadata, metadata.complexity, thresholds.testPaths, 'cyclomatic');\n      if (v) violations.push(v);\n    }\n    \n    // Check mental load (cognitive complexity)\n    if (metadata.cognitiveComplexity) {\n      const v = this.createViolation(metadata, metadata.cognitiveComplexity, thresholds.mentalLoad, 'cognitive');\n      if (v) violations.push(v);\n    }\n    \n    // Check time to understand (Halstead effort)\n    if (thresholds.halsteadEffort && metadata.halsteadEffort) {\n      const v = this.createHalsteadViolation(metadata, metadata.halsteadEffort, thresholds.halsteadEffort, 'halstead_effort');\n      if (v) violations.push(v);\n    }\n    \n    // Check estimated bugs\n    if (thresholds.estimatedBugs && metadata.halsteadBugs) {\n      const v = this.createHalsteadViolation(metadata, metadata.halsteadBugs, thresholds.estimatedBugs, 'halstead_bugs');\n      if (v) violations.push(v);\n    }\n    \n    return violations;\n  }\n\n  /**\n   * Convert time in minutes to Halstead effort.\n   * This is the inverse of effortToMinutes().\n   * Formula: Time (seconds) = Effort / 18 (Stroud number)\n   *          So: Effort = Time (minutes) * 60 * 18 = Time * 1080\n   */\n  private minutesToEffort(minutes: number): number {\n    return minutes * 1080;\n  }\n\n  /**\n   * Find all complexity violations based on thresholds.\n   * Checks cyclomatic, cognitive, and Halstead complexity.\n   */\n  private findViolations(chunks: Array<{ content: string; metadata: ChunkMetadata }>): ComplexityViolation[] {\n    const configThresholds = this.config.complexity?.thresholds;\n    \n    // Convert timeToUnderstandMinutes to effort internally\n    const halsteadEffort = configThresholds?.timeToUnderstandMinutes \n      ? this.minutesToEffort(configThresholds.timeToUnderstandMinutes)\n      : this.minutesToEffort(60); // Default: 60 minutes = 64,800 effort\n    \n    const thresholds = { \n      testPaths: configThresholds?.testPaths ?? 15, \n      mentalLoad: configThresholds?.mentalLoad ?? 15, \n      halsteadEffort, // Converted from minutes to effort internally (see above)\n      estimatedBugs: configThresholds?.estimatedBugs ?? 1.5, // Direct decimal value (no conversion needed)\n    };\n    const functionChunks = this.getUniqueFunctionChunks(chunks);\n    \n    return functionChunks.flatMap(metadata => \n      this.checkChunkComplexity(metadata, thresholds)\n    );\n  }\n\n  /**\n   * Build the final report with summary and per-file data\n   */\n  private buildReport(\n    violations: ComplexityViolation[],\n    allChunks: Array<{ content: string; metadata: ChunkMetadata }>\n  ): ComplexityReport {\n    // Normalize violation filepaths and group by normalized path\n    const fileViolationsMap = new Map<string, ComplexityViolation[]>();\n    for (const violation of violations) {\n      const normalizedPath = this.normalizeFilePath(violation.filepath);\n      // Update violation's filepath to normalized form\n      violation.filepath = normalizedPath;\n      const existing = fileViolationsMap.get(normalizedPath) || [];\n      existing.push(violation);\n      fileViolationsMap.set(normalizedPath, existing);\n    }\n\n    // Get unique files from all analyzed chunks, normalized to relative paths\n    const analyzedFiles = new Set(allChunks.map(c => this.normalizeFilePath(c.metadata.file)));\n\n    // Build file data\n    const files: Record<string, FileComplexityData> = {};\n    for (const filepath of analyzedFiles) {\n      const fileViolations = fileViolationsMap.get(filepath) || [];\n      files[filepath] = {\n        violations: fileViolations,\n        dependents: [], // Will be enriched later if needed\n        testAssociations: [], // Will be enriched later if needed\n        riskLevel: this.calculateRiskLevel(fileViolations),\n      };\n    }\n\n    // Calculate summary statistics\n    const errorCount = violations.filter(v => v.severity === 'error').length;\n    const warningCount = violations.filter(v => v.severity === 'warning').length;\n\n    // Calculate average and max complexity from all chunks with complexity data\n    const complexityValues = allChunks\n      .filter(c => c.metadata.complexity !== undefined && c.metadata.complexity > 0)\n      .map(c => c.metadata.complexity!);\n\n    const avgComplexity = complexityValues.length > 0\n      ? complexityValues.reduce((sum, val) => sum + val, 0) / complexityValues.length\n      : 0;\n\n    const maxComplexity = complexityValues.length > 0\n      ? Math.max(...complexityValues)\n      : 0;\n\n    return {\n      summary: {\n        filesAnalyzed: analyzedFiles.size,\n        totalViolations: violations.length,\n        bySeverity: { error: errorCount, warning: warningCount },\n        avgComplexity: Math.round(avgComplexity * 10) / 10, // Round to 1 decimal\n        maxComplexity,\n      },\n      files,\n    };\n  }\n\n  /**\n   * Calculate risk level based on violations\n   */\n  private calculateRiskLevel(violations: ComplexityViolation[]): RiskLevel {\n    if (violations.length === 0) return 'low';\n\n    const hasErrors = violations.some(v => v.severity === 'error');\n    const errorCount = violations.filter(v => v.severity === 'error').length;\n\n    if (errorCount >= 3) return 'critical';\n    if (hasErrors) return 'high';\n    if (violations.length >= 3) return 'medium';\n    return 'low';\n  }\n\n  /**\n   * Enrich files with violations with dependency data\n   * This adds:\n   * - List of dependent files (who imports this?)\n   * - Boosted risk level based on dependents + complexity\n   */\n  private enrichWithDependencies(\n    report: ComplexityReport,\n    allChunks: SearchResult[]\n  ): void {\n    const workspaceRoot = process.cwd();\n\n    // Only enrich files that have violations (to save computation)\n    const filesWithViolations = Object.entries(report.files)\n      .filter(([_, data]) => data.violations.length > 0)\n      .map(([filepath, _]) => filepath);\n\n    for (const filepath of filesWithViolations) {\n      const fileData = report.files[filepath];\n      \n      // Analyze dependencies for this file\n      const depAnalysis = analyzeDependencies(filepath, allChunks, workspaceRoot);\n      \n      // Update file data with dependency information\n      fileData.dependents = depAnalysis.dependents.map(d => d.filepath);\n      fileData.dependentCount = depAnalysis.dependentCount;\n      \n      // Boost risk level based on dependency analysis\n      // Take the higher of the two risk levels\n      if (RISK_ORDER[depAnalysis.riskLevel] > RISK_ORDER[fileData.riskLevel]) {\n        fileData.riskLevel = depAnalysis.riskLevel;\n      }\n      \n      // Add complexity metrics if available\n      if (depAnalysis.complexityMetrics) {\n        fileData.dependentComplexityMetrics = {\n          averageComplexity: depAnalysis.complexityMetrics.averageComplexity,\n          maxComplexity: depAnalysis.complexityMetrics.maxComplexity,\n          filesWithComplexityData: depAnalysis.complexityMetrics.filesWithComplexityData,\n        };\n      }\n    }\n  }\n}\n\n","/**\n * MCP Tool Handler Registry\n *\n * This module exports all tool handlers and a registry mapping tool names to handlers.\n * The registry is used by the MCP server to dispatch tool calls.\n */\n\nimport { handleSemanticSearch } from './semantic-search.js';\nimport { handleFindSimilar } from './find-similar.js';\nimport { handleGetFilesContext } from './get-files-context.js';\nimport { handleListFunctions } from './list-functions.js';\nimport { handleGetDependents } from './get-dependents.js';\nimport { handleGetComplexity } from './get-complexity.js';\nimport type { ToolHandler } from '../types.js';\n\n// Re-export individual handlers for direct use if needed\nexport {\n  handleSemanticSearch,\n  handleFindSimilar,\n  handleGetFilesContext,\n  handleListFunctions,\n  handleGetDependents,\n  handleGetComplexity,\n};\n\n/**\n * Registry mapping MCP tool names to their handler functions.\n * Used by the MCP server to dispatch tool calls.\n */\nexport const toolHandlers: Record<string, ToolHandler> = {\n  'semantic_search': handleSemanticSearch,\n  'find_similar': handleFindSimilar,\n  'get_files_context': handleGetFilesContext,\n  'list_functions': handleListFunctions,\n  'get_dependents': handleGetDependents,\n  'get_complexity': handleGetComplexity,\n};\n","import chokidar from 'chokidar';\nimport { LienConfig, LegacyLienConfig, isLegacyConfig, isModernConfig } from '../config/schema.js';\n\nexport interface FileChangeEvent {\n  type: 'add' | 'change' | 'unlink';\n  filepath: string;\n}\n\nexport type FileChangeHandler = (event: FileChangeEvent) => void | Promise<void>;\n\n/**\n * File watcher service that monitors code files for changes.\n * Uses chokidar for robust file watching with debouncing support.\n */\nexport class FileWatcher {\n  private watcher: chokidar.FSWatcher | null = null;\n  private debounceTimers: Map<string, NodeJS.Timeout> = new Map();\n  private config: LienConfig | LegacyLienConfig;\n  private rootDir: string;\n  private onChangeHandler: FileChangeHandler | null = null;\n  \n  constructor(rootDir: string, config: LienConfig | LegacyLienConfig) {\n    this.rootDir = rootDir;\n    this.config = config;\n  }\n  \n  /**\n   * Starts watching files for changes.\n   * \n   * @param handler - Callback function called when files change\n   */\n  async start(handler: FileChangeHandler): Promise<void> {\n    if (this.watcher) {\n      throw new Error('File watcher is already running');\n    }\n    \n    this.onChangeHandler = handler;\n    \n    // Get watch patterns based on config type\n    let includePatterns: string[];\n    let excludePatterns: string[];\n    \n    if (isLegacyConfig(this.config)) {\n      includePatterns = this.config.indexing.include;\n      excludePatterns = this.config.indexing.exclude;\n    } else if (isModernConfig(this.config)) {\n      // For modern configs, aggregate patterns from all frameworks\n      includePatterns = this.config.frameworks.flatMap(f => f.config.include);\n      excludePatterns = this.config.frameworks.flatMap(f => f.config.exclude);\n    } else {\n      includePatterns = ['**/*'];\n      excludePatterns = [];\n    }\n    \n    // Configure chokidar\n    this.watcher = chokidar.watch(includePatterns, {\n      cwd: this.rootDir,\n      ignored: excludePatterns,\n      persistent: true,\n      ignoreInitial: true, // Don't trigger for existing files\n      awaitWriteFinish: {\n        stabilityThreshold: 500, // Wait 500ms for file to stop changing\n        pollInterval: 100,\n      },\n      // Performance optimizations\n      usePolling: false,\n      interval: 100,\n      binaryInterval: 300,\n    });\n    \n    // Register event handlers with debouncing\n    this.watcher\n      .on('add', (filepath) => this.handleChange('add', filepath))\n      .on('change', (filepath) => this.handleChange('change', filepath))\n      .on('unlink', (filepath) => this.handleChange('unlink', filepath))\n      .on('error', (error) => {\n        console.error(`[Lien] File watcher error: ${error}`);\n      });\n    \n    // Wait for watcher to be ready\n    await new Promise<void>((resolve) => {\n      this.watcher!.on('ready', () => {\n        resolve();\n      });\n    });\n  }\n  \n  /**\n   * Handles a file change event with debouncing.\n   * Debouncing prevents rapid reindexing when files are saved multiple times quickly.\n   */\n  private handleChange(type: 'add' | 'change' | 'unlink', filepath: string): void {\n    // Clear existing debounce timer for this file\n    const existingTimer = this.debounceTimers.get(filepath);\n    if (existingTimer) {\n      clearTimeout(existingTimer);\n    }\n    \n    // Set new debounce timer\n    const timer = setTimeout(() => {\n      this.debounceTimers.delete(filepath);\n      \n      // Call handler\n      if (this.onChangeHandler) {\n        const absolutePath = filepath.startsWith('/')\n          ? filepath\n          : `${this.rootDir}/${filepath}`;\n        \n        try {\n          const result = this.onChangeHandler({\n            type,\n            filepath: absolutePath,\n          });\n          \n          // Handle async handlers\n          if (result instanceof Promise) {\n            result.catch((error) => {\n              console.error(`[Lien] Error handling file change: ${error}`);\n            });\n          }\n        } catch (error) {\n          console.error(`[Lien] Error handling file change: ${error}`);\n        }\n      }\n    }, this.config.fileWatching.debounceMs);\n    \n    this.debounceTimers.set(filepath, timer);\n  }\n  \n  /**\n   * Stops the file watcher and cleans up resources.\n   */\n  async stop(): Promise<void> {\n    if (!this.watcher) {\n      return;\n    }\n    \n    // Clear all pending debounce timers\n    for (const timer of this.debounceTimers.values()) {\n      clearTimeout(timer);\n    }\n    this.debounceTimers.clear();\n    \n    // Close watcher\n    await this.watcher.close();\n    this.watcher = null;\n    this.onChangeHandler = null;\n  }\n  \n  /**\n   * Gets the list of files currently being watched.\n   */\n  getWatchedFiles(): string[] {\n    if (!this.watcher) {\n      return [];\n    }\n    \n    const watched = this.watcher.getWatched();\n    const files: string[] = [];\n    \n    for (const [dir, filenames] of Object.entries(watched)) {\n      for (const filename of filenames) {\n        files.push(`${dir}/${filename}`);\n      }\n    }\n    \n    return files;\n  }\n  \n  /**\n   * Checks if the watcher is currently running.\n   */\n  isRunning(): boolean {\n    return this.watcher !== null;\n  }\n}\n\n","import chalk from 'chalk';\nimport fs from 'fs';\nimport path from 'path';\nimport { VectorDB } from '../vectordb/lancedb.js';\nimport { configService } from '../config/service.js';\nimport { ComplexityAnalyzer } from '../insights/complexity-analyzer.js';\nimport { formatReport, OutputFormat } from '../insights/formatters/index.js';\nimport type { LienConfig, LegacyLienConfig } from '../config/schema.js';\n\ninterface ComplexityOptions {\n  files?: string[];\n  format: OutputFormat;\n  threshold?: string;\n  cyclomaticThreshold?: string;\n  cognitiveThreshold?: string;\n  failOn?: 'error' | 'warning';\n}\n\n/** Parsed threshold overrides */\ninterface ThresholdOverrides {\n  cyclomatic: number | null;\n  cognitive: number | null;\n}\n\nconst VALID_FAIL_ON = ['error', 'warning'];\nconst VALID_FORMATS = ['text', 'json', 'sarif'];\n\n/** Validate --fail-on option */\nfunction validateFailOn(failOn: string | undefined): void {\n  if (failOn && !VALID_FAIL_ON.includes(failOn)) {\n    console.error(chalk.red(`Error: Invalid --fail-on value \"${failOn}\". Must be either 'error' or 'warning'`));\n    process.exit(1);\n  }\n}\n\n/** Validate --format option */\nfunction validateFormat(format: string): void {\n  if (!VALID_FORMATS.includes(format)) {\n    console.error(chalk.red(`Error: Invalid --format value \"${format}\". Must be one of: text, json, sarif`));\n    process.exit(1);\n  }\n}\n\n/** Validate that specified files exist */\nfunction validateFilesExist(files: string[] | undefined, rootDir: string): void {\n  if (!files || files.length === 0) return;\n  \n  const missingFiles = files.filter(file => {\n    const fullPath = path.isAbsolute(file) ? file : path.join(rootDir, file);\n    return !fs.existsSync(fullPath);\n  });\n  \n  if (missingFiles.length > 0) {\n    console.error(chalk.red(`Error: File${missingFiles.length > 1 ? 's' : ''} not found:`));\n    missingFiles.forEach(file => console.error(chalk.red(`  - ${file}`)));\n    process.exit(1);\n  }\n}\n\n/** Parse and validate a threshold value */\nfunction parseThresholdValue(value: string | undefined, flagName: string): number | null {\n  if (!value) return null;\n  \n  const parsed = parseInt(value, 10);\n  if (isNaN(parsed)) {\n    console.error(chalk.red(`Error: Invalid ${flagName} value \"${value}\". Must be a number`));\n    process.exit(1);\n  }\n  if (parsed <= 0) {\n    console.error(chalk.red(`Error: Invalid ${flagName} value \"${value}\". Must be a positive number`));\n    process.exit(1);\n  }\n  return parsed;\n}\n\n/** Parse all threshold options into overrides */\nfunction parseThresholdOverrides(options: ComplexityOptions): ThresholdOverrides {\n  const baseThreshold = parseThresholdValue(options.threshold, '--threshold');\n  const cyclomaticOverride = parseThresholdValue(options.cyclomaticThreshold, '--cyclomatic-threshold');\n  const cognitiveOverride = parseThresholdValue(options.cognitiveThreshold, '--cognitive-threshold');\n  \n  return {\n    // Specific flags take precedence over --threshold\n    cyclomatic: cyclomaticOverride ?? baseThreshold,\n    cognitive: cognitiveOverride ?? baseThreshold,\n  };\n}\n\n/** Apply threshold overrides to config (mutates config) */\nfunction applyThresholdOverrides(config: LienConfig | LegacyLienConfig, overrides: ThresholdOverrides): void {\n  if (overrides.cyclomatic === null && overrides.cognitive === null) return;\n  \n  // Cast to allow mutation - both config types support complexity at runtime\n  const cfg = config as { complexity?: LienConfig['complexity'] };\n  \n  // Ensure complexity config structure exists\n  if (!cfg.complexity) {\n    cfg.complexity = {\n      enabled: true,\n      thresholds: { testPaths: 15, mentalLoad: 15 },\n    };\n  } else if (!cfg.complexity.thresholds) {\n    cfg.complexity.thresholds = { testPaths: 15, mentalLoad: 15 };\n  }\n  \n  // Apply overrides (CLI flags use --cyclomatic/--cognitive for familiarity)\n  if (overrides.cyclomatic !== null) {\n    cfg.complexity.thresholds.testPaths = overrides.cyclomatic;\n  }\n  if (overrides.cognitive !== null) {\n    cfg.complexity.thresholds.mentalLoad = overrides.cognitive;\n  }\n}\n\n/** Check if index exists */\nasync function ensureIndexExists(vectorDB: VectorDB): Promise<void> {\n  try {\n    await vectorDB.scanWithFilter({ limit: 1 });\n  } catch {\n    console.error(chalk.red('Error: Index not found'));\n    console.log(chalk.yellow('\\nRun'), chalk.bold('lien index'), chalk.yellow('to index your codebase first'));\n    process.exit(1);\n  }\n}\n\n/**\n * Analyze code complexity from indexed codebase\n */\nexport async function complexityCommand(options: ComplexityOptions) {\n  const rootDir = process.cwd();\n  \n  try {\n    // Validate options\n    validateFailOn(options.failOn);\n    validateFormat(options.format);\n    validateFilesExist(options.files, rootDir);\n    const thresholdOverrides = parseThresholdOverrides(options);\n    \n    // Load config and database\n    const config = await configService.load(rootDir);\n    const vectorDB = new VectorDB(rootDir);\n    await vectorDB.initialize();\n    await ensureIndexExists(vectorDB);\n    \n    // Apply threshold overrides if provided\n    applyThresholdOverrides(config, thresholdOverrides);\n    \n    // Run analysis and output\n    const analyzer = new ComplexityAnalyzer(vectorDB, config);\n    const report = await analyzer.analyze(options.files);\n    console.log(formatReport(report, options.format));\n    \n    // Exit code for CI integration\n    if (options.failOn) {\n      const hasViolations = options.failOn === 'error' \n        ? report.summary.bySeverity.error > 0\n        : report.summary.totalViolations > 0;\n      if (hasViolations) process.exit(1);\n    }\n  } catch (error) {\n    console.error(chalk.red('Error analyzing complexity:'), error);\n    process.exit(1);\n  }\n}\n\n","import chalk from 'chalk';\nimport { ComplexityReport, ComplexityViolation, FileComplexityData } from '../types.js';\n\n/**\n * Violation with associated file path for rendering\n */\ntype ViolationWithFile = ComplexityViolation & { file: string };\n\n/**\n * Get the display label for a metric type\n */\nfunction getMetricLabel(metricType: ComplexityViolation['metricType']): string {\n  switch (metricType) {\n    case 'cognitive': return '🧠 Mental load';\n    case 'cyclomatic': return '🔀 Test paths';\n    case 'halstead_effort': return '⏱️ Time to understand';\n    case 'halstead_bugs': return '🐛 Estimated bugs';\n    default: return 'Complexity';\n  }\n}\n\n/**\n * Convert Halstead effort to time in minutes\n */\nfunction effortToMinutes(effort: number): number {\n  return effort / 1080;\n}\n\n/**\n * Format minutes as human-readable time\n */\nfunction formatTime(minutes: number): string {\n  if (minutes >= 60) {\n    const hours = Math.floor(minutes / 60);\n    const mins = Math.round(minutes % 60);\n    return mins > 0 ? `${hours}h ${mins}m` : `${hours}h`;\n  }\n  return `${Math.round(minutes)}m`;\n}\n\n/**\n * Format Halstead details as additional lines\n */\nfunction formatHalsteadDetails(violation: ViolationWithFile): string[] {\n  if (!violation.halsteadDetails) return [];\n  \n  const { volume, difficulty, effort, bugs } = violation.halsteadDetails;\n  const timeStr = formatTime(effortToMinutes(effort));\n  return [\n    chalk.dim(`    📊  Volume: ${Math.round(volume).toLocaleString()}, Difficulty: ${difficulty.toFixed(1)}`),\n    chalk.dim(`    ⏱️  Time: ~${timeStr}, Est. bugs: ${bugs.toFixed(2)}`),\n  ];\n}\n\n/**\n * Metric-specific formatters for complexity/threshold display.\n * Each formatter returns { complexity, threshold } as display strings.\n */\ntype MetricFormatter = (val: number, thresh: number) => { complexity: string; threshold: string };\n\nconst metricFormatters: Record<string, MetricFormatter> = {\n  halstead_effort: (val, thresh) => ({\n    // val/thresh are already in minutes (human-scale)\n    complexity: '~' + formatTime(val),\n    threshold: formatTime(thresh),\n  }),\n  halstead_bugs: (val, thresh) => ({\n    complexity: val.toFixed(2),\n    threshold: thresh.toFixed(1),\n  }),\n  cyclomatic: (val, thresh) => ({\n    complexity: `${val} (needs ~${val} tests)`,\n    threshold: thresh.toString(),\n  }),\n};\n\nconst defaultFormatter: MetricFormatter = (val, thresh) => ({\n  complexity: val.toString(),\n  threshold: thresh.toString(),\n});\n\n/**\n * Format symbol name with appropriate suffix\n */\nfunction formatSymbolDisplay(violation: ViolationWithFile, isBold: boolean): string {\n  const display = ['function', 'method'].includes(violation.symbolType)\n    ? `${violation.symbolName}()`\n    : violation.symbolName;\n  return isBold ? chalk.bold(display) : display;\n}\n\n/**\n * Format dependency impact information\n */\nfunction formatDependencyInfo(fileData: FileComplexityData): string[] {\n  const depCount = fileData.dependentCount ?? fileData.dependents.length;\n  if (depCount === 0) return [];\n\n  const lines = [chalk.dim(`    📦  Imported by ${depCount} file${depCount !== 1 ? 's' : ''}`)];\n  \n  if (fileData.dependentComplexityMetrics) {\n    const { averageComplexity, maxComplexity } = fileData.dependentComplexityMetrics;\n    lines.push(chalk.dim(`    - Dependent avg complexity: ${averageComplexity}, max: ${maxComplexity}`));\n  }\n  \n  return lines;\n}\n\n/**\n * Format percentage over threshold\n */\nfunction formatPercentageOver(complexity: number, threshold: number): string {\n  if (threshold <= 0) return 'N/A (invalid threshold)';\n  return `${Math.round(((complexity - threshold) / threshold) * 100)}% over threshold`;\n}\n\n/**\n * Format a single violation entry with its metadata\n */\nfunction formatViolation(\n  violation: ViolationWithFile,\n  fileData: FileComplexityData,\n  colorFn: typeof chalk.red | typeof chalk.yellow,\n  isBold: boolean\n): string[] {\n  const symbolText = formatSymbolDisplay(violation, isBold);\n  const metricLabel = getMetricLabel(violation.metricType);\n  const formatter = metricFormatters[violation.metricType] || defaultFormatter;\n  const { complexity: complexityDisplay, threshold: thresholdDisplay } = formatter(violation.complexity, violation.threshold);\n\n  return [\n    colorFn(`  ${violation.file}:${violation.startLine}`) + chalk.dim(' - ') + symbolText,\n    chalk.dim(`    ${metricLabel}: ${complexityDisplay} (threshold: ${thresholdDisplay})`),\n    chalk.dim(`    ⬆️  ${formatPercentageOver(violation.complexity, violation.threshold)}`),\n    ...formatHalsteadDetails(violation),\n    ...formatDependencyInfo(fileData),\n    chalk.dim(`    ⚠️  Risk: ${fileData.riskLevel.toUpperCase()}`),\n    '',\n  ];\n}\n\n/**\n * Format complexity report as human-readable text with colors\n */\nexport function formatTextReport(report: ComplexityReport): string {\n  const lines: string[] = [];\n\n  // Header\n  lines.push(chalk.bold('🔍 Complexity Analysis\\n'));\n\n  // Summary\n  lines.push(chalk.bold('Summary:'));\n  lines.push(chalk.dim('  Files analyzed: ') + report.summary.filesAnalyzed.toString());\n  const errorText = `${report.summary.bySeverity.error} error${report.summary.bySeverity.error !== 1 ? 's' : ''}`;\n  const warningText = `${report.summary.bySeverity.warning} warning${report.summary.bySeverity.warning !== 1 ? 's' : ''}`;\n  lines.push(chalk.dim('  Violations: ') + `${report.summary.totalViolations} (${errorText}, ${warningText})`);\n  lines.push(chalk.dim('  Average complexity: ') + report.summary.avgComplexity.toString());\n  lines.push(chalk.dim('  Max complexity: ') + report.summary.maxComplexity.toString());\n  lines.push('');\n\n  // Group violations by file\n  const filesWithViolations = Object.entries(report.files)\n    .filter(([_, data]) => data.violations.length > 0)\n    .sort((a, b) => b[1].violations.length - a[1].violations.length);\n\n  if (filesWithViolations.length === 0) {\n    lines.push(chalk.green('✓ No violations found!'));\n    return lines.join('\\n');\n  }\n\n  // Errors section\n  const errors = filesWithViolations.flatMap(([file, data]) =>\n    data.violations.filter(v => v.severity === 'error').map(v => ({ file, ...v }))\n  );\n\n  if (errors.length > 0) {\n    lines.push(chalk.red.bold('❌ Errors:\\n'));\n    for (const error of errors) {\n      lines.push(...formatViolation(error, report.files[error.file], chalk.red, true));\n    }\n  }\n\n  // Warnings section\n  const warnings = filesWithViolations.flatMap(([file, data]) =>\n    data.violations.filter(v => v.severity === 'warning').map(v => ({ file, ...v }))\n  );\n\n  if (warnings.length > 0) {\n    lines.push(chalk.yellow.bold('⚠️  Warnings:\\n'));\n    for (const warning of warnings) {\n      lines.push(...formatViolation(warning, report.files[warning.file], chalk.yellow, false));\n    }\n  }\n\n  return lines.join('\\n');\n}\n\n","import { ComplexityReport } from '../types.js';\n\n/**\n * Format complexity report as JSON for consumption by GitHub Action\n */\nexport function formatJsonReport(report: ComplexityReport): string {\n  return JSON.stringify(report, null, 2);\n}\n\n","import { ComplexityReport } from '../types.js';\n\n/**\n * SARIF (Static Analysis Results Interchange Format) 2.1.0\n * Used by GitHub Code Scanning to show results in Security tab\n * https://docs.github.com/en/code-security/code-scanning/integrating-with-code-scanning/sarif-support-for-code-scanning\n */\ninterface SarifReport {\n  $schema: string;\n  version: string;\n  runs: SarifRun[];\n}\n\ninterface SarifRun {\n  tool: {\n    driver: {\n      name: string;\n      version: string;\n      informationUri?: string;\n      rules?: SarifRule[];\n    };\n  };\n  results: SarifResult[];\n}\n\ninterface SarifRule {\n  id: string;\n  shortDescription: {\n    text: string;\n  };\n  fullDescription?: {\n    text: string;\n  };\n  help?: {\n    text: string;\n  };\n  defaultConfiguration?: {\n    level: 'warning' | 'error' | 'note';\n  };\n}\n\ninterface SarifResult {\n  ruleId: string;\n  level: 'warning' | 'error' | 'note';\n  message: {\n    text: string;\n  };\n  locations: Array<{\n    physicalLocation: {\n      artifactLocation: {\n        uri: string;\n      };\n      region: {\n        startLine: number;\n        endLine: number;\n      };\n    };\n  }>;\n}\n\n/**\n * Get the SARIF rule ID for a metric type\n */\nfunction getRuleId(metricType: string): string {\n  switch (metricType) {\n    case 'cognitive': return 'lien/high-cognitive-complexity';\n    case 'cyclomatic': return 'lien/high-cyclomatic-complexity';\n    case 'halstead_effort': return 'lien/high-halstead-effort';\n    case 'halstead_bugs': return 'lien/high-estimated-bugs';\n    default: return 'lien/high-complexity';\n  }\n}\n\n/**\n * Format complexity report as SARIF for GitHub Code Scanning\n */\nexport function formatSarifReport(report: ComplexityReport): string {\n  const rules: SarifRule[] = [\n    {\n      id: 'lien/high-cyclomatic-complexity',\n      shortDescription: {\n        text: 'Too many test paths',\n      },\n      fullDescription: {\n        text: 'Function or method requires too many test cases to achieve full branch coverage. Each decision point (if, switch, loop) adds a path that needs testing.',\n      },\n      help: {\n        text: 'Consider refactoring by extracting methods, using early returns, or simplifying conditional logic to reduce the number of test paths.',\n      },\n    },\n    {\n      id: 'lien/high-cognitive-complexity',\n      shortDescription: {\n        text: 'High mental load',\n      },\n      fullDescription: {\n        text: 'Function or method has high mental load (deeply nested or hard to follow), requiring too much mental effort to understand and maintain.',\n      },\n      help: {\n        text: 'Consider flattening nested conditionals, extracting helper functions, or using guard clauses to reduce mental load.',\n      },\n    },\n    {\n      id: 'lien/high-halstead-effort',\n      shortDescription: {\n        text: 'Long time to understand',\n      },\n      fullDescription: {\n        text: 'Function or method takes too long to understand, based on Halstead metrics (operators and operands count).',\n      },\n      help: {\n        text: 'Consider simplifying expressions, reducing variable count, or breaking into smaller functions.',\n      },\n    },\n    {\n      id: 'lien/high-estimated-bugs',\n      shortDescription: {\n        text: 'High estimated bug count',\n      },\n      fullDescription: {\n        text: 'Function or method is likely to contain bugs based on Halstead metrics (Volume / 3000), which estimates bug count from code complexity.',\n      },\n      help: {\n        text: 'Consider simplifying the function, breaking into smaller units, or adding thorough test coverage.',\n      },\n    },\n  ];\n\n  const results: SarifResult[] = [];\n\n  // Convert violations to SARIF results\n  for (const [filepath, fileData] of Object.entries(report.files)) {\n    for (const violation of fileData.violations) {\n      const ruleId = getRuleId(violation.metricType);\n      \n      results.push({\n        ruleId,\n        level: violation.severity,\n        message: {\n          text: `${violation.symbolName}: ${violation.message}`,\n        },\n        locations: [\n          {\n            physicalLocation: {\n              artifactLocation: {\n                uri: filepath,\n              },\n              region: {\n                startLine: violation.startLine,\n                endLine: violation.endLine,\n              },\n            },\n          },\n        ],\n      });\n    }\n  }\n\n  const sarifReport: SarifReport = {\n    $schema: 'https://raw.githubusercontent.com/oasis-tcs/sarif-spec/master/Schemata/sarif-schema-2.1.0.json',\n    version: '2.1.0',\n    runs: [\n      {\n        tool: {\n          driver: {\n            name: 'Lien Complexity Analyzer',\n            version: '1.0.0',\n            informationUri: 'https://github.com/liendev/lien',\n            rules,\n          },\n        },\n        results,\n      },\n    ],\n  };\n\n  return JSON.stringify(sarifReport, null, 2);\n}\n\n","import { ComplexityReport } from '../types.js';\nimport { formatTextReport } from './text.js';\nimport { formatJsonReport } from './json.js';\nimport { formatSarifReport } from './sarif.js';\n\nexport type OutputFormat = 'text' | 'json' | 'sarif';\n\n/**\n * Format complexity report in the specified format\n */\nexport function formatReport(\n  report: ComplexityReport,\n  format: OutputFormat\n): string {\n  switch (format) {\n    case 'json':\n      return formatJsonReport(report);\n    case 'sarif':\n      return formatSarifReport(report);\n    case 'text':\n    default:\n      return formatTextReport(report);\n  }\n}\n\n// Export individual formatters\nexport { formatTextReport, formatJsonReport, formatSarifReport };\n\n","import { program } from './cli/index.js';\n\nprogram.parse();\n\n"],"mappings":";;;;;;;;;;;;AAAA,SAAS,qBAAqB;AAC9B,SAAS,qBAAqB;AAC9B,SAAS,SAAS,YAAY;AAoCvB,SAAS,oBAA4B;AAC1C,SAAO,YAAY;AACrB;AAxCA,IAeM,YACA,WACAA,UAEF;AAnBJ;AAAA;AAAA;AAeA,IAAM,aAAa,cAAc,YAAY,GAAG;AAChD,IAAM,YAAY,QAAQ,UAAU;AACpC,IAAMA,WAAU,cAAc,YAAY,GAAG;AAI7C,QAAI;AAEF,oBAAcA,SAAQ,KAAK,WAAW,iBAAiB,CAAC;AAAA,IAC1D,QAAQ;AACN,UAAI;AAEF,sBAAcA,SAAQ,KAAK,WAAW,oBAAoB,CAAC;AAAA,MAC7D,QAAQ;AAEN,gBAAQ,KAAK,qEAAqE;AAClF,sBAAc,EAAE,SAAS,gBAAgB;AAAA,MAC3C;AAAA,IACF;AAAA;AAAA;;;ACjCA,IASa,oBACA,uBAGA,qBACA,8BAKA,4BAIA,0BAEA,0BAGA,sBACA,yBAGA,cACA,2BAGA,8BAGA,qBAIA,wBAWA;AAtDb;AAAA;AAAA;AAMA;AAGO,IAAM,qBAAqB;AAC3B,IAAM,wBAAwB;AAG9B,IAAM,sBAAsB;AAC5B,IAAM,+BAA+B;AAKrC,IAAM,6BAA6B;AAInC,IAAM,2BAA2B;AAEjC,IAAM,2BAA2B;AAGjC,IAAM,uBAAuB;AAC7B,IAAM,0BAA0B;AAGhC,IAAM,eAAe;AACrB,IAAM,4BAA4B;AAGlC,IAAM,+BAA+B;AAGrC,IAAM,sBAAsB;AAI5B,IAAM,yBAAyB,kBAAkB;AAWjD,IAAM,uBAAuB;AAAA;AAAA;;;ACkD7B,SAAS,eACd,QAC4B;AAC5B,SAAO,cAAc,UAAU,EAAE,gBAAgB;AACnD;AAOO,SAAS,eACd,QACsB;AACtB,SAAO,gBAAgB;AACzB;AAvHA,IA6Ha;AA7Hb;AAAA;AAAA;AAAA;AA6HO,IAAM,gBAA4B;AAAA,MACvC,SAAS;AAAA,MACT,MAAM;AAAA,QACJ,WAAW;AAAA,QACX,cAAc;AAAA,QACd,aAAa;AAAA,QACb,oBAAoB;AAAA,MACtB;AAAA,MACA,UAAU;AAAA,QACR,QAAQ;AAAA;AAAA,QACR,aAAa;AAAA;AAAA,MACf;AAAA,MACA,KAAK;AAAA,QACH,MAAM;AAAA,QACN,WAAW;AAAA,QACX,qBAAqB;AAAA,MACvB;AAAA,MACA,cAAc;AAAA,QACZ,SAAS;AAAA,QACT,gBAAgB;AAAA,MAClB;AAAA,MACA,cAAc;AAAA,QACZ,SAAS;AAAA;AAAA,QACT,YAAY;AAAA,MACd;AAAA,MACA,YAAY;AAAA,QACV,SAAS;AAAA,QACT,YAAY;AAAA,UACV,WAAW;AAAA;AAAA,UACX,YAAY;AAAA;AAAA,UACZ,yBAAyB;AAAA;AAAA,UACzB,eAAe;AAAA;AAAA,QACjB;AAAA,MACF;AAAA,MACA,YAAY,CAAC;AAAA;AAAA,IACf;AAAA;AAAA;;;AChKA,OAAO,QAAQ;AACf,OAAO,UAAU;AAOV,SAAS,eAAe,QAAsB;AAMnD,MAAI,CAAC,QAAQ;AACX,WAAO;AAAA,EACT;AAGA,MAAI,OAAO,eAAe,UAAa,CAAC,OAAO,UAAU;AACvD,WAAO;AAAA,EACT;AAGA,MAAI,OAAO,eAAe,UAAa,OAAO,aAAa,QAAW;AACpE,WAAO;AAAA,EACT;AAGA,MAAI,OAAO,aAAa,QAAW;AACjC,WAAO;AAAA,EACT;AAGA,MAAI,OAAO,WAAW,OAAO,QAAQ,WAAW,KAAK,GAAG;AACtD,WAAO;AAAA,EACT;AAEA,SAAO;AACT;AAKO,SAAS,cAAc,WAA+D;AAE3F,QAAM,YAAwB;AAAA,IAC5B,SAAS;AAAA,IACT,MAAM;AAAA,MACJ,WAAY,UAAkB,UAAU,aAAc,UAAkB,MAAM,aAAa,cAAc,KAAK;AAAA,MAC9G,cAAe,UAAkB,UAAU,gBAAiB,UAAkB,MAAM,gBAAgB,cAAc,KAAK;AAAA,MACvH,aAAc,UAAkB,UAAU,eAAgB,UAAkB,MAAM,eAAe,cAAc,KAAK;AAAA,MACpH,oBAAqB,UAAkB,UAAU,sBAAuB,UAAkB,MAAM,sBAAsB,cAAc,KAAK;AAAA,IAC3I;AAAA,IACA,UAAU;AAAA,MACR,QAAS,UAAkB,UAAU,UAAU,cAAc,SAAS;AAAA,MACtE,aAAc,UAAkB,UAAU,eAAe,cAAc,SAAS;AAAA,IAClF;AAAA,IACA,KAAK;AAAA,MACH,MAAM,UAAU,KAAK,QAAQ,cAAc,IAAI;AAAA,MAC/C,WAAW,UAAU,KAAK,aAAa,cAAc,IAAI;AAAA,MACzD,qBAAqB,UAAU,KAAK,uBAAuB,cAAc,IAAI;AAAA,IAC/E;AAAA,IACA,cAAc;AAAA,MACZ,SAAS,UAAU,cAAc,WAAW,cAAc,aAAa;AAAA,MACvE,gBAAgB,UAAU,cAAc,kBAAkB,cAAc,aAAa;AAAA,IACvF;AAAA,IACA,cAAc;AAAA,MACZ,SAAS,UAAU,cAAc,WAAW,cAAc,aAAa;AAAA,MACvE,YAAY,UAAU,cAAc,cAAc,cAAc,aAAa;AAAA,IAC/E;AAAA,IACA,YAAa,UAAkB,cAAc,CAAC;AAAA,EAChD;AAGA,MAAK,UAAkB,YAAY,UAAU,WAAW,WAAW,GAAG;AACpE,UAAM,mBAAsC;AAAA,MAC1C,MAAM;AAAA,MACN,MAAM;AAAA,MACN,SAAS;AAAA,MACT,QAAQ;AAAA,QACN,SAAU,UAAkB,SAAS,WAAW,CAAC,iDAAiD;AAAA,QAClG,SAAU,UAAkB,SAAS,WAAW;AAAA,UAC9C;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAEA,cAAU,WAAW,KAAK,gBAAgB;AAAA,EAC5C,WAAW,UAAU,WAAW,WAAW,GAAG;AAE5C,UAAM,mBAAsC;AAAA,MAC1C,MAAM;AAAA,MACN,MAAM;AAAA,MACN,SAAS;AAAA,MACT,QAAQ;AAAA,QACN,SAAS,CAAC,iDAAiD;AAAA,QAC3D,SAAS;AAAA,UACP;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAEA,cAAU,WAAW,KAAK,gBAAgB;AAAA,EAC5C;AAEA,SAAO;AACT;AAKA,eAAsB,kBAAkB,UAAkB,QAAQ,IAAI,GAInE;AACD,QAAM,aAAa,KAAK,KAAK,SAAS,mBAAmB;AAEzD,MAAI;AAEF,UAAM,gBAAgB,MAAM,GAAG,SAAS,YAAY,OAAO;AAC3D,UAAM,YAAY,KAAK,MAAM,aAAa;AAG1C,QAAI,CAAC,eAAe,SAAS,GAAG;AAC9B,aAAO;AAAA,QACL,UAAU;AAAA,QACV,QAAQ;AAAA,MACV;AAAA,IACF;AAGA,UAAM,YAAY,cAAc,SAAS;AAGzC,UAAM,aAAa,GAAG,UAAU;AAChC,UAAM,GAAG,SAAS,YAAY,UAAU;AAGxC,UAAM,GAAG,UAAU,YAAY,KAAK,UAAU,WAAW,MAAM,CAAC,IAAI,MAAM,OAAO;AAEjF,WAAO;AAAA,MACL,UAAU;AAAA,MACV;AAAA,MACA,QAAQ;AAAA,IACV;AAAA,EACF,SAAS,OAAO;AAEd,QAAK,MAAgC,SAAS,UAAU;AACtD,aAAO;AAAA,QACL,UAAU;AAAA,QACV,QAAQ;AAAA,MACV;AAAA,IACF;AACA,UAAM;AAAA,EACR;AACF;AA3KA;AAAA;AAAA;AAEA;AACA;AAAA;AAAA;;;ACOO,SAAS,gBAAgB,UAAsB,MAAuC;AAC3F,SAAO;AAAA,IACL,SAAS,KAAK,WAAW,SAAS;AAAA,IAClC,MAAM;AAAA,MACJ,GAAG,SAAS;AAAA,MACZ,GAAG,KAAK;AAAA,IACV;AAAA,IACA,UAAU;AAAA,MACR,GAAG,SAAS;AAAA,MACZ,GAAG,KAAK;AAAA,IACV;AAAA,IACA,KAAK;AAAA,MACH,GAAG,SAAS;AAAA,MACZ,GAAG,KAAK;AAAA,IACV;AAAA,IACA,cAAc;AAAA,MACZ,GAAG,SAAS;AAAA,MACZ,GAAG,KAAK;AAAA,IACV;AAAA,IACA,cAAc;AAAA,MACZ,GAAG,SAAS;AAAA,MACZ,GAAG,KAAK;AAAA,IACV;AAAA,IACA,YAAY,KAAK,aAAa;AAAA,MAC5B,SAAS,KAAK,WAAW,WAAW,SAAS,YAAY,WAAW;AAAA,MACpE,YAAY;AAAA,QACV,GAAG,SAAS,YAAY;AAAA,QACxB,GAAI,KAAK,WAAW,cAAc,CAAC;AAAA,MACrC;AAAA,IACF,IAAI,SAAS;AAAA,IACb,YAAY,KAAK,cAAc,SAAS;AAAA,EAC1C;AACF;AAUO,SAAS,gBAAgB,QAA6B,OAAsC;AACjG,QAAM,YAAsB,CAAC;AAG7B,aAAW,OAAO,OAAO,KAAK,KAAK,GAAG;AACpC,QAAI,EAAE,OAAO,SAAS;AACpB,gBAAU,KAAK,GAAG;AAClB;AAAA,IACF;AAGA,QAAI,OAAO,MAAM,GAAG,MAAM,YAAY,MAAM,GAAG,MAAM,QAAQ,CAAC,MAAM,QAAQ,MAAM,GAAG,CAAC,GAAG;AACvF,YAAM,gBAAiB,OAAO,GAAG,KAA6B,CAAC;AAC/D,YAAM,eAAe,MAAM,GAAG;AAE9B,iBAAW,aAAa,OAAO,KAAK,YAAY,GAAG;AACjD,YAAI,EAAE,aAAa,gBAAgB;AACjC,oBAAU,KAAK,GAAG,GAAG,IAAI,SAAS,EAAE;AAAA,QACtC;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AACT;AA5EA;AAAA;AAAA;AAAA;AAAA;;;ACAA;AAAA;AAAA;AAAA;AAAA;;;AC8GO,SAAS,UACd,OACA,SACA,mBACW;AACX,QAAM,UAAU,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;AACrE,QAAM,QAAQ,iBAAiB,QAAQ,MAAM,QAAQ;AAErD,QAAM,eAAe,IAAI;AAAA,IACvB,GAAG,OAAO,KAAK,OAAO;AAAA;AAAA,IAEtB;AAAA,EACF;AAGA,MAAI,OAAO;AACT,iBAAa,QAAQ,GAAG,aAAa,KAAK;AAAA;AAAA;AAAA,EAAmB,KAAK;AAAA,EACpE;AAEA,SAAO;AACT;AAlIA,IAaa,WAiDA,aAwBA,gBAUA;AAhGb;AAAA;AAAA;AAAA;AAGA;AAUO,IAAM,YAAN,cAAwB,MAAM;AAAA,MACnC,YACE,SACgB,MACA,SACA,WAA0B,UAC1B,cAAuB,MACvB,YAAqB,OACrC;AACA,cAAM,OAAO;AANG;AACA;AACA;AACA;AACA;AAGhB,aAAK,OAAO;AAGZ,YAAI,MAAM,mBAAmB;AAC3B,gBAAM,kBAAkB,MAAM,KAAK,WAAW;AAAA,QAChD;AAAA,MACF;AAAA;AAAA;AAAA;AAAA,MAKA,SAAS;AACP,eAAO;AAAA,UACL,OAAO,KAAK;AAAA,UACZ,MAAM,KAAK;AAAA,UACX,UAAU,KAAK;AAAA,UACf,aAAa,KAAK;AAAA,UAClB,SAAS,KAAK;AAAA,QAChB;AAAA,MACF;AAAA;AAAA;AAAA;AAAA,MAKA,cAAuB;AACrB,eAAO,KAAK;AAAA,MACd;AAAA;AAAA;AAAA;AAAA,MAKA,gBAAyB;AACvB,eAAO,KAAK;AAAA,MACd;AAAA,IACF;AAKO,IAAM,cAAN,cAA0B,UAAU;AAAA,MACzC,YAAY,SAAiB,SAAmC;AAC9D,cAAM,gDAAuC,SAAS,UAAU,MAAM,KAAK;AAC3E,aAAK,OAAO;AAAA,MACd;AAAA,IACF;AAmBO,IAAM,iBAAN,cAA6B,UAAU;AAAA,MAC5C,YAAY,SAAiB,SAAmC;AAC9D,cAAM,0EAAoD,SAAS,QAAQ,MAAM,IAAI;AACrF,aAAK,OAAO;AAAA,MACd;AAAA,IACF;AAKO,IAAM,gBAAN,cAA4B,UAAU;AAAA,MAC3C,YAAY,SAAiB,SAAmC;AAC9D,cAAM,gDAAuC,SAAS,QAAQ,MAAM,IAAI;AACxE,aAAK,OAAO;AAAA,MACd;AAAA,IACF;AAAA;AAAA;;;ACrGA,OAAOC,SAAQ;AACf,OAAOC,WAAU;AADjB,IAgCa,eAujBA;AAvlBb;AAAA;AAAA;AAEA;AACA;AACA;AACA;AA2BO,IAAM,gBAAN,MAAM,eAAc;AAAA,MACzB,OAAwB,kBAAkB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAU1C,MAAM,KAAK,UAAkB,QAAQ,IAAI,GAAwB;AAC/D,cAAM,aAAa,KAAK,cAAc,OAAO;AAE7C,YAAI;AACF,gBAAM,gBAAgB,MAAMD,IAAG,SAAS,YAAY,OAAO;AAC3D,gBAAM,aAAa,KAAK,MAAM,aAAa;AAG3C,cAAI,KAAK,eAAe,UAAU,GAAG;AACnC,oBAAQ,IAAI,qDAA8C;AAE1D,kBAAM,SAAS,MAAM,KAAK,QAAQ,OAAO;AAEzC,gBAAI,OAAO,YAAY,OAAO,YAAY;AACxC,oBAAM,iBAAiBC,MAAK,SAAS,OAAO,UAAU;AACtD,sBAAQ,IAAI,8CAAyC,cAAc,EAAE;AACrE,sBAAQ,IAAI,+DAAwD;AAAA,YACtE;AAEA,mBAAO,OAAO;AAAA,UAChB;AAGA,gBAAM,eAAe,gBAAgB,eAAe,UAAiC;AAGrF,gBAAM,aAAa,KAAK,SAAS,YAAY;AAC7C,cAAI,CAAC,WAAW,OAAO;AACrB,kBAAM,IAAI;AAAA,cACR;AAAA,EAA2B,WAAW,OAAO,KAAK,IAAI,CAAC;AAAA,cACvD,EAAE,QAAQ,WAAW,QAAQ,UAAU,WAAW,SAAS;AAAA,YAC7D;AAAA,UACF;AAGA,cAAI,WAAW,SAAS,SAAS,GAAG;AAClC,oBAAQ,KAAK,uCAA6B;AAC1C,uBAAW,SAAS,QAAQ,aAAW,QAAQ,KAAK,MAAM,OAAO,EAAE,CAAC;AAAA,UACtE;AAEA,iBAAO;AAAA,QACT,SAAS,OAAO;AACd,cAAK,MAAgC,SAAS,UAAU;AAEtD,mBAAO;AAAA,UACT;AAEA,cAAI,iBAAiB,aAAa;AAChC,kBAAM;AAAA,UACR;AAEA,cAAI,iBAAiB,aAAa;AAChC,kBAAM,IAAI;AAAA,cACR;AAAA,cACA,EAAE,MAAM,YAAY,eAAe,MAAM,QAAQ;AAAA,YACnD;AAAA,UACF;AAEA,gBAAM,UAAU,OAAO,gCAAgC,EAAE,MAAM,WAAW,CAAC;AAAA,QAC7E;AAAA,MACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAUA,MAAM,KAAK,SAAiB,QAAmC;AAC7D,cAAM,aAAa,KAAK,cAAc,OAAO;AAG7C,cAAM,aAAa,KAAK,SAAS,MAAM;AACvC,YAAI,CAAC,WAAW,OAAO;AACrB,gBAAM,IAAI;AAAA,YACR;AAAA,EAAuC,WAAW,OAAO,KAAK,IAAI,CAAC;AAAA,YACnE,EAAE,QAAQ,WAAW,OAAO;AAAA,UAC9B;AAAA,QACF;AAEA,YAAI;AACF,gBAAM,aAAa,KAAK,UAAU,QAAQ,MAAM,CAAC,IAAI;AACrD,gBAAMD,IAAG,UAAU,YAAY,YAAY,OAAO;AAAA,QACpD,SAAS,OAAO;AACd,gBAAM,UAAU,OAAO,gCAAgC,EAAE,MAAM,WAAW,CAAC;AAAA,QAC7E;AAAA,MACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,MAAM,OAAO,UAAkB,QAAQ,IAAI,GAAqB;AAC9D,cAAM,aAAa,KAAK,cAAc,OAAO;AAC7C,YAAI;AACF,gBAAMA,IAAG,OAAO,UAAU;AAC1B,iBAAO;AAAA,QACT,QAAQ;AACN,iBAAO;AAAA,QACT;AAAA,MACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAUA,MAAM,QAAQ,UAAkB,QAAQ,IAAI,GAA6B;AACvE,cAAM,aAAa,KAAK,cAAc,OAAO;AAE7C,YAAI;AAEF,gBAAM,gBAAgB,MAAMA,IAAG,SAAS,YAAY,OAAO;AAC3D,gBAAM,YAAY,KAAK,MAAM,aAAa;AAG1C,cAAI,CAAC,KAAK,eAAe,SAAS,GAAG;AACnC,mBAAO;AAAA,cACL,UAAU;AAAA,cACV,QAAQ;AAAA,YACV;AAAA,UACF;AAGA,gBAAM,YAAY,cAAiB,SAAS;AAG5C,gBAAM,aAAa,KAAK,SAAS,SAAS;AAC1C,cAAI,CAAC,WAAW,OAAO;AACrB,kBAAM,IAAI;AAAA,cACR;AAAA,EAA8C,WAAW,OAAO,KAAK,IAAI,CAAC;AAAA,cAC1E,EAAE,QAAQ,WAAW,OAAO;AAAA,YAC9B;AAAA,UACF;AAGA,gBAAM,aAAa,GAAG,UAAU;AAChC,gBAAMA,IAAG,SAAS,YAAY,UAAU;AAGxC,gBAAM,KAAK,KAAK,SAAS,SAAS;AAElC,iBAAO;AAAA,YACL,UAAU;AAAA,YACV;AAAA,YACA,QAAQ;AAAA,UACV;AAAA,QACF,SAAS,OAAO;AACd,cAAK,MAAgC,SAAS,UAAU;AACtD,mBAAO;AAAA,cACL,UAAU;AAAA,cACV,QAAQ;AAAA,YACV;AAAA,UACF;AAEA,cAAI,iBAAiB,aAAa;AAChC,kBAAM;AAAA,UACR;AAEA,gBAAM,UAAU,OAAO,kCAAkC,EAAE,MAAM,WAAW,CAAC;AAAA,QAC/E;AAAA,MACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,eAAe,QAA0B;AACvC,eAAO,eAAoB,MAAM;AAAA,MACnC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MASA,SAAS,QAAmC;AAC1C,cAAM,SAAmB,CAAC;AAC1B,cAAM,WAAqB,CAAC;AAG5B,YAAI,CAAC,UAAU,OAAO,WAAW,UAAU;AACzC,iBAAO;AAAA,YACL,OAAO;AAAA,YACP,QAAQ,CAAC,iCAAiC;AAAA,YAC1C,UAAU,CAAC;AAAA,UACb;AAAA,QACF;AAEA,cAAM,MAAM;AAGZ,YAAI,CAAC,IAAI,SAAS;AAChB,iBAAO,KAAK,iCAAiC;AAAA,QAC/C;AAGA,YAAI,eAAe,GAAoC,GAAG;AACxD,eAAK,qBAAqB,KAAmB,QAAQ,QAAQ;AAAA,QAC/D,WAAW,eAAe,GAAoC,GAAG;AAC/D,eAAK,qBAAqB,KAAyB,QAAQ,QAAQ;AAAA,QACrE,OAAO;AACL,iBAAO,KAAK,wFAAwF;AAAA,QACtG;AAEA,eAAO;AAAA,UACL,OAAO,OAAO,WAAW;AAAA,UACzB;AAAA,UACA;AAAA,QACF;AAAA,MACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MASA,gBAAgB,QAA+C;AAC7D,cAAM,SAAmB,CAAC;AAC1B,cAAM,WAAqB,CAAC;AAG5B,YAAI,OAAO,MAAM;AACf,eAAK,mBAAmB,OAAO,MAAM,QAAQ,QAAQ;AAAA,QACvD;AAGA,YAAI,OAAO,KAAK;AACd,eAAK,kBAAkB,OAAO,KAAK,QAAQ,QAAQ;AAAA,QACrD;AAGA,YAAI,OAAO,cAAc;AACvB,eAAK,2BAA2B,OAAO,cAAc,QAAQ,QAAQ;AAAA,QACvE;AAGA,YAAI,OAAO,cAAc;AACvB,eAAK,2BAA2B,OAAO,cAAc,QAAQ,QAAQ;AAAA,QACvE;AAGA,YAAI,OAAO,YAAY;AACrB,eAAK,mBAAmB,OAAO,YAAY,QAAQ,QAAQ;AAAA,QAC7D;AAEA,eAAO;AAAA,UACL,OAAO,OAAO,WAAW;AAAA,UACzB;AAAA,UACA;AAAA,QACF;AAAA,MACF;AAAA;AAAA;AAAA;AAAA,MAKQ,cAAc,SAAyB;AAC7C,eAAOC,MAAK,KAAK,SAAS,eAAc,eAAe;AAAA,MACzD;AAAA;AAAA;AAAA;AAAA,MAKQ,qBACN,QACA,QACA,UACM;AAEN,YAAI,CAAC,OAAO,MAAM;AAChB,iBAAO,KAAK,8BAA8B;AAC1C;AAAA,QACF;AACA,aAAK,mBAAmB,OAAO,MAAM,QAAQ,QAAQ;AAGrD,YAAI,CAAC,OAAO,KAAK;AACf,iBAAO,KAAK,6BAA6B;AACzC;AAAA,QACF;AACA,aAAK,kBAAkB,OAAO,KAAK,QAAQ,QAAQ;AAGnD,YAAI,CAAC,OAAO,cAAc;AACxB,iBAAO,KAAK,sCAAsC;AAClD;AAAA,QACF;AACA,aAAK,2BAA2B,OAAO,cAAc,QAAQ,QAAQ;AAGrE,YAAI,CAAC,OAAO,cAAc;AACxB,iBAAO,KAAK,sCAAsC;AAClD;AAAA,QACF;AACA,aAAK,2BAA2B,OAAO,cAAc,QAAQ,QAAQ;AAGrE,YAAI,CAAC,OAAO,YAAY;AACtB,iBAAO,KAAK,oCAAoC;AAChD;AAAA,QACF;AACA,aAAK,mBAAmB,OAAO,YAAY,QAAQ,QAAQ;AAAA,MAC7D;AAAA;AAAA;AAAA;AAAA,MAKQ,qBACN,QACA,QACA,UACM;AACN,iBAAS,KAAK,sFAAsF;AAGpG,YAAI,CAAC,OAAO,UAAU;AACpB,iBAAO,KAAK,kCAAkC;AAC9C;AAAA,QACF;AAEA,cAAM,EAAE,SAAS,IAAI;AAErB,YAAI,OAAO,SAAS,cAAc,YAAY,SAAS,aAAa,GAAG;AACrE,iBAAO,KAAK,8CAA8C;AAAA,QAC5D;AAEA,YAAI,OAAO,SAAS,iBAAiB,YAAY,SAAS,eAAe,GAAG;AAC1E,iBAAO,KAAK,qDAAqD;AAAA,QACnE;AAEA,YAAI,OAAO,SAAS,gBAAgB,YAAY,SAAS,cAAc,KAAK,SAAS,cAAc,IAAI;AACrG,iBAAO,KAAK,+CAA+C;AAAA,QAC7D;AAEA,YAAI,OAAO,SAAS,uBAAuB,YAAY,SAAS,sBAAsB,GAAG;AACvF,iBAAO,KAAK,uDAAuD;AAAA,QACrE;AAGA,YAAI,OAAO,KAAK;AACd,eAAK,kBAAkB,OAAO,KAAK,QAAQ,QAAQ;AAAA,QACrD;AAAA,MACF;AAAA;AAAA;AAAA;AAAA,MAKQ,mBACN,MACA,QACA,UACM;AACN,YAAI,KAAK,cAAc,QAAW;AAChC,cAAI,OAAO,KAAK,cAAc,YAAY,KAAK,aAAa,GAAG;AAC7D,mBAAO,KAAK,0CAA0C;AAAA,UACxD,WAAW,KAAK,YAAY,IAAI;AAC9B,qBAAS,KAAK,kFAAkF;AAAA,UAClG,WAAW,KAAK,YAAY,KAAK;AAC/B,qBAAS,KAAK,wEAAwE;AAAA,UACxF;AAAA,QACF;AAEA,YAAI,KAAK,iBAAiB,QAAW;AACnC,cAAI,OAAO,KAAK,iBAAiB,YAAY,KAAK,eAAe,GAAG;AAClE,mBAAO,KAAK,iDAAiD;AAAA,UAC/D;AAAA,QACF;AAEA,YAAI,KAAK,gBAAgB,QAAW;AAClC,cAAI,OAAO,KAAK,gBAAgB,YAAY,KAAK,cAAc,KAAK,KAAK,cAAc,IAAI;AACzF,mBAAO,KAAK,2CAA2C;AAAA,UACzD;AAAA,QACF;AAEA,YAAI,KAAK,uBAAuB,QAAW;AACzC,cAAI,OAAO,KAAK,uBAAuB,YAAY,KAAK,sBAAsB,GAAG;AAC/E,mBAAO,KAAK,mDAAmD;AAAA,UACjE,WAAW,KAAK,qBAAqB,KAAK;AACxC,qBAAS,KAAK,4EAA4E;AAAA,UAC5F;AAAA,QACF;AAAA,MACF;AAAA;AAAA;AAAA;AAAA,MAKQ,kBACN,KACA,QACA,WACM;AACN,YAAI,IAAI,SAAS,QAAW;AAC1B,cAAI,OAAO,IAAI,SAAS,YAAY,IAAI,OAAO,QAAQ,IAAI,OAAO,OAAO;AACvE,mBAAO,KAAK,yCAAyC;AAAA,UACvD;AAAA,QACF;AAEA,YAAI,IAAI,cAAc,QAAW;AAC/B,cAAI,IAAI,cAAc,WAAW,IAAI,cAAc,UAAU;AAC3D,mBAAO,KAAK,kDAAkD;AAAA,UAChE;AAAA,QACF;AAEA,YAAI,IAAI,wBAAwB,QAAW;AACzC,cAAI,OAAO,IAAI,wBAAwB,WAAW;AAChD,mBAAO,KAAK,2CAA2C;AAAA,UACzD;AAAA,QACF;AAAA,MACF;AAAA;AAAA;AAAA;AAAA,MAKQ,2BACN,cACA,QACA,WACM;AACN,YAAI,aAAa,YAAY,QAAW;AACtC,cAAI,OAAO,aAAa,YAAY,WAAW;AAC7C,mBAAO,KAAK,wCAAwC;AAAA,UACtD;AAAA,QACF;AAEA,YAAI,aAAa,mBAAmB,QAAW;AAC7C,cAAI,OAAO,aAAa,mBAAmB,YAAY,aAAa,iBAAiB,KAAK;AACxF,mBAAO,KAAK,oDAAoD;AAAA,UAClE,WAAW,aAAa,iBAAiB,KAAM;AAC7C,sBAAU,KAAK,8EAA8E;AAAA,UAC/F;AAAA,QACF;AAAA,MACF;AAAA;AAAA;AAAA;AAAA,MAKQ,2BACN,cACA,QACA,UACM;AACN,YAAI,aAAa,YAAY,QAAW;AACtC,cAAI,OAAO,aAAa,YAAY,WAAW;AAC7C,mBAAO,KAAK,wCAAwC;AAAA,UACtD;AAAA,QACF;AAEA,YAAI,aAAa,eAAe,QAAW;AACzC,cAAI,OAAO,aAAa,eAAe,YAAY,aAAa,aAAa,GAAG;AAC9E,mBAAO,KAAK,uDAAuD;AAAA,UACrE,WAAW,aAAa,aAAa,KAAK;AACxC,qBAAS,KAAK,qFAAqF;AAAA,UACrG;AAAA,QACF;AAAA,MACF;AAAA;AAAA;AAAA;AAAA,MAKQ,mBACN,YACA,QACA,UACM;AACN,YAAI,CAAC,MAAM,QAAQ,UAAU,GAAG;AAC9B,iBAAO,KAAK,6BAA6B;AACzC;AAAA,QACF;AAEA,mBAAW,QAAQ,CAAC,WAAW,UAAU;AACvC,cAAI,CAAC,aAAa,OAAO,cAAc,UAAU;AAC/C,mBAAO,KAAK,cAAc,KAAK,qBAAqB;AACpD;AAAA,UACF;AAEA,gBAAM,KAAK;AAGX,cAAI,CAAC,GAAG,MAAM;AACZ,mBAAO,KAAK,cAAc,KAAK,gCAAgC;AAAA,UACjE;AAEA,cAAI,GAAG,SAAS,QAAW;AACzB,mBAAO,KAAK,cAAc,KAAK,gCAAgC;AAAA,UACjE,WAAW,OAAO,GAAG,SAAS,UAAU;AACtC,mBAAO,KAAK,cAAc,KAAK,yBAAyB;AAAA,UAC1D,WAAWA,MAAK,WAAW,GAAG,IAAI,GAAG;AACnC,mBAAO,KAAK,cAAc,KAAK,iCAAiC,GAAG,IAAI,EAAE;AAAA,UAC3E;AAEA,cAAI,GAAG,YAAY,QAAW;AAC5B,mBAAO,KAAK,cAAc,KAAK,mCAAmC;AAAA,UACpE,WAAW,OAAO,GAAG,YAAY,WAAW;AAC1C,mBAAO,KAAK,cAAc,KAAK,6BAA6B;AAAA,UAC9D;AAEA,cAAI,CAAC,GAAG,QAAQ;AACd,mBAAO,KAAK,cAAc,KAAK,kCAAkC;AAAA,UACnE,OAAO;AACL,iBAAK,wBAAwB,GAAG,QAAQ,cAAc,KAAK,YAAY,QAAQ,QAAQ;AAAA,UACzF;AAAA,QACF,CAAC;AAAA,MACH;AAAA;AAAA;AAAA;AAAA,MAKQ,wBACN,QACA,QACA,QACA,WACM;AACN,YAAI,CAAC,UAAU,OAAO,WAAW,UAAU;AACzC,iBAAO,KAAK,GAAG,MAAM,oBAAoB;AACzC;AAAA,QACF;AAGA,YAAI,CAAC,MAAM,QAAQ,OAAO,OAAO,GAAG;AAClC,iBAAO,KAAK,GAAG,MAAM,2BAA2B;AAAA,QAClD,OAAO;AACL,iBAAO,QAAQ,QAAQ,CAAC,SAAkB,MAAc;AACtD,gBAAI,OAAO,YAAY,UAAU;AAC/B,qBAAO,KAAK,GAAG,MAAM,YAAY,CAAC,oBAAoB;AAAA,YACxD;AAAA,UACF,CAAC;AAAA,QACH;AAGA,YAAI,CAAC,MAAM,QAAQ,OAAO,OAAO,GAAG;AAClC,iBAAO,KAAK,GAAG,MAAM,2BAA2B;AAAA,QAClD,OAAO;AACL,iBAAO,QAAQ,QAAQ,CAAC,SAAkB,MAAc;AACtD,gBAAI,OAAO,YAAY,UAAU;AAC/B,qBAAO,KAAK,GAAG,MAAM,YAAY,CAAC,oBAAoB;AAAA,YACxD;AAAA,UACF,CAAC;AAAA,QACH;AAAA,MACF;AAAA,IACF;AAGO,IAAM,gBAAgB,IAAI,cAAc;AAAA;AAAA;;;ACvlB/C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,SAAS,YAAY;AACrB,SAAS,iBAAiB;AAC1B,OAAOC,UAAQ;AACf,OAAOC,YAAU;AAUjB,eAAsB,UAAU,SAAmC;AACjE,MAAI;AACF,UAAM,SAASA,OAAK,KAAK,SAAS,MAAM;AACxC,UAAMD,KAAG,OAAO,MAAM;AACtB,WAAO;AAAA,EACT,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AASA,eAAsB,iBAAiB,SAAkC;AACvE,MAAI;AACF,UAAM,EAAE,OAAO,IAAI,MAAM,UAAU,mCAAmC;AAAA,MACpE,KAAK;AAAA,MACL,SAAS;AAAA;AAAA,IACX,CAAC;AACD,WAAO,OAAO,KAAK;AAAA,EACrB,SAAS,OAAO;AACd,UAAM,IAAI,MAAM,iCAAiC,KAAK,EAAE;AAAA,EAC1D;AACF;AASA,eAAsB,iBAAiB,SAAkC;AACvE,MAAI;AACF,UAAM,EAAE,OAAO,IAAI,MAAM,UAAU,sBAAsB;AAAA,MACvD,KAAK;AAAA,MACL,SAAS;AAAA,IACX,CAAC;AACD,WAAO,OAAO,KAAK;AAAA,EACrB,SAAS,OAAO;AACd,UAAM,IAAI,MAAM,iCAAiC,KAAK,EAAE;AAAA,EAC1D;AACF;AAWA,eAAsB,gBACpB,SACA,SACA,OACmB;AACnB,MAAI;AACF,UAAM,EAAE,OAAO,IAAI,MAAM;AAAA,MACvB,wBAAwB,OAAO,MAAM,KAAK;AAAA,MAC1C;AAAA,QACE,KAAK;AAAA,QACL,SAAS;AAAA;AAAA,MACX;AAAA,IACF;AAEA,UAAM,QAAQ,OACX,KAAK,EACL,MAAM,IAAI,EACV,OAAO,OAAO,EACd,IAAI,UAAQC,OAAK,KAAK,SAAS,IAAI,CAAC;AAEvC,WAAO;AAAA,EACT,SAAS,OAAO;AACd,UAAM,IAAI,MAAM,gCAAgC,KAAK,EAAE;AAAA,EACzD;AACF;AAUA,eAAsB,wBACpB,SACA,WACmB;AACnB,MAAI;AACF,UAAM,EAAE,OAAO,IAAI,MAAM;AAAA,MACvB,+CAA+C,SAAS;AAAA,MACxD;AAAA,QACE,KAAK;AAAA,QACL,SAAS;AAAA,MACX;AAAA,IACF;AAEA,UAAM,QAAQ,OACX,KAAK,EACL,MAAM,IAAI,EACV,OAAO,OAAO,EACd,IAAI,UAAQA,OAAK,KAAK,SAAS,IAAI,CAAC;AAEvC,WAAO;AAAA,EACT,SAAS,OAAO;AACd,UAAM,IAAI,MAAM,0CAA0C,KAAK,EAAE;AAAA,EACnE;AACF;AAYA,eAAsB,8BACpB,SACA,YACA,UACmB;AACnB,MAAI;AACF,UAAM,EAAE,OAAO,IAAI,MAAM;AAAA,MACvB,wBAAwB,UAAU,IAAI,QAAQ;AAAA,MAC9C;AAAA,QACE,KAAK;AAAA,QACL,SAAS;AAAA,MACX;AAAA,IACF;AAEA,UAAM,QAAQ,OACX,KAAK,EACL,MAAM,IAAI,EACV,OAAO,OAAO,EACd,IAAI,UAAQA,OAAK,KAAK,SAAS,IAAI,CAAC;AAEvC,WAAO;AAAA,EACT,SAAS,OAAO;AACd,UAAM,IAAI,MAAM,gDAAgD,KAAK,EAAE;AAAA,EACzE;AACF;AAOA,eAAsB,iBAAmC;AACvD,MAAI;AACF,UAAM,UAAU,iBAAiB,EAAE,SAAS,IAAK,CAAC;AAClD,WAAO;AAAA,EACT,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAjLA,IAKM;AALN;AAAA;AAAA;AAKA,IAAM,YAAY,UAAU,IAAI;AAAA;AAAA;;;ACLhC,OAAOC,UAAQ;AACf,OAAOC,YAAU;AAUjB,eAAsB,iBAAiB,WAAkC;AACvE,MAAI;AACF,UAAM,kBAAkBA,OAAK,KAAK,WAAW,YAAY;AACzD,UAAM,YAAY,KAAK,IAAI,EAAE,SAAS;AACtC,UAAMD,KAAG,UAAU,iBAAiB,WAAW,OAAO;AAAA,EACxD,SAAS,OAAO;AAEd,YAAQ,MAAM,0CAA0C,KAAK,EAAE;AAAA,EACjE;AACF;AASA,eAAsB,gBAAgB,WAAoC;AACxE,MAAI;AACF,UAAM,kBAAkBC,OAAK,KAAK,WAAW,YAAY;AACzD,UAAM,UAAU,MAAMD,KAAG,SAAS,iBAAiB,OAAO;AAC1D,UAAM,YAAY,SAAS,QAAQ,KAAK,GAAG,EAAE;AAC7C,WAAO,MAAM,SAAS,IAAI,IAAI;AAAA,EAChC,SAAS,OAAO;AAEd,WAAO;AAAA,EACT;AACF;AAvCA,IAGM;AAHN,IAAAE,gBAAA;AAAA;AAAA;AAGA,IAAM,eAAe;AAAA;AAAA;;;ACHrB,SAAS,YAAY;AACrB,OAAO,YAAY;AACnB,OAAOC,UAAQ;AACf,OAAOC,YAAU;AAUjB,eAAsB,2BACpB,SACA,QACmB;AACnB,QAAM,WAAqB,CAAC;AAG5B,aAAW,aAAa,OAAO,YAAY;AACzC,QAAI,CAAC,UAAU,SAAS;AACtB;AAAA,IACF;AAEA,UAAM,iBAAiB,MAAM,cAAc,SAAS,SAAS;AAC7D,aAAS,KAAK,GAAG,cAAc;AAAA,EACjC;AAEA,SAAO;AACT;AAKA,eAAe,cACb,SACA,WACmB;AACnB,QAAM,gBAAgBA,OAAK,KAAK,SAAS,UAAU,IAAI;AAGvD,QAAM,gBAAgBA,OAAK,KAAK,eAAe,YAAY;AAC3D,MAAI,KAAK,OAAO;AAEhB,MAAI;AACF,UAAM,mBAAmB,MAAMD,KAAG,SAAS,eAAe,OAAO;AACjE,SAAK,OAAO,EAAE,IAAI,gBAAgB;AAAA,EACpC,SAAS,GAAG;AAEV,UAAM,oBAAoBC,OAAK,KAAK,SAAS,YAAY;AACzD,QAAI;AACF,YAAM,mBAAmB,MAAMD,KAAG,SAAS,mBAAmB,OAAO;AACrE,WAAK,OAAO,EAAE,IAAI,gBAAgB;AAAA,IACpC,SAASE,IAAG;AAAA,IAEZ;AAAA,EACF;AAGA,KAAG,IAAI;AAAA,IACL,GAAG,UAAU,OAAO;AAAA,IACpB;AAAA,EACF,CAAC;AAGD,QAAM,WAAqB,CAAC;AAE5B,aAAW,WAAW,UAAU,OAAO,SAAS;AAC9C,UAAM,QAAQ,MAAM,KAAK,SAAS;AAAA,MAChC,KAAK;AAAA,MACL,UAAU;AAAA;AAAA,MACV,OAAO;AAAA,MACP,QAAQ,UAAU,OAAO;AAAA,IAC3B,CAAC;AACD,aAAS,KAAK,GAAG,KAAK;AAAA,EACxB;AAGA,QAAM,cAAc,MAAM,KAAK,IAAI,IAAI,QAAQ,CAAC;AAGhD,SAAO,YACJ,OAAO,UAAQ,CAAC,GAAG,QAAQ,IAAI,CAAC,EAChC,IAAI,UAAQ;AAEX,WAAO,UAAU,SAAS,MACtB,OACAD,OAAK,KAAK,UAAU,MAAM,IAAI;AAAA,EACpC,CAAC;AACL;AAMA,eAAsB,aAAa,SAAyC;AAC1E,QAAM,EAAE,SAAS,kBAAkB,CAAC,GAAG,kBAAkB,CAAC,EAAE,IAAI;AAGhE,QAAM,gBAAgBA,OAAK,KAAK,SAAS,YAAY;AACrD,MAAI,KAAK,OAAO;AAEhB,MAAI;AACF,UAAM,mBAAmB,MAAMD,KAAG,SAAS,eAAe,OAAO;AACjE,SAAK,OAAO,EAAE,IAAI,gBAAgB;AAAA,EACpC,SAAS,GAAG;AAAA,EAEZ;AAGA,KAAG,IAAI;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,GAAG;AAAA,EACL,CAAC;AAGD,QAAM,WAAW,gBAAgB,SAAS,IACtC,kBACA,CAAC,0DAA0D;AAG/D,QAAM,WAAqB,CAAC;AAE5B,aAAW,WAAW,UAAU;AAC9B,UAAM,QAAQ,MAAM,KAAK,SAAS;AAAA,MAChC,KAAK;AAAA,MACL,UAAU;AAAA,MACV,OAAO;AAAA,MACP,QAAQ,CAAC,mBAAmB,SAAS;AAAA,IACvC,CAAC;AACD,aAAS,KAAK,GAAG,KAAK;AAAA,EACxB;AAGA,QAAM,cAAc,MAAM,KAAK,IAAI,IAAI,QAAQ,CAAC;AAGhD,SAAO,YAAY,OAAO,UAAQ;AAChC,UAAM,eAAeC,OAAK,SAAS,SAAS,IAAI;AAChD,WAAO,CAAC,GAAG,QAAQ,YAAY;AAAA,EACjC,CAAC;AACH;AAEO,SAAS,eAAe,UAA0B;AACvD,QAAM,MAAMA,OAAK,QAAQ,QAAQ,EAAE,YAAY;AAE/C,QAAM,cAAsC;AAAA,IAC1C,OAAO;AAAA,IACP,QAAQ;AAAA,IACR,OAAO;AAAA,IACP,QAAQ;AAAA,IACR,QAAQ;AAAA,IACR,QAAQ;AAAA,IACR,QAAQ;AAAA,IACR,OAAO;AAAA,IACP,OAAO;AAAA,IACP,OAAO;AAAA,IACP,SAAS;AAAA,IACT,QAAQ;AAAA,IACR,OAAO;AAAA,IACP,QAAQ;AAAA,IACR,MAAM;AAAA,IACN,MAAM;AAAA,IACN,QAAQ;AAAA,IACR,QAAQ;AAAA,IACR,OAAO;AAAA,IACP,UAAU;AAAA,IACV,OAAO;AAAA,IACP,OAAO;AAAA,IACP,UAAU;AAAA,IACV,WAAW;AAAA,IACX,OAAO;AAAA,IACP,QAAQ;AAAA,IACR,aAAa;AAAA,EACf;AAEA,SAAO,YAAY,GAAG,KAAK;AAC7B;AAxLA;AAAA;AAAA;AAAA;AAAA;;;ACkBO,SAAS,eACd,SACA,UACkB;AAClB,QAAM,UAA4B;AAAA,IAChC,WAAW,CAAC;AAAA,IACZ,SAAS,CAAC;AAAA,IACV,YAAY,CAAC;AAAA,EACf;AAEA,QAAM,iBAAiB,SAAS,YAAY;AAE5C,UAAQ,gBAAgB;AAAA,IACtB,KAAK;AAAA,IACL,KAAK;AACH,cAAQ,YAAY,mBAAmB,OAAO;AAC9C,cAAQ,UAAU,iBAAiB,OAAO;AAC1C,cAAQ,aAAa,oBAAoB,OAAO;AAChD;AAAA,IAEF,KAAK;AAAA,IACL,KAAK;AACH,cAAQ,YAAY,mBAAmB,OAAO;AAC9C,cAAQ,UAAU,iBAAiB,OAAO;AAC1C;AAAA,IAEF,KAAK;AAAA,IACL,KAAK;AACH,cAAQ,YAAY,uBAAuB,OAAO;AAClD,cAAQ,UAAU,qBAAqB,OAAO;AAC9C;AAAA,IAEF,KAAK;AACH,cAAQ,YAAY,oBAAoB,OAAO;AAC/C,cAAQ,UAAU,kBAAkB,OAAO;AAC3C,cAAQ,aAAa,qBAAqB,OAAO;AACjD;AAAA,IAEF,KAAK;AAEH,cAAQ,YAAY,oBAAoB,OAAO;AAC/C,cAAQ,UAAU,qBAAqB,OAAO;AAC9C;AAAA,IAEF,KAAK;AACH,cAAQ,YAAY,mBAAmB,OAAO;AAC9C,cAAQ,aAAa,oBAAoB,OAAO;AAChD;AAAA,IAEF,KAAK;AACH,cAAQ,YAAY,qBAAqB,OAAO;AAChD,cAAQ,UAAU,mBAAmB,OAAO;AAC5C,cAAQ,aAAa,sBAAsB,OAAO;AAClD;AAAA,IAEF,KAAK;AAAA,IACL,KAAK;AACH,cAAQ,YAAY,uBAAuB,OAAO;AAClD,cAAQ,UAAU,qBAAqB,OAAO;AAC9C,cAAQ,aAAa,wBAAwB,OAAO;AACpD;AAAA,IAEF,KAAK;AAAA,IACL,KAAK;AACH,cAAQ,YAAY,qBAAqB,OAAO;AAChD,cAAQ,UAAU,mBAAmB,OAAO;AAC5C;AAAA,IAEF,KAAK;AAAA,IACL,KAAK;AACH,cAAQ,YAAY,qBAAqB,OAAO;AAChD;AAAA,EACJ;AAEA,SAAO;AACT;AAGA,SAAS,mBAAmB,SAA2B;AACrD,QAAM,QAAQ,oBAAI,IAAY;AAG9B,QAAM,kBAAkB,QAAQ,SAAS,qCAAqC;AAC9E,aAAW,SAAS,iBAAiB;AACnC,UAAM,IAAI,MAAM,CAAC,CAAC;AAAA,EACpB;AAGA,QAAM,eAAe,QAAQ,SAAS,8DAA8D;AACpG,aAAW,SAAS,cAAc;AAChC,UAAM,IAAI,MAAM,CAAC,CAAC;AAAA,EACpB;AAGA,QAAM,gBAAgB,QAAQ,SAAS,wCAAwC;AAC/E,aAAW,SAAS,eAAe;AAEjC,QAAI,CAAC,CAAC,MAAM,OAAO,SAAS,UAAU,OAAO,EAAE,SAAS,MAAM,CAAC,CAAC,GAAG;AACjE,YAAM,IAAI,MAAM,CAAC,CAAC;AAAA,IACpB;AAAA,EACF;AAGA,QAAM,gBAAgB,QAAQ,SAAS,8CAA8C;AACrF,aAAW,SAAS,eAAe;AACjC,UAAM,IAAI,MAAM,CAAC,CAAC;AAAA,EACpB;AAEA,SAAO,MAAM,KAAK,KAAK;AACzB;AAEA,SAAS,mBAAmB,SAA2B;AACrD,SAAO,mBAAmB,OAAO;AACnC;AAEA,SAAS,iBAAiB,SAA2B;AACnD,QAAM,QAAQ,oBAAI,IAAY;AAG9B,QAAM,eAAe,QAAQ,SAAS,8CAA8C;AACpF,aAAW,SAAS,cAAc;AAChC,UAAM,IAAI,MAAM,CAAC,CAAC;AAAA,EACpB;AAEA,SAAO,MAAM,KAAK,KAAK;AACzB;AAEA,SAAS,iBAAiB,SAA2B;AACnD,SAAO,iBAAiB,OAAO;AACjC;AAEA,SAAS,oBAAoB,SAA2B;AACtD,QAAM,QAAQ,oBAAI,IAAY;AAG9B,QAAM,mBAAmB,QAAQ,SAAS,kCAAkC;AAC5E,aAAW,SAAS,kBAAkB;AACpC,UAAM,IAAI,MAAM,CAAC,CAAC;AAAA,EACpB;AAGA,QAAM,cAAc,QAAQ,SAAS,iCAAiC;AACtE,aAAW,SAAS,aAAa;AAC/B,UAAM,IAAI,MAAM,CAAC,CAAC;AAAA,EACpB;AAEA,SAAO,MAAM,KAAK,KAAK;AACzB;AAGA,SAAS,uBAAuB,SAA2B;AACzD,QAAM,QAAQ,oBAAI,IAAY;AAG9B,QAAM,kBAAkB,QAAQ,SAAS,mBAAmB;AAC5D,aAAW,SAAS,iBAAiB;AACnC,UAAM,IAAI,MAAM,CAAC,CAAC;AAAA,EACpB;AAGA,QAAM,eAAe,QAAQ,SAAS,2BAA2B;AACjE,aAAW,SAAS,cAAc;AAChC,UAAM,IAAI,MAAM,CAAC,CAAC;AAAA,EACpB;AAEA,SAAO,MAAM,KAAK,KAAK;AACzB;AAEA,SAAS,qBAAqB,SAA2B;AACvD,QAAM,QAAQ,oBAAI,IAAY;AAG9B,QAAM,eAAe,QAAQ,SAAS,2BAA2B;AACjE,aAAW,SAAS,cAAc;AAChC,UAAM,IAAI,MAAM,CAAC,CAAC;AAAA,EACpB;AAEA,SAAO,MAAM,KAAK,KAAK;AACzB;AAGA,SAAS,oBAAoB,SAA2B;AACtD,QAAM,QAAQ,oBAAI,IAAY;AAG9B,QAAM,kBAAkB,QAAQ,SAAS,wDAAwD;AACjG,aAAW,SAAS,iBAAiB;AACnC,UAAM,IAAI,MAAM,CAAC,CAAC;AAAA,EACpB;AAEA,SAAO,MAAM,KAAK,KAAK;AACzB;AAEA,SAAS,kBAAkB,SAA2B;AACpD,QAAM,QAAQ,oBAAI,IAAY;AAG9B,QAAM,eAAe,QAAQ,SAAS,gCAAgC;AACtE,aAAW,SAAS,cAAc;AAChC,UAAM,IAAI,MAAM,CAAC,CAAC;AAAA,EACpB;AAEA,SAAO,MAAM,KAAK,KAAK;AACzB;AAEA,SAAS,qBAAqB,SAA2B;AACvD,QAAM,QAAQ,oBAAI,IAAY;AAG9B,QAAM,mBAAmB,QAAQ,SAAS,oBAAoB;AAC9D,aAAW,SAAS,kBAAkB;AACpC,UAAM,IAAI,MAAM,CAAC,CAAC;AAAA,EACpB;AAGA,QAAM,eAAe,QAAQ,SAAS,gBAAgB;AACtD,aAAW,SAAS,cAAc;AAChC,UAAM,IAAI,MAAM,CAAC,CAAC;AAAA,EACpB;AAEA,SAAO,MAAM,KAAK,KAAK;AACzB;AAGA,SAAS,mBAAmB,SAA2B;AACrD,QAAM,QAAQ,oBAAI,IAAY;AAG9B,QAAM,kBAAkB,QAAQ,SAAS,4CAA4C;AACrF,aAAW,SAAS,iBAAiB;AACnC,UAAM,IAAI,MAAM,CAAC,CAAC;AAAA,EACpB;AAEA,SAAO,MAAM,KAAK,KAAK;AACzB;AAEA,SAAS,oBAAoB,SAA2B;AACtD,QAAM,QAAQ,oBAAI,IAAY;AAG9B,QAAM,mBAAmB,QAAQ,SAAS,gCAAgC;AAC1E,aAAW,SAAS,kBAAkB;AACpC,UAAM,IAAI,MAAM,CAAC,CAAC;AAAA,EACpB;AAGA,QAAM,gBAAgB,QAAQ,SAAS,6BAA6B;AACpE,aAAW,SAAS,eAAe;AACjC,UAAM,IAAI,MAAM,CAAC,CAAC;AAAA,EACpB;AAEA,SAAO,MAAM,KAAK,KAAK;AACzB;AAGA,SAAS,qBAAqB,SAA2B;AACvD,QAAM,QAAQ,oBAAI,IAAY;AAG9B,QAAM,gBAAgB,QAAQ,SAAS,gFAAgF;AACvH,aAAW,SAAS,eAAe;AACjC,UAAM,IAAI,MAAM,CAAC,CAAC;AAAA,EACpB;AAEA,SAAO,MAAM,KAAK,KAAK;AACzB;AAEA,SAAS,mBAAmB,SAA2B;AACrD,QAAM,QAAQ,oBAAI,IAAY;AAG9B,QAAM,eAAe,QAAQ,SAAS,8CAA8C;AACpF,aAAW,SAAS,cAAc;AAChC,UAAM,IAAI,MAAM,CAAC,CAAC;AAAA,EACpB;AAEA,SAAO,MAAM,KAAK,KAAK;AACzB;AAEA,SAAS,sBAAsB,SAA2B;AACxD,QAAM,QAAQ,oBAAI,IAAY;AAG9B,QAAM,mBAAmB,QAAQ,SAAS,kCAAkC;AAC5E,aAAW,SAAS,kBAAkB;AACpC,UAAM,IAAI,MAAM,CAAC,CAAC;AAAA,EACpB;AAEA,SAAO,MAAM,KAAK,KAAK;AACzB;AAGA,SAAS,uBAAuB,SAA2B;AACzD,QAAM,QAAQ,oBAAI,IAAY;AAG9B,QAAM,gBAAgB,QAAQ,SAAS,sGAAsG;AAC7I,aAAW,SAAS,eAAe;AACjC,UAAM,IAAI,MAAM,CAAC,CAAC;AAAA,EACpB;AAEA,SAAO,MAAM,KAAK,KAAK;AACzB;AAEA,SAAS,qBAAqB,SAA2B;AACvD,QAAM,QAAQ,oBAAI,IAAY;AAG9B,QAAM,eAAe,QAAQ,SAAS,uDAAuD;AAC7F,aAAW,SAAS,cAAc;AAChC,UAAM,IAAI,MAAM,CAAC,CAAC;AAAA,EACpB;AAEA,SAAO,MAAM,KAAK,KAAK;AACzB;AAEA,SAAS,wBAAwB,SAA2B;AAC1D,QAAM,QAAQ,oBAAI,IAAY;AAG9B,QAAM,mBAAmB,QAAQ,SAAS,2CAA2C;AACrF,aAAW,SAAS,kBAAkB;AACpC,UAAM,IAAI,MAAM,CAAC,CAAC;AAAA,EACpB;AAEA,SAAO,MAAM,KAAK,KAAK;AACzB;AAGA,SAAS,qBAAqB,SAA2B;AACvD,QAAM,QAAQ,oBAAI,IAAY;AAG9B,QAAM,gBAAgB,QAAQ,SAAS,yBAAyB;AAChE,aAAW,SAAS,eAAe;AACjC,UAAM,IAAI,MAAM,CAAC,CAAC;AAAA,EACpB;AAEA,SAAO,MAAM,KAAK,KAAK;AACzB;AAEA,SAAS,mBAAmB,SAA2B;AACrD,QAAM,QAAQ,oBAAI,IAAY;AAG9B,QAAM,eAAe,QAAQ,SAAS,gBAAgB;AACtD,aAAW,SAAS,cAAc;AAChC,UAAM,IAAI,MAAM,CAAC,CAAC;AAAA,EACpB;AAGA,QAAM,gBAAgB,QAAQ,SAAS,iBAAiB;AACxD,aAAW,SAAS,eAAe;AACjC,UAAM,IAAI,MAAM,CAAC,CAAC;AAAA,EACpB;AAEA,SAAO,MAAM,KAAK,KAAK;AACzB;AAGA,SAAS,qBAAqB,SAA2B;AACvD,QAAM,QAAQ,oBAAI,IAAY;AAG9B,QAAM,kBAAkB,QAAQ,SAAS,6BAA6B;AACtE,aAAW,SAAS,iBAAiB;AACnC,UAAM,IAAI,MAAM,CAAC,CAAC;AAAA,EACpB;AAGA,QAAM,gBAAgB,QAAQ,SAAS,4BAA4B;AACnE,aAAW,SAAS,eAAe;AACjC,UAAM,IAAI,MAAM,CAAC,CAAC;AAAA,EACpB;AAGA,QAAM,eAAe,QAAQ,SAAS,2BAA2B;AACjE,aAAW,SAAS,cAAc;AAChC,UAAM,IAAI,MAAM,CAAC,CAAC;AAAA,EACpB;AAEA,SAAO,MAAM,KAAK,KAAK;AACzB;AAGA,SAAS,oBAAoB,SAA2B;AACtD,QAAM,QAAQ,oBAAI,IAAY;AAG9B,QAAM,cAAc,QAAQ,MAAM,mCAAmC;AACrE,MAAI,CAAC,YAAa,QAAO,CAAC;AAE1B,QAAM,gBAAgB,YAAY,CAAC;AAGnC,QAAM,qBAAqB,cAAc,SAAS,iCAAiC;AACnF,aAAW,SAAS,oBAAoB;AACtC,UAAM,IAAI,MAAM,CAAC,CAAC;AAAA,EACpB;AAGA,QAAM,gBAAgB,cAAc,SAAS,wBAAwB;AACrE,aAAW,SAAS,eAAe;AACjC,UAAM,IAAI,MAAM,CAAC,CAAC;AAAA,EACpB;AAEA,SAAO,MAAM,KAAK,KAAK;AACzB;AAGA,SAAS,qBAAqB,SAA2B;AACvD,QAAM,QAAQ,oBAAI,IAAY;AAG9B,QAAM,cAAc,QAAQ,MAAM,mCAAmC;AACrE,MAAI,CAAC,YAAa,QAAO,CAAC;AAE1B,QAAM,gBAAgB,YAAY,CAAC;AAGnC,QAAM,YAAY,cAAc,MAAM,uBAAuB;AAC7D,MAAI,WAAW;AACb,UAAM,IAAI,UAAU,CAAC,CAAC;AAAA,EACxB;AAGA,QAAM,uBAAuB,cAAc,MAAM,sBAAsB;AACvE,MAAI,sBAAsB;AACxB,UAAM,IAAI,cAAc;AAAA,EAC1B;AAEA,SAAO,MAAM,KAAK,KAAK;AACzB;AAlcA;AAAA;AAAA;AAAA;AAAA;;;ACAA,OAAO,YAAY;AACnB,OAAO,gBAAgB;AACvB,OAAO,gBAAgB;AACvB,OAAO,eAAe;AACtB,OAAO,YAAY;AACnB,SAAS,eAAe;AA2BxB,SAAS,UAAU,UAAqC;AACtD,MAAI,CAAC,YAAY,IAAI,QAAQ,GAAG;AAC9B,UAAM,SAAS,IAAI,OAAO;AAC1B,UAAM,UAAU,eAAe,QAAQ;AAEvC,QAAI,CAAC,SAAS;AACZ,YAAM,IAAI,MAAM,sCAAsC,QAAQ,EAAE;AAAA,IAClE;AAEA,WAAO,YAAY,OAAO;AAC1B,gBAAY,IAAI,UAAU,MAAM;AAAA,EAClC;AAEA,SAAO,YAAY,IAAI,QAAQ;AACjC;AAMO,SAASE,gBAAe,UAA4C;AAGzE,QAAM,MAAM,QAAQ,QAAQ,EAAE,MAAM,CAAC,EAAE,YAAY;AAEnD,UAAQ,KAAK;AAAA,IACX,KAAK;AAAA,IACL,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AACH,aAAO;AAAA,IACT;AACE,aAAO;AAAA,EACX;AACF;AAKO,SAAS,eAAe,UAA2B;AACxD,SAAOA,gBAAe,QAAQ,MAAM;AACtC;AAaO,SAAS,SAAS,SAAiB,UAA6C;AACrF,MAAI;AACF,UAAM,SAAS,UAAU,QAAQ;AACjC,UAAM,OAAO,OAAO,MAAM,OAAO;AAGjC,QAAI,KAAK,SAAS,UAAU;AAC1B,aAAO;AAAA,QACL;AAAA,QACA,OAAO;AAAA,MACT;AAAA,IACF;AAEA,WAAO,EAAE,KAAK;AAAA,EAChB,SAAS,OAAO;AACd,WAAO;AAAA,MACL,MAAM;AAAA,MACN,OAAO,iBAAiB,QAAQ,MAAM,UAAU;AAAA,IAClD;AAAA,EACF;AACF;AAjHA,IAWM,aAWA;AAtBN;AAAA;AAAA;AAWA,IAAM,cAAc,oBAAI,IAA+B;AAWvD,IAAM,iBAAgE;AAAA,MACpE,YAAY,WAAW;AAAA,MACvB,YAAY;AAAA,MACZ,KAAK,UAAU;AAAA;AAAA,MACf,QAAQ;AAAA,IACV;AAAA;AAAA;;;ACcO,SAAS,oBAAoB,MAAiC;AACnE,MAAI,aAAa;AAEjB,WAAS,SAAS,GAAsB;AACtC,QAAI,gBAAgB,SAAS,EAAE,IAAI,GAAG;AAEpC,UAAI,EAAE,SAAS,qBAAqB;AAClC,cAAM,WAAW,EAAE,kBAAkB,UAAU;AAC/C,YAAI,aAAa,SAAS,SAAS,QAAQ,SAAS,SAAS,OAAO;AAClE;AAAA,QACF;AAAA,MACF,OAAO;AACL;AAAA,MACF;AAAA,IACF;AAGA,aAAS,IAAI,GAAG,IAAI,EAAE,iBAAiB,KAAK;AAC1C,YAAM,QAAQ,EAAE,WAAW,CAAC;AAC5B,UAAI,MAAO,UAAS,KAAK;AAAA,IAC3B;AAAA,EACF;AAEA,WAAS,IAAI;AACb,SAAO;AACT;AAlEA,IAOM;AAPN;AAAA;AAAA;AAOA,IAAM,kBAAkB;AAAA;AAAA,MAEtB;AAAA;AAAA,MACA;AAAA;AAAA,MACA;AAAA;AAAA,MACA;AAAA;AAAA,MACA;AAAA;AAAA,MACA;AAAA;AAAA,MACA;AAAA;AAAA;AAAA,MAGA;AAAA;AAAA,MACA;AAAA;AAAA,MACA;AAAA;AAAA;AAAA,MAGA;AAAA;AAAA;AAAA,MAGA;AAAA;AAAA;AAAA,MAEA;AAAA;AAAA,MACA;AAAA;AAAA,IACF;AAAA;AAAA;;;ACLA,SAAS,mBAAmB,MAAwC;AAClE,MAAI,KAAK,SAAS,uBAAuB,KAAK,SAAS,oBAAoB;AACzE,WAAO;AAAA,EACT;AACA,QAAM,WAAW,KAAK,kBAAkB,UAAU;AAClD,QAAM,SAAS,UAAU;AAEzB,MAAI,WAAW,QAAQ,WAAW,MAAO,QAAO;AAChD,MAAI,WAAW,QAAQ,WAAW,KAAM,QAAO;AAC/C,SAAO;AACT;AAKA,SAAS,qBACP,QACA,OACA,cACQ;AACR,QAAM,cAAc,OAAO,kBAAkB,WAAW,MAAM;AAC9D,QAAM,eAAe,kBAAkB,IAAI,MAAM,IAAI;AACrD,SAAQ,CAAC,eAAe,CAAC,eAAgB,eAAe,IAAI;AAC9D;AAKA,SAAS,yBAAyB,UAAkB,cAA8B;AAChF,SAAQ,aAAa,IAAI,QAAQ,KAAK,eAAe,IAAK,IAAI;AAChE;AAGA,SAAS,wBACP,GACA,OACA,IACA,KACM;AACN,QAAM,WAAW,EAAE,kBAAkB,UAAU;AAC/C,WAAS,IAAI,GAAG,IAAI,EAAE,iBAAiB,KAAK;AAC1C,UAAM,QAAQ,EAAE,WAAW,CAAC;AAC5B,QAAI,SAAS,UAAU,SAAU,KAAI,SAAS,OAAO,OAAO,EAAE;AAAA,EAChE;AACF;AAGA,SAAS,wBACP,GACA,OACA,KACM;AACN,WAAS,IAAI,GAAG,IAAI,EAAE,iBAAiB,KAAK;AAC1C,UAAM,QAAQ,EAAE,WAAW,CAAC;AAC5B,QAAI,MAAO,KAAI,SAAS,OAAO,qBAAqB,GAAG,OAAO,KAAK,GAAG,IAAI;AAAA,EAC5E;AACF;AAGA,SAAS,oBACP,GACA,OACA,KACM;AACN,WAAS,IAAI,GAAG,IAAI,EAAE,iBAAiB,KAAK;AAC1C,UAAM,QAAQ,EAAE,WAAW,CAAC;AAC5B,QAAI,MAAO,KAAI,SAAS,OAAO,OAAO,IAAI;AAAA,EAC5C;AACF;AAeO,SAAS,6BAA6B,MAAiC;AAC5E,MAAI,aAAa;AACjB,QAAM,MAAwB,EAAE,SAAS;AAEzC,WAAS,SAAS,GAAsB,cAAsB,eAAoC;AAChG,UAAM,YAAY,mBAAmB,CAAC;AAEtC,QAAI,WAAW;AACb,oBAAe,kBAAkB,YAAa,IAAI;AAClD,8BAAwB,GAAG,cAAc,WAAW,GAAG;AACvD;AAAA,IACF;AAEA,QAAI,cAAc,IAAI,EAAE,IAAI,GAAG;AAC7B,oBAAc,IAAI;AAClB,8BAAwB,GAAG,cAAc,GAAG;AAC5C;AAAA,IACF;AAEA,QAAI,kBAAkB,IAAI,EAAE,IAAI,GAAG;AACjC,oBAAc;AACd,0BAAoB,GAAG,eAAe,GAAG,GAAG;AAC5C;AAAA,IACF;AAEA,kBAAc,yBAAyB,EAAE,MAAM,YAAY;AAC3D,wBAAoB,GAAG,cAAc,GAAG;AAAA,EAC1C;AAEA,WAAS,MAAM,GAAG,IAAI;AACtB,SAAO;AACT;AA3IA,IAGM,eAOA,mBAKA;AAfN;AAAA;AAAA;AAGA,IAAM,gBAAgB,oBAAI,IAAI;AAAA,MAC5B;AAAA,MAAgB;AAAA,MAAiB;AAAA,MAAmB;AAAA,MACpD;AAAA,MAAgB;AAAA,MAAiB;AAAA,MAAgB;AAAA,MACjD;AAAA,MAAoB;AAAA,MAAqB;AAAA,IAC3C,CAAC;AAGD,IAAM,oBAAoB,oBAAI,IAAI;AAAA,MAChC;AAAA,MAAe;AAAA,MAAe;AAAA,MAAsB;AAAA,IACtD,CAAC;AAGD,IAAM,eAAe,oBAAI,IAAI,CAAC,kBAAkB,uBAAuB,QAAQ,CAAC;AAAA;AAAA;;;ACgKhF,SAAS,mBAAmB,UAA+B;AACzD,SAAO,iBAAiB,QAAQ,KAAK,iBAAiB;AACxD;AAKA,SAAS,oBAAoB,UAA+B;AAC1D,SAAO,kBAAkB,QAAQ,KAAK,kBAAkB;AAC1D;AAKA,SAAS,WAAW,MAAyB,UAA2B;AACtE,QAAM,WAAW,KAAK;AACtB,QAAM,WAAW,KAAK;AAGtB,MAAI,oBAAoB,IAAI,QAAQ,GAAG;AACrC,WAAO;AAAA,EACT;AAGA,QAAM,UAAU,mBAAmB,QAAQ;AAC3C,QAAM,WAAW,oBAAoB,QAAQ;AAE7C,SAAO,QAAQ,IAAI,QAAQ,KAAK,SAAS,IAAI,QAAQ;AACvD;AAKA,SAAS,UAAU,MAAkC;AACnD,SAAO,mBAAmB,IAAI,KAAK,IAAI;AACzC;AAKA,SAAS,eAAe,MAAiC;AAEvD,MAAI,oBAAoB,IAAI,KAAK,IAAI,GAAG;AAEtC,UAAM,WAAW,KAAK,kBAAkB,UAAU;AAClD,QAAI,UAAU;AACZ,aAAO,SAAS;AAAA,IAClB;AACA,WAAO,KAAK;AAAA,EACd;AACA,SAAO,KAAK;AACd;AAKA,SAAS,cAAc,MAAiC;AACtD,SAAO,KAAK;AACd;AAKA,SAAS,UAAU,KAAkC;AACnD,MAAI,MAAM;AACV,aAAW,SAAS,IAAI,OAAO,GAAG;AAChC,WAAO;AAAA,EACT;AACA,SAAO;AACT;AASO,SAAS,cAAc,MAAyB,UAAkC;AACvF,QAAM,YAAY,oBAAI,IAAoB;AAC1C,QAAM,WAAW,oBAAI,IAAoB;AAEzC,WAAS,SAAS,GAA4B;AAE5C,QAAI,WAAW,GAAG,QAAQ,GAAG;AAC3B,YAAM,MAAM,eAAe,CAAC;AAC5B,gBAAU,IAAI,MAAM,UAAU,IAAI,GAAG,KAAK,KAAK,CAAC;AAAA,IAClD;AAGA,QAAI,UAAU,CAAC,GAAG;AAChB,YAAM,MAAM,cAAc,CAAC;AAC3B,eAAS,IAAI,MAAM,SAAS,IAAI,GAAG,KAAK,KAAK,CAAC;AAAA,IAChD;AAGA,eAAW,SAAS,EAAE,UAAU;AAC9B,eAAS,KAAK;AAAA,IAChB;AAAA,EACF;AAEA,WAAS,IAAI;AAEb,SAAO;AAAA,IACL,IAAI,UAAU;AAAA,IACd,IAAI,SAAS;AAAA,IACb,IAAI,UAAU,SAAS;AAAA,IACvB,IAAI,UAAU,QAAQ;AAAA,IACtB;AAAA,IACA;AAAA,EACF;AACF;AAiBO,SAAS,yBAAyB,QAAyC;AAChF,QAAM,EAAE,IAAI,IAAI,IAAI,GAAG,IAAI;AAE3B,QAAM,aAAa,KAAK;AACxB,QAAM,SAAS,KAAK;AAGpB,QAAM,SAAS,aAAa,IAAI,SAAS,KAAK,KAAK,UAAU,IAAI;AACjE,QAAM,aAAa,KAAK,IAAK,KAAK,KAAM,KAAK,MAAM;AACnD,QAAM,SAAS,aAAa;AAC5B,QAAM,OAAO,SAAS;AACtB,QAAM,OAAO,SAAS;AAEtB,SAAO;AAAA,IACL,YAAY,KAAK,MAAM,UAAU;AAAA,IACjC,QAAQ,KAAK,MAAM,MAAM;AAAA,IACzB,QAAQ,KAAK,MAAM,SAAS,GAAG,IAAI;AAAA,IACnC,YAAY,KAAK,MAAM,aAAa,GAAG,IAAI;AAAA,IAC3C,QAAQ,KAAK,MAAM,MAAM;AAAA,IACzB,MAAM,KAAK,MAAM,IAAI;AAAA,IACrB,MAAM,KAAK,MAAM,OAAO,GAAI,IAAI;AAAA,EAClC;AACF;AAWO,SAAS,kBAAkB,MAAyB,UAAmC;AAC5F,QAAM,SAAS,cAAc,MAAM,QAAQ;AAC3C,SAAO,yBAAyB,MAAM;AACxC;AAnVA,IA2BM,kBAyDA,mBAkCA,qBA2BA;AAjJN;AAAA;AAAA;AA2BA,IAAM,mBAAgD;AAAA,MACpD,YAAY,oBAAI,IAAI;AAAA;AAAA,QAElB;AAAA,QAAK;AAAA,QAAK;AAAA,QAAK;AAAA,QAAK;AAAA,QAAK;AAAA;AAAA,QAEzB;AAAA,QAAM;AAAA,QAAO;AAAA,QAAM;AAAA,QAAO;AAAA,QAAK;AAAA,QAAK;AAAA,QAAM;AAAA;AAAA,QAE1C;AAAA,QAAM;AAAA,QAAM;AAAA,QAAK;AAAA;AAAA,QAEjB;AAAA,QAAK;AAAA,QAAM;AAAA,QAAM;AAAA,QAAM;AAAA,QAAM;AAAA,QAAM;AAAA,QAAO;AAAA,QAAO;AAAA,QAAO;AAAA;AAAA,QAExD;AAAA,QAAK;AAAA,QAAK;AAAA,QAAK;AAAA,QAAK;AAAA,QAAM;AAAA,QAAM;AAAA,QAChC;AAAA,QAAM;AAAA,QAAM;AAAA,QAAM;AAAA,QAAO;AAAA,QAAO;AAAA;AAAA,QAEhC;AAAA,QAAK;AAAA,QAAK;AAAA,QAAK;AAAA,QAAM;AAAA,QAAM;AAAA,QAAM;AAAA,QAAO;AAAA;AAAA,QAExC;AAAA,QAAK;AAAA,QAAK;AAAA,QAAK;AAAA,QAAK;AAAA,QAAK;AAAA,MAC3B,CAAC;AAAA,MACD,QAAQ,oBAAI,IAAI;AAAA;AAAA,QAEd;AAAA,QAAK;AAAA,QAAK;AAAA,QAAK;AAAA,QAAK;AAAA,QAAK;AAAA,QAAM;AAAA;AAAA,QAE/B;AAAA,QAAM;AAAA,QAAM;AAAA,QAAK;AAAA,QAAK;AAAA,QAAM;AAAA;AAAA;AAAA,QAG5B;AAAA,QAAK;AAAA,QAAM;AAAA,QAAM;AAAA,QAAM;AAAA,QAAM;AAAA,QAAM;AAAA,QAAO;AAAA,QAC1C;AAAA,QAAM;AAAA,QAAM;AAAA,QAAM;AAAA,QAAO;AAAA;AAAA,QAEzB;AAAA,QAAK;AAAA,QAAK;AAAA,QAAK;AAAA,QAAK;AAAA,QAAM;AAAA;AAAA,QAE1B;AAAA,QAAK;AAAA,QAAK;AAAA,QAAM;AAAA,QAChB;AAAA,QAAK;AAAA,QAAK;AAAA,QAAK;AAAA,QAAK;AAAA,QAAK;AAAA,MAC3B,CAAC;AAAA,MACD,KAAK,oBAAI,IAAI;AAAA;AAAA,QAEX;AAAA,QAAK;AAAA,QAAK;AAAA,QAAK;AAAA,QAAK;AAAA,QAAK;AAAA;AAAA,QAEzB;AAAA,QAAM;AAAA,QAAO;AAAA,QAAM;AAAA,QAAO;AAAA,QAAM;AAAA,QAAK;AAAA,QAAK;AAAA,QAAM;AAAA,QAAM;AAAA;AAAA,QAEtD;AAAA,QAAM;AAAA,QAAM;AAAA,QAAK;AAAA,QAAO;AAAA,QAAM;AAAA;AAAA,QAE9B;AAAA,QAAK;AAAA,QAAM;AAAA,QAAM;AAAA,QAAM;AAAA,QAAM;AAAA,QAAM;AAAA,QAAO;AAAA,QAC1C;AAAA,QAAM;AAAA,QAAM;AAAA,QAAM;AAAA,QAAO;AAAA,QAAO;AAAA;AAAA,QAEhC;AAAA,QAAK;AAAA,QAAK;AAAA,QAAK;AAAA,QAAK;AAAA,QAAM;AAAA;AAAA,QAE1B;AAAA;AAAA,QAEA;AAAA,QAAK;AAAA,QAAK;AAAA,QAAM;AAAA,QAAM;AAAA,QAAM;AAAA,QAAM;AAAA,QAClC;AAAA,QAAK;AAAA,QAAK;AAAA,QAAK;AAAA,QAAK;AAAA,QAAK;AAAA,MAC3B,CAAC;AAAA,IACH;AAMA,IAAM,oBAAiD;AAAA,MACrD,YAAY,oBAAI,IAAI;AAAA,QAClB;AAAA,QAAM;AAAA,QAAQ;AAAA,QAAO;AAAA,QAAS;AAAA,QAAM;AAAA,QAAU;AAAA,QAAQ;AAAA,QACtD;AAAA,QAAU;AAAA,QAAS;AAAA,QAAO;AAAA,QAAS;AAAA,QACnC;AAAA,QAAO;AAAA,QAAU;AAAA,QAAU;AAAA,QAAc;AAAA,QAAM;AAAA,QAC/C;AAAA,QAAS;AAAA,QAAS;AAAA,QAAS;AAAA,QAC3B;AAAA,QAAS;AAAA,QAAO;AAAA,QAAO;AAAA,QAAY;AAAA,QAAS;AAAA,QAAW;AAAA,QACvD;AAAA,QAAU;AAAA,QAAU;AAAA,QAAQ;AAAA,MAC9B,CAAC;AAAA,MACD,QAAQ,oBAAI,IAAI;AAAA,QACd;AAAA,QAAM;AAAA,QAAQ;AAAA,QAAQ;AAAA,QAAO;AAAA,QAAS;AAAA,QAAS;AAAA,QAC/C;AAAA,QAAU;AAAA,QAAS;AAAA,QAAO;AAAA,QAAU;AAAA,QACpC;AAAA,QAAO;AAAA,QAAM;AAAA,QAAO;AAAA,QAAM;AAAA,QAC1B;AAAA,QAAS;AAAA,QAAS;AAAA,QAAS;AAAA,QAAY;AAAA,QACvC;AAAA,QAAO;AAAA,QAAS;AAAA,QAAU;AAAA,QAC1B;AAAA,QAAU;AAAA,QAAQ;AAAA,QAAM;AAAA,QACxB;AAAA,QAAU;AAAA,QAAY;AAAA,QAAO;AAAA,MAC/B,CAAC;AAAA,MACD,KAAK,oBAAI,IAAI;AAAA,QACX;AAAA,QAAM;AAAA,QAAU;AAAA,QAAQ;AAAA,QAAO;AAAA,QAAW;AAAA,QAAS;AAAA,QAAM;AAAA,QAAU;AAAA,QAAQ;AAAA,QAAW;AAAA,QACtF;AAAA,QAAU;AAAA,QAAS;AAAA,QAAO;AAAA,QAAS;AAAA,QACnC;AAAA,QAAO;AAAA,QAAS;AAAA,QAChB;AAAA,QAAS;AAAA,QAAS;AAAA,QAClB;AAAA,QAAY;AAAA,QAAS;AAAA,QAAW;AAAA,QAAc;AAAA,QAAS;AAAA,QACvD;AAAA,QAAO;AAAA,QAAa;AAAA,QACpB;AAAA,QAAQ;AAAA,QAAS;AAAA,QAAW;AAAA,QAAW;AAAA,QAAgB;AAAA,QACvD;AAAA,QAAU;AAAA,QAAU;AAAA,QAAS;AAAA,QAAU;AAAA,QAAW;AAAA,QAAa;AAAA,MACjE,CAAC;AAAA,IACH;AAMA,IAAM,sBAAsB,oBAAI,IAAI;AAAA;AAAA,MAElC;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA;AAAA,MAGA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA;AAAA,MAGA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF,CAAC;AAKD,IAAM,qBAAqB,oBAAI,IAAI;AAAA;AAAA,MAEjC;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA;AAAA,MAGA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA;AAAA,MAGA;AAAA,MACA;AAAA,MACA;AAAA,IACF,CAAC;AAAA;AAAA;;;AC1KD;AAAA;AAAA;AASA;AACA;AACA;AAAA;AAAA;;;ACKA,SAAS,oBACP,MACA,SACA,aACmB;AACjB,QAAM,WAAW,KAAK,kBAAkB,MAAM;AAC9C,MAAI,CAAC,SAAU,QAAO;AAEtB,SAAO;AAAA,IACL,MAAM,SAAS;AAAA,IACf,MAAM,cAAc,WAAW;AAAA,IAC/B,WAAW,KAAK,cAAc,MAAM;AAAA,IACpC,SAAS,KAAK,YAAY,MAAM;AAAA,IAChC;AAAA,IACA,WAAW,iBAAiB,MAAM,OAAO;AAAA,IACzC,YAAY,kBAAkB,MAAM,OAAO;AAAA,IAC3C,YAAY,kBAAkB,MAAM,OAAO;AAAA,IAC3C,YAAY,oBAAoB,IAAI;AAAA,EACtC;AACF;AAKF,SAAS,yBACP,MACA,SACA,aACmB;AAEjB,QAAM,SAAS,KAAK;AACpB,MAAI,OAAO;AAEX,MAAI,QAAQ,SAAS,uBAAuB;AAC1C,UAAM,WAAW,OAAO,kBAAkB,MAAM;AAChD,WAAO,UAAU,QAAQ;AAAA,EAC3B;AAEA,SAAO;AAAA,IACL;AAAA,IACA,MAAM,cAAc,WAAW;AAAA,IAC/B,WAAW,KAAK,cAAc,MAAM;AAAA,IACpC,SAAS,KAAK,YAAY,MAAM;AAAA,IAChC;AAAA,IACA,WAAW,iBAAiB,MAAM,OAAO;AAAA,IACzC,YAAY,kBAAkB,MAAM,OAAO;AAAA,IAC3C,YAAY,oBAAoB,IAAI;AAAA,EACtC;AACF;AAKF,SAAS,kBACP,MACA,SACA,aACmB;AACjB,QAAM,WAAW,KAAK,kBAAkB,MAAM;AAC9C,MAAI,CAAC,SAAU,QAAO;AAEtB,SAAO;AAAA,IACL,MAAM,SAAS;AAAA,IACf,MAAM;AAAA,IACN,WAAW,KAAK,cAAc,MAAM;AAAA,IACpC,SAAS,KAAK,YAAY,MAAM;AAAA,IAChC;AAAA,IACA,WAAW,iBAAiB,MAAM,OAAO;AAAA,IACzC,YAAY,kBAAkB,MAAM,OAAO;AAAA,IAC3C,YAAY,kBAAkB,MAAM,OAAO;AAAA,IAC3C,YAAY,oBAAoB,IAAI;AAAA,EACtC;AACF;AAKF,SAAS,iBACP,MACA,UACA,cACmB;AACjB,QAAM,WAAW,KAAK,kBAAkB,MAAM;AAC9C,MAAI,CAAC,SAAU,QAAO;AAEtB,SAAO;AAAA,IACL,MAAM,SAAS;AAAA,IACf,MAAM;AAAA,IACN,WAAW,KAAK,cAAc,MAAM;AAAA,IACpC,SAAS,KAAK,YAAY,MAAM;AAAA,IAChC,WAAW,SAAS,SAAS,IAAI;AAAA,EACnC;AACF;AAKF,SAAS,qBACP,MACA,UACA,cACmB;AACjB,QAAM,WAAW,KAAK,kBAAkB,MAAM;AAC9C,MAAI,CAAC,SAAU,QAAO;AAEtB,SAAO;AAAA,IACL,MAAM,SAAS;AAAA,IACf,MAAM;AAAA,IACN,WAAW,KAAK,cAAc,MAAM;AAAA,IACpC,SAAS,KAAK,YAAY,MAAM;AAAA,IAChC,WAAW,aAAa,SAAS,IAAI;AAAA,EACvC;AACF;AAKF,SAAS,0BACP,MACA,SACA,aACmB;AACjB,QAAM,WAAW,KAAK,kBAAkB,MAAM;AAC9C,MAAI,CAAC,SAAU,QAAO;AAEtB,SAAO;AAAA,IACL,MAAM,SAAS;AAAA,IACf,MAAM,cAAc,WAAW;AAAA,IAC/B,WAAW,KAAK,cAAc,MAAM;AAAA,IACpC,SAAS,KAAK,YAAY,MAAM;AAAA,IAChC;AAAA,IACA,WAAW,iBAAiB,MAAM,OAAO;AAAA,IACzC,YAAY,kBAAkB,MAAM,OAAO;AAAA,IAC3C,YAAY,oBAAoB,IAAI;AAAA,EACtC;AACF;AAKF,SAAS,uBACP,MACA,UACA,cACmB;AACjB,QAAM,WAAW,KAAK,kBAAkB,MAAM;AAC9C,MAAI,CAAC,SAAU,QAAO;AAEtB,SAAO;AAAA,IACL,MAAM,SAAS;AAAA,IACf,MAAM;AAAA,IACN,WAAW,KAAK,cAAc,MAAM;AAAA,IACpC,SAAS,KAAK,YAAY,MAAM;AAAA,IAChC,WAAW,SAAS,SAAS,IAAI;AAAA,EACnC;AACF;AA0CK,SAAS,kBACd,MACA,SACA,aACA,UACmB;AAGnB,MAAI,KAAK,SAAS,yBAAyB,aAAa,UAAU;AAChE,WAAO,0BAA0B,MAAM,SAAS,WAAW;AAAA,EAC7D;AAEA,QAAM,YAAY,iBAAiB,KAAK,IAAI;AAC5C,SAAO,YAAY,UAAU,MAAM,SAAS,WAAW,IAAI;AAC7D;AAKA,SAAS,iBAAiB,MAAyB,SAAyB;AAE1E,QAAM,YAAY,KAAK,cAAc;AACrC,QAAM,QAAQ,QAAQ,MAAM,IAAI;AAChC,MAAI,YAAY,MAAM,SAAS,KAAK;AAGpC,MAAI,cAAc;AAClB,SAAO,cAAc,KAAK,YAAY,OAAO,CAAC,UAAU,SAAS,GAAG,KAAK,CAAC,UAAU,SAAS,IAAI,GAAG;AAClG;AACA,iBAAa,OAAO,MAAM,WAAW,KAAK;AAAA,EAC5C;AAGA,cAAY,UAAU,MAAM,GAAG,EAAE,CAAC,EAAE,MAAM,IAAI,EAAE,CAAC,EAAE,KAAK;AAGxD,MAAI,UAAU,SAAS,KAAK;AAC1B,gBAAY,UAAU,UAAU,GAAG,GAAG,IAAI;AAAA,EAC5C;AAEA,SAAO;AACT;AAQA,SAAS,kBAAkB,MAAyB,UAA4B;AAC9E,QAAM,aAAuB,CAAC;AAG9B,QAAM,aAAa,KAAK,kBAAkB,YAAY;AACtD,MAAI,CAAC,WAAY,QAAO;AAGxB,WAAS,IAAI,GAAG,IAAI,WAAW,iBAAiB,KAAK;AACnD,UAAM,QAAQ,WAAW,WAAW,CAAC;AACrC,QAAI,OAAO;AACT,iBAAW,KAAK,MAAM,IAAI;AAAA,IAC5B;AAAA,EACF;AAEA,SAAO;AACT;AAQA,SAAS,kBAAkB,MAAyB,UAAsC;AACxF,QAAM,iBAAiB,KAAK,kBAAkB,aAAa;AAC3D,MAAI,CAAC,eAAgB,QAAO;AAE5B,SAAO,eAAe;AACxB;AAKO,SAAS,eAAe,UAAuC;AACpE,QAAM,UAAoB,CAAC;AAE3B,WAAS,SAAS,MAAyB;AAEzC,QAAI,KAAK,SAAS,oBAAoB;AAEpC,YAAM,aAAa,KAAK,kBAAkB,QAAQ;AAClD,UAAI,YAAY;AAEd,cAAM,aAAa,WAAW,KAAK,QAAQ,SAAS,EAAE;AACtD,gBAAQ,KAAK,UAAU;AAAA,MACzB,OAAO;AAEL,cAAM,aAAa,KAAK,KAAK,MAAM,IAAI,EAAE,CAAC;AAC1C,gBAAQ,KAAK,UAAU;AAAA,MACzB;AAAA,IACF,WAES,KAAK,SAAS,yBAAyB;AAE9C,YAAM,aAAa,KAAK,KAAK,MAAM,IAAI,EAAE,CAAC;AAC1C,cAAQ,KAAK,UAAU;AAAA,IACzB;AAGA,QAAI,SAAS,UAAU;AACrB,eAAS,IAAI,GAAG,IAAI,KAAK,iBAAiB,KAAK;AAC7C,cAAM,QAAQ,KAAK,WAAW,CAAC;AAC/B,YAAI,MAAO,UAAS,KAAK;AAAA,MAC3B;AAAA,IACF;AAAA,EACF;AAEA,WAAS,QAAQ;AACjB,SAAO;AACT;AA5UA,IAuLM;AAvLN;AAAA;AAAA;AAEA;AAqLA,IAAM,mBAAoD;AAAA;AAAA,MAExD,wBAAwB;AAAA,MACxB,YAAY;AAAA,MACZ,kBAAkB;AAAA,MAClB,uBAAuB;AAAA,MACvB,qBAAqB;AAAA,MACrB,qBAAqB;AAAA,MACrB,yBAAyB;AAAA;AAAA,MAGzB,uBAAuB;AAAA;AAAA,MACvB,sBAAsB;AAAA;AAAA;AAAA,MAGtB,6BAA6B;AAAA;AAAA,MAC7B,oBAAoB;AAAA;AAAA;AAAA;AAAA,IAGtB;AAAA;AAAA;;;AC1MA,IASa,qBA2FA;AApGb;AAAA;AAAA;AASO,IAAM,sBAAN,MAAuD;AAAA,MAC5D,kBAAkB;AAAA,QAChB;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA;AAAA,QACA;AAAA;AAAA,MACF;AAAA,MAEA,iBAAiB;AAAA,QACf;AAAA;AAAA,MACF;AAAA,MAEA,mBAAmB;AAAA,QACjB;AAAA;AAAA,QACA;AAAA;AAAA,MACF;AAAA,MAEA,gBAAgB;AAAA,QACd;AAAA,QACA;AAAA,QACA;AAAA,MACF;AAAA,MAEA,sBAAsB,MAAkC;AACtD,eAAO,KAAK,eAAe,SAAS,KAAK,IAAI;AAAA,MAC/C;AAAA,MAEA,0BAA0B,MAAkC;AAC1D,eAAO,KAAK,iBAAiB,SAAS,KAAK,IAAI;AAAA,MACjD;AAAA,MAEA,iBAAiB,MAAmD;AAClE,YAAI,KAAK,SAAS,qBAAqB;AACrC,iBAAO,KAAK,kBAAkB,MAAM;AAAA,QACtC;AACA,eAAO;AAAA,MACT;AAAA,MAEA,uBAAuB,MAAkC;AACvD,eAAO,KAAK,SAAS,aACd,KAAK,SAAS,sBACd,KAAK,SAAS;AAAA,MACvB;AAAA,MAEA,wBAAwB,MAA6C;AACnE,YAAI,UAAU,KAAK;AACnB,eAAO,SAAS;AACd,cAAI,QAAQ,SAAS,qBAAqB;AACxC,kBAAM,WAAW,QAAQ,kBAAkB,MAAM;AACjD,mBAAO,UAAU;AAAA,UACnB;AACA,oBAAU,QAAQ;AAAA,QACpB;AACA,eAAO;AAAA,MACT;AAAA;AAAA;AAAA;AAAA,MAKA,0BAA0B,MAAkD;AAC1E,cAAMC,UAAS,CAAC,GAAsB,UAA4C;AAChF,cAAI,QAAQ,EAAG,QAAO;AAEtB,cAAI,KAAK,cAAc,SAAS,EAAE,IAAI,GAAG;AACvC,mBAAO;AAAA,UACT;AAEA,mBAAS,IAAI,GAAG,IAAI,EAAE,YAAY,KAAK;AACrC,kBAAM,QAAQ,EAAE,MAAM,CAAC;AACvB,gBAAI,OAAO;AACT,oBAAM,SAASA,QAAO,OAAO,QAAQ,CAAC;AACtC,kBAAI,OAAQ,QAAO;AAAA,YACrB;AAAA,UACF;AAEA,iBAAO;AAAA,QACT;AAEA,cAAM,eAAeA,QAAO,MAAM,CAAC;AACnC,eAAO;AAAA,UACL,aAAa,iBAAiB;AAAA,UAC9B;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAKO,IAAM,sBAAN,cAAkC,oBAAoB;AAAA,IAAC;AAAA;AAAA;;;ACpG9D,IASa;AATb;AAAA;AAAA;AASO,IAAM,eAAN,MAAgD;AAAA,MACrD,kBAAkB;AAAA,QAChB;AAAA;AAAA,QACA;AAAA;AAAA,MACF;AAAA,MAEA,iBAAiB;AAAA,QACf;AAAA;AAAA,QACA;AAAA;AAAA,QACA;AAAA;AAAA,MACF;AAAA,MAEA,mBAAmB;AAAA;AAAA;AAAA,MAGnB;AAAA,MAEA,gBAAgB;AAAA,QACd;AAAA,QACA;AAAA,MACF;AAAA,MAEA,sBAAsB,MAAkC;AACtD,eAAO,KAAK,eAAe,SAAS,KAAK,IAAI;AAAA,MAC/C;AAAA,MAEA,0BAA0B,OAAmC;AAG3D,eAAO;AAAA,MACT;AAAA,MAEA,iBAAiB,MAAmD;AAClE,YAAI,KAAK,SAAS,uBACd,KAAK,SAAS,uBACd,KAAK,SAAS,yBAAyB;AAEzC,iBAAO,KAAK,kBAAkB,MAAM;AAAA,QACtC;AACA,eAAO;AAAA,MACT;AAAA,MAEA,uBAAuB,MAAkC;AACvD,eAAO,KAAK,SAAS;AAAA,QACd,KAAK,SAAS;AAAA,QACd,KAAK,SAAS;AAAA,MACvB;AAAA,MAEA,wBAAwB,MAA6C;AACnE,YAAI,UAAU,KAAK;AACnB,eAAO,SAAS;AACd,cAAI,QAAQ,SAAS,uBACjB,QAAQ,SAAS,qBAAqB;AACxC,kBAAM,WAAW,QAAQ,kBAAkB,MAAM;AACjD,mBAAO,UAAU;AAAA,UACnB;AACA,oBAAU,QAAQ;AAAA,QACpB;AACA,eAAO;AAAA,MACT;AAAA,MAEA,0BAA0B,OAAmD;AAE3E,eAAO;AAAA,UACL,aAAa;AAAA,UACb,cAAc;AAAA,QAChB;AAAA,MACF;AAAA,IACF;AAAA;AAAA;;;AC7EA,IAYa;AAZb;AAAA;AAAA;AAYO,IAAM,kBAAN,MAAmD;AAAA,MACxD,kBAAkB;AAAA,QAChB;AAAA,QACA;AAAA,MACF;AAAA,MAEA,iBAAiB;AAAA,QACf;AAAA;AAAA,MACF;AAAA,MAEA,mBAAmB;AAAA;AAAA;AAAA,MAGnB;AAAA,MAEA,gBAAgB;AAAA,QACd;AAAA,QACA;AAAA,MACF;AAAA,MAEA,sBAAsB,MAAkC;AACtD,eAAO,KAAK,eAAe,SAAS,KAAK,IAAI;AAAA,MAC/C;AAAA,MAEA,0BAA0B,OAAmC;AAG3D,eAAO;AAAA,MACT;AAAA,MAEA,iBAAiB,MAAmD;AAClE,YAAI,KAAK,SAAS,oBAAoB;AAEpC,iBAAO,KAAK,kBAAkB,MAAM;AAAA,QACtC;AACA,eAAO;AAAA,MACT;AAAA,MAEA,uBAAuB,MAAkC;AACvD,eAAO,KAAK,SAAS;AAAA,QACd,KAAK,SAAS;AAAA,MACvB;AAAA,MAEA,wBAAwB,MAA6C;AACnE,YAAI,UAAU,KAAK;AACnB,eAAO,SAAS;AACd,cAAI,QAAQ,SAAS,oBAAoB;AACvC,kBAAM,WAAW,QAAQ,kBAAkB,MAAM;AACjD,mBAAO,UAAU;AAAA,UACnB;AACA,oBAAU,QAAQ;AAAA,QACpB;AACA,eAAO;AAAA,MACT;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,0BAA0B,OAAmD;AAC3E,eAAO;AAAA,UACL,aAAa;AAAA,UACb,cAAc;AAAA,QAChB;AAAA,MACF;AAAA,IACF;AAAA;AAAA;;;AC9CO,SAAS,aAAa,UAAgD;AAC3E,QAAM,YAAY,kBAAkB,QAAQ;AAE5C,MAAI,CAAC,WAAW;AACd,UAAM,IAAI,MAAM,wCAAwC,QAAQ,EAAE;AAAA,EACpE;AAEA,SAAO;AACT;AAvCA,IAiBM;AAjBN;AAAA;AAAA;AAEA;AACA;AACA;AAaA,IAAM,oBAAkE;AAAA,MACtE,YAAY,IAAI,oBAAoB;AAAA,MACpC,YAAY,IAAI,oBAAoB;AAAA,MACpC,KAAK,IAAI,aAAa;AAAA,MACtB,QAAQ,IAAI,gBAAgB;AAAA,IAC9B;AAAA;AAAA;;;ACOO,SAAS,WACd,UACA,SACA,UAA2B,CAAC,GAChB;AACZ,QAAM,EAAE,eAAe,EAAE,IAAI;AAG7B,QAAM,WAAWC,gBAAe,QAAQ;AACxC,MAAI,CAAC,UAAU;AACb,UAAM,IAAI,MAAM,kCAAkC,QAAQ,EAAE;AAAA,EAC9D;AAGA,QAAM,cAAc,SAAS,SAAS,QAAQ;AAG9C,MAAI,CAAC,YAAY,MAAM;AACrB,UAAM,IAAI,MAAM,mBAAmB,QAAQ,KAAK,YAAY,KAAK,EAAE;AAAA,EACrE;AAEA,QAAM,SAAqB,CAAC;AAC5B,QAAM,QAAQ,QAAQ,MAAM,IAAI;AAChC,QAAM,WAAW,YAAY,KAAK;AAGlC,QAAM,YAAY,aAAa,QAAQ;AAGvC,QAAM,cAAc,eAAe,QAAQ;AAG3C,QAAM,gBAAgB,kBAAkB,UAAU,SAAS;AAE3D,aAAW,QAAQ,eAAe;AAEhC,QAAI,aAAa;AACjB,QAAI,UAAU,0BAA0B,IAAI,GAAG;AAC7C,YAAM,WAAW,UAAU,0BAA0B,IAAI;AACzD,UAAI,SAAS,cAAc;AACzB,qBAAa,SAAS;AAAA,MACxB;AAAA,IACF;AAGA,UAAM,kBAAkB,UAAU,wBAAwB,UAAU;AAEpE,UAAM,aAAa,kBAAkB,YAAY,SAAS,iBAAiB,QAAQ;AAGnF,UAAM,cAAc,eAAe,MAAM,KAAK;AAK9C,WAAO,KAAK,YAAY,UAAU,MAAM,aAAa,YAAY,aAAa,QAAQ,CAAC;AAAA,EACzF;AAGA,QAAM,gBAAgB,cAAc,IAAI,QAAM;AAAA,IAC5C,OAAO,EAAE,cAAc;AAAA,IACvB,KAAK,EAAE,YAAY;AAAA,EACrB,EAAE;AAEF,QAAM,kBAAkB;AAAA,IACtB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AAEA,SAAO,KAAK,GAAG,eAAe;AAG9B,SAAO,KAAK,CAAC,GAAG,MAAM,EAAE,SAAS,YAAY,EAAE,SAAS,SAAS;AAEjE,SAAO;AACT;AAGA,SAAS,sBACP,MACA,OACA,WACS;AACT,MAAI,UAAU,KAAK,CAAC,UAAU,0BAA0B,IAAI,EAAG,QAAO;AACtE,SAAO,UAAU,0BAA0B,IAAI,EAAE;AACnD;AAGA,SAAS,aACP,MACA,OACA,WACS;AACT,SAAO,SAAS,KAAK,UAAU,gBAAgB,SAAS,KAAK,IAAI;AACnE;AAaA,SAAS,kBACP,UACA,WACqB;AACrB,QAAM,QAA6B,CAAC;AAEpC,WAAS,SAAS,MAAyB,OAAqB;AAE9D,QAAI,sBAAsB,MAAM,OAAO,SAAS,KAAK,aAAa,MAAM,OAAO,SAAS,GAAG;AACzF,YAAM,KAAK,IAAI;AACf;AAAA,IACF;AAGA,QAAI,UAAU,sBAAsB,IAAI,GAAG;AACzC,YAAM,OAAO,UAAU,iBAAiB,IAAI;AAC5C,UAAI,KAAM,UAAS,MAAM,QAAQ,CAAC;AAClC;AAAA,IACF;AAGA,QAAI,CAAC,UAAU,uBAAuB,IAAI,EAAG;AAC7C,aAAS,IAAI,GAAG,IAAI,KAAK,iBAAiB,KAAK;AAC7C,YAAM,QAAQ,KAAK,WAAW,CAAC;AAC/B,UAAI,MAAO,UAAS,OAAO,KAAK;AAAA,IAClC;AAAA,EACF;AAEA,WAAS,UAAU,CAAC;AACpB,SAAO;AACT;AAKA,SAAS,eAAe,MAAyB,OAAyB;AACxE,QAAM,YAAY,KAAK,cAAc;AACrC,QAAM,UAAU,KAAK,YAAY;AAEjC,SAAO,MAAM,MAAM,WAAW,UAAU,CAAC,EAAE,KAAK,IAAI;AACtD;AAgBA,SAAS,mBAAmB,YAI1B;AACA,QAAM,UAAU,EAAE,WAAW,CAAC,GAAe,SAAS,CAAC,GAAe,YAAY,CAAC,EAAc;AAEjG,MAAI,YAAY,QAAQ,WAAW,MAAM;AACvC,UAAM,WAAW,qBAAqB,WAAW,IAAI;AACrD,QAAI,SAAU,SAAQ,QAAQ,EAAE,KAAK,WAAW,IAAI;AAAA,EACtD;AAEA,SAAO;AACT;AAKA,SAAS,aAAa,YAAkF;AACtG,MAAI,CAAC,WAAY,QAAO;AACxB,SAAO,WAAW,SAAS,UAAU,UAAU;AACjD;AAKA,SAAS,YACP,UACA,MACA,SACA,YACA,SACA,UACU;AACV,QAAM,UAAU,mBAAmB,UAAU;AAC7C,QAAM,uBAAuB,YAAY,QAAQ,wBAAwB,IAAI,WAAW,IAAI;AAG5F,QAAM,sBAAsB,uBACxB,6BAA6B,IAAI,IACjC;AAGJ,QAAM,WAAW,uBACb,kBAAkB,MAAM,QAAQ,IAChC;AAEJ,SAAO;AAAA,IACL;AAAA,IACA,UAAU;AAAA,MACR,MAAM;AAAA,MACN,WAAW,KAAK,cAAc,MAAM;AAAA,MACpC,SAAS,KAAK,YAAY,MAAM;AAAA,MAChC,MAAM,aAAa,UAAU;AAAA,MAC7B;AAAA,MACA;AAAA,MACA,YAAY,YAAY;AAAA,MACxB,YAAY,YAAY;AAAA,MACxB,aAAa,YAAY;AAAA,MACzB,YAAY,YAAY;AAAA,MACxB;AAAA,MACA,YAAY,YAAY;AAAA,MACxB,WAAW,YAAY;AAAA,MACvB;AAAA;AAAA,MAEA,gBAAgB,UAAU;AAAA,MAC1B,oBAAoB,UAAU;AAAA,MAC9B,gBAAgB,UAAU;AAAA,MAC1B,cAAc,UAAU;AAAA,IAC1B;AAAA,EACF;AACF;AAaA,SAAS,oBACP,eACA,YACa;AACb,QAAM,kBAA+B,CAAC;AACtC,MAAI,eAAe;AAGnB,QAAM,eAAe,CAAC,GAAG,aAAa,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK;AAExE,aAAW,SAAS,cAAc;AAChC,QAAI,eAAe,MAAM,OAAO;AAE9B,sBAAgB,KAAK;AAAA,QACnB,OAAO;AAAA,QACP,KAAK,MAAM,QAAQ;AAAA,MACrB,CAAC;AAAA,IACH;AACA,mBAAe,MAAM,MAAM;AAAA,EAC7B;AAGA,MAAI,eAAe,YAAY;AAC7B,oBAAgB,KAAK;AAAA,MACnB,OAAO;AAAA,MACP,KAAK,aAAa;AAAA,IACpB,CAAC;AAAA,EACH;AAEA,SAAO;AACT;AAKA,SAAS,qBACP,OACA,OACA,UACA,UACA,SACU;AACV,QAAM,iBAAiB,MAAM,MAAM,MAAM,OAAO,MAAM,MAAM,CAAC;AAC7D,QAAM,UAAU,eAAe,KAAK,IAAI,EAAE,KAAK;AAE/C,SAAO;AAAA,IACL;AAAA,IACA,UAAU;AAAA,MACR,MAAM;AAAA,MACN,WAAW,MAAM,QAAQ;AAAA,MACzB,SAAS,MAAM,MAAM;AAAA,MACrB,MAAM;AAAA,MACN;AAAA;AAAA,MAEA,SAAS,EAAE,WAAW,CAAC,GAAG,SAAS,CAAC,GAAG,YAAY,CAAC,EAAE;AAAA,MACtD;AAAA,IACF;AAAA,EACF;AACF;AAKA,SAAS,aAAa,OAAiB,cAA+B;AACpE,QAAM,YAAY,MAAM,SAAS,UAAU,MAAM,SAAS,YAAY;AACtE,SAAO,MAAM,QAAQ,SAAS,KAAK,aAAa;AAClD;AAMA,SAAS,qBACP,OACA,eACA,UACA,cACA,SACA,UACY;AACZ,QAAM,kBAAkB,oBAAoB,eAAe,MAAM,MAAM;AAEvE,SAAO,gBACJ,IAAI,WAAS,qBAAqB,OAAO,OAAO,UAAU,UAAU,OAAO,CAAC,EAC5E,OAAO,WAAS,aAAa,OAAO,YAAY,CAAC;AACtD;AAKO,SAAS,aAAa,UAA2B;AACtD,SAAO,eAAe,QAAQ;AAChC;AApXA,IAuLM,sBAQA;AA/LN;AAAA;AAAA;AAEA;AACA;AACA;AACA;AAkLA,IAAM,uBAA+E;AAAA,MACnF,UAAU;AAAA,MACV,QAAQ;AAAA,MACR,OAAO;AAAA,MACP,WAAW;AAAA,IACb;AAGA,IAAM,0BAA0B,oBAAI,IAAI,CAAC,YAAY,QAAQ,CAAC;AAAA;AAAA;;;AC/J9D,SAAS,kBAAkB,eAA2C;AACpE,MAAI;AAGF,QAAI,cAAc,cACf,QAAQ,2BAA2B,EAAE,EACrC,QAAQ,8BAA8B,EAAE,EACxC,KAAK;AAGR,UAAM,SAAS,KAAK,MAAM,WAAW;AAErC,WAAO,OAAO,OAAO,SAAS,WAAW,OAAO,OAAO;AAAA,EACzD,SAAS,OAAO;AAAA,EAGhB;AACA,SAAO;AACT;AASA,SAAS,eAAe,SAAyB;AAE/C,SAAO,QAAQ,QAAQ,8DAA8D,EAAE;AACzF;AAqBA,SAAS,kBAAkB,wBAA0C;AACnE,QAAM,eAAe,oBAAI,IAAY;AAIrC,QAAM,gBAAgB;AACtB,MAAI;AAEJ,UAAQ,QAAQ,cAAc,KAAK,sBAAsB,OAAO,MAAM;AACpE,iBAAa,IAAI,MAAM,CAAC,CAAC;AAAA,EAC3B;AAGA,QAAM,iBAAiB;AAEvB,UAAQ,QAAQ,eAAe,KAAK,sBAAsB,OAAO,MAAM;AACrE,iBAAa,IAAI,MAAM,CAAC,CAAC;AAAA,EAC3B;AAGA,QAAM,iBAAiB;AAEvB,UAAQ,QAAQ,eAAe,KAAK,sBAAsB,OAAO,MAAM;AACrE,iBAAa,IAAI,MAAM,CAAC,CAAC;AAAA,EAC3B;AAEA,SAAO,MAAM,KAAK,YAAY;AAChC;AAWA,SAAS,iBAAiB,SAAgC;AACxD,QAAM,QAAQ,QAAQ,MAAM,IAAI;AAChC,QAAM,SAAwB,CAAC;AAI/B,QAAM,gBAAgB;AAAA,IACpB,EAAE,MAAM,UAAmB,OAAO,0BAA0B,KAAK,4BAA4B;AAAA,IAC7F,EAAE,MAAM,SAAkB,OAAO,yBAAyB,KAAK,2BAA2B;AAAA,IAC1F,EAAE,MAAM,cAAuB,OAAO,8BAA8B,KAAK,gCAAgC;AAAA,EAC3G;AAEA,aAAW,WAAW,eAAe;AACnC,QAAI,cAAc;AAElB,WAAO,cAAc,MAAM,QAAQ;AAEjC,YAAM,WAAW,MAAM;AAAA,QAAU,CAAC,MAAM,QACtC,OAAO,eAAe,QAAQ,MAAM,KAAK,IAAI;AAAA,MAC/C;AAEA,UAAI,aAAa,GAAI;AAGrB,YAAM,SAAS,MAAM;AAAA,QAAU,CAAC,MAAM,QACpC,OAAO,YAAY,QAAQ,IAAI,KAAK,IAAI;AAAA,MAC1C;AAEA,UAAI,WAAW,IAAI;AAEjB;AAAA,MACF;AAGA,YAAM,eAAe,MAAM,MAAM,UAAU,SAAS,CAAC,EAAE,KAAK,IAAI;AAEhE,aAAO,KAAK;AAAA,QACV,MAAM,QAAQ;AAAA,QACd,WAAW;AAAA,QACX,SAAS;AAAA,QACT,SAAS;AAAA,MACX,CAAC;AAED,oBAAc,SAAS;AAAA,IACzB;AAAA,EACF;AAEA,SAAO,OAAO,KAAK,CAAC,GAAG,MAAM,EAAE,YAAY,EAAE,SAAS;AACxD;AAYO,SAAS,gBACd,UACA,SACA,YAAoB,IACpB,eAAuB,IACV;AACb,QAAM,QAAQ,QAAQ,MAAM,IAAI;AAChC,QAAM,SAAS,iBAAiB,OAAO;AACvC,QAAM,SAAsB,CAAC;AAG7B,QAAM,yBAAyB,eAAe,OAAO;AACrD,QAAM,uBAAuB,uBAAuB,MAAM,IAAI;AAG9D,QAAM,eAAe,oBAAI,IAAY;AAGrC,aAAW,SAAS,QAAQ;AAE1B,aAAS,IAAI,MAAM,WAAW,KAAK,MAAM,SAAS,KAAK;AACrD,mBAAa,IAAI,CAAC;AAAA,IACpB;AAGA,QAAI;AACJ,QAAI,MAAM,SAAS,UAAU;AAC3B,mBAAa,kBAAkB,MAAM,OAAO;AAAA,IAC9C;AAGA,UAAM,8BAA8B,qBACjC,MAAM,MAAM,WAAW,MAAM,UAAU,CAAC,EACxC,KAAK,IAAI;AACZ,UAAM,UAAU,kBAAkB,2BAA2B;AAE7D,UAAM,iBAAiB,MAAM,UAAU,MAAM,YAAY;AACzD,UAAM,eAAe,YAAY;AAGjC,QAAI,kBAAkB,cAAc;AAClC,aAAO,KAAK;AAAA,QACV,SAAS,MAAM;AAAA,QACf,UAAU;AAAA,UACR,MAAM;AAAA,UACN,WAAW,MAAM,YAAY;AAAA;AAAA,UAC7B,SAAS,MAAM,UAAU;AAAA,UACzB,UAAU;AAAA,UACV,MAAM;AAAA,UACN;AAAA,UACA,YAAY,MAAM;AAAA,UAClB,SAAS,QAAQ,SAAS,IAAI,UAAU;AAAA,QAC1C;AAAA,MACF,CAAC;AAAA,IACH,OAAO;AAEL,YAAM,aAAa,MAAM,QAAQ,MAAM,IAAI;AAE3C,eAAS,SAAS,GAAG,SAAS,WAAW,QAAQ,UAAU,YAAY,cAAc;AACnF,cAAM,YAAY,KAAK,IAAI,SAAS,WAAW,WAAW,MAAM;AAChE,cAAM,eAAe,WAAW,MAAM,QAAQ,SAAS,EAAE,KAAK,IAAI;AAElE,YAAI,aAAa,KAAK,EAAE,SAAS,GAAG;AAClC,iBAAO,KAAK;AAAA,YACV,SAAS;AAAA,YACT,UAAU;AAAA,cACR,MAAM;AAAA,cACN,WAAW,MAAM,YAAY,SAAS;AAAA;AAAA,cACtC,SAAS,MAAM,YAAY;AAAA;AAAA,cAC3B,UAAU;AAAA,cACV,MAAM;AAAA,cACN;AAAA;AAAA,cACA,YAAY,MAAM;AAAA,cAClB,SAAS,QAAQ,SAAS,IAAI,UAAU;AAAA,YAC1C;AAAA,UACF,CAAC;AAAA,QACH;AAEA,YAAI,aAAa,WAAW,OAAQ;AAAA,MACtC;AAAA,IACF;AAAA,EACF;AAGA,MAAI,eAAyB,CAAC;AAC9B,MAAI,iBAAiB;AAErB,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AAErC,QAAI,aAAa,IAAI,CAAC,GAAG;AAEvB,UAAI,aAAa,SAAS,GAAG;AAC3B,cAAM,eAAe,aAAa,KAAK,IAAI;AAG3C,YAAI,aAAa,KAAK,EAAE,SAAS,GAAG;AAElC,gBAAM,eAAe,qBAAqB,MAAM,gBAAgB,CAAC,EAAE,KAAK,IAAI;AAC5E,gBAAM,UAAU,kBAAkB,YAAY;AAE9C,iBAAO,KAAK;AAAA,YACV,SAAS;AAAA,YACT,UAAU;AAAA,cACR,MAAM;AAAA,cACN,WAAW,iBAAiB;AAAA,cAC5B,SAAS;AAAA,cACT,UAAU;AAAA,cACV,MAAM;AAAA,cACN,SAAS,QAAQ,SAAS,IAAI,UAAU;AAAA,YAC1C;AAAA,UACF,CAAC;AAAA,QACH;AACA,uBAAe,CAAC;AAAA,MAClB;AACA;AAAA,IACF;AAGA,QAAI,aAAa,WAAW,GAAG;AAC7B,uBAAiB;AAAA,IACnB;AAEA,iBAAa,KAAK,MAAM,CAAC,CAAC;AAG1B,QAAI,aAAa,UAAU,WAAW;AACpC,YAAM,eAAe,aAAa,KAAK,IAAI;AAG3C,UAAI,aAAa,KAAK,EAAE,SAAS,GAAG;AAElC,cAAM,eAAe,qBAAqB,MAAM,gBAAgB,IAAI,CAAC,EAAE,KAAK,IAAI;AAChF,cAAM,UAAU,kBAAkB,YAAY;AAE9C,eAAO,KAAK;AAAA,UACV,SAAS;AAAA,UACT,UAAU;AAAA,YACR,MAAM;AAAA,YACN,WAAW,iBAAiB;AAAA,YAC5B,SAAS,IAAI;AAAA,YACb,UAAU;AAAA,YACV,MAAM;AAAA,YACN,SAAS,QAAQ,SAAS,IAAI,UAAU;AAAA,UAC1C;AAAA,QACF,CAAC;AAAA,MACH;AAGA,qBAAe,aAAa,MAAM,CAAC,YAAY;AAC/C,uBAAiB,KAAK,IAAI,GAAG,IAAI,IAAI,YAAY;AAAA,IACnD;AAAA,EACF;AAGA,MAAI,aAAa,SAAS,GAAG;AAC3B,UAAM,eAAe,aAAa,KAAK,IAAI;AAG3C,QAAI,aAAa,KAAK,EAAE,WAAW,GAAG;AACpC,aAAO,OAAO,KAAK,CAAC,GAAG,MAAM,EAAE,SAAS,YAAY,EAAE,SAAS,SAAS;AAAA,IAC1E;AAGA,UAAM,eAAe,qBAAqB,MAAM,gBAAgB,MAAM,MAAM,EAAE,KAAK,IAAI;AACvF,UAAM,UAAU,kBAAkB,YAAY;AAE9C,WAAO,KAAK;AAAA,MACV,SAAS;AAAA,MACT,UAAU;AAAA,QACR,MAAM;AAAA,QACN,WAAW,iBAAiB;AAAA,QAC5B,SAAS,MAAM;AAAA,QACf,UAAU;AAAA,QACV,MAAM;AAAA,QACN,SAAS,QAAQ,SAAS,IAAI,UAAU;AAAA,MAC1C;AAAA,IACF,CAAC;AAAA,EACH;AAGA,SAAO,OAAO,KAAK,CAAC,GAAG,MAAM,EAAE,SAAS,YAAY,EAAE,SAAS,SAAS;AAC1E;AA1WA;AAAA;AAAA;AAAA;AAAA;;;ACuBA,SAAS,yBAAyB,aAA+B;AAC/D,MAAI;AACF,UAAM,WAAW,KAAK,MAAM,WAAW;AACvC,UAAM,eAAe,oBAAI,IAAY;AAGrC,QAAI,SAAS,YAAY,OAAO,SAAS,aAAa,UAAU;AAC9D,iBAAW,WAAW,OAAO,OAAO,SAAS,QAAQ,GAAG;AACtD,YACE,OAAO,YAAY,YACnB,YAAY,QACZ,UAAU,WACV,OAAO,QAAQ,SAAS,UACxB;AACA,uBAAa,IAAI,QAAQ,IAAI;AAAA,QAC/B;AAAA,MACF;AAAA,IACF;AAEA,WAAO,MAAM,KAAK,YAAY;AAAA,EAChC,SAAS,OAAO;AAEd,YAAQ,KAAK,yCAAyC,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK,CAAC,EAAE;AAC9G,WAAO,CAAC;AAAA,EACV;AACF;AAQA,SAAS,oBAAoB,UAAsC;AAEjE,QAAM,QAAQ,SAAS,MAAM,wBAAwB;AACrD,SAAO,QAAQ,MAAM,CAAC,IAAI;AAC5B;AAQO,SAAS,kBACd,UACA,SACa;AAEb,MAAI,QAAQ,KAAK,EAAE,WAAW,GAAG;AAC/B,WAAO,CAAC;AAAA,EACV;AAEA,QAAM,QAAQ,QAAQ,MAAM,IAAI;AAChC,QAAM,eAAe,oBAAoB,QAAQ;AACjD,QAAM,oBAAoB,yBAAyB,OAAO;AAE1D,SAAO,CAAC;AAAA,IACN;AAAA,IACA,UAAU;AAAA,MACR,MAAM;AAAA,MACN,WAAW;AAAA,MACX,SAAS,MAAM;AAAA,MACf,UAAU;AAAA,MACV,MAAM;AAAA,MACN,YAAY;AAAA,MACZ,YAAY;AAAA,MACZ,SAAS,kBAAkB,SAAS,IAAI,oBAAoB;AAAA,IAC9D;AAAA,EACF,CAAC;AACH;AA9FA;AAAA;AAAA;AAAA;AAAA;;;ACcO,SAAS,UACd,UACA,SACA,UAAwB,CAAC,GACZ;AACb,QAAM,EAAE,YAAY,IAAI,eAAe,IAAI,SAAS,MAAM,cAAc,aAAa,IAAI;AAGzF,MAAI,SAAS,SAAS,SAAS,GAAG;AAChC,WAAO,gBAAgB,UAAU,SAAS,WAAW,YAAY;AAAA,EACnE;AAMA,MAAI,SAAS,SAAS,OAAO,KAAK,sBAAsB,KAAK,QAAQ,GAAG;AACtE,WAAO,kBAAkB,UAAU,OAAO;AAAA,EAC5C;AAGA,MAAI,UAAU,aAAa,QAAQ,GAAG;AACpC,QAAI;AACF,aAAO,WAAW,UAAU,SAAS;AAAA,QACnC,cAAc,KAAK,MAAM,YAAY,EAAE;AAAA,MACzC,CAAC;AAAA,IACH,SAAS,OAAO;AAEd,UAAI,gBAAgB,SAAS;AAE3B,cAAM,IAAI,MAAM,2BAA2B,QAAQ,KAAK,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK,CAAC,EAAE;AAAA,MAClH;AAEA,cAAQ,KAAK,2BAA2B,QAAQ,iCAAiC,KAAK;AAAA,IACxF;AAAA,EACF;AAGA,SAAO,aAAa,UAAU,SAAS,WAAW,YAAY;AAChE;AAKA,SAAS,aACP,UACA,SACA,WACA,cACa;AACb,QAAM,QAAQ,QAAQ,MAAM,IAAI;AAChC,QAAM,SAAsB,CAAC;AAC7B,QAAM,WAAW,eAAe,QAAQ;AAGxC,MAAI,MAAM,WAAW,KAAM,MAAM,WAAW,KAAK,MAAM,CAAC,EAAE,KAAK,MAAM,IAAK;AACxE,WAAO;AAAA,EACT;AAGA,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK,YAAY,cAAc;AAC/D,UAAM,UAAU,KAAK,IAAI,IAAI,WAAW,MAAM,MAAM;AACpD,UAAM,aAAa,MAAM,MAAM,GAAG,OAAO;AACzC,UAAM,eAAe,WAAW,KAAK,IAAI;AAGzC,QAAI,aAAa,KAAK,EAAE,WAAW,GAAG;AACpC;AAAA,IACF;AAGA,UAAM,UAAU,eAAe,cAAc,QAAQ;AAErD,WAAO,KAAK;AAAA,MACV,SAAS;AAAA,MACT,UAAU;AAAA,QACR,MAAM;AAAA,QACN,WAAW,IAAI;AAAA,QACf;AAAA,QACA,MAAM;AAAA;AAAA,QACN;AAAA,QACA;AAAA,MACF;AAAA,IACF,CAAC;AAGD,QAAI,WAAW,MAAM,QAAQ;AAC3B;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AACT;AA1GA,IAAAC,gBAAA;AAAA;AAAA;AACA;AACA;AACA;AACA;AACA;AAAA;AAAA;;;ACLA,SAAS,UAAU,WAA2C;AAA9D,IASa;AATb;AAAA;AAAA;AAEA;AACA;AAGA,QAAI,oBAAoB;AACxB,QAAI,mBAAmB;AAEhB,IAAM,kBAAN,MAAkD;AAAA,MAC/C,YAA8C;AAAA,MACrC,YAAY;AAAA,MACrB,cAAoC;AAAA,MAE5C,MAAM,aAA4B;AAEhC,YAAI,KAAK,aAAa;AACpB,iBAAO,KAAK;AAAA,QACd;AAEA,YAAI,KAAK,WAAW;AAClB;AAAA,QACF;AAEA,aAAK,eAAe,YAAY;AAC9B,cAAI;AAEF,iBAAK,YAAY,MAAM,SAAS,sBAAsB,KAAK,SAAS;AAAA,UACtE,SAAS,OAAgB;AACvB,iBAAK,cAAc;AACnB,kBAAM,UAAU,OAAO,sCAAsC;AAAA,UAC/D;AAAA,QACF,GAAG;AAEH,eAAO,KAAK;AAAA,MACd;AAAA,MAEA,MAAM,MAAM,MAAqC;AAC/C,cAAM,KAAK,WAAW;AAEtB,YAAI,CAAC,KAAK,WAAW;AACnB,gBAAM,IAAI,eAAe,iCAAiC;AAAA,QAC5D;AAEA,YAAI;AACF,gBAAM,SAAS,MAAM,KAAK,UAAU,MAAM;AAAA,YACxC,SAAS;AAAA,YACT,WAAW;AAAA,UACb,CAAC;AAED,iBAAO,OAAO;AAAA,QAChB,SAAS,OAAgB;AACvB,gBAAM,UAAU,OAAO,gCAAgC,EAAE,YAAY,KAAK,OAAO,CAAC;AAAA,QACpF;AAAA,MACF;AAAA,MAEA,MAAM,WAAW,OAA0C;AACzD,cAAM,KAAK,WAAW;AAEtB,YAAI,CAAC,KAAK,WAAW;AACnB,gBAAM,IAAI,eAAe,iCAAiC;AAAA,QAC5D;AAEA,YAAI;AAGF,gBAAM,UAAU,MAAM,QAAQ;AAAA,YAC5B,MAAM,IAAI,UAAQ,KAAK,MAAM,IAAI,CAAC;AAAA,UACpC;AACA,iBAAO;AAAA,QACT,SAAS,OAAgB;AACvB,gBAAM,UAAU,OAAO,uCAAuC,EAAE,WAAW,MAAM,OAAO,CAAC;AAAA,QAC3F;AAAA,MACF;AAAA,IACF;AAAA;AAAA;;;AC1EA,IAQa;AARb;AAAA;AAAA;AAAA;AAQO,IAAM,sBAAsB;AAAA;AAAA;;;ACM5B,SAAS,mBAAmB,OAAkC;AACnE,MAAI,QAAQ,EAAK,QAAO;AACxB,MAAI,QAAQ,IAAK,QAAO;AACxB,MAAI,QAAQ,IAAK,QAAO;AACxB,SAAO;AACT;AAnBA;AAAA;AAAA;AAAA;AAAA;;;ACgGA,SAAS,iBAA+B;AACtC,MAAI,sBAAsB,MAAM;AAC9B,wBAAoB,CAAC,GAAG,YAAY,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,WAAW,EAAE,QAAQ;AAAA,EAC9E;AACA,SAAO;AACT;AAwBO,SAAS,oBAAoB,OAA4B;AAC9D,QAAM,QAAQ,MAAM,YAAY,EAAE,KAAK;AAGvC,QAAM,cAAc,eAAe;AAEnC,aAAW,QAAQ,aAAa;AAC9B,QAAI,KAAK,SAAS,KAAK,aAAW,QAAQ,KAAK,KAAK,CAAC,GAAG;AACtD,aAAO,KAAK;AAAA,IACd;AAAA,EACF;AAIA,SAAO;AACT;AA5IA,IA2CM,cAyCA,oBAMF;AA1FJ;AAAA;AAAA;AA2CA,IAAM,eAA6B;AAAA;AAAA,MAEjC;AAAA,QACE,QAAQ;AAAA,QACR,UAAU;AAAA,QACV,UAAU;AAAA,UACR;AAAA,UACA;AAAA,UACA;AAAA,QACF;AAAA,MACF;AAAA;AAAA,MAGA;AAAA,QACE,QAAQ;AAAA,QACR,UAAU;AAAA,QACV,UAAU;AAAA,UACR;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,QACF;AAAA,MACF;AAAA;AAAA,MAGA;AAAA,QACE,QAAQ;AAAA,QACR,UAAU;AAAA,QACV,UAAU;AAAA,UACR;AAAA,UACA;AAAA,UACA;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAMA,IAAM,qBAAqB,aAAa;AAMxC,IAAI,oBAAyC;AAAA;AAAA;;;AC1F7C,IAAAC,cAAA;AAAA;AAAA;AAAA;AAAA;;;ACCA,OAAOC,YAAU;AAOjB,SAAS,oBAAoB,UAA2B;AACtD,QAAM,QAAQ,SAAS,YAAY;AACnC,QAAM,WAAWA,OAAK,SAAS,QAAQ,EAAE,YAAY;AAErD,MAAI,SAAS,WAAW,QAAQ,EAAG,QAAO;AAC1C,MAAI,SAAS,WAAW,WAAW,EAAG,QAAO;AAC7C,MAAI,SAAS,SAAS,KAAK,KAAK,SAAS,SAAS,MAAM,KAAK,SAAS,SAAS,WAAW,GAAG;AAC3F,WAAO;AAAA,EACT;AACA,MACE,MAAM,SAAS,QAAQ,KACvB,MAAM,SAAS,iBAAiB,KAChC,MAAM,SAAS,QAAQ,KACvB,MAAM,SAAS,WAAW,GAC1B;AACA,WAAO;AAAA,EACT;AACA,MACE,MAAM,SAAS,cAAc,KAC7B,MAAM,SAAS,UAAU,KACzB,MAAM,SAAS,QAAQ,GACvB;AACA,WAAO;AAAA,EACT;AAEA,SAAO;AACT;AAEA,SAAS,WAAW,UAA2B;AAC7C,QAAM,QAAQ,SAAS,YAAY;AAEnC,MACE,MAAM,SAAS,QAAQ,KACvB,MAAM,SAAS,SAAS,KACxB,MAAM,SAAS,aAAa,GAC5B;AACA,WAAO;AAAA,EACT;AAEA,MACE,MAAM,SAAS,QAAQ,KACvB,MAAM,SAAS,QAAQ,KACvB,MAAM,SAAS,QAAQ,KACvB,MAAM,SAAS,QAAQ,GACvB;AACA,WAAO;AAAA,EACT;AAEA,SAAO;AACT;AAEA,SAAS,cAAc,UAA2B;AAChD,QAAM,QAAQ,SAAS,YAAY;AAEnC,MACE,MAAM,SAAS,SAAS,KACxB,MAAM,SAAS,aAAa,KAC5B,MAAM,SAAS,WAAW,KAC1B,MAAM,SAAS,OAAO,GACtB;AACA,WAAO;AAAA,EACT;AAEA,MACE,MAAM,SAAS,QAAQ,KACvB,MAAM,SAAS,UAAU,KACzB,MAAM,SAAS,QAAQ,KACvB,MAAM,SAAS,UAAU,GACzB;AACA,WAAO;AAAA,EACT;AAEA,SAAO;AACT;AAjFA,IA2Fa,sBAwBA,0BAgCA;AAnJb;AAAA;AAAA;AAEA;AAyFO,IAAM,uBAAN,MAAuD;AAAA,MAC5D,OAAO;AAAA,MAEP,MAAM,OAAe,UAAkB,WAA2B;AAChE,cAAM,cAAc,MAAM,YAAY,EAAE,MAAM,KAAK;AACnD,cAAM,eAAe,SAAS,YAAY,EAAE,MAAM,GAAG;AAErD,YAAI,cAAc;AAElB,mBAAW,SAAS,aAAa;AAC/B,cAAI,MAAM,UAAU,EAAG;AACvB,cAAI,aAAa,KAAK,SAAO,IAAI,SAAS,KAAK,CAAC,GAAG;AACjD,2BAAe;AAAA,UACjB;AAAA,QACF;AAEA,eAAO,YAAY;AAAA,MACrB;AAAA,IACF;AAMO,IAAM,2BAAN,MAA2D;AAAA,MAChE,OAAO;AAAA,MAEP,MAAM,OAAe,UAAkB,WAA2B;AAChE,cAAM,WAAWA,OAAK,SAAS,UAAUA,OAAK,QAAQ,QAAQ,CAAC,EAAE,YAAY;AAC7E,cAAM,cAAc,MAAM,YAAY,EAAE,MAAM,KAAK;AAEnD,YAAI,cAAc;AAElB,mBAAW,SAAS,aAAa;AAC/B,cAAI,MAAM,UAAU,EAAG;AAEvB,cAAI,aAAa,OAAO;AACtB,2BAAe;AAAA,UACjB,WAAW,SAAS,SAAS,KAAK,GAAG;AACnC,2BAAe;AAAA,UACjB;AAAA,QACF;AAEA,eAAO,YAAY;AAAA,MACrB;AAAA,IACF;AAWO,IAAM,2BAAN,MAA2D;AAAA,MAGhE,YAAoB,QAAqB;AAArB;AAAA,MAAsB;AAAA,MAF1C,OAAO;AAAA,MAIP,MAAM,OAAe,UAAkB,WAA2B;AAChE,gBAAQ,KAAK,QAAQ;AAAA,UACnB;AACE,mBAAO,KAAK,sBAAsB,OAAO,UAAU,SAAS;AAAA,UAE9D;AACE,mBAAO,KAAK,wBAAwB,OAAO,UAAU,SAAS;AAAA,UAEhE;AACE,mBAAO,KAAK,4BAA4B,OAAO,UAAU,SAAS;AAAA,UAEpE;AACE,mBAAO;AAAA,QACX;AAAA,MACF;AAAA,MAEQ,sBAAsB,QAAgB,UAAkB,OAAuB;AAMrF,YAAI,WAAW,QAAQ,GAAG;AACxB,mBAAS;AAAA,QACX;AAEA,eAAO;AAAA,MACT;AAAA,MAEQ,wBAAwB,QAAgB,UAAkB,OAAuB;AAMvF,YAAI,oBAAoB,QAAQ,GAAG;AACjC,mBAAS;AAET,gBAAM,QAAQ,SAAS,YAAY;AACnC,cACE,MAAM,SAAS,cAAc,KAC7B,MAAM,SAAS,UAAU,KACzB,MAAM,SAAS,MAAM,GACrB;AACA,qBAAS;AAAA,UACX;AAAA,QACF;AAGA,YAAI,cAAc,QAAQ,GAAG;AAC3B,mBAAS;AAAA,QACX;AAEA,eAAO;AAAA,MACT;AAAA,MAEQ,4BAA4B,QAAgB,UAAkB,OAAuB;AAM3F,YAAI,WAAW,QAAQ,GAAG;AACxB,mBAAS;AAAA,QACX;AAEA,eAAO;AAAA,MACT;AAAA,IACF;AAAA;AAAA;;;AC5NA,IAkBa;AAlBb;AAAA;AAAA;AAkBO,IAAM,mBAAN,MAAuB;AAAA,MACpB,aAAiC,CAAC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAS1C,YAAY,UAAkC;AAC5C,aAAK,WAAW,KAAK,QAAQ;AAC7B,eAAO;AAAA,MACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAUA,MAAM,OAAe,UAAkB,WAA2B;AAChE,YAAI,QAAQ;AAEZ,mBAAW,YAAY,KAAK,YAAY;AACtC,kBAAQ,SAAS,MAAM,OAAO,UAAU,KAAK;AAAA,QAC/C;AAEA,eAAO;AAAA,MACT;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,mBAA6B;AAC3B,eAAO,KAAK,WAAW,IAAI,OAAK,EAAE,IAAI;AAAA,MACxC;AAAA;AAAA;AAAA;AAAA,MAKA,mBAA2B;AACzB,eAAO,KAAK,WAAW;AAAA,MACzB;AAAA;AAAA;AAAA;AAAA,MAKA,QAAc;AACZ,aAAK,aAAa,CAAC;AAAA,MACrB;AAAA,IACF;AAAA;AAAA;;;ACxEA;AAAA;AAAA;AAmBA,IAAAC;AACA;AACA;AAAA;AAAA;;;AC+DA,SAAS,cAAc,GAAsB;AAC3C,SAAO;AAAA,IACL,EAAE,WACF,EAAE,QAAQ,KAAK,EAAE,SAAS,KAC1B,EAAE,QACF,EAAE,KAAK,SAAS;AAAA,EAClB;AACF;AAMA,SAAS,qBAAqB,KAAoC;AAChE,SAAO,QAAQ,OAAO,IAAI,SAAS,KAAK,IAAI,CAAC,MAAM,EAAE;AACvD;AAMA,SAAS,kBACP,GACA,YACU;AACV,MAAI,eAAe,WAAY,QAAO,EAAE,iBAAiB,CAAC;AAC1D,MAAI,eAAe,QAAS,QAAO,EAAE,cAAc,CAAC;AACpD,MAAI,eAAe,YAAa,QAAO,EAAE,kBAAkB,CAAC;AAC5D,SAAO;AAAA,IACL,GAAI,EAAE,iBAAiB,CAAC;AAAA,IACxB,GAAI,EAAE,cAAc,CAAC;AAAA,IACrB,GAAI,EAAE,kBAAkB,CAAC;AAAA,EAC3B;AACF;AAMA,SAAS,0BAA0B,GAAuC;AACxE,SAAO;AAAA,IACL,MAAM,EAAE;AAAA,IACR,WAAW,EAAE;AAAA,IACb,SAAS,EAAE;AAAA,IACX,MAAM,EAAE;AAAA,IACR,UAAU,EAAE;AAAA,IACZ,YAAY,EAAE,cAAc;AAAA,IAC5B,YAAY,EAAE;AAAA,IACd,aAAa,EAAE,eAAe;AAAA,IAC9B,YAAY,EAAE,cAAc;AAAA,IAC5B,qBAAqB,EAAE,uBAAuB;AAAA,IAC9C,YAAY,qBAAqB,EAAE,UAAU,IAAI,EAAE,aAAa;AAAA,IAChE,WAAW,EAAE,aAAa;AAAA,IAC1B,SAAS,qBAAqB,EAAE,OAAO,IAAI,EAAE,UAAU;AAAA;AAAA,IAEvD,gBAAgB,EAAE,kBAAkB,OAAO,EAAE,iBAAiB;AAAA,IAC9D,oBAAoB,EAAE,sBAAsB,OAAO,EAAE,qBAAqB;AAAA,IAC1E,gBAAgB,EAAE,kBAAkB,OAAO,EAAE,iBAAiB;AAAA,IAC9D,cAAc,EAAE,gBAAgB,OAAO,EAAE,eAAe;AAAA,EAC1D;AACF;AAUA,SAAS,uBACP,OACA,UACA,WACQ;AACR,MAAI,CAAC,OAAO;AACV,WAAO;AAAA,EACT;AAEA,QAAM,SAAS,oBAAoB,KAAK;AAGxC,SAAO,mBAAmB,MAAM,EAAE,MAAM,OAAO,UAAU,SAAS;AACpE;AAKA,SAAS,uBACP,GACA,OACc;AACd,QAAM,YAAY,EAAE,aAAa;AACjC,QAAM,eAAe,uBAAuB,OAAO,EAAE,MAAM,SAAS;AAEpE,SAAO;AAAA,IACL,SAAS,EAAE;AAAA,IACX,UAAU,0BAA0B,CAAC;AAAA,IACrC,OAAO;AAAA,IACP,WAAW,mBAAmB,YAAY;AAAA,EAC5C;AACF;AAKA,eAAsB,OACpB,OACA,aACA,QAAgB,GAChB,OACyB;AACzB,MAAI,CAAC,OAAO;AACV,UAAM,IAAI,cAAc,iCAAiC;AAAA,EAC3D;AAEA,MAAI;AACF,UAAM,UAAU,MAAM,MACnB,OAAO,MAAM,KAAK,WAAW,CAAC,EAC9B,MAAM,QAAQ,EAAE,EAChB,QAAQ;AAEX,UAAM,WAAY,QACf,OAAO,aAAa,EACpB,IAAI,CAAC,MAAgB,uBAAuB,GAAG,KAAK,CAAC,EACrD,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK,EAChC,MAAM,GAAG,KAAK;AAEjB,WAAO;AAAA,EACT,SAAS,OAAO;AACd,UAAM,WAAW,OAAO,KAAK;AAG7B,QAAI,SAAS,SAAS,YAAY,KAAK,SAAS,SAAS,QAAQ,GAAG;AAClE,YAAM,IAAI;AAAA,QACR;AAAA,QACA,EAAE,eAAe,MAAM;AAAA,MACzB;AAAA,IACF;AAEA,UAAM,UAAU,OAAO,kCAAkC;AAAA,EAC3D;AACF;AAKA,eAAsB,eACpB,OACA,SAKyB;AACzB,MAAI,CAAC,OAAO;AACV,UAAM,IAAI,cAAc,iCAAiC;AAAA,EAC3D;AAEA,QAAM,EAAE,UAAU,SAAS,QAAQ,IAAI,IAAI;AAE3C,MAAI;AACF,UAAM,aAAa,MAAM,mBAAmB,EAAE,KAAK,CAAC;AACpD,UAAM,QAAQ,MAAM,OAAO,UAAU,EAClC,MAAM,YAAY,EAClB,MAAM,KAAK,IAAI,QAAQ,GAAG,GAAG,CAAC;AAEjC,UAAM,UAAU,MAAM,MAAM,QAAQ;AAEpC,QAAI,WAAY,QAAkC,OAAO,aAAa;AAEtE,QAAI,UAAU;AACZ,iBAAW,SAAS;AAAA,QAAO,CAAC,MAC1B,EAAE,YAAY,EAAE,SAAS,YAAY,MAAM,SAAS,YAAY;AAAA,MAClE;AAAA,IACF;AAEA,QAAI,SAAS;AACX,YAAM,QAAQ,IAAI,OAAO,SAAS,GAAG;AACrC,iBAAW,SAAS;AAAA,QAAO,CAAC,MAC1B,MAAM,KAAK,EAAE,OAAO,KAAK,MAAM,KAAK,EAAE,IAAI;AAAA,MAC5C;AAAA,IACF;AAEA,WAAO,SAAS,MAAM,GAAG,KAAK,EAAE,IAAI,CAAC,OAAiB;AAAA,MACpD,SAAS,EAAE;AAAA,MACX,UAAU,0BAA0B,CAAC;AAAA,MACrC,OAAO;AAAA,MACP,WAAW,mBAAmB,CAAC;AAAA,IACjC,EAAE;AAAA,EACJ,SAAS,OAAO;AACd,UAAM,UAAU,OAAO,4BAA4B;AAAA,EACrD;AACF;AAYA,SAAS,kBACP,QACA,YACA,SACS;AAET,MAAI,OAAO,YAAY;AACrB,WAAO,oBAAoB,UAAU,GAAG,IAAI,OAAO,UAAU,KAAK;AAAA,EACpE;AAGA,SAAO,QAAQ,SAAS,KAAK,QAAQ,KAAK,CAAC,MAAc,EAAE,SAAS,KAAK,MAAM,EAAE;AACnF;AAYA,SAAS,oBACP,GACA,EAAE,UAAU,SAAS,WAAW,GACvB;AAET,MAAI,aAAa,CAAC,EAAE,YAAY,EAAE,SAAS,YAAY,MAAM,SAAS,YAAY,IAAI;AACpF,WAAO;AAAA,EACT;AAEA,QAAM,UAAU,kBAAkB,GAAG,UAAU;AAC/C,QAAM,gBAAgB,EAAE,cAAc;AAGtC,MAAI,QAAQ,WAAW,KAAK,CAAC,eAAe;AAC1C,WAAO;AAAA,EACT;AAGA,MAAI,SAAS;AACX,UAAM,QAAQ,IAAI,OAAO,SAAS,GAAG;AACrC,UAAM,cAAc,QAAQ,KAAK,CAAC,MAAc,MAAM,KAAK,CAAC,CAAC,KAAK,MAAM,KAAK,aAAa;AAC1F,QAAI,CAAC,YAAa,QAAO;AAAA,EAC3B;AAGA,MAAI,YAAY;AACd,WAAO,kBAAkB,GAAG,YAAY,OAAO;AAAA,EACjD;AAEA,SAAO;AACT;AAKA,SAASC,oBAAmB,GAAa;AACvC,SAAO;AAAA,IACL,WAAW,qBAAqB,EAAE,aAAa,IAAI,EAAE,gBAAgB,CAAC;AAAA,IACtE,SAAS,qBAAqB,EAAE,UAAU,IAAI,EAAE,aAAa,CAAC;AAAA,IAC9D,YAAY,qBAAqB,EAAE,cAAc,IAAI,EAAE,iBAAiB,CAAC;AAAA,EAC3E;AACF;AAKA,eAAsB,aACpB,OACA,SAMyB;AACzB,MAAI,CAAC,OAAO;AACV,UAAM,IAAI,cAAc,iCAAiC;AAAA,EAC3D;AAEA,QAAM,EAAE,UAAU,SAAS,YAAY,QAAQ,GAAG,IAAI;AACtD,QAAM,aAAiC,EAAE,UAAU,SAAS,WAAW;AAEvE,MAAI;AACF,UAAM,aAAa,MAAM,mBAAmB,EAAE,KAAK,CAAC;AACpD,UAAM,QAAQ,MAAM,OAAO,UAAU,EAClC,MAAM,YAAY,EAClB,MAAM,KAAK,IAAI,QAAQ,IAAI,GAAG,CAAC;AAElC,UAAM,UAAU,MAAM,MAAM,QAAQ;AAEpC,UAAM,WAAY,QACf,OAAO,CAAC,MAAM,cAAc,CAAC,KAAK,oBAAoB,GAAG,UAAU,CAAC;AAEvE,WAAO,SAAS,MAAM,GAAG,KAAK,EAAE,IAAI,CAAC,OAAiB;AAAA,MACpD,SAAS,EAAE;AAAA,MACX,UAAU;AAAA,QACR,GAAG,0BAA0B,CAAC;AAAA,QAC9B,SAASA,oBAAmB,CAAC;AAAA,MAC/B;AAAA,MACA,OAAO;AAAA,MACP,WAAW,mBAAmB,CAAC;AAAA,IACjC,EAAE;AAAA,EACJ,SAAS,OAAO;AACd,UAAM,UAAU,OAAO,yBAAyB;AAAA,EAClD;AACF;AAOA,eAAsB,QACpB,OACA,UAGI,CAAC,GACoB;AACzB,MAAI,CAAC,OAAO;AACV,UAAM,IAAI,cAAc,iCAAiC;AAAA,EAC3D;AAEA,MAAI;AAEF,UAAM,YAAY,MAAM,MAAM,UAAU;AAMxC,UAAM,iBAAiB;AACvB,UAAM,UAAU,MAAM,eAAe,OAAO;AAAA,MAC1C,GAAG;AAAA,MACH,OAAO,KAAK,IAAI,WAAW,cAAc;AAAA,IAC3C,CAAC;AAED,WAAO;AAAA,EACT,SAAS,OAAO;AACd,UAAM,UAAU,OAAO,2BAA2B;AAAA,EACpD;AACF;AAlbA,IAgBM,eACA,mBAMA,sBAWA,oBAyPA;AA3RN;AAAA;AAAA;AACA;AACA;AACA;AACA;AACA;AAWA,IAAM,gBAAgB,IAAI,qBAAqB;AAC/C,IAAM,oBAAoB,IAAI,yBAAyB;AAMvD,IAAM,uBAAuB;AAAA,MAC3B,0BAAqB,GAAG,IAAI,kDAA6C;AAAA,MACzE,8BAAuB,GAAG,IAAI,sDAA+C;AAAA,MAC7E,sCAA2B,GAAG,IAAI,8DAAmD;AAAA,IACvF;AAOA,IAAM,qBAAqB;AAAA,MACzB,0BAAqB,GAAG,IAAI,iBAAiB,EAC1C,YAAY,aAAa,EACzB,YAAY,iBAAiB,EAC7B,YAAY,8CAAyC,CAAC;AAAA,MACzD,8BAAuB,GAAG,IAAI,iBAAiB,EAC5C,YAAY,aAAa,EACzB,YAAY,iBAAiB,EAC7B,YAAY,kDAA2C,CAAC;AAAA,MAC3D,sCAA2B,GAAG,IAAI,iBAAiB,EAChD,YAAY,aAAa,EACzB,YAAY,iBAAiB,EAC7B,YAAY,0DAA+C,CAAC;AAAA,IACjE;AA4OA,IAAM,sBAAmD;AAAA,MACvD,UAAU,oBAAI,IAAI,CAAC,YAAY,QAAQ,CAAC;AAAA,MACxC,OAAO,oBAAI,IAAI,CAAC,OAAO,CAAC;AAAA,MACxB,WAAW,oBAAI,IAAI,CAAC,WAAW,CAAC;AAAA,IAClC;AAAA;AAAA;;;AC3OA,SAAS,uBACP,QACA,SACA,UACgB;AAChB,SAAO;AAAA,IACL,QAAQ,MAAM,KAAK,MAAM;AAAA,IACzB;AAAA,IACA,MAAM,SAAS;AAAA,IACf,WAAW,SAAS;AAAA,IACpB,SAAS,SAAS;AAAA,IAClB,MAAM,SAAS;AAAA,IACf,UAAU,SAAS;AAAA;AAAA,IAEnB,eAAe,iBAAiB,SAAS,SAAS,SAAS;AAAA,IAC3D,YAAY,iBAAiB,SAAS,SAAS,OAAO;AAAA,IACtD,gBAAgB,iBAAiB,SAAS,SAAS,UAAU;AAAA;AAAA,IAE7D,YAAY,SAAS,cAAc;AAAA,IACnC,YAAY,SAAS,cAAc;AAAA,IACnC,aAAa,SAAS,eAAe;AAAA,IACrC,YAAY,SAAS,cAAc;AAAA,IACnC,qBAAqB,SAAS,uBAAuB;AAAA,IACrD,YAAY,iBAAiB,SAAS,UAAU;AAAA,IAChD,WAAW,SAAS,aAAa;AAAA,IACjC,SAAS,iBAAiB,SAAS,OAAO;AAAA;AAAA,IAE1C,gBAAgB,SAAS,kBAAkB;AAAA,IAC3C,oBAAoB,SAAS,sBAAsB;AAAA,IACnD,gBAAgB,SAAS,kBAAkB;AAAA,IAC3C,cAAc,SAAS,gBAAgB;AAAA,EACzC;AACF;AAKA,SAAS,iBAAiB,KAAqC;AAC7D,SAAO,OAAO,IAAI,SAAS,IAAI,MAAM,CAAC,EAAE;AAC1C;AAKA,SAAS,iBAAiB,OAAyD;AACjF,QAAM,OAAO,KAAK,MAAM,MAAM,QAAQ,SAAS,CAAC;AAChD,SAAO;AAAA,IACL;AAAA,MACE,SAAS,MAAM,QAAQ,MAAM,GAAG,IAAI;AAAA,MACpC,WAAW,MAAM,UAAU,MAAM,GAAG,IAAI;AAAA,MACxC,UAAU,MAAM,SAAS,MAAM,GAAG,IAAI;AAAA,IACxC;AAAA,IACA;AAAA,MACE,SAAS,MAAM,QAAQ,MAAM,IAAI;AAAA,MACjC,WAAW,MAAM,UAAU,MAAM,IAAI;AAAA,MACrC,UAAU,MAAM,SAAS,MAAM,IAAI;AAAA,IACrC;AAAA,EACF;AACF;AAKA,SAAS,wBAAwB,OAAyC;AACxE,SAAO,MAAM,QAAQ;AAAA,IAAI,CAAC,QAAQ,MAChC,uBAAuB,QAAQ,MAAM,SAAS,CAAC,GAAG,MAAM,UAAU,CAAC,CAAC;AAAA,EACtE;AACF;AAUA,eAAsB,YACpB,IACA,OACA,WACA,SACA,WACA,UAC8B;AAC9B,MAAI,CAAC,IAAI;AACP,UAAM,IAAI,cAAc,iCAAiC;AAAA,EAC3D;AAEA,MAAI,QAAQ,WAAW,UAAU,UAAU,QAAQ,WAAW,SAAS,QAAQ;AAC7E,UAAM,IAAI,cAAc,qEAAqE;AAAA,MAC3F,eAAe,QAAQ;AAAA,MACvB,iBAAiB,UAAU;AAAA,MAC3B,gBAAgB,SAAS;AAAA,IAC3B,CAAC;AAAA,EACH;AAGA,MAAI,QAAQ,WAAW,GAAG;AACxB,WAAO;AAAA,EACT;AAGA,MAAI,QAAQ,SAAS,0BAA0B;AAC7C,QAAI,eAAe;AACnB,aAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK,0BAA0B;AACjE,YAAM,eAAe,QAAQ,MAAM,GAAG,KAAK,IAAI,IAAI,0BAA0B,QAAQ,MAAM,CAAC;AAC5F,YAAM,gBAAgB,UAAU,MAAM,GAAG,KAAK,IAAI,IAAI,0BAA0B,QAAQ,MAAM,CAAC;AAC/F,YAAM,gBAAgB,SAAS,MAAM,GAAG,KAAK,IAAI,IAAI,0BAA0B,QAAQ,MAAM,CAAC;AAE9F,qBAAe,MAAM,oBAAoB,IAAI,cAAc,WAAW,cAAc,eAAe,aAAa;AAAA,IAClH;AACA,QAAI,CAAC,cAAc;AACjB,YAAM,IAAI,cAAc,4CAA4C;AAAA,IACtE;AACA,WAAO;AAAA,EACT,OAAO;AACL,WAAO,oBAAoB,IAAI,OAAO,WAAW,SAAS,WAAW,QAAQ;AAAA,EAC/E;AACF;AAQA,eAAe,oBACb,IACA,OACA,WACA,SACA,WACA,UACuB;AACvB,QAAM,QAA0B,CAAC,EAAE,SAAS,WAAW,SAAS,CAAC;AACjE,QAAM,gBAAkC,CAAC;AACzC,MAAI,eAAe;AACnB,MAAI;AAEJ,SAAO,MAAM,SAAS,GAAG;AACvB,UAAM,QAAQ,MAAM,MAAM;AAC1B,UAAM,eAAe,MAAM,eAAe,IAAI,cAAc,WAAW,KAAK;AAE5E,QAAI,aAAa,SAAS;AACxB,qBAAe,aAAa;AAAA,IAC9B,OAAO;AACL,kBAAY,aAAa;AACzB,yBAAmB,OAAO,OAAO,aAAa;AAAA,IAChD;AAAA,EACF;AAEA,uBAAqB,eAAe,SAAS;AAE7C,MAAI,CAAC,cAAc;AACjB,UAAM,IAAI,cAAc,4CAA4C;AAAA,EACtE;AAEA,SAAO;AACT;AAeA,eAAe,eACb,IACA,cACA,WACA,OACuB;AACvB,MAAI;AACF,UAAM,UAAU,wBAAwB,KAAK;AAE7C,QAAI,CAAC,cAAc;AACjB,YAAM,WAAW,MAAM,GAAG,YAAY,WAAW,OAAO;AACxD,aAAO,EAAE,SAAS,MAAM,OAAO,SAAS;AAAA,IAC1C,OAAO;AACL,YAAM,aAAa,IAAI,OAAO;AAC9B,aAAO,EAAE,SAAS,MAAM,OAAO,aAAa;AAAA,IAC9C;AAAA,EACF,SAAS,OAAO;AAEd,WAAO,EAAE,SAAS,OAAO,OAAO,cAAc,MAAsB;AAAA,EACtE;AACF;AAKA,SAAS,mBACP,OACA,OACA,eACM;AACN,MAAI,MAAM,QAAQ,SAAS,0BAA0B;AAEnD,UAAM,CAAC,WAAW,UAAU,IAAI,iBAAiB,KAAK;AACtD,UAAM,KAAK,WAAW,UAAU;AAAA,EAClC,OAAO;AAEL,kBAAc,KAAK,KAAK;AAAA,EAC1B;AACF;AAMA,SAAS,qBAAqB,eAAiC,WAAyB;AACtF,MAAI,cAAc,WAAW,EAAG;AAEhC,QAAM,cAAc,cAAc,OAAO,CAAC,KAAK,UAAU,MAAM,MAAM,QAAQ,QAAQ,CAAC;AACtF,QAAM,IAAI;AAAA,IACR,oBAAoB,WAAW;AAAA,IAC/B;AAAA,MACE,eAAe,cAAc;AAAA,MAC7B,cAAc;AAAA,MACd,YAAY,cAAc,CAAC,EAAE,UAAU,CAAC,EAAE;AAAA,MAC1C,WAAW,WAAW;AAAA,IACxB;AAAA,EACF;AACF;AA3RA;AAAA;AAAA;AACA;AACA;AAAA;AAAA;;;ACFA,OAAOC,UAAQ;AACf,OAAOC,YAAU;AAgBjB,eAAsB,MACpB,IACA,OACA,WACA,QACe;AACf,MAAI,CAAC,IAAI;AACP,UAAM,IAAI,cAAc,iCAAiC;AAAA,EAC3D;AAEA,MAAI;AAEF,QAAI,OAAO;AACT,YAAM,GAAG,UAAU,SAAS;AAAA,IAC9B;AAIA,QAAI,QAAQ;AACV,YAAM,WAAWA,OAAK,KAAK,QAAQ,GAAG,SAAS,QAAQ;AACvD,UAAI;AACF,cAAMD,KAAG,GAAG,UAAU,EAAE,WAAW,MAAM,OAAO,KAAK,CAAC;AAAA,MACxD,QAAQ;AAAA,MAER;AAAA,IACF;AAAA,EACF,SAAS,OAAO;AACd,UAAM,UAAU,OAAO,iCAAiC;AAAA,EAC1D;AACF;AAKA,eAAsB,aACpB,OACA,UACe;AACf,MAAI,CAAC,OAAO;AACV,UAAM,IAAI,cAAc,iCAAiC;AAAA,EAC3D;AAEA,MAAI;AACF,UAAM,MAAM,OAAO,WAAW,QAAQ,GAAG;AAAA,EAC3C,SAAS,OAAO;AACd,UAAM,UAAU,OAAO,4CAA4C;AAAA,EACrE;AACF;AAKA,eAAsB,WACpB,IACA,OACA,WACA,QACA,UACA,SACA,WACA,UACuB;AACvB,MAAI,CAAC,OAAO;AACV,UAAM,IAAI,cAAc,iCAAiC;AAAA,EAC3D;AAEA,MAAI;AAEF,UAAM,aAAa,OAAO,QAAQ;AAGlC,QAAI,eAAe;AACnB,QAAI,QAAQ,SAAS,GAAG;AACtB,qBAAe,MAAM,YAAY,IAAI,OAAO,WAAW,SAAS,WAAW,QAAQ;AACnF,UAAI,CAAC,cAAc;AACjB,cAAM,IAAI,cAAc,wCAAwC;AAAA,MAClE;AAAA,IACF;AAGA,UAAM,iBAAiB,MAAM;AAE7B,WAAO;AAAA,EACT,SAAS,OAAO;AACd,UAAM,UAAU,OAAO,0CAA0C;AAAA,EACnE;AACF;AAvGA;AAAA;AAAA;AAGA;AACA,IAAAE;AACA;AAAA;AAAA;;;ACLA;AAAA;AAAA;AAAA;AAAA,YAAY,aAAa;AACzB,OAAOC,YAAU;AACjB,OAAOC,SAAQ;AACf,OAAOC,aAAY;AAHnB,IAgBa;AAhBb;AAAA;AAAA;AAMA;AACA,IAAAC;AACA;AACA;AACA;AACA;AAKO,IAAM,WAAN,MAAM,UAAsC;AAAA,MACzC,KAA+B;AAAA,MAC/B,QAA6B;AAAA,MACrB;AAAA,MACC,YAAY;AAAA,MACrB,mBAA2B;AAAA,MAC3B,iBAAyB;AAAA,MAEjC,YAAY,aAAqB;AAE/B,cAAM,cAAcH,OAAK,SAAS,WAAW;AAG7C,cAAM,WAAWE,QACd,WAAW,KAAK,EAChB,OAAO,WAAW,EAClB,OAAO,KAAK,EACZ,UAAU,GAAG,CAAC;AAEjB,aAAK,SAASF,OAAK;AAAA,UACjBC,IAAG,QAAQ;AAAA,UACX;AAAA,UACA;AAAA,UACA,GAAG,WAAW,IAAI,QAAQ;AAAA,QAC5B;AAAA,MACF;AAAA,MAEA,MAAM,aAA4B;AAChC,YAAI;AACF,eAAK,KAAK,MAAc,gBAAQ,KAAK,MAAM;AAE3C,cAAI;AACF,iBAAK,QAAQ,MAAM,KAAK,GAAG,UAAU,KAAK,SAAS;AAAA,UACrD,QAAQ;AAEN,iBAAK,QAAQ;AAAA,UACf;AAGA,cAAI;AACF,iBAAK,iBAAiB,MAAM,gBAAgB,KAAK,MAAM;AAAA,UACzD,QAAQ;AAEN,iBAAK,iBAAiB;AAAA,UACxB;AAAA,QACF,SAAS,OAAgB;AACvB,gBAAM,UAAU,OAAO,wCAAwC,EAAE,QAAQ,KAAK,OAAO,CAAC;AAAA,QACxF;AAAA,MACF;AAAA,MAEA,MAAM,YACJ,SACA,WACA,UACe;AACf,YAAI,CAAC,KAAK,IAAI;AACZ,gBAAM,IAAI,cAAc,iCAAiC;AAAA,QAC3D;AAGA,aAAK,QAAQ,MAAe;AAAA,UAC1B,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL;AAAA,UACA;AAAA,UACA;AAAA,QACF;AAAA,MACF;AAAA,MAEA,MAAM,OACJ,aACA,QAAgB,GAChB,OACyB;AACzB,YAAI,CAAC,KAAK,OAAO;AACf,gBAAM,IAAI,cAAc,iCAAiC;AAAA,QAC3D;AAEA,YAAI;AACF,iBAAO,MAAe,OAAO,KAAK,OAAO,aAAa,OAAO,KAAK;AAAA,QACpE,SAAS,OAAO;AACd,gBAAM,WAAW,OAAO,KAAK;AAG7B,cAAI,SAAS,SAAS,YAAY,KAAK,SAAS,SAAS,QAAQ,GAAG;AAElE,gBAAI;AACF,oBAAM,KAAK,WAAW;AACtB,kBAAI,CAAC,KAAK,OAAO;AACf,sBAAM,IAAI,cAAc,oDAAoD;AAAA,cAC9E;AACA,qBAAO,MAAe,OAAO,KAAK,OAAO,aAAa,OAAO,KAAK;AAAA,YACpE,SAAS,YAAqB;AAC5B,oBAAM,IAAI;AAAA,gBACR;AAAA,gBACA,EAAE,eAAe,WAAW;AAAA,cAC9B;AAAA,YACF;AAAA,UACF;AAEA,gBAAM;AAAA,QACR;AAAA,MACF;AAAA,MAEA,MAAM,eAAe,SAIO;AAC1B,YAAI,CAAC,KAAK,OAAO;AACf,gBAAM,IAAI,cAAc,iCAAiC;AAAA,QAC3D;AACA,eAAgB,eAAe,KAAK,OAAO,OAAO;AAAA,MACpD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,MAAM,QAAQ,UAGV,CAAC,GAA4B;AAC/B,YAAI,CAAC,KAAK,OAAO;AACf,gBAAM,IAAI,cAAc,iCAAiC;AAAA,QAC3D;AACA,eAAgB,QAAQ,KAAK,OAAO,OAAO;AAAA,MAC7C;AAAA,MAEA,MAAM,aAAa,SAKS;AAC1B,YAAI,CAAC,KAAK,OAAO;AACf,gBAAM,IAAI,cAAc,iCAAiC;AAAA,QAC3D;AACA,eAAgB,aAAa,KAAK,OAAO,OAAO;AAAA,MAClD;AAAA,MAEA,MAAM,QAAuB;AAC3B,YAAI,CAAC,KAAK,IAAI;AACZ,gBAAM,IAAI,cAAc,iCAAiC;AAAA,QAC3D;AACA,cAAqB,MAAM,KAAK,IAAI,KAAK,OAAO,KAAK,WAAW,KAAK,MAAM;AAC3E,aAAK,QAAQ;AAAA,MACf;AAAA,MAEA,MAAM,aAAa,UAAiC;AAClD,YAAI,CAAC,KAAK,OAAO;AACf,gBAAM,IAAI,cAAc,iCAAiC;AAAA,QAC3D;AACA,cAAqB,aAAa,KAAK,OAAO,QAAQ;AAAA,MACxD;AAAA,MAEA,MAAM,WACJ,UACA,SACA,WACA,UACe;AACf,YAAI,CAAC,KAAK,IAAI;AACZ,gBAAM,IAAI,cAAc,4CAA4C;AAAA,QACtE;AACA,YAAI,CAAC,KAAK,OAAO;AACf,gBAAM,IAAI,cAAc,uCAAuC;AAAA,QACjE;AACA,aAAK,QAAQ,MAAqB;AAAA,UAChC,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,QACF;AAAA,MACF;AAAA,MAEA,MAAM,eAAiC;AACrC,cAAM,MAAM,KAAK,IAAI;AAGrB,YAAI,MAAM,KAAK,mBAAmB,KAAM;AACtC,iBAAO;AAAA,QACT;AAEA,aAAK,mBAAmB;AAExB,YAAI;AACF,gBAAM,UAAU,MAAM,gBAAgB,KAAK,MAAM;AAEjD,cAAI,UAAU,KAAK,gBAAgB;AACjC,iBAAK,iBAAiB;AACtB,mBAAO;AAAA,UACT;AAEA,iBAAO;AAAA,QACT,SAAS,OAAO;AAEd,iBAAO;AAAA,QACT;AAAA,MACF;AAAA,MAEA,MAAM,YAA2B;AAC/B,YAAI;AAEF,eAAK,QAAQ;AACb,eAAK,KAAK;AAGV,gBAAM,KAAK,WAAW;AAAA,QACxB,SAAS,OAAO;AACd,gBAAM,UAAU,OAAO,wCAAwC;AAAA,QACjE;AAAA,MACF;AAAA,MAEA,oBAA4B;AAC1B,eAAO,KAAK;AAAA,MACd;AAAA,MAEA,iBAAyB;AACvB,YAAI,KAAK,mBAAmB,GAAG;AAC7B,iBAAO;AAAA,QACT;AACA,eAAO,IAAI,KAAK,KAAK,cAAc,EAAE,eAAe;AAAA,MACtD;AAAA,MAEA,MAAM,UAA4B;AAChC,YAAI,CAAC,KAAK,OAAO;AACf,iBAAO;AAAA,QACT;AAEA,YAAI;AACF,gBAAM,QAAQ,MAAM,KAAK,MAAM,UAAU;AAEzC,cAAI,UAAU,GAAG;AACf,mBAAO;AAAA,UACT;AAGA,gBAAM,SAAS,MAAM,KAAK,MACvB,OAAO,MAAM,mBAAmB,EAAE,KAAK,CAAC,CAAC,EACzC,MAAM,KAAK,IAAI,OAAO,CAAC,CAAC,EACxB,QAAQ;AAEX,gBAAM,cAAe,OAA4B;AAAA,YAAK,CAAC,MACrD,EAAE,WACF,EAAE,QAAQ,KAAK,EAAE,SAAS;AAAA,UAC5B;AAEA,iBAAO;AAAA,QACT,QAAQ;AAEN,iBAAO;AAAA,QACT;AAAA,MACF;AAAA,MAEA,aAAa,KAAK,aAAwC;AACxD,cAAM,KAAK,IAAI,UAAS,WAAW;AACnC,cAAM,GAAG,WAAW;AACpB,eAAO;AAAA,MACT;AAAA,IACF;AAAA;AAAA;;;AC3RA;AAAA;AAAA;AAAA;AAAA,OAAOG,UAAQ;AACf,OAAOC,YAAU;AADjB,IAMM,eA8BO;AApCb;AAAA;AAAA;AAEA;AAEA;AAEA,IAAM,gBAAgB;AA8Bf,IAAM,kBAAN,MAAsB;AAAA,MACnB;AAAA,MACA;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,aAAa,QAAQ,QAAQ;AAAA;AAAA;AAAA;AAAA;AAAA,MAMrC,YAAY,WAAmB;AAC7B,aAAK,YAAY;AACjB,aAAK,eAAeA,OAAK,KAAK,WAAW,aAAa;AAAA,MACxD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAWA,MAAM,OAAsC;AAC1C,YAAI;AACF,gBAAM,UAAU,MAAMD,KAAG,SAAS,KAAK,cAAc,OAAO;AAC5D,gBAAM,WAAW,KAAK,MAAM,OAAO;AAGnC,cAAI,SAAS,kBAAkB,sBAAsB;AACnD,oBAAQ;AAAA,cACN,wBAAwB,SAAS,aAAa,kCAAkC,oBAAoB;AAAA,YACtG;AACA,oBAAQ,MAAM,iDAAiD;AAG/D,kBAAM,KAAK,MAAM;AACjB,mBAAO;AAAA,UACT;AAEA,iBAAO;AAAA,QACT,SAAS,OAAO;AAEd,cAAK,MAAgC,SAAS,UAAU;AACtD,mBAAO;AAAA,UACT;AAGA,kBAAQ,MAAM,4CAA4C,KAAK,EAAE;AACjE,iBAAO;AAAA,QACT;AAAA,MACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,MAAM,KAAK,UAAwC;AACjD,YAAI;AAEF,gBAAMA,KAAG,MAAM,KAAK,WAAW,EAAE,WAAW,KAAK,CAAC;AAGlD,gBAAM,iBAAgC;AAAA,YACpC,GAAG;AAAA,YACH,eAAe;AAAA,YACf,aAAa,kBAAkB;AAAA,YAC/B,aAAa,KAAK,IAAI;AAAA,UACxB;AAEA,gBAAM,UAAU,KAAK,UAAU,gBAAgB,MAAM,CAAC;AACtD,gBAAMA,KAAG,UAAU,KAAK,cAAc,SAAS,OAAO;AAAA,QACxD,SAAS,OAAO;AAEd,kBAAQ,MAAM,4CAA4C,KAAK,EAAE;AAAA,QACnE;AAAA,MACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MASA,MAAM,WAAW,UAAkB,OAAiC;AAElE,aAAK,aAAa,KAAK,WAAW,KAAK,YAAY;AACjD,gBAAM,WAAW,MAAM,KAAK,KAAK,KAAK,KAAK,YAAY;AACvD,mBAAS,MAAM,QAAQ,IAAI;AAC3B,gBAAM,KAAK,KAAK,QAAQ;AAAA,QAC1B,CAAC,EAAE,MAAM,WAAS;AAChB,kBAAQ,MAAM,wCAAwC,QAAQ,KAAK,KAAK,EAAE;AAE1E,iBAAO;AAAA,QACT,CAAC;AAGD,cAAM,KAAK;AAAA,MACb;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAWA,MAAM,WAAW,UAAiC;AAEhD,aAAK,aAAa,KAAK,WAAW,KAAK,YAAY;AACjD,gBAAM,WAAW,MAAM,KAAK,KAAK;AACjC,cAAI,CAAC,UAAU;AAEb;AAAA,UACF;AAEA,iBAAO,SAAS,MAAM,QAAQ;AAC9B,gBAAM,KAAK,KAAK,QAAQ;AAAA,QAC1B,CAAC,EAAE,MAAM,WAAS;AAChB,kBAAQ,MAAM,8CAA8C,QAAQ,KAAK,KAAK,EAAE;AAEhF,iBAAO;AAAA,QACT,CAAC;AAGD,cAAM,KAAK;AAAA,MACb;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,MAAM,YAAY,SAAqC;AAErD,aAAK,aAAa,KAAK,WAAW,KAAK,YAAY;AACjD,gBAAM,WAAW,MAAM,KAAK,KAAK,KAAK,KAAK,YAAY;AAEvD,qBAAW,SAAS,SAAS;AAC3B,qBAAS,MAAM,MAAM,QAAQ,IAAI;AAAA,UACnC;AAEA,gBAAM,KAAK,KAAK,QAAQ;AAAA,QAC1B,CAAC,EAAE,MAAM,WAAS;AAChB,kBAAQ,MAAM,wCAAwC,QAAQ,MAAM,WAAW,KAAK,EAAE;AAEtF,iBAAO;AAAA,QACT,CAAC;AAGD,cAAM,KAAK;AAAA,MACb;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,MAAM,eAAe,UAAmC;AAEtD,aAAK,aAAa,KAAK,WAAW,KAAK,YAAY;AACjD,gBAAM,WAAW,MAAM,KAAK,KAAK,KAAK,KAAK,YAAY;AAEvD,mBAAS,WAAW;AACpB,gBAAM,KAAK,KAAK,QAAQ;AAAA,QAC1B,CAAC,EAAE,MAAM,WAAS;AAChB,kBAAQ,MAAM,kDAAkD,KAAK,EAAE;AAEvE,iBAAO;AAAA,QACT,CAAC;AAGD,cAAM,KAAK;AAAA,MACb;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOA,MAAM,kBAAqC;AACzC,cAAM,WAAW,MAAM,KAAK,KAAK;AACjC,YAAI,CAAC,SAAU,QAAO,CAAC;AAEvB,eAAO,OAAO,KAAK,SAAS,KAAK;AAAA,MACnC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,MAAM,gBAAgB,cAAsD;AAC1E,cAAM,WAAW,MAAM,KAAK,KAAK;AACjC,YAAI,CAAC,UAAU;AAEb,iBAAO,MAAM,KAAK,aAAa,KAAK,CAAC;AAAA,QACvC;AAEA,cAAM,eAAyB,CAAC;AAEhC,mBAAW,CAAC,UAAU,KAAK,KAAK,cAAc;AAC5C,gBAAM,QAAQ,SAAS,MAAM,QAAQ;AAErC,cAAI,CAAC,OAAO;AAEV,yBAAa,KAAK,QAAQ;AAAA,UAC5B,WAAW,MAAM,eAAe,OAAO;AAErC,yBAAa,KAAK,QAAQ;AAAA,UAC5B;AAAA,QACF;AAEA,eAAO;AAAA,MACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MASA,MAAM,gBAAgB,cAA8C;AAClE,cAAM,WAAW,MAAM,KAAK,KAAK;AACjC,YAAI,CAAC,SAAU,QAAO,CAAC;AAEvB,cAAM,eAAyB,CAAC;AAEhC,mBAAW,YAAY,OAAO,KAAK,SAAS,KAAK,GAAG;AAClD,cAAI,CAAC,aAAa,IAAI,QAAQ,GAAG;AAC/B,yBAAa,KAAK,QAAQ;AAAA,UAC5B;AAAA,QACF;AAEA,eAAO;AAAA,MACT;AAAA;AAAA;AAAA;AAAA,MAKA,MAAM,QAAuB;AAC3B,YAAI;AACF,gBAAMA,KAAG,OAAO,KAAK,YAAY;AAAA,QACnC,SAAS,OAAO;AAEd,cAAK,MAAgC,SAAS,UAAU;AACtD,oBAAQ,MAAM,6CAA6C,KAAK,EAAE;AAAA,UACpE;AAAA,QACF;AAAA,MACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOQ,cAA6B;AACnC,eAAO;AAAA,UACL,eAAe;AAAA,UACf,aAAa,kBAAkB;AAAA,UAC/B,aAAa,KAAK,IAAI;AAAA,UACtB,OAAO,CAAC;AAAA,QACV;AAAA,MACF;AAAA,IACF;AAAA;AAAA;;;AC1TA;AAAA;AAAA;AAAA;AAAA,OAAOE,UAAQ;AACf,OAAOC,YAAU;AADjB,IAoBa;AApBb;AAAA;AAAA;AAEA;AAkBO,IAAM,kBAAN,MAAsB;AAAA,MACnB;AAAA,MACA;AAAA,MACA,eAAgC;AAAA,MAExC,YAAY,SAAiB,WAAmB;AAC9C,aAAK,UAAU;AACf,aAAK,YAAYA,OAAK,KAAK,WAAW,iBAAiB;AAAA,MACzD;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,MAAc,YAAsC;AAClD,YAAI;AACF,gBAAM,UAAU,MAAMD,KAAG,SAAS,KAAK,WAAW,OAAO;AACzD,iBAAO,KAAK,MAAM,OAAO;AAAA,QAC3B,QAAQ;AAEN,iBAAO;AAAA,QACT;AAAA,MACF;AAAA;AAAA;AAAA;AAAA,MAKA,MAAc,UAAU,OAAgC;AACtD,YAAI;AACF,gBAAM,UAAU,KAAK,UAAU,OAAO,MAAM,CAAC;AAC7C,gBAAMA,KAAG,UAAU,KAAK,WAAW,SAAS,OAAO;AAAA,QACrD,SAAS,OAAO;AAEd,kBAAQ,MAAM,6CAA6C,KAAK,EAAE;AAAA,QACpE;AAAA,MACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,MAAc,qBAAwC;AACpD,cAAM,SAAS,MAAM,iBAAiB,KAAK,OAAO;AAClD,cAAM,SAAS,MAAM,iBAAiB,KAAK,OAAO;AAElD,eAAO;AAAA,UACL;AAAA,UACA;AAAA,UACA,WAAW,KAAK,IAAI;AAAA,QACtB;AAAA,MACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,MAAM,aAAuC;AAE3C,cAAM,SAAS,MAAM,UAAU,KAAK,OAAO;AAC3C,YAAI,CAAC,QAAQ;AACX,iBAAO;AAAA,QACT;AAEA,YAAI;AAEF,eAAK,eAAe,MAAM,KAAK,mBAAmB;AAGlD,gBAAM,gBAAgB,MAAM,KAAK,UAAU;AAE3C,cAAI,CAAC,eAAe;AAElB,kBAAM,KAAK,UAAU,KAAK,YAAY;AACtC,mBAAO;AAAA,UACT;AAGA,gBAAM,gBAAgB,cAAc,WAAW,KAAK,aAAa;AACjE,gBAAM,gBAAgB,cAAc,WAAW,KAAK,aAAa;AAEjE,cAAI,CAAC,iBAAiB,CAAC,eAAe;AAEpC,mBAAO;AAAA,UACT;AAGA,cAAI,eAAyB,CAAC;AAE9B,cAAI,eAAe;AAEjB,gBAAI;AACF,6BAAe,MAAM;AAAA,gBACnB,KAAK;AAAA,gBACL,cAAc;AAAA,gBACd,KAAK,aAAa;AAAA,cACpB;AAAA,YACF,SAAS,OAAO;AAEd,sBAAQ,MAAM,iDAAiD,KAAK,EAAE;AACtE,6BAAe,MAAM;AAAA,gBACnB,KAAK;AAAA,gBACL,cAAc;AAAA,gBACd,KAAK,aAAa;AAAA,cACpB;AAAA,YACF;AAAA,UACF,WAAW,eAAe;AAExB,2BAAe,MAAM;AAAA,cACnB,KAAK;AAAA,cACL,cAAc;AAAA,cACd,KAAK,aAAa;AAAA,YACpB;AAAA,UACF;AAGA,gBAAM,KAAK,UAAU,KAAK,YAAY;AAEtC,iBAAO;AAAA,QACT,SAAS,OAAO;AACd,kBAAQ,MAAM,4CAA4C,KAAK,EAAE;AACjE,iBAAO;AAAA,QACT;AAAA,MACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,MAAM,gBAA0C;AAE9C,cAAM,SAAS,MAAM,UAAU,KAAK,OAAO;AAC3C,YAAI,CAAC,QAAQ;AACX,iBAAO;AAAA,QACT;AAEA,YAAI;AAEF,gBAAM,WAAW,MAAM,KAAK,mBAAmB;AAG/C,cAAI,CAAC,KAAK,cAAc;AACtB,iBAAK,eAAe;AACpB,kBAAM,KAAK,UAAU,QAAQ;AAC7B,mBAAO;AAAA,UACT;AAGA,gBAAM,gBAAgB,KAAK,aAAa,WAAW,SAAS;AAC5D,gBAAM,gBAAgB,KAAK,aAAa,WAAW,SAAS;AAE5D,cAAI,CAAC,iBAAiB,CAAC,eAAe;AAEpC,mBAAO;AAAA,UACT;AAGA,cAAI,eAAyB,CAAC;AAE9B,cAAI,eAAe;AAEjB,gBAAI;AACF,6BAAe,MAAM;AAAA,gBACnB,KAAK;AAAA,gBACL,KAAK,aAAa;AAAA,gBAClB,SAAS;AAAA,cACX;AAAA,YACF,SAAS,OAAO;AAEd,sBAAQ,MAAM,iDAAiD,KAAK,EAAE;AACtE,6BAAe,MAAM;AAAA,gBACnB,KAAK;AAAA,gBACL,KAAK,aAAa;AAAA,gBAClB,SAAS;AAAA,cACX;AAAA,YACF;AAAA,UACF,WAAW,eAAe;AAExB,2BAAe,MAAM;AAAA,cACnB,KAAK;AAAA,cACL,KAAK,aAAa;AAAA,cAClB,SAAS;AAAA,YACX;AAAA,UACF;AAGA,eAAK,eAAe;AACpB,gBAAM,KAAK,UAAU,QAAQ;AAE7B,iBAAO;AAAA,QACT,SAAS,OAAO;AACd,kBAAQ,MAAM,wCAAwC,KAAK,EAAE;AAC7D,iBAAO;AAAA,QACT;AAAA,MACF;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,WAA4B;AAC1B,eAAO,KAAK;AAAA,MACd;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,MAAM,cAA6B;AACjC,YAAI;AACF,eAAK,eAAe,MAAM,KAAK,mBAAmB;AAClD,gBAAM,KAAK,UAAU,KAAK,YAAY;AAAA,QACxC,SAAS,OAAO;AACd,kBAAQ,MAAM,sCAAsC,KAAK,EAAE;AAAA,QAC7D;AAAA,MACF;AAAA,IACF;AAAA;AAAA;;;AC/MO,SAAS,GAAM,OAA4B;AAChD,SAAO,EAAE,IAAI,MAAM,MAAM;AAC3B;AAKO,SAAS,IAAO,OAA4B;AACjD,SAAO,EAAE,IAAI,OAAO,MAAM;AAC5B;AAKO,SAAS,KAAW,QAAwD;AACjF,SAAO,OAAO;AAChB;AAlDA;AAAA;AAAA;AAAA;AAAA;;;ACAA,OAAOE,UAAQ;AACf,OAAOC,YAAU;AAmBV,SAAS,wBAAwB,UAAkB,SAA0B;AAElF,QAAM,QAAQ,WAAW,QAAQ,IAAI,GAAG,QAAQ,OAAO,GAAG,EAAE,QAAQ,OAAO,EAAE;AAC7E,QAAM,aAAa,SAAS,QAAQ,OAAO,GAAG;AAG9C,MAAI,CAACA,OAAK,WAAW,QAAQ,GAAG;AAC9B,WAAO;AAAA,EACT;AAGA,MAAI,WAAW,WAAW,OAAO,GAAG,GAAG;AACrC,WAAO,WAAW,MAAM,KAAK,SAAS,CAAC;AAAA,EACzC;AACA,MAAI,WAAW,WAAW,IAAI,GAAG;AAC/B,WAAO,WAAW,MAAM,KAAK,MAAM;AAAA,EACrC;AAGA,SAAOA,OAAK,SAAS,MAAM,QAAQ,EAAE,QAAQ,OAAO,GAAG;AACzD;AAsCA,eAAe,mBACb,UACA,SACA,YACA,QACA,SACmC;AAEnC,QAAM,YAAY,eAAe,MAAM,IACnC,OAAO,KAAK,YACX,eAAe,MAAM,IAAI,OAAO,SAAS,YAAY;AAC1D,QAAM,eAAe,eAAe,MAAM,IACtC,OAAO,KAAK,eACX,eAAe,MAAM,IAAI,OAAO,SAAS,eAAe;AAC7D,QAAM,SAAS,eAAe,MAAM,IAChC,OAAO,SAAS,SAChB;AACJ,QAAM,cAAc,eAAe,MAAM,IACrC,OAAO,SAAS,cAChB;AAGJ,QAAM,SAAS,UAAU,UAAU,SAAS;AAAA,IAC1C;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF,CAAC;AAED,MAAI,OAAO,WAAW,GAAG;AAEvB,QAAI,SAAS;AACX,cAAQ,MAAM,sBAAsB,QAAQ,EAAE;AAAA,IAChD;AACA,WAAO;AAAA,EACT;AAIA,QAAM,QAAQ,OAAO,IAAI,OAAK,EAAE,OAAO;AACvC,QAAM,UAA0B,CAAC;AAEjC,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK,4BAA4B;AACjE,UAAM,aAAa,MAAM,MAAM,GAAG,KAAK,IAAI,IAAI,4BAA4B,MAAM,MAAM,CAAC;AACxF,UAAM,eAAe,MAAM,WAAW,WAAW,UAAU;AAC3D,YAAQ,KAAK,GAAG,YAAY;AAG5B,QAAI,MAAM,SAAS,4BAA4B;AAC7C,YAAM,IAAI,QAAQ,aAAW,aAAa,OAAO,CAAC;AAAA,IACpD;AAAA,EACF;AAEA,SAAO;AAAA,IACL,YAAY,OAAO;AAAA,IACnB;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;AAaA,eAAsB,gBACpB,UACA,UACA,YACA,QACA,UAAmC,CAAC,GACrB;AACf,QAAM,EAAE,QAAQ,IAAI;AAIpB,QAAM,iBAAiB,wBAAwB,QAAQ;AAEvD,MAAI;AAEF,QAAI;AACF,YAAMD,KAAG,OAAO,QAAQ;AAAA,IAC1B,QAAQ;AAEN,UAAI,SAAS;AACX,gBAAQ,MAAM,wBAAwB,cAAc,EAAE;AAAA,MACxD;AACA,YAAM,SAAS,aAAa,cAAc;AAE1C,YAAME,YAAW,IAAI,gBAAgB,SAAS,MAAM;AACpD,YAAMA,UAAS,WAAW,cAAc;AACxC;AAAA,IACF;AAGA,UAAM,UAAU,MAAMF,KAAG,SAAS,UAAU,OAAO;AAGnD,UAAM,SAAS,MAAM,mBAAmB,gBAAgB,SAAS,YAAY,QAAQ,WAAW,KAAK;AAGrG,UAAM,QAAQ,MAAMA,KAAG,KAAK,QAAQ;AACpC,UAAM,WAAW,IAAI,gBAAgB,SAAS,MAAM;AAEpD,QAAI,WAAW,MAAM;AAEnB,YAAM,SAAS,aAAa,cAAc;AAC1C,YAAM,SAAS,WAAW,gBAAgB;AAAA,QACxC,UAAU;AAAA,QACV,cAAc,MAAM;AAAA,QACpB,YAAY;AAAA,MACd,CAAC;AACD;AAAA,IACF;AAGA,UAAM,SAAS;AAAA,MACb;AAAA,MACA,OAAO;AAAA,MACP,OAAO,OAAO,IAAI,OAAK,EAAE,QAAQ;AAAA,MACjC,OAAO;AAAA,IACT;AAGA,UAAM,SAAS,WAAW,gBAAgB;AAAA,MACxC,UAAU;AAAA,MACV,cAAc,MAAM;AAAA,MACpB,YAAY,OAAO;AAAA,IACrB,CAAC;AAED,QAAI,SAAS;AACX,cAAQ,MAAM,yBAAoB,cAAc,KAAK,OAAO,UAAU,UAAU;AAAA,IAClF;AAAA,EACF,SAAS,OAAO;AAEd,YAAQ,MAAM,wCAA8B,cAAc,KAAK,KAAK,EAAE;AAAA,EACxE;AACF;AASA,eAAe,6BACb,UACA,gBACA,YACA,QACA,SAC4C;AAC5C,MAAI;AAEF,UAAM,QAAQ,MAAMA,KAAG,KAAK,QAAQ;AACpC,UAAM,UAAU,MAAMA,KAAG,SAAS,UAAU,OAAO;AAGnD,UAAM,SAAS,MAAM,mBAAmB,gBAAgB,SAAS,YAAY,QAAQ,OAAO;AAE5F,WAAO,GAAG;AAAA,MACR,UAAU;AAAA;AAAA,MACV;AAAA,MACA,OAAO,MAAM;AAAA,IACf,CAAC;AAAA,EACH,SAAS,OAAO;AACd,WAAO,IAAI,qBAAqB,cAAc,KAAK,KAAK,EAAE;AAAA,EAC5D;AACF;AAmBA,eAAsB,mBACpB,WACA,UACA,YACA,QACA,UAAmC,CAAC,GACnB;AACjB,QAAM,EAAE,QAAQ,IAAI;AACpB,MAAI,iBAAiB;AAGrB,QAAM,kBAAkF,CAAC;AAGzF,aAAW,YAAY,WAAW;AAGhC,UAAM,iBAAiB,wBAAwB,QAAQ;AAEvD,UAAM,SAAS,MAAM,6BAA6B,UAAU,gBAAgB,YAAY,QAAQ,WAAW,KAAK;AAEhH,QAAI,KAAK,MAAM,GAAG;AAChB,YAAM,EAAE,UAAU,YAAY,QAAQ,eAAe,MAAM,IAAI,OAAO;AAEtE,UAAI,kBAAkB,MAAM;AAE1B,YAAI;AACF,gBAAM,SAAS,aAAa,UAAU;AAAA,QACxC,SAAS,OAAO;AAAA,QAEhB;AAGA,cAAM,WAAW,IAAI,gBAAgB,SAAS,MAAM;AACpD,cAAM,SAAS,WAAW,YAAY;AAAA,UACpC,UAAU;AAAA,UACV,cAAc;AAAA,UACd,YAAY;AAAA,QACd,CAAC;AAED;AACA;AAAA,MACF;AAGA,UAAI;AACF,cAAM,SAAS,aAAa,UAAU;AAAA,MACxC,SAAS,OAAO;AAAA,MAEhB;AAGA,YAAM,SAAS;AAAA,QACb,cAAc;AAAA,QACd,cAAc,OAAO,IAAI,OAAK,EAAE,QAAQ;AAAA,QACxC,cAAc;AAAA,MAChB;AAGA,sBAAgB,KAAK;AAAA,QACnB,UAAU;AAAA,QACV,YAAY,cAAc;AAAA,QAC1B;AAAA,MACF,CAAC;AAED,UAAI,SAAS;AACX,gBAAQ,MAAM,yBAAoB,UAAU,KAAK,cAAc,UAAU,UAAU;AAAA,MACrF;AAEA;AAAA,IACF,OAAO;AAEL,UAAI,SAAS;AACX,gBAAQ,MAAM,UAAU,OAAO,KAAK,EAAE;AAAA,MACxC;AAEA,UAAI;AACF,cAAM,SAAS,aAAa,cAAc;AAC1C,cAAM,WAAW,IAAI,gBAAgB,SAAS,MAAM;AACpD,cAAM,SAAS,WAAW,cAAc;AAAA,MAC1C,SAAS,OAAO;AAEd,YAAI,SAAS;AACX,kBAAQ,MAAM,gBAAgB,cAAc,eAAe;AAAA,QAC7D;AAAA,MACF;AAGA;AAAA,IACF;AAAA,EACF;AAGA,MAAI,gBAAgB,SAAS,GAAG;AAC9B,UAAM,WAAW,IAAI,gBAAgB,SAAS,MAAM;AACpD,UAAM,SAAS;AAAA,MACb,gBAAgB,IAAI,YAAU;AAAA,QAC5B,UAAU,MAAM;AAAA,QAChB,cAAc,MAAM;AAAA;AAAA,QACpB,YAAY,MAAM;AAAA,MACpB,EAAE;AAAA,IACJ;AAAA,EACF;AAEA,SAAO;AACT;AA1XA;AAAA;AAAA;AAEA,IAAAG;AAGA;AACA;AACA;AAEA;AAAA;AAAA;;;ACTA,OAAOC,UAAQ;AACf,OAAOC,YAAU;AAsBjB,eAAe,mBACb,SACA,QACA,eACuF;AACvF,MAAI,CAAC,cAAe,QAAO,EAAE,SAAS,MAAM;AAE5C,QAAM,eAAe,MAAM,eAAe;AAC1C,QAAM,SAAS,MAAM,UAAU,OAAO;AACtC,MAAI,CAAC,gBAAgB,CAAC,OAAQ,QAAO,EAAE,SAAS,MAAM;AAEtD,QAAM,aAAa,IAAI,gBAAgB,SAAS,MAAM;AACtD,QAAM,WAAW,WAAW;AAC5B,QAAM,eAAe,WAAW,SAAS;AAEzC,MAAI,CAAC,aAAc,QAAO,EAAE,SAAS,MAAM;AAE3C,QAAM,UAAU,aAAa,WAAW,cAAc,UACtC,aAAa,WAAW,cAAc;AAEtD,SAAO,EAAE,SAAS,aAAa;AACjC;AAKA,SAAS,uBACP,mBACA,gBACA,yBACA,UAC4D;AAC5D,QAAM,kBAAkB,IAAI,IAAI,iBAAiB;AACjD,QAAM,QAAkB,CAAC;AACzB,QAAM,WAAqB,CAAC;AAC5B,QAAM,UAAoB,CAAC;AAG3B,aAAW,YAAY,mBAAmB;AACxC,QAAI,eAAe,IAAI,QAAQ,GAAG;AAChC,UAAI,wBAAwB,IAAI,QAAQ,GAAG;AACzC,iBAAS,KAAK,QAAQ;AAAA,MACxB,OAAO;AACL,cAAM,KAAK,QAAQ;AAAA,MACrB;AAAA,IACF;AAAA,EACF;AAGA,aAAW,YAAY,UAAU;AAC/B,QAAI,CAAC,wBAAwB,IAAI,QAAQ,KAAK,CAAC,gBAAgB,IAAI,QAAQ,GAAG;AAC5E,YAAM,KAAK,QAAQ;AAAA,IACrB;AAAA,EACF;AAGA,aAAW,kBAAkB,yBAAyB;AACpD,QAAI,CAAC,eAAe,IAAI,cAAc,GAAG;AACvC,cAAQ,KAAK,cAAc;AAAA,IAC7B;AAAA,EACF;AAEA,SAAO,EAAE,OAAO,UAAU,QAAQ;AACpC;AAKA,SAAS,uBACP,eACA,SACa;AACb,QAAM,aAAa,oBAAI,IAAY;AACnC,aAAW,YAAY,OAAO,KAAK,aAAa,GAAG;AACjD,eAAW,IAAI,wBAAwB,UAAU,OAAO,CAAC;AAAA,EAC3D;AACA,SAAO;AACT;AAKA,eAAe,sBACb,SACA,eACA,eACA,QACgC;AAChC,QAAM,uBAAuB,MAAM;AAAA,IACjC;AAAA,IACA,cAAc,SAAU;AAAA,IACxB;AAAA,EACF;AACA,QAAM,oBAAoB,qBAAqB,IAAI,QAAM,wBAAwB,IAAI,OAAO,CAAC;AAE7F,QAAM,WAAW,MAAM,YAAY,SAAS,MAAM;AAClD,QAAM,iBAAiB,IAAI,IAAI,QAAQ;AACvC,QAAM,0BAA0B,uBAAuB,cAAc,OAAO,OAAO;AAEnF,QAAM,EAAE,OAAO,UAAU,QAAQ,IAAI;AAAA,IACnC;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AAEA,SAAO,EAAE,OAAO,UAAU,SAAS,QAAQ,oBAAoB;AACjE;AAKA,eAAe,sBACb,SACA,eACA,QACgC;AAChC,QAAM,WAAW,MAAM,YAAY,SAAS,MAAM;AAClD,QAAM,iBAAiB,IAAI,IAAI,QAAQ;AAEvC,QAAM,UAAoB,CAAC;AAC3B,aAAW,YAAY,OAAO,KAAK,cAAc,KAAK,GAAG;AACvD,UAAM,iBAAiB,wBAAwB,UAAU,OAAO;AAChE,QAAI,CAAC,eAAe,IAAI,cAAc,GAAG;AACvC,cAAQ,KAAK,cAAc;AAAA,IAC7B;AAAA,EACF;AAEA,SAAO,EAAE,OAAO,UAAU,UAAU,CAAC,GAAG,SAAS,QAAQ,oBAAoB;AAC/E;AAMA,eAAsB,cACpB,SACA,UACA,QACgC;AAChC,QAAM,WAAW,IAAI,gBAAgB,SAAS,MAAM;AACpD,QAAM,gBAAgB,MAAM,SAAS,KAAK;AAG1C,MAAI,CAAC,eAAe;AAClB,UAAM,WAAW,MAAM,YAAY,SAAS,MAAM;AAClD,WAAO,EAAE,OAAO,UAAU,UAAU,CAAC,GAAG,SAAS,CAAC,GAAG,QAAQ,OAAO;AAAA,EACtE;AAGA,QAAM,WAAW,MAAM,mBAAmB,SAAS,SAAS,QAAQ,cAAc,QAAQ;AAE1F,MAAI,SAAS,WAAW,SAAS,cAAc;AAC7C,QAAI;AACF,aAAO,MAAM,sBAAsB,SAAS,eAAe,SAAS,aAAa,QAAQ,MAAM;AAAA,IACjG,SAAS,OAAO;AACd,cAAQ,KAAK,yDAAyD,KAAK,EAAE;AAC7E,aAAO,MAAM,sBAAsB,SAAS,eAAe,MAAM;AAAA,IACnE;AAAA,EACF;AAGA,SAAO,MAAM,oBAAoB,SAAS,eAAe,MAAM;AACjE;AAMA,eAAe,YACb,SACA,QACmB;AACnB,MAAI;AAEJ,MAAI,eAAe,MAAM,KAAK,OAAO,WAAW,SAAS,GAAG;AAC1D,YAAQ,MAAM,2BAA2B,SAAS,MAAM;AAAA,EAC1D,WAAW,eAAe,MAAM,GAAG;AACjC,YAAQ,MAAM,aAAa;AAAA,MACzB;AAAA,MACA,iBAAiB,OAAO,SAAS;AAAA,MACjC,iBAAiB,OAAO,SAAS;AAAA,IACnC,CAAC;AAAA,EACH,OAAO;AACL,YAAQ,MAAM,aAAa;AAAA,MACzB;AAAA,MACA,iBAAiB,CAAC;AAAA,MAClB,iBAAiB,CAAC;AAAA,IACpB,CAAC;AAAA,EACH;AAGA,SAAO,MAAM,IAAI,QAAM,wBAAwB,IAAI,OAAO,CAAC;AAC7D;AAKA,eAAe,oBACb,SACA,eACA,QACgC;AAChC,QAAM,QAAkB,CAAC;AACzB,QAAM,WAAqB,CAAC;AAC5B,QAAM,UAAoB,CAAC;AAG3B,QAAM,eAAe,MAAM,YAAY,SAAS,MAAM;AACtD,QAAM,iBAAiB,IAAI,IAAI,YAAY;AAI3C,QAAM,0BAA0B,oBAAI,IAAgD;AACpF,aAAW,CAAC,UAAU,KAAK,KAAK,OAAO,QAAQ,cAAc,KAAK,GAAG;AACnE,UAAM,iBAAiB,wBAAwB,UAAU,OAAO;AAChE,4BAAwB,IAAI,gBAAgB,KAAK;AAAA,EACnD;AAIA,QAAM,YAAY,oBAAI,IAAoB;AAE1C,aAAW,YAAY,cAAc;AACnC,QAAI;AAEF,YAAM,eAAeA,OAAK,WAAW,QAAQ,IAAI,WAAWA,OAAK,KAAK,SAAS,QAAQ;AACvF,YAAM,QAAQ,MAAMD,KAAG,KAAK,YAAY;AACxC,gBAAU,IAAI,UAAU,MAAM,OAAO;AAAA,IACvC,QAAQ;AAEN;AAAA,IACF;AAAA,EACF;AAGA,aAAW,CAAC,UAAU,KAAK,KAAK,WAAW;AACzC,UAAM,QAAQ,wBAAwB,IAAI,QAAQ;AAElD,QAAI,CAAC,OAAO;AAEV,YAAM,KAAK,QAAQ;AAAA,IACrB,WAAW,MAAM,eAAe,OAAO;AAErC,eAAS,KAAK,QAAQ;AAAA,IACxB;AAAA,EACF;AAGA,aAAW,kBAAkB,wBAAwB,KAAK,GAAG;AAC3D,QAAI,CAAC,eAAe,IAAI,cAAc,GAAG;AACvC,cAAQ,KAAK,cAAc;AAAA,IAC7B;AAAA,EACF;AAEA,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA,QAAQ;AAAA,EACV;AACF;AA5RA;AAAA;AAAA;AAGA;AACA;AACA;AACA;AACA;AACA;AAAA;AAAA;;;ACgEO,SAAS,qBAA6B;AAC3C,QAAM,UAAU,kBAAkB,uBAAuB,kBAAkB,MAAM;AACjF;AACA,SAAO;AACT;AAMO,SAAS,sBAA8B;AAC5C,QAAM,UAAU,mBAAmB,wBAAwB,mBAAmB,MAAM;AACpF;AACA,SAAO;AACT;AAMO,SAAS,yBAAiC;AAC/C,QAAM,UAAU,uBAAuB,oBAAoB,uBAAuB,MAAM;AACxF;AACA,SAAO;AACT;AAhGA,IAKM,mBA4BA,oBAkBA,wBAaF,sBACA,uBACA;AAlEJ;AAAA;AAAA;AAKA,IAAM,oBAAoB;AAAA,MACxB;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAEA,IAAM,qBAAqB;AAAA,MACzB;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAEA,IAAM,yBAAyB;AAAA,MAC7B;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAEA,IAAI,uBAAuB;AAC3B,IAAI,wBAAwB;AAC5B,IAAI,oBAAoB;AAAA;AAAA;;;AClExB,IAuBa;AAvBb;AAAA;AAAA;AACA;AAsBO,IAAM,0BAAN,MAAM,yBAAwB;AAAA,MAC3B,iBAAiB;AAAA,MACjB;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA;AAAA,MAGR,OAAwB,6BAA6B;AAAA;AAAA,MACrD,OAAwB,+BAA+B;AAAA;AAAA,MAEvD,YAAY,YAAoB,SAAc;AAC5C,aAAK,aAAa;AAClB,aAAK,UAAU;AACf,aAAK,eAAe,mBAAmB;AAAA,MACzC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,QAAc;AAEZ,YAAI,KAAK,gBAAgB;AACvB;AAAA,QACF;AAEA,cAAM,yBAAyB,KAAK;AAAA,UAClC,yBAAwB,+BACxB,yBAAwB;AAAA,QAC1B;AAEA,YAAI,cAAc;AAClB,aAAK,iBAAiB,YAAY,MAAM;AAEtC;AACA,cAAI,eAAe,wBAAwB;AACzC,iBAAK,eAAe,mBAAmB;AACvC,0BAAc;AAAA,UAChB;AAGA,eAAK,QAAQ,OAAO,GAAG,KAAK,cAAc,IAAI,KAAK,UAAU,YAAY,KAAK,YAAY;AAAA,QAC5F,GAAG,yBAAwB,0BAA0B;AAAA,MACvD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,iBAAuB;AACrB,aAAK;AAAA,MACP;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,WAAW,SAAuB;AAChC,aAAK,eAAe;AAAA,MACtB;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,OAAa;AACX,YAAI,KAAK,gBAAgB;AACvB,wBAAc,KAAK,cAAc;AACjC,eAAK,iBAAiB;AAAA,QACxB;AAAA,MACF;AAAA;AAAA;AAAA;AAAA,MAKA,oBAA4B;AAC1B,eAAO,KAAK;AAAA,MACd;AAAA;AAAA;AAAA;AAAA,MAKA,gBAAwB;AACtB,eAAO,KAAK;AAAA,MACd;AAAA;AAAA;AAAA;AAAA,MAKA,oBAA4B;AAC1B,eAAO,KAAK;AAAA,MACd;AAAA,IACF;AAAA;AAAA;;;ACxHA;AAAA;AAAA;AAAA;AAAA,OAAOE,UAAQ;AACf,OAAO,SAAuB;AAC9B,OAAOC,YAAW;AAClB,OAAO,YAAY;AAuCnB,SAAS,kBAAkB,QAAuD;AAChF,MAAI,eAAe,MAAM,GAAG;AAC1B,WAAO;AAAA,MACL,aAAa,OAAO,KAAK;AAAA,MACzB,oBAAoB,OAAO,KAAK;AAAA,MAChC,WAAW,OAAO,KAAK;AAAA,MACvB,cAAc,OAAO,KAAK;AAAA,MAC1B,QAAQ,OAAO,SAAS;AAAA,MACxB,aAAa,OAAO,SAAS;AAAA,IAC/B;AAAA,EACF;AAEA,SAAO;AAAA,IACL,aAAa;AAAA,IACb,oBAAoB;AAAA,IACpB,WAAW;AAAA,IACX,cAAc;AAAA,IACd,QAAQ;AAAA,IACR,aAAa;AAAA,EACf;AACF;AAGA,eAAe,iBACb,SACA,QACmB;AACnB,MAAI,eAAe,MAAM,KAAK,OAAO,WAAW,SAAS,GAAG;AAC1D,WAAO,2BAA2B,SAAS,MAAM;AAAA,EACnD;AACA,MAAI,eAAe,MAAM,GAAG;AAC1B,WAAO,aAAa;AAAA,MAClB;AAAA,MACA,iBAAiB,OAAO,SAAS;AAAA,MACjC,iBAAiB,OAAO,SAAS;AAAA,IACnC,CAAC;AAAA,EACH;AACA,SAAO,aAAa,EAAE,SAAS,iBAAiB,CAAC,GAAG,iBAAiB,CAAC,EAAE,CAAC;AAC3E;AAGA,eAAe,6BACb,OACA,YACyB;AACzB,QAAM,UAA0B,CAAC;AACjC,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK,4BAA4B;AACjE,UAAM,aAAa,MAAM,MAAM,GAAG,KAAK,IAAI,IAAI,4BAA4B,MAAM,MAAM,CAAC;AACxF,UAAM,eAAe,MAAM,WAAW,WAAW,UAAU;AAC3D,YAAQ,KAAK,GAAG,YAAY;AAC5B,UAAM,IAAI,QAAQ,aAAW,aAAa,OAAO,CAAC;AAAA,EACpD;AACA,SAAO;AACT;AAUA,eAAe,eACb,SACA,UACA,UACe;AACf,QAAM,EAAE,gBAAAC,iBAAgB,WAAAC,WAAU,IAAI,MAAM;AAC5C,QAAM,EAAE,iBAAAC,iBAAgB,IAAI,MAAM;AAElC,QAAM,eAAe,MAAMF,gBAAe;AAC1C,QAAM,SAAS,MAAMC,WAAU,OAAO;AAEtC,MAAI,CAAC,gBAAgB,CAAC,QAAQ;AAC5B;AAAA,EACF;AAEA,QAAM,aAAa,IAAIC,iBAAgB,SAAS,SAAS,MAAM;AAC/D,QAAM,WAAW,WAAW;AAC5B,QAAM,WAAW,WAAW,SAAS;AAErC,MAAI,UAAU;AACZ,UAAM,SAAS,eAAe,QAAQ;AAAA,EACxC;AACF;AAKA,eAAe,gBACb,cACA,UACA,UACA,SACe;AACf,MAAI,aAAa,WAAW,GAAG;AAC7B;AAAA,EACF;AAEA,UAAQ,MAAM,YAAY,aAAa,MAAM,mBAAmB;AAChE,MAAI,eAAe;AAEnB,aAAW,YAAY,cAAc;AACnC,QAAI;AACF,YAAM,SAAS,aAAa,QAAQ;AACpC,YAAM,SAAS,WAAW,QAAQ;AAClC;AAAA,IACF,SAAS,KAAK;AACZ,cAAQ;AAAA,QACN,0BAA0B,QAAQ,MAAM,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,CAAC;AAAA,MAC1F;AAAA,IACF;AAAA,EACF;AAEA,UAAQ,QAAQ,WAAW,YAAY,IAAI,aAAa,MAAM,gBAAgB;AAChF;AAKA,eAAe,cACb,YACA,eACA,UACA,YACA,QACA,SACA,SACe;AACf,QAAM,eAAe,CAAC,GAAG,YAAY,GAAG,aAAa;AAErD,MAAI,aAAa,WAAW,GAAG;AAC7B;AAAA,EACF;AAEA,UAAQ,MAAM,cAAc,aAAa,MAAM,mBAAmB;AAClE,QAAM,QAAQ,MAAM;AAAA,IAClB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,EAAE,SAAS,QAAQ,QAAQ;AAAA,EAC7B;AAEA,QAAM,iBAAiB,SAAS,MAAM;AACtC,UAAQ;AAAA,IACN,iCAAiC,KAAK,IAAI,aAAa,MAAM;AAAA,EAC/D;AACF;AAMA,eAAe,oBACb,SACA,UACA,QACA,SACA,SACkB;AAClB,UAAQ,OAAO;AACf,QAAM,WAAW,IAAI,gBAAgB,SAAS,MAAM;AACpD,QAAM,gBAAgB,MAAM,SAAS,KAAK;AAE1C,MAAI,CAAC,eAAe;AAClB,WAAO;AAAA,EACT;AAEA,QAAM,UAAU,MAAM,cAAc,SAAS,UAAU,MAAM;AAE7D,MAAI,QAAQ,WAAW,QAAQ;AAC7B,YAAQ,OAAO;AACf,WAAO;AAAA,EACT;AAEA,QAAM,eAAe,QAAQ,MAAM,SAAS,QAAQ,SAAS;AAC7D,QAAM,eAAe,QAAQ,QAAQ;AAErC,MAAI,iBAAiB,KAAK,iBAAiB,GAAG;AAC5C,YAAQ,QAAQ,4CAA4C;AAC5D,WAAO;AAAA,EACT;AAEA,UAAQ;AAAA,IACN,qBAAqB,YAAY,oBAAoB,YAAY,eAAe,QAAQ,MAAM;AAAA,EAChG;AAGA,UAAQ,MAAM,uBAAuB,CAAC;AACtC,QAAM,aAAa,IAAI,gBAAgB;AACvC,QAAM,WAAW,WAAW;AAC5B,UAAQ,QAAQ,wBAAwB;AAGxC,QAAM,gBAAgB,QAAQ,SAAS,UAAU,UAAU,OAAO;AAClE,QAAM,cAAc,QAAQ,OAAO,QAAQ,UAAU,UAAU,YAAY,QAAQ,SAAS,OAAO;AAGnG,QAAM,eAAe,SAAS,UAAU,QAAQ;AAEhD,UAAQ,IAAIH,OAAM,IAAI,kBAAkB,GAAGA,OAAM,KAAK,YAAY,GAAGA,OAAM,IAAI,yBAAyB,CAAC;AACzG,SAAO;AACT;AAKA,eAAe,iBACb,SACA,UACA,QACA,SACA,SACe;AAEf,UAAQ,OAAO;AACf,QAAM,SAAS,MAAM;AAGrB,UAAQ,OAAO;AACf,QAAM,QAAQ,MAAM,iBAAiB,SAAS,MAAM;AAEpD,MAAI,MAAM,WAAW,GAAG;AACtB,YAAQ,KAAK,yBAAyB;AACtC;AAAA,EACF;AAEA,UAAQ,OAAO,SAAS,MAAM,MAAM;AAGpC,UAAQ,OAAO,uBAAuB;AACtC,QAAM,aAAa,IAAI,gBAAgB;AACvC,QAAM,WAAW,WAAW;AAC5B,UAAQ,QAAQ,wBAAwB;AAGxC,QAAM,cAAc,kBAAkB,MAAM;AAC5C,QAAM,oBAAoB;AAE1B,UAAQ,MAAM,yBAAyB,YAAY,WAAW,kBAAkB;AAEhF,QAAM,YAAY,KAAK,IAAI;AAC3B,MAAI,kBAAkB;AAGtB,QAAM,mBAAuC,CAAC;AAC9C,QAAM,QAAQ,OAAO,YAAY,WAAW;AAG5C,QAAM,qBAAqF,CAAC;AAG5F,QAAM,kBAAkB,IAAI,wBAAwB,MAAM,QAAQ,OAAO;AACzE,kBAAgB,MAAM;AAEtB,MAAI;AAMF,QAAI,gBAAsC;AAC1C,QAAI,kBAAwC;AAI5C,UAAM,2BAA2B,YAA2B;AAI1D,UAAI,iBAAiB;AACnB,0BAAkB,gBAAgB,KAAK,MAAM,gBAAgB,CAAC;AAAA,MAChE,OAAO;AACL,0BAAkB,gBAAgB;AAAA,MACpC;AACA,aAAO;AAAA,IACT;AAGA,UAAM,kBAAkB,YAA2B;AACjD,UAAI,iBAAiB,WAAW,EAAG;AAEnC,YAAM,iBAAiB;AAEvB,UAAI;AACF,cAAM,YAAY,iBAAiB,OAAO,GAAG,iBAAiB,MAAM;AAGpE,iBAAS,IAAI,GAAG,IAAI,UAAU,QAAQ,KAAK,YAAY,oBAAoB;AACzE,gBAAM,QAAQ,UAAU,MAAM,GAAG,KAAK,IAAI,IAAI,YAAY,oBAAoB,UAAU,MAAM,CAAC;AAC/F,gBAAM,QAAQ,MAAM,IAAI,UAAQ,KAAK,OAAO;AAE5C,0BAAgB,WAAW,oBAAoB,CAAC;AAChD,gBAAM,mBAAmB,MAAM,6BAA6B,OAAO,UAAU;AAC7E,6BAAmB,MAAM;AAEzB,0BAAgB,WAAW,aAAa,MAAM,MAAM,8BAA8B;AAClF,gBAAM,SAAS,YAAY,kBAAkB,MAAM,IAAI,UAAQ,KAAK,MAAM,QAAQ,GAAG,KAAK;AAC1F,gBAAM,IAAI,QAAQ,aAAW,aAAa,OAAO,CAAC;AAAA,QACpD;AAEA,wBAAgB,WAAW,mBAAmB,CAAC;AAAA,MACjD,UAAE;AACA,YAAI,oBAAoB,eAAgB,mBAAkB;AAAA,MAC5D;AAAA,IACF;AAGF,UAAM,eAAe,MAAM;AAAA,MAAI,CAAC,SAC9B,MAAM,YAAY;AAChB,YAAI;AAEF,gBAAM,QAAQ,MAAMD,KAAG,KAAK,IAAI;AAChC,gBAAM,UAAU,MAAMA,KAAG,SAAS,MAAM,OAAO;AAE/C,gBAAM,SAAS,UAAU,MAAM,SAAS;AAAA,YACtC,WAAW,YAAY;AAAA,YACvB,cAAc,YAAY;AAAA,YAC1B,QAAQ,YAAY;AAAA,YACpB,aAAa,YAAY;AAAA,UAC3B,CAAC;AAED,cAAI,OAAO,WAAW,GAAG;AACvB,4BAAgB,eAAe;AAC/B;AAAA,UACF;AAIA;AAEE,gBAAI,eAAe;AACjB,oBAAM;AAAA,YACR;AAGA,gBAAI;AACJ,4BAAgB,IAAI,QAAc,aAAW;AAC3C,+BAAiB;AAAA,YACnB,CAAC;AAED,gBAAI;AAEF,yBAAW,SAAS,QAAQ;AAC1B,iCAAiB,KAAK;AAAA,kBACpB;AAAA,kBACA,SAAS,MAAM;AAAA,gBACjB,CAAC;AAAA,cACH;AAGA,iCAAmB,KAAK;AAAA,gBACtB,UAAU;AAAA,gBACV,YAAY,OAAO;AAAA,gBACnB,OAAO,MAAM;AAAA,cACf,CAAC;AAED,8BAAgB,eAAe;AAI/B,kBAAI,iBAAiB,UAAU,mBAAmB;AAChD,sBAAM,yBAAyB;AAAA,cACjC;AAAA,YACF,UAAE;AAEA,6BAAe;AACf,8BAAgB;AAAA,YAClB;AAAA,UACF;AAAA,QACF,SAAS,OAAO;AACd,cAAI,QAAQ,SAAS;AACnB,oBAAQ,MAAMC,OAAM,OAAO;AAAA,yBAAkB,IAAI,KAAK,KAAK,EAAE,CAAC;AAAA,UAChE;AACA,0BAAgB,eAAe;AAAA,QACjC;AAAA,MACF,CAAC;AAAA,IACH;AAGE,UAAM,QAAQ,IAAI,YAAY;AAG9B,oBAAgB,WAAW,4BAA4B;AACvD,UAAM,yBAAyB;AAAA,EACjC,UAAE;AAEA,oBAAgB,KAAK;AAAA,EACvB;AAGA,UAAQ,MAAM,0BAA0B;AACxC,QAAM,WAAW,IAAI,gBAAgB,SAAS,MAAM;AACpD,QAAM,SAAS;AAAA,IACb,mBAAmB,IAAI,YAAU;AAAA,MAC/B,UAAU,MAAM;AAAA;AAAA,MAEhB,cAAc,MAAM;AAAA,MACpB,YAAY,MAAM;AAAA,IACpB,EAAE;AAAA,EACJ;AAGA,QAAM,eAAe,SAAS,UAAU,QAAQ;AAEhD,UAAQ,QAAQ,gBAAgB;AAGhC,QAAM,iBAAiB,SAAS,MAAM;AAEtC,QAAM,cAAc,KAAK,IAAI,IAAI,aAAa,KAAM,QAAQ,CAAC;AAC7D,UAAQ;AAAA,IACN,WAAW,gBAAgB,kBAAkB,CAAC,WAAW,eAAe,eAAe,SAAS,WAAW,YAAY,WAAW;AAAA,EACpI;AAEA,UAAQ,IAAIA,OAAM,IAAI,kBAAkB,GAAGA,OAAM,KAAK,YAAY,GAAGA,OAAM,IAAI,yBAAyB,CAAC;AAC3G;AAYA,eAAsB,cAAc,UAA2B,CAAC,GAAkB;AAChF,QAAM,UAAU,QAAQ,WAAW,QAAQ,IAAI;AAC/C,QAAM,UAAU,IAAI,8BAA8B,EAAE,MAAM;AAE1D,MAAI;AAEF,YAAQ,OAAO;AACf,UAAM,SAAS,MAAM,cAAc,KAAK,OAAO;AAG/C,YAAQ,OAAO;AACf,UAAM,WAAW,IAAI,SAAS,OAAO;AACrC,UAAM,SAAS,WAAW;AAG1B,QAAI,CAAC,QAAQ,OAAO;AAClB,YAAM,YAAY,MAAM,oBAAoB,SAAS,UAAU,QAAQ,SAAS,OAAO;AACvF,UAAI,WAAW;AACb;AAAA,MACF;AAAA,IACF,OAAO;AACL,cAAQ,OAAO;AAAA,IACjB;AAGA,UAAM,iBAAiB,SAAS,UAAU,QAAQ,SAAS,OAAO;AAAA,EAEpE,SAAS,OAAO;AACd,YAAQ,KAAK,oBAAoB,KAAK,EAAE;AACxC,UAAM;AAAA,EACR;AACF;AAvfA;AAAA;AAAA;AAIA;AACA,IAAAI;AACA;AACA;AACA;AAEA,IAAAC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AAAA;AAAA;;;ACjBA,SAAS,eAAe;AACxB,SAAS,iBAAAC,sBAAqB;AAC9B,SAAS,iBAAAC,sBAAqB;AAC9B,SAAS,WAAAC,UAAS,QAAAC,aAAY;;;ACE9B;AALA,OAAOC,SAAQ;AACf,OAAOC,WAAU;AACjB,SAAS,iBAAAC,sBAAqB;AAC9B,OAAOC,YAAW;AAClB,OAAO,cAAc;;;ACJrB,OAAO,YAAY;AACnB,OAAO,WAAW;AAClB,SAAS,iBAAAC,sBAAqB;AAC9B,SAAS,iBAAAC,sBAAqB;AAC9B,SAAS,WAAAC,UAAS,QAAAC,aAAY;AAK9B,IAAMC,cAAaH,eAAc,YAAY,GAAG;AAChD,IAAMI,aAAYH,SAAQE,WAAU;AACpC,IAAME,WAAUN,eAAc,YAAY,GAAG;AAG7C,IAAIO;AACJ,IAAI;AACF,EAAAA,eAAcD,SAAQH,MAAKE,YAAW,iBAAiB,CAAC;AAC1D,QAAQ;AACN,EAAAE,eAAcD,SAAQH,MAAKE,YAAW,oBAAoB,CAAC;AAC7D;AAGA,IAAM,eAAeE,aAAY;AACjC,IAAM,UAAUA,aAAY;AAK5B,SAAS,UAAU,MAAc,QAAgB,UAAU,GAAW;AACpE,QAAM,QAAQ,KAAK,MAAM,IAAI,EAAE,OAAO,UAAQ,KAAK,KAAK,EAAE,SAAS,CAAC;AAGpE,QAAM,YAAY,KAAK,IAAI,GAAG,MAAM,IAAI,UAAQ,KAAK,MAAM,CAAC;AAE5D,QAAM,mBAAmB,SAAI,OAAO,YAAY,UAAU,CAAC;AAC3D,QAAM,MAAM,SAAI,gBAAgB;AAChC,QAAM,SAAS,SAAI,gBAAgB;AACnC,QAAM,YAAY,SAAI,gBAAgB;AAEtC,QAAM,cAAc,MAAM,IAAI,UAAQ;AACpC,UAAM,WAAW,IAAI,OAAO,YAAY,KAAK,SAAS,OAAO;AAC7D,UAAM,UAAU,IAAI,OAAO,OAAO;AAClC,WAAO,SAAI,OAAO,GAAG,IAAI,GAAG,QAAQ;AAAA,EACtC,CAAC;AAGD,QAAM,WAAW,YAAY,OAAO;AACpC,QAAM,UAAU,KAAK,MAAM,WAAW,CAAC;AACvC,QAAM,WAAW,WAAW;AAC5B,QAAM,iBAAiB,IAAI,OAAO,OAAO,IAAI,SAAS,IAAI,OAAO,QAAQ;AAEzE,QAAM,eAAe,SAAI,IAAI,OAAO,OAAO,CAAC,GAAG,cAAc,GAAG,IAAI,OAAO,OAAO,CAAC;AAEnF,SAAO,CAAC,KAAK,GAAG,aAAa,WAAW,cAAc,MAAM,EAAE,KAAK,IAAI;AACzE;AAKO,SAAS,aAAmB;AACjC,QAAM,SAAS,OAAO,SAAS,QAAQ;AAAA,IACrC,MAAM;AAAA,IACN,kBAAkB;AAAA,IAClB,gBAAgB;AAAA,EAClB,CAAC;AAED,QAAM,SAAS,GAAG,YAAY,OAAO,OAAO;AAC5C,QAAM,cAAc,UAAU,OAAO,KAAK,GAAG,MAAM;AACnD,UAAQ,MAAM,MAAM,KAAK,WAAW,CAAC;AACrC,UAAQ,MAAM;AAChB;AAKO,SAAS,oBAA0B;AACxC,QAAM,SAAS,OAAO,SAAS,QAAQ;AAAA,IACrC,MAAM;AAAA,IACN,kBAAkB;AAAA,IAClB,gBAAgB;AAAA,EAClB,CAAC;AAED,QAAM,SAAS,GAAG,YAAY,OAAO,OAAO;AAC5C,QAAM,cAAc,UAAU,OAAO,KAAK,GAAG,MAAM;AACnD,UAAQ,IAAI,MAAM,KAAK,WAAW,CAAC;AACnC,UAAQ,IAAI;AACd;;;ACnFA;AACA;AACA;AACA;AANA,OAAOC,SAAQ;AACf,OAAOC,WAAU;AACjB,OAAOC,YAAW;AAuBX,IAAM,mBAAN,MAAuB;AAAA,EAC5B,YAA6B,UAAkB,QAAQ,IAAI,GAAG;AAAjC;AAAA,EAAkC;AAAA;AAAA;AAAA;AAAA,EAKvD,gBAAwB;AAC9B,WAAOD,MAAK,KAAK,KAAK,SAAS,mBAAmB;AAAA,EACpD;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,iBAAmC;AACvC,QAAI;AACF,YAAM,aAAa,KAAK,cAAc;AACtC,YAAM,UAAU,MAAMD,IAAG,SAAS,YAAY,OAAO;AACrD,YAAM,SAAS,KAAK,MAAM,OAAO;AACjC,aAAO,eAAe,MAAM;AAAA,IAC9B,SAAS,OAAO;AAEd,aAAO;AAAA,IACT;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,cAAmC;AACvC,UAAM,SAAS,MAAM,kBAAkB,KAAK,OAAO;AAEnD,QAAI,OAAO,YAAY,OAAO,YAAY;AACxC,YAAM,iBAAiBC,MAAK,SAAS,OAAO,UAAU;AACtD,cAAQ,IAAI,8CAAyC,cAAc,EAAE;AACrE,cAAQ,IAAI,+DAAwD;AAAA,IACtE;AAEA,WAAO,OAAO;AAAA,EAChB;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,qBAAoC;AACxC,UAAM,aAAa,KAAK,cAAc;AAEtC,QAAI;AAEF,YAAM,kBAAkB,MAAMD,IAAG,SAAS,YAAY,OAAO;AAC7D,YAAM,iBAAiB,KAAK,MAAM,eAAe;AAGjD,YAAM,kBAAkB,eAAe,cAAc;AACrD,YAAM,YAAY,kBAAkB,CAAC,IAAI,gBAAgB,gBAAgB,aAAa;AACtF,YAAM,aAAa,mBAAmB,UAAU,SAAS;AAEzD,UAAI,CAAC,YAAY;AACf,gBAAQ,IAAIE,OAAM,MAAM,qCAAgC,CAAC;AACzD,gBAAQ,IAAIA,OAAM,IAAI,mBAAmB,CAAC;AAC1C;AAAA,MACF;AAGA,YAAM,aAAa,GAAG,UAAU;AAChC,YAAMF,IAAG,SAAS,YAAY,UAAU;AAGxC,UAAI;AACJ,UAAI,WAAW;AAEf,UAAI,iBAAiB;AACnB,gBAAQ,IAAIE,OAAM,KAAK,8CAAuC,sBAAsB,KAAK,CAAC;AAC1F,yBAAiB,cAAc,cAAc;AAC7C,mBAAW;AAAA,MACb,OAAO;AAEL,yBAAiB,gBAAgB,eAAe,cAAqC;AAErF,gBAAQ,IAAIA,OAAM,IAAI,sBAAsB,CAAC;AAC7C,kBAAU,QAAQ,WAAS,QAAQ,IAAIA,OAAM,IAAI,UAAK,GAAGA,OAAM,KAAK,KAAK,CAAC,CAAC;AAAA,MAC7E;AAGA,YAAMF,IAAG;AAAA,QACP;AAAA,QACA,KAAK,UAAU,gBAAgB,MAAM,CAAC,IAAI;AAAA,QAC1C;AAAA,MACF;AAGA,cAAQ,IAAIE,OAAM,MAAM,qCAAgC,CAAC;AACzD,cAAQ,IAAIA,OAAM,IAAI,kBAAkB,GAAG,UAAU;AAErD,UAAI,UAAU;AACZ,gBAAQ,IAAIA,OAAM,IAAI,iEAA0D,CAAC;AAAA,MACnF;AAAA,IACF,SAAS,OAAO;AACd,UAAK,MAAgC,SAAS,UAAU;AACtD,gBAAQ,IAAIA,OAAM,IAAI,6BAA6B,CAAC;AACpD,gBAAQ,IAAIA,OAAM,IAAI,KAAK,GAAGA,OAAM,KAAK,WAAW,GAAGA,OAAM,IAAI,yBAAyB,CAAC;AAC3F;AAAA,MACF;AACA,YAAM;AAAA,IACR;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,UAAoC;AACxC,WAAO,kBAAkB,KAAK,OAAO;AAAA,EACvC;AACF;;;AC5IA,OAAOC,SAAQ;AACf,OAAOC,WAAU;;;ACuDV,IAAM,0BAA4C;AAAA,EACvD,UAAU;AAAA,EACV,UAAU;AAAA,IACR;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;;;ACxEA,OAAOC,SAAQ;AACf,OAAOC,WAAU;;;ACIjB,eAAsB,qBACpB,UACA,eAC0B;AAC1B,SAAO;AAAA,IACL,SAAS;AAAA;AAAA;AAAA,MAGP;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAAA,IACA,SAAS;AAAA;AAAA,MAEP;AAAA,MACA;AAAA;AAAA,MAGA;AAAA,MACA;AAAA;AAAA,MAGA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA;AAAA,MAGA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA;AAAA,MAGA;AAAA,MACA;AAAA,MACA;AAAA;AAAA,MAGA;AAAA;AAAA,MAGA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA;AAAA,MAGA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAAA,EACF;AACF;;;AD3DO,IAAM,iBAAoC;AAAA,EAC/C,MAAM;AAAA,EACN,UAAU;AAAA;AAAA,EAEV,MAAM,OAAO,SAAiB,cAAgD;AAC5E,UAAM,WAAWC,MAAK,KAAK,SAAS,YAAY;AAChD,UAAM,SAA0B;AAAA,MAC9B,UAAU;AAAA,MACV,MAAM;AAAA,MACN,MAAM;AAAA,MACN,YAAY;AAAA,MACZ,UAAU,CAAC;AAAA,IACb;AAGA,UAAM,kBAAkBA,MAAK,KAAK,UAAU,cAAc;AAC1D,QAAIC,eAAmB;AAEvB,QAAI;AACF,YAAM,UAAU,MAAMC,IAAG,SAAS,iBAAiB,OAAO;AAC1D,MAAAD,eAAc,KAAK,MAAM,OAAO;AAChC,aAAO,SAAS,KAAK,oBAAoB;AAAA,IAC3C,QAAQ;AAEN,aAAO;AAAA,IACT;AAGA,WAAO,WAAW;AAClB,WAAO,aAAa;AAGpB,QAAIA,aAAY,iBAAiB,cAAcA,aAAY,cAAc,YAAY;AACnF,aAAO,SAAS,KAAK,qBAAqB;AAAA,IAC5C;AAGA,UAAM,iBAAiB;AAAA,MACrB,EAAE,MAAM,QAAQ,SAAS,OAAO;AAAA,MAChC,EAAE,MAAM,UAAU,SAAS,SAAS;AAAA,MACpC,EAAE,MAAM,SAAS,SAAS,QAAQ;AAAA,MAClC,EAAE,MAAM,OAAO,SAAS,MAAM;AAAA,MAC9B,EAAE,MAAM,oBAAoB,SAAS,aAAa;AAAA,IACpD;AAEA,eAAW,aAAa,gBAAgB;AACtC,UACEA,aAAY,kBAAkB,UAAU,IAAI,KAC5CA,aAAY,eAAe,UAAU,IAAI,GACzC;AACA,eAAO,SAAS,KAAK,GAAG,UAAU,OAAO,0BAA0B;AACnE;AAAA,MACF;AAAA,IACF;AAGA,UAAM,aAAa;AAAA,MACjB,EAAE,MAAM,QAAQ,SAAS,UAAU;AAAA,MACnC,EAAE,MAAM,SAAS,SAAS,QAAQ;AAAA,MAClC,EAAE,MAAM,OAAO,SAAS,MAAM;AAAA,MAC9B,EAAE,MAAM,WAAW,SAAS,UAAU;AAAA,MACtC,EAAE,MAAM,gBAAgB,SAAS,SAAS;AAAA,IAC5C;AAEA,eAAW,MAAM,YAAY;AAC3B,UAAIA,aAAY,eAAe,GAAG,IAAI,GAAG;AACvC,eAAO,SAAS,KAAK,GAAG,GAAG,OAAO,WAAW;AAC7C;AAAA,MACF;AAAA,IACF;AAGA,QAAIA,aAAY,SAAS,MAAM;AAC7B,aAAO,UAAUA,aAAY,QAAQ;AAAA,IACvC;AAEA,WAAO;AAAA,EACT;AAAA,EAEA,MAAM,eAAe,SAAiB,cAAsB;AAC1D,WAAO,qBAAqB,SAAS,YAAY;AAAA,EACnD;AACF;;;AE1FA,OAAOE,SAAQ;AACf,OAAOC,WAAU;;;ACIjB,eAAsB,kBACpB,UACA,eAC0B;AAC1B,SAAO;AAAA,IACL,SAAS;AAAA;AAAA,MAEP;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA;AAAA,MAGA;AAAA,MACA;AAAA;AAAA,MAGA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAAA,IACA,SAAS;AAAA;AAAA,MAEP;AAAA,MACA;AAAA;AAAA,MAGA;AAAA,MACA;AAAA;AAAA,MAGA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA;AAAA,MAGA;AAAA,MACA;AAAA,MACA;AAAA;AAAA,MAGA;AAAA,MACA;AAAA,MACA;AAAA;AAAA,MAGA;AAAA;AAAA,MAGA;AAAA,MACA;AAAA,IACF;AAAA,EACF;AACF;;;ADvDO,IAAM,cAAiC;AAAA,EAC5C,MAAM;AAAA,EACN,UAAU;AAAA;AAAA,EAEV,MAAM,OAAO,SAAiB,cAAgD;AAC5E,UAAM,WAAWC,MAAK,KAAK,SAAS,YAAY;AAChD,UAAM,SAA0B;AAAA,MAC9B,UAAU;AAAA,MACV,MAAM;AAAA,MACN,MAAM;AAAA,MACN,YAAY;AAAA,MACZ,UAAU,CAAC;AAAA,IACb;AAGA,UAAM,mBAAmBA,MAAK,KAAK,UAAU,eAAe;AAC5D,QAAI,eAAoB;AAExB,QAAI;AACF,YAAM,UAAU,MAAMC,IAAG,SAAS,kBAAkB,OAAO;AAC3D,qBAAe,KAAK,MAAM,OAAO;AACjC,aAAO,SAAS,KAAK,qBAAqB;AAAA,IAC5C,QAAQ;AAEN,aAAO;AAAA,IACT;AAGA,UAAM,aACJ,aAAa,UAAU,mBAAmB,KAC1C,aAAa,aAAa,IAAI,mBAAmB;AAEnD,QAAI,YAAY;AAGd,aAAO;AAAA,IACT;AAGA,WAAO,WAAW;AAClB,WAAO,aAAa;AAGpB,UAAM,UAAU,CAAC,OAAO,OAAO,OAAO,OAAO;AAC7C,QAAI,YAAY;AAEhB,eAAW,OAAO,SAAS;AACzB,UAAI;AACF,cAAM,UAAUD,MAAK,KAAK,UAAU,GAAG;AACvC,cAAM,QAAQ,MAAMC,IAAG,KAAK,OAAO;AACnC,YAAI,MAAM,YAAY,GAAG;AACvB;AAAA,QACF;AAAA,MACF,QAAQ;AAAA,MAER;AAAA,IACF;AAEA,QAAI,YAAY,GAAG;AACjB,aAAO,SAAS,KAAK,gCAAgC,SAAS,eAAe;AAAA,IAC/E;AAGA,QAAI,aAAa,SAAS,KAAK;AAC7B,aAAO,UAAU,aAAa,QAAQ;AACtC,aAAO,SAAS,KAAK,OAAO,aAAa,QAAQ,GAAG,EAAE;AAAA,IACxD;AAGA,UAAM,iBAAiB;AAAA,MACrB,EAAE,MAAM,mBAAmB,SAAS,UAAU;AAAA,MAC9C,EAAE,MAAM,gBAAgB,SAAS,OAAO;AAAA,MACxC,EAAE,MAAM,2BAA2B,SAAS,cAAc;AAAA,MAC1D,EAAE,MAAM,eAAe,SAAS,QAAQ;AAAA,IAC1C;AAEA,eAAW,aAAa,gBAAgB;AACtC,UACE,aAAa,UAAU,UAAU,IAAI,KACrC,aAAa,aAAa,IAAI,UAAU,IAAI,GAC5C;AACA,eAAO,SAAS,KAAK,GAAG,UAAU,OAAO,0BAA0B;AACnE;AAAA,MACF;AAAA,IACF;AAGA,UAAMC,SAAQ;AAAA,MACZ,EAAE,MAAM,4BAA4B,SAAS,UAAU;AAAA,MACvD,EAAE,MAAM,uBAAuB,SAAS,UAAU;AAAA,MAClD,EAAE,MAAM,mBAAmB,SAAS,uBAAuB;AAAA,MAC3D,EAAE,MAAM,gBAAgB,SAAS,eAAe;AAAA,MAChD,EAAE,MAAM,qBAAqB,SAAS,cAAc;AAAA,MACpD,EAAE,MAAM,mBAAmB,SAAS,UAAU;AAAA,IAChD;AAEA,eAAW,QAAQA,QAAO;AACxB,UAAI,aAAa,UAAU,KAAK,IAAI,GAAG;AACrC,eAAO,SAAS,KAAK,GAAG,KAAK,OAAO,WAAW;AAC/C;AAAA,MACF;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA,EAEA,MAAM,eAAe,SAAiB,cAAsB;AAC1D,WAAO,kBAAkB,SAAS,YAAY;AAAA,EAChD;AACF;;;AEtHA,OAAOC,SAAQ;AACf,OAAOC,WAAU;;;ACIjB,eAAsB,sBACpB,UACA,eAC0B;AAC1B,SAAO;AAAA,IACL,SAAS;AAAA;AAAA,MAEP;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA;AAAA,MAEA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA;AAAA,MAEA;AAAA;AAAA,MAEA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAAA,IACA,SAAS;AAAA;AAAA,MAEP;AAAA,MACA;AAAA;AAAA,MAGA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA;AAAA,MAGA;AAAA,MACA;AAAA,MACA;AAAA;AAAA,MACA;AAAA;AAAA;AAAA,MAGA;AAAA,MACA;AAAA;AAAA,MAGA;AAAA,MACA;AAAA,MACA;AAAA;AAAA,MAGA;AAAA;AAAA,MAGA;AAAA,MACA;AAAA,MACA;AAAA;AAAA,MAGA;AAAA,MACA;AAAA,IACF;AAAA,EACF;AACF;;;ADlEO,IAAM,kBAAqC;AAAA,EAChD,MAAM;AAAA,EACN,UAAU;AAAA;AAAA,EAEV,MAAM,OAAO,SAAiB,cAAgD;AAC5E,UAAM,WAAWC,MAAK,KAAK,SAAS,YAAY;AAChD,UAAM,SAA0B;AAAA,MAC9B,UAAU;AAAA,MACV,MAAM;AAAA,MACN,MAAM;AAAA,MACN,YAAY;AAAA,MACZ,UAAU,CAAC;AAAA,IACb;AAGA,UAAM,mBAAmBA,MAAK,KAAK,UAAU,eAAe;AAC5D,QAAI,eAAoB;AAExB,QAAI;AACF,YAAM,UAAU,MAAMC,IAAG,SAAS,kBAAkB,OAAO;AAC3D,qBAAe,KAAK,MAAM,OAAO;AACjC,aAAO,SAAS,KAAK,qBAAqB;AAAA,IAC5C,QAAQ;AAEN,aAAO;AAAA,IACT;AAGA,UAAM,aACJ,aAAa,UAAU,mBAAmB,KAC1C,aAAa,aAAa,IAAI,mBAAmB;AAEnD,QAAI,CAAC,YAAY;AAEf,aAAO;AAAA,IACT;AAEA,WAAO,SAAS,KAAK,6CAA6C;AAGlE,UAAM,cAAcD,MAAK,KAAK,UAAU,SAAS;AACjD,QAAI;AACF,YAAMC,IAAG,OAAO,WAAW;AAC3B,aAAO,SAAS,KAAK,oBAAoB;AACzC,aAAO,aAAa;AAAA,IACtB,QAAQ;AACN,aAAO,aAAa;AAAA,IACtB;AAGA,UAAM,cAAc,CAAC,OAAO,UAAU,UAAU,UAAU;AAC1D,QAAI,YAAY;AAEhB,eAAW,OAAO,aAAa;AAC7B,UAAI;AACF,cAAM,UAAUD,MAAK,KAAK,UAAU,GAAG;AACvC,cAAM,QAAQ,MAAMC,IAAG,KAAK,OAAO;AACnC,YAAI,MAAM,YAAY,GAAG;AACvB;AAAA,QACF;AAAA,MACF,QAAQ;AAAA,MAER;AAAA,IACF;AAEA,QAAI,aAAa,GAAG;AAClB,aAAO,SAAS,KAAK,yCAAyC,SAAS,IAAI,YAAY,MAAM,QAAQ;AACrG,aAAO,aAAa;AAAA,IACtB;AAGA,UAAM,kBAAkB;AAAA,MACtBD,MAAK,KAAK,UAAU,SAAS,SAAS;AAAA,MACtCA,MAAK,KAAK,UAAU,SAAS,MAAM;AAAA,IACrC;AAEA,eAAW,WAAW,iBAAiB;AACrC,UAAI;AACF,cAAM,QAAQ,MAAMC,IAAG,KAAK,OAAO;AACnC,YAAI,MAAM,YAAY,GAAG;AACvB,gBAAM,UAAUD,MAAK,SAASA,MAAK,QAAQ,OAAO,CAAC,IAAI,MAAMA,MAAK,SAAS,OAAO;AAClF,iBAAO,SAAS,KAAK,SAAS,OAAO,iBAAiB;AAAA,QACxD;AAAA,MACF,QAAQ;AAAA,MAER;AAAA,IACF;AAGA,QAAI,aAAa,UAAU,mBAAmB,GAAG;AAC/C,aAAO,UAAU,aAAa,QAAQ,mBAAmB;AAAA,IAC3D;AAEA,WAAO,WAAW;AAClB,WAAO;AAAA,EACT;AAAA,EAEA,MAAM,eAAe,SAAiB,cAAsB;AAC1D,WAAO,sBAAsB,SAAS,YAAY;AAAA,EACpD;AACF;;;AE5GA,OAAOE,SAAQ;AACf,OAAOC,WAAU;;;ACIjB,eAAsB,sBACpB,UACA,eAC0B;AAC1B,SAAO;AAAA,IACL,SAAS;AAAA;AAAA,MAEP;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA;AAAA,MACA;AAAA;AAAA;AAAA,MAGA;AAAA;AAAA,MAGA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA;AAAA,MAGA;AAAA;AAAA,MAGA;AAAA;AAAA,MAGA;AAAA,MACA;AAAA;AAAA,MAGA;AAAA,MACA;AAAA,IACF;AAAA,IACA,SAAS;AAAA,MACP;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA;AAAA,MAGA;AAAA,MACA;AAAA;AAAA,MAGA;AAAA;AAAA,MAGA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAAA,EACF;AACF;;;ADtDO,IAAM,kBAAqC;AAAA,EAChD,MAAM;AAAA,EACN,UAAU;AAAA;AAAA,EAEV,MAAM,OAAO,SAAiB,cAAgD;AAC5E,UAAM,WAAWC,MAAK,KAAK,SAAS,YAAY;AAChD,UAAM,SAA0B;AAAA,MAC9B,UAAU;AAAA,MACV,MAAM;AAAA,MACN,MAAM;AAAA,MACN,YAAY;AAAA,MACZ,UAAU,CAAC;AAAA,IACb;AAGA,UAAM,qBAAqBA,MAAK,KAAK,UAAU,UAAU,sBAAsB;AAC/E,QAAI,oBAAoB;AAExB,QAAI;AACF,YAAMC,IAAG,OAAO,kBAAkB;AAClC,0BAAoB;AACpB,aAAO,SAAS,KAAK,mCAAmC;AAAA,IAC1D,QAAQ;AAAA,IAER;AAGA,UAAM,kBAAkBD,MAAK,KAAK,UAAU,UAAU,cAAc;AACpE,QAAI,iBAAiB;AAErB,QAAI;AACF,YAAMC,IAAG,OAAO,eAAe;AAC/B,uBAAiB;AACjB,aAAO,SAAS,KAAK,2BAA2B;AAAA,IAClD,QAAQ;AAAA,IAER;AAGA,UAAM,cAAc,CAAC,YAAY,YAAY,aAAa,SAAS;AACnE,QAAI,YAAY;AAEhB,eAAW,OAAO,aAAa;AAC7B,UAAI;AACF,cAAM,UAAUD,MAAK,KAAK,UAAU,GAAG;AACvC,cAAM,QAAQ,MAAMC,IAAG,KAAK,OAAO;AACnC,YAAI,MAAM,YAAY,GAAG;AACvB;AAAA,QACF;AAAA,MACF,QAAQ;AAAA,MAER;AAAA,IACF;AAEA,QAAI,aAAa,GAAG;AAClB,aAAO,SAAS,KAAK,yCAAyC,SAAS,IAAI,YAAY,MAAM,QAAQ;AAAA,IACvG;AAGA,QAAI;AACF,YAAM,WAAWD,MAAK,KAAK,UAAU,oBAAoB;AACzD,YAAMC,IAAG,OAAO,QAAQ;AACxB,aAAO,SAAS,KAAK,0BAA0B;AAAA,IACjD,QAAQ;AAAA,IAER;AAGA,QAAI;AACF,YAAM,aAAaD,MAAK,KAAK,UAAU,gBAAgB;AACvD,YAAMC,IAAG,OAAO,UAAU;AAC1B,aAAO,SAAS,KAAK,sBAAsB;AAAA,IAC7C,QAAQ;AAAA,IAER;AAIA,QAAI,qBAAqB,aAAa,GAAG;AACvC,aAAO,WAAW;AAClB,aAAO,aAAa;AACpB,aAAO;AAAA,IACT;AAGA,QAAI,qBAAsB,kBAAkB,aAAa,GAAI;AAC3D,aAAO,WAAW;AAClB,aAAO,aAAa;AACpB,aAAO;AAAA,IACT;AAGA,QAAI,aAAa,GAAG;AAClB,aAAO,WAAW;AAClB,aAAO,aAAa;AACpB,aAAO;AAAA,IACT;AAGA,WAAO;AAAA,EACT;AAAA,EAEA,MAAM,eAAe,SAAiB,cAAsB;AAC1D,WAAO,sBAAsB,SAAS,YAAY;AAAA,EACpD;AACF;;;AElGO,IAAM,qBAA0C;AAAA,EACrD;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAmBO,SAAS,qBAAqB,MAA6C;AAChF,SAAO,mBAAmB,KAAK,OAAK,EAAE,SAAS,IAAI;AACrD;;;AV9BA,eAAsB,oBACpB,SACA,UAAqC,CAAC,GACV;AAC5B,QAAM,OAAO,EAAE,GAAG,yBAAyB,GAAG,QAAQ;AACtD,QAAM,UAA6B,CAAC;AACpC,QAAM,UAAU,oBAAI,IAAY;AAGhC,QAAM,aAAa,SAAS,KAAK,SAAS,OAAO;AAGjD,QAAM,mBAAmB,SAAS,KAAK,SAAS,SAAS,GAAG,IAAI;AAEhE,SAAO;AACT;AAKA,eAAe,aACb,SACA,cACA,SACA,SACe;AAEf,QAAM,WAAWC,MAAK,KAAK,SAAS,YAAY;AAChD,MAAI,QAAQ,IAAI,QAAQ,GAAG;AACzB;AAAA,EACF;AACA,UAAQ,IAAI,QAAQ;AAGpB,QAAM,iBAAgE,CAAC;AAEvE,aAAW,YAAY,oBAAoB;AACzC,QAAI;AACF,YAAM,SAAS,MAAM,SAAS,OAAO,SAAS,YAAY;AAC1D,UAAI,OAAO,UAAU;AACnB,uBAAe,KAAK;AAAA,UAClB,GAAG;AAAA,UACH,UAAU,SAAS,YAAY;AAAA,QACjC,CAAC;AAAA,MACH;AAAA,IACF,SAAS,OAAO;AAEd,cAAQ,MAAM,2BAA2B,SAAS,IAAI,QAAQ,YAAY,KAAK,KAAK;AAAA,IACtF;AAAA,EACF;AAIA,MAAI,eAAe,SAAS,GAAG;AAE7B,UAAM,iBAAiB,eAAe,OAAO,OAAK,EAAE,eAAe,MAAM;AACzE,UAAM,mBAAmB,eAAe,OAAO,OAAK,EAAE,eAAe,QAAQ;AAC7E,UAAM,gBAAgB,eAAe,OAAO,OAAK,EAAE,eAAe,KAAK;AAEvE,QAAI,eAAe,SAAS,GAAG;AAG7B,YAAM,eAAe,eAAe,IAAI,CAAC,EAAE,UAAU,GAAG,OAAO,MAAM,MAAM;AAC3E,cAAQ,KAAK,GAAG,YAAY;AAC5B,YAAM,QAAQ,eAAe,IAAI,OAAK,EAAE,IAAI,EAAE,KAAK,KAAK;AACxD,cAAQ,IAAI,qCAAgC,KAAK,EAAE;AAGnD,UAAI,iBAAiB,SAAS,KAAK,cAAc,SAAS,GAAG;AAC3D,cAAM,eAAe,CAAC,GAAG,kBAAkB,GAAG,aAAa,EAAE,IAAI,OAAK,EAAE,IAAI,EAAE,KAAK,IAAI;AACvF,gBAAQ,IAAI,kDAA6C,YAAY,EAAE;AAAA,MACzE;AAAA,IACF,WAAW,eAAe,WAAW,GAAG;AAEtC,YAAM,EAAE,UAAU,GAAG,OAAO,IAAI,eAAe,CAAC;AAChD,cAAQ,KAAK,MAAM;AAGnB,UAAI,iBAAiB,SAAS,KAAK,cAAc,SAAS,GAAG;AAC3D,cAAM,eAAe,CAAC,GAAG,kBAAkB,GAAG,aAAa,EAAE,IAAI,OAAK,EAAE,IAAI,EAAE,KAAK,IAAI;AACvF,gBAAQ,IAAI,kDAA6C,YAAY,EAAE;AAAA,MACzE;AAAA,IACF,WAAW,iBAAiB,SAAS,GAAG;AAEtC,uBAAiB,KAAK,CAAC,GAAG,MAAM,EAAE,WAAW,EAAE,QAAQ;AACvD,YAAM,EAAE,UAAU,GAAG,OAAO,IAAI,iBAAiB,CAAC;AAClD,cAAQ,KAAK,MAAM;AAGnB,YAAM,UAAU,CAAC,GAAG,iBAAiB,MAAM,CAAC,GAAG,GAAG,aAAa;AAC/D,UAAI,QAAQ,SAAS,GAAG;AACtB,cAAM,eAAe,QAAQ,IAAI,OAAK,EAAE,IAAI,EAAE,KAAK,IAAI;AACvD,gBAAQ,IAAI,qBAAgB,YAAY,OAAO,YAAY,KAAK,OAAO,IAAI,oBAAoB;AAAA,MACjG;AAAA,IACF,WAAW,cAAc,SAAS,GAAG;AAEnC,oBAAc,KAAK,CAAC,GAAG,MAAM,EAAE,WAAW,EAAE,QAAQ;AACpD,YAAM,EAAE,UAAU,GAAG,OAAO,IAAI,cAAc,CAAC;AACjD,cAAQ,KAAK,MAAM;AAGjB,YAAM,UAAU,cAAc,MAAM,CAAC;AACvC,UAAI,QAAQ,SAAS,GAAG;AACtB,cAAM,eAAe,QAAQ,IAAI,OAAK,EAAE,IAAI,EAAE,KAAK,IAAI;AACvD,gBAAQ,IAAI,qBAAgB,YAAY,OAAO,YAAY,KAAK,OAAO,IAAI,oBAAoB;AAAA,MAC/F;AAAA,IACF;AAAA,EACF,WAAW,eAAe,WAAW,GAAG;AACtC,UAAM,EAAE,UAAU,GAAG,OAAO,IAAI,eAAe,CAAC;AAChD,YAAQ,KAAK,MAAM;AAAA,EACrB;AACF;AAKA,eAAe,mBACb,SACA,cACA,SACA,SACA,OACA,SACe;AAEf,MAAI,SAAS,QAAQ,UAAU;AAC7B;AAAA,EACF;AAEA,QAAM,WAAWA,MAAK,KAAK,SAAS,YAAY;AAEhD,MAAI;AACF,UAAM,UAAU,MAAMC,IAAG,QAAQ,UAAU,EAAE,eAAe,KAAK,CAAC;AAGlE,UAAM,OAAO,QAAQ,OAAO,OAAK,EAAE,YAAY,CAAC;AAEhD,eAAW,OAAO,MAAM;AAEtB,UAAI,QAAQ,SAAS,SAAS,IAAI,IAAI,GAAG;AACvC;AAAA,MACF;AAGA,UAAI,IAAI,KAAK,WAAW,GAAG,GAAG;AAC5B;AAAA,MACF;AAEA,YAAM,UAAU,iBAAiB,MAC7B,IAAI,OACJD,MAAK,KAAK,cAAc,IAAI,IAAI;AAGpC,YAAM,aAAa,SAAS,SAAS,SAAS,OAAO;AAGrD,YAAM,mBAAmB,SAAS,SAAS,SAAS,SAAS,QAAQ,GAAG,OAAO;AAAA,IACjF;AAAA,EACF,SAAS,OAAO;AAEd;AAAA,EACF;AACF;;;AHjKA,IAAME,cAAaC,eAAc,YAAY,GAAG;AAChD,IAAMC,aAAYC,MAAK,QAAQH,WAAU;AAQzC,eAAsB,YAAY,UAAuB,CAAC,GAAG;AAC3D,QAAM,UAAU,QAAQ,QAAQ,QAAQ,IAAI;AAC5C,QAAM,aAAaG,MAAK,KAAK,SAAS,mBAAmB;AAEzD,MAAI;AAEF,QAAI,eAAe;AACnB,QAAI;AACF,YAAMC,IAAG,OAAO,UAAU;AAC1B,qBAAe;AAAA,IACjB,QAAQ;AAAA,IAER;AAGA,QAAI,gBAAgB,QAAQ,SAAS;AACnC,YAAM,mBAAmB,IAAI,iBAAiB,OAAO;AACrD,YAAM,iBAAiB,mBAAmB;AAC1C;AAAA,IACF;AAGA,QAAI,gBAAgB,CAAC,QAAQ,SAAS;AACpC,cAAQ,IAAIC,OAAM,OAAO,gDAAsC,CAAC;AAChE,cAAQ,IAAIA,OAAM,IAAI,KAAK,GAAGA,OAAM,KAAK,qBAAqB,GAAGA,OAAM,IAAI,6BAA6B,CAAC;AACzG;AAAA,IACF;AAGA,QAAI,CAAC,cAAc;AACjB,YAAM,gBAAgB,SAAS,OAAO;AAAA,IACxC;AAAA,EACF,SAAS,OAAO;AACd,YAAQ,MAAMA,OAAM,IAAI,6BAA6B,GAAG,KAAK;AAC7D,YAAQ,KAAK,CAAC;AAAA,EAChB;AACF;AAEA,eAAe,gBAAgB,SAAiB,SAAsB;AAEpE,oBAAkB;AAClB,UAAQ,IAAIA,OAAM,KAAK,wBAAwB,CAAC;AAGhD,UAAQ,IAAIA,OAAM,IAAI,mCAA4B,GAAGA,OAAM,KAAK,OAAO,CAAC;AACxE,QAAM,aAAa,MAAM,oBAAoB,OAAO;AAEpD,MAAI,aAAkC,CAAC;AAEvC,MAAI,WAAW,WAAW,GAAG;AAC3B,YAAQ,IAAIA,OAAM,OAAO,wCAA8B,CAAC;AAExD,QAAI,CAAC,QAAQ,KAAK;AAChB,YAAM,EAAE,WAAW,IAAI,MAAM,SAAS,OAAO;AAAA,QAC3C;AAAA,UACE,MAAM;AAAA,UACN,MAAM;AAAA,UACN,SAAS;AAAA,UACT,SAAS;AAAA,QACX;AAAA,MACF,CAAC;AAED,UAAI,CAAC,YAAY;AACf,gBAAQ,IAAIA,OAAM,IAAI,UAAU,CAAC;AACjC;AAAA,MACF;AAAA,IACF;AAGA,eAAW,KAAK;AAAA,MACd,MAAM;AAAA,MACN,MAAM;AAAA,MACN,SAAS;AAAA,MACT,QAAQ;AAAA,QACN,SAAS,CAAC,iDAAiD;AAAA,QAC3D,SAAS;AAAA,UACP;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,QACF;AAAA,MACF;AAAA,IACF,CAAC;AAAA,EACH,OAAO;AAEL,YAAQ,IAAIA,OAAM,MAAM;AAAA,eAAa,WAAW,MAAM;AAAA,CAAkB,CAAC;AAEzE,eAAW,OAAO,YAAY;AAC5B,YAAM,cAAc,IAAI,SAAS,MAAM,SAAS,IAAI;AACpD,cAAQ,IAAIA,OAAM,KAAK,KAAK,IAAI,IAAI,EAAE,GAAGA,OAAM,IAAI,IAAI,IAAI,UAAU,cAAc,CAAC;AACpF,cAAQ,IAAIA,OAAM,IAAI,iBAAiB,WAAW,EAAE,CAAC;AAErD,UAAI,IAAI,SAAS,SAAS,GAAG;AAC3B,YAAI,SAAS,QAAQ,CAAC,MAAM;AAC1B,kBAAQ,IAAIA,OAAM,IAAI,cAAS,CAAC,EAAE,CAAC;AAAA,QACrC,CAAC;AAAA,MACH;AACA,cAAQ,IAAI;AAAA,IACd;AAGA,QAAI,CAAC,QAAQ,KAAK;AAChB,YAAM,EAAE,QAAQ,IAAI,MAAM,SAAS,OAAO;AAAA,QACxC;AAAA,UACE,MAAM;AAAA,UACN,MAAM;AAAA,UACN,SAAS;AAAA,UACT,SAAS;AAAA,QACX;AAAA,MACF,CAAC;AAED,UAAI,CAAC,SAAS;AACZ,gBAAQ,IAAIA,OAAM,IAAI,UAAU,CAAC;AACjC;AAAA,MACF;AAAA,IACF;AAGA,eAAW,OAAO,YAAY;AAC5B,YAAM,WAAW,qBAAqB,IAAI,IAAI;AAC9C,UAAI,CAAC,UAAU;AACb,gBAAQ,KAAKA,OAAM,OAAO,uCAA6B,IAAI,IAAI,YAAY,CAAC;AAC5E;AAAA,MACF;AAGA,YAAM,kBAAkB,MAAM,SAAS,eAAe,SAAS,IAAI,IAAI;AAGvE,UAAI,kBAAkB;AACtB,UAAI,CAAC,QAAQ,KAAK;AAChB,cAAM,EAAE,UAAU,IAAI,MAAM,SAAS,OAAO;AAAA,UAC1C;AAAA,YACE,MAAM;AAAA,YACN,MAAM;AAAA,YACN,SAAS,aAAa,IAAI,IAAI;AAAA,YAC9B,SAAS;AAAA,UACX;AAAA,QACF,CAAC;AACD,0BAAkB;AAAA,MACpB;AAEA,UAAI,cAAc;AAClB,UAAI,iBAAiB;AACnB,cAAM,aAAa,MAAM,uBAAuB,IAAI,MAAM,eAAe;AACzE,sBAAc,EAAE,GAAG,iBAAiB,GAAG,WAAW;AAAA,MACpD,OAAO;AACL,cAAM,cAAc,IAAI,SAAS,MAAM,SAAS,IAAI;AACpD,gBAAQ,IAAIA,OAAM,IAAI,+BAA0B,IAAI,IAAI,OAAO,WAAW,EAAE,CAAC;AAAA,MAC/E;AAEA,iBAAW,KAAK;AAAA,QACd,MAAM,IAAI;AAAA,QACV,MAAM,IAAI;AAAA,QACV,SAAS;AAAA,QACT,QAAQ;AAAA,MACV,CAAC;AAAA,IACH;AAAA,EACF;AAGA,MAAI,CAAC,QAAQ,KAAK;AAChB,UAAM,EAAE,mBAAmB,IAAI,MAAM,SAAS,OAAO;AAAA,MACnD;AAAA,QACE,MAAM;AAAA,QACN,MAAM;AAAA,QACN,SAAS;AAAA,QACT,SAAS;AAAA,MACX;AAAA,IACF,CAAC;AAED,QAAI,oBAAoB;AACtB,UAAI;AACF,cAAM,iBAAiBF,MAAK,KAAK,SAAS,SAAS;AACnD,cAAMC,IAAG,MAAM,gBAAgB,EAAE,WAAW,KAAK,CAAC;AAKlD,cAAM,eAAeD,MAAK,KAAKD,YAAW,6BAA6B;AAEvE,cAAM,YAAYC,MAAK,KAAK,gBAAgB,OAAO;AACnD,YAAI;AACJ,YAAI,cAAc;AAClB,YAAI,SAAS;AAEb,YAAI;AACF,gBAAM,QAAQ,MAAMC,IAAG,KAAK,SAAS;AACrC,wBAAc,MAAM,YAAY;AAChC,mBAAS,MAAM,OAAO;AAAA,QACxB,QAAQ;AAAA,QAER;AAEA,YAAI,aAAa;AAEf,uBAAaD,MAAK,KAAK,WAAW,UAAU;AAC5C,gBAAMC,IAAG,SAAS,cAAc,UAAU;AAC1C,kBAAQ,IAAIC,OAAM,MAAM,yDAAoD,CAAC;AAAA,QAC/E,WAAW,QAAQ;AAEjB,gBAAM,EAAE,aAAa,IAAI,MAAM,SAAS,OAAO;AAAA,YAC7C;AAAA,cACE,MAAM;AAAA,cACN,MAAM;AAAA,cACN,SAAS;AAAA,cACT,SAAS;AAAA,YACX;AAAA,UACF,CAAC;AAED,cAAI,cAAc;AAGhB,kBAAM,gBAAgB,MAAMD,IAAG,SAAS,WAAW,OAAO;AAE1D,kBAAMA,IAAG,OAAO,SAAS;AAEzB,kBAAMA,IAAG,MAAM,SAAS;AAExB,kBAAMA,IAAG,UAAUD,MAAK,KAAK,WAAW,aAAa,GAAG,aAAa;AAErE,kBAAMC,IAAG,SAAS,cAAcD,MAAK,KAAK,WAAW,UAAU,CAAC;AAChE,oBAAQ,IAAIE,OAAM,MAAM,6CAAwC,CAAC;AACjE,oBAAQ,IAAIA,OAAM,MAAM,mDAAmD,CAAC;AAC5E,oBAAQ,IAAIA,OAAM,MAAM,wCAAwC,CAAC;AAAA,UACnE,OAAO;AACL,oBAAQ,IAAIA,OAAM,IAAI,8DAA8D,CAAC;AAAA,UACvF;AAAA,QACF,OAAO;AAEL,gBAAMD,IAAG,MAAM,WAAW,EAAE,WAAW,KAAK,CAAC;AAC7C,uBAAaD,MAAK,KAAK,WAAW,UAAU;AAC5C,gBAAMC,IAAG,SAAS,cAAc,UAAU;AAC1C,kBAAQ,IAAIC,OAAM,MAAM,yDAAoD,CAAC;AAAA,QAC/E;AAAA,MACF,SAAS,OAAO;AACd,gBAAQ,IAAIA,OAAM,OAAO,8CAAoC,CAAC;AAC9D,gBAAQ,IAAIA,OAAM,IAAI,UAAU,iBAAiB,QAAQ,MAAM,UAAU,eAAe,EAAE,CAAC;AAC3F,gBAAQ,IAAIA,OAAM,IAAI,0EAA0E,CAAC;AAAA,MACnG;AAAA,IACF;AAAA,EACF;AAGA,QAAM,SAAqB;AAAA,IACzB,GAAG;AAAA,IACH;AAAA,EACF;AAGA,QAAM,aAAaF,MAAK,KAAK,SAAS,mBAAmB;AACzD,QAAMC,IAAG,UAAU,YAAY,KAAK,UAAU,QAAQ,MAAM,CAAC,IAAI,MAAM,OAAO;AAG9E,UAAQ,IAAIC,OAAM,MAAM,oCAA+B,CAAC;AACxD,UAAQ,IAAIA,OAAM,MAAM,qBAAgB,WAAW,MAAM,eAAe,CAAC;AACzE,UAAQ,IAAIA,OAAM,IAAI,eAAe,CAAC;AACtC,UAAQ,IAAIA,OAAM,IAAI,UAAU,GAAGA,OAAM,KAAK,YAAY,GAAGA,OAAM,IAAI,wBAAwB,CAAC;AAChG,UAAQ,IAAIA,OAAM,IAAI,UAAU,GAAGA,OAAM,KAAK,YAAY,GAAGA,OAAM,IAAI,yBAAyB,CAAC;AACjG,UAAQ,IAAIA,OAAM,IAAI,6DAA6D,CAAC;AACtF;AAEA,eAAe,uBAAuB,eAAuB,QAA4D;AACvH,UAAQ,IAAIA,OAAM,KAAK;AAAA,cAAiB,aAAa,YAAY,CAAC;AAElE,QAAM,UAAU,MAAM,SAAS,OAAO;AAAA,IACpC;AAAA,MACE,MAAM;AAAA,MACN,MAAM;AAAA,MACN,SAAS;AAAA,MACT,SAAS,OAAO,QAAQ,KAAK,IAAI;AAAA,MACjC,QAAQ,CAAC,UAAkB,MAAM,MAAM,GAAG,EAAE,IAAI,OAAK,EAAE,KAAK,CAAC;AAAA,IAC/D;AAAA,IACA;AAAA,MACE,MAAM;AAAA,MACN,MAAM;AAAA,MACN,SAAS;AAAA,MACT,SAAS,OAAO,QAAQ,KAAK,IAAI;AAAA,MACjC,QAAQ,CAAC,UAAkB,MAAM,MAAM,GAAG,EAAE,IAAI,OAAK,EAAE,KAAK,CAAC;AAAA,IAC/D;AAAA,EACF,CAAC;AAED,SAAO;AAAA,IACL,SAAS,QAAQ;AAAA,IACjB,SAAS,QAAQ;AAAA,EACnB;AACF;;;AclTA;AACA;AACAC;AAPA,OAAOC,YAAW;AAClB,OAAOC,UAAQ;AACf,OAAOC,YAAU;AACjB,OAAO,QAAQ;AACf,OAAO,YAAY;AAKnB;AAEA,eAAsB,gBAAgB;AACpC,QAAM,UAAU,QAAQ,IAAI;AAC5B,QAAM,cAAcC,OAAK,SAAS,OAAO;AAGzC,QAAM,WAAW,OACd,WAAW,KAAK,EAChB,OAAO,OAAO,EACd,OAAO,KAAK,EACZ,UAAU,GAAG,CAAC;AAEjB,QAAM,YAAYA,OAAK,KAAK,GAAG,QAAQ,GAAG,SAAS,WAAW,GAAG,WAAW,IAAI,QAAQ,EAAE;AAE1F,oBAAkB;AAClB,UAAQ,IAAIC,OAAM,KAAK,UAAU,CAAC;AAGlC,QAAM,YAAY,MAAM,cAAc,OAAO,OAAO;AACpD,UAAQ,IAAIA,OAAM,IAAI,gBAAgB,GAAG,YAAYA,OAAM,MAAM,cAAS,IAAIA,OAAM,IAAI,wBAAmB,CAAC;AAE5G,MAAI,CAAC,WAAW;AACd,YAAQ,IAAIA,OAAM,OAAO,OAAO,GAAGA,OAAM,KAAK,WAAW,GAAGA,OAAM,OAAO,eAAe,CAAC;AACzF;AAAA,EACF;AAGA,MAAI;AACF,UAAM,QAAQ,MAAMC,KAAG,KAAK,SAAS;AACrC,YAAQ,IAAID,OAAM,IAAI,iBAAiB,GAAG,SAAS;AACnD,YAAQ,IAAIA,OAAM,IAAI,eAAe,GAAGA,OAAM,MAAM,eAAU,CAAC;AAG/D,QAAI;AACF,YAAM,QAAQ,MAAMC,KAAG,QAAQ,WAAW,EAAE,WAAW,KAAK,CAAC;AAC7D,cAAQ,IAAID,OAAM,IAAI,cAAc,GAAG,MAAM,MAAM;AAAA,IACrD,SAAS,GAAG;AAAA,IAEZ;AAEA,YAAQ,IAAIA,OAAM,IAAI,gBAAgB,GAAG,MAAM,MAAM,eAAe,CAAC;AAGrE,QAAI;AACF,YAAM,UAAU,MAAM,gBAAgB,SAAS;AAC/C,UAAI,UAAU,GAAG;AACf,cAAM,cAAc,IAAI,KAAK,OAAO;AACpC,gBAAQ,IAAIA,OAAM,IAAI,eAAe,GAAG,YAAY,eAAe,CAAC;AAAA,MACtE;AAAA,IACF,QAAQ;AAAA,IAER;AAAA,EACF,SAAS,OAAO;AACd,YAAQ,IAAIA,OAAM,IAAI,eAAe,GAAGA,OAAM,OAAO,oBAAe,CAAC;AACrE,YAAQ,IAAIA,OAAM,OAAO,OAAO,GAAGA,OAAM,KAAK,YAAY,GAAGA,OAAM,OAAO,wBAAwB,CAAC;AAAA,EACrG;AAGA,MAAI;AACF,UAAM,SAAS,MAAM,cAAc,KAAK,OAAO;AAE/C,YAAQ,IAAIA,OAAM,KAAK,aAAa,CAAC;AAGrC,UAAM,SAAS,MAAM,UAAU,OAAO;AACtC,QAAI,OAAO,aAAa,WAAW,QAAQ;AACzC,cAAQ,IAAIA,OAAM,IAAI,gBAAgB,GAAGA,OAAM,MAAM,gBAAW,CAAC;AACjE,cAAQ,IAAIA,OAAM,IAAI,kBAAkB,GAAG,GAAG,OAAO,aAAa,iBAAiB,GAAI,GAAG;AAG1F,UAAI;AACF,cAAM,SAAS,MAAM,iBAAiB,OAAO;AAC7C,cAAM,SAAS,MAAM,iBAAiB,OAAO;AAC7C,gBAAQ,IAAIA,OAAM,IAAI,mBAAmB,GAAG,MAAM;AAClD,gBAAQ,IAAIA,OAAM,IAAI,mBAAmB,GAAG,OAAO,UAAU,GAAG,CAAC,CAAC;AAGlE,cAAM,eAAeD,OAAK,KAAK,WAAW,iBAAiB;AAC3D,YAAI;AACF,gBAAM,kBAAkB,MAAME,KAAG,SAAS,cAAc,OAAO;AAC/D,gBAAM,WAAW,KAAK,MAAM,eAAe;AAC3C,cAAI,SAAS,WAAW,UAAU,SAAS,WAAW,QAAQ;AAC5D,oBAAQ,IAAID,OAAM,OAAO,gEAAsD,CAAC;AAAA,UAClF;AAAA,QACF,QAAQ;AAAA,QAER;AAAA,MACF,QAAQ;AAAA,MAER;AAAA,IACF,WAAW,OAAO,aAAa,WAAW,CAAC,QAAQ;AACjD,cAAQ,IAAIA,OAAM,IAAI,gBAAgB,GAAGA,OAAM,OAAO,0BAA0B,CAAC;AAAA,IACnF,OAAO;AACL,cAAQ,IAAIA,OAAM,IAAI,gBAAgB,GAAGA,OAAM,KAAK,UAAU,CAAC;AAAA,IACjE;AAGA,QAAI,OAAO,aAAa,SAAS;AAC/B,cAAQ,IAAIA,OAAM,IAAI,gBAAgB,GAAGA,OAAM,MAAM,gBAAW,CAAC;AACjE,cAAQ,IAAIA,OAAM,IAAI,aAAa,GAAG,GAAG,OAAO,aAAa,UAAU,IAAI;AAAA,IAC7E,OAAO;AACL,cAAQ,IAAIA,OAAM,IAAI,gBAAgB,GAAGA,OAAM,KAAK,UAAU,CAAC;AAC/D,cAAQ,IAAIA,OAAM,IAAI,gBAAgB,GAAGA,OAAM,KAAK,oBAAoB,CAAC;AAAA,IAC3E;AAGA,YAAQ,IAAIA,OAAM,KAAK,sBAAsB,CAAC;AAC9C,QAAI,eAAe,MAAM,GAAG;AAC1B,cAAQ,IAAIA,OAAM,IAAI,cAAc,GAAG,OAAO,KAAK,WAAW;AAC9D,cAAQ,IAAIA,OAAM,IAAI,aAAa,GAAG,OAAO,KAAK,kBAAkB;AACpE,cAAQ,IAAIA,OAAM,IAAI,aAAa,GAAG,OAAO,KAAK,SAAS;AAC3D,cAAQ,IAAIA,OAAM,IAAI,gBAAgB,GAAG,OAAO,KAAK,YAAY;AAAA,IACnE;AAAA,EAEF,SAAS,OAAO;AACd,YAAQ,IAAIA,OAAM,OAAO,yCAAyC,CAAC;AAAA,EACrE;AACF;;;AC9HA;AADA,OAAOE,YAAW;AAIlB,eAAsB,aAAa,SAAkE;AACnG,oBAAkB;AAElB,MAAI;AAEF,QAAI,QAAQ,OAAO;AACjB,YAAM,EAAE,UAAAC,UAAS,IAAI,MAAM;AAC3B,YAAM,EAAE,iBAAAC,iBAAgB,IAAI,MAAM;AAElC,cAAQ,IAAIC,OAAM,OAAO,yCAAyC,CAAC;AACnE,YAAM,WAAW,IAAIF,UAAS,QAAQ,IAAI,CAAC;AAC3C,YAAM,SAAS,WAAW;AAC1B,YAAM,SAAS,MAAM;AAGrB,YAAM,WAAW,IAAIC,iBAAgB,SAAS,MAAM;AACpD,YAAM,SAAS,MAAM;AAErB,cAAQ,IAAIC,OAAM,MAAM,qCAAgC,CAAC;AAAA,IAC3D;AAEA,UAAM,cAAc;AAAA,MAClB,SAAS,QAAQ,IAAI;AAAA,MACrB,SAAS,QAAQ,WAAW;AAAA,MAC5B,OAAO,QAAQ,SAAS;AAAA,IAC1B,CAAC;AAED,QAAI,QAAQ,OAAO;AACjB,cAAQ,IAAIA,OAAM,OAAO,gDAAsC,CAAC;AAAA,IAElE;AAAA,EACF,SAAS,OAAO;AACd,YAAQ,MAAMA,OAAM,IAAI,wBAAwB,GAAG,KAAK;AACxD,YAAQ,KAAK,CAAC;AAAA,EAChB;AACF;;;ACvCA,OAAOC,YAAW;AAClB,OAAOC,UAAQ;AACf,OAAOC,YAAU;;;ACFjB,SAAS,cAAc;AACvB,SAAS,4BAA4B;AACrC;AAAA,EACE;AAAA,EACA;AAAA,OACK;AACP,SAAS,iBAAAC,sBAAqB;AAC9B,SAAS,iBAAAC,sBAAqB;AAC9B,SAAS,WAAAC,UAAS,QAAAC,aAAY;;;ACP9B,SAAS,uBAAuB;AA2BzB,SAAS,gBACd,WACA,MACA,aACA;AACA,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA,aAAa,gBAAgB,WAAW;AAAA,MACtC,QAAQ;AAAA,MACR,cAAc;AAAA,IAChB,CAAC;AAAA,EACH;AACF;;;ACzCA,SAAS,SAAS;AAQX,IAAM,uBAAuB,EAAE,OAAO;AAAA,EAC3C,OAAO,EAAE,OAAO,EACb,IAAI,GAAG,qCAAqC,EAC5C,IAAI,KAAK,qCAAqC,EAC9C;AAAA,IACC;AAAA,EASF;AAAA,EAEF,OAAO,EAAE,OAAO,EACb,IAAI,EACJ,IAAI,GAAG,0BAA0B,EACjC,IAAI,IAAI,wBAAwB,EAChC,QAAQ,CAAC,EACT;AAAA,IACC;AAAA,EAGF;AACJ,CAAC;;;AClCD,SAAS,KAAAC,UAAS;AAOX,IAAM,oBAAoBA,GAAE,OAAO;AAAA,EACxC,MAAMA,GAAE,OAAO,EACZ,IAAI,IAAI,6CAA6C,EACrD;AAAA,IACC;AAAA,EAGF;AAAA,EAEF,OAAOA,GAAE,OAAO,EACb,IAAI,EACJ,IAAI,GAAG,0BAA0B,EACjC,IAAI,IAAI,wBAAwB,EAChC,QAAQ,CAAC,EACT;AAAA,IACC;AAAA,EAEF;AACJ,CAAC;;;ACzBD,SAAS,KAAAC,UAAS;AAQX,IAAM,wBAAwBA,GAAE,OAAO;AAAA,EAC5C,WAAWA,GAAE,MAAM;AAAA,IACjBA,GAAE,OAAO,EAAE,IAAI,GAAG,0BAA0B;AAAA,IAC5CA,GAAE,MAAMA,GAAE,OAAO,EAAE,IAAI,GAAG,0BAA0B,CAAC,EAAE,IAAI,GAAG,0CAA0C,EAAE,IAAI,IAAI,8BAA8B;AAAA,EAClJ,CAAC,EAAE;AAAA,IACD;AAAA,EAIF;AAAA,EAEA,gBAAgBA,GAAE,QAAQ,EACvB,QAAQ,IAAI,EACZ;AAAA,IACC;AAAA,EAIF;AACJ,CAAC;;;AC3BD,SAAS,KAAAC,UAAS;AAOX,IAAM,sBAAsBA,GAAE,OAAO;AAAA,EAC1C,SAASA,GAAE,OAAO,EACf,SAAS,EACT;AAAA,IACC;AAAA,EAMF;AAAA,EAEF,UAAUA,GAAE,OAAO,EAChB,SAAS,EACT;AAAA,IACC;AAAA,EAGF;AACJ,CAAC;;;AC1BD,SAAS,KAAAC,UAAS;AAYX,IAAM,sBAAsBA,GAAE,OAAO;AAAA,EAC1C,UAAUA,GAAE,OAAO,EAChB,IAAI,GAAG,0BAA0B,EACjC;AAAA,IACC;AAAA,EAKF;AAAA,EAEF,OAAOA,GAAE,OAAO,EACb,IAAI,EACJ,IAAI,CAAC,EACL,IAAI,CAAC,EACL,QAAQ,CAAC,EACT;AAAA,IACC;AAAA,EAEF;AACJ,CAAC;;;AChCD,SAAS,KAAAC,UAAS;AAQX,IAAM,sBAAsBA,GAAE,OAAO;AAAA,EAC1C,OAAOA,GAAE,MAAMA,GAAE,OAAO,EAAE,IAAI,GAAG,0BAA0B,CAAC,EACzD,SAAS,EACT;AAAA,IACC;AAAA,EAEF;AAAA,EAEF,KAAKA,GAAE,OAAO,EACX,IAAI,EACJ,IAAI,GAAG,wBAAwB,EAC/B,IAAI,IAAI,sBAAsB,EAC9B,QAAQ,EAAE,EACV;AAAA,IACC;AAAA,EAEF;AAAA,EAEF,WAAWA,GAAE,OAAO,EACjB,IAAI,EACJ,IAAI,GAAG,8BAA8B,EACrC,SAAS,EACT;AAAA,IACC;AAAA,EAIF;AACJ,CAAC;;;ACpBM,IAAM,QAAQ;AAAA,EACnB;AAAA,IACE;AAAA,IACA;AAAA,IACA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASF;AAAA,EACA;AAAA,IACE;AAAA,IACA;AAAA,IACA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMF;AAAA,EACA;AAAA,IACE;AAAA,IACA;AAAA,IACA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAwCF;AAAA,EACA;AAAA,IACE;AAAA,IACA;AAAA,IACA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOF;AAAA,EACA;AAAA,IACE;AAAA,IACA;AAAA,IACA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUF;AAAA,EACA;AAAA,IACE;AAAA,IACA;AAAA,IACA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAqBF;AACF;;;ACrIA;AADA,SAAoB,gBAAgB;AAoC7B,SAAS,gBACd,QACA,SACA;AACA,SAAO,OAAO,SAAkB;AAC9B,QAAI;AAEF,YAAM,YAAY,OAAO,MAAM,IAAI;AAGnC,YAAM,SAAS,MAAM,QAAQ,SAAS;AAGtC,aAAO;AAAA,QACL,SAAS,CAAC;AAAA,UACR,MAAM;AAAA,UACN,MAAM,KAAK,UAAU,QAAQ,MAAM,CAAC;AAAA,QACtC,CAAC;AAAA,MACH;AAAA,IAEF,SAAS,OAAO;AAEd,UAAI,iBAAiB,UAAU;AAC7B,eAAO;AAAA,UACL,SAAS;AAAA,UACT,SAAS,CAAC;AAAA,YACR,MAAM;AAAA,YACN,MAAM,KAAK,UAAU;AAAA,cACnB,OAAO;AAAA,cACP;AAAA,cACA,SAAS,MAAM,OAAO,IAAI,QAAM;AAAA,gBAC9B,OAAO,EAAE,KAAK,KAAK,GAAG;AAAA,gBACtB,SAAS,EAAE;AAAA,cACb,EAAE;AAAA,YACJ,GAAG,MAAM,CAAC;AAAA,UACZ,CAAC;AAAA,QACH;AAAA,MACF;AAGA,UAAI,iBAAiB,WAAW;AAC9B,eAAO;AAAA,UACL,SAAS;AAAA,UACT,SAAS,CAAC;AAAA,YACR,MAAM;AAAA,YACN,MAAM,KAAK,UAAU,MAAM,OAAO,GAAG,MAAM,CAAC;AAAA,UAC9C,CAAC;AAAA,QACH;AAAA,MACF;AAGA,cAAQ,MAAM,qCAAqC,KAAK;AACxD,aAAO;AAAA,QACL,SAAS;AAAA,QACT,SAAS,CAAC;AAAA,UACR,MAAM;AAAA,UACN,MAAM,KAAK,UAAU;AAAA,YACnB,OAAO,iBAAiB,QAAQ,MAAM,UAAU;AAAA,YAChD;AAAA,UACF,GAAG,MAAM,CAAC;AAAA,QACZ,CAAC;AAAA,MACH;AAAA,IACF;AAAA,EACF;AACF;;;AC5FA,eAAsB,qBACpB,MACA,KACwB;AACxB,QAAM,EAAE,UAAU,YAAY,KAAK,mBAAmB,iBAAiB,IAAI;AAE3E,SAAO,MAAM;AAAA,IACX;AAAA,IACA,OAAO,kBAAkB;AACvB,UAAI,mBAAmB,cAAc,KAAK,GAAG;AAG7C,YAAM,kBAAkB;AAExB,YAAM,iBAAiB,MAAM,WAAW,MAAM,cAAc,KAAK;AACjE,YAAM,UAAU,MAAM,SAAS,OAAO,gBAAgB,cAAc,OAAO,cAAc,KAAK;AAE9F,UAAI,SAAS,QAAQ,MAAM,UAAU;AAErC,aAAO;AAAA,QACL,WAAW,iBAAiB;AAAA,QAC5B;AAAA,MACF;AAAA,IACF;AAAA,EACF,EAAE,IAAI;AACR;;;ACzBA,eAAsB,kBACpB,MACA,KACwB;AACxB,QAAM,EAAE,UAAU,YAAY,KAAK,mBAAmB,iBAAiB,IAAI;AAE3E,SAAO,MAAM;AAAA,IACX;AAAA,IACA,OAAO,kBAAkB;AACvB,UAAI,yBAAyB;AAG7B,YAAM,kBAAkB;AAExB,YAAM,gBAAgB,MAAM,WAAW,MAAM,cAAc,IAAI;AAE/D,YAAM,UAAU,MAAM,SAAS,OAAO,eAAe,cAAc,OAAO,cAAc,IAAI;AAE5F,UAAI,SAAS,QAAQ,MAAM,iBAAiB;AAE5C,aAAO;AAAA,QACL,WAAW,iBAAiB;AAAA,QAC5B;AAAA,MACF;AAAA,IACF;AAAA,EACF,EAAE,IAAI;AACR;;;ACfO,SAAS,cAAcC,QAAc,eAA+B;AACzE,MAAI,aAAaA,OAAK,QAAQ,SAAS,EAAE,EAAE,KAAK,EAAE,QAAQ,OAAO,GAAG;AAIpE,eAAa,WAAW,QAAQ,sBAAsB,EAAE;AAGxD,MAAI,WAAW,WAAW,gBAAgB,GAAG,GAAG;AAC9C,iBAAa,WAAW,UAAU,cAAc,SAAS,CAAC;AAAA,EAC5D;AAEA,SAAO;AACT;AAaO,SAAS,kBAAkB,KAAa,SAA0B;AACvE,QAAM,QAAQ,IAAI,QAAQ,OAAO;AACjC,MAAI,UAAU,GAAI,QAAO;AAGzB,QAAM,aAAa,QAAQ,IAAI,IAAI,QAAQ,CAAC,IAAI;AAChD,MAAI,eAAe,OAAO,UAAU,EAAG,QAAO;AAI9C,QAAM,WAAW,QAAQ,QAAQ;AACjC,MAAI,aAAa,IAAI,OAAQ,QAAO;AACpC,QAAM,YAAY,IAAI,QAAQ;AAC9B,SAAO,cAAc;AACvB;AAeO,SAAS,YAAY,kBAA0B,kBAAmC;AAEvF,MAAI,qBAAqB,iBAAkB,QAAO;AAGlD,MAAI,kBAAkB,kBAAkB,gBAAgB,GAAG;AACzD,WAAO;AAAA,EACT;AAGA,MAAI,kBAAkB,kBAAkB,gBAAgB,GAAG;AACzD,WAAO;AAAA,EACT;AAIA,QAAM,gBAAgB,iBAAiB,QAAQ,eAAe,EAAE;AAChE,MAAI,kBAAkB,eAAe,gBAAgB,KACjD,kBAAkB,kBAAkB,aAAa,GAAG;AACtD,WAAO;AAAA,EACT;AAEA,SAAO;AACT;AASO,SAAS,iBAAiB,UAAkB,eAA+B;AAChF,MAAI,YAAY,SAAS,QAAQ,OAAO,GAAG;AAC3C,MAAI,UAAU,WAAW,gBAAgB,GAAG,GAAG;AAC7C,gBAAY,UAAU,UAAU,cAAc,SAAS,CAAC;AAAA,EAC1D;AACA,SAAO;AACT;AAgBO,SAASC,YAAW,UAA2B;AACpD,SAAO,wBAAwB,KAAK,QAAQ,KACrC,uCAAuC,KAAK,QAAQ;AAC7D;;;AC1HA,IAAM,aAAa;AAMnB,eAAsB,sBACpB,MACA,KACwB;AACxB,QAAM,EAAE,UAAU,YAAY,KAAK,mBAAmB,iBAAiB,IAAI;AAE3E,SAAO,MAAM;AAAA,IACX;AAAA,IACA,OAAO,kBAAkB;AAEvB,YAAM,YAAY,MAAM,QAAQ,cAAc,SAAS,IACnD,cAAc,YACd,CAAC,cAAc,SAAS;AAE5B,YAAM,eAAe,CAAC,MAAM,QAAQ,cAAc,SAAS;AAE3D,UAAI,wBAAwB,UAAU,KAAK,IAAI,CAAC,EAAE;AAGlD,YAAM,kBAAkB;AAGxB,YAAM,gBAAgB,QAAQ,IAAI,EAAE,QAAQ,OAAO,GAAG;AAGtD,YAAM,iBAAiB,MAAM,QAAQ,IAAI,UAAU,IAAI,QAAM,WAAW,MAAM,EAAE,CAAC,CAAC;AAGlF,YAAM,kBAAkB,MAAM,QAAQ;AAAA,QACpC,eAAe;AAAA,UAAI,CAAC,WAAW,MAC7B,SAAS,OAAO,WAAW,IAAI,UAAU,CAAC,CAAC;AAAA,QAC7C;AAAA,MACF;AAIA,YAAM,gBAAgB,UAAU,IAAI,CAAC,UAAU,MAAM;AACnD,cAAM,aAAa,gBAAgB,CAAC;AACpC,cAAM,kBAAkB,iBAAiB,UAAU,aAAa;AAEhE,eAAO,WAAW,OAAO,OAAK;AAC5B,gBAAM,iBAAiB,iBAAiB,EAAE,SAAS,MAAM,aAAa;AACtE,iBAAO,mBAAmB;AAAA,QAC5B,CAAC;AAAA,MACH,CAAC;AAGD,UAAI,mBAA4B,CAAC;AACjC,UAAI,cAAc,gBAAgB;AAEhC,cAAM,kBAAkB,cACrB,IAAI,CAAC,QAAQ,OAAO,EAAE,QAAQ,UAAU,UAAU,CAAC,GAAG,OAAO,EAAE,EAAE,EACjE,OAAO,CAAC,EAAE,OAAO,MAAM,OAAO,SAAS,CAAC;AAE3C,YAAI,gBAAgB,SAAS,GAAG;AAE9B,gBAAM,oBAAoB,MAAM,QAAQ;AAAA,YACtC,gBAAgB,IAAI,CAAC,EAAE,OAAO,MAAM,WAAW,MAAM,OAAO,CAAC,EAAE,OAAO,CAAC;AAAA,UACzE;AAGA,gBAAM,kBAAkB,MAAM,QAAQ;AAAA,YACpC,kBAAkB;AAAA,cAAI,CAAC,WAAW,MAChC,SAAS,OAAO,WAAW,GAAG,gBAAgB,CAAC,EAAE,OAAO,CAAC,EAAE,OAAO;AAAA,YACpE;AAAA,UACF;AAGA,6BAAmB,MAAM,KAAK,EAAE,QAAQ,UAAU,OAAO,GAAG,MAAM,CAAC,CAAC;AACpE,0BAAgB,QAAQ,CAAC,EAAE,UAAU,MAAM,GAAG,MAAM;AAClD,kBAAM,UAAU,gBAAgB,CAAC;AACjC,kBAAM,kBAAkB,iBAAiB,UAAU,aAAa;AAEhE,6BAAiB,KAAK,IAAI,QAAQ,OAAO,OAAK;AAC5C,oBAAM,iBAAiB,iBAAiB,EAAE,SAAS,MAAM,aAAa;AACtE,qBAAO,mBAAmB;AAAA,YAC5B,CAAC;AAAA,UACH,CAAC;AAAA,QACH;AAAA,MACF;AAIA,YAAM,YAAY,MAAM,SAAS,eAAe,EAAE,OAAO,WAAW,CAAC;AAGrE,UAAI,UAAU,WAAW,YAAY;AACnC,YAAI,WAAW,UAAU,qFAAqF,SAAS;AAAA,MACzH;AAGA,YAAM,YAAY,oBAAI,IAAoB;AAC1C,YAAM,sBAAsB,CAACC,WAAyB;AACpD,YAAI,UAAU,IAAIA,MAAI,EAAG,QAAO,UAAU,IAAIA,MAAI;AAClD,cAAM,aAAa,cAAcA,QAAM,aAAa;AACpD,kBAAU,IAAIA,QAAM,UAAU;AAC9B,eAAO;AAAA,MACT;AAGA,YAAM,sBAAsB,UAAU,IAAI,CAAC,aAAa;AACtD,cAAM,mBAAmB,oBAAoB,QAAQ;AAKrD,cAAM,YAAY,oBAAI,IAAY;AAClC,mBAAW,SAAS,WAAW;AAC7B,gBAAMC,aAAY,iBAAiB,MAAM,SAAS,MAAM,aAAa;AAGrE,cAAI,CAACC,YAAWD,UAAS,EAAG;AAG5B,gBAAM,UAAU,MAAM,SAAS,WAAW,CAAC;AAC3C,qBAAW,OAAO,SAAS;AACzB,kBAAM,mBAAmB,oBAAoB,GAAG;AAChD,gBAAI,YAAY,kBAAkB,gBAAgB,GAAG;AACnD,wBAAU,IAAIA,UAAS;AACvB;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAEA,eAAO,MAAM,KAAK,SAAS;AAAA,MAC7B,CAAC;AAGD,YAAM,YAA2E,CAAC;AAClF,gBAAU,QAAQ,CAAC,UAAU,MAAM;AACjC,cAAM,aAAa,cAAc,CAAC;AAClC,cAAM,gBAAgB,iBAAiB,CAAC,KAAK,CAAC;AAI9C,cAAM,aAAa,oBAAI,IAAY;AACnC,cAAM,gBAAgB,CAAC,GAAG,YAAY,GAAG,aAAa,EAAE,OAAO,WAAS;AACtE,gBAAM,gBAAgB,iBAAiB,MAAM,SAAS,MAAM,aAAa;AACzE,gBAAM,UAAU,GAAG,aAAa,IAAI,MAAM,SAAS,SAAS,IAAI,MAAM,SAAS,OAAO;AACtF,cAAI,WAAW,IAAI,OAAO,EAAG,QAAO;AACpC,qBAAW,IAAI,OAAO;AACtB,iBAAO;AAAA,QACT,CAAC;AAED,kBAAU,QAAQ,IAAI;AAAA,UACpB,QAAQ;AAAA,UACR,kBAAkB,oBAAoB,CAAC;AAAA,QACzC;AAAA,MACF,CAAC;AAED,UAAI,SAAS,OAAO,OAAO,SAAS,EAAE,OAAO,CAAC,KAAK,MAAM,MAAM,EAAE,OAAO,QAAQ,CAAC,CAAC,eAAe;AAGjG,UAAI,cAAc;AAEhB,cAAM,WAAW,UAAU,CAAC;AAC5B,eAAO;AAAA,UACL,WAAW,iBAAiB;AAAA,UAC5B,MAAM;AAAA,UACN,QAAQ,UAAU,QAAQ,EAAE;AAAA,UAC5B,kBAAkB,UAAU,QAAQ,EAAE;AAAA,QACxC;AAAA,MACF,OAAO;AAEL,eAAO;AAAA,UACL,WAAW,iBAAiB;AAAA,UAC5B,OAAO;AAAA,QACT;AAAA,MACF;AAAA,IACF;AAAA,EACF,EAAE,IAAI;AACR;;;AClLA,eAAsB,oBACpB,MACA,KACwB;AACxB,QAAM,EAAE,UAAU,KAAK,mBAAmB,iBAAiB,IAAI;AAE/D,SAAO,MAAM;AAAA,IACX;AAAA,IACA,OAAO,kBAAkB;AACvB,UAAI,2CAA2C;AAG/C,YAAM,kBAAkB;AAExB,UAAI;AACJ,UAAI,aAAa;AAEjB,UAAI;AAEF,kBAAU,MAAM,SAAS,aAAa;AAAA,UACpC,UAAU,cAAc;AAAA,UACxB,SAAS,cAAc;AAAA,UACvB,OAAO;AAAA,QACT,CAAC;AAID,YAAI,QAAQ,WAAW,MAAM,cAAc,YAAY,cAAc,UAAU;AAC7E,cAAI,oDAAoD;AACxD,oBAAU,MAAM,SAAS,eAAe;AAAA,YACtC,UAAU,cAAc;AAAA,YACxB,SAAS,cAAc;AAAA,YACvB,OAAO;AAAA,UACT,CAAC;AACD,uBAAa;AAAA,QACf;AAAA,MACF,SAAS,OAAO;AAEd,YAAI,sDAAsD,KAAK,EAAE;AACjE,kBAAU,MAAM,SAAS,eAAe;AAAA,UACtC,UAAU,cAAc;AAAA,UACxB,SAAS,cAAc;AAAA,UACvB,OAAO;AAAA,QACT,CAAC;AACD,qBAAa;AAAA,MACf;AAEA,UAAI,SAAS,QAAQ,MAAM,kBAAkB,UAAU,SAAS;AAEhE,aAAO;AAAA,QACL,WAAW,iBAAiB;AAAA,QAC5B,QAAQ;AAAA,QACR;AAAA,QACA,MAAM,eAAe,YACjB,oFACA;AAAA,MACN;AAAA,IACF;AAAA,EACF,EAAE,IAAI;AACR;;;AC/BA,IAAM,6BAA6B;AAAA,EACjC,KAAK;AAAA;AAAA,EACL,QAAQ;AAAA;AAAA,EACR,MAAM;AAAA;AACR;AAMA,IAAM,wBAAwB;AAAA,EAC5B,2BAA2B;AAAA;AAAA,EAC3B,cAAc;AAAA;AAAA,EACd,cAAc;AAAA;AAAA,EACd,UAAU;AAAA;AAAA,EACV,UAAU;AAAA;AAAA,EACV,YAAY;AAAA;AAAA,EACZ,YAAY;AAAA;AACd;AAMA,IAAME,cAAa;AAGnB,IAAM,aAAa,EAAE,KAAK,GAAG,QAAQ,GAAG,MAAM,GAAG,UAAU,EAAE;AAM7D,SAAS,iBACP,WACA,qBAC6B;AAC7B,QAAM,cAAc,oBAAI,IAA4B;AAEpD,aAAW,SAAS,WAAW;AAC7B,UAAM,UAAU,MAAM,SAAS,WAAW,CAAC;AAC3C,eAAW,OAAO,SAAS;AACzB,YAAM,mBAAmB,oBAAoB,GAAG;AAChD,UAAI,CAAC,YAAY,IAAI,gBAAgB,GAAG;AACtC,oBAAY,IAAI,kBAAkB,CAAC,CAAC;AAAA,MACtC;AACA,kBAAY,IAAI,gBAAgB,EAAG,KAAK,KAAK;AAAA,IAC/C;AAAA,EACF;AAEA,SAAO;AACT;AAKA,SAAS,oBACP,aACA,kBACgB;AAChB,QAAM,kBAAkC,CAAC;AACzC,QAAM,eAAe,oBAAI,IAAY;AAErC,QAAM,WAAW,CAAC,UAAwB;AACxC,UAAM,UAAU,GAAG,MAAM,SAAS,IAAI,IAAI,MAAM,SAAS,SAAS,IAAI,MAAM,SAAS,OAAO;AAC5F,QAAI,CAAC,aAAa,IAAI,OAAO,GAAG;AAC9B,sBAAgB,KAAK,KAAK;AAC1B,mBAAa,IAAI,OAAO;AAAA,IAC1B;AAAA,EACF;AAGA,MAAI,YAAY,IAAI,gBAAgB,GAAG;AACrC,eAAW,SAAS,YAAY,IAAI,gBAAgB,GAAI;AACtD,eAAS,KAAK;AAAA,IAChB;AAAA,EACF;AAGA,aAAW,CAAC,kBAAkB,MAAM,KAAK,YAAY,QAAQ,GAAG;AAC9D,QAAI,qBAAqB,oBAAoB,YAAY,kBAAkB,gBAAgB,GAAG;AAC5F,iBAAW,SAAS,QAAQ;AAC1B,iBAAS,KAAK;AAAA,MAChB;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AACT;AAKA,SAAS,0BACP,cACkB;AAClB,QAAM,mBAAqC,CAAC;AAE5C,aAAW,CAAC,UAAU,MAAM,KAAK,aAAa,QAAQ,GAAG;AACvD,UAAM,eAAe,OAClB,IAAI,OAAK,EAAE,SAAS,UAAU,EAC9B,OAAO,CAAC,MAAmB,OAAO,MAAM,YAAY,IAAI,CAAC;AAE5D,QAAI,aAAa,SAAS,GAAG;AAC3B,YAAM,MAAM,aAAa,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC;AAClD,uBAAiB,KAAK;AAAA,QACpB;AAAA,QACA,eAAe,KAAK,MAAO,MAAM,aAAa,SAAU,EAAE,IAAI;AAAA,QAC9D,eAAe,KAAK,IAAI,GAAG,YAAY;AAAA,QACvC,iBAAiB;AAAA,QACjB,sBAAsB,aAAa;AAAA,MACrC,CAAC;AAAA,IACH;AAAA,EACF;AAEA,SAAO;AACT;AAKA,SAAS,kCACP,kBACmB;AACnB,MAAI,iBAAiB,WAAW,GAAG;AACjC,WAAO;AAAA,MACL,mBAAmB;AAAA,MACnB,eAAe;AAAA,MACf,yBAAyB;AAAA,MACzB,0BAA0B,CAAC;AAAA,MAC3B,qBAAqB;AAAA,IACvB;AAAA,EACF;AAEA,QAAM,UAAU,iBAAiB,IAAI,OAAK,EAAE,aAAa;AACzD,QAAM,WAAW,iBAAiB,IAAI,OAAK,EAAE,aAAa;AAC1D,QAAM,WAAW,QAAQ,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI,QAAQ;AAC9D,QAAM,YAAY,KAAK,IAAI,GAAG,QAAQ;AAEtC,QAAM,2BAA2B,iBAC9B,OAAO,OAAK,EAAE,gBAAgB,sBAAsB,yBAAyB,EAC7E,KAAK,CAAC,GAAG,MAAM,EAAE,gBAAgB,EAAE,aAAa,EAChD,MAAM,GAAG,CAAC,EACV,IAAI,QAAM,EAAE,UAAU,EAAE,UAAU,eAAe,EAAE,eAAe,eAAe,EAAE,cAAc,EAAE;AAEtG,QAAM,sBAAsB,6BAA6B,UAAU,SAAS;AAE5E,SAAO;AAAA,IACL,mBAAmB,KAAK,MAAM,WAAW,EAAE,IAAI;AAAA,IAC/C,eAAe;AAAA,IACf,yBAAyB,iBAAiB;AAAA,IAC1C;AAAA,IACA;AAAA,EACF;AACF;AAKA,SAAS,6BAA6B,eAAuB,eAAkC;AAC7F,MAAI,gBAAgB,sBAAsB,gBAAgB,gBAAgB,sBAAsB,cAAc;AAC5G,WAAO;AAAA,EACT;AACA,MAAI,gBAAgB,sBAAsB,YAAY,gBAAgB,sBAAsB,UAAU;AACpG,WAAO;AAAA,EACT;AACA,MAAI,gBAAgB,sBAAsB,cAAc,gBAAgB,sBAAsB,YAAY;AACxG,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAKA,SAAS,mBAAmB,gBAAwB,qBAA2C;AAC7F,MAAI,YACF,mBAAmB,IAAI,QACvB,kBAAkB,2BAA2B,MAAM,QACnD,kBAAkB,2BAA2B,SAAS,WACtD,kBAAkB,2BAA2B,OAAO,SAAS;AAG/D,MAAI,WAAW,mBAAmB,IAAI,WAAW,SAAS,GAAG;AAC3D,gBAAY;AAAA,EACd;AAEA,SAAO;AACT;AAMA,eAAsB,oBACpB,MACA,KACwB;AACxB,QAAM,EAAE,UAAU,KAAK,mBAAmB,iBAAiB,IAAI;AAE/D,SAAO,MAAM;AAAA,IACX;AAAA,IACA,OAAO,kBAAkB;AACvB,UAAI,0BAA0B,cAAc,QAAQ,EAAE;AACtD,YAAM,kBAAkB;AAExB,YAAM,YAAY,MAAM,SAAS,eAAe,EAAE,OAAOA,YAAW,CAAC;AACrE,YAAM,WAAW,UAAU,WAAWA;AACtC,UAAI,UAAU;AACZ,YAAI,WAAWA,WAAU,uDAAuD,SAAS;AAAA,MAC3F;AACA,UAAI,YAAY,UAAU,MAAM,wBAAwB;AAExD,YAAM,gBAAgB,QAAQ,IAAI,EAAE,QAAQ,OAAO,GAAG;AACtD,YAAM,YAAY,oBAAI,IAAoB;AAC1C,YAAM,sBAAsB,CAACC,WAAyB;AACpD,YAAI,CAAC,UAAU,IAAIA,MAAI,EAAG,WAAU,IAAIA,QAAM,cAAcA,QAAM,aAAa,CAAC;AAChF,eAAO,UAAU,IAAIA,MAAI;AAAA,MAC3B;AAGA,YAAM,cAAc,iBAAiB,WAAW,mBAAmB;AACnE,YAAM,mBAAmB,oBAAoB,cAAc,QAAQ;AACnE,YAAM,kBAAkB,oBAAoB,aAAa,gBAAgB;AAGzE,YAAM,eAAe,oBAAI,IAAoC;AAC7D,iBAAW,SAAS,iBAAiB;AACnC,cAAM,YAAY,iBAAiB,MAAM,SAAS,MAAM,aAAa;AACrE,cAAM,WAAW,aAAa,IAAI,SAAS,KAAK,CAAC;AACjD,iBAAS,KAAK,KAAK;AACnB,qBAAa,IAAI,WAAW,QAAQ;AAAA,MACtC;AAGA,YAAM,mBAAmB,0BAA0B,YAAY;AAC/D,YAAM,oBAAoB,kCAAkC,gBAAgB;AAE5E,YAAM,cAAc,MAAM,KAAK,aAAa,KAAK,CAAC,EAAE,IAAI,eAAa;AAAA,QACnE;AAAA,QACA,YAAYC,YAAW,QAAQ;AAAA,MACjC,EAAE;AAEF,YAAM,YAAY,mBAAmB,YAAY,QAAQ,kBAAkB,mBAAmB;AAC9F,UAAI,SAAS,YAAY,MAAM,2BAA2B,SAAS,GAAG,kBAAkB,0BAA0B,IAAI,yBAAyB,EAAE,GAAG;AAEpJ,aAAO;AAAA,QACL,WAAW,iBAAiB;AAAA,QAC5B,UAAU,cAAc;AAAA,QACxB,gBAAgB,YAAY;AAAA,QAC5B;AAAA,QACA,YAAY;AAAA,QACZ;AAAA,QACA,MAAM,WAAW,oBAAoBF,WAAU,wDAAwD;AAAA,MACzG;AAAA,IACF;AAAA,EACF,EAAE,IAAI;AACR;;;ACrSA,OAAO,aAAa;;;ACQb,IAAMG,cAAa,EAAE,KAAK,GAAG,QAAQ,GAAG,MAAM,GAAG,UAAU,EAAE;;;ACA7D,IAAMC,8BAA6B;AAAA,EACxC,KAAK;AAAA;AAAA,EACL,QAAQ;AAAA;AAAA,EACR,MAAM;AAAA;AACR;AAMO,IAAMC,yBAAwB;AAAA,EACnC,2BAA2B;AAAA;AAAA,EAC3B,cAAc;AAAA;AAAA,EACd,cAAc;AAAA;AAAA,EACd,UAAU;AAAA;AAAA,EACV,UAAU;AAAA;AAAA,EACV,YAAY;AAAA;AAAA,EACZ,YAAY;AAAA;AACd;AAoCA,SAAS,qBAAqB,eAAiD;AAC7E,QAAM,QAAQ,oBAAI,IAAoB;AACtC,SAAO,CAACC,WAAyB;AAC/B,UAAM,SAAS,MAAM,IAAIA,MAAI;AAC7B,QAAI,WAAW,OAAW,QAAO;AACjC,UAAM,aAAa,cAAcA,QAAM,aAAa;AACpD,UAAM,IAAIA,QAAM,UAAU;AAC1B,WAAO;AAAA,EACT;AACF;AAUA,SAASC,kBACP,QACA,qBAC6B;AAC7B,QAAM,cAAc,oBAAI,IAA4B;AAEpD,aAAW,SAAS,QAAQ;AAC1B,UAAM,UAAU,MAAM,SAAS,WAAW,CAAC;AAC3C,eAAW,OAAO,SAAS;AACzB,YAAM,mBAAmB,oBAAoB,GAAG;AAChD,UAAI,YAAY,YAAY,IAAI,gBAAgB;AAChD,UAAI,CAAC,WAAW;AACd,oBAAY,CAAC;AACb,oBAAY,IAAI,kBAAkB,SAAS;AAAA,MAC7C;AACA,gBAAU,KAAK,KAAK;AAAA,IACtB;AAAA,EACF;AAEA,SAAO;AACT;AASA,SAASC,qBACP,kBACA,aACgB;AAChB,QAAM,kBAAkC,CAAC;AACzC,QAAM,eAAe,oBAAI,IAAY;AAErC,QAAM,WAAW,CAAC,UAA8B;AAC9C,UAAM,UAAU,GAAG,MAAM,SAAS,IAAI,IAAI,MAAM,SAAS,SAAS,IAAI,MAAM,SAAS,OAAO;AAC5F,QAAI,CAAC,aAAa,IAAI,OAAO,GAAG;AAC9B,sBAAgB,KAAK,KAAK;AAC1B,mBAAa,IAAI,OAAO;AAAA,IAC1B;AAAA,EACF;AAGA,QAAM,gBAAgB,YAAY,IAAI,gBAAgB;AACtD,MAAI,eAAe;AACjB,eAAW,SAAS,eAAe;AACjC,eAAS,KAAK;AAAA,IAChB;AAAA,EACF;AAKA,aAAW,CAAC,kBAAkB,MAAM,KAAK,YAAY,QAAQ,GAAG;AAC9D,QAAI,qBAAqB,oBAAoB,YAAY,kBAAkB,gBAAgB,GAAG;AAC5F,iBAAW,SAAS,QAAQ;AAC1B,iBAAS,KAAK;AAAA,MAChB;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AACT;AASA,SAAS,kBACP,QACA,eAC6B;AAC7B,QAAM,eAAe,oBAAI,IAA4B;AAErD,aAAW,SAAS,QAAQ;AAC1B,UAAM,YAAY,iBAAiB,MAAM,SAAS,MAAM,aAAa;AACrE,QAAI,WAAW,aAAa,IAAI,SAAS;AACzC,QAAI,CAAC,UAAU;AACb,iBAAW,CAAC;AACZ,mBAAa,IAAI,WAAW,QAAQ;AAAA,IACtC;AACA,aAAS,KAAK,KAAK;AAAA,EACrB;AAEA,SAAO;AACT;AAQA,SAASC,2BACP,cACsB;AACtB,QAAM,mBAAyC,CAAC;AAEhD,aAAW,CAAC,UAAU,MAAM,KAAK,aAAa,QAAQ,GAAG;AACvD,UAAM,eAAe,OAClB,IAAI,OAAK,EAAE,SAAS,UAAU,EAC9B,OAAO,CAAC,MAAmB,OAAO,MAAM,YAAY,IAAI,CAAC;AAE5D,QAAI,aAAa,SAAS,GAAG;AAC3B,YAAM,MAAM,aAAa,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC;AAClD,YAAM,MAAM,MAAM,aAAa;AAC/B,YAAM,MAAM,KAAK,IAAI,GAAG,YAAY;AAEpC,uBAAiB,KAAK;AAAA,QACpB;AAAA,QACA,eAAe,KAAK,MAAM,MAAM,EAAE,IAAI;AAAA,QACtC,eAAe;AAAA,QACf,iBAAiB;AAAA,QACjB,sBAAsB,aAAa;AAAA,MACrC,CAAC;AAAA,IACH;AAAA,EACF;AAEA,SAAO;AACT;AAQA,SAASC,mCACP,kBAC2D;AAC3D,MAAI,iBAAiB,WAAW,GAAG;AACjC,WAAO;AAAA,EACT;AAEA,QAAM,UAAU,iBAAiB,IAAI,OAAK,EAAE,aAAa;AACzD,QAAM,WAAW,iBAAiB,IAAI,OAAK,EAAE,aAAa;AAC1D,QAAM,WAAW,QAAQ,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI,QAAQ;AAC9D,QAAM,YAAY,KAAK,IAAI,GAAG,QAAQ;AAGtC,QAAM,2BAA2B,iBAC9B,OAAO,OAAK,EAAE,gBAAgBL,uBAAsB,yBAAyB,EAC7E,KAAK,CAAC,GAAG,MAAM,EAAE,gBAAgB,EAAE,aAAa,EAChD,MAAM,GAAG,CAAC,EACV,IAAI,QAAM;AAAA,IACT,UAAU,EAAE;AAAA,IACZ,eAAe,EAAE;AAAA,IACjB,eAAe,EAAE;AAAA,EACnB,EAAE;AAGJ,QAAM,sBAAsBM,8BAA6B,UAAU,SAAS;AAE5E,SAAO;AAAA,IACL,mBAAmB,KAAK,MAAM,WAAW,EAAE,IAAI;AAAA,IAC/C,eAAe;AAAA,IACf,yBAAyB,iBAAiB;AAAA,IAC1C;AAAA,IACA;AAAA,EACF;AACF;AASA,SAASA,8BAA6B,eAAuB,eAAkC;AAC7F,MAAI,gBAAgBN,uBAAsB,gBAAgB,gBAAgBA,uBAAsB,cAAc;AAC5G,WAAO;AAAA,EACT;AACA,MAAI,gBAAgBA,uBAAsB,YAAY,gBAAgBA,uBAAsB,UAAU;AACpG,WAAO;AAAA,EACT;AACA,MAAI,gBAAgBA,uBAAsB,cAAc,gBAAgBA,uBAAsB,YAAY;AACxG,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAQA,SAAS,4BAA4B,OAA0B;AAC7D,MAAI,SAASD,4BAA2B,KAAK;AAC3C,WAAO;AAAA,EACT;AACA,MAAI,SAASA,4BAA2B,QAAQ;AAC9C,WAAO;AAAA,EACT;AACA,MAAI,SAASA,4BAA2B,MAAM;AAC5C,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAUO,SAAS,oBACd,gBACA,WACA,eAC0B;AAE1B,QAAM,sBAAsB,qBAAqB,aAAa;AAG9D,QAAM,cAAcG,kBAAiB,WAAW,mBAAmB;AAGnE,QAAM,mBAAmB,oBAAoB,cAAc;AAC3D,QAAM,kBAAkBC,qBAAoB,kBAAkB,WAAW;AAGzE,QAAM,eAAe,kBAAkB,iBAAiB,aAAa;AAGrE,QAAM,mBAAmBC,2BAA0B,YAAY;AAC/D,QAAM,oBAAoBC,mCAAkC,gBAAgB;AAG5E,QAAM,aAAa,MAAM,KAAK,aAAa,KAAK,CAAC,EAAE,IAAI,eAAa;AAAA,IAClE;AAAA,IACA,YAAYE,YAAW,QAAQ;AAAA,EACjC,EAAE;AAGF,MAAI,YAAY,4BAA4B,WAAW,MAAM;AAG7D,MAAI,mBAAmB,qBAAqB;AAC1C,QAAIC,YAAW,kBAAkB,mBAAmB,IAAIA,YAAW,SAAS,GAAG;AAC7E,kBAAY,kBAAkB;AAAA,IAChC;AAAA,EACF;AAEA,SAAO;AAAA,IACL;AAAA,IACA,gBAAgB,WAAW;AAAA,IAC3B;AAAA,IACA;AAAA,EACF;AACF;;;ACvUA,IAAM,WAAW,EAAE,SAAS,GAAK,OAAO,EAAI;AAKrC,IAAM,qBAAN,MAAyB;AAAA,EAC9B,YACU,UACA,QACR;AAFQ;AACA;AAAA,EACP;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOH,MAAM,QAAQ,OAA6C;AAIzD,UAAM,YAAY,MAAM,KAAK,SAAS,QAAQ;AAG9C,UAAM,SAAS,QACX,UAAU,OAAO,OAAK,KAAK,eAAe,EAAE,SAAS,MAAM,KAAK,CAAC,IACjE;AAGJ,UAAM,aAAa,KAAK,eAAe,MAAM;AAG7C,UAAM,SAAS,KAAK,YAAY,YAAY,MAAM;AAGlD,SAAK,uBAAuB,QAAQ,SAA2B;AAE/D,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA,EAMQ,kBAAkB,UAA0B;AAClD,UAAM,gBAAgB,QAAQ,IAAI;AAElC,UAAM,aAAa,SAAS,QAAQ,OAAO,GAAG;AAC9C,UAAM,iBAAiB,cAAc,QAAQ,OAAO,GAAG;AAGvD,QAAI,WAAW,WAAW,iBAAiB,GAAG,GAAG;AAC/C,aAAO,WAAW,MAAM,eAAe,SAAS,CAAC;AAAA,IACnD;AACA,QAAI,WAAW,WAAW,cAAc,GAAG;AACzC,aAAO,WAAW,MAAM,eAAe,MAAM;AAAA,IAC/C;AACA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA,EAMQ,eAAeC,YAAmB,aAAgC;AAGxE,UAAM,sBAAsBA,WAAU,QAAQ,OAAO,GAAG;AACxD,WAAO,YAAY,KAAK,YAAU;AAChC,YAAM,mBAAmB,OAAO,QAAQ,OAAO,GAAG;AAElD,aAAO,wBAAwB,oBACxB,oBAAoB,SAAS,MAAM,gBAAgB;AAAA,IAC5D,CAAC;AAAA,EACH;AAAA;AAAA;AAAA;AAAA,EAKQ,gBACN,UACA,YACA,eACA,YAC4B;AAC5B,UAAM,mBAAmB,gBAAgB,SAAS;AAClD,UAAM,iBAAiB,gBAAgB,SAAS;AAEhD,QAAI,aAAa,iBAAkB,QAAO;AAE1C,UAAM,oBAAoB,cAAc,iBAAiB,UAAU;AACnE,UAAM,qBAAqB,sBAAsB,UAAU,iBAAiB;AAG5E,UAAM,UAAU,eAAe,eAC3B,UAAU,UAAU,6CAA6C,KAAK,MAAM,kBAAkB,CAAC,MAC/F,eAAe,UAAU,sBAAsB,KAAK,MAAM,kBAAkB,CAAC;AAEjF,WAAO;AAAA,MACL,UAAU,SAAS;AAAA,MACnB,WAAW,SAAS;AAAA,MACpB,SAAS,SAAS;AAAA,MAClB,YAAY,SAAS,cAAc;AAAA,MACnC,YAAY,SAAS;AAAA,MACrB,UAAU,SAAS;AAAA,MACnB;AAAA,MACA,WAAW,KAAK,MAAM,kBAAkB;AAAA,MACxC,UAAU;AAAA,MACV;AAAA,MACA;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAMQ,wBACN,QACiB;AACjB,UAAM,OAAO,oBAAI,IAAY;AAC7B,UAAM,SAA0B,CAAC;AAEjC,eAAW,EAAE,SAAS,KAAK,QAAQ;AACjC,UAAI,SAAS,eAAe,cAAc,SAAS,eAAe,SAAU;AAE5E,YAAM,MAAM,GAAG,SAAS,IAAI,IAAI,SAAS,SAAS,IAAI,SAAS,OAAO;AACtE,UAAI,KAAK,IAAI,GAAG,EAAG;AAEnB,WAAK,IAAI,GAAG;AACZ,aAAO,KAAK,QAAQ;AAAA,IACtB;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOQ,gBAAgB,QAAwB;AAC9C,WAAO,SAAS;AAAA,EAClB;AAAA;AAAA;AAAA;AAAA,EAKQ,WAAW,SAAyB;AAC1C,QAAI,WAAW,IAAI;AACjB,YAAM,QAAQ,KAAK,MAAM,UAAU,EAAE;AACrC,YAAM,OAAO,KAAK,MAAM,UAAU,EAAE;AACpC,aAAO,OAAO,IAAI,GAAG,KAAK,KAAK,IAAI,MAAM,GAAG,KAAK;AAAA,IACnD;AACA,WAAO,GAAG,KAAK,MAAM,OAAO,CAAC;AAAA,EAC/B;AAAA;AAAA;AAAA;AAAA,EAKQ,wBACN,UACA,aACA,WACA,YAC4B;AAC5B,UAAM,mBAAmB,YAAY,SAAS;AAC9C,UAAM,iBAAiB,YAAY,SAAS;AAE5C,QAAI,cAAc,iBAAkB,QAAO;AAE3C,UAAM,oBAAoB,eAAe,iBAAiB,UAAU;AACpE,UAAM,qBAAqB,sBAAsB,UAAU,iBAAiB;AAG5E,QAAI;AACJ,QAAI,eAAe,mBAAmB;AACpC,YAAM,cAAc,KAAK,gBAAgB,WAAW;AACpD,YAAM,mBAAmB,KAAK,gBAAgB,kBAAkB;AAChE,gBAAU,uBAAuB,KAAK,WAAW,WAAW,CAAC,sBAAsB,KAAK,WAAW,gBAAgB,CAAC;AAAA,IACtH,OAAO;AACL,gBAAU,kBAAkB,YAAY,QAAQ,CAAC,CAAC,sBAAsB,mBAAmB,QAAQ,CAAC,CAAC;AAAA,IACvG;AAEA,UAAM,kBAAmC;AAAA,MACvC,QAAQ,SAAS,kBAAkB;AAAA,MACnC,YAAY,SAAS,sBAAsB;AAAA,MAC3C,QAAQ,SAAS,kBAAkB;AAAA,MACnC,MAAM,SAAS,gBAAgB;AAAA,IACjC;AAKA,QAAI;AACJ,QAAI;AACJ,QAAI,eAAe,mBAAmB;AAEpC,mBAAa,KAAK,MAAM,KAAK,gBAAgB,WAAW,CAAC;AACzD,yBAAmB,KAAK,MAAM,KAAK,gBAAgB,kBAAkB,CAAC;AAAA,IACxE,OAAO;AAEL,mBAAa;AACb,yBAAmB;AAAA,IACrB;AAEA,WAAO;AAAA,MACL,UAAU,SAAS;AAAA,MACnB,WAAW,SAAS;AAAA,MACpB,SAAS,SAAS;AAAA,MAClB,YAAY,SAAS,cAAc;AAAA,MACnC,YAAY,SAAS;AAAA,MACrB,UAAU,SAAS;AAAA,MACnB;AAAA,MACA,WAAW;AAAA,MACX,UAAU;AAAA,MACV;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKQ,qBACN,UACA,YACuB;AACvB,UAAM,aAAoC,CAAC;AAG3C,QAAI,SAAS,YAAY;AACvB,YAAM,IAAI,KAAK,gBAAgB,UAAU,SAAS,YAAY,WAAW,WAAW,YAAY;AAChG,UAAI,EAAG,YAAW,KAAK,CAAC;AAAA,IAC1B;AAGA,QAAI,SAAS,qBAAqB;AAChC,YAAM,IAAI,KAAK,gBAAgB,UAAU,SAAS,qBAAqB,WAAW,YAAY,WAAW;AACzG,UAAI,EAAG,YAAW,KAAK,CAAC;AAAA,IAC1B;AAGA,QAAI,WAAW,kBAAkB,SAAS,gBAAgB;AACxD,YAAM,IAAI,KAAK,wBAAwB,UAAU,SAAS,gBAAgB,WAAW,gBAAgB,iBAAiB;AACtH,UAAI,EAAG,YAAW,KAAK,CAAC;AAAA,IAC1B;AAGA,QAAI,WAAW,iBAAiB,SAAS,cAAc;AACrD,YAAM,IAAI,KAAK,wBAAwB,UAAU,SAAS,cAAc,WAAW,eAAe,eAAe;AACjH,UAAI,EAAG,YAAW,KAAK,CAAC;AAAA,IAC1B;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQQ,gBAAgB,SAAyB;AAC/C,WAAO,UAAU;AAAA,EACnB;AAAA;AAAA;AAAA;AAAA;AAAA,EAMQ,eAAe,QAAoF;AACzG,UAAM,mBAAmB,KAAK,OAAO,YAAY;AAGjD,UAAM,iBAAiB,kBAAkB,0BACrC,KAAK,gBAAgB,iBAAiB,uBAAuB,IAC7D,KAAK,gBAAgB,EAAE;AAE3B,UAAM,aAAa;AAAA,MACjB,WAAW,kBAAkB,aAAa;AAAA,MAC1C,YAAY,kBAAkB,cAAc;AAAA,MAC5C;AAAA;AAAA,MACA,eAAe,kBAAkB,iBAAiB;AAAA;AAAA,IACpD;AACA,UAAM,iBAAiB,KAAK,wBAAwB,MAAM;AAE1D,WAAO,eAAe;AAAA,MAAQ,cAC5B,KAAK,qBAAqB,UAAU,UAAU;AAAA,IAChD;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKQ,YACN,YACA,WACkB;AAElB,UAAM,oBAAoB,oBAAI,IAAmC;AACjE,eAAW,aAAa,YAAY;AAClC,YAAM,iBAAiB,KAAK,kBAAkB,UAAU,QAAQ;AAEhE,gBAAU,WAAW;AACrB,YAAM,WAAW,kBAAkB,IAAI,cAAc,KAAK,CAAC;AAC3D,eAAS,KAAK,SAAS;AACvB,wBAAkB,IAAI,gBAAgB,QAAQ;AAAA,IAChD;AAGA,UAAM,gBAAgB,IAAI,IAAI,UAAU,IAAI,OAAK,KAAK,kBAAkB,EAAE,SAAS,IAAI,CAAC,CAAC;AAGzF,UAAM,QAA4C,CAAC;AACnD,eAAW,YAAY,eAAe;AACpC,YAAM,iBAAiB,kBAAkB,IAAI,QAAQ,KAAK,CAAC;AAC3D,YAAM,QAAQ,IAAI;AAAA,QAChB,YAAY;AAAA,QACZ,YAAY,CAAC;AAAA;AAAA,QACb,kBAAkB,CAAC;AAAA;AAAA,QACnB,WAAW,KAAK,mBAAmB,cAAc;AAAA,MACnD;AAAA,IACF;AAGA,UAAM,aAAa,WAAW,OAAO,OAAK,EAAE,aAAa,OAAO,EAAE;AAClE,UAAM,eAAe,WAAW,OAAO,OAAK,EAAE,aAAa,SAAS,EAAE;AAGtE,UAAM,mBAAmB,UACtB,OAAO,OAAK,EAAE,SAAS,eAAe,UAAa,EAAE,SAAS,aAAa,CAAC,EAC5E,IAAI,OAAK,EAAE,SAAS,UAAW;AAElC,UAAM,gBAAgB,iBAAiB,SAAS,IAC5C,iBAAiB,OAAO,CAAC,KAAK,QAAQ,MAAM,KAAK,CAAC,IAAI,iBAAiB,SACvE;AAEJ,UAAM,gBAAgB,iBAAiB,SAAS,IAC5C,KAAK,IAAI,GAAG,gBAAgB,IAC5B;AAEJ,WAAO;AAAA,MACL,SAAS;AAAA,QACP,eAAe,cAAc;AAAA,QAC7B,iBAAiB,WAAW;AAAA,QAC5B,YAAY,EAAE,OAAO,YAAY,SAAS,aAAa;AAAA,QACvD,eAAe,KAAK,MAAM,gBAAgB,EAAE,IAAI;AAAA;AAAA,QAChD;AAAA,MACF;AAAA,MACA;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKQ,mBAAmB,YAA8C;AACvE,QAAI,WAAW,WAAW,EAAG,QAAO;AAEpC,UAAM,YAAY,WAAW,KAAK,OAAK,EAAE,aAAa,OAAO;AAC7D,UAAM,aAAa,WAAW,OAAO,OAAK,EAAE,aAAa,OAAO,EAAE;AAElE,QAAI,cAAc,EAAG,QAAO;AAC5B,QAAI,UAAW,QAAO;AACtB,QAAI,WAAW,UAAU,EAAG,QAAO;AACnC,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQQ,uBACN,QACA,WACM;AACN,UAAM,gBAAgB,QAAQ,IAAI;AAGlC,UAAM,sBAAsB,OAAO,QAAQ,OAAO,KAAK,EACpD,OAAO,CAAC,CAAC,GAAG,IAAI,MAAM,KAAK,WAAW,SAAS,CAAC,EAChD,IAAI,CAAC,CAAC,UAAU,CAAC,MAAM,QAAQ;AAElC,eAAW,YAAY,qBAAqB;AAC1C,YAAM,WAAW,OAAO,MAAM,QAAQ;AAGtC,YAAM,cAAc,oBAAoB,UAAU,WAAW,aAAa;AAG1E,eAAS,aAAa,YAAY,WAAW,IAAI,OAAK,EAAE,QAAQ;AAChE,eAAS,iBAAiB,YAAY;AAItC,UAAIC,YAAW,YAAY,SAAS,IAAIA,YAAW,SAAS,SAAS,GAAG;AACtE,iBAAS,YAAY,YAAY;AAAA,MACnC;AAGA,UAAI,YAAY,mBAAmB;AACjC,iBAAS,6BAA6B;AAAA,UACpC,mBAAmB,YAAY,kBAAkB;AAAA,UACjD,eAAe,YAAY,kBAAkB;AAAA,UAC7C,yBAAyB,YAAY,kBAAkB;AAAA,QACzD;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACF;;;AH9ZA,SAAS,mBAAmB,GAAwB,UAA8B;AAChF,SAAO;AAAA,IACL,UAAU,EAAE;AAAA,IACZ,YAAY,EAAE;AAAA,IACd,YAAY,EAAE;AAAA,IACd,WAAW,EAAE;AAAA,IACb,SAAS,EAAE;AAAA,IACX,YAAY,EAAE;AAAA,IACd,YAAY,EAAE;AAAA,IACd,WAAW,EAAE;AAAA,IACb,UAAU,EAAE;AAAA,IACZ,UAAU,EAAE;AAAA,IACZ,SAAS,EAAE;AAAA,IACX,gBAAgB,SAAS,kBAAkB;AAAA,IAC3C,WAAW,SAAS;AAAA,IACpB,GAAI,EAAE,mBAAmB,EAAE,iBAAiB,EAAE,gBAAgB;AAAA,EAChE;AACF;AAMA,eAAsB,oBACpB,MACA,KACwB;AACxB,QAAM,EAAE,UAAU,QAAQ,KAAK,mBAAmB,iBAAiB,IAAI;AAEvE,SAAO,MAAM;AAAA,IACX;AAAA,IACA,OAAO,kBAAkB;AACvB,UAAI,yBAAyB;AAC7B,YAAM,kBAAkB;AAExB,YAAM,WAAW,IAAI,mBAAmB,UAAU,MAAM;AACxD,YAAM,SAAS,MAAM,SAAS,QAAQ,cAAc,KAAK;AACzD,UAAI,YAAY,OAAO,QAAQ,aAAa,QAAQ;AAIpD,YAAM,gBAAwC,QAAQ,OAAO,QAAQ,OAAO,KAAK,CAAC,EAC/E;AAAA,QAAQ,CAAC,CAAsB,EAAE,QAAQ,MACxC,SAAS,WAAW,IAAI,OAAK,mBAAmB,GAAG,QAAQ,CAAC;AAAA,MAC9D,EACC,WAAW,YAAY,EACvB,IAAI;AAGP,YAAM,aAAa,cAAc,cAAc,SAC3C,cAAc,OAAO,OAAK,EAAE,cAAc,cAAc,SAAU,IAClE;AAEJ,YAAM,gBAAgB,WAAW,MAAM,GAAG,cAAc,GAAG;AAG3D,YAAM,aAAa,QAAQ,UAAU,EAAE,QAAQ,UAAU,EAAE,IAAI;AAE/D,aAAO;AAAA,QACL,WAAW,iBAAiB;AAAA,QAC5B,SAAS;AAAA,UACP,eAAe,OAAO,QAAQ;AAAA,UAC9B,eAAe,OAAO,QAAQ;AAAA,UAC9B,eAAe,OAAO,QAAQ;AAAA,UAC9B,gBAAgB,WAAW;AAAA,UAC3B,YAAY;AAAA,YACV,OAAO,WAAW,OAAO,KAAK;AAAA,YAC9B,SAAS,WAAW,SAAS,KAAK;AAAA,UACpC;AAAA,QACF;AAAA,QACA,YAAY;AAAA,MACd;AAAA,IACF;AAAA,EACF,EAAE,IAAI;AACR;;;AIvDO,IAAM,eAA4C;AAAA,EACvD,mBAAmB;AAAA,EACnB,gBAAgB;AAAA,EAChB,qBAAqB;AAAA,EACrB,kBAAkB;AAAA,EAClB,kBAAkB;AAAA,EAClB,kBAAkB;AACpB;;;ApBzBA;AACA;AACA;AACA;AACA;AACA;AACA;;;AqBhBA;AADA,OAAO,cAAc;AAcd,IAAM,cAAN,MAAkB;AAAA,EACf,UAAqC;AAAA,EACrC,iBAA8C,oBAAI,IAAI;AAAA,EACtD;AAAA,EACA;AAAA,EACA,kBAA4C;AAAA,EAEpD,YAAY,SAAiB,QAAuC;AAClE,SAAK,UAAU;AACf,SAAK,SAAS;AAAA,EAChB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,MAAM,MAAM,SAA2C;AACrD,QAAI,KAAK,SAAS;AAChB,YAAM,IAAI,MAAM,iCAAiC;AAAA,IACnD;AAEA,SAAK,kBAAkB;AAGvB,QAAI;AACJ,QAAI;AAEJ,QAAI,eAAe,KAAK,MAAM,GAAG;AAC/B,wBAAkB,KAAK,OAAO,SAAS;AACvC,wBAAkB,KAAK,OAAO,SAAS;AAAA,IACzC,WAAW,eAAe,KAAK,MAAM,GAAG;AAEtC,wBAAkB,KAAK,OAAO,WAAW,QAAQ,OAAK,EAAE,OAAO,OAAO;AACtE,wBAAkB,KAAK,OAAO,WAAW,QAAQ,OAAK,EAAE,OAAO,OAAO;AAAA,IACxE,OAAO;AACL,wBAAkB,CAAC,MAAM;AACzB,wBAAkB,CAAC;AAAA,IACrB;AAGA,SAAK,UAAU,SAAS,MAAM,iBAAiB;AAAA,MAC7C,KAAK,KAAK;AAAA,MACV,SAAS;AAAA,MACT,YAAY;AAAA,MACZ,eAAe;AAAA;AAAA,MACf,kBAAkB;AAAA,QAChB,oBAAoB;AAAA;AAAA,QACpB,cAAc;AAAA,MAChB;AAAA;AAAA,MAEA,YAAY;AAAA,MACZ,UAAU;AAAA,MACV,gBAAgB;AAAA,IAClB,CAAC;AAGD,SAAK,QACF,GAAG,OAAO,CAAC,aAAa,KAAK,aAAa,OAAO,QAAQ,CAAC,EAC1D,GAAG,UAAU,CAAC,aAAa,KAAK,aAAa,UAAU,QAAQ,CAAC,EAChE,GAAG,UAAU,CAAC,aAAa,KAAK,aAAa,UAAU,QAAQ,CAAC,EAChE,GAAG,SAAS,CAAC,UAAU;AACtB,cAAQ,MAAM,8BAA8B,KAAK,EAAE;AAAA,IACrD,CAAC;AAGH,UAAM,IAAI,QAAc,CAAC,YAAY;AACnC,WAAK,QAAS,GAAG,SAAS,MAAM;AAC9B,gBAAQ;AAAA,MACV,CAAC;AAAA,IACH,CAAC;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA,EAMQ,aAAa,MAAmC,UAAwB;AAE9E,UAAM,gBAAgB,KAAK,eAAe,IAAI,QAAQ;AACtD,QAAI,eAAe;AACjB,mBAAa,aAAa;AAAA,IAC5B;AAGA,UAAM,QAAQ,WAAW,MAAM;AAC7B,WAAK,eAAe,OAAO,QAAQ;AAGnC,UAAI,KAAK,iBAAiB;AACxB,cAAM,eAAe,SAAS,WAAW,GAAG,IACxC,WACA,GAAG,KAAK,OAAO,IAAI,QAAQ;AAE/B,YAAI;AACF,gBAAM,SAAS,KAAK,gBAAgB;AAAA,YAClC;AAAA,YACA,UAAU;AAAA,UACZ,CAAC;AAGD,cAAI,kBAAkB,SAAS;AAC7B,mBAAO,MAAM,CAAC,UAAU;AACtB,sBAAQ,MAAM,sCAAsC,KAAK,EAAE;AAAA,YAC7D,CAAC;AAAA,UACH;AAAA,QACF,SAAS,OAAO;AACd,kBAAQ,MAAM,sCAAsC,KAAK,EAAE;AAAA,QAC7D;AAAA,MACF;AAAA,IACF,GAAG,KAAK,OAAO,aAAa,UAAU;AAEtC,SAAK,eAAe,IAAI,UAAU,KAAK;AAAA,EACzC;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,OAAsB;AAC1B,QAAI,CAAC,KAAK,SAAS;AACjB;AAAA,IACF;AAGA,eAAW,SAAS,KAAK,eAAe,OAAO,GAAG;AAChD,mBAAa,KAAK;AAAA,IACpB;AACA,SAAK,eAAe,MAAM;AAG1B,UAAM,KAAK,QAAQ,MAAM;AACzB,SAAK,UAAU;AACf,SAAK,kBAAkB;AAAA,EACzB;AAAA;AAAA;AAAA;AAAA,EAKA,kBAA4B;AAC1B,QAAI,CAAC,KAAK,SAAS;AACjB,aAAO,CAAC;AAAA,IACV;AAEA,UAAM,UAAU,KAAK,QAAQ,WAAW;AACxC,UAAM,QAAkB,CAAC;AAEzB,eAAW,CAAC,KAAK,SAAS,KAAK,OAAO,QAAQ,OAAO,GAAG;AACtD,iBAAW,YAAY,WAAW;AAChC,cAAM,KAAK,GAAG,GAAG,IAAI,QAAQ,EAAE;AAAA,MACjC;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,YAAqB;AACnB,WAAO,KAAK,YAAY;AAAA,EAC1B;AACF;;;ArB5JA;AACA;AAIA,IAAMC,cAAaC,eAAc,YAAY,GAAG;AAChD,IAAMC,aAAYC,SAAQH,WAAU;AACpC,IAAMI,WAAUC,eAAc,YAAY,GAAG;AAE7C,IAAIC;AACJ,IAAI;AACF,EAAAA,eAAcF,SAAQG,MAAKL,YAAW,iBAAiB,CAAC;AAC1D,QAAQ;AACN,EAAAI,eAAcF,SAAQG,MAAKL,YAAW,oBAAoB,CAAC;AAC7D;AAWA,eAAe,mBACb,SACA,KAC8D;AAC9D,QAAM,aAAa,IAAI,gBAAgB;AACvC,QAAM,WAAW,IAAI,SAAS,OAAO;AAErC,MAAI,4BAA4B;AAChC,QAAM,WAAW,WAAW;AAE5B,MAAI,4BAA4B;AAChC,QAAM,SAAS,WAAW;AAE1B,MAAI,gCAAgC;AACpC,SAAO,EAAE,YAAY,SAAS;AAChC;AAKA,eAAe,mBACb,UACA,QACA,SACA,KACe;AACf,QAAM,WAAW,MAAM,SAAS,QAAQ;AAExC,MAAI,CAAC,YAAY,OAAO,IAAI,qBAAqB;AAC/C,QAAI,wDAAiD;AACrD,QAAI,oEAA0D;AAE9D,QAAI;AACF,YAAM,EAAE,eAAAM,eAAc,IAAI,MAAM;AAChC,YAAMA,eAAc,EAAE,SAAS,SAAS,KAAK,CAAC;AAC9C,UAAI,mCAA8B;AAAA,IACpC,SAAS,OAAO;AACd,UAAI,0CAAgC,KAAK,IAAI,SAAS;AACtD,UAAI,oCAAoC,SAAS;AAAA,IACnD;AAAA,EACF,WAAW,CAAC,UAAU;AACpB,QAAI,sEAA4D,SAAS;AACzE,QAAI,4CAA4C,SAAS;AAAA,EAC3D;AACF;AAKA,eAAe,kBACb,QACA,SACA,UACA,YACA,SACA,KACyF;AACzF,MAAI,CAAC,OAAO,aAAa,SAAS;AAChC,QAAI,yCAAyC;AAC7C,WAAO,EAAE,YAAY,MAAM,iBAAiB,KAAK;AAAA,EACnD;AAEA,QAAM,eAAe,MAAM,eAAe;AAC1C,QAAM,SAAS,MAAM,UAAU,OAAO;AAEtC,MAAI,CAAC,cAAc;AACjB,QAAI,4CAA4C;AAChD,WAAO,EAAE,YAAY,MAAM,iBAAiB,KAAK;AAAA,EACnD;AACA,MAAI,CAAC,QAAQ;AACX,QAAI,+CAA+C;AACnD,WAAO,EAAE,YAAY,MAAM,iBAAiB,KAAK;AAAA,EACnD;AAEA,MAAI,gCAA2B;AAC/B,QAAM,aAAa,IAAI,gBAAgB,SAAS,SAAS,MAAM;AAG/D,MAAI;AACF,QAAI,6BAA6B;AACjC,UAAM,eAAe,MAAM,WAAW,WAAW;AAEjD,QAAI,gBAAgB,aAAa,SAAS,GAAG;AAC3C,UAAI,mCAA4B,aAAa,MAAM,gBAAgB;AACnE,YAAM,QAAQ,MAAM,mBAAmB,cAAc,UAAU,YAAY,QAAQ,EAAE,QAAQ,CAAC;AAC9F,UAAI,oBAAe,KAAK,QAAQ;AAAA,IAClC,OAAO;AACL,UAAI,2CAAsC;AAAA,IAC5C;AAAA,EACF,SAAS,OAAO;AACd,QAAI,yCAAyC,KAAK,IAAI,SAAS;AAAA,EACjE;AAGA,MAAI,gDAA2C,OAAO,aAAa,iBAAiB,GAAI,IAAI;AAE5F,QAAM,kBAAkB,YAAY,YAAY;AAC9C,QAAI;AACF,YAAM,eAAe,MAAM,WAAW,cAAc;AACpD,UAAI,gBAAgB,aAAa,SAAS,GAAG;AAC3C,YAAI,kCAA2B,aAAa,MAAM,gBAAgB;AAClE,2BAAmB,cAAc,UAAU,YAAY,QAAQ,EAAE,QAAQ,CAAC,EACvE,KAAK,WAAS,IAAI,uCAAkC,KAAK,QAAQ,CAAC,EAClE,MAAM,WAAS,IAAI,8BAA8B,KAAK,IAAI,SAAS,CAAC;AAAA,MACzE;AAAA,IACF,SAAS,OAAO;AACd,UAAI,+BAA+B,KAAK,IAAI,SAAS;AAAA,IACvD;AAAA,EACF,GAAG,OAAO,aAAa,cAAc;AAErC,SAAO,EAAE,YAAY,gBAAgB;AACvC;AAKA,eAAe,kBACb,OACA,QACA,SACA,UACA,YACA,SACA,KAC6B;AAC7B,QAAM,sBAAsB,UAAU,SAAY,QAAQ,OAAO,aAAa;AAC9E,MAAI,CAAC,oBAAqB,QAAO;AAEjC,MAAI,oCAA6B;AACjC,QAAM,cAAc,IAAI,YAAY,SAAS,MAAM;AAEnD,MAAI;AACF,UAAM,YAAY,MAAM,OAAO,UAAU;AACvC,YAAM,EAAE,MAAM,SAAS,IAAI;AAE3B,UAAI,SAAS,UAAU;AACrB,YAAI,kCAAsB,QAAQ,EAAE;AACpC,YAAI;AACF,gBAAM,SAAS,aAAa,QAAQ;AACpC,gBAAM,WAAW,IAAI,gBAAgB,SAAS,MAAM;AACpD,gBAAM,SAAS,WAAW,QAAQ;AAClC,cAAI,kBAAa,QAAQ,aAAa;AAAA,QACxC,SAAS,OAAO;AACd,cAAI,oBAAoB,QAAQ,KAAK,KAAK,IAAI,SAAS;AAAA,QACzD;AAAA,MACF,OAAO;AACL,cAAM,SAAS,SAAS,QAAQ,UAAU;AAC1C,YAAI,kBAAW,MAAM,KAAK,QAAQ,EAAE;AACpC,wBAAgB,UAAU,UAAU,YAAY,QAAQ,EAAE,QAAQ,CAAC,EAChE,MAAM,CAAC,UAAU,IAAI,qBAAqB,QAAQ,KAAK,KAAK,IAAI,SAAS,CAAC;AAAA,MAC/E;AAAA,IACF,CAAC;AAED,QAAI,0CAAqC,YAAY,gBAAgB,EAAE,MAAM,SAAS;AACtF,WAAO;AAAA,EACT,SAAS,OAAO;AACd,QAAI,iCAAiC,KAAK,IAAI,SAAS;AACvD,WAAO;AAAA,EACT;AACF;AAKA,SAAS,wBACP,QACA,aACA,KACM;AACN,SAAO,kBAAkB,uBAAuB,OAAO,YAAY;AACjE,UAAM,EAAE,MAAM,WAAW,KAAK,IAAI,QAAQ;AAC1C,QAAI,uBAAuB,IAAI,EAAE;AAEjC,UAAM,UAAU,aAAa,IAAI;AACjC,QAAI,CAAC,SAAS;AACZ,YAAM,QAAQ,IAAI;AAAA,QAChB,iBAAiB,IAAI;AAAA;AAAA,QAErB,EAAE,eAAe,MAAM,gBAAgB,MAAM,IAAI,OAAK,EAAE,IAAI,EAAE;AAAA,QAC9D;AAAA,QAAU;AAAA,QAAO;AAAA,MACnB;AACA,aAAO,EAAE,SAAS,MAAM,SAAS,CAAC,EAAE,MAAM,QAAiB,MAAM,KAAK,UAAU,MAAM,OAAO,GAAG,MAAM,CAAC,EAAE,CAAC,EAAE;AAAA,IAC9G;AAEA,QAAI;AACF,aAAO,MAAM,QAAQ,MAAM,WAAW;AAAA,IACxC,SAAS,OAAO;AACd,UAAI,iBAAiB,WAAW;AAC9B,eAAO,EAAE,SAAS,MAAM,SAAS,CAAC,EAAE,MAAM,QAAiB,MAAM,KAAK,UAAU,MAAM,OAAO,GAAG,MAAM,CAAC,EAAE,CAAC,EAAE;AAAA,MAC9G;AACA,cAAQ,MAAM,uCAAuC,IAAI,KAAK,KAAK;AACnE,aAAO;AAAA,QACL,SAAS;AAAA,QACT,SAAS,CAAC;AAAA,UACR,MAAM;AAAA,UACN,MAAM,KAAK,UAAU,EAAE,OAAO,iBAAiB,QAAQ,MAAM,UAAU,iBAAiB,6CAAoC,MAAM,KAAK,GAAG,MAAM,CAAC;AAAA,QACnJ,CAAC;AAAA,MACH;AAAA,IACF;AAAA,EACF,CAAC;AACH;AAEA,eAAsB,eAAe,SAA0C;AAC7E,QAAM,EAAE,SAAS,SAAS,MAAM,IAAI;AAGpC,QAAM,WAAkB,CAAC,SAAS,QAAQ,WAAW;AACnD,QAAI,WAAW,UAAU,aAAa,UAAU,SAAS;AACvD,cAAQ,MAAM,eAAe,KAAK,KAAK,OAAO,EAAE;AAAA,IAClD;AAAA,EACF;AAEA,WAAS,4BAA4B;AAGrC,QAAM,EAAE,YAAY,SAAS,IAAI,MAAM,mBAAmB,SAAS,QAAQ,EAAE,MAAM,WAAS;AAC1F,YAAQ,MAAM,yBAAyB,KAAK,EAAE;AAC9C,YAAQ,KAAK,CAAC;AAAA,EAChB,CAAC;AAGD,QAAM,SAAS,IAAI;AAAA,IACjB,EAAE,MAAM,QAAQ,SAASF,aAAY,QAAQ;AAAA,IAC7C,EAAE,cAAc,EAAE,OAAO,CAAC,GAAG,SAAS,CAAC,EAAE,EAAE;AAAA,EAC7C;AAKA,QAAM,MAAa,CAAC,SAAS,QAAkB,WAAW;AACxD,QAAI,WAAW,UAAU,aAAa,UAAU,SAAS;AACvD,aAAO,mBAAmB;AAAA,QACxB;AAAA,QACA,QAAQ;AAAA,QACR,MAAM;AAAA,MACR,CAAC,EAAE,MAAM,MAAM;AAEb,gBAAQ,MAAM,eAAe,KAAK,KAAK,OAAO,EAAE;AAAA,MAClD,CAAC;AAAA,IACH;AAAA,EACF;AAEA,SAAO,kBAAkB,wBAAwB,aAAa,EAAE,MAAM,EAAE;AAGxE,QAAM,oBAAoB,YAAY;AACpC,QAAI;AACF,UAAI,MAAM,SAAS,aAAa,GAAG;AACjC,YAAI,wCAAwC;AAC5C,cAAM,SAAS,UAAU;AAAA,MAC3B;AAAA,IACF,SAAS,OAAO;AACd,UAAI,yBAAyB,KAAK,IAAI,SAAS;AAAA,IACjD;AAAA,EACF;AAEA,QAAM,mBAAmB,OAAO;AAAA,IAC9B,cAAc,SAAS,kBAAkB;AAAA,IACzC,WAAW,SAAS,eAAe;AAAA,EACrC;AAEA,QAAM,uBAAuB,YAAY,mBAAmB,yBAAyB;AAGrF,QAAM,SAAS,MAAM,cAAc,KAAK,OAAO;AAC/C,QAAM,cAA2B,EAAE,UAAU,YAAY,QAAQ,SAAS,KAAK,mBAAmB,iBAAiB;AAGnH,0BAAwB,QAAQ,aAAa,GAAG;AAChD,QAAM,mBAAmB,UAAU,QAAQ,SAAS,GAAG;AACvD,QAAM,EAAE,gBAAgB,IAAI,MAAM,kBAAkB,QAAQ,SAAS,UAAU,YAAY,SAAS,GAAG;AACvG,QAAM,cAAc,MAAM,kBAAkB,OAAO,QAAQ,SAAS,UAAU,YAAY,SAAS,GAAG;AAGtG,QAAM,UAAU,YAAY;AAC1B,QAAI,6BAA6B;AACjC,kBAAc,oBAAoB;AAClC,QAAI,gBAAiB,eAAc,eAAe;AAClD,QAAI,YAAa,OAAM,YAAY,KAAK;AACxC,YAAQ,KAAK,CAAC;AAAA,EAChB;AAEA,UAAQ,GAAG,UAAU,OAAO;AAC5B,UAAQ,GAAG,WAAW,OAAO;AAG7B,QAAM,YAAY,IAAI,qBAAqB;AAC3C,YAAU,UAAU,MAAM;AAAE,QAAI,kBAAkB;AAAG,YAAQ,EAAE,MAAM,MAAM,QAAQ,KAAK,CAAC,CAAC;AAAA,EAAG;AAC7F,YAAU,UAAU,CAAC,UAAU,IAAI,oBAAoB,KAAK,EAAE;AAE9D,QAAM,OAAO,QAAQ,SAAS;AAC9B,MAAI,2CAA2C;AACjD;;;AD1UA,eAAsB,aAAa,SAA+E;AAChH,QAAM,UAAU,QAAQ,OAAOG,OAAK,QAAQ,QAAQ,IAAI,IAAI,QAAQ,IAAI;AAExE,MAAI;AAEF,QAAI,QAAQ,MAAM;AAChB,UAAI;AACF,cAAM,QAAQ,MAAMC,KAAG,KAAK,OAAO;AACnC,YAAI,CAAC,MAAM,YAAY,GAAG;AACxB,kBAAQ,MAAMC,OAAM,IAAI,0CAA0C,OAAO,EAAE,CAAC;AAC5E,kBAAQ,KAAK,CAAC;AAAA,QAChB;AAAA,MACF,SAAS,OAAO;AACd,YAAK,MAAgC,SAAS,UAAU;AACtD,kBAAQ,MAAMA,OAAM,IAAI,2CAA2C,OAAO,EAAE,CAAC;AAAA,QAC/E,WAAY,MAAgC,SAAS,UAAU;AAC7D,kBAAQ,MAAMA,OAAM,IAAI,8CAA8C,OAAO,EAAE,CAAC;AAAA,QAClF,OAAO;AACL,kBAAQ,MAAMA,OAAM,IAAI,6CAA6C,OAAO,EAAE,CAAC;AAC/E,kBAAQ,MAAMA,OAAM,IAAK,MAAgB,OAAO,CAAC;AAAA,QACnD;AACA,gBAAQ,KAAK,CAAC;AAAA,MAChB;AAAA,IACF;AAGA,eAAW;AACX,YAAQ,MAAMA,OAAM,KAAK,0BAA0B,CAAC;AAEpD,QAAI,QAAQ,MAAM;AAChB,cAAQ,MAAMA,OAAM,IAAI,iBAAiB,OAAO;AAAA,CAAI,CAAC;AAAA,IACvD;AAGA,QAAI,QAAQ,OAAO;AACjB,cAAQ,MAAMA,OAAM,OAAO,yEAA+D,CAAC;AAC3F,cAAQ,MAAMA,OAAM,IAAI,+CAA+C,CAAC;AAAA,IAC1E;AAIA,UAAM,QAAQ,QAAQ,UAAU,QAAQ,QAAQ,QAAQ,OAAO;AAE/D,UAAM,eAAe;AAAA,MACnB;AAAA,MACA,SAAS;AAAA,MACT;AAAA,IACF,CAAC;AAAA,EACH,SAAS,OAAO;AACd,YAAQ,MAAMA,OAAM,IAAI,6BAA6B,GAAG,KAAK;AAC7D,YAAQ,KAAK,CAAC;AAAA,EAChB;AACF;;;AuBvDA;AACA;AAJA,OAAOC,YAAW;AAClB,OAAOC,UAAQ;AACf,OAAOC,YAAU;;;ACFjB,OAAOC,YAAW;AAWlB,SAAS,eAAe,YAAuD;AAC7E,UAAQ,YAAY;AAAA,IAClB,KAAK;AAAa,aAAO;AAAA,IACzB,KAAK;AAAc,aAAO;AAAA,IAC1B,KAAK;AAAmB,aAAO;AAAA,IAC/B,KAAK;AAAiB,aAAO;AAAA,IAC7B;AAAS,aAAO;AAAA,EAClB;AACF;AAKA,SAAS,gBAAgB,QAAwB;AAC/C,SAAO,SAAS;AAClB;AAKA,SAAS,WAAW,SAAyB;AAC3C,MAAI,WAAW,IAAI;AACjB,UAAM,QAAQ,KAAK,MAAM,UAAU,EAAE;AACrC,UAAM,OAAO,KAAK,MAAM,UAAU,EAAE;AACpC,WAAO,OAAO,IAAI,GAAG,KAAK,KAAK,IAAI,MAAM,GAAG,KAAK;AAAA,EACnD;AACA,SAAO,GAAG,KAAK,MAAM,OAAO,CAAC;AAC/B;AAKA,SAAS,sBAAsB,WAAwC;AACrE,MAAI,CAAC,UAAU,gBAAiB,QAAO,CAAC;AAExC,QAAM,EAAE,QAAQ,YAAY,QAAQ,KAAK,IAAI,UAAU;AACvD,QAAM,UAAU,WAAW,gBAAgB,MAAM,CAAC;AAClD,SAAO;AAAA,IACLA,OAAM,IAAI,0BAAmB,KAAK,MAAM,MAAM,EAAE,eAAe,CAAC,iBAAiB,WAAW,QAAQ,CAAC,CAAC,EAAE;AAAA,IACxGA,OAAM,IAAI,4BAAkB,OAAO,gBAAgB,KAAK,QAAQ,CAAC,CAAC,EAAE;AAAA,EACtE;AACF;AAQA,IAAM,mBAAoD;AAAA,EACxD,iBAAiB,CAAC,KAAK,YAAY;AAAA;AAAA,IAEjC,YAAY,MAAM,WAAW,GAAG;AAAA,IAChC,WAAW,WAAW,MAAM;AAAA,EAC9B;AAAA,EACA,eAAe,CAAC,KAAK,YAAY;AAAA,IAC/B,YAAY,IAAI,QAAQ,CAAC;AAAA,IACzB,WAAW,OAAO,QAAQ,CAAC;AAAA,EAC7B;AAAA,EACA,YAAY,CAAC,KAAK,YAAY;AAAA,IAC5B,YAAY,GAAG,GAAG,YAAY,GAAG;AAAA,IACjC,WAAW,OAAO,SAAS;AAAA,EAC7B;AACF;AAEA,IAAM,mBAAoC,CAAC,KAAK,YAAY;AAAA,EAC1D,YAAY,IAAI,SAAS;AAAA,EACzB,WAAW,OAAO,SAAS;AAC7B;AAKA,SAAS,oBAAoB,WAA8B,QAAyB;AAClF,QAAM,UAAU,CAAC,YAAY,QAAQ,EAAE,SAAS,UAAU,UAAU,IAChE,GAAG,UAAU,UAAU,OACvB,UAAU;AACd,SAAO,SAASA,OAAM,KAAK,OAAO,IAAI;AACxC;AAKA,SAAS,qBAAqB,UAAwC;AACpE,QAAM,WAAW,SAAS,kBAAkB,SAAS,WAAW;AAChE,MAAI,aAAa,EAAG,QAAO,CAAC;AAE5B,QAAM,QAAQ,CAACA,OAAM,IAAI,8BAAuB,QAAQ,QAAQ,aAAa,IAAI,MAAM,EAAE,EAAE,CAAC;AAE5F,MAAI,SAAS,4BAA4B;AACvC,UAAM,EAAE,mBAAmB,cAAc,IAAI,SAAS;AACtD,UAAM,KAAKA,OAAM,IAAI,mCAAmC,iBAAiB,UAAU,aAAa,EAAE,CAAC;AAAA,EACrG;AAEA,SAAO;AACT;AAKA,SAAS,qBAAqB,YAAoB,WAA2B;AAC3E,MAAI,aAAa,EAAG,QAAO;AAC3B,SAAO,GAAG,KAAK,OAAQ,aAAa,aAAa,YAAa,GAAG,CAAC;AACpE;AAKA,SAAS,gBACP,WACA,UACA,SACA,QACU;AACV,QAAM,aAAa,oBAAoB,WAAW,MAAM;AACxD,QAAM,cAAc,eAAe,UAAU,UAAU;AACvD,QAAM,YAAY,iBAAiB,UAAU,UAAU,KAAK;AAC5D,QAAM,EAAE,YAAY,mBAAmB,WAAW,iBAAiB,IAAI,UAAU,UAAU,YAAY,UAAU,SAAS;AAE1H,SAAO;AAAA,IACL,QAAQ,KAAK,UAAU,IAAI,IAAI,UAAU,SAAS,EAAE,IAAIA,OAAM,IAAI,KAAK,IAAI;AAAA,IAC3EA,OAAM,IAAI,OAAO,WAAW,KAAK,iBAAiB,gBAAgB,gBAAgB,GAAG;AAAA,IACrFA,OAAM,IAAI,qBAAW,qBAAqB,UAAU,YAAY,UAAU,SAAS,CAAC,EAAE;AAAA,IACtF,GAAG,sBAAsB,SAAS;AAAA,IAClC,GAAG,qBAAqB,QAAQ;AAAA,IAChCA,OAAM,IAAI,2BAAiB,SAAS,UAAU,YAAY,CAAC,EAAE;AAAA,IAC7D;AAAA,EACF;AACF;AAKO,SAAS,iBAAiB,QAAkC;AACjE,QAAM,QAAkB,CAAC;AAGzB,QAAM,KAAKA,OAAM,KAAK,iCAA0B,CAAC;AAGjD,QAAM,KAAKA,OAAM,KAAK,UAAU,CAAC;AACjC,QAAM,KAAKA,OAAM,IAAI,oBAAoB,IAAI,OAAO,QAAQ,cAAc,SAAS,CAAC;AACpF,QAAM,YAAY,GAAG,OAAO,QAAQ,WAAW,KAAK,SAAS,OAAO,QAAQ,WAAW,UAAU,IAAI,MAAM,EAAE;AAC7G,QAAM,cAAc,GAAG,OAAO,QAAQ,WAAW,OAAO,WAAW,OAAO,QAAQ,WAAW,YAAY,IAAI,MAAM,EAAE;AACrH,QAAM,KAAKA,OAAM,IAAI,gBAAgB,IAAI,GAAG,OAAO,QAAQ,eAAe,KAAK,SAAS,KAAK,WAAW,GAAG;AAC3G,QAAM,KAAKA,OAAM,IAAI,wBAAwB,IAAI,OAAO,QAAQ,cAAc,SAAS,CAAC;AACxF,QAAM,KAAKA,OAAM,IAAI,oBAAoB,IAAI,OAAO,QAAQ,cAAc,SAAS,CAAC;AACpF,QAAM,KAAK,EAAE;AAGb,QAAM,sBAAsB,OAAO,QAAQ,OAAO,KAAK,EACpD,OAAO,CAAC,CAAC,GAAG,IAAI,MAAM,KAAK,WAAW,SAAS,CAAC,EAChD,KAAK,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,WAAW,SAAS,EAAE,CAAC,EAAE,WAAW,MAAM;AAEjE,MAAI,oBAAoB,WAAW,GAAG;AACpC,UAAM,KAAKA,OAAM,MAAM,6BAAwB,CAAC;AAChD,WAAO,MAAM,KAAK,IAAI;AAAA,EACxB;AAGA,QAAM,SAAS,oBAAoB;AAAA,IAAQ,CAAC,CAAC,MAAM,IAAI,MACrD,KAAK,WAAW,OAAO,OAAK,EAAE,aAAa,OAAO,EAAE,IAAI,QAAM,EAAE,MAAM,GAAG,EAAE,EAAE;AAAA,EAC/E;AAEA,MAAI,OAAO,SAAS,GAAG;AACrB,UAAM,KAAKA,OAAM,IAAI,KAAK,kBAAa,CAAC;AACxC,eAAW,SAAS,QAAQ;AAC1B,YAAM,KAAK,GAAG,gBAAgB,OAAO,OAAO,MAAM,MAAM,IAAI,GAAGA,OAAM,KAAK,IAAI,CAAC;AAAA,IACjF;AAAA,EACF;AAGA,QAAM,WAAW,oBAAoB;AAAA,IAAQ,CAAC,CAAC,MAAM,IAAI,MACvD,KAAK,WAAW,OAAO,OAAK,EAAE,aAAa,SAAS,EAAE,IAAI,QAAM,EAAE,MAAM,GAAG,EAAE,EAAE;AAAA,EACjF;AAEA,MAAI,SAAS,SAAS,GAAG;AACvB,UAAM,KAAKA,OAAM,OAAO,KAAK,2BAAiB,CAAC;AAC/C,eAAW,WAAW,UAAU;AAC9B,YAAM,KAAK,GAAG,gBAAgB,SAAS,OAAO,MAAM,QAAQ,IAAI,GAAGA,OAAM,QAAQ,KAAK,CAAC;AAAA,IACzF;AAAA,EACF;AAEA,SAAO,MAAM,KAAK,IAAI;AACxB;;;AC9LO,SAAS,iBAAiB,QAAkC;AACjE,SAAO,KAAK,UAAU,QAAQ,MAAM,CAAC;AACvC;;;ACwDA,SAAS,UAAU,YAA4B;AAC7C,UAAQ,YAAY;AAAA,IAClB,KAAK;AAAa,aAAO;AAAA,IACzB,KAAK;AAAc,aAAO;AAAA,IAC1B,KAAK;AAAmB,aAAO;AAAA,IAC/B,KAAK;AAAiB,aAAO;AAAA,IAC7B;AAAS,aAAO;AAAA,EAClB;AACF;AAKO,SAAS,kBAAkB,QAAkC;AAClE,QAAM,QAAqB;AAAA,IACzB;AAAA,MACE,IAAI;AAAA,MACJ,kBAAkB;AAAA,QAChB,MAAM;AAAA,MACR;AAAA,MACA,iBAAiB;AAAA,QACf,MAAM;AAAA,MACR;AAAA,MACA,MAAM;AAAA,QACJ,MAAM;AAAA,MACR;AAAA,IACF;AAAA,IACA;AAAA,MACE,IAAI;AAAA,MACJ,kBAAkB;AAAA,QAChB,MAAM;AAAA,MACR;AAAA,MACA,iBAAiB;AAAA,QACf,MAAM;AAAA,MACR;AAAA,MACA,MAAM;AAAA,QACJ,MAAM;AAAA,MACR;AAAA,IACF;AAAA,IACA;AAAA,MACE,IAAI;AAAA,MACJ,kBAAkB;AAAA,QAChB,MAAM;AAAA,MACR;AAAA,MACA,iBAAiB;AAAA,QACf,MAAM;AAAA,MACR;AAAA,MACA,MAAM;AAAA,QACJ,MAAM;AAAA,MACR;AAAA,IACF;AAAA,IACA;AAAA,MACE,IAAI;AAAA,MACJ,kBAAkB;AAAA,QAChB,MAAM;AAAA,MACR;AAAA,MACA,iBAAiB;AAAA,QACf,MAAM;AAAA,MACR;AAAA,MACA,MAAM;AAAA,QACJ,MAAM;AAAA,MACR;AAAA,IACF;AAAA,EACF;AAEA,QAAM,UAAyB,CAAC;AAGhC,aAAW,CAAC,UAAU,QAAQ,KAAK,OAAO,QAAQ,OAAO,KAAK,GAAG;AAC/D,eAAW,aAAa,SAAS,YAAY;AAC3C,YAAM,SAAS,UAAU,UAAU,UAAU;AAE7C,cAAQ,KAAK;AAAA,QACX;AAAA,QACA,OAAO,UAAU;AAAA,QACjB,SAAS;AAAA,UACP,MAAM,GAAG,UAAU,UAAU,KAAK,UAAU,OAAO;AAAA,QACrD;AAAA,QACA,WAAW;AAAA,UACT;AAAA,YACE,kBAAkB;AAAA,cAChB,kBAAkB;AAAA,gBAChB,KAAK;AAAA,cACP;AAAA,cACA,QAAQ;AAAA,gBACN,WAAW,UAAU;AAAA,gBACrB,SAAS,UAAU;AAAA,cACrB;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,MACF,CAAC;AAAA,IACH;AAAA,EACF;AAEA,QAAM,cAA2B;AAAA,IAC/B,SAAS;AAAA,IACT,SAAS;AAAA,IACT,MAAM;AAAA,MACJ;AAAA,QACE,MAAM;AAAA,UACJ,QAAQ;AAAA,YACN,MAAM;AAAA,YACN,SAAS;AAAA,YACT,gBAAgB;AAAA,YAChB;AAAA,UACF;AAAA,QACF;AAAA,QACA;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,SAAO,KAAK,UAAU,aAAa,MAAM,CAAC;AAC5C;;;ACvKO,SAAS,aACd,QACA,QACQ;AACR,UAAQ,QAAQ;AAAA,IACd,KAAK;AACH,aAAO,iBAAiB,MAAM;AAAA,IAChC,KAAK;AACH,aAAO,kBAAkB,MAAM;AAAA,IACjC,KAAK;AAAA,IACL;AACE,aAAO,iBAAiB,MAAM;AAAA,EAClC;AACF;;;AJCA,IAAM,gBAAgB,CAAC,SAAS,SAAS;AACzC,IAAM,gBAAgB,CAAC,QAAQ,QAAQ,OAAO;AAG9C,SAAS,eAAe,QAAkC;AACxD,MAAI,UAAU,CAAC,cAAc,SAAS,MAAM,GAAG;AAC7C,YAAQ,MAAMC,OAAM,IAAI,mCAAmC,MAAM,wCAAwC,CAAC;AAC1G,YAAQ,KAAK,CAAC;AAAA,EAChB;AACF;AAGA,SAAS,eAAe,QAAsB;AAC5C,MAAI,CAAC,cAAc,SAAS,MAAM,GAAG;AACnC,YAAQ,MAAMA,OAAM,IAAI,kCAAkC,MAAM,sCAAsC,CAAC;AACvG,YAAQ,KAAK,CAAC;AAAA,EAChB;AACF;AAGA,SAAS,mBAAmB,OAA6B,SAAuB;AAC9E,MAAI,CAAC,SAAS,MAAM,WAAW,EAAG;AAElC,QAAM,eAAe,MAAM,OAAO,UAAQ;AACxC,UAAM,WAAWC,OAAK,WAAW,IAAI,IAAI,OAAOA,OAAK,KAAK,SAAS,IAAI;AACvE,WAAO,CAACC,KAAG,WAAW,QAAQ;AAAA,EAChC,CAAC;AAED,MAAI,aAAa,SAAS,GAAG;AAC3B,YAAQ,MAAMF,OAAM,IAAI,cAAc,aAAa,SAAS,IAAI,MAAM,EAAE,aAAa,CAAC;AACtF,iBAAa,QAAQ,UAAQ,QAAQ,MAAMA,OAAM,IAAI,OAAO,IAAI,EAAE,CAAC,CAAC;AACpE,YAAQ,KAAK,CAAC;AAAA,EAChB;AACF;AAGA,SAAS,oBAAoB,OAA2B,UAAiC;AACvF,MAAI,CAAC,MAAO,QAAO;AAEnB,QAAM,SAAS,SAAS,OAAO,EAAE;AACjC,MAAI,MAAM,MAAM,GAAG;AACjB,YAAQ,MAAMA,OAAM,IAAI,kBAAkB,QAAQ,WAAW,KAAK,qBAAqB,CAAC;AACxF,YAAQ,KAAK,CAAC;AAAA,EAChB;AACA,MAAI,UAAU,GAAG;AACf,YAAQ,MAAMA,OAAM,IAAI,kBAAkB,QAAQ,WAAW,KAAK,8BAA8B,CAAC;AACjG,YAAQ,KAAK,CAAC;AAAA,EAChB;AACA,SAAO;AACT;AAGA,SAAS,wBAAwB,SAAgD;AAC/E,QAAM,gBAAgB,oBAAoB,QAAQ,WAAW,aAAa;AAC1E,QAAM,qBAAqB,oBAAoB,QAAQ,qBAAqB,wBAAwB;AACpG,QAAM,oBAAoB,oBAAoB,QAAQ,oBAAoB,uBAAuB;AAEjG,SAAO;AAAA;AAAA,IAEL,YAAY,sBAAsB;AAAA,IAClC,WAAW,qBAAqB;AAAA,EAClC;AACF;AAGA,SAAS,wBAAwB,QAAuC,WAAqC;AAC3G,MAAI,UAAU,eAAe,QAAQ,UAAU,cAAc,KAAM;AAGnE,QAAM,MAAM;AAGZ,MAAI,CAAC,IAAI,YAAY;AACnB,QAAI,aAAa;AAAA,MACf,SAAS;AAAA,MACT,YAAY,EAAE,WAAW,IAAI,YAAY,GAAG;AAAA,IAC9C;AAAA,EACF,WAAW,CAAC,IAAI,WAAW,YAAY;AACrC,QAAI,WAAW,aAAa,EAAE,WAAW,IAAI,YAAY,GAAG;AAAA,EAC9D;AAGA,MAAI,UAAU,eAAe,MAAM;AACjC,QAAI,WAAW,WAAW,YAAY,UAAU;AAAA,EAClD;AACA,MAAI,UAAU,cAAc,MAAM;AAChC,QAAI,WAAW,WAAW,aAAa,UAAU;AAAA,EACnD;AACF;AAGA,eAAe,kBAAkB,UAAmC;AAClE,MAAI;AACF,UAAM,SAAS,eAAe,EAAE,OAAO,EAAE,CAAC;AAAA,EAC5C,QAAQ;AACN,YAAQ,MAAMA,OAAM,IAAI,wBAAwB,CAAC;AACjD,YAAQ,IAAIA,OAAM,OAAO,OAAO,GAAGA,OAAM,KAAK,YAAY,GAAGA,OAAM,OAAO,8BAA8B,CAAC;AACzG,YAAQ,KAAK,CAAC;AAAA,EAChB;AACF;AAKA,eAAsB,kBAAkB,SAA4B;AAClE,QAAM,UAAU,QAAQ,IAAI;AAE5B,MAAI;AAEF,mBAAe,QAAQ,MAAM;AAC7B,mBAAe,QAAQ,MAAM;AAC7B,uBAAmB,QAAQ,OAAO,OAAO;AACzC,UAAM,qBAAqB,wBAAwB,OAAO;AAG1D,UAAM,SAAS,MAAM,cAAc,KAAK,OAAO;AAC/C,UAAM,WAAW,IAAI,SAAS,OAAO;AACrC,UAAM,SAAS,WAAW;AAC1B,UAAM,kBAAkB,QAAQ;AAGhC,4BAAwB,QAAQ,kBAAkB;AAGlD,UAAM,WAAW,IAAI,mBAAmB,UAAU,MAAM;AACxD,UAAM,SAAS,MAAM,SAAS,QAAQ,QAAQ,KAAK;AACnD,YAAQ,IAAI,aAAa,QAAQ,QAAQ,MAAM,CAAC;AAGhD,QAAI,QAAQ,QAAQ;AAClB,YAAM,gBAAgB,QAAQ,WAAW,UACrC,OAAO,QAAQ,WAAW,QAAQ,IAClC,OAAO,QAAQ,kBAAkB;AACrC,UAAI,cAAe,SAAQ,KAAK,CAAC;AAAA,IACnC;AAAA,EACF,SAAS,OAAO;AACd,YAAQ,MAAMA,OAAM,IAAI,6BAA6B,GAAG,KAAK;AAC7D,YAAQ,KAAK,CAAC;AAAA,EAChB;AACF;;;AxCxJA,IAAMG,cAAaC,eAAc,YAAY,GAAG;AAChD,IAAMC,aAAYC,SAAQH,WAAU;AACpC,IAAMI,WAAUC,eAAc,YAAY,GAAG;AAE7C,IAAIC;AACJ,IAAI;AACF,EAAAA,eAAcF,SAAQG,MAAKL,YAAW,iBAAiB,CAAC;AAC1D,QAAQ;AACN,EAAAI,eAAcF,SAAQG,MAAKL,YAAW,oBAAoB,CAAC;AAC7D;AAEO,IAAM,UAAU,IAAI,QAAQ;AAEnC,QACG,KAAK,MAAM,EACX,YAAY,sDAAsD,EAClE,QAAQI,aAAY,OAAO;AAE9B,QACG,QAAQ,MAAM,EACd,YAAY,0CAA0C,EACtD,OAAO,iBAAiB,0CAA0C,EAClE,OAAO,aAAa,2CAA2C,EAC/D,OAAO,qBAAqB,oDAAoD,EAChF,OAAO,WAAW;AAErB,QACG,QAAQ,OAAO,EACf,YAAY,wCAAwC,EACpD,OAAO,eAAe,uCAAuC,EAC7D,OAAO,eAAe,8CAA8C,EACpE,OAAO,iBAAiB,uCAAuC,EAC/D,OAAO,YAAY;AAEtB,QACG,QAAQ,OAAO,EACf,YAAY,6CAA6C,EACzD,OAAO,qBAAqB,gCAAgC,MAAM,EAClE,OAAO,cAAc,wCAAwC,EAC7D,OAAO,eAAe,sDAAsD,EAC5E,OAAO,qBAAqB,yDAAyD,EACrF,OAAO,YAAY;AAEtB,QACG,QAAQ,QAAQ,EAChB,YAAY,qCAAqC,EACjD,OAAO,aAAa;AAEvB,QACG,QAAQ,YAAY,EACpB,YAAY,yBAAyB,EACrC,OAAO,sBAAsB,2BAA2B,EACxD,OAAO,mBAAmB,oCAAoC,MAAM,EACpE,OAAO,mBAAmB,8DAA8D,EACxF,OAAO,8BAA8B,+CAA+C,EACpF,OAAO,6BAA6B,8CAA8C,EAClF,OAAO,wBAAwB,sCAAsC,EACrE,OAAO,iBAAiB;;;A6ClE3B,QAAQ,MAAM;","names":["require","fs","path","fs","path","fs","path","init_version","fs","path","e","detectLanguage","search","detectLanguage","init_chunker","init_types","path","init_types","buildLegacySymbols","fs","path","init_version","path","os","crypto","init_version","fs","path","fs","path","fs","path","manifest","init_chunker","fs","path","fs","chalk","isGitAvailable","isGitRepo","GitStateTracker","init_chunker","init_version","createRequire","fileURLToPath","dirname","join","fs","path","fileURLToPath","chalk","createRequire","fileURLToPath","dirname","join","__filename","__dirname","require","packageJson","fs","path","chalk","fs","path","fs","path","path","packageJson","fs","fs","path","path","fs","tools","fs","path","path","fs","fs","path","path","fs","path","fs","__filename","fileURLToPath","__dirname","path","fs","chalk","init_version","chalk","fs","path","path","chalk","fs","chalk","VectorDB","ManifestManager","chalk","chalk","fs","path","createRequire","fileURLToPath","dirname","join","z","z","z","z","z","path","isTestFile","path","chunkFile","isTestFile","SCAN_LIMIT","path","isTestFile","RISK_ORDER","DEPENDENT_COUNT_THRESHOLDS","COMPLEXITY_THRESHOLDS","path","buildImportIndex","findDependentChunks","calculateFileComplexities","calculateOverallComplexityMetrics","calculateComplexityRiskBoost","isTestFile","RISK_ORDER","chunkFile","RISK_ORDER","__filename","fileURLToPath","__dirname","dirname","require","createRequire","packageJson","join","indexCodebase","path","fs","chalk","chalk","fs","path","chalk","chalk","path","fs","__filename","fileURLToPath","__dirname","dirname","require","createRequire","packageJson","join"]}
+{"version":3,"sources":["../src/utils/version.ts","../src/constants.ts","../src/config/schema.ts","../src/config/migration.ts","../src/config/merge.ts","../src/errors/codes.ts","../src/errors/index.ts","../src/config/service.ts","../src/git/utils.ts","../src/vectordb/version.ts","../src/indexer/scanner.ts","../src/indexer/symbol-extractor.ts","../src/indexer/ast/parser.ts","../src/indexer/ast/complexity/cyclomatic.ts","../src/indexer/ast/complexity/cognitive.ts","../src/indexer/ast/complexity/halstead.ts","../src/indexer/ast/complexity/index.ts","../src/indexer/ast/symbols.ts","../src/indexer/ast/traversers/typescript.ts","../src/indexer/ast/traversers/php.ts","../src/indexer/ast/traversers/python.ts","../src/indexer/ast/traversers/index.ts","../src/indexer/ast/chunker.ts","../src/indexer/liquid-chunker.ts","../src/indexer/json-template-chunker.ts","../src/indexer/chunker.ts","../src/embeddings/local.ts","../src/embeddings/types.ts","../src/vectordb/relevance.ts","../src/vectordb/intent-classifier.ts","../src/vectordb/boosting/types.ts","../src/vectordb/boosting/strategies.ts","../src/vectordb/boosting/composer.ts","../src/vectordb/boosting/index.ts","../src/vectordb/query.ts","../src/vectordb/batch-insert.ts","../src/vectordb/maintenance.ts","../src/vectordb/lancedb.ts","../src/indexer/manifest.ts","../src/git/tracker.ts","../src/utils/result.ts","../src/indexer/incremental.ts","../src/indexer/change-detector.ts","../src/utils/loading-messages.ts","../src/indexer/progress-tracker.ts","../src/indexer/index.ts","../src/cli/index.ts","../src/cli/init.ts","../src/utils/banner.ts","../src/config/migration-manager.ts","../src/frameworks/detector-service.ts","../src/frameworks/types.ts","../src/frameworks/nodejs/detector.ts","../src/frameworks/nodejs/config.ts","../src/frameworks/php/detector.ts","../src/frameworks/php/config.ts","../src/frameworks/laravel/detector.ts","../src/frameworks/laravel/config.ts","../src/frameworks/shopify/detector.ts","../src/frameworks/shopify/config.ts","../src/frameworks/registry.ts","../src/cli/status.ts","../src/cli/index-cmd.ts","../src/cli/serve.ts","../src/mcp/server.ts","../src/mcp/utils/zod-to-json-schema.ts","../src/mcp/schemas/search.schema.ts","../src/mcp/schemas/similarity.schema.ts","../src/mcp/schemas/file.schema.ts","../src/mcp/schemas/symbols.schema.ts","../src/mcp/schemas/dependents.schema.ts","../src/mcp/schemas/complexity.schema.ts","../src/mcp/tools.ts","../src/mcp/utils/tool-wrapper.ts","../src/mcp/handlers/semantic-search.ts","../src/mcp/handlers/find-similar.ts","../src/mcp/utils/path-matching.ts","../src/mcp/handlers/get-files-context.ts","../src/mcp/handlers/list-functions.ts","../src/mcp/handlers/get-dependents.ts","../src/mcp/handlers/get-complexity.ts","../src/insights/types.ts","../src/indexer/dependency-analyzer.ts","../src/insights/complexity-analyzer.ts","../src/mcp/handlers/index.ts","../src/watcher/index.ts","../src/cli/complexity.ts","../src/insights/formatters/text.ts","../src/insights/formatters/json.ts","../src/insights/formatters/sarif.ts","../src/insights/formatters/index.ts","../src/index.ts"],"sourcesContent":["import { createRequire } from 'module';\nimport { fileURLToPath } from 'url';\nimport { dirname, join } from 'path';\n\n/**\n * Centralized package version loader.\n * Handles different build output structures (development vs production).\n * \n * Build scenarios:\n * - Development (ts-node): src/utils/version.ts → ../package.json\n * - Production (dist): dist/utils/version.js → ../package.json\n * - Nested builds: dist/something/version.js → ../../package.json\n */\n\n// Setup require for ESM\nconst __filename = fileURLToPath(import.meta.url);\nconst __dirname = dirname(__filename);\nconst require = createRequire(import.meta.url);\n\nlet packageJson: { version: string; name?: string };\n\ntry {\n  // Try relative to current file (works in most scenarios)\n  packageJson = require(join(__dirname, '../package.json'));\n} catch {\n  try {\n    // Fallback: go up one more level (nested build output)\n    packageJson = require(join(__dirname, '../../package.json'));\n  } catch {\n    // Last resort: hardcoded fallback (should never happen in production)\n    console.warn('[Lien] Warning: Could not load package.json, using fallback version');\n    packageJson = { version: '0.0.0-unknown' };\n  }\n}\n\n/**\n * Get the current package version\n */\nexport function getPackageVersion(): string {\n  return packageJson.version;\n}\n\n/**\n * Get the full package.json (for compatibility)\n */\nexport function getPackageInfo(): { version: string; name?: string } {\n  return packageJson;\n}\n\n","/**\n * Centralized constants for the Lien project.\n * This file contains all magic numbers and configuration defaults\n * to ensure consistency across the codebase.\n */\n\nimport { getPackageVersion } from './utils/version.js';\n\n// Chunking settings\nexport const DEFAULT_CHUNK_SIZE = 75;\nexport const DEFAULT_CHUNK_OVERLAP = 10;\n\n// Concurrency and batching\nexport const DEFAULT_CONCURRENCY = 4;\nexport const DEFAULT_EMBEDDING_BATCH_SIZE = 50;\n\n// Micro-batching for event loop yielding\n// Process N embeddings at a time, then yield to event loop\n// This prevents UI freezing during CPU-intensive embedding generation\nexport const EMBEDDING_MICRO_BATCH_SIZE = 10;\n\n// Vector database batch size limits\n// Maximum batch size before splitting (prevents LanceDB errors on very large batches)\nexport const VECTOR_DB_MAX_BATCH_SIZE = 1000;\n// Minimum batch size for retry logic (stop splitting below this size)\nexport const VECTOR_DB_MIN_BATCH_SIZE = 10;\n\n// Embedding model configuration\nexport const EMBEDDING_DIMENSIONS = 384; // all-MiniLM-L6-v2\nexport const DEFAULT_EMBEDDING_MODEL = 'Xenova/all-MiniLM-L6-v2';\n\n// MCP server configuration\nexport const DEFAULT_PORT = 7133; // LIEN in leetspeak\nexport const VERSION_CHECK_INTERVAL_MS = 2000;\n\n// Git detection\nexport const DEFAULT_GIT_POLL_INTERVAL_MS = 10000; // Check every 10 seconds\n\n// File watching\nexport const DEFAULT_DEBOUNCE_MS = 1000;\n\n// Configuration version - always matches package version\n// Config format is tied to the package release that introduces it\nexport const CURRENT_CONFIG_VERSION = getPackageVersion();\n\n// Index format version - bump on ANY breaking change to indexing\n// Examples that require version bump:\n// - Chunking algorithm changes\n// - Embedding model changes (e.g., switch from all-MiniLM-L6-v2 to another model)\n// - Vector DB schema changes (new metadata fields)\n// - Metadata structure changes\n// v2: AST-based chunking + enhanced metadata (symbolName, complexity, etc.)\n// v3: Added cognitiveComplexity field to schema\n// v4: Added Halstead metrics (volume, difficulty, effort, bugs)\nexport const INDEX_FORMAT_VERSION = 4;\n\n","import {\n  DEFAULT_CHUNK_SIZE,\n  DEFAULT_CHUNK_OVERLAP,\n  DEFAULT_CONCURRENCY,\n  DEFAULT_EMBEDDING_BATCH_SIZE,\n  DEFAULT_PORT,\n  DEFAULT_GIT_POLL_INTERVAL_MS,\n  DEFAULT_DEBOUNCE_MS,\n  CURRENT_CONFIG_VERSION,\n} from '../constants.js';\n\n/**\n * Framework-specific configuration\n */\nexport interface FrameworkConfig {\n  include: string[];     // File patterns relative to framework path\n  exclude: string[];     // Exclude patterns relative to framework path\n}\n\n/**\n * Framework instance in a monorepo\n */\nexport interface FrameworkInstance {\n  name: string;          // 'nodejs', 'laravel'\n  path: string;          // '.', 'cognito-backend', 'packages/cli'\n  enabled: boolean;\n  config: FrameworkConfig;\n}\n\n/**\n * Main Lien configuration supporting monorepo setups\n */\nexport interface LienConfig {\n  version: string;\n  core: {\n    chunkSize: number;\n    chunkOverlap: number;\n    concurrency: number;\n    embeddingBatchSize: number;\n  };\n  chunking: {\n    useAST: boolean;          // Enable AST-based chunking (v0.13.0)\n    astFallback: 'line-based' | 'error';  // Fallback strategy on AST errors\n  };\n  mcp: {\n    port: number;\n    transport: 'stdio' | 'socket';\n    autoIndexOnFirstRun: boolean;\n  };\n  gitDetection: {\n    enabled: boolean;\n    pollIntervalMs: number;\n  };\n  fileWatching: {\n    enabled: boolean;\n    debounceMs: number;\n  };\n  complexity?: {\n    enabled: boolean;\n    thresholds: {\n      testPaths: number;             // 🔀 Max test paths per function (default: 15)\n      mentalLoad: number;            // 🧠 Max mental load score (default: 15)\n      timeToUnderstandMinutes?: number;  // ⏱️ Max minutes to understand (default: 60)\n      estimatedBugs?: number;            // 🐛 Max estimated bugs (default: 1.5)\n    };\n    // Severity multipliers are hardcoded: warning = 1x threshold, error = 2x threshold\n  };\n  frameworks: FrameworkInstance[];\n}\n\n/**\n * Legacy config format for backwards compatibility\n * @deprecated Use LienConfig with frameworks array instead\n */\nexport interface LegacyLienConfig {\n  version: string;\n  indexing: {\n    exclude: string[];\n    include: string[];\n    chunkSize: number;\n    chunkOverlap: number;\n    concurrency: number;\n    embeddingBatchSize: number;\n  };\n  mcp: {\n    port: number;\n    transport: 'stdio' | 'socket';\n    autoIndexOnFirstRun: boolean;\n  };\n  gitDetection: {\n    enabled: boolean;\n    pollIntervalMs: number;\n  };\n  fileWatching: {\n    enabled: boolean;\n    debounceMs: number;\n  };\n}\n\n/**\n * Type guard to check if a config is the legacy format\n * @param config - Config object to check\n * @returns True if config is LegacyLienConfig\n */\nexport function isLegacyConfig(\n  config: LienConfig | LegacyLienConfig\n): config is LegacyLienConfig {\n  return 'indexing' in config && !('frameworks' in config);\n}\n\n/**\n * Type guard to check if a config is the modern format\n * @param config - Config object to check\n * @returns True if config is LienConfig\n */\nexport function isModernConfig(\n  config: LienConfig | LegacyLienConfig\n): config is LienConfig {\n  return 'frameworks' in config;\n}\n\n/**\n * Default configuration with empty frameworks array\n * Frameworks should be detected and added via lien init\n */\nexport const defaultConfig: LienConfig = {\n  version: CURRENT_CONFIG_VERSION,\n  core: {\n    chunkSize: DEFAULT_CHUNK_SIZE,\n    chunkOverlap: DEFAULT_CHUNK_OVERLAP,\n    concurrency: DEFAULT_CONCURRENCY,\n    embeddingBatchSize: DEFAULT_EMBEDDING_BATCH_SIZE,\n  },\n  chunking: {\n    useAST: true,              // AST-based chunking enabled by default (v0.13.0)\n    astFallback: 'line-based', // Fallback to line-based on errors\n  },\n  mcp: {\n    port: DEFAULT_PORT,\n    transport: 'stdio',\n    autoIndexOnFirstRun: true,\n  },\n  gitDetection: {\n    enabled: true,\n    pollIntervalMs: DEFAULT_GIT_POLL_INTERVAL_MS,\n  },\n  fileWatching: {\n    enabled: true, // Enabled by default (fast with incremental indexing!)\n    debounceMs: DEFAULT_DEBOUNCE_MS,\n  },\n  complexity: {\n    enabled: true,\n    thresholds: {\n      testPaths: 15,            // 🔀 Max test paths per function\n      mentalLoad: 15,           // 🧠 Max mental load score\n      timeToUnderstandMinutes: 60,  // ⏱️ Functions taking >1 hour to understand\n      estimatedBugs: 1.5,           // 🐛 Functions estimated to have >1.5 bugs\n    },\n  },\n  frameworks: [], // Will be populated by lien init via framework detection\n};\n\n","import fs from 'fs/promises';\nimport path from 'path';\nimport { LienConfig, LegacyLienConfig, FrameworkInstance, defaultConfig } from './schema.js';\nimport { CURRENT_CONFIG_VERSION } from '../constants.js';\n\n/**\n * Checks if a config object needs migration from v0.2.0 to v0.3.0\n */\nexport function needsMigration(config: any): boolean {\n  // Check if config uses old structure:\n  // - Has 'indexing' field instead of 'core' and 'frameworks'\n  // - Or has no 'frameworks' field at all\n  // - Or version is explicitly set to something < 0.3.0\n  // - Or missing 'chunking' field (v0.13.0)\n  if (!config) {\n    return false;\n  }\n\n  // If missing chunking config, needs migration to v0.13.0\n  if (config.frameworks !== undefined && !config.chunking) {\n    return true;\n  }\n\n  // If it has frameworks array and chunking, it's already in new format\n  if (config.frameworks !== undefined && config.chunking !== undefined) {\n    return false;\n  }\n\n  // If it has 'indexing' field, it's the old format\n  if (config.indexing !== undefined) {\n    return true;\n  }\n\n  // If version is explicitly < 0.3.0\n  if (config.version && config.version.startsWith('0.2')) {\n    return true;\n  }\n\n  return false;\n}\n\n/**\n * Migrates a v0.2.0 config to v0.3.0+ format\n */\nexport function migrateConfig(oldConfig: Partial<LegacyLienConfig | LienConfig>): LienConfig {\n  // Start with default config structure\n  const newConfig: LienConfig = {\n    version: CURRENT_CONFIG_VERSION,\n    core: {\n      chunkSize: (oldConfig as any).indexing?.chunkSize ?? (oldConfig as any).core?.chunkSize ?? defaultConfig.core.chunkSize,\n      chunkOverlap: (oldConfig as any).indexing?.chunkOverlap ?? (oldConfig as any).core?.chunkOverlap ?? defaultConfig.core.chunkOverlap,\n      concurrency: (oldConfig as any).indexing?.concurrency ?? (oldConfig as any).core?.concurrency ?? defaultConfig.core.concurrency,\n      embeddingBatchSize: (oldConfig as any).indexing?.embeddingBatchSize ?? (oldConfig as any).core?.embeddingBatchSize ?? defaultConfig.core.embeddingBatchSize,\n    },\n    chunking: {\n      useAST: (oldConfig as any).chunking?.useAST ?? defaultConfig.chunking.useAST,\n      astFallback: (oldConfig as any).chunking?.astFallback ?? defaultConfig.chunking.astFallback,\n    },\n    mcp: {\n      port: oldConfig.mcp?.port ?? defaultConfig.mcp.port,\n      transport: oldConfig.mcp?.transport ?? defaultConfig.mcp.transport,\n      autoIndexOnFirstRun: oldConfig.mcp?.autoIndexOnFirstRun ?? defaultConfig.mcp.autoIndexOnFirstRun,\n    },\n    gitDetection: {\n      enabled: oldConfig.gitDetection?.enabled ?? defaultConfig.gitDetection.enabled,\n      pollIntervalMs: oldConfig.gitDetection?.pollIntervalMs ?? defaultConfig.gitDetection.pollIntervalMs,\n    },\n    fileWatching: {\n      enabled: oldConfig.fileWatching?.enabled ?? defaultConfig.fileWatching.enabled,\n      debounceMs: oldConfig.fileWatching?.debounceMs ?? defaultConfig.fileWatching.debounceMs,\n    },\n    frameworks: (oldConfig as any).frameworks ?? [],\n  };\n\n  // Convert old indexing config to a single \"generic\" framework (only for legacy configs)\n  if ((oldConfig as any).indexing && newConfig.frameworks.length === 0) {\n    const genericFramework: FrameworkInstance = {\n      name: 'generic',\n      path: '.',\n      enabled: true,\n      config: {\n        include: (oldConfig as any).indexing.include ?? ['**/*.{ts,tsx,js,jsx,py,php,go,rs,java,c,cpp,cs}'],\n        exclude: (oldConfig as any).indexing.exclude ?? [\n          '**/node_modules/**',\n          '**/dist/**',\n          '**/build/**',\n          '**/.git/**',\n          '**/coverage/**',\n          '**/.next/**',\n          '**/.nuxt/**',\n          '**/vendor/**',\n        ],\n      },\n    };\n\n    newConfig.frameworks.push(genericFramework);\n  } else if (newConfig.frameworks.length === 0) {\n    // No indexing config and no frameworks present, use defaults for generic framework\n    const genericFramework: FrameworkInstance = {\n      name: 'generic',\n      path: '.',\n      enabled: true,\n      config: {\n        include: ['**/*.{ts,tsx,js,jsx,py,php,go,rs,java,c,cpp,cs}'],\n        exclude: [\n          '**/node_modules/**',\n          '**/dist/**',\n          '**/build/**',\n          '**/.git/**',\n          '**/coverage/**',\n          '**/.next/**',\n          '**/.nuxt/**',\n          '**/vendor/**',\n        ],\n      },\n    };\n\n    newConfig.frameworks.push(genericFramework);\n  }\n\n  return newConfig;\n}\n\n/**\n * Migrates config file and creates backup\n */\nexport async function migrateConfigFile(rootDir: string = process.cwd()): Promise<{\n  migrated: boolean;\n  backupPath?: string;\n  config: LienConfig;\n}> {\n  const configPath = path.join(rootDir, '.lien.config.json');\n\n  try {\n    // Read existing config\n    const configContent = await fs.readFile(configPath, 'utf-8');\n    const oldConfig = JSON.parse(configContent);\n\n    // Check if migration is needed\n    if (!needsMigration(oldConfig)) {\n      return {\n        migrated: false,\n        config: oldConfig as LienConfig,\n      };\n    }\n\n    // Perform migration\n    const newConfig = migrateConfig(oldConfig);\n\n    // Create backup\n    const backupPath = `${configPath}.v0.2.0.backup`;\n    await fs.copyFile(configPath, backupPath);\n\n    // Write migrated config\n    await fs.writeFile(configPath, JSON.stringify(newConfig, null, 2) + '\\n', 'utf-8');\n\n    return {\n      migrated: true,\n      backupPath,\n      config: newConfig,\n    };\n  } catch (error) {\n    // If config doesn't exist, return default\n    if ((error as NodeJS.ErrnoException).code === 'ENOENT') {\n      return {\n        migrated: false,\n        config: defaultConfig,\n      };\n    }\n    throw error;\n  }\n}\n\n","import { LienConfig } from './schema.js';\n\n/**\n * Deep merges user config with defaults, preserving user customizations.\n * User values always take precedence over defaults.\n * \n * @param defaults - The default configuration\n * @param user - The user's partial configuration\n * @returns Complete merged configuration\n */\nexport function deepMergeConfig(defaults: LienConfig, user: Partial<LienConfig>): LienConfig {\n  return {\n    version: user.version ?? defaults.version,\n    core: {\n      ...defaults.core,\n      ...user.core,\n    },\n    chunking: {\n      ...defaults.chunking,\n      ...user.chunking,\n    },\n    mcp: {\n      ...defaults.mcp,\n      ...user.mcp,\n    },\n    gitDetection: {\n      ...defaults.gitDetection,\n      ...user.gitDetection,\n    },\n    fileWatching: {\n      ...defaults.fileWatching,\n      ...user.fileWatching,\n    },\n    complexity: user.complexity ? {\n      enabled: user.complexity.enabled ?? defaults.complexity?.enabled ?? true,\n      thresholds: {\n        ...defaults.complexity?.thresholds,\n        ...(user.complexity.thresholds || {}),\n      },\n    } : defaults.complexity,\n    frameworks: user.frameworks ?? defaults.frameworks,\n  };\n}\n\n/**\n * Detects new fields that exist in the 'after' config but not in the 'before' config.\n * Returns a list of human-readable field paths.\n * \n * @param before - The existing config (potentially missing fields)\n * @param after - The complete config with all fields\n * @returns Array of new field paths (e.g., [\"mcp.autoIndexOnFirstRun\", \"gitDetection\"])\n */\nexport function detectNewFields(before: Record<string, any>, after: Record<string, any>): string[] {\n  const newFields: string[] = [];\n\n  // Check top-level sections\n  for (const key of Object.keys(after)) {\n    if (!(key in before)) {\n      newFields.push(key);\n      continue;\n    }\n\n    // Check nested fields for object sections\n    if (typeof after[key] === 'object' && after[key] !== null && !Array.isArray(after[key])) {\n      const beforeSection = (before[key] as Record<string, any>) || {};\n      const afterSection = after[key] as Record<string, any>;\n\n      for (const nestedKey of Object.keys(afterSection)) {\n        if (!(nestedKey in beforeSection)) {\n          newFields.push(`${key}.${nestedKey}`);\n        }\n      }\n    }\n  }\n\n  return newFields;\n}\n\n","/**\n * Error codes for all Lien-specific errors.\n * Used to identify error types programmatically.\n */\nexport enum LienErrorCode {\n  // Configuration\n  CONFIG_NOT_FOUND = 'CONFIG_NOT_FOUND',\n  CONFIG_INVALID = 'CONFIG_INVALID',\n  \n  // Index\n  INDEX_NOT_FOUND = 'INDEX_NOT_FOUND',\n  INDEX_CORRUPTED = 'INDEX_CORRUPTED',\n  \n  // Embeddings\n  EMBEDDING_MODEL_FAILED = 'EMBEDDING_MODEL_FAILED',\n  EMBEDDING_GENERATION_FAILED = 'EMBEDDING_GENERATION_FAILED',\n  \n  // File System\n  FILE_NOT_FOUND = 'FILE_NOT_FOUND',\n  FILE_NOT_READABLE = 'FILE_NOT_READABLE',\n  INVALID_PATH = 'INVALID_PATH',\n  \n  // Tool Input\n  INVALID_INPUT = 'INVALID_INPUT',\n  \n  // System\n  INTERNAL_ERROR = 'INTERNAL_ERROR',\n}\n\n","import { LienErrorCode } from './codes.js';\n\n// Re-export for consumers\nexport { LienErrorCode } from './codes.js';\n\n/**\n * Severity levels for errors\n */\nexport type ErrorSeverity = 'low' | 'medium' | 'high' | 'critical';\n\n/**\n * Base error class for all Lien-specific errors\n */\nexport class LienError extends Error {\n  constructor(\n    message: string,\n    public readonly code: LienErrorCode,\n    public readonly context?: Record<string, unknown>,\n    public readonly severity: ErrorSeverity = 'medium',\n    public readonly recoverable: boolean = true,\n    public readonly retryable: boolean = false\n  ) {\n    super(message);\n    this.name = 'LienError';\n    \n    // Maintains proper stack trace for where our error was thrown (only available on V8)\n    if (Error.captureStackTrace) {\n      Error.captureStackTrace(this, this.constructor);\n    }\n  }\n  \n  /**\n   * Serialize error to JSON for MCP responses\n   */\n  toJSON() {\n    return {\n      error: this.message,\n      code: this.code,\n      severity: this.severity,\n      recoverable: this.recoverable,\n      context: this.context,\n    };\n  }\n  \n  /**\n   * Check if this error is retryable\n   */\n  isRetryable(): boolean {\n    return this.retryable;\n  }\n  \n  /**\n   * Check if this error is recoverable\n   */\n  isRecoverable(): boolean {\n    return this.recoverable;\n  }\n}\n\n/**\n * Configuration-related errors (loading, parsing, migration)\n */\nexport class ConfigError extends LienError {\n  constructor(message: string, context?: Record<string, unknown>) {\n    super(message, LienErrorCode.CONFIG_INVALID, context, 'medium', true, false);\n    this.name = 'ConfigError';\n  }\n}\n\n/**\n * Indexing-related errors (file processing, chunking)\n */\nexport class IndexingError extends LienError {\n  constructor(\n    message: string,\n    public readonly file?: string,\n    context?: Record<string, unknown>\n  ) {\n    super(message, LienErrorCode.INTERNAL_ERROR, { ...context, file }, 'medium', true, false);\n    this.name = 'IndexingError';\n  }\n}\n\n/**\n * Embedding generation errors\n */\nexport class EmbeddingError extends LienError {\n  constructor(message: string, context?: Record<string, unknown>) {\n    super(message, LienErrorCode.EMBEDDING_GENERATION_FAILED, context, 'high', true, true);\n    this.name = 'EmbeddingError';\n  }\n}\n\n/**\n * Vector database errors (connection, query, storage)\n */\nexport class DatabaseError extends LienError {\n  constructor(message: string, context?: Record<string, unknown>) {\n    super(message, LienErrorCode.INTERNAL_ERROR, context, 'high', true, true);\n    this.name = 'DatabaseError';\n  }\n}\n\n/**\n * Helper function to wrap unknown errors with context\n * @param error - Unknown error object to wrap\n * @param context - Context message describing what operation failed\n * @param additionalContext - Optional additional context data\n * @returns LienError with proper message and context\n */\nexport function wrapError(\n  error: unknown,\n  context: string,\n  additionalContext?: Record<string, unknown>\n): LienError {\n  const message = error instanceof Error ? error.message : String(error);\n  const stack = error instanceof Error ? error.stack : undefined;\n  \n  const wrappedError = new LienError(\n    `${context}: ${message}`,\n    LienErrorCode.INTERNAL_ERROR,\n    additionalContext\n  );\n  \n  // Preserve original stack trace if available\n  if (stack) {\n    wrappedError.stack = `${wrappedError.stack}\\n\\nCaused by:\\n${stack}`;\n  }\n  \n  return wrappedError;\n}\n\n/**\n * Type guard to check if an error is a LienError\n */\nexport function isLienError(error: unknown): error is LienError {\n  return error instanceof LienError;\n}\n\n/**\n * Extract error message from unknown error type\n * @param error - Unknown error object\n * @returns Error message string\n */\nexport function getErrorMessage(error: unknown): string {\n  if (error instanceof Error) {\n    return error.message;\n  }\n  return String(error);\n}\n\n/**\n * Extract stack trace from unknown error type\n * @param error - Unknown error object\n * @returns Stack trace string or undefined\n */\nexport function getErrorStack(error: unknown): string | undefined {\n  if (error instanceof Error) {\n    return error.stack;\n  }\n  return undefined;\n}\n\n","import fs from 'fs/promises';\nimport path from 'path';\nimport { LienConfig, LegacyLienConfig, defaultConfig, isLegacyConfig, isModernConfig } from './schema.js';\nimport { deepMergeConfig } from './merge.js';\nimport { needsMigration as checkNeedsMigration, migrateConfig as performMigration } from './migration.js';\nimport { ConfigError, wrapError } from '../errors/index.js';\n\n/**\n * Validation result with errors and warnings\n */\nexport interface ValidationResult {\n  valid: boolean;\n  errors: string[];\n  warnings: string[];\n}\n\n/**\n * Migration result with status and config\n */\nexport interface MigrationResult {\n  migrated: boolean;\n  backupPath?: string;\n  config: LienConfig;\n}\n\n/**\n * ConfigService encapsulates all configuration operations including\n * loading, saving, migration, and validation.\n * \n * This service provides a single point of truth for config management\n * with comprehensive error handling and validation.\n */\nexport class ConfigService {\n  private static readonly CONFIG_FILENAME = '.lien.config.json';\n  \n  /**\n   * Load configuration from the specified directory.\n   * Automatically handles migration if needed.\n   * \n   * @param rootDir - Root directory containing the config file\n   * @returns Loaded and validated configuration\n   * @throws {ConfigError} If config is invalid or cannot be loaded\n   */\n  async load(rootDir: string = process.cwd()): Promise<LienConfig> {\n    const configPath = this.getConfigPath(rootDir);\n    \n    try {\n      const configContent = await fs.readFile(configPath, 'utf-8');\n      const userConfig = JSON.parse(configContent);\n      \n      // Check if migration is needed\n      if (this.needsMigration(userConfig)) {\n        console.log('🔄 Migrating config from v0.2.0 to v0.3.0...');\n        \n        const result = await this.migrate(rootDir);\n        \n        if (result.migrated && result.backupPath) {\n          const backupFilename = path.basename(result.backupPath);\n          console.log(`✅ Migration complete! Backup saved as ${backupFilename}`);\n          console.log('📝 Your config now uses the framework-based structure.');\n        }\n        \n        return result.config;\n      }\n      \n      // Merge with defaults first\n      const mergedConfig = deepMergeConfig(defaultConfig, userConfig as Partial<LienConfig>);\n      \n      // Then validate the merged config\n      const validation = this.validate(mergedConfig);\n      if (!validation.valid) {\n        throw new ConfigError(\n          `Invalid configuration:\\n${validation.errors.join('\\n')}`,\n          { errors: validation.errors, warnings: validation.warnings }\n        );\n      }\n      \n      // Show warnings if any\n      if (validation.warnings.length > 0) {\n        console.warn('⚠️  Configuration warnings:');\n        validation.warnings.forEach(warning => console.warn(`   ${warning}`));\n      }\n      \n      return mergedConfig;\n    } catch (error) {\n      if ((error as NodeJS.ErrnoException).code === 'ENOENT') {\n        // Config doesn't exist, return defaults\n        return defaultConfig;\n      }\n      \n      if (error instanceof ConfigError) {\n        throw error;\n      }\n      \n      if (error instanceof SyntaxError) {\n        throw new ConfigError(\n          'Failed to parse config file: Invalid JSON syntax',\n          { path: configPath, originalError: error.message }\n        );\n      }\n      \n      throw wrapError(error, 'Failed to load configuration', { path: configPath });\n    }\n  }\n  \n  /**\n   * Save configuration to the specified directory.\n   * Validates the config before saving.\n   * \n   * @param rootDir - Root directory to save the config file\n   * @param config - Configuration to save\n   * @throws {ConfigError} If config is invalid or cannot be saved\n   */\n  async save(rootDir: string, config: LienConfig): Promise<void> {\n    const configPath = this.getConfigPath(rootDir);\n    \n    // Validate before saving\n    const validation = this.validate(config);\n    if (!validation.valid) {\n      throw new ConfigError(\n        `Cannot save invalid configuration:\\n${validation.errors.join('\\n')}`,\n        { errors: validation.errors }\n      );\n    }\n    \n    try {\n      const configJson = JSON.stringify(config, null, 2) + '\\n';\n      await fs.writeFile(configPath, configJson, 'utf-8');\n    } catch (error) {\n      throw wrapError(error, 'Failed to save configuration', { path: configPath });\n    }\n  }\n  \n  /**\n   * Check if a configuration file exists in the specified directory.\n   * \n   * @param rootDir - Root directory to check\n   * @returns True if config file exists\n   */\n  async exists(rootDir: string = process.cwd()): Promise<boolean> {\n    const configPath = this.getConfigPath(rootDir);\n    try {\n      await fs.access(configPath);\n      return true;\n    } catch {\n      return false;\n    }\n  }\n  \n  /**\n   * Migrate configuration from v0.2.0 to v0.3.0 format.\n   * Creates a backup of the original config file.\n   * \n   * @param rootDir - Root directory containing the config file\n   * @returns Migration result with status and new config\n   * @throws {ConfigError} If migration fails\n   */\n  async migrate(rootDir: string = process.cwd()): Promise<MigrationResult> {\n    const configPath = this.getConfigPath(rootDir);\n    \n    try {\n      // Read existing config\n      const configContent = await fs.readFile(configPath, 'utf-8');\n      const oldConfig = JSON.parse(configContent);\n      \n      // Check if migration is needed\n      if (!this.needsMigration(oldConfig)) {\n        return {\n          migrated: false,\n          config: oldConfig as LienConfig,\n        };\n      }\n      \n      // Perform migration\n      const newConfig = performMigration(oldConfig);\n      \n      // Validate migrated config\n      const validation = this.validate(newConfig);\n      if (!validation.valid) {\n        throw new ConfigError(\n          `Migration produced invalid configuration:\\n${validation.errors.join('\\n')}`,\n          { errors: validation.errors }\n        );\n      }\n      \n      // Create backup\n      const backupPath = `${configPath}.v0.2.0.backup`;\n      await fs.copyFile(configPath, backupPath);\n      \n      // Write migrated config\n      await this.save(rootDir, newConfig);\n      \n      return {\n        migrated: true,\n        backupPath,\n        config: newConfig,\n      };\n    } catch (error) {\n      if ((error as NodeJS.ErrnoException).code === 'ENOENT') {\n        return {\n          migrated: false,\n          config: defaultConfig,\n        };\n      }\n      \n      if (error instanceof ConfigError) {\n        throw error;\n      }\n      \n      throw wrapError(error, 'Configuration migration failed', { path: configPath });\n    }\n  }\n  \n  /**\n   * Check if a config object needs migration from v0.2.0 to v0.3.0.\n   * \n   * @param config - Config object to check\n   * @returns True if migration is needed\n   */\n  needsMigration(config: unknown): boolean {\n    return checkNeedsMigration(config);\n  }\n  \n  /**\n   * Validate a configuration object.\n   * Checks all constraints and returns detailed validation results.\n   * \n   * @param config - Configuration to validate\n   * @returns Validation result with errors and warnings\n   */\n  validate(config: unknown): ValidationResult {\n    const errors: string[] = [];\n    const warnings: string[] = [];\n    \n    // Type check\n    if (!config || typeof config !== 'object') {\n      return {\n        valid: false,\n        errors: ['Configuration must be an object'],\n        warnings: [],\n      };\n    }\n    \n    const cfg = config as Partial<LienConfig>;\n    \n    // Check for required top-level fields\n    if (!cfg.version) {\n      errors.push('Missing required field: version');\n    }\n    \n    // Validate based on config type\n    if (isModernConfig(cfg as LienConfig | LegacyLienConfig)) {\n      this.validateModernConfig(cfg as LienConfig, errors, warnings);\n    } else if (isLegacyConfig(cfg as LienConfig | LegacyLienConfig)) {\n      this.validateLegacyConfig(cfg as LegacyLienConfig, errors, warnings);\n    } else {\n      errors.push('Configuration format not recognized. Must have either \"frameworks\" or \"indexing\" field');\n    }\n    \n    return {\n      valid: errors.length === 0,\n      errors,\n      warnings,\n    };\n  }\n  \n  /**\n   * Validate a partial configuration object.\n   * Useful for validating user input before merging with defaults.\n   * \n   * @param config - Partial configuration to validate\n   * @returns Validation result with errors and warnings\n   */\n  validatePartial(config: Partial<LienConfig>): ValidationResult {\n    const errors: string[] = [];\n    const warnings: string[] = [];\n    \n    // Validate core settings if present\n    if (config.core) {\n      this.validateCoreConfig(config.core, errors, warnings);\n    }\n    \n    // Validate MCP settings if present\n    if (config.mcp) {\n      this.validateMCPConfig(config.mcp, errors, warnings);\n    }\n    \n    // Validate git detection settings if present\n    if (config.gitDetection) {\n      this.validateGitDetectionConfig(config.gitDetection, errors, warnings);\n    }\n    \n    // Validate file watching settings if present\n    if (config.fileWatching) {\n      this.validateFileWatchingConfig(config.fileWatching, errors, warnings);\n    }\n    \n    // Validate frameworks if present\n    if (config.frameworks) {\n      this.validateFrameworks(config.frameworks, errors, warnings);\n    }\n    \n    return {\n      valid: errors.length === 0,\n      errors,\n      warnings,\n    };\n  }\n  \n  /**\n   * Get the full path to the config file\n   */\n  private getConfigPath(rootDir: string): string {\n    return path.join(rootDir, ConfigService.CONFIG_FILENAME);\n  }\n  \n  /**\n   * Validate modern (v0.3.0+) configuration\n   */\n  private validateModernConfig(\n    config: LienConfig,\n    errors: string[],\n    warnings: string[]\n  ): void {\n    // Validate core settings\n    if (!config.core) {\n      errors.push('Missing required field: core');\n      return;\n    }\n    this.validateCoreConfig(config.core, errors, warnings);\n    \n    // Validate MCP settings\n    if (!config.mcp) {\n      errors.push('Missing required field: mcp');\n      return;\n    }\n    this.validateMCPConfig(config.mcp, errors, warnings);\n    \n    // Validate git detection settings\n    if (!config.gitDetection) {\n      errors.push('Missing required field: gitDetection');\n      return;\n    }\n    this.validateGitDetectionConfig(config.gitDetection, errors, warnings);\n    \n    // Validate file watching settings\n    if (!config.fileWatching) {\n      errors.push('Missing required field: fileWatching');\n      return;\n    }\n    this.validateFileWatchingConfig(config.fileWatching, errors, warnings);\n    \n    // Validate frameworks\n    if (!config.frameworks) {\n      errors.push('Missing required field: frameworks');\n      return;\n    }\n    this.validateFrameworks(config.frameworks, errors, warnings);\n  }\n  \n  /**\n   * Validate legacy (v0.2.0) configuration\n   */\n  private validateLegacyConfig(\n    config: LegacyLienConfig,\n    errors: string[],\n    warnings: string[]\n  ): void {\n    warnings.push('Using legacy configuration format. Consider running \"lien init\" to migrate to v0.3.0');\n    \n    // Validate indexing settings\n    if (!config.indexing) {\n      errors.push('Missing required field: indexing');\n      return;\n    }\n    \n    const { indexing } = config;\n    \n    if (typeof indexing.chunkSize !== 'number' || indexing.chunkSize <= 0) {\n      errors.push('indexing.chunkSize must be a positive number');\n    }\n    \n    if (typeof indexing.chunkOverlap !== 'number' || indexing.chunkOverlap < 0) {\n      errors.push('indexing.chunkOverlap must be a non-negative number');\n    }\n    \n    if (typeof indexing.concurrency !== 'number' || indexing.concurrency < 1 || indexing.concurrency > 16) {\n      errors.push('indexing.concurrency must be between 1 and 16');\n    }\n    \n    if (typeof indexing.embeddingBatchSize !== 'number' || indexing.embeddingBatchSize <= 0) {\n      errors.push('indexing.embeddingBatchSize must be a positive number');\n    }\n    \n    // Validate MCP settings (same for both)\n    if (config.mcp) {\n      this.validateMCPConfig(config.mcp, errors, warnings);\n    }\n  }\n  \n  /**\n   * Validate core configuration settings\n   */\n  private validateCoreConfig(\n    core: Partial<LienConfig['core']>,\n    errors: string[],\n    warnings: string[]\n  ): void {\n    if (core.chunkSize !== undefined) {\n      if (typeof core.chunkSize !== 'number' || core.chunkSize <= 0) {\n        errors.push('core.chunkSize must be a positive number');\n      } else if (core.chunkSize < 50) {\n        warnings.push('core.chunkSize is very small (<50 lines). This may result in poor search quality');\n      } else if (core.chunkSize > 500) {\n        warnings.push('core.chunkSize is very large (>500 lines). This may impact performance');\n      }\n    }\n    \n    if (core.chunkOverlap !== undefined) {\n      if (typeof core.chunkOverlap !== 'number' || core.chunkOverlap < 0) {\n        errors.push('core.chunkOverlap must be a non-negative number');\n      }\n    }\n    \n    if (core.concurrency !== undefined) {\n      if (typeof core.concurrency !== 'number' || core.concurrency < 1 || core.concurrency > 16) {\n        errors.push('core.concurrency must be between 1 and 16');\n      }\n    }\n    \n    if (core.embeddingBatchSize !== undefined) {\n      if (typeof core.embeddingBatchSize !== 'number' || core.embeddingBatchSize <= 0) {\n        errors.push('core.embeddingBatchSize must be a positive number');\n      } else if (core.embeddingBatchSize > 100) {\n        warnings.push('core.embeddingBatchSize is very large (>100). This may cause memory issues');\n      }\n    }\n  }\n  \n  /**\n   * Validate MCP configuration settings\n   */\n  private validateMCPConfig(\n    mcp: Partial<LienConfig['mcp']>,\n    errors: string[],\n    _warnings: string[]\n  ): void {\n    if (mcp.port !== undefined) {\n      if (typeof mcp.port !== 'number' || mcp.port < 1024 || mcp.port > 65535) {\n        errors.push('mcp.port must be between 1024 and 65535');\n      }\n    }\n    \n    if (mcp.transport !== undefined) {\n      if (mcp.transport !== 'stdio' && mcp.transport !== 'socket') {\n        errors.push('mcp.transport must be either \"stdio\" or \"socket\"');\n      }\n    }\n    \n    if (mcp.autoIndexOnFirstRun !== undefined) {\n      if (typeof mcp.autoIndexOnFirstRun !== 'boolean') {\n        errors.push('mcp.autoIndexOnFirstRun must be a boolean');\n      }\n    }\n  }\n  \n  /**\n   * Validate git detection configuration settings\n   */\n  private validateGitDetectionConfig(\n    gitDetection: Partial<LienConfig['gitDetection']>,\n    errors: string[],\n    _warnings: string[]\n  ): void {\n    if (gitDetection.enabled !== undefined) {\n      if (typeof gitDetection.enabled !== 'boolean') {\n        errors.push('gitDetection.enabled must be a boolean');\n      }\n    }\n    \n    if (gitDetection.pollIntervalMs !== undefined) {\n      if (typeof gitDetection.pollIntervalMs !== 'number' || gitDetection.pollIntervalMs < 100) {\n        errors.push('gitDetection.pollIntervalMs must be at least 100ms');\n      } else if (gitDetection.pollIntervalMs < 1000) {\n        _warnings.push('gitDetection.pollIntervalMs is very short (<1s). This may impact performance');\n      }\n    }\n  }\n  \n  /**\n   * Validate file watching configuration settings\n   */\n  private validateFileWatchingConfig(\n    fileWatching: Partial<LienConfig['fileWatching']>,\n    errors: string[],\n    warnings: string[]\n  ): void {\n    if (fileWatching.enabled !== undefined) {\n      if (typeof fileWatching.enabled !== 'boolean') {\n        errors.push('fileWatching.enabled must be a boolean');\n      }\n    }\n    \n    if (fileWatching.debounceMs !== undefined) {\n      if (typeof fileWatching.debounceMs !== 'number' || fileWatching.debounceMs < 0) {\n        errors.push('fileWatching.debounceMs must be a non-negative number');\n      } else if (fileWatching.debounceMs < 100) {\n        warnings.push('fileWatching.debounceMs is very short (<100ms). This may cause excessive reindexing');\n      }\n    }\n  }\n  \n  /**\n   * Validate frameworks configuration\n   */\n  private validateFrameworks(\n    frameworks: unknown[],\n    errors: string[],\n    warnings: string[]\n  ): void {\n    if (!Array.isArray(frameworks)) {\n      errors.push('frameworks must be an array');\n      return;\n    }\n    \n    frameworks.forEach((framework, index) => {\n      if (!framework || typeof framework !== 'object') {\n        errors.push(`frameworks[${index}] must be an object`);\n        return;\n      }\n      \n      const fw = framework as Partial<any>;\n      \n      // Validate required fields\n      if (!fw.name) {\n        errors.push(`frameworks[${index}] missing required field: name`);\n      }\n      \n      if (fw.path === undefined) {\n        errors.push(`frameworks[${index}] missing required field: path`);\n      } else if (typeof fw.path !== 'string') {\n        errors.push(`frameworks[${index}].path must be a string`);\n      } else if (path.isAbsolute(fw.path)) {\n        errors.push(`frameworks[${index}].path must be relative, got: ${fw.path}`);\n      }\n      \n      if (fw.enabled === undefined) {\n        errors.push(`frameworks[${index}] missing required field: enabled`);\n      } else if (typeof fw.enabled !== 'boolean') {\n        errors.push(`frameworks[${index}].enabled must be a boolean`);\n      }\n      \n      if (!fw.config) {\n        errors.push(`frameworks[${index}] missing required field: config`);\n      } else {\n        this.validateFrameworkConfig(fw.config, `frameworks[${index}].config`, errors, warnings);\n      }\n    });\n  }\n  \n  /**\n   * Validate framework-specific configuration\n   */\n  private validateFrameworkConfig(\n    config: any,\n    prefix: string,\n    errors: string[],\n    _warnings: string[]\n  ): void {\n    if (!config || typeof config !== 'object') {\n      errors.push(`${prefix} must be an object`);\n      return;\n    }\n    \n    // Validate include patterns\n    if (!Array.isArray(config.include)) {\n      errors.push(`${prefix}.include must be an array`);\n    } else {\n      config.include.forEach((pattern: unknown, i: number) => {\n        if (typeof pattern !== 'string') {\n          errors.push(`${prefix}.include[${i}] must be a string`);\n        }\n      });\n    }\n    \n    // Validate exclude patterns\n    if (!Array.isArray(config.exclude)) {\n      errors.push(`${prefix}.exclude must be an array`);\n    } else {\n      config.exclude.forEach((pattern: unknown, i: number) => {\n        if (typeof pattern !== 'string') {\n          errors.push(`${prefix}.exclude[${i}] must be a string`);\n        }\n      });\n    }\n  }\n}\n\n// Export a singleton instance for convenience\nexport const configService = new ConfigService();\n\n","import { exec } from 'child_process';\nimport { promisify } from 'util';\nimport fs from 'fs/promises';\nimport path from 'path';\n\nconst execAsync = promisify(exec);\n\n/**\n * Checks if a directory is a git repository.\n * \n * @param rootDir - Directory to check\n * @returns true if directory is a git repo, false otherwise\n */\nexport async function isGitRepo(rootDir: string): Promise<boolean> {\n  try {\n    const gitDir = path.join(rootDir, '.git');\n    await fs.access(gitDir);\n    return true;\n  } catch {\n    return false;\n  }\n}\n\n/**\n * Gets the current git branch name.\n * \n * @param rootDir - Root directory of the git repository\n * @returns Branch name (e.g., \"main\", \"feature-branch\")\n * @throws Error if not a git repo or git command fails\n */\nexport async function getCurrentBranch(rootDir: string): Promise<string> {\n  try {\n    const { stdout } = await execAsync('git rev-parse --abbrev-ref HEAD', {\n      cwd: rootDir,\n      timeout: 5000, // 5 second timeout\n    });\n    return stdout.trim();\n  } catch (error) {\n    throw new Error(`Failed to get current branch: ${error}`);\n  }\n}\n\n/**\n * Gets the current git commit SHA (HEAD).\n * \n * @param rootDir - Root directory of the git repository\n * @returns Commit SHA (full 40-character hash)\n * @throws Error if not a git repo or git command fails\n */\nexport async function getCurrentCommit(rootDir: string): Promise<string> {\n  try {\n    const { stdout } = await execAsync('git rev-parse HEAD', {\n      cwd: rootDir,\n      timeout: 5000,\n    });\n    return stdout.trim();\n  } catch (error) {\n    throw new Error(`Failed to get current commit: ${error}`);\n  }\n}\n\n/**\n * Gets the list of files that changed between two git references.\n * \n * @param rootDir - Root directory of the git repository\n * @param fromRef - Starting reference (branch name, commit SHA, or tag)\n * @param toRef - Ending reference (branch name, commit SHA, or tag)\n * @returns Array of file paths (relative to repo root) that changed\n * @throws Error if git command fails\n */\nexport async function getChangedFiles(\n  rootDir: string,\n  fromRef: string,\n  toRef: string\n): Promise<string[]> {\n  try {\n    const { stdout } = await execAsync(\n      `git diff --name-only ${fromRef}...${toRef}`,\n      {\n        cwd: rootDir,\n        timeout: 10000, // 10 second timeout for diffs\n      }\n    );\n    \n    const files = stdout\n      .trim()\n      .split('\\n')\n      .filter(Boolean)\n      .map(file => path.join(rootDir, file)); // Convert to absolute paths\n    \n    return files;\n  } catch (error) {\n    throw new Error(`Failed to get changed files: ${error}`);\n  }\n}\n\n/**\n * Gets the list of files that changed in a specific commit.\n * \n * @param rootDir - Root directory of the git repository\n * @param commitSha - Commit SHA to check\n * @returns Array of file paths (absolute) that changed in this commit\n * @throws Error if git command fails\n */\nexport async function getChangedFilesInCommit(\n  rootDir: string,\n  commitSha: string\n): Promise<string[]> {\n  try {\n    const { stdout } = await execAsync(\n      `git diff-tree --no-commit-id --name-only -r ${commitSha}`,\n      {\n        cwd: rootDir,\n        timeout: 10000,\n      }\n    );\n    \n    const files = stdout\n      .trim()\n      .split('\\n')\n      .filter(Boolean)\n      .map(file => path.join(rootDir, file)); // Convert to absolute paths\n    \n    return files;\n  } catch (error) {\n    throw new Error(`Failed to get changed files in commit: ${error}`);\n  }\n}\n\n/**\n * Gets the list of files that changed between two commits.\n * More efficient than getChangedFiles for commit-to-commit comparisons.\n * \n * @param rootDir - Root directory of the git repository\n * @param fromCommit - Starting commit SHA\n * @param toCommit - Ending commit SHA\n * @returns Array of file paths (absolute) that changed between commits\n * @throws Error if git command fails\n */\nexport async function getChangedFilesBetweenCommits(\n  rootDir: string,\n  fromCommit: string,\n  toCommit: string\n): Promise<string[]> {\n  try {\n    const { stdout } = await execAsync(\n      `git diff --name-only ${fromCommit} ${toCommit}`,\n      {\n        cwd: rootDir,\n        timeout: 10000,\n      }\n    );\n    \n    const files = stdout\n      .trim()\n      .split('\\n')\n      .filter(Boolean)\n      .map(file => path.join(rootDir, file)); // Convert to absolute paths\n    \n    return files;\n  } catch (error) {\n    throw new Error(`Failed to get changed files between commits: ${error}`);\n  }\n}\n\n/**\n * Checks if git is installed and available.\n * \n * @returns true if git is available, false otherwise\n */\nexport async function isGitAvailable(): Promise<boolean> {\n  try {\n    await execAsync('git --version', { timeout: 3000 });\n    return true;\n  } catch {\n    return false;\n  }\n}\n\n","import fs from 'fs/promises';\nimport path from 'path';\n\nconst VERSION_FILE = '.lien-index-version';\n\n/**\n * Writes a version timestamp file to mark when the index was last updated.\n * This file is used by the MCP server to detect when it needs to reconnect.\n * \n * @param indexPath - Path to the index directory\n */\nexport async function writeVersionFile(indexPath: string): Promise<void> {\n  try {\n    const versionFilePath = path.join(indexPath, VERSION_FILE);\n    const timestamp = Date.now().toString();\n    await fs.writeFile(versionFilePath, timestamp, 'utf-8');\n  } catch (error) {\n    // Don't throw - version file is a convenience feature, not critical\n    console.error(`Warning: Failed to write version file: ${error}`);\n  }\n}\n\n/**\n * Reads the version timestamp from the index directory.\n * Returns 0 if the file doesn't exist (e.g., old index).\n * \n * @param indexPath - Path to the index directory\n * @returns Version timestamp, or 0 if not found\n */\nexport async function readVersionFile(indexPath: string): Promise<number> {\n  try {\n    const versionFilePath = path.join(indexPath, VERSION_FILE);\n    const content = await fs.readFile(versionFilePath, 'utf-8');\n    const timestamp = parseInt(content.trim(), 10);\n    return isNaN(timestamp) ? 0 : timestamp;\n  } catch (error) {\n    // File doesn't exist or can't be read - treat as version 0\n    return 0;\n  }\n}\n\n","import { glob } from 'glob';\nimport ignore from 'ignore';\nimport fs from 'fs/promises';\nimport path from 'path';\nimport { ScanOptions } from './types.js';\nimport { LienConfig, FrameworkInstance } from '../config/schema.js';\n\n/**\n * Scan codebase using framework-aware configuration\n * @param rootDir - Project root directory\n * @param config - Lien configuration with frameworks\n * @returns Array of file paths relative to rootDir\n */\nexport async function scanCodebaseWithFrameworks(\n  rootDir: string,\n  config: LienConfig\n): Promise<string[]> {\n  const allFiles: string[] = [];\n  \n  // Scan each framework\n  for (const framework of config.frameworks) {\n    if (!framework.enabled) {\n      continue;\n    }\n    \n    const frameworkFiles = await scanFramework(rootDir, framework);\n    allFiles.push(...frameworkFiles);\n  }\n  \n  return allFiles;\n}\n\n/**\n * Scan files for a specific framework instance\n */\nasync function scanFramework(\n  rootDir: string,\n  framework: FrameworkInstance\n): Promise<string[]> {\n  const frameworkPath = path.join(rootDir, framework.path);\n  \n  // Load .gitignore from framework path\n  const gitignorePath = path.join(frameworkPath, '.gitignore');\n  let ig = ignore();\n  \n  try {\n    const gitignoreContent = await fs.readFile(gitignorePath, 'utf-8');\n    ig = ignore().add(gitignoreContent);\n  } catch (e) {\n    // No .gitignore in framework path, try root\n    const rootGitignorePath = path.join(rootDir, '.gitignore');\n    try {\n      const gitignoreContent = await fs.readFile(rootGitignorePath, 'utf-8');\n      ig = ignore().add(gitignoreContent);\n    } catch (e) {\n      // No .gitignore at all, that's fine\n    }\n  }\n  \n  // Add framework-specific exclusions\n  ig.add([\n    ...framework.config.exclude,\n    '.lien/**',\n  ]);\n  \n  // Find all files matching framework patterns\n  const allFiles: string[] = [];\n  \n  for (const pattern of framework.config.include) {\n    const files = await glob(pattern, {\n      cwd: frameworkPath,\n      absolute: false, // Get paths relative to framework path\n      nodir: true,\n      ignore: framework.config.exclude,\n    });\n    allFiles.push(...files);\n  }\n  \n  // Remove duplicates\n  const uniqueFiles = Array.from(new Set(allFiles));\n  \n  // Filter using ignore patterns and prefix with framework path\n  return uniqueFiles\n    .filter(file => !ig.ignores(file))\n    .map(file => {\n      // Return path relative to root: framework.path/file\n      return framework.path === '.' \n        ? file \n        : path.join(framework.path, file);\n    });\n}\n\n/**\n * Legacy scan function for backwards compatibility\n * @deprecated Use scanCodebaseWithFrameworks instead\n */\nexport async function scanCodebase(options: ScanOptions): Promise<string[]> {\n  const { rootDir, includePatterns = [], excludePatterns = [] } = options;\n  \n  // Load .gitignore\n  const gitignorePath = path.join(rootDir, '.gitignore');\n  let ig = ignore();\n  \n  try {\n    const gitignoreContent = await fs.readFile(gitignorePath, 'utf-8');\n    ig = ignore().add(gitignoreContent);\n  } catch (e) {\n    // No .gitignore, that's fine\n  }\n  \n  // Add default exclusions\n  ig.add([\n    'node_modules/**',\n    '.git/**',\n    'dist/**',\n    'build/**',\n    '*.min.js',\n    '*.min.css',\n    '.lien/**',\n    ...excludePatterns,\n  ]);\n  \n  // Determine patterns to search for\n  const patterns = includePatterns.length > 0 \n    ? includePatterns \n    : ['**/*.{ts,tsx,js,jsx,py,php,go,rs,java,cpp,c,cs,h,md,mdx}'];\n  \n  // Find all code files\n  const allFiles: string[] = [];\n  \n  for (const pattern of patterns) {\n    const files = await glob(pattern, {\n      cwd: rootDir,\n      absolute: true,\n      nodir: true,\n      ignore: ['node_modules/**', '.git/**'],\n    });\n    allFiles.push(...files);\n  }\n  \n  // Remove duplicates\n  const uniqueFiles = Array.from(new Set(allFiles));\n  \n  // Filter using ignore patterns\n  return uniqueFiles.filter(file => {\n    const relativePath = path.relative(rootDir, file);\n    return !ig.ignores(relativePath);\n  });\n}\n\nexport function detectLanguage(filepath: string): string {\n  const ext = path.extname(filepath).toLowerCase();\n  \n  const languageMap: Record<string, string> = {\n    '.ts': 'typescript',\n    '.tsx': 'typescript',\n    '.js': 'javascript',\n    '.jsx': 'javascript',\n    '.mjs': 'javascript',\n    '.cjs': 'javascript',\n    '.vue': 'vue',\n    '.py': 'python',\n    '.go': 'go',\n    '.rs': 'rust',\n    '.java': 'java',\n    '.cpp': 'cpp',\n    '.cc': 'cpp',\n    '.cxx': 'cpp',\n    '.c': 'c',\n    '.h': 'c',\n    '.hpp': 'cpp',\n    '.php': 'php',\n    '.rb': 'ruby',\n    '.swift': 'swift',\n    '.kt': 'kotlin',\n    '.cs': 'csharp',\n    '.scala': 'scala',\n    '.liquid': 'liquid',\n    '.md': 'markdown',\n    '.mdx': 'markdown',\n    '.markdown': 'markdown',\n  };\n  \n  return languageMap[ext] || 'unknown';\n}\n\n","/**\n * Symbol extraction utilities for different programming languages.\n * Extracts function, class, and interface names from code chunks for better indexing.\n */\n\nexport interface ExtractedSymbols {\n  functions: string[];\n  classes: string[];\n  interfaces: string[];\n}\n\n/**\n * Extract symbols (functions, classes, interfaces) from code content.\n * \n * @param content - The code content to extract symbols from\n * @param language - The programming language of the content\n * @returns Extracted symbols organized by type\n */\nexport function extractSymbols(\n  content: string,\n  language: string\n): ExtractedSymbols {\n  const symbols: ExtractedSymbols = {\n    functions: [],\n    classes: [],\n    interfaces: [],\n  };\n  \n  const normalizedLang = language.toLowerCase();\n  \n  switch (normalizedLang) {\n    case 'typescript':\n    case 'tsx':\n      symbols.functions = extractTSFunctions(content);\n      symbols.classes = extractTSClasses(content);\n      symbols.interfaces = extractTSInterfaces(content);\n      break;\n    \n    case 'javascript':\n    case 'jsx':\n      symbols.functions = extractJSFunctions(content);\n      symbols.classes = extractJSClasses(content);\n      break;\n    \n    case 'python':\n    case 'py':\n      symbols.functions = extractPythonFunctions(content);\n      symbols.classes = extractPythonClasses(content);\n      break;\n    \n    case 'php':\n      symbols.functions = extractPHPFunctions(content);\n      symbols.classes = extractPHPClasses(content);\n      symbols.interfaces = extractPHPInterfaces(content);\n      break;\n    \n    case 'vue':\n      // Extract from <script> blocks (handles both Options API and Composition API)\n      symbols.functions = extractVueFunctions(content);\n      symbols.classes = extractVueComponents(content);\n      break;\n    \n    case 'go':\n      symbols.functions = extractGoFunctions(content);\n      symbols.interfaces = extractGoInterfaces(content);\n      break;\n    \n    case 'java':\n      symbols.functions = extractJavaFunctions(content);\n      symbols.classes = extractJavaClasses(content);\n      symbols.interfaces = extractJavaInterfaces(content);\n      break;\n    \n    case 'csharp':\n    case 'cs':\n      symbols.functions = extractCSharpFunctions(content);\n      symbols.classes = extractCSharpClasses(content);\n      symbols.interfaces = extractCSharpInterfaces(content);\n      break;\n    \n    case 'ruby':\n    case 'rb':\n      symbols.functions = extractRubyFunctions(content);\n      symbols.classes = extractRubyClasses(content);\n      break;\n    \n    case 'rust':\n    case 'rs':\n      symbols.functions = extractRustFunctions(content);\n      break;\n  }\n  \n  return symbols;\n}\n\n// TypeScript / JavaScript Functions\nfunction extractTSFunctions(content: string): string[] {\n  const names = new Set<string>();\n  \n  // Regular functions: function name(...) or async function name(...)\n  const functionMatches = content.matchAll(/(?:async\\s+)?function\\s+(\\w+)\\s*\\(/g);\n  for (const match of functionMatches) {\n    names.add(match[1]);\n  }\n  \n  // Arrow functions: const/let/var name = (...) =>\n  const arrowMatches = content.matchAll(/(?:const|let|var)\\s+(\\w+)\\s*=\\s*(?:async\\s*)?\\([^)]*\\)\\s*=>/g);\n  for (const match of arrowMatches) {\n    names.add(match[1]);\n  }\n  \n  // Method definitions: name(...) { or async name(...) {\n  const methodMatches = content.matchAll(/(?:async\\s+)?(\\w+)\\s*\\([^)]*\\)\\s*[:{]/g);\n  for (const match of methodMatches) {\n    // Exclude common keywords\n    if (!['if', 'for', 'while', 'switch', 'catch'].includes(match[1])) {\n      names.add(match[1]);\n    }\n  }\n  \n  // Export function\n  const exportMatches = content.matchAll(/export\\s+(?:async\\s+)?function\\s+(\\w+)\\s*\\(/g);\n  for (const match of exportMatches) {\n    names.add(match[1]);\n  }\n  \n  return Array.from(names);\n}\n\nfunction extractJSFunctions(content: string): string[] {\n  return extractTSFunctions(content); // Same patterns\n}\n\nfunction extractTSClasses(content: string): string[] {\n  const names = new Set<string>();\n  \n  // Class declarations: class Name or export class Name\n  const classMatches = content.matchAll(/(?:export\\s+)?(?:abstract\\s+)?class\\s+(\\w+)/g);\n  for (const match of classMatches) {\n    names.add(match[1]);\n  }\n  \n  return Array.from(names);\n}\n\nfunction extractJSClasses(content: string): string[] {\n  return extractTSClasses(content); // Same patterns\n}\n\nfunction extractTSInterfaces(content: string): string[] {\n  const names = new Set<string>();\n  \n  // Interface declarations: interface Name or export interface Name\n  const interfaceMatches = content.matchAll(/(?:export\\s+)?interface\\s+(\\w+)/g);\n  for (const match of interfaceMatches) {\n    names.add(match[1]);\n  }\n  \n  // Type aliases: type Name = or export type Name =\n  const typeMatches = content.matchAll(/(?:export\\s+)?type\\s+(\\w+)\\s*=/g);\n  for (const match of typeMatches) {\n    names.add(match[1]);\n  }\n  \n  return Array.from(names);\n}\n\n// Python Functions\nfunction extractPythonFunctions(content: string): string[] {\n  const names = new Set<string>();\n  \n  // Function definitions: def name(...):\n  const functionMatches = content.matchAll(/def\\s+(\\w+)\\s*\\(/g);\n  for (const match of functionMatches) {\n    names.add(match[1]);\n  }\n  \n  // Async functions: async def name(...):\n  const asyncMatches = content.matchAll(/async\\s+def\\s+(\\w+)\\s*\\(/g);\n  for (const match of asyncMatches) {\n    names.add(match[1]);\n  }\n  \n  return Array.from(names);\n}\n\nfunction extractPythonClasses(content: string): string[] {\n  const names = new Set<string>();\n  \n  // Class definitions: class Name or class Name(Base):\n  const classMatches = content.matchAll(/class\\s+(\\w+)(?:\\s*\\(|:)/g);\n  for (const match of classMatches) {\n    names.add(match[1]);\n  }\n  \n  return Array.from(names);\n}\n\n// PHP Functions\nfunction extractPHPFunctions(content: string): string[] {\n  const names = new Set<string>();\n  \n  // Function definitions: function name(...) or public function name(...)\n  const functionMatches = content.matchAll(/(?:public|private|protected)?\\s*function\\s+(\\w+)\\s*\\(/g);\n  for (const match of functionMatches) {\n    names.add(match[1]);\n  }\n  \n  return Array.from(names);\n}\n\nfunction extractPHPClasses(content: string): string[] {\n  const names = new Set<string>();\n  \n  // Class definitions: class Name or abstract class Name\n  const classMatches = content.matchAll(/(?:abstract\\s+)?class\\s+(\\w+)/g);\n  for (const match of classMatches) {\n    names.add(match[1]);\n  }\n  \n  return Array.from(names);\n}\n\nfunction extractPHPInterfaces(content: string): string[] {\n  const names = new Set<string>();\n  \n  // Interface definitions: interface Name\n  const interfaceMatches = content.matchAll(/interface\\s+(\\w+)/g);\n  for (const match of interfaceMatches) {\n    names.add(match[1]);\n  }\n  \n  // Trait definitions: trait Name\n  const traitMatches = content.matchAll(/trait\\s+(\\w+)/g);\n  for (const match of traitMatches) {\n    names.add(match[1]);\n  }\n  \n  return Array.from(names);\n}\n\n// Go Functions\nfunction extractGoFunctions(content: string): string[] {\n  const names = new Set<string>();\n  \n  // Function definitions: func Name(...) or func (r *Receiver) Name(...)\n  const functionMatches = content.matchAll(/func\\s+(?:\\(\\w+\\s+\\*?\\w+\\)\\s+)?(\\w+)\\s*\\(/g);\n  for (const match of functionMatches) {\n    names.add(match[1]);\n  }\n  \n  return Array.from(names);\n}\n\nfunction extractGoInterfaces(content: string): string[] {\n  const names = new Set<string>();\n  \n  // Interface definitions: type Name interface {\n  const interfaceMatches = content.matchAll(/type\\s+(\\w+)\\s+interface\\s*\\{/g);\n  for (const match of interfaceMatches) {\n    names.add(match[1]);\n  }\n  \n  // Struct definitions: type Name struct {\n  const structMatches = content.matchAll(/type\\s+(\\w+)\\s+struct\\s*\\{/g);\n  for (const match of structMatches) {\n    names.add(match[1]);\n  }\n  \n  return Array.from(names);\n}\n\n// Java Functions\nfunction extractJavaFunctions(content: string): string[] {\n  const names = new Set<string>();\n  \n  // Method definitions: public/private/protected return_type name(...)\n  const methodMatches = content.matchAll(/(?:public|private|protected)\\s+(?:static\\s+)?(?:\\w+(?:<[^>]+>)?)\\s+(\\w+)\\s*\\(/g);\n  for (const match of methodMatches) {\n    names.add(match[1]);\n  }\n  \n  return Array.from(names);\n}\n\nfunction extractJavaClasses(content: string): string[] {\n  const names = new Set<string>();\n  \n  // Class definitions: public class Name or abstract class Name\n  const classMatches = content.matchAll(/(?:public\\s+)?(?:abstract\\s+)?class\\s+(\\w+)/g);\n  for (const match of classMatches) {\n    names.add(match[1]);\n  }\n  \n  return Array.from(names);\n}\n\nfunction extractJavaInterfaces(content: string): string[] {\n  const names = new Set<string>();\n  \n  // Interface definitions: public interface Name\n  const interfaceMatches = content.matchAll(/(?:public\\s+)?interface\\s+(\\w+)/g);\n  for (const match of interfaceMatches) {\n    names.add(match[1]);\n  }\n  \n  return Array.from(names);\n}\n\n// C# Functions\nfunction extractCSharpFunctions(content: string): string[] {\n  const names = new Set<string>();\n  \n  // Method definitions: public/private/protected return_type Name(...)\n  const methodMatches = content.matchAll(/(?:public|private|protected|internal)\\s+(?:static\\s+)?(?:async\\s+)?(?:\\w+(?:<[^>]+>)?)\\s+(\\w+)\\s*\\(/g);\n  for (const match of methodMatches) {\n    names.add(match[1]);\n  }\n  \n  return Array.from(names);\n}\n\nfunction extractCSharpClasses(content: string): string[] {\n  const names = new Set<string>();\n  \n  // Class definitions: public class Name or abstract class Name\n  const classMatches = content.matchAll(/(?:public|internal)?\\s*(?:abstract\\s+)?class\\s+(\\w+)/g);\n  for (const match of classMatches) {\n    names.add(match[1]);\n  }\n  \n  return Array.from(names);\n}\n\nfunction extractCSharpInterfaces(content: string): string[] {\n  const names = new Set<string>();\n  \n  // Interface definitions: public interface Name\n  const interfaceMatches = content.matchAll(/(?:public|internal)?\\s*interface\\s+(\\w+)/g);\n  for (const match of interfaceMatches) {\n    names.add(match[1]);\n  }\n  \n  return Array.from(names);\n}\n\n// Ruby Functions\nfunction extractRubyFunctions(content: string): string[] {\n  const names = new Set<string>();\n  \n  // Method definitions: def name or def self.name\n  const methodMatches = content.matchAll(/def\\s+(?:self\\.)?(\\w+)/g);\n  for (const match of methodMatches) {\n    names.add(match[1]);\n  }\n  \n  return Array.from(names);\n}\n\nfunction extractRubyClasses(content: string): string[] {\n  const names = new Set<string>();\n  \n  // Class definitions: class Name or class Name < Base\n  const classMatches = content.matchAll(/class\\s+(\\w+)/g);\n  for (const match of classMatches) {\n    names.add(match[1]);\n  }\n  \n  // Module definitions: module Name\n  const moduleMatches = content.matchAll(/module\\s+(\\w+)/g);\n  for (const match of moduleMatches) {\n    names.add(match[1]);\n  }\n  \n  return Array.from(names);\n}\n\n// Rust Functions\nfunction extractRustFunctions(content: string): string[] {\n  const names = new Set<string>();\n  \n  // Function definitions: fn name(...) or pub fn name(...)\n  const functionMatches = content.matchAll(/(?:pub\\s+)?fn\\s+(\\w+)\\s*\\(/g);\n  for (const match of functionMatches) {\n    names.add(match[1]);\n  }\n  \n  // Struct definitions: struct Name {\n  const structMatches = content.matchAll(/(?:pub\\s+)?struct\\s+(\\w+)/g);\n  for (const match of structMatches) {\n    names.add(match[1]);\n  }\n  \n  // Trait definitions: trait Name {\n  const traitMatches = content.matchAll(/(?:pub\\s+)?trait\\s+(\\w+)/g);\n  for (const match of traitMatches) {\n    names.add(match[1]);\n  }\n  \n  return Array.from(names);\n}\n\n// Vue Functions\nfunction extractVueFunctions(content: string): string[] {\n  const names = new Set<string>();\n  \n  // Extract script content from Vue SFC\n  const scriptMatch = content.match(/<script[^>]*>([\\s\\S]*?)<\\/script>/);\n  if (!scriptMatch) return [];\n  \n  const scriptContent = scriptMatch[1];\n  \n  // Composition API: const/function name = ...\n  const compositionMatches = scriptContent.matchAll(/(?:const|function)\\s+(\\w+)\\s*=/g);\n  for (const match of compositionMatches) {\n    names.add(match[1]);\n  }\n  \n  // Options API methods\n  const methodMatches = scriptContent.matchAll(/(\\w+)\\s*\\([^)]*\\)\\s*{/g);\n  for (const match of methodMatches) {\n    names.add(match[1]);\n  }\n  \n  return Array.from(names);\n}\n\n// Vue Components\nfunction extractVueComponents(content: string): string[] {\n  const names = new Set<string>();\n  \n  // Extract component name from filename convention or export\n  const scriptMatch = content.match(/<script[^>]*>([\\s\\S]*?)<\\/script>/);\n  if (!scriptMatch) return [];\n  \n  const scriptContent = scriptMatch[1];\n  \n  // export default { name: 'ComponentName' }\n  const nameMatch = scriptContent.match(/name:\\s*['\"](\\w+)['\"]/);\n  if (nameMatch) {\n    names.add(nameMatch[1]);\n  }\n  \n  // defineComponent or <script setup> components\n  const defineComponentMatch = scriptContent.match(/defineComponent\\s*\\(/);\n  if (defineComponentMatch) {\n    names.add('VueComponent');\n  }\n  \n  return Array.from(names);\n}\n\n","import Parser from 'tree-sitter';\nimport TypeScript from 'tree-sitter-typescript';\nimport JavaScript from 'tree-sitter-javascript';\nimport PHPParser from 'tree-sitter-php';\nimport Python from 'tree-sitter-python';\nimport { extname } from 'path';\nimport type { ASTParseResult, SupportedLanguage } from './types.js';\n\n/**\n * Cache for parser instances to avoid recreating them\n */\nconst parserCache = new Map<SupportedLanguage, Parser>();\n\n/**\n * Tree-sitter language grammar type\n * Using any here due to type incompatibility between parser packages and tree-sitter core\n */\ntype TreeSitterLanguage = any;\n\n/**\n * Language configuration mapping\n */\nconst languageConfig: Record<SupportedLanguage, TreeSitterLanguage> = {\n  typescript: TypeScript.typescript,\n  javascript: JavaScript,\n  php: PHPParser.php, // Note: tree-sitter-php exports both 'php' (mixed HTML/PHP) and 'php_only'\n  python: Python,\n};\n\n/**\n * Get or create a cached parser instance for a language\n */\nfunction getParser(language: SupportedLanguage): Parser {\n  if (!parserCache.has(language)) {\n    const parser = new Parser();\n    const grammar = languageConfig[language];\n    \n    if (!grammar) {\n      throw new Error(`No grammar available for language: ${language}`);\n    }\n    \n    parser.setLanguage(grammar);\n    parserCache.set(language, parser);\n  }\n  \n  return parserCache.get(language)!;\n}\n\n/**\n * Detect language from file extension\n * Uses path.extname() to handle edge cases like multiple dots in filenames\n */\nexport function detectLanguage(filePath: string): SupportedLanguage | null {\n  // extname returns extension with leading dot (e.g., '.ts')\n  // Remove the dot and convert to lowercase\n  const ext = extname(filePath).slice(1).toLowerCase();\n  \n  switch (ext) {\n    case 'ts':\n    case 'tsx':\n      return 'typescript';\n    case 'js':\n    case 'jsx':\n    case 'mjs':\n    case 'cjs':\n      return 'javascript';\n    case 'php':\n      return 'php';\n    case 'py':\n      return 'python';\n    default:\n      return null;\n  }\n}\n\n/**\n * Check if a file is supported for AST parsing\n */\nexport function isASTSupported(filePath: string): boolean {\n  return detectLanguage(filePath) !== null;\n}\n\n/**\n * Parse source code into an AST using Tree-sitter\n * \n * **Known Limitation:** Tree-sitter may throw \"Invalid argument\" errors on very large files\n * (1000+ lines). This is a limitation of Tree-sitter's internal buffer handling. When this\n * occurs, callers should fall back to line-based chunking (handled automatically by chunker.ts).\n * \n * @param content - Source code to parse\n * @param language - Programming language\n * @returns Parse result with tree or error\n */\nexport function parseAST(content: string, language: SupportedLanguage): ASTParseResult {\n  try {\n    const parser = getParser(language);\n    const tree = parser.parse(content);\n    \n    // Check for parse errors (hasError is a property, not a method)\n    if (tree.rootNode.hasError) {\n      return {\n        tree,\n        error: 'Parse completed with errors',\n      };\n    }\n    \n    return { tree };\n  } catch (error) {\n    return {\n      tree: null,\n      error: error instanceof Error ? error.message : 'Unknown parse error',\n    };\n  }\n}\n\n/**\n * Clear parser cache (useful for testing)\n */\nexport function clearParserCache(): void {\n  parserCache.clear();\n}\n\n","import type Parser from 'tree-sitter';\n\n/**\n * Decision point node types for cyclomatic complexity calculation.\n * \n * These AST node types represent branch points in code flow.\n */\nconst DECISION_POINTS = [\n  // Common across languages (TypeScript/JavaScript/Python/PHP)\n  'if_statement',          // if conditions\n  'while_statement',       // while loops\n  'for_statement',         // for loops\n  'switch_case',           // switch/case statements\n  'catch_clause',          // try/catch error handling\n  'ternary_expression',    // Ternary operator (a ? b : c)\n  'binary_expression',     // For && and || logical operators\n  \n  // TypeScript/JavaScript specific\n  'do_statement',          // do...while loops\n  'for_in_statement',      // for...in loops\n  'for_of_statement',      // for...of loops\n  \n  // PHP specific\n  'foreach_statement',     // PHP foreach loops\n  \n  // Python specific\n  'elif_clause',           // Python elif (adds decision point)\n  // Note: 'else_clause' is NOT a decision point (it's the default path)\n  'except_clause',         // Python except (try/except)\n  'conditional_expression', // Python ternary (x if cond else y)\n];\n\n/**\n * Calculate cyclomatic complexity of a function\n * \n * Complexity = 1 (base) + number of decision points\n * Decision points: if, while, do...while, for, for...in, for...of, foreach, case, catch, &&, ||, ?:\n * \n * @param node - AST node to analyze (typically a function/method)\n * @returns Cyclomatic complexity score (minimum 1)\n */\nexport function calculateComplexity(node: Parser.SyntaxNode): number {\n  let complexity = 1; // Base complexity\n  \n  function traverse(n: Parser.SyntaxNode) {\n    if (DECISION_POINTS.includes(n.type)) {\n      // For binary expressions, only count && and ||\n      if (n.type === 'binary_expression') {\n        const operator = n.childForFieldName('operator');\n        if (operator && (operator.text === '&&' || operator.text === '||')) {\n          complexity++;\n        }\n      } else {\n        complexity++;\n      }\n    }\n    \n    // Traverse children\n    for (let i = 0; i < n.namedChildCount; i++) {\n      const child = n.namedChild(i);\n      if (child) traverse(child);\n    }\n  }\n  \n  traverse(node);\n  return complexity;\n}\n","import type Parser from 'tree-sitter';\n\n// Node types that increase complexity AND increment nesting for children\nconst NESTING_TYPES = new Set([\n  'if_statement', 'for_statement', 'while_statement', 'switch_statement',\n  'catch_clause', 'except_clause', 'do_statement', 'for_in_statement',\n  'for_of_statement', 'foreach_statement', 'match_statement',\n]);\n\n// Types that add complexity but DON'T nest (hybrid increments)\nconst NON_NESTING_TYPES = new Set([\n  'else_clause', 'elif_clause', 'ternary_expression', 'conditional_expression',\n]);\n\n// Lambda types that add complexity when nested\nconst LAMBDA_TYPES = new Set(['arrow_function', 'function_expression', 'lambda']);\n\n/** Traversal context passed to handlers */\ninterface TraversalContext {\n  traverse: (n: Parser.SyntaxNode, level: number, lastOp: string | null) => void;\n}\n\n/**\n * Check if node is a logical operator and return normalized form\n */\nfunction getLogicalOperator(node: Parser.SyntaxNode): string | null {\n  if (node.type !== 'binary_expression' && node.type !== 'boolean_operator') {\n    return null;\n  }\n  const operator = node.childForFieldName('operator');\n  const opText = operator?.text;\n  \n  if (opText === '&&' || opText === 'and') return '&&';\n  if (opText === '||' || opText === 'or') return '||';\n  return null;\n}\n\n/**\n * Determine nesting level for a child node based on SonarSource spec.\n */\nfunction getChildNestingLevel(\n  parent: Parser.SyntaxNode,\n  child: Parser.SyntaxNode,\n  currentLevel: number\n): number {\n  const isCondition = parent.childForFieldName('condition') === child;\n  const isElseClause = NON_NESTING_TYPES.has(child.type);\n  return (!isCondition && !isElseClause) ? currentLevel + 1 : currentLevel;\n}\n\n/**\n * Get complexity increment for nested lambda (only adds if already nested)\n */\nfunction getNestedLambdaIncrement(nodeType: string, nestingLevel: number): number {\n  return (LAMBDA_TYPES.has(nodeType) && nestingLevel > 0) ? 1 : 0;\n}\n\n/** Traverse logical operator children, passing the operator type */\nfunction traverseLogicalChildren(\n  n: Parser.SyntaxNode,\n  level: number,\n  op: string,\n  ctx: TraversalContext\n): void {\n  const operator = n.childForFieldName('operator');\n  for (let i = 0; i < n.namedChildCount; i++) {\n    const child = n.namedChild(i);\n    if (child && child !== operator) ctx.traverse(child, level, op);\n  }\n}\n\n/** Traverse nesting type children with proper nesting level adjustment */\nfunction traverseNestingChildren(\n  n: Parser.SyntaxNode,\n  level: number,\n  ctx: TraversalContext\n): void {\n  for (let i = 0; i < n.namedChildCount; i++) {\n    const child = n.namedChild(i);\n    if (child) ctx.traverse(child, getChildNestingLevel(n, child, level), null);\n  }\n}\n\n/** Traverse all children at specified level */\nfunction traverseAllChildren(\n  n: Parser.SyntaxNode,\n  level: number,\n  ctx: TraversalContext\n): void {\n  for (let i = 0; i < n.namedChildCount; i++) {\n    const child = n.namedChild(i);\n    if (child) ctx.traverse(child, level, null);\n  }\n}\n\n/**\n * Calculate cognitive complexity of a function\n * \n * Based on SonarSource's Cognitive Complexity specification:\n * - +1 for each break from linear flow (if, for, while, catch, etc.)\n * - +1 for each nesting level when inside a control structure\n * - +1 for each logical operator sequence break (a && b || c)\n * \n * @see https://www.sonarsource.com/docs/CognitiveComplexity.pdf\n * \n * @param node - AST node to analyze (typically a function/method)\n * @returns Cognitive complexity score (minimum 0)\n */\nexport function calculateCognitiveComplexity(node: Parser.SyntaxNode): number {\n  let complexity = 0;\n  const ctx: TraversalContext = { traverse };\n  \n  function traverse(n: Parser.SyntaxNode, nestingLevel: number, lastLogicalOp: string | null): void {\n    const logicalOp = getLogicalOperator(n);\n    \n    if (logicalOp) {\n      complexity += (lastLogicalOp !== logicalOp) ? 1 : 0;\n      traverseLogicalChildren(n, nestingLevel, logicalOp, ctx);\n      return;\n    }\n    \n    if (NESTING_TYPES.has(n.type)) {\n      complexity += 1 + nestingLevel;\n      traverseNestingChildren(n, nestingLevel, ctx);\n      return;\n    }\n    \n    if (NON_NESTING_TYPES.has(n.type)) {\n      complexity += 1;\n      traverseAllChildren(n, nestingLevel + 1, ctx);\n      return;\n    }\n    \n    complexity += getNestedLambdaIncrement(n.type, nestingLevel);\n    traverseAllChildren(n, nestingLevel, ctx);\n  }\n  \n  traverse(node, 0, null);\n  return complexity;\n}\n","import type Parser from 'tree-sitter';\n\n/** Raw Halstead counts from AST */\nexport interface HalsteadCounts {\n  n1: number;  // distinct operators\n  n2: number;  // distinct operands\n  N1: number;  // total operators\n  N2: number;  // total operands\n  operators: Map<string, number>;  // operator -> count\n  operands: Map<string, number>;   // operand -> count\n}\n\n/** Calculated Halstead metrics */\nexport interface HalsteadMetrics {\n  vocabulary: number;   // n = n1 + n2\n  length: number;       // N = N1 + N2\n  volume: number;       // V = N × log₂(n)\n  difficulty: number;   // D = (n1/2) × (N2/n2)\n  effort: number;       // E = D × V\n  time: number;         // T = E / 18 (seconds to understand)\n  bugs: number;         // B = V / 3000 (estimated delivered bugs)\n}\n\n/** \n * Language-specific operator symbols.\n * These are the actual text values we match against.\n */\nconst OPERATOR_SYMBOLS: Record<string, Set<string>> = {\n  typescript: new Set([\n    // Arithmetic\n    '+', '-', '*', '/', '%', '**',\n    // Comparison\n    '==', '===', '!=', '!==', '<', '>', '<=', '>=',\n    // Logical\n    '&&', '||', '!', '??',\n    // Assignment\n    '=', '+=', '-=', '*=', '/=', '%=', '**=', '&&=', '||=', '??=',\n    // Bitwise\n    '&', '|', '^', '~', '<<', '>>', '>>>',\n    '&=', '|=', '^=', '<<=', '>>=', '>>>=',\n    // Other\n    '?', ':', '.', '?.', '++', '--', '...', '=>',\n    // Brackets/parens (counted as operators)\n    '(', ')', '[', ']', '{', '}',\n  ]),\n  python: new Set([\n    // Arithmetic\n    '+', '-', '*', '/', '%', '**', '//',\n    // Comparison\n    '==', '!=', '<', '>', '<=', '>=',\n    // Logical (handled via keywords below)\n    // Assignment\n    '=', '+=', '-=', '*=', '/=', '%=', '**=', '//=',\n    '&=', '|=', '^=', '<<=', '>>=',\n    // Bitwise\n    '&', '|', '^', '~', '<<', '>>',\n    // Other\n    '.', ':', '->', '@',\n    '(', ')', '[', ']', '{', '}',\n  ]),\n  php: new Set([\n    // Arithmetic\n    '+', '-', '*', '/', '%', '**',\n    // Comparison\n    '==', '===', '!=', '!==', '<>', '<', '>', '<=', '>=', '<=>',\n    // Logical\n    '&&', '||', '!', 'and', 'or', 'xor',\n    // Assignment\n    '=', '+=', '-=', '*=', '/=', '%=', '**=', '.=',\n    '&=', '|=', '^=', '<<=', '>>=', '??=',\n    // Bitwise\n    '&', '|', '^', '~', '<<', '>>',\n    // String\n    '.',\n    // Other\n    '?', ':', '::', '->', '=>', '??', '@',\n    '(', ')', '[', ']', '{', '}',\n  ]),\n};\n\n/** \n * Language-specific operator keywords.\n * These are keywords that act as operators.\n */\nconst OPERATOR_KEYWORDS: Record<string, Set<string>> = {\n  typescript: new Set([\n    'if', 'else', 'for', 'while', 'do', 'switch', 'case', 'default',\n    'return', 'throw', 'try', 'catch', 'finally',\n    'new', 'delete', 'typeof', 'instanceof', 'in', 'of',\n    'await', 'yield', 'break', 'continue',\n    'const', 'let', 'var', 'function', 'class', 'extends', 'implements',\n    'import', 'export', 'from', 'as',\n  ]),\n  python: new Set([\n    'if', 'elif', 'else', 'for', 'while', 'match', 'case',\n    'return', 'raise', 'try', 'except', 'finally',\n    'and', 'or', 'not', 'is', 'in',\n    'await', 'yield', 'break', 'continue', 'pass',\n    'def', 'class', 'lambda', 'async',\n    'import', 'from', 'as', 'with',\n    'global', 'nonlocal', 'del', 'assert',\n  ]),\n  php: new Set([\n    'if', 'elseif', 'else', 'for', 'foreach', 'while', 'do', 'switch', 'case', 'default', 'match',\n    'return', 'throw', 'try', 'catch', 'finally',\n    'new', 'clone', 'instanceof',\n    'yield', 'break', 'continue',\n    'function', 'class', 'extends', 'implements', 'trait', 'interface',\n    'use', 'namespace', 'as',\n    'echo', 'print', 'include', 'require', 'include_once', 'require_once',\n    'global', 'static', 'const', 'public', 'private', 'protected', 'readonly',\n  ]),\n};\n\n/** \n * AST node types that represent operators (language-agnostic).\n * These are the tree-sitter node types, not the text content.\n */\nconst OPERATOR_NODE_TYPES = new Set([\n  // Expression operators\n  'binary_expression',\n  'unary_expression',\n  'update_expression',\n  'assignment_expression',\n  'augmented_assignment_expression',\n  'ternary_expression',\n  'conditional_expression',\n  \n  // Call/access operators\n  'call_expression',\n  'method_call',\n  'member_expression',\n  'subscript_expression',\n  'attribute',\n  \n  // Object/array literals ([] and {} are operators)\n  'array',\n  'object',\n  'dictionary',\n  'list',\n]);\n\n/**\n * AST node types that represent operands.\n */\nconst OPERAND_NODE_TYPES = new Set([\n  // Identifiers\n  'identifier',\n  'property_identifier',\n  'shorthand_property_identifier',\n  'variable_name',\n  'name',\n  \n  // Literals\n  'number',\n  'integer',\n  'float',\n  'string',\n  'string_fragment',\n  'template_string',\n  'true',\n  'false',\n  'null',\n  'undefined',\n  'none',\n  \n  // Special\n  'this',\n  'self',\n  'super',\n]);\n\n/**\n * Get the operator set for a language (with fallback to typescript)\n */\nfunction getOperatorSymbols(language: string): Set<string> {\n  return OPERATOR_SYMBOLS[language] || OPERATOR_SYMBOLS.typescript;\n}\n\n/**\n * Get the keyword set for a language (with fallback to typescript)\n */\nfunction getOperatorKeywords(language: string): Set<string> {\n  return OPERATOR_KEYWORDS[language] || OPERATOR_KEYWORDS.typescript;\n}\n\n/**\n * Check if a node represents an operator\n */\nfunction isOperator(node: Parser.SyntaxNode, language: string): boolean {\n  const nodeType = node.type;\n  const nodeText = node.text;\n  \n  // Check if it's an operator node type\n  if (OPERATOR_NODE_TYPES.has(nodeType)) {\n    return true;\n  }\n  \n  // Check if it's an operator symbol or keyword\n  const symbols = getOperatorSymbols(language);\n  const keywords = getOperatorKeywords(language);\n  \n  return symbols.has(nodeText) || keywords.has(nodeText);\n}\n\n/**\n * Check if a node represents an operand\n */\nfunction isOperand(node: Parser.SyntaxNode): boolean {\n  return OPERAND_NODE_TYPES.has(node.type);\n}\n\n/**\n * Get the canonical key for an operator (for counting distinct operators)\n */\nfunction getOperatorKey(node: Parser.SyntaxNode): string {\n  // For complex expressions, use the operator type\n  if (OPERATOR_NODE_TYPES.has(node.type)) {\n    // For binary/unary expressions, extract the actual operator\n    const operator = node.childForFieldName('operator');\n    if (operator) {\n      return operator.text;\n    }\n    return node.type;\n  }\n  return node.text;\n}\n\n/**\n * Get the canonical key for an operand (for counting distinct operands)\n */\nfunction getOperandKey(node: Parser.SyntaxNode): string {\n  return node.text;\n}\n\n/**\n * Sum all values in a map\n */\nfunction sumValues(map: Map<string, number>): number {\n  let sum = 0;\n  for (const count of map.values()) {\n    sum += count;\n  }\n  return sum;\n}\n\n/**\n * Count operators and operands in an AST node\n * \n * @param node - AST node to analyze (typically a function/method)\n * @param language - Programming language for language-specific handling\n * @returns HalsteadCounts with raw operator/operand counts\n */\nexport function countHalstead(node: Parser.SyntaxNode, language: string): HalsteadCounts {\n  const operators = new Map<string, number>();\n  const operands = new Map<string, number>();\n  \n  function traverse(n: Parser.SyntaxNode): void {\n    // Check if this is an operator\n    if (isOperator(n, language)) {\n      const key = getOperatorKey(n);\n      operators.set(key, (operators.get(key) || 0) + 1);\n    }\n    \n    // Check if this is an operand\n    if (isOperand(n)) {\n      const key = getOperandKey(n);\n      operands.set(key, (operands.get(key) || 0) + 1);\n    }\n    \n    // Recurse into children\n    for (const child of n.children) {\n      traverse(child);\n    }\n  }\n  \n  traverse(node);\n  \n  return {\n    n1: operators.size,\n    n2: operands.size,\n    N1: sumValues(operators),\n    N2: sumValues(operands),\n    operators,\n    operands,\n  };\n}\n\n/**\n * Calculate derived Halstead metrics from raw counts\n * \n * Formulas based on Maurice Halstead's \"Elements of Software Science\" (1977):\n * - Vocabulary (n) = n1 + n2\n * - Length (N) = N1 + N2\n * - Volume (V) = N × log₂(n) - size of implementation\n * - Difficulty (D) = (n1/2) × (N2/n2) - error-proneness\n * - Effort (E) = D × V - mental effort required\n * - Time (T) = E / 18 - seconds to understand (Stroud number)\n * - Bugs (B) = V / 3000 - estimated delivered bugs\n * \n * @param counts - Raw Halstead counts from countHalstead()\n * @returns Calculated HalsteadMetrics\n */\nexport function calculateHalsteadMetrics(counts: HalsteadCounts): HalsteadMetrics {\n  const { n1, n2, N1, N2 } = counts;\n  \n  const vocabulary = n1 + n2;\n  const length = N1 + N2;\n  \n  // Avoid log(0) and division by zero\n  const volume = vocabulary > 0 ? length * Math.log2(vocabulary) : 0;\n  const difficulty = n2 > 0 ? (n1 / 2) * (N2 / n2) : 0;\n  const effort = difficulty * volume;\n  const time = effort / 18;  // Stroud number (18 mental discriminations per second)\n  const bugs = volume / 3000;\n  \n  return {\n    vocabulary: Math.round(vocabulary),\n    length: Math.round(length),\n    volume: Math.round(volume * 100) / 100,\n    difficulty: Math.round(difficulty * 100) / 100,\n    effort: Math.round(effort),\n    time: Math.round(time),\n    bugs: Math.round(bugs * 1000) / 1000,\n  };\n}\n\n/**\n * Calculate Halstead metrics for an AST node in one call\n * \n * Convenience function that combines countHalstead and calculateHalsteadMetrics.\n * \n * @param node - AST node to analyze\n * @param language - Programming language\n * @returns Calculated HalsteadMetrics\n */\nexport function calculateHalstead(node: Parser.SyntaxNode, language: string): HalsteadMetrics {\n  const counts = countHalstead(node, language);\n  return calculateHalsteadMetrics(counts);\n}\n","/**\n * Complexity metrics module\n * \n * This module provides various code complexity metrics:\n * - Cyclomatic complexity: Counts decision points (branches) in code\n * - Cognitive complexity: Measures mental effort to understand code (SonarSource spec)\n * - Halstead metrics: Measures complexity based on operators/operands\n */\n\nexport { calculateComplexity } from './cyclomatic.js';\nexport { calculateCognitiveComplexity } from './cognitive.js';\nexport { \n  countHalstead, \n  calculateHalsteadMetrics, \n  calculateHalstead,\n} from './halstead.js';\nexport type { HalsteadCounts, HalsteadMetrics } from './halstead.js';\n","import type Parser from 'tree-sitter';\nimport type { SymbolInfo } from './types.js';\nimport { calculateComplexity } from './complexity/index.js';\n\n/**\n * Type for symbol extractor functions\n */\ntype SymbolExtractor = (\n  node: Parser.SyntaxNode,\n  content: string,\n  parentClass?: string\n) => SymbolInfo | null;\n\n/**\n * Extract function declaration info (function_declaration, function)\n */\nfunction extractFunctionInfo(\n  node: Parser.SyntaxNode,\n  content: string,\n  parentClass?: string\n): SymbolInfo | null {\n    const nameNode = node.childForFieldName('name');\n    if (!nameNode) return null;\n    \n    return {\n      name: nameNode.text,\n      type: parentClass ? 'method' : 'function',\n      startLine: node.startPosition.row + 1,\n      endLine: node.endPosition.row + 1,\n      parentClass,\n      signature: extractSignature(node, content),\n      parameters: extractParameters(node, content),\n      returnType: extractReturnType(node, content),\n      complexity: calculateComplexity(node),\n    };\n  }\n  \n/**\n * Extract arrow function or function expression info\n */\nfunction extractArrowFunctionInfo(\n  node: Parser.SyntaxNode,\n  content: string,\n  parentClass?: string\n): SymbolInfo | null {\n    // Try to find variable name for arrow functions\n    const parent = node.parent;\n    let name = 'anonymous';\n    \n    if (parent?.type === 'variable_declarator') {\n      const nameNode = parent.childForFieldName('name');\n      name = nameNode?.text || 'anonymous';\n    }\n    \n    return {\n      name,\n      type: parentClass ? 'method' : 'function',\n      startLine: node.startPosition.row + 1,\n      endLine: node.endPosition.row + 1,\n      parentClass,\n      signature: extractSignature(node, content),\n      parameters: extractParameters(node, content),\n      complexity: calculateComplexity(node),\n    };\n  }\n  \n/**\n * Extract method definition info\n */\nfunction extractMethodInfo(\n  node: Parser.SyntaxNode,\n  content: string,\n  parentClass?: string\n): SymbolInfo | null {\n    const nameNode = node.childForFieldName('name');\n    if (!nameNode) return null;\n    \n    return {\n      name: nameNode.text,\n      type: 'method',\n      startLine: node.startPosition.row + 1,\n      endLine: node.endPosition.row + 1,\n      parentClass,\n      signature: extractSignature(node, content),\n      parameters: extractParameters(node, content),\n      returnType: extractReturnType(node, content),\n      complexity: calculateComplexity(node),\n    };\n  }\n  \n/**\n * Extract class declaration info\n */\nfunction extractClassInfo(\n  node: Parser.SyntaxNode,\n  _content: string,\n  _parentClass?: string\n): SymbolInfo | null {\n    const nameNode = node.childForFieldName('name');\n    if (!nameNode) return null;\n    \n    return {\n      name: nameNode.text,\n      type: 'class',\n      startLine: node.startPosition.row + 1,\n      endLine: node.endPosition.row + 1,\n      signature: `class ${nameNode.text}`,\n    };\n  }\n  \n/**\n * Extract interface declaration info (TypeScript)\n */\nfunction extractInterfaceInfo(\n  node: Parser.SyntaxNode,\n  _content: string,\n  _parentClass?: string\n): SymbolInfo | null {\n    const nameNode = node.childForFieldName('name');\n    if (!nameNode) return null;\n    \n    return {\n      name: nameNode.text,\n      type: 'interface',\n      startLine: node.startPosition.row + 1,\n      endLine: node.endPosition.row + 1,\n      signature: `interface ${nameNode.text}`,\n    };\n  }\n\n/**\n * Extract Python function info (def and async def)\n */\nfunction extractPythonFunctionInfo(\n  node: Parser.SyntaxNode,\n  content: string,\n  parentClass?: string\n): SymbolInfo | null {\n    const nameNode = node.childForFieldName('name');\n    if (!nameNode) return null;\n    \n    return {\n      name: nameNode.text,\n      type: parentClass ? 'method' : 'function',\n      startLine: node.startPosition.row + 1,\n      endLine: node.endPosition.row + 1,\n      parentClass,\n      signature: extractSignature(node, content),\n      parameters: extractParameters(node, content),\n      complexity: calculateComplexity(node),\n    };\n  }\n\n/**\n * Extract Python class info\n */\nfunction extractPythonClassInfo(\n  node: Parser.SyntaxNode,\n  _content: string,\n  _parentClass?: string\n): SymbolInfo | null {\n    const nameNode = node.childForFieldName('name');\n    if (!nameNode) return null;\n    \n    return {\n      name: nameNode.text,\n      type: 'class',\n      startLine: node.startPosition.row + 1,\n      endLine: node.endPosition.row + 1,\n      signature: `class ${nameNode.text}`,\n    };\n  }\n  \n/**\n * Map of AST node types to their specialized extractors\n * \n * Note: There is intentional overlap in node type names across languages:\n * - 'function_definition': Used by both PHP and Python\n * - 'class_declaration': Used by TypeScript/JavaScript\n * - 'class_definition': Used by Python\n * \n * This is handled correctly because each file is parsed with its specific language parser.\n */\nconst symbolExtractors: Record<string, SymbolExtractor> = {\n  // TypeScript/JavaScript\n  'function_declaration': extractFunctionInfo,\n  'function': extractFunctionInfo,\n  'arrow_function': extractArrowFunctionInfo,\n  'function_expression': extractArrowFunctionInfo,\n  'method_definition': extractMethodInfo,\n  'class_declaration': extractClassInfo,\n  'interface_declaration': extractInterfaceInfo,\n  \n  // PHP\n  'function_definition': extractFunctionInfo,   // PHP functions (Python handled via language check in extractSymbolInfo)\n  'method_declaration': extractMethodInfo,       // PHP methods\n  \n  // Python\n  'async_function_definition': extractPythonFunctionInfo,  // Python async functions\n  'class_definition': extractPythonClassInfo,              // Python classes\n  // Note: Python regular functions use 'function_definition' (same as PHP)\n  // They are dispatched to extractPythonFunctionInfo via language check in extractSymbolInfo()\n};\n\n/**\n * Extract symbol information from an AST node using specialized extractors\n * \n * @param node - AST node to extract info from\n * @param content - Source code content\n * @param parentClass - Parent class name if this is a method\n * @param language - Programming language (for disambiguating shared node types)\n * @returns Symbol information or null\n */\nexport function extractSymbolInfo(\n  node: Parser.SyntaxNode,\n  content: string,\n  parentClass?: string,\n  language?: string\n): SymbolInfo | null {\n  // Handle ambiguous node types that are shared between languages\n  // PHP and Python both use 'function_definition', but need different extractors\n  if (node.type === 'function_definition' && language === 'python') {\n    return extractPythonFunctionInfo(node, content, parentClass);\n  }\n  \n  const extractor = symbolExtractors[node.type];\n  return extractor ? extractor(node, content, parentClass) : null;\n}\n\n/**\n * Extract function/method signature\n */\nfunction extractSignature(node: Parser.SyntaxNode, content: string): string {\n  // Get the first line of the function (up to opening brace or arrow)\n  const startLine = node.startPosition.row;\n  const lines = content.split('\\n');\n  let signature = lines[startLine] || '';\n  \n  // If signature spans multiple lines, try to get up to the opening brace\n  let currentLine = startLine;\n  while (currentLine < node.endPosition.row && !signature.includes('{') && !signature.includes('=>')) {\n    currentLine++;\n    signature += ' ' + (lines[currentLine] || '');\n  }\n  \n  // Clean up signature\n  signature = signature.split('{')[0].split('=>')[0].trim();\n  \n  // Limit length\n  if (signature.length > 200) {\n    signature = signature.substring(0, 197) + '...';\n  }\n  \n  return signature;\n}\n\n/**\n * Extract parameter list from function node\n * \n * Note: The `_content` parameter is unused in this function, but is kept for API consistency\n * with other extract functions (e.g., extractSignature).\n */\nfunction extractParameters(node: Parser.SyntaxNode, _content: string): string[] {\n  const parameters: string[] = [];\n  \n  // Find parameters node\n  const paramsNode = node.childForFieldName('parameters');\n  if (!paramsNode) return parameters;\n  \n  // Traverse parameter nodes\n  for (let i = 0; i < paramsNode.namedChildCount; i++) {\n    const param = paramsNode.namedChild(i);\n    if (param) {\n      parameters.push(param.text);\n    }\n  }\n  \n  return parameters;\n}\n\n/**\n * Extract return type from function node (TypeScript)\n * \n * Note: The `_content` parameter is unused in this function, but is kept for API consistency\n * with other extract functions (e.g., extractSignature).\n */\nfunction extractReturnType(node: Parser.SyntaxNode, _content: string): string | undefined {\n  const returnTypeNode = node.childForFieldName('return_type');\n  if (!returnTypeNode) return undefined;\n  \n  return returnTypeNode.text;\n}\n\n/**\n * Extract import statements from a file\n */\nexport function extractImports(rootNode: Parser.SyntaxNode): string[] {\n  const imports: string[] = [];\n  \n  function traverse(node: Parser.SyntaxNode) {\n    // Handle import statements (shared node type between languages)\n    if (node.type === 'import_statement') {\n      // TypeScript/JavaScript: Extract just the module path from 'source' field\n      const sourceNode = node.childForFieldName('source');\n      if (sourceNode) {\n        // TS/JS import with source field\n        const importPath = sourceNode.text.replace(/['\"]/g, '');\n        imports.push(importPath);\n      } else {\n        // Python import without source field (e.g., \"import os\")\n        const importText = node.text.split('\\n')[0];\n        imports.push(importText);\n      }\n    }\n    // Python-specific: from...import statements\n    else if (node.type === 'import_from_statement') {\n      // Python: Get the entire import line (first line only)\n      const importText = node.text.split('\\n')[0];\n      imports.push(importText);\n    }\n    \n    // Only traverse top-level nodes for imports\n    if (node === rootNode) {\n      for (let i = 0; i < node.namedChildCount; i++) {\n        const child = node.namedChild(i);\n        if (child) traverse(child);\n      }\n    }\n  }\n  \n  traverse(rootNode);\n  return imports;\n}\n","import type Parser from 'tree-sitter';\nimport type { LanguageTraverser, DeclarationFunctionInfo } from './types.js';\n\n/**\n * TypeScript/JavaScript AST traverser\n * \n * Handles TypeScript and JavaScript AST node types and traversal patterns.\n * Both languages share the same AST structure (via tree-sitter-typescript).\n */\nexport class TypeScriptTraverser implements LanguageTraverser {\n  targetNodeTypes = [\n    'function_declaration',\n    'function',\n    'interface_declaration',\n    'method_definition',\n    'lexical_declaration',    // For const/let with arrow functions\n    'variable_declaration',   // For var with functions\n  ];\n  \n  containerTypes = [\n    'class_declaration',      // We extract methods, not the class itself\n  ];\n  \n  declarationTypes = [\n    'lexical_declaration',    // const/let\n    'variable_declaration',   // var\n  ];\n  \n  functionTypes = [\n    'arrow_function',\n    'function_expression',\n    'function',\n  ];\n  \n  shouldExtractChildren(node: Parser.SyntaxNode): boolean {\n    return this.containerTypes.includes(node.type);\n  }\n  \n  isDeclarationWithFunction(node: Parser.SyntaxNode): boolean {\n    return this.declarationTypes.includes(node.type);\n  }\n  \n  getContainerBody(node: Parser.SyntaxNode): Parser.SyntaxNode | null {\n    if (node.type === 'class_declaration') {\n      return node.childForFieldName('body');\n    }\n    return null;\n  }\n  \n  shouldTraverseChildren(node: Parser.SyntaxNode): boolean {\n    return node.type === 'program' || \n           node.type === 'export_statement' ||\n           node.type === 'class_body';\n  }\n  \n  findParentContainerName(node: Parser.SyntaxNode): string | undefined {\n    let current = node.parent;\n    while (current) {\n      if (current.type === 'class_declaration') {\n        const nameNode = current.childForFieldName('name');\n        return nameNode?.text;\n      }\n      current = current.parent;\n    }\n    return undefined;\n  }\n  \n  /**\n   * Check if a declaration node contains a function (arrow, function expression, etc.)\n   */\n  findFunctionInDeclaration(node: Parser.SyntaxNode): DeclarationFunctionInfo {\n    const search = (n: Parser.SyntaxNode, depth: number): Parser.SyntaxNode | null => {\n      if (depth > 3) return null; // Don't search too deep\n      \n      if (this.functionTypes.includes(n.type)) {\n        return n;\n      }\n      \n      for (let i = 0; i < n.childCount; i++) {\n        const child = n.child(i);\n        if (child) {\n          const result = search(child, depth + 1);\n          if (result) return result;\n        }\n      }\n      \n      return null;\n    };\n    \n    const functionNode = search(node, 0);\n    return {\n      hasFunction: functionNode !== null,\n      functionNode,\n    };\n  }\n}\n\n/**\n * JavaScript uses the same traverser as TypeScript\n */\nexport class JavaScriptTraverser extends TypeScriptTraverser {}\n\n","import type Parser from 'tree-sitter';\nimport type { LanguageTraverser, DeclarationFunctionInfo } from './types.js';\n\n/**\n * PHP AST traverser\n * \n * Handles PHP AST node types and traversal patterns.\n * PHP uses tree-sitter-php grammar.\n */\nexport class PHPTraverser implements LanguageTraverser {\n  targetNodeTypes = [\n    'function_definition',      // function foo() {}\n    'method_declaration',       // public function bar() {}\n  ];\n  \n  containerTypes = [\n    'class_declaration',        // We extract methods, not the class itself\n    'trait_declaration',        // PHP traits\n    'interface_declaration',    // PHP interfaces (for interface methods)\n  ];\n  \n  declarationTypes = [\n    // PHP doesn't have arrow functions or const/let like JS\n    // Functions are always defined with 'function' keyword\n  ];\n  \n  functionTypes = [\n    'function_definition',\n    'method_declaration',\n  ];\n  \n  shouldExtractChildren(node: Parser.SyntaxNode): boolean {\n    return this.containerTypes.includes(node.type);\n  }\n  \n  isDeclarationWithFunction(_node: Parser.SyntaxNode): boolean {\n    // PHP doesn't have variable declarations with functions like JS/TS\n    // Functions are always defined with 'function' keyword\n    return false;\n  }\n  \n  getContainerBody(node: Parser.SyntaxNode): Parser.SyntaxNode | null {\n    if (node.type === 'class_declaration' || \n        node.type === 'trait_declaration' ||\n        node.type === 'interface_declaration') {\n      // In PHP, the body is called 'declaration_list'\n      return node.childForFieldName('body');\n    }\n    return null;\n  }\n  \n  shouldTraverseChildren(node: Parser.SyntaxNode): boolean {\n    return node.type === 'program' ||           // Top-level PHP file\n           node.type === 'php' ||               // PHP block\n           node.type === 'declaration_list';    // Body of class/trait/interface\n  }\n  \n  findParentContainerName(node: Parser.SyntaxNode): string | undefined {\n    let current = node.parent;\n    while (current) {\n      if (current.type === 'class_declaration' || \n          current.type === 'trait_declaration') {\n        const nameNode = current.childForFieldName('name');\n        return nameNode?.text;\n      }\n      current = current.parent;\n    }\n    return undefined;\n  }\n  \n  findFunctionInDeclaration(_node: Parser.SyntaxNode): DeclarationFunctionInfo {\n    // PHP doesn't have this pattern\n    return {\n      hasFunction: false,\n      functionNode: null,\n    };\n  }\n}\n\n","import type Parser from 'tree-sitter';\nimport type { LanguageTraverser, DeclarationFunctionInfo } from './types.js';\n\n/**\n * Python AST traverser\n * \n * Handles Python AST node types and traversal patterns.\n * Python has a simpler structure than TypeScript/JavaScript:\n * - Functions are defined with 'def' or 'async def'\n * - No variable declarations with functions (unlike JS const x = () => {})\n * - Classes contain methods (which are just functions)\n */\nexport class PythonTraverser implements LanguageTraverser {\n  targetNodeTypes = [\n    'function_definition',\n    'async_function_definition',\n  ];\n  \n  containerTypes = [\n    'class_definition',  // We extract methods, not the class itself\n  ];\n  \n  declarationTypes = [\n    // Python doesn't have const/let/var declarations like JS/TS\n    // Functions are always defined with 'def' or 'async def'\n  ];\n  \n  functionTypes = [\n    'function_definition',\n    'async_function_definition',\n  ];\n  \n  shouldExtractChildren(node: Parser.SyntaxNode): boolean {\n    return this.containerTypes.includes(node.type);\n  }\n  \n  isDeclarationWithFunction(_node: Parser.SyntaxNode): boolean {\n    // Python doesn't have variable declarations with functions like JS/TS\n    // Functions are always defined with 'def' or 'async def'\n    return false;\n  }\n  \n  getContainerBody(node: Parser.SyntaxNode): Parser.SyntaxNode | null {\n    if (node.type === 'class_definition') {\n      // In Python, the class body is called 'block'\n      return node.childForFieldName('body');\n    }\n    return null;\n  }\n  \n  shouldTraverseChildren(node: Parser.SyntaxNode): boolean {\n    return node.type === 'module' ||  // Top-level Python file\n           node.type === 'block';     // Body of class/function\n  }\n  \n  findParentContainerName(node: Parser.SyntaxNode): string | undefined {\n    let current = node.parent;\n    while (current) {\n      if (current.type === 'class_definition') {\n        const nameNode = current.childForFieldName('name');\n        return nameNode?.text;\n      }\n      current = current.parent;\n    }\n    return undefined;\n  }\n  \n  /**\n   * Python doesn't have this pattern (const x = () => {})\n   * Functions are always defined with 'def' or 'async def'\n   */\n  findFunctionInDeclaration(_node: Parser.SyntaxNode): DeclarationFunctionInfo {\n    return {\n      hasFunction: false,\n      functionNode: null,\n    };\n  }\n}\n\n","import type { SupportedLanguage } from '../types.js';\nimport type { LanguageTraverser } from './types.js';\nimport { TypeScriptTraverser, JavaScriptTraverser } from './typescript.js';\nimport { PHPTraverser } from './php.js';\nimport { PythonTraverser } from './python.js';\n\nexport type { LanguageTraverser, DeclarationFunctionInfo } from './types.js';\n\n/**\n * Registry of language traversers\n * \n * Maps each supported language to its traverser implementation.\n * When adding a new language:\n * 1. Create a new traverser class implementing LanguageTraverser\n * 2. Add it to this registry\n * 3. Update SupportedLanguage type in ../types.ts\n */\nconst traverserRegistry: Record<SupportedLanguage, LanguageTraverser> = {\n  typescript: new TypeScriptTraverser(),\n  javascript: new JavaScriptTraverser(),\n  php: new PHPTraverser(),\n  python: new PythonTraverser(),\n};\n\n/**\n * Get the traverser for a specific language\n * \n * @param language - Programming language\n * @returns Language-specific traverser\n * @throws Error if language is not supported\n */\nexport function getTraverser(language: SupportedLanguage): LanguageTraverser {\n  const traverser = traverserRegistry[language];\n  \n  if (!traverser) {\n    throw new Error(`No traverser available for language: ${language}`);\n  }\n  \n  return traverser;\n}\n\n/**\n * Check if a language has a traverser implementation\n * \n * @param language - Programming language\n * @returns True if traverser exists\n */\nexport function hasTraverser(language: SupportedLanguage): boolean {\n  return language in traverserRegistry;\n}\n\n","import type Parser from 'tree-sitter';\nimport type { ASTChunk } from './types.js';\nimport { parseAST, detectLanguage, isASTSupported } from './parser.js';\nimport { extractSymbolInfo, extractImports } from './symbols.js';\nimport { calculateCognitiveComplexity, calculateHalstead } from './complexity/index.js';\nimport { getTraverser } from './traversers/index.js';\n\nexport interface ASTChunkOptions {\n  maxChunkSize?: number; // Reserved for future use (smart splitting of large functions)\n  minChunkSize?: number;\n}\n\n/**\n * Chunk a file using AST-based semantic boundaries\n * \n * Uses Tree-sitter to parse code into an AST and extract semantic chunks\n * (functions, classes, methods) that respect code structure.\n * \n * **Known Limitations:**\n * - Tree-sitter may fail with \"Invalid argument\" error on very large files (1000+ lines)\n * - When this occurs, Lien automatically falls back to line-based chunking\n * - Configure fallback behavior via `chunking.astFallback` ('line-based' or 'error')\n * \n * @param filepath - Path to the file\n * @param content - File content\n * @param options - Chunking options\n * @returns Array of AST-aware chunks\n * @throws Error if AST parsing fails and astFallback is 'error'\n */\nexport function chunkByAST(\n  filepath: string,\n  content: string,\n  options: ASTChunkOptions = {}\n): ASTChunk[] {\n  const { minChunkSize = 5 } = options;\n  \n  // Check if AST is supported for this file\n  const language = detectLanguage(filepath);\n  if (!language) {\n    throw new Error(`Unsupported language for file: ${filepath}`);\n  }\n  \n  // Parse the file\n  const parseResult = parseAST(content, language);\n  \n  // If parsing failed, throw error (caller should fallback to line-based)\n  if (!parseResult.tree) {\n    throw new Error(`Failed to parse ${filepath}: ${parseResult.error}`);\n  }\n  \n  const chunks: ASTChunk[] = [];\n  const lines = content.split('\\n');\n  const rootNode = parseResult.tree.rootNode;\n  \n  // Get language-specific traverser\n  const traverser = getTraverser(language);\n  \n  // Extract file-level imports once\n  const fileImports = extractImports(rootNode);\n  \n  // Find all top-level function and class declarations\n  const topLevelNodes = findTopLevelNodes(rootNode, traverser);\n  \n  for (const node of topLevelNodes) {\n    // For variable declarations, try to find the function inside\n    let actualNode = node;\n    if (traverser.isDeclarationWithFunction(node)) {\n      const declInfo = traverser.findFunctionInDeclaration(node);\n      if (declInfo.functionNode) {\n        actualNode = declInfo.functionNode;\n      }\n    }\n    \n    // For methods, find the parent container name (e.g., class name)\n    const parentClassName = traverser.findParentContainerName(actualNode);\n    \n    const symbolInfo = extractSymbolInfo(actualNode, content, parentClassName, language);\n    \n    // Extract the code for this node (use original node for full declaration)\n    const nodeContent = getNodeContent(node, lines);\n    \n    // Create a chunk for this semantic unit\n    // Note: Large functions are kept as single chunks (may exceed maxChunkSize)\n    // This preserves semantic boundaries - better than splitting mid-function\n    chunks.push(createChunk(filepath, node, nodeContent, symbolInfo, fileImports, language));\n  }\n  \n  // Handle remaining code (imports, exports, top-level statements)\n  const coveredRanges = topLevelNodes.map(n => ({\n    start: n.startPosition.row,\n    end: n.endPosition.row,\n  }));\n  \n  const uncoveredChunks = extractUncoveredCode(\n    lines,\n    coveredRanges,\n    filepath,\n    minChunkSize,\n    fileImports,\n    language\n  );\n  \n  chunks.push(...uncoveredChunks);\n  \n  // Sort chunks by line number\n  chunks.sort((a, b) => a.metadata.startLine - b.metadata.startLine);\n  \n  return chunks;\n}\n\n/** Check if node is a function-containing declaration at top level */\nfunction isFunctionDeclaration(\n  node: Parser.SyntaxNode,\n  depth: number,\n  traverser: ReturnType<typeof getTraverser>\n): boolean {\n  if (depth !== 0 || !traverser.isDeclarationWithFunction(node)) return false;\n  return traverser.findFunctionInDeclaration(node).hasFunction;\n}\n\n/** Check if node is a target type at valid depth */\nfunction isTargetNode(\n  node: Parser.SyntaxNode,\n  depth: number,\n  traverser: ReturnType<typeof getTraverser>\n): boolean {\n  return depth <= 1 && traverser.targetNodeTypes.includes(node.type);\n}\n\n/**\n * Find all top-level nodes that should become chunks\n * \n * Uses a language-specific traverser to handle different AST structures.\n * This function is now language-agnostic - all language-specific logic\n * is delegated to the traverser.\n * \n * @param rootNode - Root AST node\n * @param traverser - Language-specific traverser\n * @returns Array of nodes to extract as chunks\n */\nfunction findTopLevelNodes(\n  rootNode: Parser.SyntaxNode,\n  traverser: ReturnType<typeof getTraverser>\n): Parser.SyntaxNode[] {\n  const nodes: Parser.SyntaxNode[] = [];\n  \n  function traverse(node: Parser.SyntaxNode, depth: number): void {\n    // Capture function declarations and target nodes\n    if (isFunctionDeclaration(node, depth, traverser) || isTargetNode(node, depth, traverser)) {\n      nodes.push(node);\n      return;\n    }\n    \n    // Handle containers - traverse body at increased depth\n    if (traverser.shouldExtractChildren(node)) {\n      const body = traverser.getContainerBody(node);\n      if (body) traverse(body, depth + 1);\n      return;\n    }\n    \n    // Traverse children of traversable nodes\n    if (!traverser.shouldTraverseChildren(node)) return;\n    for (let i = 0; i < node.namedChildCount; i++) {\n      const child = node.namedChild(i);\n      if (child) traverse(child, depth);\n    }\n  }\n  \n  traverse(rootNode, 0);\n  return nodes;\n}\n\n/**\n * Extract content for a specific AST node\n */\nfunction getNodeContent(node: Parser.SyntaxNode, lines: string[]): string {\n  const startLine = node.startPosition.row;\n  const endLine = node.endPosition.row;\n  \n  return lines.slice(startLine, endLine + 1).join('\\n');\n}\n\n/** Maps symbol types to legacy symbol array keys */\nconst SYMBOL_TYPE_TO_ARRAY: Record<string, 'functions' | 'classes' | 'interfaces'> = {\n  function: 'functions',\n  method: 'functions',\n  class: 'classes',\n  interface: 'interfaces',\n};\n\n/** Symbol types that have meaningful complexity metrics */\nconst COMPLEXITY_SYMBOL_TYPES = new Set(['function', 'method']);\n\n/**\n * Build legacy symbols object for backward compatibility\n */\nfunction buildLegacySymbols(symbolInfo: ReturnType<typeof extractSymbolInfo>): {\n  functions: string[];\n  classes: string[];\n  interfaces: string[];\n} {\n  const symbols = { functions: [] as string[], classes: [] as string[], interfaces: [] as string[] };\n  \n  if (symbolInfo?.name && symbolInfo.type) {\n    const arrayKey = SYMBOL_TYPE_TO_ARRAY[symbolInfo.type];\n    if (arrayKey) symbols[arrayKey].push(symbolInfo.name);\n  }\n  \n  return symbols;\n}\n\n/**\n * Determine chunk type from symbol info\n */\nfunction getChunkType(symbolInfo: ReturnType<typeof extractSymbolInfo>): 'block' | 'class' | 'function' {\n  if (!symbolInfo) return 'block';\n  return symbolInfo.type === 'class' ? 'class' : 'function';\n}\n\n/**\n * Create a chunk from an AST node\n */\nfunction createChunk(\n  filepath: string,\n  node: Parser.SyntaxNode,\n  content: string,\n  symbolInfo: ReturnType<typeof extractSymbolInfo>,\n  imports: string[],\n  language: string\n): ASTChunk {\n  const symbols = buildLegacySymbols(symbolInfo);\n  const shouldCalcComplexity = symbolInfo?.type && COMPLEXITY_SYMBOL_TYPES.has(symbolInfo.type);\n  \n  // Calculate complexity metrics only for functions and methods\n  const cognitiveComplexity = shouldCalcComplexity\n    ? calculateCognitiveComplexity(node)\n    : undefined;\n  \n  // Calculate Halstead metrics only for functions and methods\n  const halstead = shouldCalcComplexity\n    ? calculateHalstead(node, language)\n    : undefined;\n  \n  return {\n    content,\n    metadata: {\n      file: filepath,\n      startLine: node.startPosition.row + 1,\n      endLine: node.endPosition.row + 1,\n      type: getChunkType(symbolInfo),\n      language,\n      symbols,\n      symbolName: symbolInfo?.name,\n      symbolType: symbolInfo?.type,\n      parentClass: symbolInfo?.parentClass,\n      complexity: symbolInfo?.complexity,\n      cognitiveComplexity,\n      parameters: symbolInfo?.parameters,\n      signature: symbolInfo?.signature,\n      imports,\n      // Halstead metrics\n      halsteadVolume: halstead?.volume,\n      halsteadDifficulty: halstead?.difficulty,\n      halsteadEffort: halstead?.effort,\n      halsteadBugs: halstead?.bugs,\n    },\n  };\n}\n\n/**\n * Represents a range of lines in a file\n */\ninterface LineRange {\n  start: number;\n  end: number;\n}\n\n/**\n * Find gaps between covered ranges (uncovered code)\n */\nfunction findUncoveredRanges(\n  coveredRanges: LineRange[],\n  totalLines: number\n): LineRange[] {\n  const uncoveredRanges: LineRange[] = [];\n  let currentStart = 0;\n  \n  // Sort covered ranges\n  const sortedRanges = [...coveredRanges].sort((a, b) => a.start - b.start);\n  \n  for (const range of sortedRanges) {\n    if (currentStart < range.start) {\n      // There's a gap before this range\n      uncoveredRanges.push({\n        start: currentStart,\n        end: range.start - 1,\n      });\n    }\n    currentStart = range.end + 1;\n  }\n  \n  // Handle remaining code after last covered range\n  if (currentStart < totalLines) {\n    uncoveredRanges.push({\n      start: currentStart,\n      end: totalLines - 1,\n    });\n  }\n  \n  return uncoveredRanges;\n}\n\n/**\n * Create a chunk from a line range\n */\nfunction createChunkFromRange(\n  range: LineRange,\n  lines: string[],\n  filepath: string,\n  language: string,\n  imports: string[]\n): ASTChunk {\n  const uncoveredLines = lines.slice(range.start, range.end + 1);\n  const content = uncoveredLines.join('\\n').trim();\n  \n  return {\n    content,\n    metadata: {\n      file: filepath,\n      startLine: range.start + 1,\n      endLine: range.end + 1,\n      type: 'block',\n      language,\n      // Empty symbols for uncovered code (imports, exports, etc.)\n      symbols: { functions: [], classes: [], interfaces: [] },\n      imports,\n    },\n  };\n}\n\n/**\n * Validate that a chunk meets the minimum size requirements\n */\nfunction isValidChunk(chunk: ASTChunk, minChunkSize: number): boolean {\n  const lineCount = chunk.metadata.endLine - chunk.metadata.startLine + 1;\n  return chunk.content.length > 0 && lineCount >= minChunkSize;\n}\n\n/**\n * Extract code that wasn't covered by function/class chunks\n * (imports, exports, top-level statements)\n */\nfunction extractUncoveredCode(\n  lines: string[],\n  coveredRanges: Array<{ start: number; end: number }>,\n  filepath: string,\n  minChunkSize: number,\n  imports: string[],\n  language: string\n): ASTChunk[] {\n  const uncoveredRanges = findUncoveredRanges(coveredRanges, lines.length);\n  \n  return uncoveredRanges\n    .map(range => createChunkFromRange(range, lines, filepath, language, imports))\n    .filter(chunk => isValidChunk(chunk, minChunkSize));\n}\n\n/**\n * Check if AST chunking should be used for a file\n */\nexport function shouldUseAST(filepath: string): boolean {\n  return isASTSupported(filepath);\n}\n\n","import type { CodeChunk } from './types.js';\n\n/**\n * Liquid-specific chunking for Shopify themes\n * \n * Uses regex to identify special Liquid blocks (schema, style, javascript)\n * and keeps them as single semantic units\n */\n\ninterface LiquidBlock {\n  type: 'schema' | 'style' | 'javascript' | 'template';\n  startLine: number;\n  endLine: number;\n  content: string;\n}\n\n/**\n * Extract schema name from JSON content\n * \n * Extracts the \"name\" field from Shopify schema JSON.\n * Uses JSON.parse to properly handle escaped quotes and other JSON edge cases.\n * \n * Example:\n * {% schema %}\n * {\n *   \"name\": \"My \\\"Special\\\" Section\",\n *   \"settings\": []\n * }\n * {% endschema %}\n * \n * Returns: 'My \"Special\" Section' (with literal quotes, unescaped)\n */\nfunction extractSchemaName(schemaContent: string): string | undefined {\n  try {\n    // Remove Liquid tags to isolate JSON content\n    // Replace {% schema %} and {% endschema %} (with optional whitespace control)\n    let jsonContent = schemaContent\n      .replace(/\\{%-?\\s*schema\\s*-?%\\}/g, '')\n      .replace(/\\{%-?\\s*endschema\\s*-?%\\}/g, '')\n      .trim();\n    \n    // Parse the JSON\n    const schema = JSON.parse(jsonContent);\n    // Ensure name is a string before returning\n    return typeof schema.name === 'string' ? schema.name : undefined;\n  } catch (error) {\n    // Invalid JSON - return undefined\n    // This is acceptable: schema blocks with invalid JSON won't have names extracted\n  }\n  return undefined;\n}\n\n/**\n * Remove Liquid comment blocks from content to avoid extracting tags from comments\n * \n * Example:\n * {% comment %}Don't use {% render 'old-snippet' %}{% endcomment %}\n * → (removed)\n */\nfunction removeComments(content: string): string {\n  // Remove {% comment %}...{% endcomment %} blocks (with optional whitespace control)\n  return content.replace(/\\{%-?\\s*comment\\s*-?%\\}[\\s\\S]*?\\{%-?\\s*endcomment\\s*-?%\\}/g, '');\n}\n\n/**\n * Extract dependencies from {% render %}, {% include %}, and {% section %} tags\n * \n * Examples:\n * - {% render 'product-card' %} → 'product-card'\n * - {% render \"cart-item\", product: product %} → 'cart-item'\n * - {% include 'snippets/header' %} → 'snippets/header'\n * - {% section 'announcement-bar' %} → 'announcement-bar'\n * \n * Limitations:\n * - Does not handle escaped quotes in snippet names (e.g., {% render 'name\\'s' %})\n * - This is acceptable because Shopify snippet names map to filenames, and\n *   filesystem restrictions prevent quotes in filenames (snippets/name's.liquid is invalid)\n * - In practice, Shopify snippet names use only alphanumeric, dash, and underscore\n * \n * Note: Expects content with comments already removed for performance\n * \n * @param contentWithoutComments - Content with Liquid comments already removed\n */\nfunction extractRenderTags(contentWithoutComments: string): string[] {\n  const dependencies = new Set<string>();\n  \n  // Match {% render 'snippet-name' %} or {% render \"snippet-name\" %}\n  // Note: Does not handle escaped quotes - see function docs for rationale\n  const renderPattern = /\\{%-?\\s*render\\s+['\"]([^'\"]+)['\"]/g;\n  let match;\n  \n  while ((match = renderPattern.exec(contentWithoutComments)) !== null) {\n    dependencies.add(match[1]);\n  }\n  \n  // Match {% include 'snippet-name' %} or {% include \"snippet-name\" %}\n  const includePattern = /\\{%-?\\s*include\\s+['\"]([^'\"]+)['\"]/g;\n  \n  while ((match = includePattern.exec(contentWithoutComments)) !== null) {\n    dependencies.add(match[1]);\n  }\n  \n  // Match {% section 'section-name' %} or {% section \"section-name\" %}\n  const sectionPattern = /\\{%-?\\s*section\\s+['\"]([^'\"]+)['\"]/g;\n  \n  while ((match = sectionPattern.exec(contentWithoutComments)) !== null) {\n    dependencies.add(match[1]);\n  }\n  \n  return Array.from(dependencies);\n}\n\n/**\n * Find all special Liquid blocks in the template\n * \n * Limitation: Does not support nested blocks of the same type.\n * - Matches first start tag with first end tag\n * - This is acceptable because Shopify Liquid does not allow nested blocks\n * - Example invalid: {% schema %}...{% schema %}...{% endschema %} (Shopify rejects this)\n * - If malformed input contains nested blocks, only outermost block is extracted\n */\nfunction findLiquidBlocks(content: string): LiquidBlock[] {\n  const lines = content.split('\\n');\n  const blocks: LiquidBlock[] = [];\n  \n  // Regex patterns for Liquid blocks\n  // Note: Matches first start → first end (no nesting support, which is correct for Shopify)\n  const blockPatterns = [\n    { type: 'schema' as const, start: /\\{%-?\\s*schema\\s*-?%\\}/, end: /\\{%-?\\s*endschema\\s*-?%\\}/ },\n    { type: 'style' as const, start: /\\{%-?\\s*style\\s*-?%\\}/, end: /\\{%-?\\s*endstyle\\s*-?%\\}/ },\n    { type: 'javascript' as const, start: /\\{%-?\\s*javascript\\s*-?%\\}/, end: /\\{%-?\\s*endjavascript\\s*-?%\\}/ },\n  ];\n  \n  for (const pattern of blockPatterns) {\n    let searchStart = 0;\n    \n    while (searchStart < lines.length) {\n      // Find start tag\n      const startIdx = lines.findIndex((line, idx) => \n        idx >= searchStart && pattern.start.test(line)\n      );\n      \n      if (startIdx === -1) break;\n      \n      // Find end tag (allow same line for single-line blocks)\n      const endIdx = lines.findIndex((line, idx) => \n        idx >= startIdx && pattern.end.test(line)\n      );\n      \n      if (endIdx === -1) {\n        // No end tag found, treat rest as template\n        break;\n      }\n      \n      // Extract block content\n      const blockContent = lines.slice(startIdx, endIdx + 1).join('\\n');\n      \n      blocks.push({\n        type: pattern.type,\n        startLine: startIdx,\n        endLine: endIdx,\n        content: blockContent,\n      });\n      \n      searchStart = endIdx + 1;\n    }\n  }\n  \n  return blocks.sort((a, b) => a.startLine - b.startLine);\n}\n\n/**\n * Chunk a Liquid template file\n * \n * Special handling for:\n * - {% schema %} blocks (kept together, extract section name)\n * - {% style %} blocks (kept together)  \n * - {% javascript %} blocks (kept together)\n * - {% render %}, {% include %}, and {% section %} tags (tracked as imports)\n * - Regular template content (chunked by lines)\n */\nexport function chunkLiquidFile(\n  filepath: string,\n  content: string,\n  chunkSize: number = 75,\n  chunkOverlap: number = 10\n): CodeChunk[] {\n  const lines = content.split('\\n');\n  const blocks = findLiquidBlocks(content);\n  const chunks: CodeChunk[] = [];\n  \n  // Remove comments once for performance (avoids repeated regex operations)\n  const contentWithoutComments = removeComments(content);\n  const linesWithoutComments = contentWithoutComments.split('\\n');\n  \n  // Track which lines are covered by special blocks\n  const coveredLines = new Set<number>();\n  \n  // Create chunks for special blocks\n  for (const block of blocks) {\n    // Mark lines as covered\n    for (let i = block.startLine; i <= block.endLine; i++) {\n      coveredLines.add(i);\n    }\n    \n    // Extract metadata\n    let symbolName: string | undefined;\n    if (block.type === 'schema') {\n      symbolName = extractSchemaName(block.content);\n    }\n    \n    // Extract render/include tags from cleaned content (comments already removed)\n    const blockContentWithoutComments = linesWithoutComments\n      .slice(block.startLine, block.endLine + 1)\n      .join('\\n');\n    const imports = extractRenderTags(blockContentWithoutComments);\n    \n    const blockLineCount = block.endLine - block.startLine + 1;\n    const maxBlockSize = chunkSize * 3; // Allow blocks up to 3x chunk size before splitting\n    \n    // If block is reasonably sized, keep it as one chunk\n    if (blockLineCount <= maxBlockSize) {\n      chunks.push({\n        content: block.content,\n        metadata: {\n          file: filepath,\n          startLine: block.startLine + 1, // 1-indexed\n          endLine: block.endLine + 1,\n          language: 'liquid',\n          type: 'block',\n          symbolName,\n          symbolType: block.type,\n          imports: imports.length > 0 ? imports : undefined,\n        },\n      });\n    } else {\n      // Block is too large - split it into multiple chunks with overlap\n      const blockLines = block.content.split('\\n');\n      \n      for (let offset = 0; offset < blockLines.length; offset += chunkSize - chunkOverlap) {\n        const endOffset = Math.min(offset + chunkSize, blockLines.length);\n        const chunkContent = blockLines.slice(offset, endOffset).join('\\n');\n        \n        if (chunkContent.trim().length > 0) {\n          chunks.push({\n            content: chunkContent,\n            metadata: {\n              file: filepath,\n              startLine: block.startLine + offset + 1, // 1-indexed\n              endLine: block.startLine + endOffset, // 1-indexed (endOffset already accounts for exclusivity)\n              language: 'liquid',\n              type: 'block',\n              symbolName, // Preserve symbol name for all split chunks\n              symbolType: block.type,\n              imports: imports.length > 0 ? imports : undefined,\n            },\n          });\n        }\n        \n        if (endOffset >= blockLines.length) break;\n      }\n    }\n  }\n  \n  // Chunk uncovered template content\n  let currentChunk: string[] = [];\n  let chunkStartLine = 0;\n  \n  for (let i = 0; i < lines.length; i++) {\n    // Skip lines covered by special blocks\n    if (coveredLines.has(i)) {\n      // Flush current chunk if any\n      if (currentChunk.length > 0) {\n        const chunkContent = currentChunk.join('\\n');\n        \n        // Only push non-empty chunks\n        if (chunkContent.trim().length > 0) {\n          // Extract from cleaned content (comments already removed)\n          const cleanedChunk = linesWithoutComments.slice(chunkStartLine, i).join('\\n');\n          const imports = extractRenderTags(cleanedChunk);\n          \n          chunks.push({\n            content: chunkContent,\n            metadata: {\n              file: filepath,\n              startLine: chunkStartLine + 1,\n              endLine: i,\n              language: 'liquid',\n              type: 'template',\n              imports: imports.length > 0 ? imports : undefined,\n            },\n          });\n        }\n        currentChunk = [];\n      }\n      continue;\n    }\n    \n    // Start new chunk if needed\n    if (currentChunk.length === 0) {\n      chunkStartLine = i;\n    }\n    \n    currentChunk.push(lines[i]);\n    \n    // Flush if chunk is full\n    if (currentChunk.length >= chunkSize) {\n      const chunkContent = currentChunk.join('\\n');\n      \n      // Only push non-empty chunks\n      if (chunkContent.trim().length > 0) {\n        // Extract from cleaned content (comments already removed)\n        const cleanedChunk = linesWithoutComments.slice(chunkStartLine, i + 1).join('\\n');\n        const imports = extractRenderTags(cleanedChunk);\n        \n        chunks.push({\n          content: chunkContent,\n          metadata: {\n            file: filepath,\n            startLine: chunkStartLine + 1,\n            endLine: i + 1,\n            language: 'liquid',\n            type: 'template',\n            imports: imports.length > 0 ? imports : undefined,\n          },\n        });\n      }\n      \n      // Add overlap for next chunk\n      currentChunk = currentChunk.slice(-chunkOverlap);\n      chunkStartLine = Math.max(0, i + 1 - chunkOverlap);\n    }\n  }\n  \n  // Flush remaining chunk\n  if (currentChunk.length > 0) {\n    const chunkContent = currentChunk.join('\\n');\n    \n    // Skip empty or whitespace-only chunks\n    if (chunkContent.trim().length === 0) {\n      return chunks.sort((a, b) => a.metadata.startLine - b.metadata.startLine);\n    }\n    \n    // Extract from cleaned content (comments already removed)\n    const cleanedChunk = linesWithoutComments.slice(chunkStartLine, lines.length).join('\\n');\n    const imports = extractRenderTags(cleanedChunk);\n    \n    chunks.push({\n      content: chunkContent,\n      metadata: {\n        file: filepath,\n        startLine: chunkStartLine + 1,\n        endLine: lines.length,\n        language: 'liquid',\n        type: 'template',\n        imports: imports.length > 0 ? imports : undefined,\n      },\n    });\n  }\n  \n  // Sort by line number\n  return chunks.sort((a, b) => a.metadata.startLine - b.metadata.startLine);\n}\n\n","import type { CodeChunk } from './types.js';\n\n/**\n * Shopify JSON template chunking\n * \n * JSON template files define which sections appear on a template page.\n * We extract section references to track dependencies.\n * \n * Example structure:\n * {\n *   \"sections\": {\n *     \"main\": { \"type\": \"main-product\", \"settings\": {...} },\n *     \"recommendations\": { \"type\": \"product-recommendations\", \"settings\": {...} }\n *   },\n *   \"order\": [\"main\", \"recommendations\"]\n * }\n */\n\n/**\n * Extract section types from a Shopify JSON template\n * \n * These are the actual section file names (e.g., \"main-product\" → sections/main-product.liquid)\n */\nfunction extractSectionReferences(jsonContent: string): string[] {\n  try {\n    const template = JSON.parse(jsonContent);\n    const sectionTypes = new Set<string>();\n    \n    // Extract from sections object\n    if (template.sections && typeof template.sections === 'object') {\n      for (const section of Object.values(template.sections)) {\n        if (\n          typeof section === 'object' && \n          section !== null && \n          'type' in section && \n          typeof section.type === 'string'\n        ) {\n          sectionTypes.add(section.type);\n        }\n      }\n    }\n    \n    return Array.from(sectionTypes);\n  } catch (error) {\n    // Invalid JSON - return empty array\n    console.warn(`[Lien] Failed to parse JSON template: ${error instanceof Error ? error.message : String(error)}`);\n    return [];\n  }\n}\n\n/**\n * Extract the template name from the filepath\n * \n * templates/customers/account.json → \"customers/account\"\n * templates/product.json → \"product\"\n */\nfunction extractTemplateName(filepath: string): string | undefined {\n  // Match everything after templates/ up to .json\n  const match = filepath.match(/templates\\/(.+)\\.json$/);\n  return match ? match[1] : undefined;\n}\n\n/**\n * Chunk a Shopify JSON template file\n * \n * JSON templates are typically small (define section layout),\n * so we keep them as a single chunk and extract section references.\n */\nexport function chunkJSONTemplate(\n  filepath: string,\n  content: string\n): CodeChunk[] {\n  // Skip empty files\n  if (content.trim().length === 0) {\n    return [];\n  }\n  \n  const lines = content.split('\\n');\n  const templateName = extractTemplateName(filepath);\n  const sectionReferences = extractSectionReferences(content);\n  \n  return [{\n    content,\n    metadata: {\n      file: filepath,\n      startLine: 1,\n      endLine: lines.length,\n      language: 'json',\n      type: 'template',\n      symbolName: templateName,\n      symbolType: 'template',\n      imports: sectionReferences.length > 0 ? sectionReferences : undefined,\n    },\n  }];\n}\n\n","import { CodeChunk } from './types.js';\nimport { detectLanguage } from './scanner.js';\nimport { extractSymbols } from './symbol-extractor.js';\nimport { shouldUseAST, chunkByAST } from './ast/chunker.js';\nimport { chunkLiquidFile } from './liquid-chunker.js';\nimport { chunkJSONTemplate } from './json-template-chunker.js';\n\nexport interface ChunkOptions {\n  chunkSize?: number;\n  chunkOverlap?: number;\n  useAST?: boolean; // Flag to enable AST-based chunking\n  astFallback?: 'line-based' | 'error'; // How to handle AST parsing errors\n}\n\nexport function chunkFile(\n  filepath: string,\n  content: string,\n  options: ChunkOptions = {}\n): CodeChunk[] {\n  const { chunkSize = 75, chunkOverlap = 10, useAST = true, astFallback = 'line-based' } = options;\n  \n  // Special handling for Liquid files\n  if (filepath.endsWith('.liquid')) {\n    return chunkLiquidFile(filepath, content, chunkSize, chunkOverlap);\n  }\n  \n  // Special handling for Shopify JSON template files (templates/**/*.json)\n  // Use regex to ensure 'templates/' is a path segment, not part of another name\n  // Matches: templates/product.json OR some-path/templates/customers/account.json\n  // Rejects: my-templates/config.json OR node_modules/pkg/templates/file.json (filtered by scanner)\n  if (filepath.endsWith('.json') && /(?:^|\\/)templates\\//.test(filepath)) {\n    return chunkJSONTemplate(filepath, content);\n  }\n  \n  // Try AST-based chunking for supported languages\n  if (useAST && shouldUseAST(filepath)) {\n    try {\n      return chunkByAST(filepath, content, {\n        minChunkSize: Math.floor(chunkSize / 10),\n      });\n    } catch (error) {\n      // Handle AST errors based on configuration\n      if (astFallback === 'error') {\n        // Throw error if user wants strict AST-only behavior\n        throw new Error(`AST chunking failed for ${filepath}: ${error instanceof Error ? error.message : String(error)}`);\n      }\n      // Otherwise fallback to line-based chunking\n      console.warn(`AST chunking failed for ${filepath}, falling back to line-based:`, error);\n    }\n  }\n  \n  // Line-based chunking (original implementation)\n  return chunkByLines(filepath, content, chunkSize, chunkOverlap);\n}\n\n/**\n * Original line-based chunking implementation\n */\nfunction chunkByLines(\n  filepath: string,\n  content: string,\n  chunkSize: number,\n  chunkOverlap: number\n): CodeChunk[] {\n  const lines = content.split('\\n');\n  const chunks: CodeChunk[] = [];\n  const language = detectLanguage(filepath);\n  \n  // Handle empty files\n  if (lines.length === 0 || (lines.length === 1 && lines[0].trim() === '')) {\n    return chunks;\n  }\n  \n  // Chunk by lines with overlap\n  for (let i = 0; i < lines.length; i += chunkSize - chunkOverlap) {\n    const endLine = Math.min(i + chunkSize, lines.length);\n    const chunkLines = lines.slice(i, endLine);\n    const chunkContent = chunkLines.join('\\n');\n    \n    // Skip empty chunks\n    if (chunkContent.trim().length === 0) {\n      continue;\n    }\n    \n    // Extract symbols from the chunk\n    const symbols = extractSymbols(chunkContent, language);\n    \n    chunks.push({\n      content: chunkContent,\n      metadata: {\n        file: filepath,\n        startLine: i + 1,\n        endLine: endLine,\n        type: 'block', // MVP: all chunks are 'block' type\n        language,\n        symbols,\n      },\n    });\n    \n    // If we've reached the end, break\n    if (endLine >= lines.length) {\n      break;\n    }\n  }\n  \n  return chunks;\n}\n\nexport function chunkText(text: string, options: ChunkOptions = {}): string[] {\n  const { chunkSize = 75, chunkOverlap = 10 } = options;\n  \n  const lines = text.split('\\n');\n  const chunks: string[] = [];\n  \n  for (let i = 0; i < lines.length; i += chunkSize - chunkOverlap) {\n    const endLine = Math.min(i + chunkSize, lines.length);\n    const chunkLines = lines.slice(i, endLine);\n    const chunkContent = chunkLines.join('\\n');\n    \n    if (chunkContent.trim().length > 0) {\n      chunks.push(chunkContent);\n    }\n    \n    if (endLine >= lines.length) {\n      break;\n    }\n  }\n  \n  return chunks;\n}\n\n","import { pipeline, env, type FeatureExtractionPipeline } from '@xenova/transformers';\nimport { EmbeddingService } from './types.js';\nimport { EmbeddingError, wrapError } from '../errors/index.js';\nimport { DEFAULT_EMBEDDING_MODEL } from '../constants.js';\n\n// Configure transformers.js to cache models locally\nenv.allowRemoteModels = true;\nenv.allowLocalModels = true;\n\nexport class LocalEmbeddings implements EmbeddingService {\n  private extractor: FeatureExtractionPipeline | null = null;\n  private readonly modelName = DEFAULT_EMBEDDING_MODEL;\n  private initPromise: Promise<void> | null = null;\n  \n  async initialize(): Promise<void> {\n    // Prevent multiple simultaneous initializations\n    if (this.initPromise) {\n      return this.initPromise;\n    }\n    \n    if (this.extractor) {\n      return;\n    }\n    \n    this.initPromise = (async () => {\n      try {\n        // This downloads ~100MB on first run, then caches in ~/.cache/huggingface\n        this.extractor = await pipeline('feature-extraction', this.modelName) as FeatureExtractionPipeline;\n      } catch (error: unknown) {\n        this.initPromise = null;\n        throw wrapError(error, 'Failed to initialize embedding model');\n      }\n    })();\n    \n    return this.initPromise;\n  }\n  \n  async embed(text: string): Promise<Float32Array> {\n    await this.initialize();\n    \n    if (!this.extractor) {\n      throw new EmbeddingError('Embedding model not initialized');\n    }\n    \n    try {\n      const output = await this.extractor(text, {\n        pooling: 'mean',\n        normalize: true,\n      });\n      \n      return output.data as Float32Array;\n    } catch (error: unknown) {\n      throw wrapError(error, 'Failed to generate embedding', { textLength: text.length });\n    }\n  }\n  \n  async embedBatch(texts: string[]): Promise<Float32Array[]> {\n    await this.initialize();\n    \n    if (!this.extractor) {\n      throw new EmbeddingError('Embedding model not initialized');\n    }\n    \n    try {\n      // Process embeddings with Promise.all for concurrent execution\n      // Each call is sequential but Promise.all allows task interleaving\n      const results = await Promise.all(\n        texts.map(text => this.embed(text))\n      );\n      return results;\n    } catch (error: unknown) {\n      throw wrapError(error, 'Failed to generate batch embeddings', { batchSize: texts.length });\n    }\n  }\n}\n\n","import { EMBEDDING_DIMENSIONS } from '../constants.js';\n\nexport interface EmbeddingService {\n  initialize(): Promise<void>;\n  embed(text: string): Promise<Float32Array>;\n  embedBatch(texts: string[]): Promise<Float32Array[]>;\n}\n\nexport const EMBEDDING_DIMENSION = EMBEDDING_DIMENSIONS;\n\n","/**\n * Relevance category based on semantic similarity score\n */\nexport type RelevanceCategory = 'highly_relevant' | 'relevant' | 'loosely_related' | 'not_relevant';\n\n/**\n * Calculate relevance category from cosine distance score.\n * \n * Lower scores indicate higher similarity (closer in vector space).\n * Thresholds based on observed score distributions from dogfooding.\n * \n * @param score - Cosine distance score from vector search\n * @returns Human-readable relevance category\n */\nexport function calculateRelevance(score: number): RelevanceCategory {\n  if (score < 1.0) return 'highly_relevant';\n  if (score < 1.3) return 'relevant';\n  if (score < 1.5) return 'loosely_related';\n  return 'not_relevant';\n}\n\n","/**\n * Query Intent Classification\n * \n * Classifies user search queries into three categories to apply\n * appropriate relevance boosting strategies:\n * \n * - LOCATION: \"Where is X?\" - User wants to find specific files/code\n * - CONCEPTUAL: \"How does X work?\" - User wants to understand concepts\n * - IMPLEMENTATION: \"How is X implemented?\" - User wants implementation details\n * \n * Examples:\n * - \"where is the auth handler\" → LOCATION\n * - \"how does authentication work\" → CONCEPTUAL\n * - \"how is authentication implemented\" → IMPLEMENTATION\n */\n\n/**\n * Query intent types for semantic search\n */\nexport enum QueryIntent {\n  /** User wants to locate specific files or code (e.g., \"where is X\") */\n  LOCATION = 'location',\n  \n  /** User wants to understand concepts/processes (e.g., \"how does X work\") */\n  CONCEPTUAL = 'conceptual',\n  \n  /** User wants implementation details (e.g., \"how is X implemented\") */\n  IMPLEMENTATION = 'implementation',\n}\n\n/**\n * Intent classification rule with patterns and priority\n */\nexport interface IntentRule {\n  intent: QueryIntent;\n  patterns: RegExp[];\n  priority: number;\n}\n\n/**\n * Intent classification rules.\n * Rules are checked in priority order (higher priority first).\n */\nconst INTENT_RULES: IntentRule[] = [\n  // LOCATION intent (highest priority - most specific)\n  {\n    intent: QueryIntent.LOCATION,\n    priority: 3,\n    patterns: [\n      /where\\s+(is|are|does|can\\s+i\\s+find)/,\n      /find\\s+the\\s+/,\n      /locate\\s+/,\n    ],\n  },\n  \n  // CONCEPTUAL intent (medium priority)\n  {\n    intent: QueryIntent.CONCEPTUAL,\n    priority: 2,\n    patterns: [\n      /how\\s+does\\s+.*\\s+work/,\n      /what\\s+(is|are|does)/,\n      /explain\\s+/,\n      /understand\\s+/,\n      /\\b(process|workflow|architecture)\\b/,\n    ],\n  },\n  \n  // IMPLEMENTATION intent (low priority - catches \"how is X implemented\")\n  {\n    intent: QueryIntent.IMPLEMENTATION,\n    priority: 1,\n    patterns: [\n      /how\\s+(is|are)\\s+.*\\s+(implemented|built|coded)/,\n      /implementation\\s+of/,\n      /source\\s+code\\s+for/,\n    ],\n  },\n];\n\n/**\n * Capture the initial number of built-in rules.\n * This is used by resetIntentRules() to distinguish built-in rules from custom rules.\n */\nconst INITIAL_RULE_COUNT = INTENT_RULES.length;\n\n/**\n * Cached sorted rules to avoid re-sorting on every query.\n * Invalidated when rules are modified via addIntentRule() or resetIntentRules().\n */\nlet cachedSortedRules: IntentRule[] | null = null;\n\n/**\n * Get sorted rules (cached).\n * Lazy-computes and caches the sorted array on first access.\n */\nfunction getSortedRules(): IntentRule[] {\n  if (cachedSortedRules === null) {\n    cachedSortedRules = [...INTENT_RULES].sort((a, b) => b.priority - a.priority);\n  }\n  return cachedSortedRules;\n}\n\n/**\n * Invalidate the sorted rules cache.\n * Called when rules are modified.\n */\nfunction invalidateSortedRulesCache(): void {\n  cachedSortedRules = null;\n}\n\n/**\n * Classifies a search query into one of three intent categories.\n * \n * Uses data-driven pattern matching to detect query intent.\n * Rules are checked in priority order, with the first match winning.\n * \n * @param query - The search query string\n * @returns The detected query intent (defaults to IMPLEMENTATION)\n * \n * @example\n * classifyQueryIntent(\"where is the user controller\") // → LOCATION\n * classifyQueryIntent(\"how does authentication work\") // → CONCEPTUAL\n * classifyQueryIntent(\"how is the API implemented\") // → IMPLEMENTATION\n */\nexport function classifyQueryIntent(query: string): QueryIntent {\n  const lower = query.toLowerCase().trim();\n  \n  // Use cached sorted rules to avoid re-sorting on every query\n  const sortedRules = getSortedRules();\n  \n  for (const rule of sortedRules) {\n    if (rule.patterns.some(pattern => pattern.test(lower))) {\n      return rule.intent;\n    }\n  }\n  \n  // Default to IMPLEMENTATION for ambiguous queries\n  // This is the most common use case for code search\n  return QueryIntent.IMPLEMENTATION;\n}\n\n/**\n * Add a custom intent rule (useful for testing or extensions).\n * \n * Returns a cleanup function that removes the added rule.\n * This prevents test pollution and allows proper cleanup.\n * \n * @param rule - The intent rule to add\n * @returns A cleanup function that removes the added rule\n * \n * @example\n * const cleanup = addIntentRule({\n *   intent: QueryIntent.LOCATION,\n *   priority: 4,\n *   patterns: [/custom pattern/]\n * });\n * // ... use the rule ...\n * cleanup(); // removes the rule\n */\nexport function addIntentRule(rule: IntentRule): () => void {\n  INTENT_RULES.push(rule);\n  \n  // Invalidate cache since rules have changed\n  invalidateSortedRulesCache();\n  \n  // Return cleanup function to remove the rule\n  return () => {\n    const idx = INTENT_RULES.indexOf(rule);\n    if (idx !== -1) {\n      INTENT_RULES.splice(idx, 1);\n      // Invalidate cache since rules have changed\n      invalidateSortedRulesCache();\n    }\n  };\n}\n\n/**\n * Get all patterns for a specific intent (useful for debugging).\n * \n * @param intent - The intent to get patterns for\n * @returns Array of regex patterns for the intent\n * \n * @example\n * const locationPatterns = getPatternsForIntent(QueryIntent.LOCATION);\n */\nexport function getPatternsForIntent(intent: QueryIntent): RegExp[] {\n  return INTENT_RULES\n    .filter(rule => rule.intent === intent)\n    .flatMap(rule => rule.patterns);\n}\n\n/**\n * Get all intent rules (useful for testing/debugging).\n * \n * @returns A copy of the current intent rules\n */\nexport function getIntentRules(): IntentRule[] {\n  return [...INTENT_RULES];\n}\n\n/**\n * Reset intent rules to initial state.\n * \n * WARNING: This function is intended for testing only.\n * It removes all custom rules added via addIntentRule().\n * The original built-in rules are preserved.\n * \n * @example\n * // In test cleanup\n * afterEach(() => {\n *   resetIntentRules();\n * });\n */\nexport function resetIntentRules(): void {\n  // Remove all custom rules, preserving only the original built-in rules\n  INTENT_RULES.splice(INITIAL_RULE_COUNT);\n  \n  // Invalidate cache since rules have changed\n  invalidateSortedRulesCache();\n}\n\n","/**\n * Boosting strategy interface.\n * \n * Each strategy applies a specific relevance boosting technique\n * to search results based on file characteristics.\n */\nexport interface BoostingStrategy {\n  /** Name of the strategy (for debugging/logging) */\n  name: string;\n  \n  /**\n   * Apply the boosting strategy to a score.\n   * \n   * @param query - The search query string\n   * @param filepath - The file path being scored\n   * @param baseScore - The base relevance score from vector similarity\n   * @returns The boosted score (lower is better, following LanceDB distance metric)\n   */\n  apply(query: string, filepath: string, baseScore: number): number;\n}\n\n","import type { BoostingStrategy } from './types.js';\nimport path from 'path';\nimport { QueryIntent } from '../intent-classifier.js';\n\n/**\n * File type detection helpers\n */\n\nfunction isDocumentationFile(filepath: string): boolean {\n  const lower = filepath.toLowerCase();\n  const filename = path.basename(filepath).toLowerCase();\n  \n  if (filename.startsWith('readme')) return true;\n  if (filename.startsWith('changelog')) return true;\n  if (filename.endsWith('.md') || filename.endsWith('.mdx') || filename.endsWith('.markdown')) {\n    return true;\n  }\n  if (\n    lower.includes('/docs/') ||\n    lower.includes('/documentation/') ||\n    lower.includes('/wiki/') ||\n    lower.includes('/.github/')\n  ) {\n    return true;\n  }\n  if (\n    lower.includes('architecture') ||\n    lower.includes('workflow') ||\n    lower.includes('/flow/')\n  ) {\n    return true;\n  }\n  \n  return false;\n}\n\nfunction isTestFile(filepath: string): boolean {\n  const lower = filepath.toLowerCase();\n  \n  if (\n    lower.includes('/test/') ||\n    lower.includes('/tests/') ||\n    lower.includes('/__tests__/')\n  ) {\n    return true;\n  }\n  \n  if (\n    lower.includes('.test.') ||\n    lower.includes('.spec.') ||\n    lower.includes('_test.') ||\n    lower.includes('_spec.')\n  ) {\n    return true;\n  }\n  \n  return false;\n}\n\nfunction isUtilityFile(filepath: string): boolean {\n  const lower = filepath.toLowerCase();\n  \n  if (\n    lower.includes('/utils/') ||\n    lower.includes('/utilities/') ||\n    lower.includes('/helpers/') ||\n    lower.includes('/lib/')\n  ) {\n    return true;\n  }\n  \n  if (\n    lower.includes('.util.') ||\n    lower.includes('.helper.') ||\n    lower.includes('-util.') ||\n    lower.includes('-helper.')\n  ) {\n    return true;\n  }\n  \n  return false;\n}\n\n/**\n * Boosting Strategies\n */\n\n/**\n * Boosts relevance based on path segment matching.\n * Files with query tokens in their path are boosted.\n */\nexport class PathBoostingStrategy implements BoostingStrategy {\n  name = 'path-matching';\n  \n  apply(query: string, filepath: string, baseScore: number): number {\n    const queryTokens = query.toLowerCase().split(/\\s+/);\n    const pathSegments = filepath.toLowerCase().split('/');\n    \n    let boostFactor = 1.0;\n    \n    for (const token of queryTokens) {\n      if (token.length <= 2) continue;\n      if (pathSegments.some(seg => seg.includes(token))) {\n        boostFactor *= 0.9; // Reduce distance = increase relevance\n      }\n    }\n    \n    return baseScore * boostFactor;\n  }\n}\n\n/**\n * Boosts relevance based on filename matching.\n * Files with query tokens in their filename are strongly boosted.\n */\nexport class FilenameBoostingStrategy implements BoostingStrategy {\n  name = 'filename-matching';\n  \n  apply(query: string, filepath: string, baseScore: number): number {\n    const filename = path.basename(filepath, path.extname(filepath)).toLowerCase();\n    const queryTokens = query.toLowerCase().split(/\\s+/);\n    \n    let boostFactor = 1.0;\n    \n    for (const token of queryTokens) {\n      if (token.length <= 2) continue;\n      \n      if (filename === token) {\n        boostFactor *= 0.70; // Strong boost for exact match\n      } else if (filename.includes(token)) {\n        boostFactor *= 0.80; // Moderate boost for partial match\n      }\n    }\n    \n    return baseScore * boostFactor;\n  }\n}\n\n/**\n * Boosts relevance based on file type and query intent.\n * Different file types are boosted for different query intents.\n * \n * Note: This strategy focuses on file-type-specific boosting (test files,\n * documentation files, utility files, etc.). Path and filename boosting\n * are handled separately by PathBoostingStrategy and FilenameBoostingStrategy\n * in the BoostingComposer to avoid double-boosting.\n */\nexport class FileTypeBoostingStrategy implements BoostingStrategy {\n  name = 'file-type';\n  \n  constructor(private intent: QueryIntent) {}\n  \n  apply(query: string, filepath: string, baseScore: number): number {\n    switch (this.intent) {\n      case QueryIntent.LOCATION:\n        return this.applyLocationBoosting(query, filepath, baseScore);\n      \n      case QueryIntent.CONCEPTUAL:\n        return this.applyConceptualBoosting(query, filepath, baseScore);\n      \n      case QueryIntent.IMPLEMENTATION:\n        return this.applyImplementationBoosting(query, filepath, baseScore);\n      \n      default:\n        return baseScore;\n    }\n  }\n  \n  private applyLocationBoosting(_query: string, filepath: string, score: number): number {\n    // Note: Path and filename boosting are handled by PathBoostingStrategy and\n    // FilenameBoostingStrategy in the composer. This method only handles\n    // file-type-specific boosting for location queries.\n    \n    // Slightly deprioritize test files (users want implementation location, not tests)\n    if (isTestFile(filepath)) {\n      score *= 1.10;\n    }\n    \n    return score;\n  }\n  \n  private applyConceptualBoosting(_query: string, filepath: string, score: number): number {\n    // Note: Path and filename boosting are handled by PathBoostingStrategy and\n    // FilenameBoostingStrategy in the composer. This method only handles\n    // file-type-specific boosting for conceptual queries.\n    \n    // Strong boost for documentation files\n    if (isDocumentationFile(filepath)) {\n      score *= 0.65;\n      \n      const lower = filepath.toLowerCase();\n      if (\n        lower.includes('architecture') ||\n        lower.includes('workflow') ||\n        lower.includes('flow')\n      ) {\n        score *= 0.90; // Extra boost for architectural docs\n      }\n    }\n    \n    // Slight boost for utility files (often contain reusable logic)\n    if (isUtilityFile(filepath)) {\n      score *= 0.95;\n    }\n    \n    return score;\n  }\n  \n  private applyImplementationBoosting(_query: string, filepath: string, score: number): number {\n    // Note: Path and filename boosting are handled by PathBoostingStrategy and\n    // FilenameBoostingStrategy in the composer. This method only handles\n    // file-type-specific boosting for implementation queries.\n    \n    // Slightly deprioritize test files (user wants implementation, not tests)\n    if (isTestFile(filepath)) {\n      score *= 1.10;\n    }\n    \n    return score;\n  }\n}\n\n","import type { BoostingStrategy } from './types.js';\n\n/**\n * Composes multiple boosting strategies into a single pipeline.\n * \n * Strategies are applied sequentially, with each strategy\n * receiving the output of the previous strategy as input.\n * \n * @example\n * ```typescript\n * const composer = new BoostingComposer()\n *   .addStrategy(new PathBoostingStrategy())\n *   .addStrategy(new FilenameBoostingStrategy())\n *   .addStrategy(new FileTypeBoostingStrategy(intent));\n * \n * const boostedScore = composer.apply(query, filepath, baseScore);\n * ```\n */\nexport class BoostingComposer {\n  private strategies: BoostingStrategy[] = [];\n  \n  /**\n   * Add a boosting strategy to the pipeline.\n   * Strategies are applied in the order they are added.\n   * \n   * @param strategy - The strategy to add\n   * @returns This composer for chaining\n   */\n  addStrategy(strategy: BoostingStrategy): this {\n    this.strategies.push(strategy);\n    return this;\n  }\n  \n  /**\n   * Apply all strategies to a base score.\n   * \n   * @param query - The search query\n   * @param filepath - The file path being scored\n   * @param baseScore - The initial score from vector similarity\n   * @returns The final boosted score after all strategies\n   */\n  apply(query: string, filepath: string, baseScore: number): number {\n    let score = baseScore;\n    \n    for (const strategy of this.strategies) {\n      score = strategy.apply(query, filepath, score);\n    }\n    \n    return score;\n  }\n  \n  /**\n   * Get the names of all strategies in this composer.\n   * Useful for debugging and logging.\n   */\n  getStrategyNames(): string[] {\n    return this.strategies.map(s => s.name);\n  }\n  \n  /**\n   * Get the number of strategies in this composer.\n   */\n  getStrategyCount(): number {\n    return this.strategies.length;\n  }\n  \n  /**\n   * Clear all strategies from this composer.\n   */\n  clear(): void {\n    this.strategies = [];\n  }\n}\n\n","/**\n * Composable boosting strategies for semantic search relevance.\n * \n * This module provides a strategy pattern implementation for applying\n * relevance boosting to search results. Strategies can be composed\n * together to create complex boosting pipelines.\n * \n * @example\n * ```typescript\n * import { BoostingComposer, PathBoostingStrategy, FilenameBoostingStrategy } from './boosting';\n * \n * const composer = new BoostingComposer()\n *   .addStrategy(new PathBoostingStrategy())\n *   .addStrategy(new FilenameBoostingStrategy());\n * \n * const boostedScore = composer.apply(query, filepath, baseScore);\n * ```\n */\n\nexport * from './types.js';\nexport * from './strategies.js';\nexport * from './composer.js';\n\n","import { SearchResult } from './types.js';\nimport { EMBEDDING_DIMENSION } from '../embeddings/types.js';\nimport { DatabaseError, wrapError } from '../errors/index.js';\nimport { calculateRelevance } from './relevance.js';\nimport { classifyQueryIntent, QueryIntent } from './intent-classifier.js';\nimport { BoostingComposer, PathBoostingStrategy, FilenameBoostingStrategy, FileTypeBoostingStrategy } from './boosting/index.js';\n\n// TODO: Replace with proper type from lancedb-types.ts\n// Currently using 'any' because tests use incomplete mocks that don't satisfy full LanceDB interface\n// See: https://github.com/getlien/lien/issues/XXX\ntype LanceDBTable = any;\n\n/**\n * Cached strategy instances to avoid repeated instantiation overhead.\n * These strategies are stateless and can be safely reused across queries.\n */\nconst PATH_STRATEGY = new PathBoostingStrategy();\nconst FILENAME_STRATEGY = new FilenameBoostingStrategy();\n\n/**\n * Cached FileTypeBoostingStrategy instances for each intent.\n * Since there are only three possible intents, we can cache all three.\n */\nconst FILE_TYPE_STRATEGIES = {\n  [QueryIntent.LOCATION]: new FileTypeBoostingStrategy(QueryIntent.LOCATION),\n  [QueryIntent.CONCEPTUAL]: new FileTypeBoostingStrategy(QueryIntent.CONCEPTUAL),\n  [QueryIntent.IMPLEMENTATION]: new FileTypeBoostingStrategy(QueryIntent.IMPLEMENTATION),\n};\n\n/**\n * Cached BoostingComposer instances for each intent.\n * Pre-configured with the appropriate strategy pipeline for each intent type.\n * This avoids creating a new composer instance on every search result.\n */\nconst BOOSTING_COMPOSERS = {\n  [QueryIntent.LOCATION]: new BoostingComposer()\n    .addStrategy(PATH_STRATEGY)\n    .addStrategy(FILENAME_STRATEGY)\n    .addStrategy(FILE_TYPE_STRATEGIES[QueryIntent.LOCATION]),\n  [QueryIntent.CONCEPTUAL]: new BoostingComposer()\n    .addStrategy(PATH_STRATEGY)\n    .addStrategy(FILENAME_STRATEGY)\n    .addStrategy(FILE_TYPE_STRATEGIES[QueryIntent.CONCEPTUAL]),\n  [QueryIntent.IMPLEMENTATION]: new BoostingComposer()\n    .addStrategy(PATH_STRATEGY)\n    .addStrategy(FILENAME_STRATEGY)\n    .addStrategy(FILE_TYPE_STRATEGIES[QueryIntent.IMPLEMENTATION]),\n};\n\n/**\n * Database record structure as stored in LanceDB\n */\ninterface DBRecord {\n  vector: number[];\n  content: string;\n  file: string;\n  startLine: number;\n  endLine: number;\n  type: string;\n  language: string;\n  functionNames: string[];\n  classNames: string[];\n  interfaceNames: string[];\n  // AST-derived metadata (v0.13.0)\n  symbolName?: string;\n  symbolType?: string;\n  parentClass?: string;\n  complexity?: number;\n  cognitiveComplexity?: number;\n  parameters?: string[];\n  signature?: string;\n  imports?: string[];\n  // Halstead metrics (v0.19.0)\n  halsteadVolume?: number;\n  halsteadDifficulty?: number;\n  halsteadEffort?: number;\n  halsteadBugs?: number;\n  _distance?: number; // Added by LanceDB for search results\n}\n\n/**\n * Check if a DB record has valid content and file path.\n * Used to filter out empty/invalid records from query results.\n */\nfunction isValidRecord(r: DBRecord): boolean {\n  return Boolean(\n    r.content && \n    r.content.trim().length > 0 &&\n    r.file && \n    r.file.length > 0\n  );\n}\n\n/**\n * Check if an array field has valid (non-empty) entries.\n * LanceDB stores empty arrays as [''] which we need to filter out.\n */\nfunction hasValidArrayEntries(arr: string[] | undefined): boolean {\n  return Boolean(arr && arr.length > 0 && arr[0] !== '');\n}\n\n/**\n * Get symbols for a specific type from a DB record.\n * Consolidates the symbol extraction logic used across query functions.\n */\nfunction getSymbolsForType(\n  r: DBRecord, \n  symbolType?: 'function' | 'class' | 'interface'\n): string[] {\n  if (symbolType === 'function') return r.functionNames || [];\n  if (symbolType === 'class') return r.classNames || [];\n  if (symbolType === 'interface') return r.interfaceNames || [];\n  return [\n    ...(r.functionNames || []),\n    ...(r.classNames || []),\n    ...(r.interfaceNames || []),\n  ];\n}\n\n/**\n * Convert a DB record to base SearchResult metadata.\n * Shared between all query functions to avoid duplication.\n */\nfunction buildSearchResultMetadata(r: DBRecord): SearchResult['metadata'] {\n  return {\n    file: r.file,\n    startLine: r.startLine,\n    endLine: r.endLine,\n    type: r.type as 'function' | 'class' | 'block',\n    language: r.language,\n    symbolName: r.symbolName || undefined,\n    symbolType: r.symbolType as 'function' | 'method' | 'class' | 'interface' | undefined,\n    parentClass: r.parentClass || undefined,\n    complexity: r.complexity || undefined,\n    cognitiveComplexity: r.cognitiveComplexity || undefined,\n    parameters: hasValidArrayEntries(r.parameters) ? r.parameters : undefined,\n    signature: r.signature || undefined,\n    imports: hasValidArrayEntries(r.imports) ? r.imports : undefined,\n    // Halstead metrics (v0.19.0) - use explicit null check to preserve valid 0 values\n    halsteadVolume: r.halsteadVolume != null ? r.halsteadVolume : undefined,\n    halsteadDifficulty: r.halsteadDifficulty != null ? r.halsteadDifficulty : undefined,\n    halsteadEffort: r.halsteadEffort != null ? r.halsteadEffort : undefined,\n    halsteadBugs: r.halsteadBugs != null ? r.halsteadBugs : undefined,\n  };\n}\n\n/**\n * Apply relevance boosting strategies to a search score.\n * \n * Uses composable boosting strategies based on query intent:\n * - Path matching: Boost files with query tokens in path\n * - Filename matching: Boost files with query tokens in filename\n * - File type boosting: Intent-specific boosting (docs for conceptual, etc.)\n */\nfunction applyRelevanceBoosting(\n  query: string | undefined,\n  filepath: string,\n  baseScore: number\n): number {\n  if (!query) {\n    return baseScore;\n  }\n  \n  const intent = classifyQueryIntent(query);\n  \n  // Use cached composer instance configured for this intent\n  return BOOSTING_COMPOSERS[intent].apply(query, filepath, baseScore);\n}\n\n/**\n * Convert a DBRecord to a SearchResult\n */\nfunction dbRecordToSearchResult(\n  r: DBRecord,\n  query?: string\n): SearchResult {\n  const baseScore = r._distance ?? 0;\n  const boostedScore = applyRelevanceBoosting(query, r.file, baseScore);\n  \n  return {\n    content: r.content,\n    metadata: buildSearchResultMetadata(r),\n    score: boostedScore,\n    relevance: calculateRelevance(boostedScore),\n  };\n}\n\n/**\n * Search the vector database\n */\nexport async function search(\n  table: LanceDBTable,\n  queryVector: Float32Array,\n  limit: number = 5,\n  query?: string\n): Promise<SearchResult[]> {\n  if (!table) {\n    throw new DatabaseError('Vector database not initialized');\n  }\n  \n  try {\n    const results = await table\n      .search(Array.from(queryVector))\n      .limit(limit + 20)\n      .toArray();\n    \n    const filtered = (results as unknown as DBRecord[])\n      .filter(isValidRecord)\n      .map((r: DBRecord) => dbRecordToSearchResult(r, query))\n      .sort((a, b) => a.score - b.score)\n      .slice(0, limit);\n    \n    return filtered;\n  } catch (error) {\n    const errorMsg = String(error);\n    \n    // Detect corrupted index\n    if (errorMsg.includes('Not found:') || errorMsg.includes('.lance')) {\n      throw new DatabaseError(\n        `Index appears corrupted or outdated. Please restart the MCP server or run 'lien reindex' in the project directory.`,\n        { originalError: error }\n      );\n    }\n    \n    throw wrapError(error, 'Failed to search vector database');\n  }\n}\n\n/**\n * Scan the database with filters\n */\nexport async function scanWithFilter(\n  table: LanceDBTable,\n  options: {\n    language?: string;\n    pattern?: string;\n    limit?: number;\n  }\n): Promise<SearchResult[]> {\n  if (!table) {\n    throw new DatabaseError('Vector database not initialized');\n  }\n  \n  const { language, pattern, limit = 100 } = options;\n  \n  try {\n    const zeroVector = Array(EMBEDDING_DIMENSION).fill(0);\n    const query = table.search(zeroVector)\n      .where('file != \"\"')\n      .limit(Math.max(limit * 5, 200));\n    \n    const results = await query.toArray();\n    \n    let filtered = (results as unknown as DBRecord[]).filter(isValidRecord);\n    \n    if (language) {\n      filtered = filtered.filter((r: DBRecord) => \n        r.language && r.language.toLowerCase() === language.toLowerCase()\n      );\n    }\n    \n    if (pattern) {\n      const regex = new RegExp(pattern, 'i');\n      filtered = filtered.filter((r: DBRecord) =>\n        regex.test(r.content) || regex.test(r.file)\n      );\n    }\n    \n    return filtered.slice(0, limit).map((r: DBRecord) => ({\n      content: r.content,\n      metadata: buildSearchResultMetadata(r),\n      score: 0,\n      relevance: calculateRelevance(0),\n    }));\n  } catch (error) {\n    throw wrapError(error, 'Failed to scan with filter');\n  }\n}\n\n/**\n * Helper to check if a record matches the requested symbol type\n */\n/** Maps query symbolType to acceptable AST symbolType values */\nconst SYMBOL_TYPE_MATCHES: Record<string, Set<string>> = {\n  function: new Set(['function', 'method']),\n  class: new Set(['class']),\n  interface: new Set(['interface']),\n};\n\nfunction matchesSymbolType(\n  record: DBRecord,\n  symbolType: 'function' | 'class' | 'interface',\n  symbols: string[]\n): boolean {\n  // If AST-based symbolType exists, use lookup table\n  if (record.symbolType) {\n    return SYMBOL_TYPE_MATCHES[symbolType]?.has(record.symbolType) ?? false;\n  }\n\n  // Fallback: check if pre-AST symbols array has valid entries\n  return symbols.length > 0 && symbols.some((s: string) => s.length > 0 && s !== '');\n}\n\ninterface SymbolQueryOptions {\n  language?: string;\n  pattern?: string;\n  symbolType?: 'function' | 'class' | 'interface';\n}\n\n/**\n * Check if a record matches the symbol query filters.\n * Extracted to reduce complexity of querySymbols.\n */\nfunction matchesSymbolFilter(\n  r: DBRecord, \n  { language, pattern, symbolType }: SymbolQueryOptions\n): boolean {\n  // Language filter\n  if (language && (!r.language || r.language.toLowerCase() !== language.toLowerCase())) {\n    return false;\n  }\n  \n  const symbols = getSymbolsForType(r, symbolType);\n  const astSymbolName = r.symbolName || '';\n  \n  // Must have at least one symbol (legacy or AST-based)\n  if (symbols.length === 0 && !astSymbolName) {\n    return false;\n  }\n  \n  // Pattern filter (if provided)\n  if (pattern) {\n    const regex = new RegExp(pattern, 'i');\n    const nameMatches = symbols.some((s: string) => regex.test(s)) || regex.test(astSymbolName);\n    if (!nameMatches) return false;\n  }\n  \n  // Symbol type filter (if provided)\n  if (symbolType) {\n    return matchesSymbolType(r, symbolType, symbols);\n  }\n  \n  return true;\n}\n\n/**\n * Build legacy symbols object for backwards compatibility.\n */\nfunction buildLegacySymbols(r: DBRecord) {\n  return {\n    functions: hasValidArrayEntries(r.functionNames) ? r.functionNames : [],\n    classes: hasValidArrayEntries(r.classNames) ? r.classNames : [],\n    interfaces: hasValidArrayEntries(r.interfaceNames) ? r.interfaceNames : [],\n  };\n}\n\n/**\n * Query symbols (functions, classes, interfaces)\n */\nexport async function querySymbols(\n  table: LanceDBTable,\n  options: {\n    language?: string;\n    pattern?: string;\n    symbolType?: 'function' | 'class' | 'interface';\n    limit?: number;\n  }\n): Promise<SearchResult[]> {\n  if (!table) {\n    throw new DatabaseError('Vector database not initialized');\n  }\n  \n  const { language, pattern, symbolType, limit = 50 } = options;\n  const filterOpts: SymbolQueryOptions = { language, pattern, symbolType };\n  \n  try {\n    const zeroVector = Array(EMBEDDING_DIMENSION).fill(0);\n    const query = table.search(zeroVector)\n      .where('file != \"\"')\n      .limit(Math.max(limit * 10, 500));\n    \n    const results = await query.toArray();\n    \n    const filtered = (results as unknown as DBRecord[])\n      .filter((r) => isValidRecord(r) && matchesSymbolFilter(r, filterOpts));\n    \n    return filtered.slice(0, limit).map((r: DBRecord) => ({\n      content: r.content,\n      metadata: {\n        ...buildSearchResultMetadata(r),\n        symbols: buildLegacySymbols(r),\n      },\n      score: 0,\n      relevance: calculateRelevance(0),\n    }));\n  } catch (error) {\n    throw wrapError(error, 'Failed to query symbols');\n  }\n}\n\n/**\n * Scan all chunks in the database\n * First gets the total count, then fetches all with a single query\n * This is more efficient than pagination for local/embedded databases like LanceDB\n */\nexport async function scanAll(\n  table: LanceDBTable,\n  options: {\n    language?: string;\n    pattern?: string;\n  } = {}\n): Promise<SearchResult[]> {\n  if (!table) {\n    throw new DatabaseError('Vector database not initialized');\n  }\n  \n  try {\n    // Get total row count to determine limit\n    const totalRows = await table.countRows();\n    \n    // Fetch all rows in one query (LanceDB is local, this is efficient)\n    // Note: scanWithFilter internally fetches 5x the limit to handle filtering overhead,\n    // then caps output to 'limit'. We pass totalRows so we get all rows back after\n    // filtering. The 5x overfetch is acceptable overhead for local DBs.\n    const MIN_SCAN_LIMIT = 1000;\n    const results = await scanWithFilter(table, {\n      ...options,\n      limit: Math.max(totalRows, MIN_SCAN_LIMIT),\n    });\n    \n    return results;\n  } catch (error) {\n    throw wrapError(error, 'Failed to scan all chunks');\n  }\n}\n","import { ChunkMetadata } from '../indexer/types.js';\nimport { DatabaseError } from '../errors/index.js';\nimport { VECTOR_DB_MAX_BATCH_SIZE, VECTOR_DB_MIN_BATCH_SIZE } from '../constants.js';\n\n// TODO: Replace with proper types from lancedb-types.ts\n// Currently using 'any' because tests use incomplete mocks that don't satisfy full LanceDB interface\n// Proper types: Awaited<ReturnType<typeof lancedb.connect>> and Awaited<ReturnType<Connection['openTable']>>\ntype LanceDBConnection = any;\ntype LanceDBTable = any;\n\n/**\n * Batch of data to be inserted into the vector database\n */\ninterface BatchToProcess {\n  vectors: Float32Array[];\n  metadatas: ChunkMetadata[];\n  contents: string[];\n}\n\n/**\n * Database record format for LanceDB storage\n */\ninterface DatabaseRecord {\n  vector: number[];\n  content: string;\n  file: string;\n  startLine: number;\n  endLine: number;\n  type: string;\n  language: string;\n  functionNames: string[];\n  classNames: string[];\n  interfaceNames: string[];\n  symbolName: string;\n  symbolType: string;\n  parentClass: string;\n  complexity: number;\n  cognitiveComplexity: number;\n  parameters: string[];\n  signature: string;\n  imports: string[];\n  // Halstead metrics (v0.19.0)\n  halsteadVolume: number;\n  halsteadDifficulty: number;\n  halsteadEffort: number;\n  halsteadBugs: number;\n}\n\n/**\n * Transform a chunk's data into a database record.\n * Handles missing/empty metadata by providing defaults for Arrow type inference.\n */\nfunction transformChunkToRecord(\n  vector: Float32Array,\n  content: string,\n  metadata: ChunkMetadata\n): DatabaseRecord {\n  return {\n    vector: Array.from(vector),\n    content,\n    file: metadata.file,\n    startLine: metadata.startLine,\n    endLine: metadata.endLine,\n    type: metadata.type,\n    language: metadata.language,\n    // Ensure arrays have at least empty string for Arrow type inference\n    functionNames: getNonEmptyArray(metadata.symbols?.functions),\n    classNames: getNonEmptyArray(metadata.symbols?.classes),\n    interfaceNames: getNonEmptyArray(metadata.symbols?.interfaces),\n    // AST-derived metadata (v0.13.0)\n    symbolName: metadata.symbolName || '',\n    symbolType: metadata.symbolType || '',\n    parentClass: metadata.parentClass || '',\n    complexity: metadata.complexity || 0,\n    cognitiveComplexity: metadata.cognitiveComplexity || 0,\n    parameters: getNonEmptyArray(metadata.parameters),\n    signature: metadata.signature || '',\n    imports: getNonEmptyArray(metadata.imports),\n    // Halstead metrics (v0.19.0)\n    halsteadVolume: metadata.halsteadVolume || 0,\n    halsteadDifficulty: metadata.halsteadDifficulty || 0,\n    halsteadEffort: metadata.halsteadEffort || 0,\n    halsteadBugs: metadata.halsteadBugs || 0,\n  };\n}\n\n/**\n * Returns the array if non-empty, otherwise returns [''] for Arrow type inference\n */\nfunction getNonEmptyArray(arr: string[] | undefined): string[] {\n  return arr && arr.length > 0 ? arr : [''];\n}\n\n/**\n * Split a batch in half for retry logic\n */\nfunction splitBatchInHalf(batch: BatchToProcess): [BatchToProcess, BatchToProcess] {\n  const half = Math.floor(batch.vectors.length / 2);\n  return [\n    {\n      vectors: batch.vectors.slice(0, half),\n      metadatas: batch.metadatas.slice(0, half),\n      contents: batch.contents.slice(0, half),\n    },\n    {\n      vectors: batch.vectors.slice(half),\n      metadatas: batch.metadatas.slice(half),\n      contents: batch.contents.slice(half),\n    },\n  ];\n}\n\n/**\n * Transform all chunks in a batch to database records\n */\nfunction transformBatchToRecords(batch: BatchToProcess): DatabaseRecord[] {\n  return batch.vectors.map((vector, i) =>\n    transformChunkToRecord(vector, batch.contents[i], batch.metadatas[i])\n  );\n}\n\n/**\n * Insert a batch of vectors into the database\n * \n * @returns The table instance after insertion, or null only when:\n *          - vectors.length === 0 AND table === null (no-op case)\n *          For non-empty batches, always returns a valid table or throws.\n * @throws {DatabaseError} If database not initialized or insertion fails\n */\nexport async function insertBatch(\n  db: LanceDBConnection,\n  table: LanceDBTable | null,\n  tableName: string,\n  vectors: Float32Array[],\n  metadatas: ChunkMetadata[],\n  contents: string[]\n): Promise<LanceDBTable | null> {\n  if (!db) {\n    throw new DatabaseError('Vector database not initialized');\n  }\n  \n  if (vectors.length !== metadatas.length || vectors.length !== contents.length) {\n    throw new DatabaseError('Vectors, metadatas, and contents arrays must have the same length', {\n      vectorsLength: vectors.length,\n      metadatasLength: metadatas.length,\n      contentsLength: contents.length,\n    });\n  }\n  \n  // Handle empty batch gracefully - return table as-is (could be null)\n  if (vectors.length === 0) {\n    return table;\n  }\n  \n  // Split large batches into smaller chunks\n  if (vectors.length > VECTOR_DB_MAX_BATCH_SIZE) {\n    let currentTable = table;\n    for (let i = 0; i < vectors.length; i += VECTOR_DB_MAX_BATCH_SIZE) {\n      const batchVectors = vectors.slice(i, Math.min(i + VECTOR_DB_MAX_BATCH_SIZE, vectors.length));\n      const batchMetadata = metadatas.slice(i, Math.min(i + VECTOR_DB_MAX_BATCH_SIZE, vectors.length));\n      const batchContents = contents.slice(i, Math.min(i + VECTOR_DB_MAX_BATCH_SIZE, vectors.length));\n      \n      currentTable = await insertBatchInternal(db, currentTable, tableName, batchVectors, batchMetadata, batchContents);\n    }\n    if (!currentTable) {\n      throw new DatabaseError('Failed to create table during batch insert');\n    }\n    return currentTable;\n  } else {\n    return insertBatchInternal(db, table, tableName, vectors, metadatas, contents);\n  }\n}\n\n/**\n * Internal method to insert a single batch with iterative retry logic.\n * Uses a queue-based approach to handle batch splitting on failure.\n * \n * @returns Always returns a valid LanceDBTable or throws DatabaseError\n */\nasync function insertBatchInternal(\n  db: LanceDBConnection,\n  table: LanceDBTable | null,\n  tableName: string,\n  vectors: Float32Array[],\n  metadatas: ChunkMetadata[],\n  contents: string[]\n): Promise<LanceDBTable> {\n  const queue: BatchToProcess[] = [{ vectors, metadatas, contents }];\n  const failedBatches: BatchToProcess[] = [];\n  let currentTable = table;\n  let lastError: Error | undefined;\n  \n  while (queue.length > 0) {\n    const batch = queue.shift()!;\n    const insertResult = await tryInsertBatch(db, currentTable, tableName, batch);\n    \n    if (insertResult.success) {\n      currentTable = insertResult.table;\n    } else {\n      lastError = insertResult.error;\n      handleBatchFailure(batch, queue, failedBatches);\n    }\n  }\n  \n  throwIfBatchesFailed(failedBatches, lastError);\n  \n  if (!currentTable) {\n    throw new DatabaseError('Failed to create table during batch insert');\n  }\n  \n  return currentTable;\n}\n\n/**\n * Result of attempting to insert a batch\n */\ninterface InsertResult {\n  success: boolean;\n  table: LanceDBTable | null;\n  error?: Error;\n}\n\n/**\n * Attempt to insert a batch of records into the database.\n * Errors are captured and returned (not thrown) to support retry logic.\n */\nasync function tryInsertBatch(\n  db: LanceDBConnection,\n  currentTable: LanceDBTable | null,\n  tableName: string,\n  batch: BatchToProcess\n): Promise<InsertResult> {\n  try {\n    const records = transformBatchToRecords(batch);\n    \n    if (!currentTable) {\n      const newTable = await db.createTable(tableName, records);\n      return { success: true, table: newTable };\n    } else {\n      await currentTable.add(records);\n      return { success: true, table: currentTable };\n    }\n  } catch (error) {\n    // Error is captured for retry logic - will be included in final error if all retries fail\n    return { success: false, table: currentTable, error: error as Error };\n  }\n}\n\n/**\n * Handle a failed batch insertion by either splitting and retrying or marking as failed\n */\nfunction handleBatchFailure(\n  batch: BatchToProcess,\n  queue: BatchToProcess[],\n  failedBatches: BatchToProcess[]\n): void {\n  if (batch.vectors.length > VECTOR_DB_MIN_BATCH_SIZE) {\n    // Split and retry\n    const [firstHalf, secondHalf] = splitBatchInHalf(batch);\n    queue.push(firstHalf, secondHalf);\n  } else {\n    // Can't split further, mark as failed\n    failedBatches.push(batch);\n  }\n}\n\n/**\n * Throw an error if any batches failed after all retry attempts.\n * Includes the last error encountered for debugging.\n */\nfunction throwIfBatchesFailed(failedBatches: BatchToProcess[], lastError?: Error): void {\n  if (failedBatches.length === 0) return;\n  \n  const totalFailed = failedBatches.reduce((sum, batch) => sum + batch.vectors.length, 0);\n  throw new DatabaseError(\n    `Failed to insert ${totalFailed} record(s) after retry attempts`,\n    {\n      failedBatches: failedBatches.length,\n      totalRecords: totalFailed,\n      sampleFile: failedBatches[0].metadatas[0].file,\n      lastError: lastError?.message,\n    }\n  );\n}\n","import fs from 'fs/promises';\nimport path from 'path';\nimport { ChunkMetadata } from '../indexer/types.js';\nimport { DatabaseError, wrapError } from '../errors/index.js';\nimport { writeVersionFile } from './version.js';\nimport { insertBatch } from './batch-insert.js';\n\n// TODO: Replace with proper types from lancedb-types.ts\n// Currently using 'any' because tests use incomplete mocks that don't satisfy full LanceDB interface\n// Proper types: Awaited<ReturnType<typeof lancedb.connect>> and Awaited<ReturnType<Connection['openTable']>>\ntype LanceDBConnection = any;\ntype LanceDBTable = any;\n\n/**\n * Clear all data from the vector database.\n * Drops the table AND cleans up the .lance directory to prevent corrupted state.\n */\nexport async function clear(\n  db: LanceDBConnection,\n  table: LanceDBTable | null,\n  tableName: string,\n  dbPath?: string\n): Promise<void> {\n  if (!db) {\n    throw new DatabaseError('Vector database not initialized');\n  }\n  \n  try {\n    // Drop table if it exists\n    if (table) {\n      await db.dropTable(tableName);\n    }\n    \n    // Clean up the .lance directory if dbPath provided\n    // This prevents corrupted state after dropTable\n    if (dbPath) {\n      const lanceDir = path.join(dbPath, `${tableName}.lance`);\n      try {\n        await fs.rm(lanceDir, { recursive: true, force: true });\n      } catch {\n        // Ignore errors - directory may not exist\n      }\n    }\n  } catch (error) {\n    throw wrapError(error, 'Failed to clear vector database');\n  }\n}\n\n/**\n * Delete all chunks from a specific file\n */\nexport async function deleteByFile(\n  table: LanceDBTable,\n  filepath: string\n): Promise<void> {\n  if (!table) {\n    throw new DatabaseError('Vector database not initialized');\n  }\n  \n  try {\n    await table.delete(`file = \"${filepath}\"`);\n  } catch (error) {\n    throw wrapError(error, 'Failed to delete file from vector database');\n  }\n}\n\n/**\n * Update a file in the index by atomically deleting old chunks and inserting new ones\n */\nexport async function updateFile(\n  db: LanceDBConnection,\n  table: LanceDBTable | null,\n  tableName: string,\n  dbPath: string,\n  filepath: string,\n  vectors: Float32Array[],\n  metadatas: ChunkMetadata[],\n  contents: string[]\n): Promise<LanceDBTable> {\n  if (!table) {\n    throw new DatabaseError('Vector database not initialized');\n  }\n  \n  try {\n    // 1. Delete old chunks from this file\n    await deleteByFile(table, filepath);\n    \n    // 2. Insert new chunks (if any)\n    let updatedTable = table;\n    if (vectors.length > 0) {\n      updatedTable = await insertBatch(db, table, tableName, vectors, metadatas, contents);\n      if (!updatedTable) {\n        throw new DatabaseError('insertBatch unexpectedly returned null');\n      }\n    }\n    \n    // 3. Update version file to trigger MCP reconnection\n    await writeVersionFile(dbPath);\n    \n    return updatedTable;\n  } catch (error) {\n    throw wrapError(error, 'Failed to update file in vector database');\n  }\n}\n\n","import * as lancedb from '@lancedb/lancedb';\nimport path from 'path';\nimport os from 'os';\nimport crypto from 'crypto';\nimport { SearchResult, VectorDBInterface } from './types.js';\nimport { ChunkMetadata } from '../indexer/types.js';\nimport { EMBEDDING_DIMENSION } from '../embeddings/types.js';\nimport { readVersionFile } from './version.js';\nimport { DatabaseError, wrapError } from '../errors/index.js';\nimport * as queryOps from './query.js';\nimport * as batchOps from './batch-insert.js';\nimport * as maintenanceOps from './maintenance.js';\n\ntype LanceDBConnection = Awaited<ReturnType<typeof lancedb.connect>>;\ntype LanceDBTable = Awaited<ReturnType<LanceDBConnection['openTable']>>;\n\nexport class VectorDB implements VectorDBInterface {\n  private db: LanceDBConnection | null = null;\n  private table: LanceDBTable | null = null;\n  public readonly dbPath: string;\n  private readonly tableName = 'code_chunks';\n  private lastVersionCheck: number = 0;\n  private currentVersion: number = 0;\n  \n  constructor(projectRoot: string) {\n    // Store in user's home directory under ~/.lien/indices/{projectName-hash}\n    const projectName = path.basename(projectRoot);\n    \n    // Create unique identifier from full path to prevent collisions\n    const pathHash = crypto\n      .createHash('md5')\n      .update(projectRoot)\n      .digest('hex')\n      .substring(0, 8);\n    \n    this.dbPath = path.join(\n      os.homedir(),\n      '.lien',\n      'indices',\n      `${projectName}-${pathHash}`\n    );\n  }\n  \n  async initialize(): Promise<void> {\n    try {\n      this.db = await lancedb.connect(this.dbPath);\n      \n      try {\n        this.table = await this.db.openTable(this.tableName);\n      } catch {\n        // Table doesn't exist yet - will be created on first insert\n        this.table = null;\n      }\n      \n      // Read and cache the current version\n      try {\n        this.currentVersion = await readVersionFile(this.dbPath);\n      } catch {\n        // Version file doesn't exist yet, will be created on first index\n        this.currentVersion = 0;\n      }\n    } catch (error: unknown) {\n      throw wrapError(error, 'Failed to initialize vector database', { dbPath: this.dbPath });\n    }\n  }\n  \n  async insertBatch(\n    vectors: Float32Array[],\n    metadatas: ChunkMetadata[],\n    contents: string[]\n  ): Promise<void> {\n    if (!this.db) {\n      throw new DatabaseError('Vector database not initialized');\n    }\n    // Note: insertBatch may return null for empty batches when table is null\n    // This is correct behavior - empty batches are no-ops and don't create tables\n    this.table = await batchOps.insertBatch(\n      this.db,\n      this.table,\n      this.tableName,\n      vectors,\n      metadatas,\n      contents\n    );\n  }\n  \n  async search(\n    queryVector: Float32Array,\n    limit: number = 5,\n    query?: string\n  ): Promise<SearchResult[]> {\n    if (!this.table) {\n      throw new DatabaseError('Vector database not initialized');\n    }\n    \n    try {\n      return await queryOps.search(this.table, queryVector, limit, query);\n    } catch (error) {\n      const errorMsg = String(error);\n      \n      // Detect corrupted index or missing data files\n      if (errorMsg.includes('Not found:') || errorMsg.includes('.lance')) {\n        // Attempt to reconnect - index may have been rebuilt\n        try {\n          await this.initialize();\n          if (!this.table) {\n            throw new DatabaseError('Vector database not initialized after reconnection');\n          }\n          return await queryOps.search(this.table, queryVector, limit, query);\n        } catch (retryError: unknown) {\n          throw new DatabaseError(\n            `Index appears corrupted or outdated. Please restart the MCP server or run 'lien reindex' in the project directory.`,\n            { originalError: retryError }\n          );\n        }\n      }\n      \n      throw error;\n    }\n  }\n  \n  async scanWithFilter(options: {\n    language?: string;\n    pattern?: string;\n    limit?: number;\n  }): Promise<SearchResult[]> {\n    if (!this.table) {\n      throw new DatabaseError('Vector database not initialized');\n    }\n    return queryOps.scanWithFilter(this.table, options);\n  }\n  \n  /**\n   * Scan all chunks in the database\n   * Fetches total count first, then retrieves all chunks in a single optimized query\n   * @param options - Filter options (language, pattern)\n   * @returns All matching chunks\n   */\n  async scanAll(options: {\n    language?: string;\n    pattern?: string;\n  } = {}): Promise<SearchResult[]> {\n    if (!this.table) {\n      throw new DatabaseError('Vector database not initialized');\n    }\n    return queryOps.scanAll(this.table, options);\n  }\n  \n  async querySymbols(options: {\n    language?: string;\n    pattern?: string;\n    symbolType?: 'function' | 'class' | 'interface';\n    limit?: number;\n  }): Promise<SearchResult[]> {\n    if (!this.table) {\n      throw new DatabaseError('Vector database not initialized');\n    }\n    return queryOps.querySymbols(this.table, options);\n  }\n  \n  async clear(): Promise<void> {\n    if (!this.db) {\n      throw new DatabaseError('Vector database not initialized');\n    }\n    await maintenanceOps.clear(this.db, this.table, this.tableName, this.dbPath);\n    this.table = null;\n  }\n  \n  async deleteByFile(filepath: string): Promise<void> {\n    if (!this.table) {\n      throw new DatabaseError('Vector database not initialized');\n    }\n    await maintenanceOps.deleteByFile(this.table, filepath);\n  }\n  \n  async updateFile(\n    filepath: string,\n    vectors: Float32Array[],\n    metadatas: ChunkMetadata[],\n    contents: string[]\n  ): Promise<void> {\n    if (!this.db) {\n      throw new DatabaseError('Vector database connection not initialized');\n    }\n    if (!this.table) {\n      throw new DatabaseError('Vector database table not initialized');\n    }\n    this.table = await maintenanceOps.updateFile(\n      this.db,\n      this.table,\n      this.tableName,\n      this.dbPath,\n      filepath,\n      vectors,\n      metadatas,\n      contents\n    );\n  }\n  \n  async checkVersion(): Promise<boolean> {\n    const now = Date.now();\n    \n    // Cache version checks for 1 second to minimize I/O\n    if (now - this.lastVersionCheck < 1000) {\n      return false;\n    }\n    \n    this.lastVersionCheck = now;\n    \n    try {\n      const version = await readVersionFile(this.dbPath);\n      \n      if (version > this.currentVersion) {\n        this.currentVersion = version;\n        return true;\n      }\n      \n      return false;\n    } catch (error) {\n      // If we can't read version file, don't reconnect\n      return false;\n    }\n  }\n  \n  async reconnect(): Promise<void> {\n    try {\n      // Close existing connections to force reload from disk\n      this.table = null;\n      this.db = null;\n      \n      // Reinitialize with fresh connection\n      await this.initialize();\n    } catch (error) {\n      throw wrapError(error, 'Failed to reconnect to vector database');\n    }\n  }\n  \n  getCurrentVersion(): number {\n    return this.currentVersion;\n  }\n  \n  getVersionDate(): string {\n    if (this.currentVersion === 0) {\n      return 'Unknown';\n    }\n    return new Date(this.currentVersion).toLocaleString();\n  }\n  \n  async hasData(): Promise<boolean> {\n    if (!this.table) {\n      return false;\n    }\n    \n    try {\n      const count = await this.table.countRows();\n      \n      if (count === 0) {\n        return false;\n      }\n      \n      // Sample a few rows to verify they contain real data\n      const sample = await this.table\n        .search(Array(EMBEDDING_DIMENSION).fill(0))\n        .limit(Math.min(count, 5))\n        .toArray();\n      \n      const hasRealData = (sample as unknown as any[]).some((r: any) => \n        r.content && \n        r.content.trim().length > 0\n      );\n      \n      return hasRealData;\n    } catch {\n      // If any error occurs, assume no data\n      return false;\n    }\n  }\n  \n  static async load(projectRoot: string): Promise<VectorDB> {\n    const db = new VectorDB(projectRoot);\n    await db.initialize();\n    return db;\n  }\n}\n","import fs from 'fs/promises';\nimport path from 'path';\nimport { INDEX_FORMAT_VERSION } from '../constants.js';\nimport { GitState } from '../git/tracker.js';\nimport { getPackageVersion } from '../utils/version.js';\n\nconst MANIFEST_FILE = 'manifest.json';\n\n/**\n * Represents a single file in the index manifest\n */\nexport interface FileEntry {\n  filepath: string;\n  lastModified: number;\n  chunkCount: number;\n}\n\n/**\n * Index manifest tracking all indexed files and version information\n */\nexport interface IndexManifest {\n  formatVersion: number;      // Index format version for compatibility checking\n  lienVersion: string;         // Lien package version (for reference)\n  lastIndexed: number;         // Timestamp of last indexing operation\n  gitState?: GitState;         // Last known git state\n  files: Record<string, FileEntry>;  // Map of filepath -> FileEntry (stored as object for JSON)\n}\n\n/**\n * Manages the index manifest file, tracking which files are indexed\n * and their metadata for incremental indexing support.\n * \n * The manifest includes version checking to invalidate indices when\n * Lien's indexing format changes (e.g., new chunking algorithm,\n * different embedding model, schema changes).\n */\nexport class ManifestManager {\n  private manifestPath: string;\n  private indexPath: string;\n  \n  /**\n   * Promise-based lock to prevent race conditions during concurrent updates.\n   * Ensures read-modify-write operations are atomic.\n   */\n  private updateLock = Promise.resolve();\n  \n  /**\n   * Creates a new ManifestManager\n   * @param indexPath - Path to the index directory (same as VectorDB path)\n   */\n  constructor(indexPath: string) {\n    this.indexPath = indexPath;\n    this.manifestPath = path.join(indexPath, MANIFEST_FILE);\n  }\n  \n  /**\n   * Loads the manifest from disk.\n   * Returns null if:\n   * - Manifest doesn't exist (first run)\n   * - Manifest is corrupt\n   * - Format version is incompatible (triggers full reindex)\n   * \n   * @returns Loaded manifest or null\n   */\n  async load(): Promise<IndexManifest | null> {\n    try {\n      const content = await fs.readFile(this.manifestPath, 'utf-8');\n      const manifest = JSON.parse(content) as IndexManifest;\n      \n      // VERSION CHECK: Invalidate if format version doesn't match\n      if (manifest.formatVersion !== INDEX_FORMAT_VERSION) {\n        console.error(\n          `[Lien] Index format v${manifest.formatVersion} is incompatible with current v${INDEX_FORMAT_VERSION}`\n        );\n        console.error(`[Lien] Full reindex required after Lien upgrade`);\n        \n        // Clear old manifest and return null (triggers full reindex)\n        await this.clear();\n        return null;\n      }\n      \n      return manifest;\n    } catch (error) {\n      // File doesn't exist or is invalid - return null for first run\n      if ((error as NodeJS.ErrnoException).code === 'ENOENT') {\n        return null;\n      }\n      \n      // Corrupt manifest - log warning and return null\n      console.error(`[Lien] Warning: Failed to load manifest: ${error}`);\n      return null;\n    }\n  }\n  \n  /**\n   * Saves the manifest to disk.\n   * Always saves with current format and package versions.\n   * \n   * @param manifest - Manifest to save\n   */\n  async save(manifest: IndexManifest): Promise<void> {\n    try {\n      // Ensure index directory exists\n      await fs.mkdir(this.indexPath, { recursive: true });\n      \n      // Always save with current versions\n      const manifestToSave: IndexManifest = {\n        ...manifest,\n        formatVersion: INDEX_FORMAT_VERSION,\n        lienVersion: getPackageVersion(),\n        lastIndexed: Date.now(),\n      };\n      \n      const content = JSON.stringify(manifestToSave, null, 2);\n      await fs.writeFile(this.manifestPath, content, 'utf-8');\n    } catch (error) {\n      // Don't throw - manifest is best-effort\n      console.error(`[Lien] Warning: Failed to save manifest: ${error}`);\n    }\n  }\n  \n  /**\n   * Adds or updates a file entry in the manifest.\n   * Protected by lock to prevent race conditions during concurrent updates.\n   * \n   * @param filepath - Path to the file\n   * @param entry - File entry metadata\n   */\n  async updateFile(filepath: string, entry: FileEntry): Promise<void> {\n    // Chain this operation to the lock to ensure atomicity\n    this.updateLock = this.updateLock.then(async () => {\n      const manifest = await this.load() || this.createEmpty();\n      manifest.files[filepath] = entry;\n      await this.save(manifest);\n    }).catch(error => {\n      console.error(`[Lien] Failed to update manifest for ${filepath}: ${error}`);\n      // Return to reset lock - don't let errors block future operations\n      return undefined;\n    });\n    \n    // Wait for this operation to complete\n    await this.updateLock;\n  }\n  \n  /**\n   * Removes a file entry from the manifest.\n   * Protected by lock to prevent race conditions during concurrent updates.\n   * \n   * Note: If the manifest doesn't exist, this is a no-op (not an error).\n   * This can happen legitimately after clearing the index or on fresh installs.\n   * \n   * @param filepath - Path to the file to remove\n   */\n  async removeFile(filepath: string): Promise<void> {\n    // Chain this operation to the lock to ensure atomicity\n    this.updateLock = this.updateLock.then(async () => {\n      const manifest = await this.load();\n      if (!manifest) {\n        // No manifest exists - nothing to remove from (expected in some scenarios)\n        return;\n      }\n      \n      delete manifest.files[filepath];\n      await this.save(manifest);\n    }).catch(error => {\n      console.error(`[Lien] Failed to remove manifest entry for ${filepath}: ${error}`);\n      // Return to reset lock - don't let errors block future operations\n      return undefined;\n    });\n    \n    // Wait for this operation to complete\n    await this.updateLock;\n  }\n  \n  /**\n   * Updates multiple files at once (more efficient than individual updates).\n   * Protected by lock to prevent race conditions during concurrent updates.\n   * \n   * @param entries - Array of file entries to update\n   */\n  async updateFiles(entries: FileEntry[]): Promise<void> {\n    // Chain this operation to the lock to ensure atomicity\n    this.updateLock = this.updateLock.then(async () => {\n      const manifest = await this.load() || this.createEmpty();\n      \n      for (const entry of entries) {\n        manifest.files[entry.filepath] = entry;\n      }\n      \n      await this.save(manifest);\n    }).catch(error => {\n      console.error(`[Lien] Failed to update manifest for ${entries.length} files: ${error}`);\n      // Return to reset lock - don't let errors block future operations\n      return undefined;\n    });\n    \n    // Wait for this operation to complete\n    await this.updateLock;\n  }\n  \n  /**\n   * Updates the git state in the manifest.\n   * Protected by lock to prevent race conditions during concurrent updates.\n   * \n   * @param gitState - Current git state\n   */\n  async updateGitState(gitState: GitState): Promise<void> {\n    // Chain this operation to the lock to ensure atomicity\n    this.updateLock = this.updateLock.then(async () => {\n      const manifest = await this.load() || this.createEmpty();\n      \n      manifest.gitState = gitState;\n      await this.save(manifest);\n    }).catch(error => {\n      console.error(`[Lien] Failed to update git state in manifest: ${error}`);\n      // Return to reset lock - don't let errors block future operations\n      return undefined;\n    });\n    \n    // Wait for this operation to complete\n    await this.updateLock;\n  }\n  \n  /**\n   * Gets the list of files currently in the manifest\n   * \n   * @returns Array of filepaths\n   */\n  async getIndexedFiles(): Promise<string[]> {\n    const manifest = await this.load();\n    if (!manifest) return [];\n    \n    return Object.keys(manifest.files);\n  }\n  \n  /**\n   * Detects which files have changed based on mtime comparison\n   * \n   * @param currentFiles - Map of current files with their mtimes\n   * @returns Array of filepaths that have changed\n   */\n  async getChangedFiles(currentFiles: Map<string, number>): Promise<string[]> {\n    const manifest = await this.load();\n    if (!manifest) {\n      // No manifest = all files are \"changed\" (need full index)\n      return Array.from(currentFiles.keys());\n    }\n    \n    const changedFiles: string[] = [];\n    \n    for (const [filepath, mtime] of currentFiles) {\n      const entry = manifest.files[filepath];\n      \n      if (!entry) {\n        // New file\n        changedFiles.push(filepath);\n      } else if (entry.lastModified < mtime) {\n        // File modified since last index\n        changedFiles.push(filepath);\n      }\n    }\n    \n    return changedFiles;\n  }\n  \n  /**\n   * Gets files that are in the manifest but not in the current file list\n   * (i.e., deleted files)\n   * \n   * @param currentFiles - Set of current file paths\n   * @returns Array of deleted file paths\n   */\n  async getDeletedFiles(currentFiles: Set<string>): Promise<string[]> {\n    const manifest = await this.load();\n    if (!manifest) return [];\n    \n    const deletedFiles: string[] = [];\n    \n    for (const filepath of Object.keys(manifest.files)) {\n      if (!currentFiles.has(filepath)) {\n        deletedFiles.push(filepath);\n      }\n    }\n    \n    return deletedFiles;\n  }\n  \n  /**\n   * Clears the manifest file\n   */\n  async clear(): Promise<void> {\n    try {\n      await fs.unlink(this.manifestPath);\n    } catch (error) {\n      // Ignore error if file doesn't exist\n      if ((error as NodeJS.ErrnoException).code !== 'ENOENT') {\n        console.error(`[Lien] Warning: Failed to clear manifest: ${error}`);\n      }\n    }\n  }\n  \n  /**\n   * Creates an empty manifest with current version information\n   * \n   * @returns Empty manifest\n   */\n  private createEmpty(): IndexManifest {\n    return {\n      formatVersion: INDEX_FORMAT_VERSION,\n      lienVersion: getPackageVersion(),\n      lastIndexed: Date.now(),\n      files: {},\n    };\n  }\n}\n\n","import fs from 'fs/promises';\nimport path from 'path';\nimport {\n  isGitRepo,\n  getCurrentBranch,\n  getCurrentCommit,\n  getChangedFiles,\n  getChangedFilesBetweenCommits,\n} from './utils.js';\n\nexport interface GitState {\n  branch: string;\n  commit: string;\n  timestamp: number;\n}\n\n/**\n * Tracks git state (branch and commit) and detects changes.\n * Persists state to disk to survive server restarts.\n */\nexport class GitStateTracker {\n  private stateFile: string;\n  private rootDir: string;\n  private currentState: GitState | null = null;\n  \n  constructor(rootDir: string, indexPath: string) {\n    this.rootDir = rootDir;\n    this.stateFile = path.join(indexPath, '.git-state.json');\n  }\n  \n  /**\n   * Loads the last known git state from disk.\n   * Returns null if no state file exists (first run).\n   */\n  private async loadState(): Promise<GitState | null> {\n    try {\n      const content = await fs.readFile(this.stateFile, 'utf-8');\n      return JSON.parse(content);\n    } catch {\n      // File doesn't exist or is invalid - this is fine for first run\n      return null;\n    }\n  }\n  \n  /**\n   * Saves the current git state to disk.\n   */\n  private async saveState(state: GitState): Promise<void> {\n    try {\n      const content = JSON.stringify(state, null, 2);\n      await fs.writeFile(this.stateFile, content, 'utf-8');\n    } catch (error) {\n      // Log but don't throw - state persistence is best-effort\n      console.error(`[Lien] Warning: Failed to save git state: ${error}`);\n    }\n  }\n  \n  /**\n   * Gets the current git state from the repository.\n   * \n   * @returns Current git state\n   * @throws Error if git commands fail\n   */\n  private async getCurrentGitState(): Promise<GitState> {\n    const branch = await getCurrentBranch(this.rootDir);\n    const commit = await getCurrentCommit(this.rootDir);\n    \n    return {\n      branch,\n      commit,\n      timestamp: Date.now(),\n    };\n  }\n  \n  /**\n   * Initializes the tracker by loading saved state and checking current state.\n   * Should be called once when MCP server starts.\n   * \n   * @returns Array of changed files if state changed, null if no changes or first run\n   */\n  async initialize(): Promise<string[] | null> {\n    // Check if this is a git repo\n    const isRepo = await isGitRepo(this.rootDir);\n    if (!isRepo) {\n      return null;\n    }\n    \n    try {\n      // Get current state\n      this.currentState = await this.getCurrentGitState();\n      \n      // Load previous state\n      const previousState = await this.loadState();\n      \n      if (!previousState) {\n        // First run - save current state\n        await this.saveState(this.currentState);\n        return null;\n      }\n      \n      // Check if state changed\n      const branchChanged = previousState.branch !== this.currentState.branch;\n      const commitChanged = previousState.commit !== this.currentState.commit;\n      \n      if (!branchChanged && !commitChanged) {\n        // No changes\n        return null;\n      }\n      \n      // State changed - get list of changed files\n      let changedFiles: string[] = [];\n      \n      if (branchChanged) {\n        // Branch changed - compare current branch with previous branch\n        try {\n          changedFiles = await getChangedFiles(\n            this.rootDir,\n            previousState.branch,\n            this.currentState.branch\n          );\n        } catch (error) {\n          // If branches diverged too much or don't exist, fall back to commit diff\n          console.error(`[Lien] Branch diff failed, using commit diff: ${error}`);\n          changedFiles = await getChangedFilesBetweenCommits(\n            this.rootDir,\n            previousState.commit,\n            this.currentState.commit\n          );\n        }\n      } else if (commitChanged) {\n        // Same branch, different commit\n        changedFiles = await getChangedFilesBetweenCommits(\n          this.rootDir,\n          previousState.commit,\n          this.currentState.commit\n        );\n      }\n      \n      // Save new state\n      await this.saveState(this.currentState);\n      \n      return changedFiles;\n    } catch (error) {\n      console.error(`[Lien] Failed to initialize git tracker: ${error}`);\n      return null;\n    }\n  }\n  \n  /**\n   * Checks for git state changes since last check.\n   * This is called periodically by the MCP server.\n   * \n   * @returns Array of changed files if state changed, null if no changes\n   */\n  async detectChanges(): Promise<string[] | null> {\n    // Check if this is a git repo\n    const isRepo = await isGitRepo(this.rootDir);\n    if (!isRepo) {\n      return null;\n    }\n    \n    try {\n      // Get current state\n      const newState = await this.getCurrentGitState();\n      \n      // If we don't have a previous state, just save current and return\n      if (!this.currentState) {\n        this.currentState = newState;\n        await this.saveState(newState);\n        return null;\n      }\n      \n      // Check if state changed\n      const branchChanged = this.currentState.branch !== newState.branch;\n      const commitChanged = this.currentState.commit !== newState.commit;\n      \n      if (!branchChanged && !commitChanged) {\n        // No changes\n        return null;\n      }\n      \n      // State changed - get list of changed files\n      let changedFiles: string[] = [];\n      \n      if (branchChanged) {\n        // Branch changed\n        try {\n          changedFiles = await getChangedFiles(\n            this.rootDir,\n            this.currentState.branch,\n            newState.branch\n          );\n        } catch (error) {\n          // Fall back to commit diff\n          console.error(`[Lien] Branch diff failed, using commit diff: ${error}`);\n          changedFiles = await getChangedFilesBetweenCommits(\n            this.rootDir,\n            this.currentState.commit,\n            newState.commit\n          );\n        }\n      } else if (commitChanged) {\n        // Same branch, different commit\n        changedFiles = await getChangedFilesBetweenCommits(\n          this.rootDir,\n          this.currentState.commit,\n          newState.commit\n        );\n      }\n      \n      // Update current state\n      this.currentState = newState;\n      await this.saveState(newState);\n      \n      return changedFiles;\n    } catch (error) {\n      console.error(`[Lien] Failed to detect git changes: ${error}`);\n      return null;\n    }\n  }\n  \n  /**\n   * Gets the current git state.\n   * Useful for status display.\n   */\n  getState(): GitState | null {\n    return this.currentState;\n  }\n  \n  /**\n   * Manually updates the saved state.\n   * Useful after manual reindexing to sync state.\n   */\n  async updateState(): Promise<void> {\n    try {\n      this.currentState = await this.getCurrentGitState();\n      await this.saveState(this.currentState);\n    } catch (error) {\n      console.error(`[Lien] Failed to update git state: ${error}`);\n    }\n  }\n}\n\n","/**\n * Result type for explicit error handling.\n * \n * Provides a type-safe alternative to throwing exceptions, making error\n * handling explicit in function signatures.\n * \n * @example\n * ```typescript\n * function divide(a: number, b: number): Result<number, string> {\n *   if (b === 0) {\n *     return Err('Division by zero');\n *   }\n *   return Ok(a / b);\n * }\n * \n * const result = divide(10, 2);\n * if (isOk(result)) {\n *   console.log(result.value); // 5\n * } else {\n *   console.error(result.error);\n * }\n * ```\n */\n\n/**\n * Result type representing either success (Ok) or failure (Err)\n */\nexport type Result<T, E = Error> = \n  | { ok: true; value: T }\n  | { ok: false; error: E };\n\n/**\n * Creates a successful Result containing a value\n */\nexport function Ok<T>(value: T): Result<T, never> {\n  return { ok: true, value };\n}\n\n/**\n * Creates a failed Result containing an error\n */\nexport function Err<E>(error: E): Result<never, E> {\n  return { ok: false, error };\n}\n\n/**\n * Type guard to check if a Result is Ok\n */\nexport function isOk<T, E>(result: Result<T, E>): result is { ok: true; value: T } {\n  return result.ok;\n}\n\n/**\n * Type guard to check if a Result is Err\n */\nexport function isErr<T, E>(result: Result<T, E>): result is { ok: false; error: E } {\n  return !result.ok;\n}\n\n/**\n * Unwraps a Result, throwing if it's an error\n * @throws {E} The error if Result is Err\n */\nexport function unwrap<T, E>(result: Result<T, E>): T {\n  if (isOk(result)) {\n    return result.value;\n  }\n  throw result.error;\n}\n\n/**\n * Unwraps a Result or returns a default value if it's an error\n */\nexport function unwrapOr<T, E>(result: Result<T, E>, defaultValue: T): T {\n  if (isOk(result)) {\n    return result.value;\n  }\n  return defaultValue;\n}\n\n","import fs from 'fs/promises';\nimport path from 'path';\nimport { chunkFile } from './chunker.js';\nimport { EmbeddingService } from '../embeddings/types.js';\nimport { VectorDB } from '../vectordb/lancedb.js';\nimport { LienConfig, LegacyLienConfig, isModernConfig, isLegacyConfig } from '../config/schema.js';\nimport { ManifestManager } from './manifest.js';\nimport { EMBEDDING_MICRO_BATCH_SIZE } from '../constants.js';\nimport { CodeChunk } from './types.js';\nimport { Result, Ok, Err, isOk } from '../utils/result.js';\n\n/**\n * Normalize a file path to a consistent relative format.\n * This ensures paths from different sources (git diff, scanner, etc.)\n * are stored and queried consistently in the index.\n * \n * @param filepath - Absolute or relative file path\n * @param rootDir - Workspace root directory (defaults to cwd)\n * @returns Relative path from rootDir\n */\nexport function normalizeToRelativePath(filepath: string, rootDir?: string): string {\n  // Normalize root and strip trailing slash to ensure consistent comparison\n  const root = (rootDir || process.cwd()).replace(/\\\\/g, '/').replace(/\\/$/, '');\n  const normalized = filepath.replace(/\\\\/g, '/');\n  \n  // If already relative, return as-is\n  if (!path.isAbsolute(filepath)) {\n    return normalized;\n  }\n  \n  // Convert absolute to relative\n  if (normalized.startsWith(root + '/')) {\n    return normalized.slice(root.length + 1);\n  }\n  if (normalized.startsWith(root)) {\n    return normalized.slice(root.length);\n  }\n  \n  // Fallback: use path.relative\n  return path.relative(root, filepath).replace(/\\\\/g, '/');\n}\n\nexport interface IncrementalIndexOptions {\n  verbose?: boolean;\n}\n\n/**\n * Result of processing a file's content into chunks and embeddings.\n */\ninterface ProcessFileResult {\n  chunkCount: number;\n  vectors: Float32Array[];\n  chunks: CodeChunk[];\n  texts: string[];\n}\n\n/**\n * Result of processing a single file for incremental indexing.\n */\ninterface FileProcessResult {\n  filepath: string;\n  result: ProcessFileResult | null; // null for empty files\n  mtime: number;\n}\n\n/**\n * Shared helper that processes file content into chunks and embeddings.\n * This is the core logic shared between indexSingleFile and indexMultipleFiles.\n * \n * Returns null for empty files (0 chunks), which callers should handle appropriately.\n * \n * @param filepath - Path to the file being processed\n * @param content - File content\n * @param embeddings - Embeddings service\n * @param config - Lien configuration\n * @param verbose - Whether to log verbose output\n * @returns ProcessFileResult for non-empty files, null for empty files\n */\nasync function processFileContent(\n  filepath: string,\n  content: string,\n  embeddings: EmbeddingService,\n  config: LienConfig | LegacyLienConfig,\n  verbose: boolean\n): Promise<ProcessFileResult | null> {\n  // Get chunk settings (support both v0.3.0 and legacy v0.2.0 configs)\n  const chunkSize = isModernConfig(config)\n    ? config.core.chunkSize\n    : (isLegacyConfig(config) ? config.indexing.chunkSize : 75);\n  const chunkOverlap = isModernConfig(config)\n    ? config.core.chunkOverlap\n    : (isLegacyConfig(config) ? config.indexing.chunkOverlap : 10);\n  const useAST = isModernConfig(config)\n    ? config.chunking.useAST\n    : true;\n  const astFallback = isModernConfig(config)\n    ? config.chunking.astFallback\n    : 'line-based';\n  \n  // Chunk the file\n  const chunks = chunkFile(filepath, content, {\n    chunkSize,\n    chunkOverlap,\n    useAST,\n    astFallback,\n  });\n  \n  if (chunks.length === 0) {\n    // Empty file - return null so caller can handle appropriately\n    if (verbose) {\n      console.error(`[Lien] Empty file: ${filepath}`);\n    }\n    return null;\n  }\n  \n  // Generate embeddings for all chunks\n  // Use micro-batching to prevent event loop blocking\n  const texts = chunks.map(c => c.content);\n  const vectors: Float32Array[] = [];\n  \n  for (let j = 0; j < texts.length; j += EMBEDDING_MICRO_BATCH_SIZE) {\n    const microBatch = texts.slice(j, Math.min(j + EMBEDDING_MICRO_BATCH_SIZE, texts.length));\n    const microResults = await embeddings.embedBatch(microBatch);\n    vectors.push(...microResults);\n    \n    // Yield to event loop for responsiveness\n    if (texts.length > EMBEDDING_MICRO_BATCH_SIZE) {\n      await new Promise(resolve => setImmediate(resolve));\n    }\n  }\n  \n  return {\n    chunkCount: chunks.length,\n    vectors,\n    chunks,\n    texts,\n  };\n}\n\n/**\n * Indexes a single file incrementally by updating its chunks in the vector database.\n * This is the core function for incremental reindexing - it handles file changes,\n * deletions, and additions.\n * \n * @param filepath - Absolute path to the file to index\n * @param vectorDB - Initialized VectorDB instance\n * @param embeddings - Initialized embeddings service\n * @param config - Lien configuration\n * @param options - Optional settings\n */\nexport async function indexSingleFile(\n  filepath: string,\n  vectorDB: VectorDB,\n  embeddings: EmbeddingService,\n  config: LienConfig | LegacyLienConfig,\n  options: IncrementalIndexOptions = {}\n): Promise<void> {\n  const { verbose } = options;\n  \n  // Normalize to relative path for consistent storage and queries\n  // This ensures paths from git diff (absolute) match paths from scanner (relative)\n  const normalizedPath = normalizeToRelativePath(filepath);\n  \n  try {\n    // Check if file exists (use original filepath for filesystem operations)\n    try {\n      await fs.access(filepath);\n    } catch {\n      // File doesn't exist - delete from index and manifest using normalized path\n      if (verbose) {\n        console.error(`[Lien] File deleted: ${normalizedPath}`);\n      }\n      await vectorDB.deleteByFile(normalizedPath);\n      \n      const manifest = new ManifestManager(vectorDB.dbPath);\n      await manifest.removeFile(normalizedPath);\n      return;\n    }\n    \n    // Read file content\n    const content = await fs.readFile(filepath, 'utf-8');\n    \n    // Process file content (chunking + embeddings) - use normalized path for storage\n    const result = await processFileContent(normalizedPath, content, embeddings, config, verbose || false);\n    \n    // Get actual file mtime for manifest\n    const stats = await fs.stat(filepath);\n    const manifest = new ManifestManager(vectorDB.dbPath);\n    \n    if (result === null) {\n      // Empty file - remove from vector DB but keep in manifest with chunkCount: 0\n      await vectorDB.deleteByFile(normalizedPath);\n      await manifest.updateFile(normalizedPath, {\n        filepath: normalizedPath,\n        lastModified: stats.mtimeMs,\n        chunkCount: 0,\n      });\n      return;\n    }\n    \n    // Non-empty file - update in database (atomic: delete old + insert new)\n    await vectorDB.updateFile(\n      normalizedPath,\n      result.vectors,\n      result.chunks.map(c => c.metadata),\n      result.texts\n    );\n    \n    // Update manifest after successful indexing\n    await manifest.updateFile(normalizedPath, {\n      filepath: normalizedPath,\n      lastModified: stats.mtimeMs,\n      chunkCount: result.chunkCount,\n    });\n    \n    if (verbose) {\n      console.error(`[Lien] ✓ Updated ${normalizedPath} (${result.chunkCount} chunks)`);\n    }\n  } catch (error) {\n    // Log error but don't throw - we want to continue with other files\n    console.error(`[Lien] ⚠️  Failed to index ${normalizedPath}: ${error}`);\n  }\n}\n\n/**\n * Process a single file, returning a Result type.\n * This helper makes error handling explicit and testable.\n * \n * @param filepath - Original filepath (may be absolute)\n * @param normalizedPath - Normalized relative path for storage\n */\nasync function processSingleFileForIndexing(\n  filepath: string,\n  normalizedPath: string,\n  embeddings: EmbeddingService,\n  config: LienConfig | LegacyLienConfig,\n  verbose: boolean\n): Promise<Result<FileProcessResult, string>> {\n  try {\n    // Read file stats and content using original path (for filesystem access)\n    const stats = await fs.stat(filepath);\n    const content = await fs.readFile(filepath, 'utf-8');\n    \n    // Process content using normalized path (for storage)\n    const result = await processFileContent(normalizedPath, content, embeddings, config, verbose);\n    \n    return Ok({\n      filepath: normalizedPath,  // Store normalized path\n      result,\n      mtime: stats.mtimeMs,\n    });\n  } catch (error) {\n    return Err(`Failed to process ${normalizedPath}: ${error}`);\n  }\n}\n\n/**\n * Indexes multiple files incrementally.\n * Processes files sequentially for simplicity and reliability.\n * \n * Uses Result type for explicit error handling, making it easier to test\n * and reason about failure modes.\n * \n * Note: This function counts both successfully indexed files AND successfully\n * handled deletions (files that don't exist but were removed from the index).\n * \n * @param filepaths - Array of absolute file paths to index\n * @param vectorDB - Initialized VectorDB instance\n * @param embeddings - Initialized embeddings service\n * @param config - Lien configuration\n * @param options - Optional settings\n * @returns Number of successfully processed files (indexed or deleted)\n */\nexport async function indexMultipleFiles(\n  filepaths: string[],\n  vectorDB: VectorDB,\n  embeddings: EmbeddingService,\n  config: LienConfig | LegacyLienConfig,\n  options: IncrementalIndexOptions = {}\n): Promise<number> {\n  const { verbose } = options;\n  let processedCount = 0;\n  \n  // Batch manifest updates for performance\n  const manifestEntries: Array<{ filepath: string; chunkCount: number; mtime: number }> = [];\n  \n  // Process each file sequentially (simple and reliable)\n  for (const filepath of filepaths) {\n    // Normalize to relative path for consistent storage and queries\n    // This ensures paths from git diff (absolute) match paths from scanner (relative)\n    const normalizedPath = normalizeToRelativePath(filepath);\n    \n    const result = await processSingleFileForIndexing(filepath, normalizedPath, embeddings, config, verbose || false);\n    \n    if (isOk(result)) {\n      const { filepath: storedPath, result: processResult, mtime } = result.value;\n      \n      if (processResult === null) {\n        // Empty file - remove from vector DB but keep in manifest with chunkCount: 0\n        try {\n          await vectorDB.deleteByFile(storedPath);\n        } catch (error) {\n          // Ignore errors if file wasn't in index\n        }\n        \n        // Update manifest immediately for empty files (not batched)\n        const manifest = new ManifestManager(vectorDB.dbPath);\n        await manifest.updateFile(storedPath, {\n          filepath: storedPath,\n          lastModified: mtime,\n          chunkCount: 0,\n        });\n        \n        processedCount++;\n        continue;\n      }\n      \n      // Non-empty file - delete old chunks if they exist\n      try {\n        await vectorDB.deleteByFile(storedPath);\n      } catch (error) {\n        // Ignore - file might not be in index yet\n      }\n      \n      // Insert new chunks\n      await vectorDB.insertBatch(\n        processResult.vectors,\n        processResult.chunks.map(c => c.metadata),\n        processResult.texts\n      );\n      \n      // Queue manifest update (batch at end)\n      manifestEntries.push({\n        filepath: storedPath,\n        chunkCount: processResult.chunkCount,\n        mtime,\n      });\n      \n      if (verbose) {\n        console.error(`[Lien] ✓ Updated ${storedPath} (${processResult.chunkCount} chunks)`);\n      }\n      \n      processedCount++;\n    } else {\n      // File doesn't exist or couldn't be read - handle deletion\n      if (verbose) {\n        console.error(`[Lien] ${result.error}`);\n      }\n      \n      try {\n        await vectorDB.deleteByFile(normalizedPath);\n        const manifest = new ManifestManager(vectorDB.dbPath);\n        await manifest.removeFile(normalizedPath);\n      } catch (error) {\n        // Ignore errors if file wasn't in index\n        if (verbose) {\n          console.error(`[Lien] Note: ${normalizedPath} not in index`);\n        }\n      }\n      \n      // Count as processed regardless of deletion success/failure\n      processedCount++;\n    }\n  }\n  \n  // Batch update manifest at the end (much faster than updating after each file)\n  if (manifestEntries.length > 0) {\n    const manifest = new ManifestManager(vectorDB.dbPath);\n    await manifest.updateFiles(\n      manifestEntries.map(entry => ({\n        filepath: entry.filepath,\n        lastModified: entry.mtime, // Use actual file mtime for accurate change detection\n        chunkCount: entry.chunkCount,\n      }))\n    );\n  }\n  \n  return processedCount;\n}\n\n","import fs from 'fs/promises';\nimport path from 'path';\nimport { VectorDB } from '../vectordb/lancedb.js';\nimport { ManifestManager, IndexManifest } from './manifest.js';\nimport { scanCodebase, scanCodebaseWithFrameworks } from './scanner.js';\nimport { LienConfig, LegacyLienConfig, isModernConfig, isLegacyConfig } from '../config/schema.js';\nimport { GitStateTracker } from '../git/tracker.js';\nimport { isGitAvailable, isGitRepo, getChangedFiles } from '../git/utils.js';\nimport { normalizeToRelativePath } from './incremental.js';\n\n/**\n * Result of change detection, categorized by type of change\n */\nexport interface ChangeDetectionResult {\n  added: string[];      // New files not in previous index\n  modified: string[];   // Existing files that have been modified\n  deleted: string[];    // Files that were indexed but no longer exist\n  reason: 'mtime' | 'full' | 'git-state-changed';  // How changes were detected\n}\n\n/**\n * Check if git state has changed (branch switch, new commits).\n */\nasync function hasGitStateChanged(\n  rootDir: string,\n  dbPath: string,\n  savedGitState: IndexManifest['gitState']\n): Promise<{ changed: boolean; currentState?: ReturnType<GitStateTracker['getState']> }> {\n  if (!savedGitState) return { changed: false };\n\n  const gitAvailable = await isGitAvailable();\n  const isRepo = await isGitRepo(rootDir);\n  if (!gitAvailable || !isRepo) return { changed: false };\n\n  const gitTracker = new GitStateTracker(rootDir, dbPath);\n  await gitTracker.initialize();\n  const currentState = gitTracker.getState();\n\n  if (!currentState) return { changed: false };\n\n  const changed = currentState.branch !== savedGitState.branch ||\n                  currentState.commit !== savedGitState.commit;\n\n  return { changed, currentState };\n}\n\n/**\n * Categorize files from git diff into added, modified, deleted.\n */\nfunction categorizeChangedFiles(\n  changedFilesPaths: string[],\n  currentFileSet: Set<string>,\n  normalizedManifestFiles: Set<string>,\n  allFiles: string[]\n): { added: string[]; modified: string[]; deleted: string[] } {\n  const changedFilesSet = new Set(changedFilesPaths);\n  const added: string[] = [];\n  const modified: string[] = [];\n  const deleted: string[] = [];\n\n  // Categorize files from git diff\n  for (const filepath of changedFilesPaths) {\n    if (currentFileSet.has(filepath)) {\n      if (normalizedManifestFiles.has(filepath)) {\n        modified.push(filepath);\n      } else {\n        added.push(filepath);\n      }\n    }\n  }\n\n  // Find truly new files (not in git diff, but not in old manifest)\n  for (const filepath of allFiles) {\n    if (!normalizedManifestFiles.has(filepath) && !changedFilesSet.has(filepath)) {\n      added.push(filepath);\n    }\n  }\n\n  // Find deleted files (in old manifest but not in current)\n  for (const normalizedPath of normalizedManifestFiles) {\n    if (!currentFileSet.has(normalizedPath)) {\n      deleted.push(normalizedPath);\n    }\n  }\n\n  return { added, modified, deleted };\n}\n\n/**\n * Build normalized set of manifest file paths for comparison.\n */\nfunction normalizeManifestPaths(\n  manifestFiles: IndexManifest['files'],\n  rootDir: string\n): Set<string> {\n  const normalized = new Set<string>();\n  for (const filepath of Object.keys(manifestFiles)) {\n    normalized.add(normalizeToRelativePath(filepath, rootDir));\n  }\n  return normalized;\n}\n\n/**\n * Detect changes using git diff between commits.\n */\nasync function detectGitBasedChanges(\n  rootDir: string,\n  savedManifest: IndexManifest,\n  currentCommit: string,\n  config: LienConfig | LegacyLienConfig\n): Promise<ChangeDetectionResult> {\n  const changedFilesAbsolute = await getChangedFiles(\n    rootDir,\n    savedManifest.gitState!.commit,\n    currentCommit\n  );\n  const changedFilesPaths = changedFilesAbsolute.map(fp => normalizeToRelativePath(fp, rootDir));\n\n  const allFiles = await getAllFiles(rootDir, config);\n  const currentFileSet = new Set(allFiles);\n  const normalizedManifestFiles = normalizeManifestPaths(savedManifest.files, rootDir);\n\n  const { added, modified, deleted } = categorizeChangedFiles(\n    changedFilesPaths,\n    currentFileSet,\n    normalizedManifestFiles,\n    allFiles\n  );\n\n  return { added, modified, deleted, reason: 'git-state-changed' };\n}\n\n/**\n * Fall back to full reindex when git diff fails.\n */\nasync function fallbackToFullReindex(\n  rootDir: string,\n  savedManifest: IndexManifest,\n  config: LienConfig | LegacyLienConfig\n): Promise<ChangeDetectionResult> {\n  const allFiles = await getAllFiles(rootDir, config);\n  const currentFileSet = new Set(allFiles);\n\n  const deleted: string[] = [];\n  for (const filepath of Object.keys(savedManifest.files)) {\n    const normalizedPath = normalizeToRelativePath(filepath, rootDir);\n    if (!currentFileSet.has(normalizedPath)) {\n      deleted.push(normalizedPath);\n    }\n  }\n\n  return { added: allFiles, modified: [], deleted, reason: 'git-state-changed' };\n}\n\n/**\n * Detects which files have changed since last indexing.\n * Uses git state detection to handle branch switches, then falls back to mtime.\n */\nexport async function detectChanges(\n  rootDir: string,\n  vectorDB: VectorDB,\n  config: LienConfig | LegacyLienConfig\n): Promise<ChangeDetectionResult> {\n  const manifest = new ManifestManager(vectorDB.dbPath);\n  const savedManifest = await manifest.load();\n\n  // No manifest = first run = full index\n  if (!savedManifest) {\n    const allFiles = await getAllFiles(rootDir, config);\n    return { added: allFiles, modified: [], deleted: [], reason: 'full' };\n  }\n\n  // Check if git state has changed\n  const gitCheck = await hasGitStateChanged(rootDir, vectorDB.dbPath, savedManifest.gitState);\n\n  if (gitCheck.changed && gitCheck.currentState) {\n    try {\n      return await detectGitBasedChanges(rootDir, savedManifest, gitCheck.currentState.commit, config);\n    } catch (error) {\n      console.warn(`[Lien] Git diff failed, falling back to full reindex: ${error}`);\n      return await fallbackToFullReindex(rootDir, savedManifest, config);\n    }\n  }\n\n  // Use mtime-based detection for file-level changes\n  return await mtimeBasedDetection(rootDir, savedManifest, config);\n}\n\n/**\n * Gets all files in the project based on configuration.\n * Always returns relative paths for consistent comparison with manifest and git diff.\n */\nasync function getAllFiles(\n  rootDir: string,\n  config: LienConfig | LegacyLienConfig\n): Promise<string[]> {\n  let files: string[];\n  \n  if (isModernConfig(config) && config.frameworks.length > 0) {\n    files = await scanCodebaseWithFrameworks(rootDir, config);\n  } else if (isLegacyConfig(config)) {\n    files = await scanCodebase({\n      rootDir,\n      includePatterns: config.indexing.include,\n      excludePatterns: config.indexing.exclude,\n    });\n  } else {\n    files = await scanCodebase({\n      rootDir,\n      includePatterns: [],\n      excludePatterns: [],\n    });\n  }\n  \n  // Normalize all paths to relative for consistent comparison\n  return files.map(fp => normalizeToRelativePath(fp, rootDir));\n}\n\n/**\n * Detects changes by comparing file modification times\n */\nasync function mtimeBasedDetection(\n  rootDir: string,\n  savedManifest: IndexManifest,\n  config: LienConfig | LegacyLienConfig\n): Promise<ChangeDetectionResult> {\n  const added: string[] = [];\n  const modified: string[] = [];\n  const deleted: string[] = [];\n  \n  // Get all current files (already normalized to relative paths by getAllFiles)\n  const currentFiles = await getAllFiles(rootDir, config);\n  const currentFileSet = new Set(currentFiles);\n  \n  // Build a normalized map of manifest files for comparison\n  // This handles cases where manifest has absolute paths (from tests or legacy data)\n  const normalizedManifestFiles = new Map<string, typeof savedManifest.files[string]>();\n  for (const [filepath, entry] of Object.entries(savedManifest.files)) {\n    const normalizedPath = normalizeToRelativePath(filepath, rootDir);\n    normalizedManifestFiles.set(normalizedPath, entry);\n  }\n  \n  // Get mtimes for all current files\n  // Note: need to construct absolute path for fs.stat since currentFiles are relative\n  const fileStats = new Map<string, number>();\n  \n  for (const filepath of currentFiles) {\n    try {\n      // Construct absolute path for filesystem access (use path.join for cross-platform)\n      const absolutePath = path.isAbsolute(filepath) ? filepath : path.join(rootDir, filepath);\n      const stats = await fs.stat(absolutePath);\n      fileStats.set(filepath, stats.mtimeMs);\n    } catch {\n      // Ignore files we can't stat\n      continue;\n    }\n  }\n  \n  // Check for new and modified files\n  for (const [filepath, mtime] of fileStats) {\n    const entry = normalizedManifestFiles.get(filepath);\n    \n    if (!entry) {\n      // New file\n      added.push(filepath);\n    } else if (entry.lastModified < mtime) {\n      // File modified since last index\n      modified.push(filepath);\n    }\n  }\n  \n  // Check for deleted files (use normalized manifest paths)\n  for (const normalizedPath of normalizedManifestFiles.keys()) {\n    if (!currentFileSet.has(normalizedPath)) {\n      deleted.push(normalizedPath);\n    }\n  }\n  \n  return {\n    added,\n    modified,\n    deleted,\n    reason: 'mtime',\n  };\n}\n\n","/**\n * Witty loading messages to keep users entertained during long operations.\n * Inspired by tools like npm, yarn, and other personality-driven CLIs.\n */\n\nconst INDEXING_MESSAGES = [\n  'Teaching AI to read your spaghetti code...',\n  'Convincing the LLM that your variable names make sense...',\n  'Indexing your TODO comments (so many TODOs)...',\n  'Building semantic links faster than you can say \"grep\"...',\n  'Making your codebase searchable (the good, the bad, and the ugly)...',\n  'Chunking code like a boss...',\n  \"Feeding your code to the neural network (it's hungry)...\",\n  \"Creating embeddings (it's like compression, but fancier)...\",\n  'Teaching machines to understand your midnight commits...',\n  'Vectorizing your technical debt...',\n  \"Indexing... because Ctrl+F wasn't cutting it anymore...\",\n  'Making semantic connections (unlike your last refactor)...',\n  'Processing files faster than your CI pipeline...',\n  'Embedding wisdom from your comments (all 3 of them)...',\n  'Analyzing code semantics (yes, even that one function)...',\n  'Building search index (now with 100% more AI)...',\n  \"Crunching vectors like it's nobody's business...\",\n  'Linking code fragments across the spacetime continuum...',\n  'Teaching transformers about your coding style...',\n  'Preparing for semantic search domination...',\n  'Indexing your genius (and that hacky workaround from 2019)...',\n  \"Making your codebase AI-readable (you're welcome, future you)...\",\n  'Converting code to math (engineers love this trick)...',\n  \"Building the neural net's mental model of your app...\",\n  'Chunking files like a lumberjack, but for code...',\n];\n\nconst EMBEDDING_MESSAGES = [\n  'Generating embeddings (math is happening)...',\n  'Teaching transformers about your forEach loops...',\n  'Converting code to 384-dimensional space (wild, right?)...',\n  'Running the neural network (the Matrix, but for code)...',\n  'Creating semantic vectors (fancy word for AI magic)...',\n  'Embedding your code into hyperspace...',\n  'Teaching the model what \"clean code\" means in your codebase...',\n  'Generating vectors faster than you can say \"AI\"...',\n  'Making math from your methods...',\n  'Transforming code into numbers (the AI way)...',\n  'Processing with transformers.js (yes, it runs locally!)...',\n  \"Embedding semantics (your code's hidden meaning)...\",\n  'Vectorizing variables (alliteration achieved)...',\n  'Teaching AI the difference between foo and bar...',\n  'Creating embeddings (384 dimensions of awesome)...',\n];\n\nconst MODEL_LOADING_MESSAGES = [\n  'Waking up the neural network...',\n  'Loading transformer model (patience, young padawan)...',\n  'Downloading AI brain (first run only, promise!)...',\n  'Initializing the semantic search engine...',\n  'Booting up the language model (coffee break recommended)...',\n  'Loading 100MB of pure AI goodness...',\n  'Preparing the transformer for action...',\n  'Model loading (this is why we run locally)...',\n  'Spinning up the embedding generator...',\n  'Getting the AI ready for your codebase...',\n];\n\nlet currentIndexingIndex = 0;\nlet currentEmbeddingIndex = 0;\nlet currentModelIndex = 0;\n\n/**\n * Get the next witty message for the indexing process.\n * Messages are returned sequentially in a round-robin fashion.\n */\nexport function getIndexingMessage(): string {\n  const message = INDEXING_MESSAGES[currentIndexingIndex % INDEXING_MESSAGES.length];\n  currentIndexingIndex++;\n  return message;\n}\n\n/**\n * Get the next witty message for the embedding generation process.\n * Messages are returned sequentially in a round-robin fashion.\n */\nexport function getEmbeddingMessage(): string {\n  const message = EMBEDDING_MESSAGES[currentEmbeddingIndex % EMBEDDING_MESSAGES.length];\n  currentEmbeddingIndex++;\n  return message;\n}\n\n/**\n * Get the next witty message for the model loading process.\n * Messages are returned sequentially in a round-robin fashion.\n */\nexport function getModelLoadingMessage(): string {\n  const message = MODEL_LOADING_MESSAGES[currentModelIndex % MODEL_LOADING_MESSAGES.length];\n  currentModelIndex++;\n  return message;\n}\n\n/**\n * Reset all message counters (useful for testing)\n */\nexport function resetMessageCounters(): void {\n  currentIndexingIndex = 0;\n  currentEmbeddingIndex = 0;\n  currentModelIndex = 0;\n}\n\n","import type { Ora } from 'ora';\nimport { getIndexingMessage } from '../utils/loading-messages.js';\n\n/**\n * Manages progress tracking and spinner updates during indexing.\n * \n * Handles:\n * - Periodic progress updates (files processed count)\n * - Message rotation (witty messages every 8 seconds)\n * - Clean separation from business logic\n * \n * @example\n * ```typescript\n * const tracker = new IndexingProgressTracker(1000, spinner);\n * tracker.start();\n * \n * // ... process files ...\n * tracker.incrementFiles();\n * \n * tracker.setMessage('Generating embeddings...');\n * tracker.stop();\n * ```\n */\nexport class IndexingProgressTracker {\n  private processedFiles = 0;\n  private totalFiles: number;\n  private wittyMessage: string;\n  private spinner: Ora;\n  private updateInterval?: NodeJS.Timeout;\n  \n  // Configuration constants\n  private static readonly SPINNER_UPDATE_INTERVAL_MS = 200;  // How often to update spinner\n  private static readonly MESSAGE_ROTATION_INTERVAL_MS = 8000;  // How often to rotate message\n  \n  constructor(totalFiles: number, spinner: Ora) {\n    this.totalFiles = totalFiles;\n    this.spinner = spinner;\n    this.wittyMessage = getIndexingMessage();\n  }\n  \n  /**\n   * Start the progress tracker.\n   * Sets up periodic updates for spinner and message rotation.\n   * \n   * Safe to call multiple times - will not create duplicate intervals.\n   */\n  start(): void {\n    // Prevent creating multiple intervals (resource leak)\n    if (this.updateInterval) {\n      return;\n    }\n    \n    const MESSAGE_ROTATION_TICKS = Math.floor(\n      IndexingProgressTracker.MESSAGE_ROTATION_INTERVAL_MS / \n      IndexingProgressTracker.SPINNER_UPDATE_INTERVAL_MS\n    );\n    \n    let spinnerTick = 0;\n    this.updateInterval = setInterval(() => {\n      // Rotate witty message periodically\n      spinnerTick++;\n      if (spinnerTick >= MESSAGE_ROTATION_TICKS) {\n        this.wittyMessage = getIndexingMessage();\n        spinnerTick = 0;  // Reset counter to prevent unbounded growth\n      }\n      \n      // Update spinner text with current progress\n      this.spinner.text = `${this.processedFiles}/${this.totalFiles} files | ${this.wittyMessage}`;\n    }, IndexingProgressTracker.SPINNER_UPDATE_INTERVAL_MS);\n  }\n  \n  /**\n   * Increment the count of processed files.\n   * \n   * Safe for async operations in Node.js's single-threaded event loop.\n   * Note: Not thread-safe for true concurrent operations (e.g., worker threads).\n   */\n  incrementFiles(): void {\n    this.processedFiles++;\n  }\n  \n  /**\n   * Set a custom message (e.g., for special operations like embedding generation).\n   * The message will be displayed until the next automatic rotation.\n   */\n  setMessage(message: string): void {\n    this.wittyMessage = message;\n  }\n  \n  /**\n   * Stop the progress tracker and clean up intervals.\n   * Must be called when indexing completes or fails.\n   */\n  stop(): void {\n    if (this.updateInterval) {\n      clearInterval(this.updateInterval);\n      this.updateInterval = undefined;\n    }\n  }\n  \n  /**\n   * Get the current count of processed files.\n   */\n  getProcessedCount(): number {\n    return this.processedFiles;\n  }\n  \n  /**\n   * Get the total number of files to process.\n   */\n  getTotalFiles(): number {\n    return this.totalFiles;\n  }\n  \n  /**\n   * Get the current message being displayed.\n   */\n  getCurrentMessage(): string {\n    return this.wittyMessage;\n  }\n}\n\n","import fs from 'fs/promises';\nimport ora, { type Ora } from 'ora';\nimport chalk from 'chalk';\nimport pLimit from 'p-limit';\nimport { scanCodebase, scanCodebaseWithFrameworks } from './scanner.js';\nimport { chunkFile } from './chunker.js';\nimport { LocalEmbeddings } from '../embeddings/local.js';\nimport { VectorDB } from '../vectordb/lancedb.js';\nimport { configService } from '../config/service.js';\nimport { CodeChunk } from './types.js';\nimport { writeVersionFile } from '../vectordb/version.js';\nimport { isLegacyConfig, isModernConfig, type LienConfig, type LegacyLienConfig } from '../config/schema.js';\nimport { ManifestManager } from './manifest.js';\nimport { detectChanges } from './change-detector.js';\nimport { indexMultipleFiles } from './incremental.js';\nimport { getIndexingMessage, getEmbeddingMessage, getModelLoadingMessage } from '../utils/loading-messages.js';\nimport { EMBEDDING_MICRO_BATCH_SIZE } from '../constants.js';\nimport { IndexingProgressTracker } from './progress-tracker.js';\nimport type { EmbeddingService } from '../embeddings/types.js';\n\nexport interface IndexingOptions {\n  rootDir?: string;\n  verbose?: boolean;\n  force?: boolean;  // Force full reindex, skip incremental\n}\n\ninterface ChunkWithContent {\n  chunk: CodeChunk;\n  content: string;\n}\n\n/** Extracted config values with defaults for indexing */\ninterface IndexingConfig {\n  concurrency: number;\n  embeddingBatchSize: number;\n  chunkSize: number;\n  chunkOverlap: number;\n  useAST: boolean;\n  astFallback: 'line-based' | 'error';\n}\n\n/** Extract indexing config values with defaults */\nfunction getIndexingConfig(config: LienConfig | LegacyLienConfig): IndexingConfig {\n  if (isModernConfig(config)) {\n    return {\n      concurrency: config.core.concurrency,\n      embeddingBatchSize: config.core.embeddingBatchSize,\n      chunkSize: config.core.chunkSize,\n      chunkOverlap: config.core.chunkOverlap,\n      useAST: config.chunking.useAST,\n      astFallback: config.chunking.astFallback,\n    };\n  }\n  // Legacy defaults\n  return {\n    concurrency: 4,\n    embeddingBatchSize: 50,\n    chunkSize: 75,\n    chunkOverlap: 10,\n    useAST: true,\n    astFallback: 'line-based',\n  };\n}\n\n/** Scan files based on config type */\nasync function scanFilesToIndex(\n  rootDir: string,\n  config: LienConfig | LegacyLienConfig\n): Promise<string[]> {\n  if (isModernConfig(config) && config.frameworks.length > 0) {\n    return scanCodebaseWithFrameworks(rootDir, config);\n  }\n  if (isLegacyConfig(config)) {\n    return scanCodebase({\n      rootDir,\n      includePatterns: config.indexing.include,\n      excludePatterns: config.indexing.exclude,\n    });\n  }\n  return scanCodebase({ rootDir, includePatterns: [], excludePatterns: [] });\n}\n\n/** Process embeddings in micro-batches to prevent event loop blocking */\nasync function processEmbeddingMicroBatches(\n  texts: string[],\n  embeddings: EmbeddingService\n): Promise<Float32Array[]> {\n  const results: Float32Array[] = [];\n  for (let j = 0; j < texts.length; j += EMBEDDING_MICRO_BATCH_SIZE) {\n    const microBatch = texts.slice(j, Math.min(j + EMBEDDING_MICRO_BATCH_SIZE, texts.length));\n    const microResults = await embeddings.embedBatch(microBatch);\n    results.push(...microResults);\n    await new Promise(resolve => setImmediate(resolve));\n  }\n  return results;\n}\n\n/**\n * Helper functions extracted from indexCodebase\n * These make the main function more readable and testable\n */\n\n/**\n * Update git state after indexing (if in a git repo).\n */\nasync function updateGitState(\n  rootDir: string,\n  vectorDB: VectorDB,\n  manifest: ManifestManager\n): Promise<void> {\n  const { isGitAvailable, isGitRepo } = await import('../git/utils.js');\n  const { GitStateTracker } = await import('../git/tracker.js');\n  \n  const gitAvailable = await isGitAvailable();\n  const isRepo = await isGitRepo(rootDir);\n  \n  if (!gitAvailable || !isRepo) {\n    return;\n  }\n  \n  const gitTracker = new GitStateTracker(rootDir, vectorDB.dbPath);\n  await gitTracker.initialize();\n  const gitState = gitTracker.getState();\n  \n  if (gitState) {\n    await manifest.updateGitState(gitState);\n  }\n}\n\n/**\n * Handle file deletions during incremental indexing.\n */\nasync function handleDeletions(\n  deletedFiles: string[],\n  vectorDB: VectorDB,\n  manifest: ManifestManager,\n  spinner: Ora\n): Promise<void> {\n  if (deletedFiles.length === 0) {\n    return;\n  }\n  \n  spinner.start(`Removing ${deletedFiles.length} deleted files...`);\n  let removedCount = 0;\n  \n  for (const filepath of deletedFiles) {\n    try {\n      await vectorDB.deleteByFile(filepath);\n      await manifest.removeFile(filepath);\n      removedCount++;\n    } catch (err) {\n      spinner.warn(\n        `Failed to remove file \"${filepath}\": ${err instanceof Error ? err.message : String(err)}`\n      );\n    }\n  }\n  \n  spinner.succeed(`Removed ${removedCount}/${deletedFiles.length} deleted files`);\n}\n\n/**\n * Handle file updates (additions and modifications) during incremental indexing.\n */\nasync function handleUpdates(\n  addedFiles: string[],\n  modifiedFiles: string[],\n  vectorDB: VectorDB,\n  embeddings: EmbeddingService,\n  config: LienConfig | LegacyLienConfig,\n  options: IndexingOptions,\n  spinner: Ora\n): Promise<void> {\n  const filesToIndex = [...addedFiles, ...modifiedFiles];\n  \n  if (filesToIndex.length === 0) {\n    return;\n  }\n  \n  spinner.start(`Reindexing ${filesToIndex.length} changed files...`);\n  const count = await indexMultipleFiles(\n    filesToIndex,\n    vectorDB,\n    embeddings,\n    config,\n    { verbose: options.verbose }\n  );\n  \n  await writeVersionFile(vectorDB.dbPath);\n  spinner.succeed(\n    `Incremental reindex complete: ${count}/${filesToIndex.length} files indexed successfully`\n  );\n}\n\n/**\n * Try incremental indexing if a manifest exists.\n * Returns true if incremental indexing completed, false if full index needed.\n */\nasync function tryIncrementalIndex(\n  rootDir: string,\n  vectorDB: VectorDB,\n  config: LienConfig | LegacyLienConfig,\n  options: IndexingOptions,\n  spinner: Ora\n): Promise<boolean> {\n  spinner.text = 'Checking for changes...';\n  const manifest = new ManifestManager(vectorDB.dbPath);\n  const savedManifest = await manifest.load();\n  \n  if (!savedManifest) {\n    return false; // No manifest, need full index\n  }\n  \n  const changes = await detectChanges(rootDir, vectorDB, config);\n  \n  if (changes.reason === 'full') {\n    spinner.text = 'Full reindex required...';\n    return false;\n  }\n  \n  const totalChanges = changes.added.length + changes.modified.length;\n  const totalDeleted = changes.deleted.length;\n  \n  if (totalChanges === 0 && totalDeleted === 0) {\n    spinner.succeed('No changes detected - index is up to date!');\n    return true;\n  }\n  \n  spinner.succeed(\n    `Detected changes: ${totalChanges} files to index, ${totalDeleted} to remove (${changes.reason} detection)`\n  );\n  \n  // Initialize embeddings for incremental update\n  spinner.start(getModelLoadingMessage());\n  const embeddings = new LocalEmbeddings();\n  await embeddings.initialize();\n  spinner.succeed('Embedding model loaded');\n  \n  // Process changes\n  await handleDeletions(changes.deleted, vectorDB, manifest, spinner);\n  await handleUpdates(changes.added, changes.modified, vectorDB, embeddings, config, options, spinner);\n  \n  // Update git state\n  await updateGitState(rootDir, vectorDB, manifest);\n  \n  console.log(chalk.dim('\\nNext step: Run'), chalk.bold('lien serve'), chalk.dim('to start the MCP server'));\n  return true;\n}\n\n/**\n * Perform a full index of the codebase.\n */\nasync function performFullIndex(\n  rootDir: string,\n  vectorDB: VectorDB,\n  config: LienConfig | LegacyLienConfig,\n  options: IndexingOptions,\n  spinner: Ora\n): Promise<void> {\n  // 0. Clear existing index (required for schema changes)\n  spinner.text = 'Clearing existing index...';\n  await vectorDB.clear();\n  \n  // 1. Scan for files\n  spinner.text = 'Scanning codebase...';\n  const files = await scanFilesToIndex(rootDir, config);\n  \n  if (files.length === 0) {\n    spinner.fail('No files found to index');\n    return;\n  }\n  \n  spinner.text = `Found ${files.length} files`;\n  \n  // 2. Initialize embeddings model\n  spinner.text = getModelLoadingMessage();\n  const embeddings = new LocalEmbeddings();\n  await embeddings.initialize();\n  spinner.succeed('Embedding model loaded');\n  \n  // 3. Get config values and process files\n  const indexConfig = getIndexingConfig(config);\n  const vectorDBBatchSize = 100; // Smaller batch for UI responsiveness\n  \n  spinner.start(`Processing files with ${indexConfig.concurrency}x concurrency...`);\n  \n  const startTime = Date.now();\n  let processedChunks = 0;\n  \n  // Accumulator for chunks across multiple files\n  const chunkAccumulator: ChunkWithContent[] = [];\n  const limit = pLimit(indexConfig.concurrency);\n  \n  // Track successfully indexed files for manifest\n  const indexedFileEntries: Array<{ filepath: string; chunkCount: number; mtime: number }> = [];\n  \n  // Create progress tracker\n  const progressTracker = new IndexingProgressTracker(files.length, spinner);\n  progressTracker.start();\n  \n  try {\n    // Mutex to prevent concurrent access to shared state (chunkAccumulator, indexedFileEntries)\n    // This prevents race conditions when multiple concurrent tasks try to:\n    // 1. Push to shared arrays\n    // 2. Check accumulator length threshold\n    // 3. Trigger processing\n    let addChunksLock: Promise<void> | null = null;\n    let processingQueue: Promise<void> | null = null;\n    \n    // Function to process accumulated chunks\n    // Uses queue-based synchronization to prevent TOCTOU race conditions\n    const processAccumulatedChunks = async (): Promise<void> => {\n      // Chain onto existing processing promise to create a queue\n      // This prevents the race condition where multiple tasks check processingQueue\n      // simultaneously and both proceed to process\n      if (processingQueue) {\n        processingQueue = processingQueue.then(() => doProcessChunks());\n      } else {\n        processingQueue = doProcessChunks();\n      }\n      return processingQueue;\n    };\n    \n    // The actual processing logic (separated for queue-based synchronization)\n    const doProcessChunks = async (): Promise<void> => {\n      if (chunkAccumulator.length === 0) return;\n      \n      const currentPromise = processingQueue;\n      \n      try {\n        const toProcess = chunkAccumulator.splice(0, chunkAccumulator.length);\n        \n        // Process in batches for UI responsiveness\n        for (let i = 0; i < toProcess.length; i += indexConfig.embeddingBatchSize) {\n          const batch = toProcess.slice(i, Math.min(i + indexConfig.embeddingBatchSize, toProcess.length));\n          const texts = batch.map(item => item.content);\n          \n          progressTracker.setMessage(getEmbeddingMessage());\n          const embeddingVectors = await processEmbeddingMicroBatches(texts, embeddings);\n          processedChunks += batch.length;\n          \n          progressTracker.setMessage(`Inserting ${batch.length} chunks into vector space...`);\n          await vectorDB.insertBatch(embeddingVectors, batch.map(item => item.chunk.metadata), texts);\n          await new Promise(resolve => setImmediate(resolve));\n        }\n        \n        progressTracker.setMessage(getIndexingMessage());\n      } finally {\n        if (processingQueue === currentPromise) processingQueue = null;\n      }\n    };\n  \n  // Process files with concurrency limit\n  const filePromises = files.map((file) =>\n    limit(async () => {\n      try {\n        // Get file stats to capture actual modification time\n        const stats = await fs.stat(file);\n        const content = await fs.readFile(file, 'utf-8');\n        \n        const chunks = chunkFile(file, content, {\n          chunkSize: indexConfig.chunkSize,\n          chunkOverlap: indexConfig.chunkOverlap,\n          useAST: indexConfig.useAST,\n          astFallback: indexConfig.astFallback,\n        });\n        \n        if (chunks.length === 0) {\n          progressTracker.incrementFiles();\n          return;\n        }\n        \n        // Critical section: add chunks to shared state and check threshold\n        // Must be protected with mutex to prevent race conditions\n        {\n          // Wait for any in-progress add operation\n          if (addChunksLock) {\n            await addChunksLock;\n          }\n          \n          // Acquire lock\n          let releaseAddLock!: () => void;\n          addChunksLock = new Promise<void>(resolve => {\n            releaseAddLock = resolve;\n          });\n          \n          try {\n            // Add chunks to accumulator\n            for (const chunk of chunks) {\n              chunkAccumulator.push({\n                chunk,\n                content: chunk.content,\n              });\n            }\n            \n            // Track this file for manifest with actual file mtime\n            indexedFileEntries.push({\n              filepath: file,\n              chunkCount: chunks.length,\n              mtime: stats.mtimeMs,\n            });\n            \n            progressTracker.incrementFiles();\n            \n            // Process when batch is large enough (use smaller batch for responsiveness)\n            // Check is done inside the mutex to prevent multiple tasks from triggering processing\n            if (chunkAccumulator.length >= vectorDBBatchSize) {\n              await processAccumulatedChunks();\n            }\n          } finally {\n            // Release lock (always defined by Promise constructor)\n            releaseAddLock();\n            addChunksLock = null;\n          }\n        }\n      } catch (error) {\n        if (options.verbose) {\n          console.error(chalk.yellow(`\\n⚠️  Skipping ${file}: ${error}`));\n        }\n        progressTracker.incrementFiles();\n      }\n    })\n  );\n  \n    // Wait for all files to be processed\n    await Promise.all(filePromises);\n    \n    // Process remaining chunks\n    progressTracker.setMessage('Processing final chunks...');\n    await processAccumulatedChunks();\n  } finally {\n    // Always stop the progress tracker to clean up the interval\n    progressTracker.stop();\n  }\n  \n  // Save manifest with all indexed files\n  spinner.start('Saving index manifest...');\n  const manifest = new ManifestManager(vectorDB.dbPath);\n  await manifest.updateFiles(\n    indexedFileEntries.map(entry => ({\n      filepath: entry.filepath,\n      // Use actual file mtime for accurate change detection\n      lastModified: entry.mtime,\n      chunkCount: entry.chunkCount,\n    }))\n  );\n  \n  // Save git state if in a git repo\n  await updateGitState(rootDir, vectorDB, manifest);\n  \n  spinner.succeed('Manifest saved');\n  \n  // Write version file to mark successful completion\n  await writeVersionFile(vectorDB.dbPath);\n  \n  const totalTime = ((Date.now() - startTime) / 1000).toFixed(1);\n  spinner.succeed(\n    `Indexed ${progressTracker.getProcessedCount()} files (${processedChunks} chunks) in ${totalTime}s using ${indexConfig.concurrency}x concurrency`\n  );\n  \n  console.log(chalk.dim('\\nNext step: Run'), chalk.bold('lien serve'), chalk.dim('to start the MCP server'));\n}\n\n/**\n * Index a codebase, creating vector embeddings for semantic search.\n * \n * Refactored to be more maintainable:\n * - Tries incremental indexing first (if not forced)\n * - Falls back to full indexing if needed\n * - Delegates to helper functions for specific tasks\n * \n * @param options - Indexing options\n */\nexport async function indexCodebase(options: IndexingOptions = {}): Promise<void> {\n  const rootDir = options.rootDir ?? process.cwd();\n  const spinner = ora('Starting indexing process...').start();\n  \n  try {\n    // Load configuration\n    spinner.text = 'Loading configuration...';\n    const config = await configService.load(rootDir);\n    \n    // Initialize vector database\n    spinner.text = 'Initializing vector database...';\n    const vectorDB = new VectorDB(rootDir);\n    await vectorDB.initialize();\n    \n    // Try incremental indexing first (unless forced)\n    if (!options.force) {\n      const completed = await tryIncrementalIndex(rootDir, vectorDB, config, options, spinner);\n      if (completed) {\n        return; // Incremental index completed\n      }\n    } else {\n      spinner.text = 'Force flag enabled, performing full reindex...';\n    }\n    \n    // Fall back to full index\n    await performFullIndex(rootDir, vectorDB, config, options, spinner);\n    \n  } catch (error) {\n    spinner.fail(`Indexing failed: ${error}`);\n    throw error;\n  }\n}\n\n","import { Command } from 'commander';\nimport { createRequire } from 'module';\nimport { fileURLToPath } from 'url';\nimport { dirname, join } from 'path';\nimport { initCommand } from './init.js';\nimport { statusCommand } from './status.js';\nimport { indexCommand } from './index-cmd.js';\nimport { serveCommand } from './serve.js';\nimport { complexityCommand } from './complexity.js';\n\n// Get version from package.json dynamically\nconst __filename = fileURLToPath(import.meta.url);\nconst __dirname = dirname(__filename);\nconst require = createRequire(import.meta.url);\n\nlet packageJson;\ntry {\n  packageJson = require(join(__dirname, '../package.json'));\n} catch {\n  packageJson = require(join(__dirname, '../../package.json'));\n}\n\nexport const program = new Command();\n\nprogram\n  .name('lien')\n  .description('Local semantic code search for AI assistants via MCP')\n  .version(packageJson.version);\n\nprogram\n  .command('init')\n  .description('Initialize Lien in the current directory')\n  .option('-u, --upgrade', 'Upgrade existing config with new options')\n  .option('-y, --yes', 'Skip interactive prompts and use defaults')\n  .option('-p, --path <path>', 'Path to initialize (defaults to current directory)')\n  .action(initCommand);\n\nprogram\n  .command('index')\n  .description('Index the codebase for semantic search')\n  .option('-f, --force', 'Force full reindex (skip incremental)')\n  .option('-w, --watch', 'Watch for changes and re-index automatically')\n  .option('-v, --verbose', 'Show detailed logging during indexing')\n  .action(indexCommand);\n\nprogram\n  .command('serve')\n  .description('Start the MCP server for Cursor integration')\n  .option('-p, --port <port>', 'Port number (for future use)', '7133')\n  .option('--no-watch', 'Disable file watching for this session')\n  .option('-w, --watch', '[DEPRECATED] File watching is now enabled by default')\n  .option('-r, --root <path>', 'Root directory to serve (defaults to current directory)')\n  .action(serveCommand);\n\nprogram\n  .command('status')\n  .description('Show indexing status and statistics')\n  .action(statusCommand);\n\nprogram\n  .command('complexity')\n  .description('Analyze code complexity')\n  .option('--files <paths...>', 'Specific files to analyze')\n  .option('--format <type>', 'Output format: text, json, sarif', 'text')\n  .option('--threshold <n>', 'Override both complexity thresholds (cyclomatic & cognitive)')\n  .option('--cyclomatic-threshold <n>', 'Override cyclomatic complexity threshold only')\n  .option('--cognitive-threshold <n>', 'Override cognitive complexity threshold only')\n  .option('--fail-on <severity>', 'Exit 1 if violations: error, warning')\n  .action(complexityCommand);\n\n","import fs from 'fs/promises';\nimport path from 'path';\nimport { fileURLToPath } from 'url';\nimport chalk from 'chalk';\nimport inquirer from 'inquirer';\nimport { defaultConfig, LienConfig, FrameworkInstance, FrameworkConfig } from '../config/schema.js';\nimport { showCompactBanner } from '../utils/banner.js';\nimport { MigrationManager } from '../config/migration-manager.js';\nimport { detectAllFrameworks } from '../frameworks/detector-service.js';\nimport { getFrameworkDetector } from '../frameworks/registry.js';\n\n// ES module equivalent of __dirname\nconst __filename = fileURLToPath(import.meta.url);\nconst __dirname = path.dirname(__filename);\n\nexport interface InitOptions {\n  upgrade?: boolean;\n  yes?: boolean;\n  path?: string;\n}\n\nexport async function initCommand(options: InitOptions = {}) {\n  const rootDir = options.path || process.cwd();\n  const configPath = path.join(rootDir, '.lien.config.json');\n  \n  try {\n    // Check if config already exists\n    let configExists = false;\n    try {\n      await fs.access(configPath);\n      configExists = true;\n    } catch {\n      // File doesn't exist\n    }\n    \n    // Handle upgrade scenario\n    if (configExists && options.upgrade) {\n      const migrationManager = new MigrationManager(rootDir);\n      await migrationManager.upgradeInteractive();\n      return;\n    }\n    \n    // Warn if config exists and not upgrading\n    if (configExists && !options.upgrade) {\n      console.log(chalk.yellow('⚠️  .lien.config.json already exists'));\n      console.log(chalk.dim('Run'), chalk.bold('lien init --upgrade'), chalk.dim('to merge new config options'));\n      return;\n    }\n    \n    // Create new config with framework detection\n    if (!configExists) {\n      await createNewConfig(rootDir, options);\n    }\n  } catch (error) {\n    console.error(chalk.red('Error creating config file:'), error);\n    process.exit(1);\n  }\n}\n\nasync function createNewConfig(rootDir: string, options: InitOptions) {\n  // Show banner for new initialization\n  showCompactBanner();\n  console.log(chalk.bold('Initializing Lien...\\n'));\n  \n  // 1. Run framework detection\n  console.log(chalk.dim('🔍 Detecting frameworks in'), chalk.bold(rootDir));\n  const detections = await detectAllFrameworks(rootDir);\n  \n  let frameworks: FrameworkInstance[] = [];\n  \n  if (detections.length === 0) {\n    console.log(chalk.yellow('\\n⚠️  No frameworks detected'));\n    \n    if (!options.yes) {\n      const { useGeneric } = await inquirer.prompt([\n        {\n          type: 'confirm',\n          name: 'useGeneric',\n          message: 'Create a generic config (index all supported file types)?',\n          default: true,\n        },\n      ]);\n      \n      if (!useGeneric) {\n        console.log(chalk.dim('Aborted.'));\n        return;\n      }\n    }\n    \n    // Create generic framework\n    frameworks.push({\n      name: 'generic',\n      path: '.',\n      enabled: true,\n      config: {\n        include: ['**/*.{ts,tsx,js,jsx,py,php,go,rs,java,c,cpp,cs}'],\n        exclude: [\n          '**/node_modules/**',\n          '**/dist/**',\n          '**/build/**',\n          '**/.git/**',\n          '**/coverage/**',\n          '**/.next/**',\n          '**/.nuxt/**',\n          '**/vendor/**',\n        ],\n      },\n    });\n  } else {\n    // 2. Display detected frameworks\n    console.log(chalk.green(`\\n✓ Found ${detections.length} framework(s):\\n`));\n    \n    for (const det of detections) {\n      const pathDisplay = det.path === '.' ? 'root' : det.path;\n      console.log(chalk.bold(`  ${det.name}`), chalk.dim(`(${det.confidence} confidence)`));\n      console.log(chalk.dim(`    Location: ${pathDisplay}`));\n      \n      if (det.evidence.length > 0) {\n        det.evidence.forEach((e) => {\n          console.log(chalk.dim(`    • ${e}`));\n        });\n      }\n      console.log();\n    }\n    \n    // 3. Interactive confirmation\n    if (!options.yes) {\n      const { confirm } = await inquirer.prompt([\n        {\n          type: 'confirm',\n          name: 'confirm',\n          message: 'Configure these frameworks?',\n          default: true,\n        },\n      ]);\n      \n      if (!confirm) {\n        console.log(chalk.dim('Aborted.'));\n        return;\n      }\n    }\n    \n    // 4. Generate configs for each detected framework\n    for (const det of detections) {\n      const detector = getFrameworkDetector(det.name);\n      if (!detector) {\n        console.warn(chalk.yellow(`⚠️  No detector found for ${det.name}, skipping`));\n        continue;\n      }\n      \n      // Generate default config\n      const frameworkConfig = await detector.generateConfig(rootDir, det.path);\n      \n      // Optional: Ask to customize (only in interactive mode)\n      let shouldCustomize = false;\n      if (!options.yes) {\n        const { customize } = await inquirer.prompt([\n          {\n            type: 'confirm',\n            name: 'customize',\n            message: `Customize ${det.name} settings?`,\n            default: false,\n          },\n        ]);\n        shouldCustomize = customize;\n      }\n      \n      let finalConfig = frameworkConfig;\n      if (shouldCustomize) {\n        const customized = await promptForCustomization(det.name, frameworkConfig);\n        finalConfig = { ...frameworkConfig, ...customized };\n      } else {\n        const pathDisplay = det.path === '.' ? 'root' : det.path;\n        console.log(chalk.dim(`  → Using defaults for ${det.name} at ${pathDisplay}`));\n      }\n      \n      frameworks.push({\n        name: det.name,\n        path: det.path,\n        enabled: true,\n        config: finalConfig,\n      });\n    }\n  }\n  \n  // 5. Ask about Cursor rules installation\n  if (!options.yes) {\n    const { installCursorRules } = await inquirer.prompt([\n      {\n        type: 'confirm',\n        name: 'installCursorRules',\n        message: 'Install recommended Cursor rules?',\n        default: true,\n      },\n    ]);\n    \n    if (installCursorRules) {\n      try {\n        const cursorRulesDir = path.join(rootDir, '.cursor');\n        await fs.mkdir(cursorRulesDir, { recursive: true });\n        \n        // Find template - it's in the package root (same dir as package.json)\n        // When compiled: everything bundles to dist/index.js, so __dirname is dist/\n        // Go up one level from dist/ to reach package root\n        const templatePath = path.join(__dirname, '../CURSOR_RULES_TEMPLATE.md');\n        \n        const rulesPath = path.join(cursorRulesDir, 'rules');\n        let targetPath: string;\n        let isDirectory = false;\n        let isFile = false;\n\n        try {\n          const stats = await fs.stat(rulesPath);\n          isDirectory = stats.isDirectory();\n          isFile = stats.isFile();\n        } catch {\n          // Doesn't exist, that's fine\n        }\n\n        if (isDirectory) {\n          // .cursor/rules is already a directory, create lien.mdc inside it\n          targetPath = path.join(rulesPath, 'lien.mdc');\n          await fs.copyFile(templatePath, targetPath);\n          console.log(chalk.green('✓ Installed Cursor rules as .cursor/rules/lien.mdc'));\n        } else if (isFile) {\n          // .cursor/rules exists as a file - ask to convert to directory structure\n          const { convertToDir } = await inquirer.prompt([\n            {\n              type: 'confirm',\n              name: 'convertToDir',\n              message: 'Existing .cursor/rules file found. Convert to directory and preserve your rules?',\n              default: true,\n            },\n          ]);\n\n          if (convertToDir) {\n            // Convert file to directory structure\n            // 1. Read existing rules\n            const existingRules = await fs.readFile(rulesPath, 'utf-8');\n            // 2. Delete the file\n            await fs.unlink(rulesPath);\n            // 3. Create rules as a directory\n            await fs.mkdir(rulesPath);\n            // 4. Save original rules as project.mdc\n            await fs.writeFile(path.join(rulesPath, 'project.mdc'), existingRules);\n            // 5. Add Lien rules as lien.mdc\n            await fs.copyFile(templatePath, path.join(rulesPath, 'lien.mdc'));\n            console.log(chalk.green('✓ Converted .cursor/rules to directory'));\n            console.log(chalk.green('  - Your project rules: .cursor/rules/project.mdc'));\n            console.log(chalk.green('  - Lien rules: .cursor/rules/lien.mdc'));\n          } else {\n            console.log(chalk.dim('Skipped Cursor rules installation (preserving existing file)'));\n          }\n        } else {\n          // .cursor/rules doesn't exist, create it as a directory\n          await fs.mkdir(rulesPath, { recursive: true });\n          targetPath = path.join(rulesPath, 'lien.mdc');\n          await fs.copyFile(templatePath, targetPath);\n          console.log(chalk.green('✓ Installed Cursor rules as .cursor/rules/lien.mdc'));\n        }\n      } catch (error) {\n        console.log(chalk.yellow('⚠️  Could not install Cursor rules'));\n        console.log(chalk.dim(`Error: ${error instanceof Error ? error.message : 'Unknown error'}`));\n        console.log(chalk.dim('You can manually copy CURSOR_RULES_TEMPLATE.md to .cursor/rules/lien.mdc'));\n      }\n    }\n  }\n  \n  // 6. Build final config\n  const config: LienConfig = {\n    ...defaultConfig,\n    frameworks,\n  };\n  \n  // 7. Write config\n  const configPath = path.join(rootDir, '.lien.config.json');\n  await fs.writeFile(configPath, JSON.stringify(config, null, 2) + '\\n', 'utf-8');\n  \n  // 8. Show success message\n  console.log(chalk.green('\\n✓ Created .lien.config.json'));\n  console.log(chalk.green(`✓ Configured ${frameworks.length} framework(s)`));\n  console.log(chalk.dim('\\nNext steps:'));\n  console.log(chalk.dim('  1. Run'), chalk.bold('lien index'), chalk.dim('to index your codebase'));\n  console.log(chalk.dim('  2. Run'), chalk.bold('lien serve'), chalk.dim('to start the MCP server'));\n  console.log(chalk.dim('  3. Configure Cursor to use the MCP server (see README.md)'));\n}\n\nasync function promptForCustomization(frameworkName: string, config: FrameworkConfig): Promise<Partial<FrameworkConfig>> {\n  console.log(chalk.bold(`\\nCustomizing ${frameworkName} settings:`));\n  \n  const answers = await inquirer.prompt([\n    {\n      type: 'input',\n      name: 'include',\n      message: 'File patterns to include (comma-separated):',\n      default: config.include.join(', '),\n      filter: (input: string) => input.split(',').map(s => s.trim()),\n    },\n    {\n      type: 'input',\n      name: 'exclude',\n      message: 'File patterns to exclude (comma-separated):',\n      default: config.exclude.join(', '),\n      filter: (input: string) => input.split(',').map(s => s.trim()),\n    },\n  ]);\n  \n  return {\n    include: answers.include,\n    exclude: answers.exclude,\n  };\n}\n\n// Removed: upgradeConfig function is now handled by MigrationManager.upgradeInteractive()\n","import figlet from 'figlet';\nimport chalk from 'chalk';\nimport { createRequire } from 'module';\nimport { fileURLToPath } from 'url';\nimport { dirname, join } from 'path';\n\n// Get package.json dynamically\n// In development: src/utils/banner.ts -> ../../package.json\n// In production (bundled): dist/index.js -> ../package.json\nconst __filename = fileURLToPath(import.meta.url);\nconst __dirname = dirname(__filename);\nconst require = createRequire(import.meta.url);\n\n// Try production path first (dist -> package.json), then dev path\nlet packageJson;\ntry {\n  packageJson = require(join(__dirname, '../package.json'));\n} catch {\n  packageJson = require(join(__dirname, '../../package.json'));\n}\n\n// Package info\nconst PACKAGE_NAME = packageJson.name;\nconst VERSION = packageJson.version;\n\n/**\n * Wrap text in a box with a footer line\n */\nfunction wrapInBox(text: string, footer: string, padding = 1): string {\n  const lines = text.split('\\n').filter(line => line.trim().length > 0);\n  \n  // Use only the main content (logo) to determine box width\n  const maxLength = Math.max(...lines.map(line => line.length));\n  \n  const horizontalBorder = '─'.repeat(maxLength + padding * 2);\n  const top = `┌${horizontalBorder}┐`;\n  const bottom = `└${horizontalBorder}┘`;\n  const separator = `├${horizontalBorder}┤`;\n  \n  const paddedLines = lines.map(line => {\n    const padRight = ' '.repeat(maxLength - line.length + padding);\n    const padLeft = ' '.repeat(padding);\n    return `│${padLeft}${line}${padRight}│`;\n  });\n  \n  // Center the footer line\n  const totalPad = maxLength - footer.length;\n  const leftPad = Math.floor(totalPad / 2);\n  const rightPad = totalPad - leftPad;\n  const centeredFooter = ' '.repeat(leftPad) + footer + ' '.repeat(rightPad);\n  \n  const paddedFooter = `│${' '.repeat(padding)}${centeredFooter}${' '.repeat(padding)}│`;\n  \n  return [top, ...paddedLines, separator, paddedFooter, bottom].join('\\n');\n}\n\n/**\n * Display the gorgeous ANSI Shadow banner (uses stderr for MCP server)\n */\nexport function showBanner(): void {\n  const banner = figlet.textSync('LIEN', {\n    font: 'ANSI Shadow',\n    horizontalLayout: 'fitted',\n    verticalLayout: 'fitted',\n  });\n\n  const footer = `${PACKAGE_NAME} - v${VERSION}`;\n  const boxedBanner = wrapInBox(banner.trim(), footer);\n  console.error(chalk.cyan(boxedBanner));\n  console.error(); // Empty line\n}\n\n/**\n * Display the gorgeous ANSI Shadow banner (uses stdout for CLI commands)\n */\nexport function showCompactBanner(): void {\n  const banner = figlet.textSync('LIEN', {\n    font: 'ANSI Shadow',\n    horizontalLayout: 'fitted',\n    verticalLayout: 'fitted',\n  });\n\n  const footer = `${PACKAGE_NAME} - v${VERSION}`;\n  const boxedBanner = wrapInBox(banner.trim(), footer);\n  console.log(chalk.cyan(boxedBanner));\n  console.log(); // Empty line\n}\n\n","import fs from 'fs/promises';\nimport path from 'path';\nimport chalk from 'chalk';\nimport { LienConfig, defaultConfig } from './schema.js';\nimport { needsMigration, migrateConfig, migrateConfigFile } from './migration.js';\nimport { deepMergeConfig, detectNewFields } from './merge.js';\nimport { CURRENT_CONFIG_VERSION } from '../constants.js';\n\n/**\n * Result of a migration operation\n */\nexport interface MigrationResult {\n  migrated: boolean;\n  backupPath?: string;\n  config: LienConfig;\n}\n\n/**\n * Centralized migration orchestration service\n * \n * Handles all config migration scenarios:\n * - Auto-migration during config loading\n * - Interactive upgrade via CLI\n * - Migration status checking\n */\nexport class MigrationManager {\n  constructor(private readonly rootDir: string = process.cwd()) {}\n  \n  /**\n   * Get the config file path\n   */\n  private getConfigPath(): string {\n    return path.join(this.rootDir, '.lien.config.json');\n  }\n  \n  /**\n   * Check if the current config needs migration\n   */\n  async needsMigration(): Promise<boolean> {\n    try {\n      const configPath = this.getConfigPath();\n      const content = await fs.readFile(configPath, 'utf-8');\n      const config = JSON.parse(content);\n      return needsMigration(config);\n    } catch (error) {\n      // If config doesn't exist or can't be read, no migration needed\n      return false;\n    }\n  }\n  \n  /**\n   * Perform silent migration (for auto-migration during load)\n   * Returns the migrated config without user interaction\n   */\n  async autoMigrate(): Promise<LienConfig> {\n    const result = await migrateConfigFile(this.rootDir);\n    \n    if (result.migrated && result.backupPath) {\n      const backupFilename = path.basename(result.backupPath);\n      console.log(`✅ Migration complete! Backup saved as ${backupFilename}`);\n      console.log('📝 Your config now uses the framework-based structure.');\n    }\n    \n    return result.config;\n  }\n  \n  /**\n   * Perform interactive upgrade (for CLI upgrade command)\n   * Provides detailed feedback and handles edge cases\n   */\n  async upgradeInteractive(): Promise<void> {\n    const configPath = this.getConfigPath();\n    \n    try {\n      // 1. Read existing config\n      const existingContent = await fs.readFile(configPath, 'utf-8');\n      const existingConfig = JSON.parse(existingContent);\n      \n      // 2. Check if any changes are needed\n      const migrationNeeded = needsMigration(existingConfig);\n      const newFields = migrationNeeded ? [] : detectNewFields(existingConfig, defaultConfig);\n      const hasChanges = migrationNeeded || newFields.length > 0;\n      \n      if (!hasChanges) {\n        console.log(chalk.green('✓ Config is already up to date'));\n        console.log(chalk.dim('No changes needed'));\n        return;\n      }\n      \n      // 3. Backup existing config (only if changes are needed)\n      const backupPath = `${configPath}.backup`;\n      await fs.copyFile(configPath, backupPath);\n      \n      // 4. Perform upgrade\n      let upgradedConfig: LienConfig;\n      let migrated = false;\n      \n      if (migrationNeeded) {\n        console.log(chalk.blue(`🔄 Migrating config from v0.2.0 to v${CURRENT_CONFIG_VERSION}...`));\n        upgradedConfig = migrateConfig(existingConfig);\n        migrated = true;\n      } else {\n        // Just merge with defaults for current version configs\n        upgradedConfig = deepMergeConfig(defaultConfig, existingConfig as Partial<LienConfig>);\n        \n        console.log(chalk.dim('\\nNew options added:'));\n        newFields.forEach(field => console.log(chalk.dim('  •'), chalk.bold(field)));\n      }\n      \n      // 5. Write upgraded config\n      await fs.writeFile(\n        configPath,\n        JSON.stringify(upgradedConfig, null, 2) + '\\n',\n        'utf-8'\n      );\n      \n      // 6. Show results\n      console.log(chalk.green('✓ Config upgraded successfully'));\n      console.log(chalk.dim('Backup saved to:'), backupPath);\n      \n      if (migrated) {\n        console.log(chalk.dim('\\n📝 Your config now uses the framework-based structure.'));\n      }\n    } catch (error) {\n      if ((error as NodeJS.ErrnoException).code === 'ENOENT') {\n        console.log(chalk.red('Error: No config file found'));\n        console.log(chalk.dim('Run'), chalk.bold('lien init'), chalk.dim('to create a config file'));\n        return;\n      }\n      throw error;\n    }\n  }\n  \n  /**\n   * Perform migration and return result\n   * Used when programmatic access to migration result is needed\n   */\n  async migrate(): Promise<MigrationResult> {\n    return migrateConfigFile(this.rootDir);\n  }\n}\n\n","import fs from 'fs/promises';\nimport path from 'path';\nimport { DetectionResult, DetectionOptions, defaultDetectionOptions } from './types.js';\nimport { frameworkDetectors } from './registry.js';\n\n/**\n * Detect all frameworks in a monorepo by recursively scanning subdirectories\n * @param rootDir - Absolute path to project root\n * @param options - Detection options (max depth, skip dirs)\n * @returns Array of detected frameworks with their paths\n */\nexport async function detectAllFrameworks(\n  rootDir: string,\n  options: Partial<DetectionOptions> = {}\n): Promise<DetectionResult[]> {\n  const opts = { ...defaultDetectionOptions, ...options };\n  const results: DetectionResult[] = [];\n  const visited = new Set<string>();\n  \n  // Detect at root first\n  await detectAtPath(rootDir, '.', results, visited);\n  \n  // Recursively scan subdirectories\n  await scanSubdirectories(rootDir, '.', results, visited, 0, opts);\n  \n  return results;\n}\n\n/**\n * Detect frameworks at a specific path\n */\nasync function detectAtPath(\n  rootDir: string,\n  relativePath: string,\n  results: DetectionResult[],\n  visited: Set<string>\n): Promise<void> {\n  // Mark as visited\n  const fullPath = path.join(rootDir, relativePath);\n  if (visited.has(fullPath)) {\n    return;\n  }\n  visited.add(fullPath);\n  \n  // Run all detectors and collect results\n  const detectedAtPath: Array<DetectionResult & { priority: number }> = [];\n  \n  for (const detector of frameworkDetectors) {\n    try {\n      const result = await detector.detect(rootDir, relativePath);\n      if (result.detected) {\n        detectedAtPath.push({\n          ...result,\n          priority: detector.priority ?? 0,\n        });\n      }\n    } catch (error) {\n      // Log error but continue with other detectors\n      console.error(`Error running detector '${detector.name}' at ${relativePath}:`, error);\n    }\n  }\n  \n  // Conflict resolution: Allow multiple HIGH-confidence frameworks to coexist\n  // This enables hybrid projects (e.g., Shopify + Node.js, Laravel + Node.js)\n  if (detectedAtPath.length > 1) {\n    // Separate frameworks by confidence level\n    const highConfidence = detectedAtPath.filter(d => d.confidence === 'high');\n    const mediumConfidence = detectedAtPath.filter(d => d.confidence === 'medium');\n    const lowConfidence = detectedAtPath.filter(d => d.confidence === 'low');\n    \n    if (highConfidence.length > 1) {\n      // Multiple HIGH-confidence frameworks -> keep all (hybrid/monorepo behavior)\n      // Strip internal priority property before adding to results\n      const cleanResults = highConfidence.map(({ priority, ...result }) => result);\n      results.push(...cleanResults);\n      const names = highConfidence.map(d => d.name).join(' + ');\n      console.log(`  → Detected hybrid project: ${names}`);\n      \n      // Log skipped medium/low confidence detections\n      if (mediumConfidence.length > 0 || lowConfidence.length > 0) {\n        const skippedNames = [...mediumConfidence, ...lowConfidence].map(d => d.name).join(', ');\n        console.log(`  → Skipping lower confidence detections: ${skippedNames}`);\n      }\n    } else if (highConfidence.length === 1) {\n      // Only one HIGH-confidence framework\n      const { priority, ...result } = highConfidence[0];\n      results.push(result);\n      \n      // Log skipped medium/low confidence detections\n      if (mediumConfidence.length > 0 || lowConfidence.length > 0) {\n        const skippedNames = [...mediumConfidence, ...lowConfidence].map(d => d.name).join(', ');\n        console.log(`  → Skipping lower confidence detections: ${skippedNames}`);\n      }\n    } else if (mediumConfidence.length > 0) {\n      // No HIGH confidence, but have MEDIUM -> use priority system\n      mediumConfidence.sort((a, b) => b.priority - a.priority);\n      const { priority, ...winner } = mediumConfidence[0];\n      results.push(winner);\n      \n      // Skipped = remaining medium + all low confidence\n      const skipped = [...mediumConfidence.slice(1), ...lowConfidence];\n      if (skipped.length > 0) {\n        const skippedNames = skipped.map(d => d.name).join(', ');\n        console.log(`  → Skipping ${skippedNames} at ${relativePath} (${winner.name} takes precedence)`);\n      }\n    } else if (lowConfidence.length > 0) {\n      // Only LOW confidence -> use priority system\n      lowConfidence.sort((a, b) => b.priority - a.priority);\n      const { priority, ...winner } = lowConfidence[0];\n    results.push(winner);\n    \n      // Skipped = remaining low confidence\n      const skipped = lowConfidence.slice(1);\n    if (skipped.length > 0) {\n      const skippedNames = skipped.map(d => d.name).join(', ');\n      console.log(`  → Skipping ${skippedNames} at ${relativePath} (${winner.name} takes precedence)`);\n      }\n    }\n  } else if (detectedAtPath.length === 1) {\n    const { priority, ...result } = detectedAtPath[0];\n    results.push(result);\n  }\n}\n\n/**\n * Recursively scan subdirectories for frameworks\n */\nasync function scanSubdirectories(\n  rootDir: string,\n  relativePath: string,\n  results: DetectionResult[],\n  visited: Set<string>,\n  depth: number,\n  options: DetectionOptions\n): Promise<void> {\n  // Check depth limit\n  if (depth >= options.maxDepth) {\n    return;\n  }\n  \n  const fullPath = path.join(rootDir, relativePath);\n  \n  try {\n    const entries = await fs.readdir(fullPath, { withFileTypes: true });\n    \n    // Process only directories\n    const dirs = entries.filter(e => e.isDirectory());\n    \n    for (const dir of dirs) {\n      // Skip directories in the skip list\n      if (options.skipDirs.includes(dir.name)) {\n        continue;\n      }\n      \n      // Skip hidden directories (except .git, .github which are already in skipDirs)\n      if (dir.name.startsWith('.')) {\n        continue;\n      }\n      \n      const subPath = relativePath === '.' \n        ? dir.name \n        : path.join(relativePath, dir.name);\n      \n      // Detect at this subdirectory\n      await detectAtPath(rootDir, subPath, results, visited);\n      \n      // Recurse deeper\n      await scanSubdirectories(rootDir, subPath, results, visited, depth + 1, options);\n    }\n  } catch (error) {\n    // Silently skip directories we can't read (permission errors, etc.)\n    return;\n  }\n}\n\n/**\n * Get a human-readable summary of detected frameworks\n */\nexport function getDetectionSummary(results: DetectionResult[]): string {\n  if (results.length === 0) {\n    return 'No frameworks detected';\n  }\n  \n  const lines: string[] = [];\n  \n  for (const result of results) {\n    const pathDisplay = result.path === '.' ? 'root' : result.path;\n    lines.push(`${result.name} at ${pathDisplay} (${result.confidence} confidence)`);\n    \n    if (result.evidence.length > 0) {\n      result.evidence.forEach(e => {\n        lines.push(`  - ${e}`);\n      });\n    }\n  }\n  \n  return lines.join('\\n');\n}\n\n","import { FrameworkConfig } from '../config/schema.js';\n\n/**\n * Result of framework detection\n */\nexport interface DetectionResult {\n  detected: boolean;\n  name: string;          // 'nodejs', 'laravel'\n  path: string;          // Relative path from root: '.', 'packages/cli', 'cognito-backend'\n  confidence: 'high' | 'medium' | 'low';\n  evidence: string[];    // Human-readable evidence (e.g., \"Found package.json with jest\")\n  version?: string;      // Framework/language version if detectable\n}\n\n/**\n * Interface for framework detectors\n */\nexport interface FrameworkDetector {\n  name: string;          // Unique framework identifier\n  \n  /**\n   * Priority for conflict resolution (higher = takes precedence)\n   * - 100: Specific frameworks (Laravel, Rails, Django)\n   * - 50: Generic frameworks (Node.js, Python)\n   * - 0: Fallback/generic\n   */\n  priority?: number;\n  \n  /**\n   * Detect if this framework exists at the given path\n   * @param rootDir - Absolute path to project root\n   * @param relativePath - Relative path from root to check (e.g., '.' or 'packages/cli')\n   * @returns Detection result with evidence\n   */\n  detect(rootDir: string, relativePath: string): Promise<DetectionResult>;\n  \n  /**\n   * Generate default configuration for this framework\n   * @param rootDir - Absolute path to project root\n   * @param relativePath - Relative path where framework was detected\n   * @returns Framework-specific configuration\n   */\n  generateConfig(rootDir: string, relativePath: string): Promise<FrameworkConfig>;\n}\n\n/**\n * Options for framework detection\n */\nexport interface DetectionOptions {\n  maxDepth: number;      // Maximum directory depth to scan\n  skipDirs: string[];    // Directories to skip (node_modules, vendor, etc.)\n}\n\n/**\n * Default detection options\n */\nexport const defaultDetectionOptions: DetectionOptions = {\n  maxDepth: 3,\n  skipDirs: [\n    'node_modules',\n    'vendor',\n    'dist',\n    'build',\n    '.next',\n    '.nuxt',\n    'coverage',\n    '.git',\n    '.idea',\n    '.vscode',\n    'tmp',\n    'temp',\n  ],\n};\n\n","import fs from 'fs/promises';\nimport path from 'path';\nimport { FrameworkDetector, DetectionResult } from '../types.js';\nimport { generateNodeJsConfig } from './config.js';\n\n/**\n * Node.js/TypeScript/JavaScript framework detector\n */\nexport const nodejsDetector: FrameworkDetector = {\n  name: 'nodejs',\n  priority: 50, // Generic, yields to specific frameworks like Laravel\n  \n  async detect(rootDir: string, relativePath: string): Promise<DetectionResult> {\n    const fullPath = path.join(rootDir, relativePath);\n    const result: DetectionResult = {\n      detected: false,\n      name: 'nodejs',\n      path: relativePath,\n      confidence: 'low',\n      evidence: [],\n    };\n    \n    // Check for package.json\n    const packageJsonPath = path.join(fullPath, 'package.json');\n    let packageJson: any = null;\n    \n    try {\n      const content = await fs.readFile(packageJsonPath, 'utf-8');\n      packageJson = JSON.parse(content);\n      result.evidence.push('Found package.json');\n    } catch {\n      // No package.json, not a Node.js project\n      return result;\n    }\n    \n    // At this point, we know it's a Node.js project\n    result.detected = true;\n    result.confidence = 'high';\n    \n    // Check for TypeScript\n    if (packageJson.devDependencies?.typescript || packageJson.dependencies?.typescript) {\n      result.evidence.push('TypeScript detected');\n    }\n    \n    // Check for testing frameworks\n    const testFrameworks = [\n      { name: 'jest', display: 'Jest' },\n      { name: 'vitest', display: 'Vitest' },\n      { name: 'mocha', display: 'Mocha' },\n      { name: 'ava', display: 'AVA' },\n      { name: '@playwright/test', display: 'Playwright' },\n    ];\n    \n    for (const framework of testFrameworks) {\n      if (\n        packageJson.devDependencies?.[framework.name] || \n        packageJson.dependencies?.[framework.name]\n      ) {\n        result.evidence.push(`${framework.display} test framework detected`);\n        break; // Only mention first test framework found\n      }\n    }\n    \n    // Check for common frameworks/libraries\n    const frameworks = [\n      { name: 'next', display: 'Next.js' },\n      { name: 'react', display: 'React' },\n      { name: 'vue', display: 'Vue' },\n      { name: 'express', display: 'Express' },\n      { name: '@nestjs/core', display: 'NestJS' },\n    ];\n    \n    for (const fw of frameworks) {\n      if (packageJson.dependencies?.[fw.name]) {\n        result.evidence.push(`${fw.display} detected`);\n        break; // Only mention first framework found\n      }\n    }\n    \n    // Try to detect version from package.json engines or node version\n    if (packageJson.engines?.node) {\n      result.version = packageJson.engines.node;\n    }\n    \n    return result;\n  },\n  \n  async generateConfig(rootDir: string, relativePath: string) {\n    return generateNodeJsConfig(rootDir, relativePath);\n  },\n};\n\n","import { FrameworkConfig } from '../../config/schema.js';\n\n/**\n * Generate Node.js framework configuration\n */\nexport async function generateNodeJsConfig(\n  _rootDir: string,\n  _relativePath: string\n): Promise<FrameworkConfig> {\n  return {\n    include: [\n      // Broader patterns to catch all common project structures\n      // (frontend/, src/, lib/, app/, components/, etc.)\n      '**/*.ts',\n      '**/*.tsx',\n      '**/*.js',\n      '**/*.jsx',\n      '**/*.vue',\n      '**/*.mjs',\n      '**/*.cjs',\n      '**/*.md',\n      '**/*.mdx',\n    ],\n    exclude: [\n      // Node.js dependencies (with ** prefix for nested projects)\n      '**/node_modules/**',\n      'node_modules/**',\n      \n      // PHP/Composer dependencies (for monorepos with PHP)\n      '**/vendor/**',\n      'vendor/**',\n      \n      // Build outputs\n      '**/dist/**',\n      'dist/**',\n      '**/build/**',\n      'build/**',\n      '**/public/build/**',\n      'public/build/**',\n      'out/**',\n      \n      // Framework build caches\n      '.next/**',\n      '.nuxt/**',\n      '.vite/**',\n      '.lien/**',\n      \n      // Test artifacts\n      'coverage/**',\n      'playwright-report/**',\n      'test-results/**',\n      \n      // Build/generated artifacts\n      '__generated__/**',\n      \n      // Common build/cache directories\n      '.cache/**',\n      '.turbo/**',\n      '.vercel/**',\n      '.netlify/**',\n      \n      // Minified/bundled files\n      '**/*.min.js',\n      '**/*.min.css',\n      '**/*.bundle.js',\n    ],\n  };\n}\n\n","import fs from 'fs/promises';\nimport path from 'path';\nimport { FrameworkDetector, DetectionResult } from '../types.js';\nimport { generatePhpConfig } from './config.js';\n\n/**\n * Generic PHP framework detector\n * Detects any PHP project with composer.json\n */\nexport const phpDetector: FrameworkDetector = {\n  name: 'php',\n  priority: 50, // Generic, yields to specific frameworks like Laravel\n  \n  async detect(rootDir: string, relativePath: string): Promise<DetectionResult> {\n    const fullPath = path.join(rootDir, relativePath);\n    const result: DetectionResult = {\n      detected: false,\n      name: 'php',\n      path: relativePath,\n      confidence: 'low',\n      evidence: [],\n    };\n    \n    // Check for composer.json\n    const composerJsonPath = path.join(fullPath, 'composer.json');\n    let composerJson: any = null;\n    \n    try {\n      const content = await fs.readFile(composerJsonPath, 'utf-8');\n      composerJson = JSON.parse(content);\n      result.evidence.push('Found composer.json');\n    } catch {\n      // No composer.json, not a PHP project\n      return result;\n    }\n    \n    // Check if this is a Laravel project (Laravel detector should handle it)\n    const hasLaravel = \n      composerJson.require?.['laravel/framework'] ||\n      composerJson['require-dev']?.['laravel/framework'];\n    \n    if (hasLaravel) {\n      // This is a Laravel project - let the Laravel detector handle it\n      // Return not detected to avoid redundant \"php\" + \"laravel\" detection\n      return result;\n    }\n    \n    // At this point, we know it's a generic PHP project (not Laravel)\n    result.detected = true;\n    result.confidence = 'high';\n    \n    // Check for common PHP directories\n    const phpDirs = ['src', 'lib', 'app', 'tests'];\n    let foundDirs = 0;\n    \n    for (const dir of phpDirs) {\n      try {\n        const dirPath = path.join(fullPath, dir);\n        const stats = await fs.stat(dirPath);\n        if (stats.isDirectory()) {\n          foundDirs++;\n        }\n      } catch {\n        // Directory doesn't exist\n      }\n    }\n    \n    if (foundDirs > 0) {\n      result.evidence.push(`Found PHP project structure (${foundDirs} directories)`);\n    }\n    \n    // Check for PHP version\n    if (composerJson.require?.php) {\n      result.version = composerJson.require.php;\n      result.evidence.push(`PHP ${composerJson.require.php}`);\n    }\n    \n    // Check for testing frameworks\n    const testFrameworks = [\n      { name: 'phpunit/phpunit', display: 'PHPUnit' },\n      { name: 'pestphp/pest', display: 'Pest' },\n      { name: 'codeception/codeception', display: 'Codeception' },\n      { name: 'behat/behat', display: 'Behat' },\n    ];\n    \n    for (const framework of testFrameworks) {\n      if (\n        composerJson.require?.[framework.name] || \n        composerJson['require-dev']?.[framework.name]\n      ) {\n        result.evidence.push(`${framework.display} test framework detected`);\n        break; // Only mention first test framework found\n      }\n    }\n    \n    // Check for common PHP tools/frameworks\n    const tools = [\n      { name: 'symfony/framework-bundle', display: 'Symfony' },\n      { name: 'symfony/http-kernel', display: 'Symfony' },\n      { name: 'symfony/symfony', display: 'Symfony (monolithic)' },\n      { name: 'doctrine/orm', display: 'Doctrine ORM' },\n      { name: 'guzzlehttp/guzzle', display: 'Guzzle HTTP' },\n      { name: 'monolog/monolog', display: 'Monolog' },\n    ];\n    \n    for (const tool of tools) {\n      if (composerJson.require?.[tool.name]) {\n        result.evidence.push(`${tool.display} detected`);\n        break; // Only mention first tool found\n      }\n    }\n    \n    return result;\n  },\n  \n  async generateConfig(rootDir: string, relativePath: string) {\n    return generatePhpConfig(rootDir, relativePath);\n  },\n};\n\n","import { FrameworkConfig } from '../../config/schema.js';\n\n/**\n * Generate generic PHP framework configuration\n */\nexport async function generatePhpConfig(\n  _rootDir: string,\n  _relativePath: string\n): Promise<FrameworkConfig> {\n  return {\n    include: [\n      // PHP source code\n      'src/**/*.php',\n      'lib/**/*.php',\n      'app/**/*.php',\n      'tests/**/*.php',\n      '*.php',\n      \n      // Common PHP project files\n      'config/**/*.php',\n      'public/**/*.php',\n      \n      // Documentation\n      '**/*.md',\n      '**/*.mdx',\n      'docs/**/*.md',\n      'README.md',\n      'CHANGELOG.md',\n    ],\n    exclude: [\n      // Composer dependencies (CRITICAL)\n      '**/vendor/**',\n      'vendor/**',\n      \n      // Node.js dependencies\n      '**/node_modules/**',\n      'node_modules/**',\n      \n      // Build outputs\n      '**/dist/**',\n      'dist/**',\n      '**/build/**',\n      'build/**',\n      '**/public/build/**',\n      'public/build/**',\n      \n      // Laravel/PHP system directories\n      'storage/**',\n      'cache/**',\n      'bootstrap/cache/**',\n      \n      // Test artifacts\n      'coverage/**',\n      'test-results/**',\n      '.phpunit.cache/**',\n      \n      // Build outputs\n      '__generated__/**',\n      \n      // Minified files\n      '**/*.min.js',\n      '**/*.min.css',\n    ],\n  };\n}\n\n","import fs from 'fs/promises';\nimport path from 'path';\nimport { FrameworkDetector, DetectionResult } from '../types.js';\nimport { generateLaravelConfig } from './config.js';\n\n/**\n * Laravel/PHP framework detector\n */\nexport const laravelDetector: FrameworkDetector = {\n  name: 'laravel',\n  priority: 100, // Laravel takes precedence over Node.js\n  \n  async detect(rootDir: string, relativePath: string): Promise<DetectionResult> {\n    const fullPath = path.join(rootDir, relativePath);\n    const result: DetectionResult = {\n      detected: false,\n      name: 'laravel',\n      path: relativePath,\n      confidence: 'low',\n      evidence: [],\n    };\n    \n    // Check for composer.json with Laravel\n    const composerJsonPath = path.join(fullPath, 'composer.json');\n    let composerJson: any = null;\n    \n    try {\n      const content = await fs.readFile(composerJsonPath, 'utf-8');\n      composerJson = JSON.parse(content);\n      result.evidence.push('Found composer.json');\n    } catch {\n      // No composer.json, not a Laravel project\n      return result;\n    }\n    \n    // Check if Laravel framework is in dependencies\n    const hasLaravel = \n      composerJson.require?.['laravel/framework'] ||\n      composerJson['require-dev']?.['laravel/framework'];\n    \n    if (!hasLaravel) {\n      // Has composer.json but not Laravel\n      return result;\n    }\n    \n    result.evidence.push('Laravel framework detected in composer.json');\n    \n    // Check for artisan file (strong indicator of Laravel)\n    const artisanPath = path.join(fullPath, 'artisan');\n    try {\n      await fs.access(artisanPath);\n      result.evidence.push('Found artisan file');\n      result.confidence = 'high';\n    } catch {\n      result.confidence = 'medium';\n    }\n    \n    // Check for typical Laravel directory structure\n    const laravelDirs = ['app', 'routes', 'config', 'database'];\n    let foundDirs = 0;\n    \n    for (const dir of laravelDirs) {\n      try {\n        const dirPath = path.join(fullPath, dir);\n        const stats = await fs.stat(dirPath);\n        if (stats.isDirectory()) {\n          foundDirs++;\n        }\n      } catch {\n        // Directory doesn't exist\n      }\n    }\n    \n    if (foundDirs >= 2) {\n      result.evidence.push(`Laravel directory structure detected (${foundDirs}/${laravelDirs.length} dirs)`);\n      result.confidence = 'high';\n    }\n    \n    // Check for test directories\n    const testDirsToCheck = [\n      path.join(fullPath, 'tests', 'Feature'),\n      path.join(fullPath, 'tests', 'Unit'),\n    ];\n    \n    for (const testDir of testDirsToCheck) {\n      try {\n        const stats = await fs.stat(testDir);\n        if (stats.isDirectory()) {\n          const dirName = path.basename(path.dirname(testDir)) + '/' + path.basename(testDir);\n          result.evidence.push(`Found ${dirName} test directory`);\n        }\n      } catch {\n        // Test directory doesn't exist\n      }\n    }\n    \n    // Extract Laravel version if available\n    if (composerJson.require?.['laravel/framework']) {\n      result.version = composerJson.require['laravel/framework'];\n    }\n    \n    result.detected = true;\n    return result;\n  },\n  \n  async generateConfig(rootDir: string, relativePath: string) {\n    return generateLaravelConfig(rootDir, relativePath);\n  },\n};\n\n","import { FrameworkConfig } from '../../config/schema.js';\n\n/**\n * Generate Laravel framework configuration\n */\nexport async function generateLaravelConfig(\n  _rootDir: string,\n  _relativePath: string\n): Promise<FrameworkConfig> {\n  return {\n    include: [\n      // PHP backend\n      'app/**/*.php',\n      'routes/**/*.php',\n      'config/**/*.php',\n      'database/**/*.php',\n      'resources/**/*.php',\n      'tests/**/*.php',\n      '*.php',\n      // Frontend assets (Vue/React/Inertia) - Scoped to resources/ to avoid build output\n      'resources/**/*.js',\n      'resources/**/*.ts',\n      'resources/**/*.jsx',\n      'resources/**/*.tsx',\n      'resources/**/*.vue',\n      // Blade templates\n      'resources/views/**/*.blade.php',\n      // Documentation\n      'docs/**/*.md',\n      'README.md',\n      'CHANGELOG.md',\n    ],\n    exclude: [\n      // Composer dependencies (CRITICAL: exclude before any include patterns)\n      '**/vendor/**',\n      'vendor/**',\n      \n      // Build outputs (Vite/Mix compiled assets)\n      '**/public/build/**',\n      'public/build/**',\n      'public/hot',\n      '**/dist/**',\n      'dist/**',\n      '**/build/**',\n      'build/**',\n      \n      // Laravel system directories\n      'storage/**',\n      'bootstrap/cache/**',\n      'public/**/*.js',  // Compiled JS in public\n      'public/**/*.css', // Compiled CSS in public\n      \n      // Database boilerplate (not useful for semantic search)\n      'database/migrations/**',\n      'database/seeders/**',\n      'database/factories/**',\n      \n      // Node.js dependencies\n      '**/node_modules/**',\n      'node_modules/**',\n      \n      // Test artifacts\n      'playwright-report/**',\n      'test-results/**',\n      'coverage/**',\n      \n      // Build/generated artifacts\n      '__generated__/**',\n      \n      // Frontend build outputs\n      '.vite/**',\n      '.nuxt/**',\n      '.next/**',\n      \n      // Minified files\n      '**/*.min.js',\n      '**/*.min.css',\n    ],\n  };\n}\n\n","import fs from 'fs/promises';\nimport path from 'path';\nimport { FrameworkDetector, DetectionResult } from '../types.js';\nimport { generateShopifyConfig } from './config.js';\n\n/**\n * Shopify Liquid theme framework detector\n */\nexport const shopifyDetector: FrameworkDetector = {\n  name: 'shopify',\n  priority: 100, // High priority (same as Laravel)\n  \n  async detect(rootDir: string, relativePath: string): Promise<DetectionResult> {\n    const fullPath = path.join(rootDir, relativePath);\n    const result: DetectionResult = {\n      detected: false,\n      name: 'shopify',\n      path: relativePath,\n      confidence: 'low',\n      evidence: [],\n    };\n    \n    // 1. Check for config/settings_schema.json (STRONGEST signal)\n    const settingsSchemaPath = path.join(fullPath, 'config', 'settings_schema.json');\n    let hasSettingsSchema = false;\n    \n    try {\n      await fs.access(settingsSchemaPath);\n      hasSettingsSchema = true;\n      result.evidence.push('Found config/settings_schema.json');\n    } catch {\n      // Not present, continue checking other markers\n    }\n    \n    // 2. Check for layout/theme.liquid\n    const themeLayoutPath = path.join(fullPath, 'layout', 'theme.liquid');\n    let hasThemeLayout = false;\n    \n    try {\n      await fs.access(themeLayoutPath);\n      hasThemeLayout = true;\n      result.evidence.push('Found layout/theme.liquid');\n    } catch {\n      // Not present\n    }\n    \n    // 3. Check for typical Shopify directories\n    const shopifyDirs = ['sections', 'snippets', 'templates', 'locales'];\n    let foundDirs = 0;\n    \n    for (const dir of shopifyDirs) {\n      try {\n        const dirPath = path.join(fullPath, dir);\n        const stats = await fs.stat(dirPath);\n        if (stats.isDirectory()) {\n          foundDirs++;\n        }\n      } catch {\n        // Directory doesn't exist\n      }\n    }\n    \n    if (foundDirs >= 2) {\n      result.evidence.push(`Shopify directory structure detected (${foundDirs}/${shopifyDirs.length} dirs)`);\n    }\n    \n    // 4. Check for shopify.theme.toml (Shopify CLI)\n    try {\n      const tomlPath = path.join(fullPath, 'shopify.theme.toml');\n      await fs.access(tomlPath);\n      result.evidence.push('Found shopify.theme.toml');\n    } catch {\n      // Optional file\n    }\n    \n    // 5. Check for .shopifyignore\n    try {\n      const ignorePath = path.join(fullPath, '.shopifyignore');\n      await fs.access(ignorePath);\n      result.evidence.push('Found .shopifyignore');\n    } catch {\n      // Optional file\n    }\n    \n    // Determine detection confidence with early returns\n    // High: Has settings_schema.json + 2+ directories\n    if (hasSettingsSchema && foundDirs >= 2) {\n      result.detected = true;\n      result.confidence = 'high';\n      return result;\n    }\n    \n    // Medium: Has settings_schema alone, OR has theme.liquid + 1+ directory\n    if (hasSettingsSchema || (hasThemeLayout && foundDirs >= 1)) {\n      result.detected = true;\n      result.confidence = 'medium';\n      return result;\n    }\n    \n    // Medium: Has 3+ typical directories but no strong markers\n    if (foundDirs >= 3) {\n      result.detected = true;\n      result.confidence = 'medium';\n      return result;\n    }\n    \n    // Not detected\n    return result;\n  },\n  \n  async generateConfig(rootDir: string, relativePath: string) {\n    return generateShopifyConfig(rootDir, relativePath);\n  },\n};\n\n","import { FrameworkConfig } from '../../config/schema.js';\n\n/**\n * Generate Shopify theme framework configuration\n */\nexport async function generateShopifyConfig(\n  _rootDir: string,\n  _relativePath: string\n): Promise<FrameworkConfig> {\n  return {\n    include: [\n      // Core Liquid templates\n      'layout/**/*.liquid',\n      'sections/**/*.liquid',\n      'snippets/**/*.liquid',\n      'templates/**/*.liquid', // Matches any nesting level (e.g., templates/customers/account.liquid)\n      'templates/**/*.json',   // JSON template definitions (Shopify 2.0+)\n      \n      // Theme editor blocks (Online Store 2.0)\n      'blocks/**/*.liquid',\n      \n      // Assets (CSS, JS with optional Liquid templating)\n      'assets/**/*.js',\n      'assets/**/*.js.liquid',\n      'assets/**/*.css',\n      'assets/**/*.css.liquid',\n      'assets/**/*.scss',\n      'assets/**/*.scss.liquid',\n      \n      // Configuration files\n      'config/*.json',\n      \n      // Locales (i18n)\n      'locales/*.json',\n      \n      // Documentation\n      '*.md',\n      'docs/**/*.md',\n      \n      // Shopify-specific config files\n      'shopify.theme.toml',\n      '.shopifyignore',\n    ],\n    exclude: [\n      'node_modules/**',\n      'dist/**',\n      'build/**',\n      '.git/**',\n      \n      // Playwright/testing artifacts\n      'playwright-report/**',\n      'test-results/**',\n      \n      // Build/generated artifacts\n      '__generated__/**',\n      \n      // Common frontend build outputs\n      '.vite/**',\n      '.nuxt/**',\n      '.next/**',\n    ],\n  };\n}\n\n","import { FrameworkDetector } from './types.js';\nimport { nodejsDetector } from './nodejs/detector.js';\nimport { phpDetector } from './php/detector.js';\nimport { laravelDetector } from './laravel/detector.js';\nimport { shopifyDetector } from './shopify/detector.js';\n\n/**\n * Registry of all available framework detectors\n * Frameworks will be added as they are implemented\n * \n * Order doesn't matter for detection as priority system handles conflicts,\n * but listed here in order from generic to specific for clarity:\n * - Generic language detectors (Node.js, PHP)\n * - Specific framework detectors (Laravel, Shopify)\n */\nexport const frameworkDetectors: FrameworkDetector[] = [\n  nodejsDetector,\n  phpDetector,\n  laravelDetector,\n  shopifyDetector,\n];\n\n/**\n * Register a framework detector\n */\nexport function registerFramework(detector: FrameworkDetector): void {\n  // Check if already registered\n  const existing = frameworkDetectors.find(d => d.name === detector.name);\n  if (existing) {\n    console.warn(`Framework detector '${detector.name}' is already registered, skipping`);\n    return;\n  }\n  \n  frameworkDetectors.push(detector);\n}\n\n/**\n * Get a framework detector by name\n */\nexport function getFrameworkDetector(name: string): FrameworkDetector | undefined {\n  return frameworkDetectors.find(d => d.name === name);\n}\n\n","import chalk from 'chalk';\nimport fs from 'fs/promises';\nimport path from 'path';\nimport os from 'os';\nimport crypto from 'crypto';\nimport { configService } from '../config/service.js';\nimport { isGitRepo, getCurrentBranch, getCurrentCommit } from '../git/utils.js';\nimport { readVersionFile } from '../vectordb/version.js';\nimport { showCompactBanner } from '../utils/banner.js';\nimport { isModernConfig } from '../config/schema.js';\n\nexport async function statusCommand() {\n  const rootDir = process.cwd();\n  const projectName = path.basename(rootDir);\n  \n  // Use same hashing logic as VectorDB to show correct path\n  const pathHash = crypto\n    .createHash('md5')\n    .update(rootDir)\n    .digest('hex')\n    .substring(0, 8);\n  \n  const indexPath = path.join(os.homedir(), '.lien', 'indices', `${projectName}-${pathHash}`);\n  \n  showCompactBanner();\n  console.log(chalk.bold('Status\\n'));\n  \n  // Check if config exists\n  const hasConfig = await configService.exists(rootDir);\n  console.log(chalk.dim('Configuration:'), hasConfig ? chalk.green('✓ Found') : chalk.red('✗ Not initialized'));\n  \n  if (!hasConfig) {\n    console.log(chalk.yellow('\\nRun'), chalk.bold('lien init'), chalk.yellow('to initialize'));\n    return;\n  }\n  \n  // Check if index exists\n  try {\n    const stats = await fs.stat(indexPath);\n    console.log(chalk.dim('Index location:'), indexPath);\n    console.log(chalk.dim('Index status:'), chalk.green('✓ Exists'));\n    \n    // Try to get directory size\n    try {\n      const files = await fs.readdir(indexPath, { recursive: true });\n      console.log(chalk.dim('Index files:'), files.length);\n    } catch (e) {\n      // Ignore\n    }\n    \n    console.log(chalk.dim('Last modified:'), stats.mtime.toLocaleString());\n    \n    // Show version file info\n    try {\n      const version = await readVersionFile(indexPath);\n      if (version > 0) {\n        const versionDate = new Date(version);\n        console.log(chalk.dim('Last reindex:'), versionDate.toLocaleString());\n      }\n    } catch {\n      // Ignore\n    }\n  } catch (error) {\n    console.log(chalk.dim('Index status:'), chalk.yellow('✗ Not indexed'));\n    console.log(chalk.yellow('\\nRun'), chalk.bold('lien index'), chalk.yellow('to index your codebase'));\n  }\n  \n  // Load and show configuration settings\n  try {\n    const config = await configService.load(rootDir);\n    \n    console.log(chalk.bold('\\nFeatures:'));\n    \n    // Git detection status\n    const isRepo = await isGitRepo(rootDir);\n    if (config.gitDetection.enabled && isRepo) {\n      console.log(chalk.dim('Git detection:'), chalk.green('✓ Enabled'));\n      console.log(chalk.dim('  Poll interval:'), `${config.gitDetection.pollIntervalMs / 1000}s`);\n      \n      // Show current git state\n      try {\n        const branch = await getCurrentBranch(rootDir);\n        const commit = await getCurrentCommit(rootDir);\n        console.log(chalk.dim('  Current branch:'), branch);\n        console.log(chalk.dim('  Current commit:'), commit.substring(0, 8));\n        \n        // Check if git state file exists\n        const gitStateFile = path.join(indexPath, '.git-state.json');\n        try {\n          const gitStateContent = await fs.readFile(gitStateFile, 'utf-8');\n          const gitState = JSON.parse(gitStateContent);\n          if (gitState.branch !== branch || gitState.commit !== commit) {\n            console.log(chalk.yellow('  ⚠️  Git state changed - will reindex on next serve'));\n          }\n        } catch {\n          // Git state file doesn't exist yet\n        }\n      } catch {\n        // Ignore git command errors\n      }\n    } else if (config.gitDetection.enabled && !isRepo) {\n      console.log(chalk.dim('Git detection:'), chalk.yellow('Enabled (not a git repo)'));\n    } else {\n      console.log(chalk.dim('Git detection:'), chalk.gray('Disabled'));\n    }\n    \n    // File watching status\n    if (config.fileWatching.enabled) {\n      console.log(chalk.dim('File watching:'), chalk.green('✓ Enabled'));\n      console.log(chalk.dim('  Debounce:'), `${config.fileWatching.debounceMs}ms`);\n    } else {\n      console.log(chalk.dim('File watching:'), chalk.gray('Disabled'));\n      console.log(chalk.dim('  Enable with:'), chalk.bold('lien serve --watch'));\n    }\n    \n    // Indexing settings\n    console.log(chalk.bold('\\nIndexing Settings:'));\n    if (isModernConfig(config)) {\n      console.log(chalk.dim('Concurrency:'), config.core.concurrency);\n      console.log(chalk.dim('Batch size:'), config.core.embeddingBatchSize);\n      console.log(chalk.dim('Chunk size:'), config.core.chunkSize);\n      console.log(chalk.dim('Chunk overlap:'), config.core.chunkOverlap);\n    }\n    \n  } catch (error) {\n    console.log(chalk.yellow('\\nWarning: Could not load configuration'));\n  }\n}\n\n","import chalk from 'chalk';\nimport { indexCodebase } from '../indexer/index.js';\nimport { showCompactBanner } from '../utils/banner.js';\n\nexport async function indexCommand(options: { watch?: boolean; verbose?: boolean; force?: boolean }) {\n  showCompactBanner();\n  \n  try {\n    // If force flag is set, clear the index and manifest first (clean slate)\n    if (options.force) {\n      const { VectorDB } = await import('../vectordb/lancedb.js');\n      const { ManifestManager } = await import('../indexer/manifest.js');\n      \n      console.log(chalk.yellow('Clearing existing index and manifest...'));\n      const vectorDB = new VectorDB(process.cwd());\n      await vectorDB.initialize();\n      await vectorDB.clear();\n      \n      // Also clear manifest\n      const manifest = new ManifestManager(vectorDB.dbPath);\n      await manifest.clear();\n      \n      console.log(chalk.green('✓ Index and manifest cleared\\n'));\n    }\n    \n    await indexCodebase({\n      rootDir: process.cwd(),\n      verbose: options.verbose || false,\n      force: options.force || false,\n    });\n    \n    if (options.watch) {\n      console.log(chalk.yellow('\\n⚠️  Watch mode not yet implemented'));\n      // TODO: Implement file watching with chokidar\n    }\n  } catch (error) {\n    console.error(chalk.red('Error during indexing:'), error);\n    process.exit(1);\n  }\n}\n\n","import chalk from 'chalk';\nimport fs from 'fs/promises';\nimport path from 'path';\nimport { startMCPServer } from '../mcp/server.js';\nimport { showBanner } from '../utils/banner.js';\n\nexport async function serveCommand(options: { port?: string; watch?: boolean; noWatch?: boolean; root?: string }) {\n  const rootDir = options.root ? path.resolve(options.root) : process.cwd();\n  \n  try {\n    // Validate root directory if --root was specified\n    if (options.root) {\n      try {\n        const stats = await fs.stat(rootDir);\n        if (!stats.isDirectory()) {\n          console.error(chalk.red(`Error: --root path is not a directory: ${rootDir}`));\n          process.exit(1);\n        }\n      } catch (error) {\n        if ((error as NodeJS.ErrnoException).code === 'ENOENT') {\n          console.error(chalk.red(`Error: --root directory does not exist: ${rootDir}`));\n        } else if ((error as NodeJS.ErrnoException).code === 'EACCES') {\n          console.error(chalk.red(`Error: --root directory is not accessible: ${rootDir}`));\n        } else {\n          console.error(chalk.red(`Error: Failed to access --root directory: ${rootDir}`));\n          console.error(chalk.dim((error as Error).message));\n        }\n        process.exit(1);\n      }\n    }\n    \n    // Log to stderr since stdout is for MCP protocol\n    showBanner();\n    console.error(chalk.bold('Starting MCP server...\\n'));\n    \n    if (options.root) {\n      console.error(chalk.dim(`Serving from: ${rootDir}\\n`));\n    }\n    \n    // Handle deprecated --watch flag\n    if (options.watch) {\n      console.error(chalk.yellow('⚠️  --watch flag is deprecated (file watching is now default)'));\n      console.error(chalk.dim('    Use --no-watch to disable file watching\\n'));\n    }\n    \n    // Determine file watching state\n    // Priority: --no-watch > --watch (deprecated) > config default\n    const watch = options.noWatch ? false : options.watch ? true : undefined;\n    \n    await startMCPServer({\n      rootDir,\n      verbose: true,\n      watch,\n    });\n  } catch (error) {\n    console.error(chalk.red('Failed to start MCP server:'), error);\n    process.exit(1);\n  }\n}\n\n","import { Server } from '@modelcontextprotocol/sdk/server/index.js';\nimport { StdioServerTransport } from '@modelcontextprotocol/sdk/server/stdio.js';\nimport {\n  CallToolRequestSchema,\n  ListToolsRequestSchema,\n} from '@modelcontextprotocol/sdk/types.js';\nimport { createRequire } from 'module';\nimport { fileURLToPath } from 'url';\nimport { dirname, join } from 'path';\nimport { tools } from './tools.js';\nimport { toolHandlers } from './handlers/index.js';\nimport { VectorDB } from '../vectordb/lancedb.js';\nimport { LocalEmbeddings } from '../embeddings/local.js';\nimport { GitStateTracker } from '../git/tracker.js';\nimport { indexMultipleFiles, indexSingleFile } from '../indexer/incremental.js';\nimport { configService } from '../config/service.js';\nimport { ManifestManager } from '../indexer/manifest.js';\nimport { isGitAvailable, isGitRepo } from '../git/utils.js';\nimport { FileWatcher } from '../watcher/index.js';\nimport { VERSION_CHECK_INTERVAL_MS } from '../constants.js';\nimport { LienError, LienErrorCode } from '../errors/index.js';\nimport type { ToolContext, LogFn, LogLevel } from './types.js';\n\n// Get version from package.json dynamically\nconst __filename = fileURLToPath(import.meta.url);\nconst __dirname = dirname(__filename);\nconst require = createRequire(import.meta.url);\n\nlet packageJson: { name: string; version: string };\ntry {\n  packageJson = require(join(__dirname, '../package.json'));\n} catch {\n  packageJson = require(join(__dirname, '../../package.json'));\n}\n\nexport interface MCPServerOptions {\n  rootDir: string;\n  verbose?: boolean;\n  watch?: boolean;\n}\n\n/**\n * Initialize embeddings and vector database.\n */\nasync function initializeDatabase(\n  rootDir: string,\n  log: LogFn\n): Promise<{ embeddings: LocalEmbeddings; vectorDB: VectorDB }> {\n  const embeddings = new LocalEmbeddings();\n  const vectorDB = new VectorDB(rootDir);\n\n  log('Loading embedding model...');\n  await embeddings.initialize();\n\n  log('Loading vector database...');\n  await vectorDB.initialize();\n\n  log('Embeddings and vector DB ready');\n  return { embeddings, vectorDB };\n}\n\n/**\n * Run auto-indexing if needed (first run with no index).\n */\nasync function handleAutoIndexing(\n  vectorDB: VectorDB,\n  config: Awaited<ReturnType<typeof configService.load>>,\n  rootDir: string,\n  log: LogFn\n): Promise<void> {\n  const hasIndex = await vectorDB.hasData();\n\n  if (!hasIndex && config.mcp.autoIndexOnFirstRun) {\n    log('📦 No index found - running initial indexing...');\n    log('⏱️  This may take 5-20 minutes depending on project size');\n\n    try {\n      const { indexCodebase } = await import('../indexer/index.js');\n      await indexCodebase({ rootDir, verbose: true });\n      log('✅ Initial indexing complete!');\n    } catch (error) {\n      log(`⚠️  Initial indexing failed: ${error}`, 'warning');\n      log('You can manually run: lien index', 'warning');\n    }\n  } else if (!hasIndex) {\n    log('⚠️  No index found. Auto-indexing is disabled in config.', 'warning');\n    log('Run \"lien index\" to index your codebase.', 'warning');\n  }\n}\n\n/**\n * Setup git detection and background polling.\n */\nasync function setupGitDetection(\n  config: Awaited<ReturnType<typeof configService.load>>,\n  rootDir: string,\n  vectorDB: VectorDB,\n  embeddings: LocalEmbeddings,\n  verbose: boolean | undefined,\n  log: LogFn\n): Promise<{ gitTracker: GitStateTracker | null; gitPollInterval: NodeJS.Timeout | null }> {\n  if (!config.gitDetection.enabled) {\n    log('Git detection disabled by configuration');\n    return { gitTracker: null, gitPollInterval: null };\n  }\n\n  const gitAvailable = await isGitAvailable();\n  const isRepo = await isGitRepo(rootDir);\n\n  if (!gitAvailable) {\n    log('Git not available - git detection disabled');\n    return { gitTracker: null, gitPollInterval: null };\n  }\n  if (!isRepo) {\n    log('Not a git repository - git detection disabled');\n    return { gitTracker: null, gitPollInterval: null };\n  }\n\n  log('✓ Detected git repository');\n  const gitTracker = new GitStateTracker(rootDir, vectorDB.dbPath);\n\n  // Check for git changes on startup\n  try {\n    log('Checking for git changes...');\n    const changedFiles = await gitTracker.initialize();\n\n    if (changedFiles && changedFiles.length > 0) {\n      log(`🌿 Git changes detected: ${changedFiles.length} files changed`);\n      const count = await indexMultipleFiles(changedFiles, vectorDB, embeddings, config, { verbose });\n      log(`✓ Reindexed ${count} files`);\n    } else {\n      log('✓ Index is up to date with git state');\n    }\n  } catch (error) {\n    log(`Failed to check git state on startup: ${error}`, 'warning');\n  }\n\n  // Start background polling\n  log(`✓ Git detection enabled (checking every ${config.gitDetection.pollIntervalMs / 1000}s)`);\n\n  const gitPollInterval = setInterval(async () => {\n    try {\n      const changedFiles = await gitTracker.detectChanges();\n      if (changedFiles && changedFiles.length > 0) {\n        log(`🌿 Git change detected: ${changedFiles.length} files changed`);\n        indexMultipleFiles(changedFiles, vectorDB, embeddings, config, { verbose })\n          .then(count => log(`✓ Background reindex complete: ${count} files`))\n          .catch(error => log(`Background reindex failed: ${error}`, 'warning'));\n      }\n    } catch (error) {\n      log(`Git detection check failed: ${error}`, 'warning');\n    }\n  }, config.gitDetection.pollIntervalMs);\n\n  return { gitTracker, gitPollInterval };\n}\n\n/**\n * Setup file watching for real-time updates.\n */\nasync function setupFileWatching(\n  watch: boolean | undefined,\n  config: Awaited<ReturnType<typeof configService.load>>,\n  rootDir: string,\n  vectorDB: VectorDB,\n  embeddings: LocalEmbeddings,\n  verbose: boolean | undefined,\n  log: LogFn\n): Promise<FileWatcher | null> {\n  const fileWatchingEnabled = watch !== undefined ? watch : config.fileWatching.enabled;\n  if (!fileWatchingEnabled) return null;\n\n  log('👀 Starting file watcher...');\n  const fileWatcher = new FileWatcher(rootDir, config);\n\n  try {\n    await fileWatcher.start(async (event) => {\n      const { type, filepath } = event;\n\n      if (type === 'unlink') {\n        log(`🗑️  File deleted: ${filepath}`);\n        try {\n          await vectorDB.deleteByFile(filepath);\n          const manifest = new ManifestManager(vectorDB.dbPath);\n          await manifest.removeFile(filepath);\n          log(`✓ Removed ${filepath} from index`);\n        } catch (error) {\n          log(`Failed to remove ${filepath}: ${error}`, 'warning');\n        }\n      } else {\n        const action = type === 'add' ? 'added' : 'changed';\n        log(`📝 File ${action}: ${filepath}`);\n        indexSingleFile(filepath, vectorDB, embeddings, config, { verbose })\n          .catch((error) => log(`Failed to reindex ${filepath}: ${error}`, 'warning'));\n      }\n    });\n\n    log(`✓ File watching enabled (watching ${fileWatcher.getWatchedFiles().length} files)`);\n    return fileWatcher;\n  } catch (error) {\n    log(`Failed to start file watcher: ${error}`, 'warning');\n    return null;\n  }\n}\n\n/**\n * Register tool call handler on the MCP server.\n */\nfunction registerToolCallHandler(\n  server: Server,\n  toolContext: ToolContext,\n  log: LogFn\n): void {\n  server.setRequestHandler(CallToolRequestSchema, async (request) => {\n    const { name, arguments: args } = request.params;\n    log(`Handling tool call: ${name}`);\n\n    const handler = toolHandlers[name];\n    if (!handler) {\n      const error = new LienError(\n        `Unknown tool: ${name}`,\n        LienErrorCode.INVALID_INPUT,\n        { requestedTool: name, availableTools: tools.map(t => t.name) },\n        'medium', false, false\n      );\n      return { isError: true, content: [{ type: 'text' as const, text: JSON.stringify(error.toJSON(), null, 2) }] };\n    }\n\n    try {\n      return await handler(args, toolContext);\n    } catch (error) {\n      if (error instanceof LienError) {\n        return { isError: true, content: [{ type: 'text' as const, text: JSON.stringify(error.toJSON(), null, 2) }] };\n      }\n      console.error(`Unexpected error handling tool call ${name}:`, error);\n      return {\n        isError: true,\n        content: [{\n          type: 'text' as const,\n          text: JSON.stringify({ error: error instanceof Error ? error.message : 'Unknown error', code: LienErrorCode.INTERNAL_ERROR, tool: name }, null, 2),\n        }],\n      };\n    }\n  });\n}\n\nexport async function startMCPServer(options: MCPServerOptions): Promise<void> {\n  const { rootDir, verbose, watch } = options;\n  \n  // Early log function before server is ready (falls back to stderr)\n  const earlyLog: LogFn = (message, level = 'info') => { \n    if (verbose || level === 'warning' || level === 'error') {\n      console.error(`[Lien MCP] [${level}] ${message}`); \n    }\n  };\n\n  earlyLog('Initializing MCP server...');\n\n  // Initialize core components\n  const { embeddings, vectorDB } = await initializeDatabase(rootDir, earlyLog).catch(error => {\n    console.error(`Failed to initialize: ${error}`);\n    process.exit(1);\n  });\n\n  // Create MCP server with logging capability\n  const server = new Server(\n    { name: 'lien', version: packageJson.version },\n    { capabilities: { tools: {}, logging: {} } }\n  );\n\n  // Create proper log function that uses MCP logging notifications\n  // - In verbose mode: all levels (debug, info, notice, warning, error)\n  // - In non-verbose mode: only warnings and errors\n  const log: LogFn = (message, level: LogLevel = 'info') => {\n    if (verbose || level === 'warning' || level === 'error') {\n      server.sendLoggingMessage({\n        level,\n        logger: 'lien',\n        data: message,\n      }).catch(() => {\n        // Fallback to stderr if MCP notification fails (e.g., not connected yet)\n        console.error(`[Lien MCP] [${level}] ${message}`);\n      });\n    }\n  };\n\n  server.setRequestHandler(ListToolsRequestSchema, async () => ({ tools }));\n\n  // Version check helpers\n  const checkAndReconnect = async () => {\n    try {\n      if (await vectorDB.checkVersion()) {\n        log('Index version changed, reconnecting...');\n        await vectorDB.reconnect();\n      }\n    } catch (error) {\n      log(`Version check failed: ${error}`, 'warning');\n    }\n  };\n\n  const getIndexMetadata = () => ({\n    indexVersion: vectorDB.getCurrentVersion(),\n    indexDate: vectorDB.getVersionDate(),\n  });\n\n  const versionCheckInterval = setInterval(checkAndReconnect, VERSION_CHECK_INTERVAL_MS);\n\n  // Load config and create tool context\n  const config = await configService.load(rootDir);\n  const toolContext: ToolContext = { vectorDB, embeddings, config, rootDir, log, checkAndReconnect, getIndexMetadata };\n\n  // Register handlers and setup features\n  registerToolCallHandler(server, toolContext, log);\n  await handleAutoIndexing(vectorDB, config, rootDir, log);\n  const { gitPollInterval } = await setupGitDetection(config, rootDir, vectorDB, embeddings, verbose, log);\n  const fileWatcher = await setupFileWatching(watch, config, rootDir, vectorDB, embeddings, verbose, log);\n\n  // Cleanup handler\n  const cleanup = async () => {\n    log('Shutting down MCP server...');\n    clearInterval(versionCheckInterval);\n    if (gitPollInterval) clearInterval(gitPollInterval);\n    if (fileWatcher) await fileWatcher.stop();\n    process.exit(0);\n  };\n\n  process.on('SIGINT', cleanup);\n  process.on('SIGTERM', cleanup);\n\n  // Connect transport\n  const transport = new StdioServerTransport();\n  transport.onclose = () => { log('Transport closed'); cleanup().catch(() => process.exit(0)); };\n  transport.onerror = (error) => log(`Transport error: ${error}`);\n\n  await server.connect(transport);\n  log('MCP server started and listening on stdio');\n}\n","import { z } from 'zod';\nimport { zodToJsonSchema } from 'zod-to-json-schema';\n\n/**\n * Convert a Zod schema to an MCP tool schema.\n * \n * This utility generates JSON Schema from Zod schemas for use in MCP tool definitions.\n * The resulting schema includes all validation rules and descriptions from the Zod schema.\n * \n * @param zodSchema - The Zod schema to convert\n * @param name - The tool name\n * @param description - The tool description\n * @returns MCP-compatible tool schema object\n * \n * @example\n * ```typescript\n * const SearchSchema = z.object({\n *   query: z.string().min(3).describe(\"Search query\"),\n *   limit: z.number().default(5)\n * });\n * \n * const tool = toMCPToolSchema(\n *   SearchSchema,\n *   'semantic_search',\n *   'Search the codebase semantically'\n * );\n * ```\n */\nexport function toMCPToolSchema(\n  zodSchema: z.ZodSchema,\n  name: string,\n  description: string\n) {\n  return {\n    name,\n    description,\n    inputSchema: zodToJsonSchema(zodSchema, {\n      target: 'jsonSchema7',\n      $refStrategy: 'none',\n    }),\n  };\n}\n\n","import { z } from 'zod';\n\n/**\n * Schema for semantic search tool input.\n * \n * Validates query strings and result limits for semantic code search.\n * Includes rich descriptions to guide AI assistants on proper usage.\n */\nexport const SemanticSearchSchema = z.object({\n  query: z.string()\n    .min(3, \"Query must be at least 3 characters\")\n    .max(500, \"Query too long (max 500 characters)\")\n    .describe(\n      \"Natural language description of what you're looking for.\\n\\n\" +\n      \"Use full sentences describing functionality, not exact names.\\n\\n\" +\n      \"Good examples:\\n\" +\n      \"  - 'handles user authentication'\\n\" +\n      \"  - 'validates email format'\\n\" +\n      \"  - 'processes payment transactions'\\n\\n\" +\n      \"Bad examples:\\n\" +\n      \"  - 'auth' (too vague)\\n\" +\n      \"  - 'validateEmail' (use grep for exact names)\"\n    ),\n    \n  limit: z.number()\n    .int()\n    .min(1, \"Limit must be at least 1\")\n    .max(50, \"Limit cannot exceed 50\")\n    .default(5)\n    .describe(\n      \"Number of results to return.\\n\\n\" +\n      \"Default: 5\\n\" +\n      \"Increase to 10-15 for broad exploration.\"\n    ),\n});\n\n/**\n * Inferred TypeScript type for semantic search input\n */\nexport type SemanticSearchInput = z.infer<typeof SemanticSearchSchema>;\n\n","import { z } from 'zod';\n\n/**\n * Schema for find_similar tool input.\n * \n * Validates code snippets and result limits for similarity search.\n */\nexport const FindSimilarSchema = z.object({\n  code: z.string()\n    .min(10, \"Code snippet must be at least 10 characters\")\n    .describe(\n      \"Code snippet to find similar implementations for.\\n\\n\" +\n      \"Provide a representative code sample that demonstrates the pattern \" +\n      \"you want to find similar examples of in the codebase.\"\n    ),\n    \n  limit: z.number()\n    .int()\n    .min(1, \"Limit must be at least 1\")\n    .max(20, \"Limit cannot exceed 20\")\n    .default(5)\n    .describe(\n      \"Number of similar code blocks to return.\\n\\n\" +\n      \"Default: 5\"\n    ),\n});\n\n/**\n * Inferred TypeScript type for find similar input\n */\nexport type FindSimilarInput = z.infer<typeof FindSimilarSchema>;\n\n","import { z } from 'zod';\n\n/**\n * Schema for get_files_context tool input.\n * \n * Validates file paths and context options for retrieving file-specific code chunks.\n * Supports both single file and batch operations.\n */\nexport const GetFilesContextSchema = z.object({\n  filepaths: z.union([\n    z.string().min(1, \"Filepath cannot be empty\"),\n    z.array(z.string().min(1, \"Filepath cannot be empty\")).min(1, \"Array must contain at least one filepath\").max(50, \"Maximum 50 files per request\")\n  ]).describe(\n    \"Single filepath or array of filepaths (relative to workspace root).\\n\\n\" +\n    \"Single file: 'src/components/Button.tsx'\\n\" +\n    \"Multiple files: ['src/auth.ts', 'src/user.ts']\\n\\n\" +\n    \"Maximum 50 files per request for batch operations.\"\n  ),\n    \n  includeRelated: z.boolean()\n    .default(true)\n    .describe(\n      \"Include semantically related chunks from nearby code.\\n\\n\" +\n      \"Default: true\\n\\n\" +\n      \"When enabled, also returns related code from other files that are \" +\n      \"semantically similar to the target file's contents.\"\n    ),\n});\n\n/**\n * Inferred TypeScript type for file context input\n */\nexport type GetFilesContextInput = z.infer<typeof GetFilesContextSchema>;\n\n","import { z } from 'zod';\n\n/**\n * Schema for list_functions tool input.\n * \n * Validates pattern and language filters for symbol listing.\n */\nexport const ListFunctionsSchema = z.object({\n  pattern: z.string()\n    .optional()\n    .describe(\n      \"Regex pattern to match symbol names.\\n\\n\" +\n      \"Examples:\\n\" +\n      \"  - '.*Controller.*' to find all Controllers\\n\" +\n      \"  - 'handle.*' to find handlers\\n\" +\n      \"  - '.*Service$' to find Services\\n\\n\" +\n      \"If omitted, returns all symbols.\"\n    ),\n    \n  language: z.string()\n    .optional()\n    .describe(\n      \"Filter by programming language.\\n\\n\" +\n      \"Examples: 'typescript', 'python', 'javascript', 'php'\\n\\n\" +\n      \"If omitted, searches all languages.\"\n    ),\n});\n\n/**\n * Inferred TypeScript type for list functions input\n */\nexport type ListFunctionsInput = z.infer<typeof ListFunctionsSchema>;\n\n","import { z } from 'zod';\n\n/**\n * Schema for get_dependents tool input.\n * \n * Validates file paths and options for finding reverse dependencies\n * (which files import/depend on a given file).\n * \n * Limitations:\n * - Scans up to 10,000 code chunks. For very large codebases (>1M lines),\n *   results may be incomplete. A warning is returned if the limit is reached.\n */\nexport const GetDependentsSchema = z.object({\n  filepath: z.string()\n    .min(1, \"Filepath cannot be empty\")\n    .describe(\n      \"Path to file to find dependents for (relative to workspace root).\\n\\n\" +\n      \"Example: 'src/utils/validate.ts'\\n\\n\" +\n      \"Returns all files that import or depend on this file.\\n\\n\" +\n      \"Note: Scans up to 10,000 code chunks. For very large codebases,\\n\" +\n      \"results may be incomplete (a warning will be included if truncated).\"\n    ),\n    \n  depth: z.number()\n    .int()\n    .min(1)\n    .max(1)\n    .default(1)\n    .describe(\n      \"Depth of transitive dependencies. Only depth=1 (direct dependents) is currently supported.\\n\\n\" +\n      \"1 = Direct dependents only\"\n    ),\n});\n\n/**\n * Inferred TypeScript type for get_dependents input\n */\nexport type GetDependentsInput = z.infer<typeof GetDependentsSchema>;\n\n","import { z } from 'zod';\n\n/**\n * Schema for get_complexity tool input.\n * \n * Validates parameters for complexity analysis queries,\n * enabling tech debt analysis and refactoring prioritization.\n */\nexport const GetComplexitySchema = z.object({\n  files: z.array(z.string().min(1, \"Filepath cannot be empty\"))\n    .optional()\n    .describe(\n      \"Specific files to analyze. If omitted, analyzes entire codebase.\\n\\n\" +\n      \"Example: ['src/auth.ts', 'src/api/user.ts']\"\n    ),\n    \n  top: z.number()\n    .int()\n    .min(1, \"Top must be at least 1\")\n    .max(50, \"Top cannot exceed 50\")\n    .default(10)\n    .describe(\n      \"Return top N most complex functions. Default: 10\\n\\n\" +\n      \"Use higher values to see more violations.\"\n    ),\n    \n  threshold: z.number()\n    .int()\n    .min(1, \"Threshold must be at least 1\")\n    .optional()\n    .describe(\n      \"Only return functions above this complexity threshold.\\n\\n\" +\n      \"Note: Violations are first identified using the threshold from lien.config.json (default: 15). \" +\n      \"This parameter filters those violations to show only items above the specified value. \" +\n      \"Setting threshold below the config threshold will not show additional functions.\"\n    ),\n});\n\n/**\n * Inferred TypeScript type for get_complexity input\n */\nexport type GetComplexityInput = z.infer<typeof GetComplexitySchema>;\n\n","import { toMCPToolSchema } from './utils/zod-to-json-schema.js';\nimport {\n  SemanticSearchSchema,\n  FindSimilarSchema,\n  GetFilesContextSchema,\n  ListFunctionsSchema,\n  GetDependentsSchema,\n  GetComplexitySchema,\n} from './schemas/index.js';\n\n/**\n * MCP tool definitions with Zod-generated schemas.\n * \n * All schemas are automatically generated from Zod definitions,\n * providing type safety and rich validation at runtime.\n */\nexport const tools = [\n  toMCPToolSchema(\n    SemanticSearchSchema,\n    'semantic_search',\n    `Search codebase by MEANING, not text. USE THIS INSTEAD OF grep/ripgrep for finding implementations, features, or understanding how code works.\n\nExamples:\n- \"Where is authentication handled?\" → semantic_search({ query: \"handles user authentication\" })\n- \"How does payment work?\" → semantic_search({ query: \"processes payment transactions\" })\n\nUse natural language describing what the code DOES, not function names. For exact string matching, use grep instead.\n\nResults include a relevance category (highly_relevant, relevant, loosely_related, not_relevant) for each match.`\n  ),\n  toMCPToolSchema(\n    FindSimilarSchema,\n    'find_similar',\n    `Find code structurally similar to a given snippet. Use for:\n- Ensuring consistency when adding new code\n- Finding duplicate implementations\n- Refactoring similar patterns together\n\nProvide at least 10 characters of code to match against. Results include a relevance category for each match.`\n  ),\n  toMCPToolSchema(\n    GetFilesContextSchema,\n    'get_files_context',\n    `Get context for one or more files including dependencies and test coverage.\n\nMANDATORY: Call this BEFORE editing any file. Accepts single path or array of paths.\n\nSingle file:\n  get_files_context({ filepaths: \"src/auth.ts\" })\n  \n  Returns:\n  {\n    file: \"src/auth.ts\",\n    chunks: [...],\n    testAssociations: [\"src/__tests__/auth.test.ts\"]\n  }\n\nMultiple files (batch):\n  get_files_context({ filepaths: [\"src/auth.ts\", \"src/user.ts\"] })\n  \n  Returns:\n  {\n    files: {\n      \"src/auth.ts\": {\n        chunks: [...],\n        testAssociations: [\"src/__tests__/auth.test.ts\"]\n      },\n      \"src/user.ts\": {\n        chunks: [...],\n        testAssociations: [\"src/__tests__/user.test.ts\"]\n      }\n    }\n  }\n\nReturns for each file:\n- All chunks and related code\n- testAssociations: Array of test files that import this file (reverse dependency lookup)\n- Relevance scoring\n\nALWAYS check testAssociations before modifying source code.\nAfter changes, remind the user to run the associated tests.\n\nBatch calls are more efficient than multiple single-file calls.`\n  ),\n  toMCPToolSchema(\n    ListFunctionsSchema,\n    'list_functions',\n    `Fast symbol lookup by naming pattern. Use when searching by NAME, not behavior.\n\nExamples:\n- \"Show all controllers\" → list_functions({ pattern: \".*Controller.*\" })\n- \"Find service classes\" → list_functions({ pattern: \".*Service$\" })\n\n10x faster than semantic_search for structural/architectural queries. Use semantic_search instead when searching by what code DOES.`\n  ),\n  toMCPToolSchema(\n    GetDependentsSchema,\n    'get_dependents',\n    `Find all code that depends on a file (reverse dependency lookup). Use for impact analysis:\n- \"What breaks if I change this?\"\n- \"Is this safe to delete?\"\n- \"What imports this module?\"\n\nReturns:\n- List of files that import the target\n- Risk level (low/medium/high/critical) based on dependent count and complexity\n\nExample: get_dependents({ filepath: \"src/utils/validate.ts\" })`\n  ),\n  toMCPToolSchema(\n    GetComplexitySchema,\n    'get_complexity',\n    `Get complexity analysis for files or the entire codebase.\n\nAnalyzes multiple complexity metrics:\n- **Test paths**: Number of test cases needed for full coverage (cyclomatic)\n- **Mental load**: How hard to follow - penalizes nesting (cognitive)\n- **Time to understand**: Estimated reading time based on Halstead effort\n- **Estimated bugs**: Predicted bug count based on Halstead volume\n\nUse for tech debt analysis and refactoring prioritization:\n- \"What are the most complex functions?\"\n- \"Show me tech debt hotspots\"\n- \"What should I refactor?\"\n\nExamples:\n  get_complexity({ top: 10 })\n  get_complexity({ files: [\"src/auth.ts\", \"src/api/user.ts\"] })\n  get_complexity({ threshold: 15 })\n\nReturns violations with metricType ('cyclomatic', 'cognitive', 'halstead_effort',\nor 'halstead_bugs'), risk levels, and dependent counts.\nHuman-readable output: \"23 (needs ~23 tests)\", \"🧠 45\", \"~2h 30m\", \"2.27 bugs\".`\n  ),\n];","import { ZodSchema, ZodError } from 'zod';\nimport { LienError, LienErrorCode } from '../../errors/index.js';\n\n/**\n * Wrap a tool handler with Zod validation and error handling.\n * \n * This utility provides automatic:\n * - Input validation using Zod schemas\n * - Type-safe handler execution with inferred types\n * - Consistent error formatting for validation, Lien, and unexpected errors\n * - MCP-compatible response structure\n * \n * @param schema - Zod schema to validate tool inputs against\n * @param handler - Tool handler function that receives validated inputs\n * @returns Wrapped handler that validates inputs and handles errors\n * \n * @example\n * ```typescript\n * const SearchSchema = z.object({\n *   query: z.string().min(3),\n *   limit: z.number().default(5)\n * });\n * \n * const searchHandler = wrapToolHandler(\n *   SearchSchema,\n *   async (args) => {\n *     // args is fully typed: { query: string; limit: number }\n *     const results = await search(args.query, args.limit);\n *     return { results };\n *   }\n * );\n * \n * // Use in MCP server\n * return await searchHandler(request.params.arguments);\n * ```\n */\nexport function wrapToolHandler<T>(\n  schema: ZodSchema<T>,\n  handler: (validated: T) => Promise<any>\n) {\n  return async (args: unknown) => {\n    try {\n      // Validate input with Zod\n      const validated = schema.parse(args);\n      \n      // Execute handler with validated, typed input\n      const result = await handler(validated);\n      \n      // Return MCP-compatible success response\n      return {\n        content: [{\n          type: 'text' as const,\n          text: JSON.stringify(result, null, 2),\n        }],\n      };\n      \n    } catch (error) {\n      // Handle Zod validation errors\n      if (error instanceof ZodError) {\n        return {\n          isError: true,\n          content: [{\n            type: 'text' as const,\n            text: JSON.stringify({\n              error: 'Invalid parameters',\n              code: LienErrorCode.INVALID_INPUT,\n              details: error.errors.map(e => ({\n                field: e.path.join('.'),\n                message: e.message,\n              })),\n            }, null, 2),\n          }],\n        };\n      }\n      \n      // Handle known Lien errors\n      if (error instanceof LienError) {\n        return {\n          isError: true,\n          content: [{\n            type: 'text' as const,\n            text: JSON.stringify(error.toJSON(), null, 2),\n          }],\n        };\n      }\n      \n      // Handle unexpected errors\n      console.error('Unexpected error in tool handler:', error);\n      return {\n        isError: true,\n        content: [{\n          type: 'text' as const,\n          text: JSON.stringify({\n            error: error instanceof Error ? error.message : 'Unknown error',\n            code: LienErrorCode.INTERNAL_ERROR,\n          }, null, 2),\n        }],\n      };\n    }\n  };\n}\n\n","import { wrapToolHandler } from '../utils/tool-wrapper.js';\nimport { SemanticSearchSchema } from '../schemas/index.js';\nimport type { ToolContext, MCPToolResult } from '../types.js';\n\n/**\n * Handle semantic_search tool calls.\n * Searches the codebase by meaning using embeddings.\n */\nexport async function handleSemanticSearch(\n  args: unknown,\n  ctx: ToolContext\n): Promise<MCPToolResult> {\n  const { vectorDB, embeddings, log, checkAndReconnect, getIndexMetadata } = ctx;\n\n  return await wrapToolHandler(\n    SemanticSearchSchema,\n    async (validatedArgs) => {\n      log(`Searching for: \"${validatedArgs.query}\"`);\n\n      // Check if index has been updated and reconnect if needed\n      await checkAndReconnect();\n\n      const queryEmbedding = await embeddings.embed(validatedArgs.query);\n      const results = await vectorDB.search(queryEmbedding, validatedArgs.limit, validatedArgs.query);\n\n      log(`Found ${results.length} results`);\n\n      return {\n        indexInfo: getIndexMetadata(),\n        results,\n      };\n    }\n  )(args);\n}\n","import { wrapToolHandler } from '../utils/tool-wrapper.js';\nimport { FindSimilarSchema } from '../schemas/index.js';\nimport type { ToolContext, MCPToolResult } from '../types.js';\n\n/**\n * Handle find_similar tool calls.\n * Finds code structurally similar to a given snippet.\n */\nexport async function handleFindSimilar(\n  args: unknown,\n  ctx: ToolContext\n): Promise<MCPToolResult> {\n  const { vectorDB, embeddings, log, checkAndReconnect, getIndexMetadata } = ctx;\n\n  return await wrapToolHandler(\n    FindSimilarSchema,\n    async (validatedArgs) => {\n      log(`Finding similar code...`);\n\n      // Check if index has been updated and reconnect if needed\n      await checkAndReconnect();\n\n      const codeEmbedding = await embeddings.embed(validatedArgs.code);\n      // Pass code as query for relevance boosting\n      const results = await vectorDB.search(codeEmbedding, validatedArgs.limit, validatedArgs.code);\n\n      log(`Found ${results.length} similar chunks`);\n\n      return {\n        indexInfo: getIndexMetadata(),\n        results,\n      };\n    }\n  )(args);\n}\n","/**\n * Shared path matching utilities for dependency analysis.\n * \n * These functions handle path normalization and matching logic used by\n * the get_dependents tool to find reverse dependencies.\n */\n\n/**\n * Normalizes a file path for comparison.\n * \n * - Removes quotes and trims whitespace\n * - Converts backslashes to forward slashes\n * - Strips file extensions (.ts, .tsx, .js, .jsx)\n * - Converts absolute paths to relative (if within workspace root)\n * \n * @param path - The path to normalize\n * @param workspaceRoot - The workspace root directory (normalized with forward slashes)\n * @returns Normalized path\n */\nexport function normalizePath(path: string, workspaceRoot: string): string {\n  let normalized = path.replace(/['\"]/g, '').trim().replace(/\\\\/g, '/');\n  \n  // Normalize extensions: .ts/.tsx/.js/.jsx → all treated as equivalent\n  // This handles TypeScript's ESM requirement of .js imports for .ts files\n  normalized = normalized.replace(/\\.(ts|tsx|js|jsx)$/, '');\n  \n  // Normalize to relative path if it starts with workspace root\n  if (normalized.startsWith(workspaceRoot + '/')) {\n    normalized = normalized.substring(workspaceRoot.length + 1);\n  }\n  \n  return normalized;\n}\n\n/**\n * Checks if a pattern matches at path component boundaries.\n * \n * Ensures matches occur at proper boundaries (/, .) to avoid false positives like:\n * - \"logger\" matching \"logger-utils\" ❌\n * - \"src/logger\" matching \"src/logger-service\" ❌\n * \n * @param str - The string to search in\n * @param pattern - The pattern to search for\n * @returns True if pattern matches at a boundary\n */\nexport function matchesAtBoundary(str: string, pattern: string): boolean {\n  const index = str.indexOf(pattern);\n  if (index === -1) return false;\n  \n  // Check character before match (must be start or path separator)\n  const charBefore = index > 0 ? str[index - 1] : '/';\n  if (charBefore !== '/' && index !== 0) return false;\n  \n  // Check character after match (must be end or path separator)\n  // Extensions are already stripped during normalization, so we only need to check for '/' as a valid path separator\n  const endIndex = index + pattern.length;\n  if (endIndex === str.length) return true;\n  const charAfter = str[endIndex];\n  return charAfter === '/';\n}\n\n/**\n * Determines if an import path matches a target file path.\n * \n * Handles various matching strategies:\n * 1. Exact match\n * 2. Target path appears in import (at boundaries)\n * 3. Import path appears in target (at boundaries)\n * 4. Relative imports (./logger vs src/utils/logger)\n * \n * @param normalizedImport - Normalized import path\n * @param normalizedTarget - Normalized target file path\n * @returns True if the import matches the target file\n */\nexport function matchesFile(normalizedImport: string, normalizedTarget: string): boolean {\n  // Exact match\n  if (normalizedImport === normalizedTarget) return true;\n  \n  // Strategy 1: Check if target path appears in import at path boundaries\n  if (matchesAtBoundary(normalizedImport, normalizedTarget)) {\n    return true;\n  }\n  \n  // Strategy 2: Check if import path appears in target (for longer target paths)\n  if (matchesAtBoundary(normalizedTarget, normalizedImport)) {\n    return true;\n  }\n  \n  // Strategy 3: Handle relative imports (./logger vs src/utils/logger)\n  // Remove leading ./ and ../ from import\n  const cleanedImport = normalizedImport.replace(/^(\\.\\.?\\/)+/, '');\n  if (matchesAtBoundary(cleanedImport, normalizedTarget) || \n      matchesAtBoundary(normalizedTarget, cleanedImport)) {\n    return true;\n  }\n  \n  return false;\n}\n\n/**\n * Gets a canonical path representation (relative to workspace, with extension).\n * \n * @param filepath - The file path to canonicalize\n * @param workspaceRoot - The workspace root directory (normalized with forward slashes)\n * @returns Canonical path\n */\nexport function getCanonicalPath(filepath: string, workspaceRoot: string): string {\n  let canonical = filepath.replace(/\\\\/g, '/');\n  if (canonical.startsWith(workspaceRoot + '/')) {\n    canonical = canonical.substring(workspaceRoot.length + 1);\n  }\n  return canonical;\n}\n\n/**\n * Determines if a file is a test file based on naming conventions.\n * \n * Uses precise regex patterns to avoid false positives:\n * - Files with .test. or .spec. extensions (e.g., foo.test.ts, bar.spec.js)\n * - Files in test/, tests/, or __tests__/ directories\n * \n * Avoids false positives like:\n * - contest.ts (contains \".test.\" but isn't a test)\n * - latest/config.ts (contains \"/test/\" but isn't a test)\n * \n * @param filepath - The file path to check\n * @returns True if the file is a test file\n */\nexport function isTestFile(filepath: string): boolean {\n  return /\\.(test|spec)\\.[^/]+$/.test(filepath) ||\n         /(^|[/\\\\])(test|tests|__tests__)[/\\\\]/.test(filepath);\n}\n\n","import { wrapToolHandler } from '../utils/tool-wrapper.js';\nimport { GetFilesContextSchema } from '../schemas/index.js';\nimport { normalizePath, matchesFile, getCanonicalPath, isTestFile } from '../utils/path-matching.js';\nimport type { ToolContext, MCPToolResult } from '../types.js';\n\n/**\n * Maximum number of chunks to scan for test association analysis.\n * Larger codebases may have incomplete results if they exceed this limit.\n */\nconst SCAN_LIMIT = 10000;\n\n/**\n * Handle get_files_context tool calls.\n * Gets context for one or more files including dependencies and test coverage.\n */\nexport async function handleGetFilesContext(\n  args: unknown,\n  ctx: ToolContext\n): Promise<MCPToolResult> {\n  const { vectorDB, embeddings, log, checkAndReconnect, getIndexMetadata } = ctx;\n\n  return await wrapToolHandler(\n    GetFilesContextSchema,\n    async (validatedArgs) => {\n      // Normalize input: convert single string to array\n      const filepaths = Array.isArray(validatedArgs.filepaths)\n        ? validatedArgs.filepaths\n        : [validatedArgs.filepaths];\n\n      const isSingleFile = !Array.isArray(validatedArgs.filepaths);\n\n      log(`Getting context for: ${filepaths.join(', ')}`);\n\n      // Check if index has been updated and reconnect if needed\n      await checkAndReconnect();\n\n      // Compute workspace root for path matching\n      const workspaceRoot = process.cwd().replace(/\\\\/g, '/');\n\n      // Batch embedding calls for all filepaths at once to reduce latency\n      const fileEmbeddings = await Promise.all(filepaths.map(fp => embeddings.embed(fp)));\n\n      // Batch all initial file searches in parallel\n      const allFileSearches = await Promise.all(\n        fileEmbeddings.map((embedding, i) =>\n          vectorDB.search(embedding, 50, filepaths[i])\n        )\n      );\n\n      // Filter results to only include chunks from each target file\n      // Use exact matching with getCanonicalPath to avoid false positives\n      const fileChunksMap = filepaths.map((filepath, i) => {\n        const allResults = allFileSearches[i];\n        const targetCanonical = getCanonicalPath(filepath, workspaceRoot);\n\n        return allResults.filter(r => {\n          const chunkCanonical = getCanonicalPath(r.metadata.file, workspaceRoot);\n          return chunkCanonical === targetCanonical;\n        });\n      });\n\n      // Batch related chunk operations if includeRelated is true\n      let relatedChunksMap: any[][] = [];\n      if (validatedArgs.includeRelated) {\n        // Get files that have chunks (need first chunk for related search)\n        const filesWithChunks = fileChunksMap\n          .map((chunks, i) => ({ chunks, filepath: filepaths[i], index: i }))\n          .filter(({ chunks }) => chunks.length > 0);\n\n        if (filesWithChunks.length > 0) {\n          // Batch embedding calls for all first chunks\n          const relatedEmbeddings = await Promise.all(\n            filesWithChunks.map(({ chunks }) => embeddings.embed(chunks[0].content))\n          );\n\n          // Batch all related chunk searches\n          const relatedSearches = await Promise.all(\n            relatedEmbeddings.map((embedding, i) =>\n              vectorDB.search(embedding, 5, filesWithChunks[i].chunks[0].content)\n            )\n          );\n\n          // Map back to original indices\n          relatedChunksMap = Array.from({ length: filepaths.length }, () => []);\n          filesWithChunks.forEach(({ filepath, index }, i) => {\n            const related = relatedSearches[i];\n            const targetCanonical = getCanonicalPath(filepath, workspaceRoot);\n            // Filter out chunks from the same file using exact matching\n            relatedChunksMap[index] = related.filter(r => {\n              const chunkCanonical = getCanonicalPath(r.metadata.file, workspaceRoot);\n              return chunkCanonical !== targetCanonical;\n            });\n          });\n        }\n      }\n\n      // Compute test associations for each file\n      // Scan once for all files to avoid repeated database queries (performance optimization)\n      const allChunks = await vectorDB.scanWithFilter({ limit: SCAN_LIMIT });\n\n      // Warn if we hit the limit (similar to get_dependents tool)\n      if (allChunks.length === SCAN_LIMIT) {\n        log(`Scanned ${SCAN_LIMIT} chunks (limit reached). Test associations may be incomplete for large codebases.`, 'warning');\n      }\n\n      // Path normalization cache to avoid repeated string operations\n      const pathCache = new Map<string, string>();\n      const normalizePathCached = (path: string): string => {\n        if (pathCache.has(path)) return pathCache.get(path)!;\n        const normalized = normalizePath(path, workspaceRoot);\n        pathCache.set(path, normalized);\n        return normalized;\n      };\n\n      // Compute test associations for each file using the same scan result\n      const testAssociationsMap = filepaths.map((filepath) => {\n        const normalizedTarget = normalizePathCached(filepath);\n\n        // Find chunks that:\n        // 1. Are from test files\n        // 2. Import the target file\n        const testFiles = new Set<string>();\n        for (const chunk of allChunks) {\n          const chunkFile = getCanonicalPath(chunk.metadata.file, workspaceRoot);\n\n          // Skip if not a test file\n          if (!isTestFile(chunkFile)) continue;\n\n          // Check if this test file imports the target\n          const imports = chunk.metadata.imports || [];\n          for (const imp of imports) {\n            const normalizedImport = normalizePathCached(imp);\n            if (matchesFile(normalizedImport, normalizedTarget)) {\n              testFiles.add(chunkFile);\n              break;\n            }\n          }\n        }\n\n        return Array.from(testFiles);\n      });\n\n      // Combine file chunks with related chunks and test associations\n      const filesData: Record<string, { chunks: any[]; testAssociations: string[] }> = {};\n      filepaths.forEach((filepath, i) => {\n        const fileChunks = fileChunksMap[i];\n        const relatedChunks = relatedChunksMap[i] || [];\n\n        // Deduplicate chunks (by canonical file path + line range)\n        // Use canonical paths to avoid duplicates from absolute vs relative paths\n        const seenChunks = new Set<string>();\n        const dedupedChunks = [...fileChunks, ...relatedChunks].filter(chunk => {\n          const canonicalFile = getCanonicalPath(chunk.metadata.file, workspaceRoot);\n          const chunkId = `${canonicalFile}:${chunk.metadata.startLine}-${chunk.metadata.endLine}`;\n          if (seenChunks.has(chunkId)) return false;\n          seenChunks.add(chunkId);\n          return true;\n        });\n\n        filesData[filepath] = {\n          chunks: dedupedChunks,\n          testAssociations: testAssociationsMap[i],\n        };\n      });\n\n      log(`Found ${Object.values(filesData).reduce((sum, f) => sum + f.chunks.length, 0)} total chunks`);\n\n      // Return format depends on single vs multi file\n      if (isSingleFile) {\n        // Single file: return old format for backward compatibility\n        const filepath = filepaths[0];\n        return {\n          indexInfo: getIndexMetadata(),\n          file: filepath,\n          chunks: filesData[filepath].chunks,\n          testAssociations: filesData[filepath].testAssociations,\n        };\n      } else {\n        // Multiple files: return new format\n        return {\n          indexInfo: getIndexMetadata(),\n          files: filesData,\n        };\n      }\n    }\n  )(args);\n}\n","import { wrapToolHandler } from '../utils/tool-wrapper.js';\nimport { ListFunctionsSchema } from '../schemas/index.js';\nimport type { ToolContext, MCPToolResult } from '../types.js';\n\n/**\n * Handle list_functions tool calls.\n * Fast symbol lookup by naming pattern.\n */\nexport async function handleListFunctions(\n  args: unknown,\n  ctx: ToolContext\n): Promise<MCPToolResult> {\n  const { vectorDB, log, checkAndReconnect, getIndexMetadata } = ctx;\n\n  return await wrapToolHandler(\n    ListFunctionsSchema,\n    async (validatedArgs) => {\n      log('Listing functions with symbol metadata...');\n\n      // Check if index has been updated and reconnect if needed\n      await checkAndReconnect();\n\n      let results;\n      let usedMethod = 'symbols';\n\n      try {\n        // Try using symbol-based query first (v0.5.0+)\n        results = await vectorDB.querySymbols({\n          language: validatedArgs.language,\n          pattern: validatedArgs.pattern,\n          limit: 50,\n        });\n\n        // If no results and pattern was provided, it might be an old index\n        // Fall back to content scanning\n        if (results.length === 0 && (validatedArgs.language || validatedArgs.pattern)) {\n          log('No symbol results, falling back to content scan...');\n          results = await vectorDB.scanWithFilter({\n            language: validatedArgs.language,\n            pattern: validatedArgs.pattern,\n            limit: 50,\n          });\n          usedMethod = 'content';\n        }\n      } catch (error) {\n        // If querySymbols fails (e.g., old index without symbol fields), fall back\n        log(`Symbol query failed, falling back to content scan: ${error}`);\n        results = await vectorDB.scanWithFilter({\n          language: validatedArgs.language,\n          pattern: validatedArgs.pattern,\n          limit: 50,\n        });\n        usedMethod = 'content';\n      }\n\n      log(`Found ${results.length} matches using ${usedMethod} method`);\n\n      return {\n        indexInfo: getIndexMetadata(),\n        method: usedMethod,\n        results,\n        note: usedMethod === 'content'\n          ? 'Using content search. Run \"lien reindex\" to enable faster symbol-based queries.'\n          : undefined,\n      };\n    }\n  )(args);\n}\n","import { wrapToolHandler } from '../utils/tool-wrapper.js';\nimport { GetDependentsSchema } from '../schemas/index.js';\nimport { normalizePath, matchesFile, getCanonicalPath, isTestFile } from '../utils/path-matching.js';\nimport type { ToolContext, MCPToolResult } from '../types.js';\nimport type { SearchResult } from '../../vectordb/types.js';\n\n/**\n * Complexity metrics for a single dependent file.\n */\ninterface FileComplexity {\n  filepath: string;\n  avgComplexity: number;\n  maxComplexity: number;\n  complexityScore: number; // Sum of all complexities\n  chunksWithComplexity: number;\n}\n\n/**\n * Aggregate complexity metrics for all dependents.\n */\ninterface ComplexityMetrics {\n  averageComplexity: number;\n  maxComplexity: number;\n  filesWithComplexityData: number;\n  highComplexityDependents: Array<{\n    filepath: string;\n    maxComplexity: number;\n    avgComplexity: number;\n  }>;\n  complexityRiskBoost: 'low' | 'medium' | 'high' | 'critical';\n}\n\n/**\n * Risk level thresholds for dependent count.\n * Based on impact analysis: more dependents = higher risk of breaking changes.\n */\nconst DEPENDENT_COUNT_THRESHOLDS = {\n  LOW: 5,       // Few dependents, safe to change\n  MEDIUM: 15,   // Moderate impact, review dependents\n  HIGH: 30,     // High impact, careful planning needed\n} as const;\n\n/**\n * Complexity thresholds for risk assessment.\n * Based on cyclomatic complexity: higher complexity = harder to change safely.\n */\nconst COMPLEXITY_THRESHOLDS = {\n  HIGH_COMPLEXITY_DEPENDENT: 10,  // Individual file is complex\n  CRITICAL_AVG: 15,              // Average complexity indicates systemic complexity\n  CRITICAL_MAX: 25,              // Peak complexity indicates hotspot\n  HIGH_AVG: 10,                  // Moderately complex on average\n  HIGH_MAX: 20,                  // Some complex functions exist\n  MEDIUM_AVG: 6,                 // Slightly above simple code\n  MEDIUM_MAX: 15,                // Occasional branching\n} as const;\n\n/**\n * Maximum number of chunks to scan for dependency analysis.\n * Larger codebases may have incomplete results if they exceed this limit.\n */\nconst SCAN_LIMIT = 10000;\n\n/** Risk level ordering for comparison */\nconst RISK_ORDER = { low: 0, medium: 1, high: 2, critical: 3 } as const;\ntype RiskLevel = keyof typeof RISK_ORDER;\n\n/**\n * Build import-to-chunk index for O(n) instead of O(n*m) lookup.\n */\nfunction buildImportIndex(\n  allChunks: SearchResult[],\n  normalizePathCached: (path: string) => string\n): Map<string, SearchResult[]> {\n  const importIndex = new Map<string, SearchResult[]>();\n  \n  for (const chunk of allChunks) {\n    const imports = chunk.metadata.imports || [];\n    for (const imp of imports) {\n      const normalizedImport = normalizePathCached(imp);\n      if (!importIndex.has(normalizedImport)) {\n        importIndex.set(normalizedImport, []);\n      }\n      importIndex.get(normalizedImport)!.push(chunk);\n    }\n  }\n  \n  return importIndex;\n}\n\n/**\n * Find dependent chunks using direct lookup and fuzzy matching.\n */\nfunction findDependentChunks(\n  importIndex: Map<string, SearchResult[]>,\n  normalizedTarget: string\n): SearchResult[] {\n  const dependentChunks: SearchResult[] = [];\n  const seenChunkIds = new Set<string>();\n\n  const addChunk = (chunk: SearchResult) => {\n    const chunkId = `${chunk.metadata.file}:${chunk.metadata.startLine}-${chunk.metadata.endLine}`;\n    if (!seenChunkIds.has(chunkId)) {\n      dependentChunks.push(chunk);\n      seenChunkIds.add(chunkId);\n    }\n  };\n\n  // Direct index lookup (fastest path)\n  if (importIndex.has(normalizedTarget)) {\n    for (const chunk of importIndex.get(normalizedTarget)!) {\n      addChunk(chunk);\n    }\n  }\n\n  // Fuzzy match for relative imports and path variations\n  for (const [normalizedImport, chunks] of importIndex.entries()) {\n    if (normalizedImport !== normalizedTarget && matchesFile(normalizedImport, normalizedTarget)) {\n      for (const chunk of chunks) {\n        addChunk(chunk);\n      }\n    }\n  }\n\n  return dependentChunks;\n}\n\n/**\n * Calculate complexity metrics for each file from its chunks.\n */\nfunction calculateFileComplexities(\n  chunksByFile: Map<string, SearchResult[]>\n): FileComplexity[] {\n  const fileComplexities: FileComplexity[] = [];\n\n  for (const [filepath, chunks] of chunksByFile.entries()) {\n    const complexities = chunks\n      .map(c => c.metadata.complexity)\n      .filter((c): c is number => typeof c === 'number' && c > 0);\n\n    if (complexities.length > 0) {\n      const sum = complexities.reduce((a, b) => a + b, 0);\n      fileComplexities.push({\n        filepath,\n        avgComplexity: Math.round((sum / complexities.length) * 10) / 10,\n        maxComplexity: Math.max(...complexities),\n        complexityScore: sum,\n        chunksWithComplexity: complexities.length,\n      });\n    }\n  }\n\n  return fileComplexities;\n}\n\n/**\n * Calculate overall complexity metrics from per-file complexities.\n */\nfunction calculateOverallComplexityMetrics(\n  fileComplexities: FileComplexity[]\n): ComplexityMetrics {\n  if (fileComplexities.length === 0) {\n    return {\n      averageComplexity: 0,\n      maxComplexity: 0,\n      filesWithComplexityData: 0,\n      highComplexityDependents: [],\n      complexityRiskBoost: 'low',\n    };\n  }\n\n  const allAvgs = fileComplexities.map(f => f.avgComplexity);\n  const allMaxes = fileComplexities.map(f => f.maxComplexity);\n  const totalAvg = allAvgs.reduce((a, b) => a + b, 0) / allAvgs.length;\n  const globalMax = Math.max(...allMaxes);\n\n  const highComplexityDependents = fileComplexities\n    .filter(f => f.maxComplexity > COMPLEXITY_THRESHOLDS.HIGH_COMPLEXITY_DEPENDENT)\n    .sort((a, b) => b.maxComplexity - a.maxComplexity)\n    .slice(0, 5)\n    .map(f => ({ filepath: f.filepath, maxComplexity: f.maxComplexity, avgComplexity: f.avgComplexity }));\n\n  const complexityRiskBoost = calculateComplexityRiskBoost(totalAvg, globalMax);\n\n  return {\n    averageComplexity: Math.round(totalAvg * 10) / 10,\n    maxComplexity: globalMax,\n    filesWithComplexityData: fileComplexities.length,\n    highComplexityDependents,\n    complexityRiskBoost,\n  };\n}\n\n/**\n * Calculate complexity-based risk boost level.\n */\nfunction calculateComplexityRiskBoost(avgComplexity: number, maxComplexity: number): RiskLevel {\n  if (avgComplexity > COMPLEXITY_THRESHOLDS.CRITICAL_AVG || maxComplexity > COMPLEXITY_THRESHOLDS.CRITICAL_MAX) {\n    return 'critical';\n  }\n  if (avgComplexity > COMPLEXITY_THRESHOLDS.HIGH_AVG || maxComplexity > COMPLEXITY_THRESHOLDS.HIGH_MAX) {\n    return 'high';\n  }\n  if (avgComplexity > COMPLEXITY_THRESHOLDS.MEDIUM_AVG || maxComplexity > COMPLEXITY_THRESHOLDS.MEDIUM_MAX) {\n    return 'medium';\n  }\n  return 'low';\n}\n\n/**\n * Calculate risk level based on dependent count and complexity.\n */\nfunction calculateRiskLevel(dependentCount: number, complexityRiskBoost: RiskLevel): RiskLevel {\n  let riskLevel: RiskLevel =\n    dependentCount === 0 ? 'low' :\n    dependentCount <= DEPENDENT_COUNT_THRESHOLDS.LOW ? 'low' :\n    dependentCount <= DEPENDENT_COUNT_THRESHOLDS.MEDIUM ? 'medium' :\n    dependentCount <= DEPENDENT_COUNT_THRESHOLDS.HIGH ? 'high' : 'critical';\n\n  // Boost if complexity risk is higher\n  if (RISK_ORDER[complexityRiskBoost] > RISK_ORDER[riskLevel]) {\n    riskLevel = complexityRiskBoost;\n  }\n\n  return riskLevel;\n}\n\n/**\n * Handle get_dependents tool calls.\n * Finds all code that depends on a file (reverse dependency lookup).\n */\nexport async function handleGetDependents(\n  args: unknown,\n  ctx: ToolContext\n): Promise<MCPToolResult> {\n  const { vectorDB, log, checkAndReconnect, getIndexMetadata } = ctx;\n\n  return await wrapToolHandler(\n    GetDependentsSchema,\n    async (validatedArgs) => {\n      log(`Finding dependents of: ${validatedArgs.filepath}`);\n      await checkAndReconnect();\n\n      const allChunks = await vectorDB.scanWithFilter({ limit: SCAN_LIMIT });\n      const hitLimit = allChunks.length === SCAN_LIMIT;\n      if (hitLimit) {\n        log(`Scanned ${SCAN_LIMIT} chunks (limit reached). Results may be incomplete.`, 'warning');\n      }\n      log(`Scanning ${allChunks.length} chunks for imports...`);\n\n      const workspaceRoot = process.cwd().replace(/\\\\/g, '/');\n      const pathCache = new Map<string, string>();\n      const normalizePathCached = (path: string): string => {\n        if (!pathCache.has(path)) pathCache.set(path, normalizePath(path, workspaceRoot));\n        return pathCache.get(path)!;\n      };\n\n      // Build index and find dependents\n      const importIndex = buildImportIndex(allChunks, normalizePathCached);\n      const normalizedTarget = normalizePathCached(validatedArgs.filepath);\n      const dependentChunks = findDependentChunks(importIndex, normalizedTarget);\n\n      // Group by canonical file path\n      const chunksByFile = new Map<string, typeof dependentChunks>();\n      for (const chunk of dependentChunks) {\n        const canonical = getCanonicalPath(chunk.metadata.file, workspaceRoot);\n        const existing = chunksByFile.get(canonical) || [];\n        existing.push(chunk);\n        chunksByFile.set(canonical, existing);\n      }\n\n      // Calculate metrics\n      const fileComplexities = calculateFileComplexities(chunksByFile);\n      const complexityMetrics = calculateOverallComplexityMetrics(fileComplexities);\n\n      const uniqueFiles = Array.from(chunksByFile.keys()).map(filepath => ({\n        filepath,\n        isTestFile: isTestFile(filepath),\n      }));\n\n      const riskLevel = calculateRiskLevel(uniqueFiles.length, complexityMetrics.complexityRiskBoost);\n      log(`Found ${uniqueFiles.length} dependent files (risk: ${riskLevel}${complexityMetrics.filesWithComplexityData > 0 ? ', complexity-boosted' : ''})`);\n\n      return {\n        indexInfo: getIndexMetadata(),\n        filepath: validatedArgs.filepath,\n        dependentCount: uniqueFiles.length,\n        riskLevel,\n        dependents: uniqueFiles,\n        complexityMetrics,\n        note: hitLimit ? `Warning: Scanned ${SCAN_LIMIT} chunks (limit reached). Results may be incomplete.` : undefined,\n      };\n    }\n  )(args);\n}\n","import collect from 'collect.js';\nimport { wrapToolHandler } from '../utils/tool-wrapper.js';\nimport { GetComplexitySchema } from '../schemas/index.js';\nimport { ComplexityAnalyzer } from '../../insights/complexity-analyzer.js';\nimport type { ToolContext, MCPToolResult } from '../types.js';\nimport type { ComplexityViolation, FileComplexityData } from '../../insights/types.js';\n\n/**\n * Transform a violation with file-level metadata for API response\n */\nfunction transformViolation(v: ComplexityViolation, fileData: FileComplexityData) {\n  return {\n    filepath: v.filepath,\n    symbolName: v.symbolName,\n    symbolType: v.symbolType,\n    startLine: v.startLine,\n    endLine: v.endLine,\n    complexity: v.complexity,\n    metricType: v.metricType,\n    threshold: v.threshold,\n    severity: v.severity,\n    language: v.language,\n    message: v.message,\n    dependentCount: fileData.dependentCount || 0,\n    riskLevel: fileData.riskLevel,\n    ...(v.halsteadDetails && { halsteadDetails: v.halsteadDetails }),\n  };\n}\n\n/**\n * Handle get_complexity tool calls.\n * Analyzes complexity for files or the entire codebase.\n */\nexport async function handleGetComplexity(\n  args: unknown,\n  ctx: ToolContext\n): Promise<MCPToolResult> {\n  const { vectorDB, config, log, checkAndReconnect, getIndexMetadata } = ctx;\n\n  return await wrapToolHandler(\n    GetComplexitySchema,\n    async (validatedArgs) => {\n      log('Analyzing complexity...');\n      await checkAndReconnect();\n\n      const analyzer = new ComplexityAnalyzer(vectorDB, config);\n      const report = await analyzer.analyze(validatedArgs.files);\n      log(`Analyzed ${report.summary.filesAnalyzed} files`);\n\n      // Transform violations using collect.js\n      type TransformedViolation = ReturnType<typeof transformViolation>;\n      const allViolations: TransformedViolation[] = collect(Object.entries(report.files))\n        .flatMap(([/* filepath unused */, fileData]) => \n          fileData.violations.map(v => transformViolation(v, fileData))\n        )\n        .sortByDesc('complexity')\n        .all() as unknown as TransformedViolation[];\n\n      // Apply custom threshold filter if provided\n      const violations = validatedArgs.threshold !== undefined\n        ? allViolations.filter(v => v.complexity >= validatedArgs.threshold!)\n        : allViolations;\n\n      const topViolations = violations.slice(0, validatedArgs.top);\n\n      // Calculate severity counts - countBy returns { error?: number, warning?: number }\n      const bySeverity = collect(violations).countBy('severity').all() as { error?: number; warning?: number };\n\n      return {\n        indexInfo: getIndexMetadata(),\n        summary: {\n          filesAnalyzed: report.summary.filesAnalyzed,\n          avgComplexity: report.summary.avgComplexity,\n          maxComplexity: report.summary.maxComplexity,\n          violationCount: violations.length,\n          bySeverity: {\n            error: bySeverity['error'] || 0,\n            warning: bySeverity['warning'] || 0,\n          },\n        },\n        violations: topViolations,\n      };\n    }\n  )(args);\n}\n","/**\n * Complexity analysis types for code quality insights\n */\n\n/**\n * Risk level ordering for comparison operations.\n * Higher value = higher risk.\n */\nexport const RISK_ORDER = { low: 0, medium: 1, high: 2, critical: 3 } as const;\n\n/**\n * Risk level type derived from RISK_ORDER keys\n */\nexport type RiskLevel = keyof typeof RISK_ORDER;\n\n/**\n * Type of complexity metric being measured\n */\nexport type ComplexityMetricType = 'cyclomatic' | 'cognitive' | 'halstead_effort' | 'halstead_bugs';\n\n/**\n * Halstead metric details for Halstead-type violations\n */\nexport interface HalsteadDetails {\n  volume: number;\n  difficulty: number;\n  effort: number;\n  bugs: number;\n}\n\nexport interface ComplexityViolation {\n  filepath: string;\n  startLine: number;\n  endLine: number;\n  symbolName: string;\n  symbolType: 'function' | 'method' | 'class' | 'file';\n  language: string;\n  complexity: number;\n  threshold: number;\n  severity: 'warning' | 'error';\n  message: string;\n  /** Type of complexity metric (cyclomatic vs cognitive vs halstead) */\n  metricType: ComplexityMetricType;\n  /** Halstead-specific details when metricType is halstead_* */\n  halsteadDetails?: HalsteadDetails;\n}\n\nexport interface FileComplexityData {\n  violations: ComplexityViolation[];\n  dependents: string[];\n  dependentCount?: number;\n  /** Test files associated with this source file. TODO: Populate when test-to-code mapping is implemented */\n  testAssociations: string[];\n  riskLevel: RiskLevel;\n  dependentComplexityMetrics?: {\n    averageComplexity: number;\n    maxComplexity: number;\n    filesWithComplexityData: number;\n  };\n}\n\nexport interface ComplexityReport {\n  summary: {\n    filesAnalyzed: number;\n    totalViolations: number;\n    bySeverity: { error: number; warning: number };\n    avgComplexity: number;\n    maxComplexity: number;\n  };\n  files: Record<string, FileComplexityData>;\n}\n\n","import { SearchResult } from '../vectordb/types.js';\nimport { normalizePath, getCanonicalPath, matchesFile, isTestFile } from '../mcp/utils/path-matching.js';\nimport { RISK_ORDER, RiskLevel } from '../insights/types.js';\n\n/**\n * Risk level thresholds for dependent count.\n * Based on impact analysis: more dependents = higher risk of breaking changes.\n */\nexport const DEPENDENT_COUNT_THRESHOLDS = {\n  LOW: 5,       // Few dependents, safe to change\n  MEDIUM: 15,   // Moderate impact, review dependents\n  HIGH: 30,     // High impact, careful planning needed\n} as const;\n\n/**\n * Complexity thresholds for risk assessment.\n * Based on cyclomatic complexity: higher complexity = harder to change safely.\n */\nexport const COMPLEXITY_THRESHOLDS = {\n  HIGH_COMPLEXITY_DEPENDENT: 10,  // Individual file is complex\n  CRITICAL_AVG: 15,              // Average complexity indicates systemic complexity\n  CRITICAL_MAX: 25,              // Peak complexity indicates hotspot\n  HIGH_AVG: 10,                  // Moderately complex on average\n  HIGH_MAX: 20,                  // Some complex functions exist\n  MEDIUM_AVG: 6,                 // Slightly above simple code\n  MEDIUM_MAX: 15,                // Occasional branching\n} as const;\n\nexport interface FileComplexityInfo {\n  filepath: string;\n  avgComplexity: number;\n  maxComplexity: number;\n  complexityScore: number;\n  chunksWithComplexity: number;\n}\n\nexport interface DependencyAnalysisResult {\n  dependents: Array<{\n    filepath: string;\n    isTestFile: boolean;\n  }>;\n  dependentCount: number;\n  riskLevel: RiskLevel;\n  complexityMetrics?: {\n    averageComplexity: number;\n    maxComplexity: number;\n    filesWithComplexityData: number;\n    highComplexityDependents: Array<{\n      filepath: string;\n      maxComplexity: number;\n      avgComplexity: number;\n    }>;\n    complexityRiskBoost: RiskLevel;\n  };\n}\n\n/**\n * Creates a cached path normalizer to avoid repeated string operations.\n * \n * @param workspaceRoot - The workspace root directory for path normalization\n * @returns A function that normalizes and caches file paths\n */\nfunction createPathNormalizer(workspaceRoot: string): (path: string) => string {\n  const cache = new Map<string, string>();\n  return (path: string): string => {\n    const cached = cache.get(path);\n    if (cached !== undefined) return cached;\n    const normalized = normalizePath(path, workspaceRoot);\n    cache.set(path, normalized);\n    return normalized;\n  };\n}\n\n/**\n * Builds an index mapping normalized import paths to chunks that import them.\n * Enables O(1) lookup instead of O(n*m) iteration.\n * \n * @param chunks - All chunks from the vector database\n * @param normalizePathCached - Cached path normalization function\n * @returns Map of normalized import paths to chunks that import them\n */\nfunction buildImportIndex(\n  chunks: SearchResult[],\n  normalizePathCached: (path: string) => string\n): Map<string, SearchResult[]> {\n  const importIndex = new Map<string, SearchResult[]>();\n  \n  for (const chunk of chunks) {\n    const imports = chunk.metadata.imports || [];\n    for (const imp of imports) {\n      const normalizedImport = normalizePathCached(imp);\n      let chunkList = importIndex.get(normalizedImport);\n      if (!chunkList) {\n        chunkList = [];\n        importIndex.set(normalizedImport, chunkList);\n      }\n      chunkList.push(chunk);\n    }\n  }\n  \n  return importIndex;\n}\n\n/**\n * Finds all chunks that import the target file using index + fuzzy matching.\n * \n * @param normalizedTarget - The normalized path of the target file\n * @param importIndex - Index mapping import paths to chunks\n * @returns Array of chunks that import the target file (deduplicated)\n */\nfunction findDependentChunks(\n  normalizedTarget: string,\n  importIndex: Map<string, SearchResult[]>\n): SearchResult[] {\n  const dependentChunks: SearchResult[] = [];\n  const seenChunkIds = new Set<string>();\n  \n  const addChunk = (chunk: SearchResult): void => {\n    const chunkId = `${chunk.metadata.file}:${chunk.metadata.startLine}-${chunk.metadata.endLine}`;\n    if (!seenChunkIds.has(chunkId)) {\n      dependentChunks.push(chunk);\n      seenChunkIds.add(chunkId);\n    }\n  };\n  \n  // Direct index lookup (fastest path)\n  const directMatches = importIndex.get(normalizedTarget);\n  if (directMatches) {\n    for (const chunk of directMatches) {\n      addChunk(chunk);\n    }\n  }\n  \n  // Fuzzy match for relative imports and path variations\n  // Note: This is O(M) where M = unique import paths. For large codebases with many\n  // violations, consider caching fuzzy match results at a higher level.\n  for (const [normalizedImport, chunks] of importIndex.entries()) {\n    if (normalizedImport !== normalizedTarget && matchesFile(normalizedImport, normalizedTarget)) {\n      for (const chunk of chunks) {\n        addChunk(chunk);\n      }\n    }\n  }\n  \n  return dependentChunks;\n}\n\n/**\n * Groups chunks by their canonical file path.\n * \n * @param chunks - Array of chunks to group\n * @param workspaceRoot - The workspace root directory\n * @returns Map of canonical file paths to their chunks\n */\nfunction groupChunksByFile(\n  chunks: SearchResult[],\n  workspaceRoot: string\n): Map<string, SearchResult[]> {\n  const chunksByFile = new Map<string, SearchResult[]>();\n  \n  for (const chunk of chunks) {\n    const canonical = getCanonicalPath(chunk.metadata.file, workspaceRoot);\n    let existing = chunksByFile.get(canonical);\n    if (!existing) {\n      existing = [];\n      chunksByFile.set(canonical, existing);\n    }\n    existing.push(chunk);\n  }\n  \n  return chunksByFile;\n}\n\n/**\n * Calculates complexity metrics for each file based on its chunks.\n * \n * @param chunksByFile - Map of file paths to their chunks\n * @returns Array of complexity info for files with complexity data\n */\nfunction calculateFileComplexities(\n  chunksByFile: Map<string, SearchResult[]>\n): FileComplexityInfo[] {\n  const fileComplexities: FileComplexityInfo[] = [];\n  \n  for (const [filepath, chunks] of chunksByFile.entries()) {\n    const complexities = chunks\n      .map(c => c.metadata.complexity)\n      .filter((c): c is number => typeof c === 'number' && c > 0);\n    \n    if (complexities.length > 0) {\n      const sum = complexities.reduce((a, b) => a + b, 0);\n      const avg = sum / complexities.length;\n      const max = Math.max(...complexities);\n      \n      fileComplexities.push({\n        filepath,\n        avgComplexity: Math.round(avg * 10) / 10,\n        maxComplexity: max,\n        complexityScore: sum,\n        chunksWithComplexity: complexities.length,\n      });\n    }\n  }\n  \n  return fileComplexities;\n}\n\n/**\n * Calculates overall complexity metrics from per-file data.\n * \n * @param fileComplexities - Array of per-file complexity info\n * @returns Aggregated complexity metrics, or undefined if no data\n */\nfunction calculateOverallComplexityMetrics(\n  fileComplexities: FileComplexityInfo[]\n): DependencyAnalysisResult['complexityMetrics'] | undefined {\n  if (fileComplexities.length === 0) {\n    return undefined;\n  }\n  \n  const allAvgs = fileComplexities.map(f => f.avgComplexity);\n  const allMaxes = fileComplexities.map(f => f.maxComplexity);\n  const totalAvg = allAvgs.reduce((a, b) => a + b, 0) / allAvgs.length;\n  const globalMax = Math.max(...allMaxes);\n  \n  // Identify high-complexity dependents (top 5)\n  const highComplexityDependents = fileComplexities\n    .filter(f => f.maxComplexity > COMPLEXITY_THRESHOLDS.HIGH_COMPLEXITY_DEPENDENT)\n    .sort((a, b) => b.maxComplexity - a.maxComplexity)\n    .slice(0, 5)\n    .map(f => ({\n      filepath: f.filepath,\n      maxComplexity: f.maxComplexity,\n      avgComplexity: f.avgComplexity,\n    }));\n  \n  // Calculate complexity-based risk boost\n  const complexityRiskBoost = calculateComplexityRiskBoost(totalAvg, globalMax);\n  \n  return {\n    averageComplexity: Math.round(totalAvg * 10) / 10,\n    maxComplexity: globalMax,\n    filesWithComplexityData: fileComplexities.length,\n    highComplexityDependents,\n    complexityRiskBoost,\n  };\n}\n\n/**\n * Determines risk level based on complexity thresholds.\n * \n * @param avgComplexity - Average complexity across all files\n * @param maxComplexity - Maximum complexity found in any file\n * @returns Risk level based on complexity thresholds\n */\nfunction calculateComplexityRiskBoost(avgComplexity: number, maxComplexity: number): RiskLevel {\n  if (avgComplexity > COMPLEXITY_THRESHOLDS.CRITICAL_AVG || maxComplexity > COMPLEXITY_THRESHOLDS.CRITICAL_MAX) {\n    return 'critical';\n  }\n  if (avgComplexity > COMPLEXITY_THRESHOLDS.HIGH_AVG || maxComplexity > COMPLEXITY_THRESHOLDS.HIGH_MAX) {\n    return 'high';\n  }\n  if (avgComplexity > COMPLEXITY_THRESHOLDS.MEDIUM_AVG || maxComplexity > COMPLEXITY_THRESHOLDS.MEDIUM_MAX) {\n    return 'medium';\n  }\n  return 'low';\n}\n\n/**\n * Calculates risk level based on dependent count.\n * \n * @param count - Number of dependent files\n * @returns Risk level based on dependent count thresholds\n */\nfunction calculateRiskLevelFromCount(count: number): RiskLevel {\n  if (count <= DEPENDENT_COUNT_THRESHOLDS.LOW) {\n    return 'low';\n  }\n  if (count <= DEPENDENT_COUNT_THRESHOLDS.MEDIUM) {\n    return 'medium';\n  }\n  if (count <= DEPENDENT_COUNT_THRESHOLDS.HIGH) {\n    return 'high';\n  }\n  return 'critical';\n}\n\n/**\n * Analyzes dependencies for a given file by finding all chunks that import it.\n * \n * @param targetFilepath - The file to analyze dependencies for\n * @param allChunks - All chunks from the vector database\n * @param workspaceRoot - The workspace root directory\n * @returns Dependency analysis including dependents, count, and risk level\n */\nexport function analyzeDependencies(\n  targetFilepath: string,\n  allChunks: SearchResult[],\n  workspaceRoot: string\n): DependencyAnalysisResult {\n  // Create cached path normalizer\n  const normalizePathCached = createPathNormalizer(workspaceRoot);\n  \n  // Build import index for efficient lookup\n  const importIndex = buildImportIndex(allChunks, normalizePathCached);\n  \n  // Find all dependent chunks\n  const normalizedTarget = normalizePathCached(targetFilepath);\n  const dependentChunks = findDependentChunks(normalizedTarget, importIndex);\n  \n  // Group by file for analysis\n  const chunksByFile = groupChunksByFile(dependentChunks, workspaceRoot);\n  \n  // Calculate complexity metrics\n  const fileComplexities = calculateFileComplexities(chunksByFile);\n  const complexityMetrics = calculateOverallComplexityMetrics(fileComplexities);\n  \n  // Build dependents list\n  const dependents = Array.from(chunksByFile.keys()).map(filepath => ({\n    filepath,\n    isTestFile: isTestFile(filepath),\n  }));\n  \n  // Calculate risk level\n  let riskLevel = calculateRiskLevelFromCount(dependents.length);\n  \n  // Boost risk level if complexity warrants it\n  if (complexityMetrics?.complexityRiskBoost) {\n    if (RISK_ORDER[complexityMetrics.complexityRiskBoost] > RISK_ORDER[riskLevel]) {\n      riskLevel = complexityMetrics.complexityRiskBoost;\n    }\n  }\n  \n  return {\n    dependents,\n    dependentCount: dependents.length,\n    riskLevel,\n    complexityMetrics,\n  };\n}\n","import { VectorDB } from '../vectordb/lancedb.js';\nimport { LienConfig } from '../config/schema.js';\nimport { ComplexityViolation, ComplexityReport, FileComplexityData, RISK_ORDER, RiskLevel, HalsteadDetails } from './types.js';\nimport { ChunkMetadata } from '../indexer/types.js';\nimport { analyzeDependencies } from '../indexer/dependency-analyzer.js';\nimport { SearchResult } from '../vectordb/types.js';\n\n/**\n * Hardcoded severity multipliers:\n * - Warning: triggers at 1x threshold (e.g., testPaths >= 15)\n * - Error: triggers at 2x threshold (e.g., testPaths >= 30)\n */\nconst SEVERITY = { warning: 1.0, error: 2.0 } as const;\n\n/**\n * Analyzer for code complexity based on indexed codebase\n */\nexport class ComplexityAnalyzer {\n  constructor(\n    private vectorDB: VectorDB,\n    private config: LienConfig\n  ) {}\n\n  /**\n   * Analyze complexity of codebase or specific files\n   * @param files - Optional list of specific files to analyze\n   * @returns Complexity report with violations and summary\n   */\n  async analyze(files?: string[]): Promise<ComplexityReport> {\n    // 1. Get all chunks from index (uses full scan internally for LanceDB)\n    // Note: We fetch all chunks even with --files filter because dependency analysis\n    // needs the complete dataset to find dependents accurately\n    const allChunks = await this.vectorDB.scanAll();\n    \n    // 2. Filter to specified files if provided\n    const chunks = files \n      ? allChunks.filter(c => this.matchesAnyFile(c.metadata.file, files))\n      : allChunks;\n    \n    // 3. Find violations from filtered chunks\n    const violations = this.findViolations(chunks);\n    \n    // 4. Build report - pass filtered chunks for file list, but keep violations from those files\n    const report = this.buildReport(violations, chunks);\n    \n    // 5. Enrich files with violations with dependency data\n    this.enrichWithDependencies(report, allChunks as SearchResult[]);\n    \n    return report;\n  }\n\n  /**\n   * Normalize a file path to a consistent relative format\n   * Converts absolute paths to relative paths from workspace root\n   */\n  private normalizeFilePath(filepath: string): string {\n    const workspaceRoot = process.cwd();\n    // Convert to forward slashes first\n    const normalized = filepath.replace(/\\\\/g, '/');\n    const normalizedRoot = workspaceRoot.replace(/\\\\/g, '/');\n    \n    // Convert absolute paths to relative\n    if (normalized.startsWith(normalizedRoot + '/')) {\n      return normalized.slice(normalizedRoot.length + 1);\n    }\n    if (normalized.startsWith(normalizedRoot)) {\n      return normalized.slice(normalizedRoot.length);\n    }\n    return normalized;\n  }\n\n  /**\n   * Check if a chunk's file matches any of the target files\n   * Uses exact match or suffix matching to avoid unintended matches\n   */\n  private matchesAnyFile(chunkFile: string, targetFiles: string[]): boolean {\n    // Normalize to forward slashes for cross-platform consistency\n    // Don't use path.normalize() as its behavior is platform-dependent\n    const normalizedChunkFile = chunkFile.replace(/\\\\/g, '/');\n    return targetFiles.some(target => {\n      const normalizedTarget = target.replace(/\\\\/g, '/');\n      // Exact match or target is a suffix of the chunk file\n      return normalizedChunkFile === normalizedTarget || \n             normalizedChunkFile.endsWith('/' + normalizedTarget);\n    });\n  }\n\n  /**\n   * Create a violation if complexity exceeds threshold\n   */\n  private createViolation(\n    metadata: ChunkMetadata,\n    complexity: number,\n    baseThreshold: number,\n    metricType: ComplexityViolation['metricType']\n  ): ComplexityViolation | null {\n    const warningThreshold = baseThreshold * SEVERITY.warning;\n    const errorThreshold = baseThreshold * SEVERITY.error;\n\n    if (complexity < warningThreshold) return null;\n\n    const violationSeverity = complexity >= errorThreshold ? 'error' : 'warning';\n    const effectiveThreshold = violationSeverity === 'error' ? errorThreshold : warningThreshold;\n    \n    // Human-friendly messages\n    const message = metricType === 'cyclomatic'\n      ? `Needs ~${complexity} test cases for full coverage (threshold: ${Math.round(effectiveThreshold)})`\n      : `Mental load ${complexity} exceeds threshold ${Math.round(effectiveThreshold)} (hard to follow)`;\n\n    return {\n      filepath: metadata.file,\n      startLine: metadata.startLine,\n      endLine: metadata.endLine,\n      symbolName: metadata.symbolName || 'unknown',\n      symbolType: metadata.symbolType as 'function' | 'method',\n      language: metadata.language,\n      complexity,\n      threshold: Math.round(effectiveThreshold),\n      severity: violationSeverity,\n      message,\n      metricType,\n    };\n  }\n\n  /**\n   * Deduplicate and filter chunks to only function/method types.\n   * Handles potential index duplicates by tracking file+line ranges.\n   */\n  private getUniqueFunctionChunks(\n    chunks: Array<{ content: string; metadata: ChunkMetadata }>\n  ): ChunkMetadata[] {\n    const seen = new Set<string>();\n    const result: ChunkMetadata[] = [];\n    \n    for (const { metadata } of chunks) {\n      if (metadata.symbolType !== 'function' && metadata.symbolType !== 'method') continue;\n      \n      const key = `${metadata.file}:${metadata.startLine}-${metadata.endLine}`;\n      if (seen.has(key)) continue;\n      \n      seen.add(key);\n      result.push(metadata);\n    }\n    \n    return result;\n  }\n\n  /**\n   * Convert Halstead effort to time in minutes.\n   * Formula: Time (seconds) = Effort / 18 (Stroud number for mental discrimination)\n   *          Time (minutes) = Effort / (18 * 60) = Effort / 1080\n   */\n  private effortToMinutes(effort: number): number {\n    return effort / 1080;\n  }\n\n  /**\n   * Format minutes as human-readable time (e.g., \"2h 30m\" or \"45m\")\n   */\n  private formatTime(minutes: number): string {\n    if (minutes >= 60) {\n      const hours = Math.floor(minutes / 60);\n      const mins = Math.round(minutes % 60);\n      return mins > 0 ? `${hours}h ${mins}m` : `${hours}h`;\n    }\n    return `${Math.round(minutes)}m`;\n  }\n\n  /**\n   * Create a Halstead violation if metrics exceed thresholds\n   */\n  private createHalsteadViolation(\n    metadata: ChunkMetadata,\n    metricValue: number,\n    threshold: number,\n    metricType: 'halstead_effort' | 'halstead_bugs'\n  ): ComplexityViolation | null {\n    const warningThreshold = threshold * SEVERITY.warning;\n    const errorThreshold = threshold * SEVERITY.error;\n\n    if (metricValue < warningThreshold) return null;\n\n    const violationSeverity = metricValue >= errorThreshold ? 'error' : 'warning';\n    const effectiveThreshold = violationSeverity === 'error' ? errorThreshold : warningThreshold;\n    \n    // For effort, show time in minutes; for bugs, show decimal with 2 places\n    let message: string;\n    if (metricType === 'halstead_effort') {\n      const timeMinutes = this.effortToMinutes(metricValue);\n      const thresholdMinutes = this.effortToMinutes(effectiveThreshold);\n      message = `Time to understand ~${this.formatTime(timeMinutes)} exceeds threshold ${this.formatTime(thresholdMinutes)}`;\n    } else {\n      message = `Estimated bugs ${metricValue.toFixed(2)} exceeds threshold ${effectiveThreshold.toFixed(1)}`;\n    }\n\n    const halsteadDetails: HalsteadDetails = {\n      volume: metadata.halsteadVolume || 0,\n      difficulty: metadata.halsteadDifficulty || 0,\n      effort: metadata.halsteadEffort || 0,\n      bugs: metadata.halsteadBugs || 0,\n    };\n\n    // Store human-scale values for complexity/threshold:\n    // - halstead_effort: rounded to integer minutes for readability (typical values 60-300)\n    // - halstead_bugs: kept as decimal for precision (typical values < 5, e.g. 1.5, 2.27)\n    let complexity: number;\n    let displayThreshold: number;\n    if (metricType === 'halstead_effort') {\n      // Convert raw effort to minutes and round for comparable deltas\n      complexity = Math.round(this.effortToMinutes(metricValue));\n      displayThreshold = Math.round(this.effortToMinutes(effectiveThreshold));\n    } else {\n      // halstead_bugs: store as decimal for precision in small values\n      complexity = metricValue;\n      displayThreshold = effectiveThreshold;\n    }\n\n    return {\n      filepath: metadata.file,\n      startLine: metadata.startLine,\n      endLine: metadata.endLine,\n      symbolName: metadata.symbolName || 'unknown',\n      symbolType: metadata.symbolType as 'function' | 'method',\n      language: metadata.language,\n      complexity,\n      threshold: displayThreshold,\n      severity: violationSeverity,\n      message,\n      metricType,\n      halsteadDetails,\n    };\n  }\n\n  /**\n   * Check complexity metrics and create violations for a single chunk.\n   */\n  private checkChunkComplexity(\n    metadata: ChunkMetadata,\n    thresholds: { testPaths: number; mentalLoad: number; halsteadEffort?: number; estimatedBugs?: number }\n  ): ComplexityViolation[] {\n    const violations: ComplexityViolation[] = [];\n    \n    // Check test paths (cyclomatic complexity)\n    if (metadata.complexity) {\n      const v = this.createViolation(metadata, metadata.complexity, thresholds.testPaths, 'cyclomatic');\n      if (v) violations.push(v);\n    }\n    \n    // Check mental load (cognitive complexity)\n    if (metadata.cognitiveComplexity) {\n      const v = this.createViolation(metadata, metadata.cognitiveComplexity, thresholds.mentalLoad, 'cognitive');\n      if (v) violations.push(v);\n    }\n    \n    // Check time to understand (Halstead effort)\n    if (thresholds.halsteadEffort && metadata.halsteadEffort) {\n      const v = this.createHalsteadViolation(metadata, metadata.halsteadEffort, thresholds.halsteadEffort, 'halstead_effort');\n      if (v) violations.push(v);\n    }\n    \n    // Check estimated bugs\n    if (thresholds.estimatedBugs && metadata.halsteadBugs) {\n      const v = this.createHalsteadViolation(metadata, metadata.halsteadBugs, thresholds.estimatedBugs, 'halstead_bugs');\n      if (v) violations.push(v);\n    }\n    \n    return violations;\n  }\n\n  /**\n   * Convert time in minutes to Halstead effort.\n   * This is the inverse of effortToMinutes().\n   * Formula: Time (seconds) = Effort / 18 (Stroud number)\n   *          So: Effort = Time (minutes) * 60 * 18 = Time * 1080\n   */\n  private minutesToEffort(minutes: number): number {\n    return minutes * 1080;\n  }\n\n  /**\n   * Find all complexity violations based on thresholds.\n   * Checks cyclomatic, cognitive, and Halstead complexity.\n   */\n  private findViolations(chunks: Array<{ content: string; metadata: ChunkMetadata }>): ComplexityViolation[] {\n    const configThresholds = this.config.complexity?.thresholds;\n    \n    // Convert timeToUnderstandMinutes to effort internally\n    const halsteadEffort = configThresholds?.timeToUnderstandMinutes \n      ? this.minutesToEffort(configThresholds.timeToUnderstandMinutes)\n      : this.minutesToEffort(60); // Default: 60 minutes = 64,800 effort\n    \n    const thresholds = { \n      testPaths: configThresholds?.testPaths ?? 15, \n      mentalLoad: configThresholds?.mentalLoad ?? 15, \n      halsteadEffort, // Converted from minutes to effort internally (see above)\n      estimatedBugs: configThresholds?.estimatedBugs ?? 1.5, // Direct decimal value (no conversion needed)\n    };\n    const functionChunks = this.getUniqueFunctionChunks(chunks);\n    \n    return functionChunks.flatMap(metadata => \n      this.checkChunkComplexity(metadata, thresholds)\n    );\n  }\n\n  /**\n   * Build the final report with summary and per-file data\n   */\n  private buildReport(\n    violations: ComplexityViolation[],\n    allChunks: Array<{ content: string; metadata: ChunkMetadata }>\n  ): ComplexityReport {\n    // Normalize violation filepaths and group by normalized path\n    const fileViolationsMap = new Map<string, ComplexityViolation[]>();\n    for (const violation of violations) {\n      const normalizedPath = this.normalizeFilePath(violation.filepath);\n      // Update violation's filepath to normalized form\n      violation.filepath = normalizedPath;\n      const existing = fileViolationsMap.get(normalizedPath) || [];\n      existing.push(violation);\n      fileViolationsMap.set(normalizedPath, existing);\n    }\n\n    // Get unique files from all analyzed chunks, normalized to relative paths\n    const analyzedFiles = new Set(allChunks.map(c => this.normalizeFilePath(c.metadata.file)));\n\n    // Build file data\n    const files: Record<string, FileComplexityData> = {};\n    for (const filepath of analyzedFiles) {\n      const fileViolations = fileViolationsMap.get(filepath) || [];\n      files[filepath] = {\n        violations: fileViolations,\n        dependents: [], // Will be enriched later if needed\n        testAssociations: [], // Will be enriched later if needed\n        riskLevel: this.calculateRiskLevel(fileViolations),\n      };\n    }\n\n    // Calculate summary statistics\n    const errorCount = violations.filter(v => v.severity === 'error').length;\n    const warningCount = violations.filter(v => v.severity === 'warning').length;\n\n    // Calculate average and max complexity from all chunks with complexity data\n    const complexityValues = allChunks\n      .filter(c => c.metadata.complexity !== undefined && c.metadata.complexity > 0)\n      .map(c => c.metadata.complexity!);\n\n    const avgComplexity = complexityValues.length > 0\n      ? complexityValues.reduce((sum, val) => sum + val, 0) / complexityValues.length\n      : 0;\n\n    const maxComplexity = complexityValues.length > 0\n      ? Math.max(...complexityValues)\n      : 0;\n\n    return {\n      summary: {\n        filesAnalyzed: analyzedFiles.size,\n        totalViolations: violations.length,\n        bySeverity: { error: errorCount, warning: warningCount },\n        avgComplexity: Math.round(avgComplexity * 10) / 10, // Round to 1 decimal\n        maxComplexity,\n      },\n      files,\n    };\n  }\n\n  /**\n   * Calculate risk level based on violations\n   */\n  private calculateRiskLevel(violations: ComplexityViolation[]): RiskLevel {\n    if (violations.length === 0) return 'low';\n\n    const hasErrors = violations.some(v => v.severity === 'error');\n    const errorCount = violations.filter(v => v.severity === 'error').length;\n\n    if (errorCount >= 3) return 'critical';\n    if (hasErrors) return 'high';\n    if (violations.length >= 3) return 'medium';\n    return 'low';\n  }\n\n  /**\n   * Enrich files with violations with dependency data\n   * This adds:\n   * - List of dependent files (who imports this?)\n   * - Boosted risk level based on dependents + complexity\n   */\n  private enrichWithDependencies(\n    report: ComplexityReport,\n    allChunks: SearchResult[]\n  ): void {\n    const workspaceRoot = process.cwd();\n\n    // Only enrich files that have violations (to save computation)\n    const filesWithViolations = Object.entries(report.files)\n      .filter(([_, data]) => data.violations.length > 0)\n      .map(([filepath, _]) => filepath);\n\n    for (const filepath of filesWithViolations) {\n      const fileData = report.files[filepath];\n      \n      // Analyze dependencies for this file\n      const depAnalysis = analyzeDependencies(filepath, allChunks, workspaceRoot);\n      \n      // Update file data with dependency information\n      fileData.dependents = depAnalysis.dependents.map(d => d.filepath);\n      fileData.dependentCount = depAnalysis.dependentCount;\n      \n      // Boost risk level based on dependency analysis\n      // Take the higher of the two risk levels\n      if (RISK_ORDER[depAnalysis.riskLevel] > RISK_ORDER[fileData.riskLevel]) {\n        fileData.riskLevel = depAnalysis.riskLevel;\n      }\n      \n      // Add complexity metrics if available\n      if (depAnalysis.complexityMetrics) {\n        fileData.dependentComplexityMetrics = {\n          averageComplexity: depAnalysis.complexityMetrics.averageComplexity,\n          maxComplexity: depAnalysis.complexityMetrics.maxComplexity,\n          filesWithComplexityData: depAnalysis.complexityMetrics.filesWithComplexityData,\n        };\n      }\n    }\n  }\n}\n\n","/**\n * MCP Tool Handler Registry\n *\n * This module exports all tool handlers and a registry mapping tool names to handlers.\n * The registry is used by the MCP server to dispatch tool calls.\n */\n\nimport { handleSemanticSearch } from './semantic-search.js';\nimport { handleFindSimilar } from './find-similar.js';\nimport { handleGetFilesContext } from './get-files-context.js';\nimport { handleListFunctions } from './list-functions.js';\nimport { handleGetDependents } from './get-dependents.js';\nimport { handleGetComplexity } from './get-complexity.js';\nimport type { ToolHandler } from '../types.js';\n\n// Re-export individual handlers for direct use if needed\nexport {\n  handleSemanticSearch,\n  handleFindSimilar,\n  handleGetFilesContext,\n  handleListFunctions,\n  handleGetDependents,\n  handleGetComplexity,\n};\n\n/**\n * Registry mapping MCP tool names to their handler functions.\n * Used by the MCP server to dispatch tool calls.\n */\nexport const toolHandlers: Record<string, ToolHandler> = {\n  'semantic_search': handleSemanticSearch,\n  'find_similar': handleFindSimilar,\n  'get_files_context': handleGetFilesContext,\n  'list_functions': handleListFunctions,\n  'get_dependents': handleGetDependents,\n  'get_complexity': handleGetComplexity,\n};\n","import chokidar from 'chokidar';\nimport path from 'path';\nimport { LienConfig, LegacyLienConfig, isLegacyConfig, isModernConfig } from '../config/schema.js';\n\nexport interface FileChangeEvent {\n  type: 'add' | 'change' | 'unlink';\n  filepath: string;\n}\n\nexport type FileChangeHandler = (event: FileChangeEvent) => void | Promise<void>;\n\n/**\n * File watcher service that monitors code files for changes.\n * Uses chokidar for robust file watching with debouncing support.\n */\nexport class FileWatcher {\n  private watcher: chokidar.FSWatcher | null = null;\n  private debounceTimers: Map<string, NodeJS.Timeout> = new Map();\n  private config: LienConfig | LegacyLienConfig;\n  private rootDir: string;\n  private onChangeHandler: FileChangeHandler | null = null;\n  \n  constructor(rootDir: string, config: LienConfig | LegacyLienConfig) {\n    this.rootDir = rootDir;\n    this.config = config;\n  }\n  \n  /**\n   * Starts watching files for changes.\n   * \n   * @param handler - Callback function called when files change\n   */\n  async start(handler: FileChangeHandler): Promise<void> {\n    if (this.watcher) {\n      throw new Error('File watcher is already running');\n    }\n    \n    this.onChangeHandler = handler;\n    \n    // Get watch patterns based on config type\n    let includePatterns: string[];\n    let excludePatterns: string[];\n    \n    if (isLegacyConfig(this.config)) {\n      includePatterns = this.config.indexing.include;\n      excludePatterns = this.config.indexing.exclude;\n    } else if (isModernConfig(this.config)) {\n      // For modern configs, aggregate patterns from all frameworks\n      includePatterns = this.config.frameworks.flatMap(f => f.config.include);\n      excludePatterns = this.config.frameworks.flatMap(f => f.config.exclude);\n    } else {\n      includePatterns = ['**/*'];\n      excludePatterns = [];\n    }\n    \n    // Configure chokidar\n    this.watcher = chokidar.watch(includePatterns, {\n      cwd: this.rootDir,\n      ignored: excludePatterns,\n      persistent: true,\n      ignoreInitial: true, // Don't trigger for existing files\n      \n      // Handle atomic saves from modern editors (VS Code, Sublime, etc.)\n      // Editors write to temp file then rename - without this, we get unlink+add instead of change\n      atomic: true,\n      \n      awaitWriteFinish: {\n        stabilityThreshold: 300, // Reduced from 500ms for faster detection\n        pollInterval: 100,\n      },\n      \n      // Performance optimizations\n      usePolling: false,\n      interval: 100,\n      binaryInterval: 300,\n    });\n    \n    // Register event handlers with debouncing\n    this.watcher\n      .on('add', (filepath) => this.handleChange('add', filepath))\n      .on('change', (filepath) => this.handleChange('change', filepath))\n      .on('unlink', (filepath) => this.handleChange('unlink', filepath))\n      .on('error', (error) => {\n        console.error(`[Lien] File watcher error: ${error}`);\n      });\n    \n    // Wait for watcher to be ready\n    await new Promise<void>((resolve) => {\n      this.watcher!.on('ready', () => {\n        resolve();\n      });\n    });\n  }\n  \n  /**\n   * Handles a file change event with debouncing.\n   * Debouncing prevents rapid reindexing when files are saved multiple times quickly.\n   */\n  private handleChange(type: 'add' | 'change' | 'unlink', filepath: string): void {\n    // Clear existing debounce timer for this file\n    const existingTimer = this.debounceTimers.get(filepath);\n    if (existingTimer) {\n      clearTimeout(existingTimer);\n    }\n    \n    // Set new debounce timer\n    const timer = setTimeout(() => {\n      this.debounceTimers.delete(filepath);\n      \n      // Call handler\n      if (this.onChangeHandler) {\n        // Use path.join for proper cross-platform path handling\n        const absolutePath = path.isAbsolute(filepath)\n          ? filepath\n          : path.join(this.rootDir, filepath);\n        \n        try {\n          const result = this.onChangeHandler({\n            type,\n            filepath: absolutePath,\n          });\n          \n          // Handle async handlers\n          if (result instanceof Promise) {\n            result.catch((error) => {\n              console.error(`[Lien] Error handling file change: ${error}`);\n            });\n          }\n        } catch (error) {\n          console.error(`[Lien] Error handling file change: ${error}`);\n        }\n      }\n    }, this.config.fileWatching.debounceMs);\n    \n    this.debounceTimers.set(filepath, timer);\n  }\n  \n  /**\n   * Stops the file watcher and cleans up resources.\n   */\n  async stop(): Promise<void> {\n    if (!this.watcher) {\n      return;\n    }\n    \n    // Clear all pending debounce timers\n    for (const timer of this.debounceTimers.values()) {\n      clearTimeout(timer);\n    }\n    this.debounceTimers.clear();\n    \n    // Close watcher\n    await this.watcher.close();\n    this.watcher = null;\n    this.onChangeHandler = null;\n  }\n  \n  /**\n   * Gets the list of files currently being watched.\n   */\n  getWatchedFiles(): string[] {\n    if (!this.watcher) {\n      return [];\n    }\n    \n    const watched = this.watcher.getWatched();\n    const files: string[] = [];\n    \n    for (const [dir, filenames] of Object.entries(watched)) {\n      for (const filename of filenames) {\n        files.push(`${dir}/${filename}`);\n      }\n    }\n    \n    return files;\n  }\n  \n  /**\n   * Checks if the watcher is currently running.\n   */\n  isRunning(): boolean {\n    return this.watcher !== null;\n  }\n}\n\n","import chalk from 'chalk';\nimport fs from 'fs';\nimport path from 'path';\nimport { VectorDB } from '../vectordb/lancedb.js';\nimport { configService } from '../config/service.js';\nimport { ComplexityAnalyzer } from '../insights/complexity-analyzer.js';\nimport { formatReport, OutputFormat } from '../insights/formatters/index.js';\nimport type { LienConfig, LegacyLienConfig } from '../config/schema.js';\n\ninterface ComplexityOptions {\n  files?: string[];\n  format: OutputFormat;\n  threshold?: string;\n  cyclomaticThreshold?: string;\n  cognitiveThreshold?: string;\n  failOn?: 'error' | 'warning';\n}\n\n/** Parsed threshold overrides */\ninterface ThresholdOverrides {\n  cyclomatic: number | null;\n  cognitive: number | null;\n}\n\nconst VALID_FAIL_ON = ['error', 'warning'];\nconst VALID_FORMATS = ['text', 'json', 'sarif'];\n\n/** Validate --fail-on option */\nfunction validateFailOn(failOn: string | undefined): void {\n  if (failOn && !VALID_FAIL_ON.includes(failOn)) {\n    console.error(chalk.red(`Error: Invalid --fail-on value \"${failOn}\". Must be either 'error' or 'warning'`));\n    process.exit(1);\n  }\n}\n\n/** Validate --format option */\nfunction validateFormat(format: string): void {\n  if (!VALID_FORMATS.includes(format)) {\n    console.error(chalk.red(`Error: Invalid --format value \"${format}\". Must be one of: text, json, sarif`));\n    process.exit(1);\n  }\n}\n\n/** Validate that specified files exist */\nfunction validateFilesExist(files: string[] | undefined, rootDir: string): void {\n  if (!files || files.length === 0) return;\n  \n  const missingFiles = files.filter(file => {\n    const fullPath = path.isAbsolute(file) ? file : path.join(rootDir, file);\n    return !fs.existsSync(fullPath);\n  });\n  \n  if (missingFiles.length > 0) {\n    console.error(chalk.red(`Error: File${missingFiles.length > 1 ? 's' : ''} not found:`));\n    missingFiles.forEach(file => console.error(chalk.red(`  - ${file}`)));\n    process.exit(1);\n  }\n}\n\n/** Parse and validate a threshold value */\nfunction parseThresholdValue(value: string | undefined, flagName: string): number | null {\n  if (!value) return null;\n  \n  const parsed = parseInt(value, 10);\n  if (isNaN(parsed)) {\n    console.error(chalk.red(`Error: Invalid ${flagName} value \"${value}\". Must be a number`));\n    process.exit(1);\n  }\n  if (parsed <= 0) {\n    console.error(chalk.red(`Error: Invalid ${flagName} value \"${value}\". Must be a positive number`));\n    process.exit(1);\n  }\n  return parsed;\n}\n\n/** Parse all threshold options into overrides */\nfunction parseThresholdOverrides(options: ComplexityOptions): ThresholdOverrides {\n  const baseThreshold = parseThresholdValue(options.threshold, '--threshold');\n  const cyclomaticOverride = parseThresholdValue(options.cyclomaticThreshold, '--cyclomatic-threshold');\n  const cognitiveOverride = parseThresholdValue(options.cognitiveThreshold, '--cognitive-threshold');\n  \n  return {\n    // Specific flags take precedence over --threshold\n    cyclomatic: cyclomaticOverride ?? baseThreshold,\n    cognitive: cognitiveOverride ?? baseThreshold,\n  };\n}\n\n/** Apply threshold overrides to config (mutates config) */\nfunction applyThresholdOverrides(config: LienConfig | LegacyLienConfig, overrides: ThresholdOverrides): void {\n  if (overrides.cyclomatic === null && overrides.cognitive === null) return;\n  \n  // Cast to allow mutation - both config types support complexity at runtime\n  const cfg = config as { complexity?: LienConfig['complexity'] };\n  \n  // Ensure complexity config structure exists\n  if (!cfg.complexity) {\n    cfg.complexity = {\n      enabled: true,\n      thresholds: { testPaths: 15, mentalLoad: 15 },\n    };\n  } else if (!cfg.complexity.thresholds) {\n    cfg.complexity.thresholds = { testPaths: 15, mentalLoad: 15 };\n  }\n  \n  // Apply overrides (CLI flags use --cyclomatic/--cognitive for familiarity)\n  if (overrides.cyclomatic !== null) {\n    cfg.complexity.thresholds.testPaths = overrides.cyclomatic;\n  }\n  if (overrides.cognitive !== null) {\n    cfg.complexity.thresholds.mentalLoad = overrides.cognitive;\n  }\n}\n\n/** Check if index exists */\nasync function ensureIndexExists(vectorDB: VectorDB): Promise<void> {\n  try {\n    await vectorDB.scanWithFilter({ limit: 1 });\n  } catch {\n    console.error(chalk.red('Error: Index not found'));\n    console.log(chalk.yellow('\\nRun'), chalk.bold('lien index'), chalk.yellow('to index your codebase first'));\n    process.exit(1);\n  }\n}\n\n/**\n * Analyze code complexity from indexed codebase\n */\nexport async function complexityCommand(options: ComplexityOptions) {\n  const rootDir = process.cwd();\n  \n  try {\n    // Validate options\n    validateFailOn(options.failOn);\n    validateFormat(options.format);\n    validateFilesExist(options.files, rootDir);\n    const thresholdOverrides = parseThresholdOverrides(options);\n    \n    // Load config and database\n    const config = await configService.load(rootDir);\n    const vectorDB = new VectorDB(rootDir);\n    await vectorDB.initialize();\n    await ensureIndexExists(vectorDB);\n    \n    // Apply threshold overrides if provided\n    applyThresholdOverrides(config, thresholdOverrides);\n    \n    // Run analysis and output\n    const analyzer = new ComplexityAnalyzer(vectorDB, config);\n    const report = await analyzer.analyze(options.files);\n    console.log(formatReport(report, options.format));\n    \n    // Exit code for CI integration\n    if (options.failOn) {\n      const hasViolations = options.failOn === 'error' \n        ? report.summary.bySeverity.error > 0\n        : report.summary.totalViolations > 0;\n      if (hasViolations) process.exit(1);\n    }\n  } catch (error) {\n    console.error(chalk.red('Error analyzing complexity:'), error);\n    process.exit(1);\n  }\n}\n\n","import chalk from 'chalk';\nimport { ComplexityReport, ComplexityViolation, FileComplexityData } from '../types.js';\n\n/**\n * Violation with associated file path for rendering\n */\ntype ViolationWithFile = ComplexityViolation & { file: string };\n\n/**\n * Get the display label for a metric type\n */\nfunction getMetricLabel(metricType: ComplexityViolation['metricType']): string {\n  switch (metricType) {\n    case 'cognitive': return '🧠 Mental load';\n    case 'cyclomatic': return '🔀 Test paths';\n    case 'halstead_effort': return '⏱️ Time to understand';\n    case 'halstead_bugs': return '🐛 Estimated bugs';\n    default: return 'Complexity';\n  }\n}\n\n/**\n * Convert Halstead effort to time in minutes\n */\nfunction effortToMinutes(effort: number): number {\n  return effort / 1080;\n}\n\n/**\n * Format minutes as human-readable time\n */\nfunction formatTime(minutes: number): string {\n  if (minutes >= 60) {\n    const hours = Math.floor(minutes / 60);\n    const mins = Math.round(minutes % 60);\n    return mins > 0 ? `${hours}h ${mins}m` : `${hours}h`;\n  }\n  return `${Math.round(minutes)}m`;\n}\n\n/**\n * Format Halstead details as additional lines\n */\nfunction formatHalsteadDetails(violation: ViolationWithFile): string[] {\n  if (!violation.halsteadDetails) return [];\n  \n  const { volume, difficulty, effort, bugs } = violation.halsteadDetails;\n  const timeStr = formatTime(effortToMinutes(effort));\n  return [\n    chalk.dim(`    📊  Volume: ${Math.round(volume).toLocaleString()}, Difficulty: ${difficulty.toFixed(1)}`),\n    chalk.dim(`    ⏱️  Time: ~${timeStr}, Est. bugs: ${bugs.toFixed(2)}`),\n  ];\n}\n\n/**\n * Metric-specific formatters for complexity/threshold display.\n * Each formatter returns { complexity, threshold } as display strings.\n */\ntype MetricFormatter = (val: number, thresh: number) => { complexity: string; threshold: string };\n\nconst metricFormatters: Record<string, MetricFormatter> = {\n  halstead_effort: (val, thresh) => ({\n    // val/thresh are already in minutes (human-scale)\n    complexity: '~' + formatTime(val),\n    threshold: formatTime(thresh),\n  }),\n  halstead_bugs: (val, thresh) => ({\n    complexity: val.toFixed(2),\n    threshold: thresh.toFixed(1),\n  }),\n  cyclomatic: (val, thresh) => ({\n    complexity: `${val} (needs ~${val} tests)`,\n    threshold: thresh.toString(),\n  }),\n};\n\nconst defaultFormatter: MetricFormatter = (val, thresh) => ({\n  complexity: val.toString(),\n  threshold: thresh.toString(),\n});\n\n/**\n * Format symbol name with appropriate suffix\n */\nfunction formatSymbolDisplay(violation: ViolationWithFile, isBold: boolean): string {\n  const display = ['function', 'method'].includes(violation.symbolType)\n    ? `${violation.symbolName}()`\n    : violation.symbolName;\n  return isBold ? chalk.bold(display) : display;\n}\n\n/**\n * Format dependency impact information\n */\nfunction formatDependencyInfo(fileData: FileComplexityData): string[] {\n  const depCount = fileData.dependentCount ?? fileData.dependents.length;\n  if (depCount === 0) return [];\n\n  const lines = [chalk.dim(`    📦  Imported by ${depCount} file${depCount !== 1 ? 's' : ''}`)];\n  \n  if (fileData.dependentComplexityMetrics) {\n    const { averageComplexity, maxComplexity } = fileData.dependentComplexityMetrics;\n    lines.push(chalk.dim(`    - Dependent avg complexity: ${averageComplexity}, max: ${maxComplexity}`));\n  }\n  \n  return lines;\n}\n\n/**\n * Format percentage over threshold\n */\nfunction formatPercentageOver(complexity: number, threshold: number): string {\n  if (threshold <= 0) return 'N/A (invalid threshold)';\n  return `${Math.round(((complexity - threshold) / threshold) * 100)}% over threshold`;\n}\n\n/**\n * Format a single violation entry with its metadata\n */\nfunction formatViolation(\n  violation: ViolationWithFile,\n  fileData: FileComplexityData,\n  colorFn: typeof chalk.red | typeof chalk.yellow,\n  isBold: boolean\n): string[] {\n  const symbolText = formatSymbolDisplay(violation, isBold);\n  const metricLabel = getMetricLabel(violation.metricType);\n  const formatter = metricFormatters[violation.metricType] || defaultFormatter;\n  const { complexity: complexityDisplay, threshold: thresholdDisplay } = formatter(violation.complexity, violation.threshold);\n\n  return [\n    colorFn(`  ${violation.file}:${violation.startLine}`) + chalk.dim(' - ') + symbolText,\n    chalk.dim(`    ${metricLabel}: ${complexityDisplay} (threshold: ${thresholdDisplay})`),\n    chalk.dim(`    ⬆️  ${formatPercentageOver(violation.complexity, violation.threshold)}`),\n    ...formatHalsteadDetails(violation),\n    ...formatDependencyInfo(fileData),\n    chalk.dim(`    ⚠️  Risk: ${fileData.riskLevel.toUpperCase()}`),\n    '',\n  ];\n}\n\n/**\n * Format complexity report as human-readable text with colors\n */\nexport function formatTextReport(report: ComplexityReport): string {\n  const lines: string[] = [];\n\n  // Header\n  lines.push(chalk.bold('🔍 Complexity Analysis\\n'));\n\n  // Summary\n  lines.push(chalk.bold('Summary:'));\n  lines.push(chalk.dim('  Files analyzed: ') + report.summary.filesAnalyzed.toString());\n  const errorText = `${report.summary.bySeverity.error} error${report.summary.bySeverity.error !== 1 ? 's' : ''}`;\n  const warningText = `${report.summary.bySeverity.warning} warning${report.summary.bySeverity.warning !== 1 ? 's' : ''}`;\n  lines.push(chalk.dim('  Violations: ') + `${report.summary.totalViolations} (${errorText}, ${warningText})`);\n  lines.push(chalk.dim('  Average complexity: ') + report.summary.avgComplexity.toString());\n  lines.push(chalk.dim('  Max complexity: ') + report.summary.maxComplexity.toString());\n  lines.push('');\n\n  // Group violations by file\n  const filesWithViolations = Object.entries(report.files)\n    .filter(([_, data]) => data.violations.length > 0)\n    .sort((a, b) => b[1].violations.length - a[1].violations.length);\n\n  if (filesWithViolations.length === 0) {\n    lines.push(chalk.green('✓ No violations found!'));\n    return lines.join('\\n');\n  }\n\n  // Errors section\n  const errors = filesWithViolations.flatMap(([file, data]) =>\n    data.violations.filter(v => v.severity === 'error').map(v => ({ file, ...v }))\n  );\n\n  if (errors.length > 0) {\n    lines.push(chalk.red.bold('❌ Errors:\\n'));\n    for (const error of errors) {\n      lines.push(...formatViolation(error, report.files[error.file], chalk.red, true));\n    }\n  }\n\n  // Warnings section\n  const warnings = filesWithViolations.flatMap(([file, data]) =>\n    data.violations.filter(v => v.severity === 'warning').map(v => ({ file, ...v }))\n  );\n\n  if (warnings.length > 0) {\n    lines.push(chalk.yellow.bold('⚠️  Warnings:\\n'));\n    for (const warning of warnings) {\n      lines.push(...formatViolation(warning, report.files[warning.file], chalk.yellow, false));\n    }\n  }\n\n  return lines.join('\\n');\n}\n\n","import { ComplexityReport } from '../types.js';\n\n/**\n * Format complexity report as JSON for consumption by GitHub Action\n */\nexport function formatJsonReport(report: ComplexityReport): string {\n  return JSON.stringify(report, null, 2);\n}\n\n","import { ComplexityReport } from '../types.js';\n\n/**\n * SARIF (Static Analysis Results Interchange Format) 2.1.0\n * Used by GitHub Code Scanning to show results in Security tab\n * https://docs.github.com/en/code-security/code-scanning/integrating-with-code-scanning/sarif-support-for-code-scanning\n */\ninterface SarifReport {\n  $schema: string;\n  version: string;\n  runs: SarifRun[];\n}\n\ninterface SarifRun {\n  tool: {\n    driver: {\n      name: string;\n      version: string;\n      informationUri?: string;\n      rules?: SarifRule[];\n    };\n  };\n  results: SarifResult[];\n}\n\ninterface SarifRule {\n  id: string;\n  shortDescription: {\n    text: string;\n  };\n  fullDescription?: {\n    text: string;\n  };\n  help?: {\n    text: string;\n  };\n  defaultConfiguration?: {\n    level: 'warning' | 'error' | 'note';\n  };\n}\n\ninterface SarifResult {\n  ruleId: string;\n  level: 'warning' | 'error' | 'note';\n  message: {\n    text: string;\n  };\n  locations: Array<{\n    physicalLocation: {\n      artifactLocation: {\n        uri: string;\n      };\n      region: {\n        startLine: number;\n        endLine: number;\n      };\n    };\n  }>;\n}\n\n/**\n * Get the SARIF rule ID for a metric type\n */\nfunction getRuleId(metricType: string): string {\n  switch (metricType) {\n    case 'cognitive': return 'lien/high-cognitive-complexity';\n    case 'cyclomatic': return 'lien/high-cyclomatic-complexity';\n    case 'halstead_effort': return 'lien/high-halstead-effort';\n    case 'halstead_bugs': return 'lien/high-estimated-bugs';\n    default: return 'lien/high-complexity';\n  }\n}\n\n/**\n * Format complexity report as SARIF for GitHub Code Scanning\n */\nexport function formatSarifReport(report: ComplexityReport): string {\n  const rules: SarifRule[] = [\n    {\n      id: 'lien/high-cyclomatic-complexity',\n      shortDescription: {\n        text: 'Too many test paths',\n      },\n      fullDescription: {\n        text: 'Function or method requires too many test cases to achieve full branch coverage. Each decision point (if, switch, loop) adds a path that needs testing.',\n      },\n      help: {\n        text: 'Consider refactoring by extracting methods, using early returns, or simplifying conditional logic to reduce the number of test paths.',\n      },\n    },\n    {\n      id: 'lien/high-cognitive-complexity',\n      shortDescription: {\n        text: 'High mental load',\n      },\n      fullDescription: {\n        text: 'Function or method has high mental load (deeply nested or hard to follow), requiring too much mental effort to understand and maintain.',\n      },\n      help: {\n        text: 'Consider flattening nested conditionals, extracting helper functions, or using guard clauses to reduce mental load.',\n      },\n    },\n    {\n      id: 'lien/high-halstead-effort',\n      shortDescription: {\n        text: 'Long time to understand',\n      },\n      fullDescription: {\n        text: 'Function or method takes too long to understand, based on Halstead metrics (operators and operands count).',\n      },\n      help: {\n        text: 'Consider simplifying expressions, reducing variable count, or breaking into smaller functions.',\n      },\n    },\n    {\n      id: 'lien/high-estimated-bugs',\n      shortDescription: {\n        text: 'High estimated bug count',\n      },\n      fullDescription: {\n        text: 'Function or method is likely to contain bugs based on Halstead metrics (Volume / 3000), which estimates bug count from code complexity.',\n      },\n      help: {\n        text: 'Consider simplifying the function, breaking into smaller units, or adding thorough test coverage.',\n      },\n    },\n  ];\n\n  const results: SarifResult[] = [];\n\n  // Convert violations to SARIF results\n  for (const [filepath, fileData] of Object.entries(report.files)) {\n    for (const violation of fileData.violations) {\n      const ruleId = getRuleId(violation.metricType);\n      \n      results.push({\n        ruleId,\n        level: violation.severity,\n        message: {\n          text: `${violation.symbolName}: ${violation.message}`,\n        },\n        locations: [\n          {\n            physicalLocation: {\n              artifactLocation: {\n                uri: filepath,\n              },\n              region: {\n                startLine: violation.startLine,\n                endLine: violation.endLine,\n              },\n            },\n          },\n        ],\n      });\n    }\n  }\n\n  const sarifReport: SarifReport = {\n    $schema: 'https://raw.githubusercontent.com/oasis-tcs/sarif-spec/master/Schemata/sarif-schema-2.1.0.json',\n    version: '2.1.0',\n    runs: [\n      {\n        tool: {\n          driver: {\n            name: 'Lien Complexity Analyzer',\n            version: '1.0.0',\n            informationUri: 'https://github.com/liendev/lien',\n            rules,\n          },\n        },\n        results,\n      },\n    ],\n  };\n\n  return JSON.stringify(sarifReport, null, 2);\n}\n\n","import { ComplexityReport } from '../types.js';\nimport { formatTextReport } from './text.js';\nimport { formatJsonReport } from './json.js';\nimport { formatSarifReport } from './sarif.js';\n\nexport type OutputFormat = 'text' | 'json' | 'sarif';\n\n/**\n * Format complexity report in the specified format\n */\nexport function formatReport(\n  report: ComplexityReport,\n  format: OutputFormat\n): string {\n  switch (format) {\n    case 'json':\n      return formatJsonReport(report);\n    case 'sarif':\n      return formatSarifReport(report);\n    case 'text':\n    default:\n      return formatTextReport(report);\n  }\n}\n\n// Export individual formatters\nexport { formatTextReport, formatJsonReport, formatSarifReport };\n\n","import { program } from './cli/index.js';\n\nprogram.parse();\n\n"],"mappings":";;;;;;;;;;;;AAAA,SAAS,qBAAqB;AAC9B,SAAS,qBAAqB;AAC9B,SAAS,SAAS,YAAY;AAoCvB,SAAS,oBAA4B;AAC1C,SAAO,YAAY;AACrB;AAxCA,IAeM,YACA,WACAA,UAEF;AAnBJ;AAAA;AAAA;AAeA,IAAM,aAAa,cAAc,YAAY,GAAG;AAChD,IAAM,YAAY,QAAQ,UAAU;AACpC,IAAMA,WAAU,cAAc,YAAY,GAAG;AAI7C,QAAI;AAEF,oBAAcA,SAAQ,KAAK,WAAW,iBAAiB,CAAC;AAAA,IAC1D,QAAQ;AACN,UAAI;AAEF,sBAAcA,SAAQ,KAAK,WAAW,oBAAoB,CAAC;AAAA,MAC7D,QAAQ;AAEN,gBAAQ,KAAK,qEAAqE;AAClF,sBAAc,EAAE,SAAS,gBAAgB;AAAA,MAC3C;AAAA,IACF;AAAA;AAAA;;;ACjCA,IASa,oBACA,uBAGA,qBACA,8BAKA,4BAIA,0BAEA,0BAGA,sBACA,yBAGA,cACA,2BAGA,8BAGA,qBAIA,wBAWA;AAtDb;AAAA;AAAA;AAMA;AAGO,IAAM,qBAAqB;AAC3B,IAAM,wBAAwB;AAG9B,IAAM,sBAAsB;AAC5B,IAAM,+BAA+B;AAKrC,IAAM,6BAA6B;AAInC,IAAM,2BAA2B;AAEjC,IAAM,2BAA2B;AAGjC,IAAM,uBAAuB;AAC7B,IAAM,0BAA0B;AAGhC,IAAM,eAAe;AACrB,IAAM,4BAA4B;AAGlC,IAAM,+BAA+B;AAGrC,IAAM,sBAAsB;AAI5B,IAAM,yBAAyB,kBAAkB;AAWjD,IAAM,uBAAuB;AAAA;AAAA;;;ACkD7B,SAAS,eACd,QAC4B;AAC5B,SAAO,cAAc,UAAU,EAAE,gBAAgB;AACnD;AAOO,SAAS,eACd,QACsB;AACtB,SAAO,gBAAgB;AACzB;AAvHA,IA6Ha;AA7Hb;AAAA;AAAA;AAAA;AA6HO,IAAM,gBAA4B;AAAA,MACvC,SAAS;AAAA,MACT,MAAM;AAAA,QACJ,WAAW;AAAA,QACX,cAAc;AAAA,QACd,aAAa;AAAA,QACb,oBAAoB;AAAA,MACtB;AAAA,MACA,UAAU;AAAA,QACR,QAAQ;AAAA;AAAA,QACR,aAAa;AAAA;AAAA,MACf;AAAA,MACA,KAAK;AAAA,QACH,MAAM;AAAA,QACN,WAAW;AAAA,QACX,qBAAqB;AAAA,MACvB;AAAA,MACA,cAAc;AAAA,QACZ,SAAS;AAAA,QACT,gBAAgB;AAAA,MAClB;AAAA,MACA,cAAc;AAAA,QACZ,SAAS;AAAA;AAAA,QACT,YAAY;AAAA,MACd;AAAA,MACA,YAAY;AAAA,QACV,SAAS;AAAA,QACT,YAAY;AAAA,UACV,WAAW;AAAA;AAAA,UACX,YAAY;AAAA;AAAA,UACZ,yBAAyB;AAAA;AAAA,UACzB,eAAe;AAAA;AAAA,QACjB;AAAA,MACF;AAAA,MACA,YAAY,CAAC;AAAA;AAAA,IACf;AAAA;AAAA;;;AChKA,OAAO,QAAQ;AACf,OAAO,UAAU;AAOV,SAAS,eAAe,QAAsB;AAMnD,MAAI,CAAC,QAAQ;AACX,WAAO;AAAA,EACT;AAGA,MAAI,OAAO,eAAe,UAAa,CAAC,OAAO,UAAU;AACvD,WAAO;AAAA,EACT;AAGA,MAAI,OAAO,eAAe,UAAa,OAAO,aAAa,QAAW;AACpE,WAAO;AAAA,EACT;AAGA,MAAI,OAAO,aAAa,QAAW;AACjC,WAAO;AAAA,EACT;AAGA,MAAI,OAAO,WAAW,OAAO,QAAQ,WAAW,KAAK,GAAG;AACtD,WAAO;AAAA,EACT;AAEA,SAAO;AACT;AAKO,SAAS,cAAc,WAA+D;AAE3F,QAAM,YAAwB;AAAA,IAC5B,SAAS;AAAA,IACT,MAAM;AAAA,MACJ,WAAY,UAAkB,UAAU,aAAc,UAAkB,MAAM,aAAa,cAAc,KAAK;AAAA,MAC9G,cAAe,UAAkB,UAAU,gBAAiB,UAAkB,MAAM,gBAAgB,cAAc,KAAK;AAAA,MACvH,aAAc,UAAkB,UAAU,eAAgB,UAAkB,MAAM,eAAe,cAAc,KAAK;AAAA,MACpH,oBAAqB,UAAkB,UAAU,sBAAuB,UAAkB,MAAM,sBAAsB,cAAc,KAAK;AAAA,IAC3I;AAAA,IACA,UAAU;AAAA,MACR,QAAS,UAAkB,UAAU,UAAU,cAAc,SAAS;AAAA,MACtE,aAAc,UAAkB,UAAU,eAAe,cAAc,SAAS;AAAA,IAClF;AAAA,IACA,KAAK;AAAA,MACH,MAAM,UAAU,KAAK,QAAQ,cAAc,IAAI;AAAA,MAC/C,WAAW,UAAU,KAAK,aAAa,cAAc,IAAI;AAAA,MACzD,qBAAqB,UAAU,KAAK,uBAAuB,cAAc,IAAI;AAAA,IAC/E;AAAA,IACA,cAAc;AAAA,MACZ,SAAS,UAAU,cAAc,WAAW,cAAc,aAAa;AAAA,MACvE,gBAAgB,UAAU,cAAc,kBAAkB,cAAc,aAAa;AAAA,IACvF;AAAA,IACA,cAAc;AAAA,MACZ,SAAS,UAAU,cAAc,WAAW,cAAc,aAAa;AAAA,MACvE,YAAY,UAAU,cAAc,cAAc,cAAc,aAAa;AAAA,IAC/E;AAAA,IACA,YAAa,UAAkB,cAAc,CAAC;AAAA,EAChD;AAGA,MAAK,UAAkB,YAAY,UAAU,WAAW,WAAW,GAAG;AACpE,UAAM,mBAAsC;AAAA,MAC1C,MAAM;AAAA,MACN,MAAM;AAAA,MACN,SAAS;AAAA,MACT,QAAQ;AAAA,QACN,SAAU,UAAkB,SAAS,WAAW,CAAC,iDAAiD;AAAA,QAClG,SAAU,UAAkB,SAAS,WAAW;AAAA,UAC9C;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAEA,cAAU,WAAW,KAAK,gBAAgB;AAAA,EAC5C,WAAW,UAAU,WAAW,WAAW,GAAG;AAE5C,UAAM,mBAAsC;AAAA,MAC1C,MAAM;AAAA,MACN,MAAM;AAAA,MACN,SAAS;AAAA,MACT,QAAQ;AAAA,QACN,SAAS,CAAC,iDAAiD;AAAA,QAC3D,SAAS;AAAA,UACP;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAEA,cAAU,WAAW,KAAK,gBAAgB;AAAA,EAC5C;AAEA,SAAO;AACT;AAKA,eAAsB,kBAAkB,UAAkB,QAAQ,IAAI,GAInE;AACD,QAAM,aAAa,KAAK,KAAK,SAAS,mBAAmB;AAEzD,MAAI;AAEF,UAAM,gBAAgB,MAAM,GAAG,SAAS,YAAY,OAAO;AAC3D,UAAM,YAAY,KAAK,MAAM,aAAa;AAG1C,QAAI,CAAC,eAAe,SAAS,GAAG;AAC9B,aAAO;AAAA,QACL,UAAU;AAAA,QACV,QAAQ;AAAA,MACV;AAAA,IACF;AAGA,UAAM,YAAY,cAAc,SAAS;AAGzC,UAAM,aAAa,GAAG,UAAU;AAChC,UAAM,GAAG,SAAS,YAAY,UAAU;AAGxC,UAAM,GAAG,UAAU,YAAY,KAAK,UAAU,WAAW,MAAM,CAAC,IAAI,MAAM,OAAO;AAEjF,WAAO;AAAA,MACL,UAAU;AAAA,MACV;AAAA,MACA,QAAQ;AAAA,IACV;AAAA,EACF,SAAS,OAAO;AAEd,QAAK,MAAgC,SAAS,UAAU;AACtD,aAAO;AAAA,QACL,UAAU;AAAA,QACV,QAAQ;AAAA,MACV;AAAA,IACF;AACA,UAAM;AAAA,EACR;AACF;AA3KA;AAAA;AAAA;AAEA;AACA;AAAA;AAAA;;;ACOO,SAAS,gBAAgB,UAAsB,MAAuC;AAC3F,SAAO;AAAA,IACL,SAAS,KAAK,WAAW,SAAS;AAAA,IAClC,MAAM;AAAA,MACJ,GAAG,SAAS;AAAA,MACZ,GAAG,KAAK;AAAA,IACV;AAAA,IACA,UAAU;AAAA,MACR,GAAG,SAAS;AAAA,MACZ,GAAG,KAAK;AAAA,IACV;AAAA,IACA,KAAK;AAAA,MACH,GAAG,SAAS;AAAA,MACZ,GAAG,KAAK;AAAA,IACV;AAAA,IACA,cAAc;AAAA,MACZ,GAAG,SAAS;AAAA,MACZ,GAAG,KAAK;AAAA,IACV;AAAA,IACA,cAAc;AAAA,MACZ,GAAG,SAAS;AAAA,MACZ,GAAG,KAAK;AAAA,IACV;AAAA,IACA,YAAY,KAAK,aAAa;AAAA,MAC5B,SAAS,KAAK,WAAW,WAAW,SAAS,YAAY,WAAW;AAAA,MACpE,YAAY;AAAA,QACV,GAAG,SAAS,YAAY;AAAA,QACxB,GAAI,KAAK,WAAW,cAAc,CAAC;AAAA,MACrC;AAAA,IACF,IAAI,SAAS;AAAA,IACb,YAAY,KAAK,cAAc,SAAS;AAAA,EAC1C;AACF;AAUO,SAAS,gBAAgB,QAA6B,OAAsC;AACjG,QAAM,YAAsB,CAAC;AAG7B,aAAW,OAAO,OAAO,KAAK,KAAK,GAAG;AACpC,QAAI,EAAE,OAAO,SAAS;AACpB,gBAAU,KAAK,GAAG;AAClB;AAAA,IACF;AAGA,QAAI,OAAO,MAAM,GAAG,MAAM,YAAY,MAAM,GAAG,MAAM,QAAQ,CAAC,MAAM,QAAQ,MAAM,GAAG,CAAC,GAAG;AACvF,YAAM,gBAAiB,OAAO,GAAG,KAA6B,CAAC;AAC/D,YAAM,eAAe,MAAM,GAAG;AAE9B,iBAAW,aAAa,OAAO,KAAK,YAAY,GAAG;AACjD,YAAI,EAAE,aAAa,gBAAgB;AACjC,oBAAU,KAAK,GAAG,GAAG,IAAI,SAAS,EAAE;AAAA,QACtC;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AACT;AA5EA;AAAA;AAAA;AAAA;AAAA;;;ACAA;AAAA;AAAA;AAAA;AAAA;;;AC8GO,SAAS,UACd,OACA,SACA,mBACW;AACX,QAAM,UAAU,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;AACrE,QAAM,QAAQ,iBAAiB,QAAQ,MAAM,QAAQ;AAErD,QAAM,eAAe,IAAI;AAAA,IACvB,GAAG,OAAO,KAAK,OAAO;AAAA;AAAA,IAEtB;AAAA,EACF;AAGA,MAAI,OAAO;AACT,iBAAa,QAAQ,GAAG,aAAa,KAAK;AAAA;AAAA;AAAA,EAAmB,KAAK;AAAA,EACpE;AAEA,SAAO;AACT;AAlIA,IAaa,WAiDA,aAwBA,gBAUA;AAhGb;AAAA;AAAA;AAAA;AAGA;AAUO,IAAM,YAAN,cAAwB,MAAM;AAAA,MACnC,YACE,SACgB,MACA,SACA,WAA0B,UAC1B,cAAuB,MACvB,YAAqB,OACrC;AACA,cAAM,OAAO;AANG;AACA;AACA;AACA;AACA;AAGhB,aAAK,OAAO;AAGZ,YAAI,MAAM,mBAAmB;AAC3B,gBAAM,kBAAkB,MAAM,KAAK,WAAW;AAAA,QAChD;AAAA,MACF;AAAA;AAAA;AAAA;AAAA,MAKA,SAAS;AACP,eAAO;AAAA,UACL,OAAO,KAAK;AAAA,UACZ,MAAM,KAAK;AAAA,UACX,UAAU,KAAK;AAAA,UACf,aAAa,KAAK;AAAA,UAClB,SAAS,KAAK;AAAA,QAChB;AAAA,MACF;AAAA;AAAA;AAAA;AAAA,MAKA,cAAuB;AACrB,eAAO,KAAK;AAAA,MACd;AAAA;AAAA;AAAA;AAAA,MAKA,gBAAyB;AACvB,eAAO,KAAK;AAAA,MACd;AAAA,IACF;AAKO,IAAM,cAAN,cAA0B,UAAU;AAAA,MACzC,YAAY,SAAiB,SAAmC;AAC9D,cAAM,gDAAuC,SAAS,UAAU,MAAM,KAAK;AAC3E,aAAK,OAAO;AAAA,MACd;AAAA,IACF;AAmBO,IAAM,iBAAN,cAA6B,UAAU;AAAA,MAC5C,YAAY,SAAiB,SAAmC;AAC9D,cAAM,0EAAoD,SAAS,QAAQ,MAAM,IAAI;AACrF,aAAK,OAAO;AAAA,MACd;AAAA,IACF;AAKO,IAAM,gBAAN,cAA4B,UAAU;AAAA,MAC3C,YAAY,SAAiB,SAAmC;AAC9D,cAAM,gDAAuC,SAAS,QAAQ,MAAM,IAAI;AACxE,aAAK,OAAO;AAAA,MACd;AAAA,IACF;AAAA;AAAA;;;ACrGA,OAAOC,SAAQ;AACf,OAAOC,WAAU;AADjB,IAgCa,eAujBA;AAvlBb;AAAA;AAAA;AAEA;AACA;AACA;AACA;AA2BO,IAAM,gBAAN,MAAM,eAAc;AAAA,MACzB,OAAwB,kBAAkB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAU1C,MAAM,KAAK,UAAkB,QAAQ,IAAI,GAAwB;AAC/D,cAAM,aAAa,KAAK,cAAc,OAAO;AAE7C,YAAI;AACF,gBAAM,gBAAgB,MAAMD,IAAG,SAAS,YAAY,OAAO;AAC3D,gBAAM,aAAa,KAAK,MAAM,aAAa;AAG3C,cAAI,KAAK,eAAe,UAAU,GAAG;AACnC,oBAAQ,IAAI,qDAA8C;AAE1D,kBAAM,SAAS,MAAM,KAAK,QAAQ,OAAO;AAEzC,gBAAI,OAAO,YAAY,OAAO,YAAY;AACxC,oBAAM,iBAAiBC,MAAK,SAAS,OAAO,UAAU;AACtD,sBAAQ,IAAI,8CAAyC,cAAc,EAAE;AACrE,sBAAQ,IAAI,+DAAwD;AAAA,YACtE;AAEA,mBAAO,OAAO;AAAA,UAChB;AAGA,gBAAM,eAAe,gBAAgB,eAAe,UAAiC;AAGrF,gBAAM,aAAa,KAAK,SAAS,YAAY;AAC7C,cAAI,CAAC,WAAW,OAAO;AACrB,kBAAM,IAAI;AAAA,cACR;AAAA,EAA2B,WAAW,OAAO,KAAK,IAAI,CAAC;AAAA,cACvD,EAAE,QAAQ,WAAW,QAAQ,UAAU,WAAW,SAAS;AAAA,YAC7D;AAAA,UACF;AAGA,cAAI,WAAW,SAAS,SAAS,GAAG;AAClC,oBAAQ,KAAK,uCAA6B;AAC1C,uBAAW,SAAS,QAAQ,aAAW,QAAQ,KAAK,MAAM,OAAO,EAAE,CAAC;AAAA,UACtE;AAEA,iBAAO;AAAA,QACT,SAAS,OAAO;AACd,cAAK,MAAgC,SAAS,UAAU;AAEtD,mBAAO;AAAA,UACT;AAEA,cAAI,iBAAiB,aAAa;AAChC,kBAAM;AAAA,UACR;AAEA,cAAI,iBAAiB,aAAa;AAChC,kBAAM,IAAI;AAAA,cACR;AAAA,cACA,EAAE,MAAM,YAAY,eAAe,MAAM,QAAQ;AAAA,YACnD;AAAA,UACF;AAEA,gBAAM,UAAU,OAAO,gCAAgC,EAAE,MAAM,WAAW,CAAC;AAAA,QAC7E;AAAA,MACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAUA,MAAM,KAAK,SAAiB,QAAmC;AAC7D,cAAM,aAAa,KAAK,cAAc,OAAO;AAG7C,cAAM,aAAa,KAAK,SAAS,MAAM;AACvC,YAAI,CAAC,WAAW,OAAO;AACrB,gBAAM,IAAI;AAAA,YACR;AAAA,EAAuC,WAAW,OAAO,KAAK,IAAI,CAAC;AAAA,YACnE,EAAE,QAAQ,WAAW,OAAO;AAAA,UAC9B;AAAA,QACF;AAEA,YAAI;AACF,gBAAM,aAAa,KAAK,UAAU,QAAQ,MAAM,CAAC,IAAI;AACrD,gBAAMD,IAAG,UAAU,YAAY,YAAY,OAAO;AAAA,QACpD,SAAS,OAAO;AACd,gBAAM,UAAU,OAAO,gCAAgC,EAAE,MAAM,WAAW,CAAC;AAAA,QAC7E;AAAA,MACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,MAAM,OAAO,UAAkB,QAAQ,IAAI,GAAqB;AAC9D,cAAM,aAAa,KAAK,cAAc,OAAO;AAC7C,YAAI;AACF,gBAAMA,IAAG,OAAO,UAAU;AAC1B,iBAAO;AAAA,QACT,QAAQ;AACN,iBAAO;AAAA,QACT;AAAA,MACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAUA,MAAM,QAAQ,UAAkB,QAAQ,IAAI,GAA6B;AACvE,cAAM,aAAa,KAAK,cAAc,OAAO;AAE7C,YAAI;AAEF,gBAAM,gBAAgB,MAAMA,IAAG,SAAS,YAAY,OAAO;AAC3D,gBAAM,YAAY,KAAK,MAAM,aAAa;AAG1C,cAAI,CAAC,KAAK,eAAe,SAAS,GAAG;AACnC,mBAAO;AAAA,cACL,UAAU;AAAA,cACV,QAAQ;AAAA,YACV;AAAA,UACF;AAGA,gBAAM,YAAY,cAAiB,SAAS;AAG5C,gBAAM,aAAa,KAAK,SAAS,SAAS;AAC1C,cAAI,CAAC,WAAW,OAAO;AACrB,kBAAM,IAAI;AAAA,cACR;AAAA,EAA8C,WAAW,OAAO,KAAK,IAAI,CAAC;AAAA,cAC1E,EAAE,QAAQ,WAAW,OAAO;AAAA,YAC9B;AAAA,UACF;AAGA,gBAAM,aAAa,GAAG,UAAU;AAChC,gBAAMA,IAAG,SAAS,YAAY,UAAU;AAGxC,gBAAM,KAAK,KAAK,SAAS,SAAS;AAElC,iBAAO;AAAA,YACL,UAAU;AAAA,YACV;AAAA,YACA,QAAQ;AAAA,UACV;AAAA,QACF,SAAS,OAAO;AACd,cAAK,MAAgC,SAAS,UAAU;AACtD,mBAAO;AAAA,cACL,UAAU;AAAA,cACV,QAAQ;AAAA,YACV;AAAA,UACF;AAEA,cAAI,iBAAiB,aAAa;AAChC,kBAAM;AAAA,UACR;AAEA,gBAAM,UAAU,OAAO,kCAAkC,EAAE,MAAM,WAAW,CAAC;AAAA,QAC/E;AAAA,MACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,eAAe,QAA0B;AACvC,eAAO,eAAoB,MAAM;AAAA,MACnC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MASA,SAAS,QAAmC;AAC1C,cAAM,SAAmB,CAAC;AAC1B,cAAM,WAAqB,CAAC;AAG5B,YAAI,CAAC,UAAU,OAAO,WAAW,UAAU;AACzC,iBAAO;AAAA,YACL,OAAO;AAAA,YACP,QAAQ,CAAC,iCAAiC;AAAA,YAC1C,UAAU,CAAC;AAAA,UACb;AAAA,QACF;AAEA,cAAM,MAAM;AAGZ,YAAI,CAAC,IAAI,SAAS;AAChB,iBAAO,KAAK,iCAAiC;AAAA,QAC/C;AAGA,YAAI,eAAe,GAAoC,GAAG;AACxD,eAAK,qBAAqB,KAAmB,QAAQ,QAAQ;AAAA,QAC/D,WAAW,eAAe,GAAoC,GAAG;AAC/D,eAAK,qBAAqB,KAAyB,QAAQ,QAAQ;AAAA,QACrE,OAAO;AACL,iBAAO,KAAK,wFAAwF;AAAA,QACtG;AAEA,eAAO;AAAA,UACL,OAAO,OAAO,WAAW;AAAA,UACzB;AAAA,UACA;AAAA,QACF;AAAA,MACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MASA,gBAAgB,QAA+C;AAC7D,cAAM,SAAmB,CAAC;AAC1B,cAAM,WAAqB,CAAC;AAG5B,YAAI,OAAO,MAAM;AACf,eAAK,mBAAmB,OAAO,MAAM,QAAQ,QAAQ;AAAA,QACvD;AAGA,YAAI,OAAO,KAAK;AACd,eAAK,kBAAkB,OAAO,KAAK,QAAQ,QAAQ;AAAA,QACrD;AAGA,YAAI,OAAO,cAAc;AACvB,eAAK,2BAA2B,OAAO,cAAc,QAAQ,QAAQ;AAAA,QACvE;AAGA,YAAI,OAAO,cAAc;AACvB,eAAK,2BAA2B,OAAO,cAAc,QAAQ,QAAQ;AAAA,QACvE;AAGA,YAAI,OAAO,YAAY;AACrB,eAAK,mBAAmB,OAAO,YAAY,QAAQ,QAAQ;AAAA,QAC7D;AAEA,eAAO;AAAA,UACL,OAAO,OAAO,WAAW;AAAA,UACzB;AAAA,UACA;AAAA,QACF;AAAA,MACF;AAAA;AAAA;AAAA;AAAA,MAKQ,cAAc,SAAyB;AAC7C,eAAOC,MAAK,KAAK,SAAS,eAAc,eAAe;AAAA,MACzD;AAAA;AAAA;AAAA;AAAA,MAKQ,qBACN,QACA,QACA,UACM;AAEN,YAAI,CAAC,OAAO,MAAM;AAChB,iBAAO,KAAK,8BAA8B;AAC1C;AAAA,QACF;AACA,aAAK,mBAAmB,OAAO,MAAM,QAAQ,QAAQ;AAGrD,YAAI,CAAC,OAAO,KAAK;AACf,iBAAO,KAAK,6BAA6B;AACzC;AAAA,QACF;AACA,aAAK,kBAAkB,OAAO,KAAK,QAAQ,QAAQ;AAGnD,YAAI,CAAC,OAAO,cAAc;AACxB,iBAAO,KAAK,sCAAsC;AAClD;AAAA,QACF;AACA,aAAK,2BAA2B,OAAO,cAAc,QAAQ,QAAQ;AAGrE,YAAI,CAAC,OAAO,cAAc;AACxB,iBAAO,KAAK,sCAAsC;AAClD;AAAA,QACF;AACA,aAAK,2BAA2B,OAAO,cAAc,QAAQ,QAAQ;AAGrE,YAAI,CAAC,OAAO,YAAY;AACtB,iBAAO,KAAK,oCAAoC;AAChD;AAAA,QACF;AACA,aAAK,mBAAmB,OAAO,YAAY,QAAQ,QAAQ;AAAA,MAC7D;AAAA;AAAA;AAAA;AAAA,MAKQ,qBACN,QACA,QACA,UACM;AACN,iBAAS,KAAK,sFAAsF;AAGpG,YAAI,CAAC,OAAO,UAAU;AACpB,iBAAO,KAAK,kCAAkC;AAC9C;AAAA,QACF;AAEA,cAAM,EAAE,SAAS,IAAI;AAErB,YAAI,OAAO,SAAS,cAAc,YAAY,SAAS,aAAa,GAAG;AACrE,iBAAO,KAAK,8CAA8C;AAAA,QAC5D;AAEA,YAAI,OAAO,SAAS,iBAAiB,YAAY,SAAS,eAAe,GAAG;AAC1E,iBAAO,KAAK,qDAAqD;AAAA,QACnE;AAEA,YAAI,OAAO,SAAS,gBAAgB,YAAY,SAAS,cAAc,KAAK,SAAS,cAAc,IAAI;AACrG,iBAAO,KAAK,+CAA+C;AAAA,QAC7D;AAEA,YAAI,OAAO,SAAS,uBAAuB,YAAY,SAAS,sBAAsB,GAAG;AACvF,iBAAO,KAAK,uDAAuD;AAAA,QACrE;AAGA,YAAI,OAAO,KAAK;AACd,eAAK,kBAAkB,OAAO,KAAK,QAAQ,QAAQ;AAAA,QACrD;AAAA,MACF;AAAA;AAAA;AAAA;AAAA,MAKQ,mBACN,MACA,QACA,UACM;AACN,YAAI,KAAK,cAAc,QAAW;AAChC,cAAI,OAAO,KAAK,cAAc,YAAY,KAAK,aAAa,GAAG;AAC7D,mBAAO,KAAK,0CAA0C;AAAA,UACxD,WAAW,KAAK,YAAY,IAAI;AAC9B,qBAAS,KAAK,kFAAkF;AAAA,UAClG,WAAW,KAAK,YAAY,KAAK;AAC/B,qBAAS,KAAK,wEAAwE;AAAA,UACxF;AAAA,QACF;AAEA,YAAI,KAAK,iBAAiB,QAAW;AACnC,cAAI,OAAO,KAAK,iBAAiB,YAAY,KAAK,eAAe,GAAG;AAClE,mBAAO,KAAK,iDAAiD;AAAA,UAC/D;AAAA,QACF;AAEA,YAAI,KAAK,gBAAgB,QAAW;AAClC,cAAI,OAAO,KAAK,gBAAgB,YAAY,KAAK,cAAc,KAAK,KAAK,cAAc,IAAI;AACzF,mBAAO,KAAK,2CAA2C;AAAA,UACzD;AAAA,QACF;AAEA,YAAI,KAAK,uBAAuB,QAAW;AACzC,cAAI,OAAO,KAAK,uBAAuB,YAAY,KAAK,sBAAsB,GAAG;AAC/E,mBAAO,KAAK,mDAAmD;AAAA,UACjE,WAAW,KAAK,qBAAqB,KAAK;AACxC,qBAAS,KAAK,4EAA4E;AAAA,UAC5F;AAAA,QACF;AAAA,MACF;AAAA;AAAA;AAAA;AAAA,MAKQ,kBACN,KACA,QACA,WACM;AACN,YAAI,IAAI,SAAS,QAAW;AAC1B,cAAI,OAAO,IAAI,SAAS,YAAY,IAAI,OAAO,QAAQ,IAAI,OAAO,OAAO;AACvE,mBAAO,KAAK,yCAAyC;AAAA,UACvD;AAAA,QACF;AAEA,YAAI,IAAI,cAAc,QAAW;AAC/B,cAAI,IAAI,cAAc,WAAW,IAAI,cAAc,UAAU;AAC3D,mBAAO,KAAK,kDAAkD;AAAA,UAChE;AAAA,QACF;AAEA,YAAI,IAAI,wBAAwB,QAAW;AACzC,cAAI,OAAO,IAAI,wBAAwB,WAAW;AAChD,mBAAO,KAAK,2CAA2C;AAAA,UACzD;AAAA,QACF;AAAA,MACF;AAAA;AAAA;AAAA;AAAA,MAKQ,2BACN,cACA,QACA,WACM;AACN,YAAI,aAAa,YAAY,QAAW;AACtC,cAAI,OAAO,aAAa,YAAY,WAAW;AAC7C,mBAAO,KAAK,wCAAwC;AAAA,UACtD;AAAA,QACF;AAEA,YAAI,aAAa,mBAAmB,QAAW;AAC7C,cAAI,OAAO,aAAa,mBAAmB,YAAY,aAAa,iBAAiB,KAAK;AACxF,mBAAO,KAAK,oDAAoD;AAAA,UAClE,WAAW,aAAa,iBAAiB,KAAM;AAC7C,sBAAU,KAAK,8EAA8E;AAAA,UAC/F;AAAA,QACF;AAAA,MACF;AAAA;AAAA;AAAA;AAAA,MAKQ,2BACN,cACA,QACA,UACM;AACN,YAAI,aAAa,YAAY,QAAW;AACtC,cAAI,OAAO,aAAa,YAAY,WAAW;AAC7C,mBAAO,KAAK,wCAAwC;AAAA,UACtD;AAAA,QACF;AAEA,YAAI,aAAa,eAAe,QAAW;AACzC,cAAI,OAAO,aAAa,eAAe,YAAY,aAAa,aAAa,GAAG;AAC9E,mBAAO,KAAK,uDAAuD;AAAA,UACrE,WAAW,aAAa,aAAa,KAAK;AACxC,qBAAS,KAAK,qFAAqF;AAAA,UACrG;AAAA,QACF;AAAA,MACF;AAAA;AAAA;AAAA;AAAA,MAKQ,mBACN,YACA,QACA,UACM;AACN,YAAI,CAAC,MAAM,QAAQ,UAAU,GAAG;AAC9B,iBAAO,KAAK,6BAA6B;AACzC;AAAA,QACF;AAEA,mBAAW,QAAQ,CAAC,WAAW,UAAU;AACvC,cAAI,CAAC,aAAa,OAAO,cAAc,UAAU;AAC/C,mBAAO,KAAK,cAAc,KAAK,qBAAqB;AACpD;AAAA,UACF;AAEA,gBAAM,KAAK;AAGX,cAAI,CAAC,GAAG,MAAM;AACZ,mBAAO,KAAK,cAAc,KAAK,gCAAgC;AAAA,UACjE;AAEA,cAAI,GAAG,SAAS,QAAW;AACzB,mBAAO,KAAK,cAAc,KAAK,gCAAgC;AAAA,UACjE,WAAW,OAAO,GAAG,SAAS,UAAU;AACtC,mBAAO,KAAK,cAAc,KAAK,yBAAyB;AAAA,UAC1D,WAAWA,MAAK,WAAW,GAAG,IAAI,GAAG;AACnC,mBAAO,KAAK,cAAc,KAAK,iCAAiC,GAAG,IAAI,EAAE;AAAA,UAC3E;AAEA,cAAI,GAAG,YAAY,QAAW;AAC5B,mBAAO,KAAK,cAAc,KAAK,mCAAmC;AAAA,UACpE,WAAW,OAAO,GAAG,YAAY,WAAW;AAC1C,mBAAO,KAAK,cAAc,KAAK,6BAA6B;AAAA,UAC9D;AAEA,cAAI,CAAC,GAAG,QAAQ;AACd,mBAAO,KAAK,cAAc,KAAK,kCAAkC;AAAA,UACnE,OAAO;AACL,iBAAK,wBAAwB,GAAG,QAAQ,cAAc,KAAK,YAAY,QAAQ,QAAQ;AAAA,UACzF;AAAA,QACF,CAAC;AAAA,MACH;AAAA;AAAA;AAAA;AAAA,MAKQ,wBACN,QACA,QACA,QACA,WACM;AACN,YAAI,CAAC,UAAU,OAAO,WAAW,UAAU;AACzC,iBAAO,KAAK,GAAG,MAAM,oBAAoB;AACzC;AAAA,QACF;AAGA,YAAI,CAAC,MAAM,QAAQ,OAAO,OAAO,GAAG;AAClC,iBAAO,KAAK,GAAG,MAAM,2BAA2B;AAAA,QAClD,OAAO;AACL,iBAAO,QAAQ,QAAQ,CAAC,SAAkB,MAAc;AACtD,gBAAI,OAAO,YAAY,UAAU;AAC/B,qBAAO,KAAK,GAAG,MAAM,YAAY,CAAC,oBAAoB;AAAA,YACxD;AAAA,UACF,CAAC;AAAA,QACH;AAGA,YAAI,CAAC,MAAM,QAAQ,OAAO,OAAO,GAAG;AAClC,iBAAO,KAAK,GAAG,MAAM,2BAA2B;AAAA,QAClD,OAAO;AACL,iBAAO,QAAQ,QAAQ,CAAC,SAAkB,MAAc;AACtD,gBAAI,OAAO,YAAY,UAAU;AAC/B,qBAAO,KAAK,GAAG,MAAM,YAAY,CAAC,oBAAoB;AAAA,YACxD;AAAA,UACF,CAAC;AAAA,QACH;AAAA,MACF;AAAA,IACF;AAGO,IAAM,gBAAgB,IAAI,cAAc;AAAA;AAAA;;;ACvlB/C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,SAAS,YAAY;AACrB,SAAS,iBAAiB;AAC1B,OAAOC,UAAQ;AACf,OAAOC,YAAU;AAUjB,eAAsB,UAAU,SAAmC;AACjE,MAAI;AACF,UAAM,SAASA,OAAK,KAAK,SAAS,MAAM;AACxC,UAAMD,KAAG,OAAO,MAAM;AACtB,WAAO;AAAA,EACT,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AASA,eAAsB,iBAAiB,SAAkC;AACvE,MAAI;AACF,UAAM,EAAE,OAAO,IAAI,MAAM,UAAU,mCAAmC;AAAA,MACpE,KAAK;AAAA,MACL,SAAS;AAAA;AAAA,IACX,CAAC;AACD,WAAO,OAAO,KAAK;AAAA,EACrB,SAAS,OAAO;AACd,UAAM,IAAI,MAAM,iCAAiC,KAAK,EAAE;AAAA,EAC1D;AACF;AASA,eAAsB,iBAAiB,SAAkC;AACvE,MAAI;AACF,UAAM,EAAE,OAAO,IAAI,MAAM,UAAU,sBAAsB;AAAA,MACvD,KAAK;AAAA,MACL,SAAS;AAAA,IACX,CAAC;AACD,WAAO,OAAO,KAAK;AAAA,EACrB,SAAS,OAAO;AACd,UAAM,IAAI,MAAM,iCAAiC,KAAK,EAAE;AAAA,EAC1D;AACF;AAWA,eAAsB,gBACpB,SACA,SACA,OACmB;AACnB,MAAI;AACF,UAAM,EAAE,OAAO,IAAI,MAAM;AAAA,MACvB,wBAAwB,OAAO,MAAM,KAAK;AAAA,MAC1C;AAAA,QACE,KAAK;AAAA,QACL,SAAS;AAAA;AAAA,MACX;AAAA,IACF;AAEA,UAAM,QAAQ,OACX,KAAK,EACL,MAAM,IAAI,EACV,OAAO,OAAO,EACd,IAAI,UAAQC,OAAK,KAAK,SAAS,IAAI,CAAC;AAEvC,WAAO;AAAA,EACT,SAAS,OAAO;AACd,UAAM,IAAI,MAAM,gCAAgC,KAAK,EAAE;AAAA,EACzD;AACF;AAUA,eAAsB,wBACpB,SACA,WACmB;AACnB,MAAI;AACF,UAAM,EAAE,OAAO,IAAI,MAAM;AAAA,MACvB,+CAA+C,SAAS;AAAA,MACxD;AAAA,QACE,KAAK;AAAA,QACL,SAAS;AAAA,MACX;AAAA,IACF;AAEA,UAAM,QAAQ,OACX,KAAK,EACL,MAAM,IAAI,EACV,OAAO,OAAO,EACd,IAAI,UAAQA,OAAK,KAAK,SAAS,IAAI,CAAC;AAEvC,WAAO;AAAA,EACT,SAAS,OAAO;AACd,UAAM,IAAI,MAAM,0CAA0C,KAAK,EAAE;AAAA,EACnE;AACF;AAYA,eAAsB,8BACpB,SACA,YACA,UACmB;AACnB,MAAI;AACF,UAAM,EAAE,OAAO,IAAI,MAAM;AAAA,MACvB,wBAAwB,UAAU,IAAI,QAAQ;AAAA,MAC9C;AAAA,QACE,KAAK;AAAA,QACL,SAAS;AAAA,MACX;AAAA,IACF;AAEA,UAAM,QAAQ,OACX,KAAK,EACL,MAAM,IAAI,EACV,OAAO,OAAO,EACd,IAAI,UAAQA,OAAK,KAAK,SAAS,IAAI,CAAC;AAEvC,WAAO;AAAA,EACT,SAAS,OAAO;AACd,UAAM,IAAI,MAAM,gDAAgD,KAAK,EAAE;AAAA,EACzE;AACF;AAOA,eAAsB,iBAAmC;AACvD,MAAI;AACF,UAAM,UAAU,iBAAiB,EAAE,SAAS,IAAK,CAAC;AAClD,WAAO;AAAA,EACT,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAjLA,IAKM;AALN;AAAA;AAAA;AAKA,IAAM,YAAY,UAAU,IAAI;AAAA;AAAA;;;ACLhC,OAAOC,UAAQ;AACf,OAAOC,YAAU;AAUjB,eAAsB,iBAAiB,WAAkC;AACvE,MAAI;AACF,UAAM,kBAAkBA,OAAK,KAAK,WAAW,YAAY;AACzD,UAAM,YAAY,KAAK,IAAI,EAAE,SAAS;AACtC,UAAMD,KAAG,UAAU,iBAAiB,WAAW,OAAO;AAAA,EACxD,SAAS,OAAO;AAEd,YAAQ,MAAM,0CAA0C,KAAK,EAAE;AAAA,EACjE;AACF;AASA,eAAsB,gBAAgB,WAAoC;AACxE,MAAI;AACF,UAAM,kBAAkBC,OAAK,KAAK,WAAW,YAAY;AACzD,UAAM,UAAU,MAAMD,KAAG,SAAS,iBAAiB,OAAO;AAC1D,UAAM,YAAY,SAAS,QAAQ,KAAK,GAAG,EAAE;AAC7C,WAAO,MAAM,SAAS,IAAI,IAAI;AAAA,EAChC,SAAS,OAAO;AAEd,WAAO;AAAA,EACT;AACF;AAvCA,IAGM;AAHN,IAAAE,gBAAA;AAAA;AAAA;AAGA,IAAM,eAAe;AAAA;AAAA;;;ACHrB,SAAS,YAAY;AACrB,OAAO,YAAY;AACnB,OAAOC,UAAQ;AACf,OAAOC,YAAU;AAUjB,eAAsB,2BACpB,SACA,QACmB;AACnB,QAAM,WAAqB,CAAC;AAG5B,aAAW,aAAa,OAAO,YAAY;AACzC,QAAI,CAAC,UAAU,SAAS;AACtB;AAAA,IACF;AAEA,UAAM,iBAAiB,MAAM,cAAc,SAAS,SAAS;AAC7D,aAAS,KAAK,GAAG,cAAc;AAAA,EACjC;AAEA,SAAO;AACT;AAKA,eAAe,cACb,SACA,WACmB;AACnB,QAAM,gBAAgBA,OAAK,KAAK,SAAS,UAAU,IAAI;AAGvD,QAAM,gBAAgBA,OAAK,KAAK,eAAe,YAAY;AAC3D,MAAI,KAAK,OAAO;AAEhB,MAAI;AACF,UAAM,mBAAmB,MAAMD,KAAG,SAAS,eAAe,OAAO;AACjE,SAAK,OAAO,EAAE,IAAI,gBAAgB;AAAA,EACpC,SAAS,GAAG;AAEV,UAAM,oBAAoBC,OAAK,KAAK,SAAS,YAAY;AACzD,QAAI;AACF,YAAM,mBAAmB,MAAMD,KAAG,SAAS,mBAAmB,OAAO;AACrE,WAAK,OAAO,EAAE,IAAI,gBAAgB;AAAA,IACpC,SAASE,IAAG;AAAA,IAEZ;AAAA,EACF;AAGA,KAAG,IAAI;AAAA,IACL,GAAG,UAAU,OAAO;AAAA,IACpB;AAAA,EACF,CAAC;AAGD,QAAM,WAAqB,CAAC;AAE5B,aAAW,WAAW,UAAU,OAAO,SAAS;AAC9C,UAAM,QAAQ,MAAM,KAAK,SAAS;AAAA,MAChC,KAAK;AAAA,MACL,UAAU;AAAA;AAAA,MACV,OAAO;AAAA,MACP,QAAQ,UAAU,OAAO;AAAA,IAC3B,CAAC;AACD,aAAS,KAAK,GAAG,KAAK;AAAA,EACxB;AAGA,QAAM,cAAc,MAAM,KAAK,IAAI,IAAI,QAAQ,CAAC;AAGhD,SAAO,YACJ,OAAO,UAAQ,CAAC,GAAG,QAAQ,IAAI,CAAC,EAChC,IAAI,UAAQ;AAEX,WAAO,UAAU,SAAS,MACtB,OACAD,OAAK,KAAK,UAAU,MAAM,IAAI;AAAA,EACpC,CAAC;AACL;AAMA,eAAsB,aAAa,SAAyC;AAC1E,QAAM,EAAE,SAAS,kBAAkB,CAAC,GAAG,kBAAkB,CAAC,EAAE,IAAI;AAGhE,QAAM,gBAAgBA,OAAK,KAAK,SAAS,YAAY;AACrD,MAAI,KAAK,OAAO;AAEhB,MAAI;AACF,UAAM,mBAAmB,MAAMD,KAAG,SAAS,eAAe,OAAO;AACjE,SAAK,OAAO,EAAE,IAAI,gBAAgB;AAAA,EACpC,SAAS,GAAG;AAAA,EAEZ;AAGA,KAAG,IAAI;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,GAAG;AAAA,EACL,CAAC;AAGD,QAAM,WAAW,gBAAgB,SAAS,IACtC,kBACA,CAAC,0DAA0D;AAG/D,QAAM,WAAqB,CAAC;AAE5B,aAAW,WAAW,UAAU;AAC9B,UAAM,QAAQ,MAAM,KAAK,SAAS;AAAA,MAChC,KAAK;AAAA,MACL,UAAU;AAAA,MACV,OAAO;AAAA,MACP,QAAQ,CAAC,mBAAmB,SAAS;AAAA,IACvC,CAAC;AACD,aAAS,KAAK,GAAG,KAAK;AAAA,EACxB;AAGA,QAAM,cAAc,MAAM,KAAK,IAAI,IAAI,QAAQ,CAAC;AAGhD,SAAO,YAAY,OAAO,UAAQ;AAChC,UAAM,eAAeC,OAAK,SAAS,SAAS,IAAI;AAChD,WAAO,CAAC,GAAG,QAAQ,YAAY;AAAA,EACjC,CAAC;AACH;AAEO,SAAS,eAAe,UAA0B;AACvD,QAAM,MAAMA,OAAK,QAAQ,QAAQ,EAAE,YAAY;AAE/C,QAAM,cAAsC;AAAA,IAC1C,OAAO;AAAA,IACP,QAAQ;AAAA,IACR,OAAO;AAAA,IACP,QAAQ;AAAA,IACR,QAAQ;AAAA,IACR,QAAQ;AAAA,IACR,QAAQ;AAAA,IACR,OAAO;AAAA,IACP,OAAO;AAAA,IACP,OAAO;AAAA,IACP,SAAS;AAAA,IACT,QAAQ;AAAA,IACR,OAAO;AAAA,IACP,QAAQ;AAAA,IACR,MAAM;AAAA,IACN,MAAM;AAAA,IACN,QAAQ;AAAA,IACR,QAAQ;AAAA,IACR,OAAO;AAAA,IACP,UAAU;AAAA,IACV,OAAO;AAAA,IACP,OAAO;AAAA,IACP,UAAU;AAAA,IACV,WAAW;AAAA,IACX,OAAO;AAAA,IACP,QAAQ;AAAA,IACR,aAAa;AAAA,EACf;AAEA,SAAO,YAAY,GAAG,KAAK;AAC7B;AAxLA;AAAA;AAAA;AAAA;AAAA;;;ACkBO,SAAS,eACd,SACA,UACkB;AAClB,QAAM,UAA4B;AAAA,IAChC,WAAW,CAAC;AAAA,IACZ,SAAS,CAAC;AAAA,IACV,YAAY,CAAC;AAAA,EACf;AAEA,QAAM,iBAAiB,SAAS,YAAY;AAE5C,UAAQ,gBAAgB;AAAA,IACtB,KAAK;AAAA,IACL,KAAK;AACH,cAAQ,YAAY,mBAAmB,OAAO;AAC9C,cAAQ,UAAU,iBAAiB,OAAO;AAC1C,cAAQ,aAAa,oBAAoB,OAAO;AAChD;AAAA,IAEF,KAAK;AAAA,IACL,KAAK;AACH,cAAQ,YAAY,mBAAmB,OAAO;AAC9C,cAAQ,UAAU,iBAAiB,OAAO;AAC1C;AAAA,IAEF,KAAK;AAAA,IACL,KAAK;AACH,cAAQ,YAAY,uBAAuB,OAAO;AAClD,cAAQ,UAAU,qBAAqB,OAAO;AAC9C;AAAA,IAEF,KAAK;AACH,cAAQ,YAAY,oBAAoB,OAAO;AAC/C,cAAQ,UAAU,kBAAkB,OAAO;AAC3C,cAAQ,aAAa,qBAAqB,OAAO;AACjD;AAAA,IAEF,KAAK;AAEH,cAAQ,YAAY,oBAAoB,OAAO;AAC/C,cAAQ,UAAU,qBAAqB,OAAO;AAC9C;AAAA,IAEF,KAAK;AACH,cAAQ,YAAY,mBAAmB,OAAO;AAC9C,cAAQ,aAAa,oBAAoB,OAAO;AAChD;AAAA,IAEF,KAAK;AACH,cAAQ,YAAY,qBAAqB,OAAO;AAChD,cAAQ,UAAU,mBAAmB,OAAO;AAC5C,cAAQ,aAAa,sBAAsB,OAAO;AAClD;AAAA,IAEF,KAAK;AAAA,IACL,KAAK;AACH,cAAQ,YAAY,uBAAuB,OAAO;AAClD,cAAQ,UAAU,qBAAqB,OAAO;AAC9C,cAAQ,aAAa,wBAAwB,OAAO;AACpD;AAAA,IAEF,KAAK;AAAA,IACL,KAAK;AACH,cAAQ,YAAY,qBAAqB,OAAO;AAChD,cAAQ,UAAU,mBAAmB,OAAO;AAC5C;AAAA,IAEF,KAAK;AAAA,IACL,KAAK;AACH,cAAQ,YAAY,qBAAqB,OAAO;AAChD;AAAA,EACJ;AAEA,SAAO;AACT;AAGA,SAAS,mBAAmB,SAA2B;AACrD,QAAM,QAAQ,oBAAI,IAAY;AAG9B,QAAM,kBAAkB,QAAQ,SAAS,qCAAqC;AAC9E,aAAW,SAAS,iBAAiB;AACnC,UAAM,IAAI,MAAM,CAAC,CAAC;AAAA,EACpB;AAGA,QAAM,eAAe,QAAQ,SAAS,8DAA8D;AACpG,aAAW,SAAS,cAAc;AAChC,UAAM,IAAI,MAAM,CAAC,CAAC;AAAA,EACpB;AAGA,QAAM,gBAAgB,QAAQ,SAAS,wCAAwC;AAC/E,aAAW,SAAS,eAAe;AAEjC,QAAI,CAAC,CAAC,MAAM,OAAO,SAAS,UAAU,OAAO,EAAE,SAAS,MAAM,CAAC,CAAC,GAAG;AACjE,YAAM,IAAI,MAAM,CAAC,CAAC;AAAA,IACpB;AAAA,EACF;AAGA,QAAM,gBAAgB,QAAQ,SAAS,8CAA8C;AACrF,aAAW,SAAS,eAAe;AACjC,UAAM,IAAI,MAAM,CAAC,CAAC;AAAA,EACpB;AAEA,SAAO,MAAM,KAAK,KAAK;AACzB;AAEA,SAAS,mBAAmB,SAA2B;AACrD,SAAO,mBAAmB,OAAO;AACnC;AAEA,SAAS,iBAAiB,SAA2B;AACnD,QAAM,QAAQ,oBAAI,IAAY;AAG9B,QAAM,eAAe,QAAQ,SAAS,8CAA8C;AACpF,aAAW,SAAS,cAAc;AAChC,UAAM,IAAI,MAAM,CAAC,CAAC;AAAA,EACpB;AAEA,SAAO,MAAM,KAAK,KAAK;AACzB;AAEA,SAAS,iBAAiB,SAA2B;AACnD,SAAO,iBAAiB,OAAO;AACjC;AAEA,SAAS,oBAAoB,SAA2B;AACtD,QAAM,QAAQ,oBAAI,IAAY;AAG9B,QAAM,mBAAmB,QAAQ,SAAS,kCAAkC;AAC5E,aAAW,SAAS,kBAAkB;AACpC,UAAM,IAAI,MAAM,CAAC,CAAC;AAAA,EACpB;AAGA,QAAM,cAAc,QAAQ,SAAS,iCAAiC;AACtE,aAAW,SAAS,aAAa;AAC/B,UAAM,IAAI,MAAM,CAAC,CAAC;AAAA,EACpB;AAEA,SAAO,MAAM,KAAK,KAAK;AACzB;AAGA,SAAS,uBAAuB,SAA2B;AACzD,QAAM,QAAQ,oBAAI,IAAY;AAG9B,QAAM,kBAAkB,QAAQ,SAAS,mBAAmB;AAC5D,aAAW,SAAS,iBAAiB;AACnC,UAAM,IAAI,MAAM,CAAC,CAAC;AAAA,EACpB;AAGA,QAAM,eAAe,QAAQ,SAAS,2BAA2B;AACjE,aAAW,SAAS,cAAc;AAChC,UAAM,IAAI,MAAM,CAAC,CAAC;AAAA,EACpB;AAEA,SAAO,MAAM,KAAK,KAAK;AACzB;AAEA,SAAS,qBAAqB,SAA2B;AACvD,QAAM,QAAQ,oBAAI,IAAY;AAG9B,QAAM,eAAe,QAAQ,SAAS,2BAA2B;AACjE,aAAW,SAAS,cAAc;AAChC,UAAM,IAAI,MAAM,CAAC,CAAC;AAAA,EACpB;AAEA,SAAO,MAAM,KAAK,KAAK;AACzB;AAGA,SAAS,oBAAoB,SAA2B;AACtD,QAAM,QAAQ,oBAAI,IAAY;AAG9B,QAAM,kBAAkB,QAAQ,SAAS,wDAAwD;AACjG,aAAW,SAAS,iBAAiB;AACnC,UAAM,IAAI,MAAM,CAAC,CAAC;AAAA,EACpB;AAEA,SAAO,MAAM,KAAK,KAAK;AACzB;AAEA,SAAS,kBAAkB,SAA2B;AACpD,QAAM,QAAQ,oBAAI,IAAY;AAG9B,QAAM,eAAe,QAAQ,SAAS,gCAAgC;AACtE,aAAW,SAAS,cAAc;AAChC,UAAM,IAAI,MAAM,CAAC,CAAC;AAAA,EACpB;AAEA,SAAO,MAAM,KAAK,KAAK;AACzB;AAEA,SAAS,qBAAqB,SAA2B;AACvD,QAAM,QAAQ,oBAAI,IAAY;AAG9B,QAAM,mBAAmB,QAAQ,SAAS,oBAAoB;AAC9D,aAAW,SAAS,kBAAkB;AACpC,UAAM,IAAI,MAAM,CAAC,CAAC;AAAA,EACpB;AAGA,QAAM,eAAe,QAAQ,SAAS,gBAAgB;AACtD,aAAW,SAAS,cAAc;AAChC,UAAM,IAAI,MAAM,CAAC,CAAC;AAAA,EACpB;AAEA,SAAO,MAAM,KAAK,KAAK;AACzB;AAGA,SAAS,mBAAmB,SAA2B;AACrD,QAAM,QAAQ,oBAAI,IAAY;AAG9B,QAAM,kBAAkB,QAAQ,SAAS,4CAA4C;AACrF,aAAW,SAAS,iBAAiB;AACnC,UAAM,IAAI,MAAM,CAAC,CAAC;AAAA,EACpB;AAEA,SAAO,MAAM,KAAK,KAAK;AACzB;AAEA,SAAS,oBAAoB,SAA2B;AACtD,QAAM,QAAQ,oBAAI,IAAY;AAG9B,QAAM,mBAAmB,QAAQ,SAAS,gCAAgC;AAC1E,aAAW,SAAS,kBAAkB;AACpC,UAAM,IAAI,MAAM,CAAC,CAAC;AAAA,EACpB;AAGA,QAAM,gBAAgB,QAAQ,SAAS,6BAA6B;AACpE,aAAW,SAAS,eAAe;AACjC,UAAM,IAAI,MAAM,CAAC,CAAC;AAAA,EACpB;AAEA,SAAO,MAAM,KAAK,KAAK;AACzB;AAGA,SAAS,qBAAqB,SAA2B;AACvD,QAAM,QAAQ,oBAAI,IAAY;AAG9B,QAAM,gBAAgB,QAAQ,SAAS,gFAAgF;AACvH,aAAW,SAAS,eAAe;AACjC,UAAM,IAAI,MAAM,CAAC,CAAC;AAAA,EACpB;AAEA,SAAO,MAAM,KAAK,KAAK;AACzB;AAEA,SAAS,mBAAmB,SAA2B;AACrD,QAAM,QAAQ,oBAAI,IAAY;AAG9B,QAAM,eAAe,QAAQ,SAAS,8CAA8C;AACpF,aAAW,SAAS,cAAc;AAChC,UAAM,IAAI,MAAM,CAAC,CAAC;AAAA,EACpB;AAEA,SAAO,MAAM,KAAK,KAAK;AACzB;AAEA,SAAS,sBAAsB,SAA2B;AACxD,QAAM,QAAQ,oBAAI,IAAY;AAG9B,QAAM,mBAAmB,QAAQ,SAAS,kCAAkC;AAC5E,aAAW,SAAS,kBAAkB;AACpC,UAAM,IAAI,MAAM,CAAC,CAAC;AAAA,EACpB;AAEA,SAAO,MAAM,KAAK,KAAK;AACzB;AAGA,SAAS,uBAAuB,SAA2B;AACzD,QAAM,QAAQ,oBAAI,IAAY;AAG9B,QAAM,gBAAgB,QAAQ,SAAS,sGAAsG;AAC7I,aAAW,SAAS,eAAe;AACjC,UAAM,IAAI,MAAM,CAAC,CAAC;AAAA,EACpB;AAEA,SAAO,MAAM,KAAK,KAAK;AACzB;AAEA,SAAS,qBAAqB,SAA2B;AACvD,QAAM,QAAQ,oBAAI,IAAY;AAG9B,QAAM,eAAe,QAAQ,SAAS,uDAAuD;AAC7F,aAAW,SAAS,cAAc;AAChC,UAAM,IAAI,MAAM,CAAC,CAAC;AAAA,EACpB;AAEA,SAAO,MAAM,KAAK,KAAK;AACzB;AAEA,SAAS,wBAAwB,SAA2B;AAC1D,QAAM,QAAQ,oBAAI,IAAY;AAG9B,QAAM,mBAAmB,QAAQ,SAAS,2CAA2C;AACrF,aAAW,SAAS,kBAAkB;AACpC,UAAM,IAAI,MAAM,CAAC,CAAC;AAAA,EACpB;AAEA,SAAO,MAAM,KAAK,KAAK;AACzB;AAGA,SAAS,qBAAqB,SAA2B;AACvD,QAAM,QAAQ,oBAAI,IAAY;AAG9B,QAAM,gBAAgB,QAAQ,SAAS,yBAAyB;AAChE,aAAW,SAAS,eAAe;AACjC,UAAM,IAAI,MAAM,CAAC,CAAC;AAAA,EACpB;AAEA,SAAO,MAAM,KAAK,KAAK;AACzB;AAEA,SAAS,mBAAmB,SAA2B;AACrD,QAAM,QAAQ,oBAAI,IAAY;AAG9B,QAAM,eAAe,QAAQ,SAAS,gBAAgB;AACtD,aAAW,SAAS,cAAc;AAChC,UAAM,IAAI,MAAM,CAAC,CAAC;AAAA,EACpB;AAGA,QAAM,gBAAgB,QAAQ,SAAS,iBAAiB;AACxD,aAAW,SAAS,eAAe;AACjC,UAAM,IAAI,MAAM,CAAC,CAAC;AAAA,EACpB;AAEA,SAAO,MAAM,KAAK,KAAK;AACzB;AAGA,SAAS,qBAAqB,SAA2B;AACvD,QAAM,QAAQ,oBAAI,IAAY;AAG9B,QAAM,kBAAkB,QAAQ,SAAS,6BAA6B;AACtE,aAAW,SAAS,iBAAiB;AACnC,UAAM,IAAI,MAAM,CAAC,CAAC;AAAA,EACpB;AAGA,QAAM,gBAAgB,QAAQ,SAAS,4BAA4B;AACnE,aAAW,SAAS,eAAe;AACjC,UAAM,IAAI,MAAM,CAAC,CAAC;AAAA,EACpB;AAGA,QAAM,eAAe,QAAQ,SAAS,2BAA2B;AACjE,aAAW,SAAS,cAAc;AAChC,UAAM,IAAI,MAAM,CAAC,CAAC;AAAA,EACpB;AAEA,SAAO,MAAM,KAAK,KAAK;AACzB;AAGA,SAAS,oBAAoB,SAA2B;AACtD,QAAM,QAAQ,oBAAI,IAAY;AAG9B,QAAM,cAAc,QAAQ,MAAM,mCAAmC;AACrE,MAAI,CAAC,YAAa,QAAO,CAAC;AAE1B,QAAM,gBAAgB,YAAY,CAAC;AAGnC,QAAM,qBAAqB,cAAc,SAAS,iCAAiC;AACnF,aAAW,SAAS,oBAAoB;AACtC,UAAM,IAAI,MAAM,CAAC,CAAC;AAAA,EACpB;AAGA,QAAM,gBAAgB,cAAc,SAAS,wBAAwB;AACrE,aAAW,SAAS,eAAe;AACjC,UAAM,IAAI,MAAM,CAAC,CAAC;AAAA,EACpB;AAEA,SAAO,MAAM,KAAK,KAAK;AACzB;AAGA,SAAS,qBAAqB,SAA2B;AACvD,QAAM,QAAQ,oBAAI,IAAY;AAG9B,QAAM,cAAc,QAAQ,MAAM,mCAAmC;AACrE,MAAI,CAAC,YAAa,QAAO,CAAC;AAE1B,QAAM,gBAAgB,YAAY,CAAC;AAGnC,QAAM,YAAY,cAAc,MAAM,uBAAuB;AAC7D,MAAI,WAAW;AACb,UAAM,IAAI,UAAU,CAAC,CAAC;AAAA,EACxB;AAGA,QAAM,uBAAuB,cAAc,MAAM,sBAAsB;AACvE,MAAI,sBAAsB;AACxB,UAAM,IAAI,cAAc;AAAA,EAC1B;AAEA,SAAO,MAAM,KAAK,KAAK;AACzB;AAlcA;AAAA;AAAA;AAAA;AAAA;;;ACAA,OAAO,YAAY;AACnB,OAAO,gBAAgB;AACvB,OAAO,gBAAgB;AACvB,OAAO,eAAe;AACtB,OAAO,YAAY;AACnB,SAAS,eAAe;AA2BxB,SAAS,UAAU,UAAqC;AACtD,MAAI,CAAC,YAAY,IAAI,QAAQ,GAAG;AAC9B,UAAM,SAAS,IAAI,OAAO;AAC1B,UAAM,UAAU,eAAe,QAAQ;AAEvC,QAAI,CAAC,SAAS;AACZ,YAAM,IAAI,MAAM,sCAAsC,QAAQ,EAAE;AAAA,IAClE;AAEA,WAAO,YAAY,OAAO;AAC1B,gBAAY,IAAI,UAAU,MAAM;AAAA,EAClC;AAEA,SAAO,YAAY,IAAI,QAAQ;AACjC;AAMO,SAASE,gBAAe,UAA4C;AAGzE,QAAM,MAAM,QAAQ,QAAQ,EAAE,MAAM,CAAC,EAAE,YAAY;AAEnD,UAAQ,KAAK;AAAA,IACX,KAAK;AAAA,IACL,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AACH,aAAO;AAAA,IACT;AACE,aAAO;AAAA,EACX;AACF;AAKO,SAAS,eAAe,UAA2B;AACxD,SAAOA,gBAAe,QAAQ,MAAM;AACtC;AAaO,SAAS,SAAS,SAAiB,UAA6C;AACrF,MAAI;AACF,UAAM,SAAS,UAAU,QAAQ;AACjC,UAAM,OAAO,OAAO,MAAM,OAAO;AAGjC,QAAI,KAAK,SAAS,UAAU;AAC1B,aAAO;AAAA,QACL;AAAA,QACA,OAAO;AAAA,MACT;AAAA,IACF;AAEA,WAAO,EAAE,KAAK;AAAA,EAChB,SAAS,OAAO;AACd,WAAO;AAAA,MACL,MAAM;AAAA,MACN,OAAO,iBAAiB,QAAQ,MAAM,UAAU;AAAA,IAClD;AAAA,EACF;AACF;AAjHA,IAWM,aAWA;AAtBN;AAAA;AAAA;AAWA,IAAM,cAAc,oBAAI,IAA+B;AAWvD,IAAM,iBAAgE;AAAA,MACpE,YAAY,WAAW;AAAA,MACvB,YAAY;AAAA,MACZ,KAAK,UAAU;AAAA;AAAA,MACf,QAAQ;AAAA,IACV;AAAA;AAAA;;;ACcO,SAAS,oBAAoB,MAAiC;AACnE,MAAI,aAAa;AAEjB,WAAS,SAAS,GAAsB;AACtC,QAAI,gBAAgB,SAAS,EAAE,IAAI,GAAG;AAEpC,UAAI,EAAE,SAAS,qBAAqB;AAClC,cAAM,WAAW,EAAE,kBAAkB,UAAU;AAC/C,YAAI,aAAa,SAAS,SAAS,QAAQ,SAAS,SAAS,OAAO;AAClE;AAAA,QACF;AAAA,MACF,OAAO;AACL;AAAA,MACF;AAAA,IACF;AAGA,aAAS,IAAI,GAAG,IAAI,EAAE,iBAAiB,KAAK;AAC1C,YAAM,QAAQ,EAAE,WAAW,CAAC;AAC5B,UAAI,MAAO,UAAS,KAAK;AAAA,IAC3B;AAAA,EACF;AAEA,WAAS,IAAI;AACb,SAAO;AACT;AAlEA,IAOM;AAPN;AAAA;AAAA;AAOA,IAAM,kBAAkB;AAAA;AAAA,MAEtB;AAAA;AAAA,MACA;AAAA;AAAA,MACA;AAAA;AAAA,MACA;AAAA;AAAA,MACA;AAAA;AAAA,MACA;AAAA;AAAA,MACA;AAAA;AAAA;AAAA,MAGA;AAAA;AAAA,MACA;AAAA;AAAA,MACA;AAAA;AAAA;AAAA,MAGA;AAAA;AAAA;AAAA,MAGA;AAAA;AAAA;AAAA,MAEA;AAAA;AAAA,MACA;AAAA;AAAA,IACF;AAAA;AAAA;;;ACLA,SAAS,mBAAmB,MAAwC;AAClE,MAAI,KAAK,SAAS,uBAAuB,KAAK,SAAS,oBAAoB;AACzE,WAAO;AAAA,EACT;AACA,QAAM,WAAW,KAAK,kBAAkB,UAAU;AAClD,QAAM,SAAS,UAAU;AAEzB,MAAI,WAAW,QAAQ,WAAW,MAAO,QAAO;AAChD,MAAI,WAAW,QAAQ,WAAW,KAAM,QAAO;AAC/C,SAAO;AACT;AAKA,SAAS,qBACP,QACA,OACA,cACQ;AACR,QAAM,cAAc,OAAO,kBAAkB,WAAW,MAAM;AAC9D,QAAM,eAAe,kBAAkB,IAAI,MAAM,IAAI;AACrD,SAAQ,CAAC,eAAe,CAAC,eAAgB,eAAe,IAAI;AAC9D;AAKA,SAAS,yBAAyB,UAAkB,cAA8B;AAChF,SAAQ,aAAa,IAAI,QAAQ,KAAK,eAAe,IAAK,IAAI;AAChE;AAGA,SAAS,wBACP,GACA,OACA,IACA,KACM;AACN,QAAM,WAAW,EAAE,kBAAkB,UAAU;AAC/C,WAAS,IAAI,GAAG,IAAI,EAAE,iBAAiB,KAAK;AAC1C,UAAM,QAAQ,EAAE,WAAW,CAAC;AAC5B,QAAI,SAAS,UAAU,SAAU,KAAI,SAAS,OAAO,OAAO,EAAE;AAAA,EAChE;AACF;AAGA,SAAS,wBACP,GACA,OACA,KACM;AACN,WAAS,IAAI,GAAG,IAAI,EAAE,iBAAiB,KAAK;AAC1C,UAAM,QAAQ,EAAE,WAAW,CAAC;AAC5B,QAAI,MAAO,KAAI,SAAS,OAAO,qBAAqB,GAAG,OAAO,KAAK,GAAG,IAAI;AAAA,EAC5E;AACF;AAGA,SAAS,oBACP,GACA,OACA,KACM;AACN,WAAS,IAAI,GAAG,IAAI,EAAE,iBAAiB,KAAK;AAC1C,UAAM,QAAQ,EAAE,WAAW,CAAC;AAC5B,QAAI,MAAO,KAAI,SAAS,OAAO,OAAO,IAAI;AAAA,EAC5C;AACF;AAeO,SAAS,6BAA6B,MAAiC;AAC5E,MAAI,aAAa;AACjB,QAAM,MAAwB,EAAE,SAAS;AAEzC,WAAS,SAAS,GAAsB,cAAsB,eAAoC;AAChG,UAAM,YAAY,mBAAmB,CAAC;AAEtC,QAAI,WAAW;AACb,oBAAe,kBAAkB,YAAa,IAAI;AAClD,8BAAwB,GAAG,cAAc,WAAW,GAAG;AACvD;AAAA,IACF;AAEA,QAAI,cAAc,IAAI,EAAE,IAAI,GAAG;AAC7B,oBAAc,IAAI;AAClB,8BAAwB,GAAG,cAAc,GAAG;AAC5C;AAAA,IACF;AAEA,QAAI,kBAAkB,IAAI,EAAE,IAAI,GAAG;AACjC,oBAAc;AACd,0BAAoB,GAAG,eAAe,GAAG,GAAG;AAC5C;AAAA,IACF;AAEA,kBAAc,yBAAyB,EAAE,MAAM,YAAY;AAC3D,wBAAoB,GAAG,cAAc,GAAG;AAAA,EAC1C;AAEA,WAAS,MAAM,GAAG,IAAI;AACtB,SAAO;AACT;AA3IA,IAGM,eAOA,mBAKA;AAfN;AAAA;AAAA;AAGA,IAAM,gBAAgB,oBAAI,IAAI;AAAA,MAC5B;AAAA,MAAgB;AAAA,MAAiB;AAAA,MAAmB;AAAA,MACpD;AAAA,MAAgB;AAAA,MAAiB;AAAA,MAAgB;AAAA,MACjD;AAAA,MAAoB;AAAA,MAAqB;AAAA,IAC3C,CAAC;AAGD,IAAM,oBAAoB,oBAAI,IAAI;AAAA,MAChC;AAAA,MAAe;AAAA,MAAe;AAAA,MAAsB;AAAA,IACtD,CAAC;AAGD,IAAM,eAAe,oBAAI,IAAI,CAAC,kBAAkB,uBAAuB,QAAQ,CAAC;AAAA;AAAA;;;ACgKhF,SAAS,mBAAmB,UAA+B;AACzD,SAAO,iBAAiB,QAAQ,KAAK,iBAAiB;AACxD;AAKA,SAAS,oBAAoB,UAA+B;AAC1D,SAAO,kBAAkB,QAAQ,KAAK,kBAAkB;AAC1D;AAKA,SAAS,WAAW,MAAyB,UAA2B;AACtE,QAAM,WAAW,KAAK;AACtB,QAAM,WAAW,KAAK;AAGtB,MAAI,oBAAoB,IAAI,QAAQ,GAAG;AACrC,WAAO;AAAA,EACT;AAGA,QAAM,UAAU,mBAAmB,QAAQ;AAC3C,QAAM,WAAW,oBAAoB,QAAQ;AAE7C,SAAO,QAAQ,IAAI,QAAQ,KAAK,SAAS,IAAI,QAAQ;AACvD;AAKA,SAAS,UAAU,MAAkC;AACnD,SAAO,mBAAmB,IAAI,KAAK,IAAI;AACzC;AAKA,SAAS,eAAe,MAAiC;AAEvD,MAAI,oBAAoB,IAAI,KAAK,IAAI,GAAG;AAEtC,UAAM,WAAW,KAAK,kBAAkB,UAAU;AAClD,QAAI,UAAU;AACZ,aAAO,SAAS;AAAA,IAClB;AACA,WAAO,KAAK;AAAA,EACd;AACA,SAAO,KAAK;AACd;AAKA,SAAS,cAAc,MAAiC;AACtD,SAAO,KAAK;AACd;AAKA,SAAS,UAAU,KAAkC;AACnD,MAAI,MAAM;AACV,aAAW,SAAS,IAAI,OAAO,GAAG;AAChC,WAAO;AAAA,EACT;AACA,SAAO;AACT;AASO,SAAS,cAAc,MAAyB,UAAkC;AACvF,QAAM,YAAY,oBAAI,IAAoB;AAC1C,QAAM,WAAW,oBAAI,IAAoB;AAEzC,WAAS,SAAS,GAA4B;AAE5C,QAAI,WAAW,GAAG,QAAQ,GAAG;AAC3B,YAAM,MAAM,eAAe,CAAC;AAC5B,gBAAU,IAAI,MAAM,UAAU,IAAI,GAAG,KAAK,KAAK,CAAC;AAAA,IAClD;AAGA,QAAI,UAAU,CAAC,GAAG;AAChB,YAAM,MAAM,cAAc,CAAC;AAC3B,eAAS,IAAI,MAAM,SAAS,IAAI,GAAG,KAAK,KAAK,CAAC;AAAA,IAChD;AAGA,eAAW,SAAS,EAAE,UAAU;AAC9B,eAAS,KAAK;AAAA,IAChB;AAAA,EACF;AAEA,WAAS,IAAI;AAEb,SAAO;AAAA,IACL,IAAI,UAAU;AAAA,IACd,IAAI,SAAS;AAAA,IACb,IAAI,UAAU,SAAS;AAAA,IACvB,IAAI,UAAU,QAAQ;AAAA,IACtB;AAAA,IACA;AAAA,EACF;AACF;AAiBO,SAAS,yBAAyB,QAAyC;AAChF,QAAM,EAAE,IAAI,IAAI,IAAI,GAAG,IAAI;AAE3B,QAAM,aAAa,KAAK;AACxB,QAAM,SAAS,KAAK;AAGpB,QAAM,SAAS,aAAa,IAAI,SAAS,KAAK,KAAK,UAAU,IAAI;AACjE,QAAM,aAAa,KAAK,IAAK,KAAK,KAAM,KAAK,MAAM;AACnD,QAAM,SAAS,aAAa;AAC5B,QAAM,OAAO,SAAS;AACtB,QAAM,OAAO,SAAS;AAEtB,SAAO;AAAA,IACL,YAAY,KAAK,MAAM,UAAU;AAAA,IACjC,QAAQ,KAAK,MAAM,MAAM;AAAA,IACzB,QAAQ,KAAK,MAAM,SAAS,GAAG,IAAI;AAAA,IACnC,YAAY,KAAK,MAAM,aAAa,GAAG,IAAI;AAAA,IAC3C,QAAQ,KAAK,MAAM,MAAM;AAAA,IACzB,MAAM,KAAK,MAAM,IAAI;AAAA,IACrB,MAAM,KAAK,MAAM,OAAO,GAAI,IAAI;AAAA,EAClC;AACF;AAWO,SAAS,kBAAkB,MAAyB,UAAmC;AAC5F,QAAM,SAAS,cAAc,MAAM,QAAQ;AAC3C,SAAO,yBAAyB,MAAM;AACxC;AAnVA,IA2BM,kBAyDA,mBAkCA,qBA2BA;AAjJN;AAAA;AAAA;AA2BA,IAAM,mBAAgD;AAAA,MACpD,YAAY,oBAAI,IAAI;AAAA;AAAA,QAElB;AAAA,QAAK;AAAA,QAAK;AAAA,QAAK;AAAA,QAAK;AAAA,QAAK;AAAA;AAAA,QAEzB;AAAA,QAAM;AAAA,QAAO;AAAA,QAAM;AAAA,QAAO;AAAA,QAAK;AAAA,QAAK;AAAA,QAAM;AAAA;AAAA,QAE1C;AAAA,QAAM;AAAA,QAAM;AAAA,QAAK;AAAA;AAAA,QAEjB;AAAA,QAAK;AAAA,QAAM;AAAA,QAAM;AAAA,QAAM;AAAA,QAAM;AAAA,QAAM;AAAA,QAAO;AAAA,QAAO;AAAA,QAAO;AAAA;AAAA,QAExD;AAAA,QAAK;AAAA,QAAK;AAAA,QAAK;AAAA,QAAK;AAAA,QAAM;AAAA,QAAM;AAAA,QAChC;AAAA,QAAM;AAAA,QAAM;AAAA,QAAM;AAAA,QAAO;AAAA,QAAO;AAAA;AAAA,QAEhC;AAAA,QAAK;AAAA,QAAK;AAAA,QAAK;AAAA,QAAM;AAAA,QAAM;AAAA,QAAM;AAAA,QAAO;AAAA;AAAA,QAExC;AAAA,QAAK;AAAA,QAAK;AAAA,QAAK;AAAA,QAAK;AAAA,QAAK;AAAA,MAC3B,CAAC;AAAA,MACD,QAAQ,oBAAI,IAAI;AAAA;AAAA,QAEd;AAAA,QAAK;AAAA,QAAK;AAAA,QAAK;AAAA,QAAK;AAAA,QAAK;AAAA,QAAM;AAAA;AAAA,QAE/B;AAAA,QAAM;AAAA,QAAM;AAAA,QAAK;AAAA,QAAK;AAAA,QAAM;AAAA;AAAA;AAAA,QAG5B;AAAA,QAAK;AAAA,QAAM;AAAA,QAAM;AAAA,QAAM;AAAA,QAAM;AAAA,QAAM;AAAA,QAAO;AAAA,QAC1C;AAAA,QAAM;AAAA,QAAM;AAAA,QAAM;AAAA,QAAO;AAAA;AAAA,QAEzB;AAAA,QAAK;AAAA,QAAK;AAAA,QAAK;AAAA,QAAK;AAAA,QAAM;AAAA;AAAA,QAE1B;AAAA,QAAK;AAAA,QAAK;AAAA,QAAM;AAAA,QAChB;AAAA,QAAK;AAAA,QAAK;AAAA,QAAK;AAAA,QAAK;AAAA,QAAK;AAAA,MAC3B,CAAC;AAAA,MACD,KAAK,oBAAI,IAAI;AAAA;AAAA,QAEX;AAAA,QAAK;AAAA,QAAK;AAAA,QAAK;AAAA,QAAK;AAAA,QAAK;AAAA;AAAA,QAEzB;AAAA,QAAM;AAAA,QAAO;AAAA,QAAM;AAAA,QAAO;AAAA,QAAM;AAAA,QAAK;AAAA,QAAK;AAAA,QAAM;AAAA,QAAM;AAAA;AAAA,QAEtD;AAAA,QAAM;AAAA,QAAM;AAAA,QAAK;AAAA,QAAO;AAAA,QAAM;AAAA;AAAA,QAE9B;AAAA,QAAK;AAAA,QAAM;AAAA,QAAM;AAAA,QAAM;AAAA,QAAM;AAAA,QAAM;AAAA,QAAO;AAAA,QAC1C;AAAA,QAAM;AAAA,QAAM;AAAA,QAAM;AAAA,QAAO;AAAA,QAAO;AAAA;AAAA,QAEhC;AAAA,QAAK;AAAA,QAAK;AAAA,QAAK;AAAA,QAAK;AAAA,QAAM;AAAA;AAAA,QAE1B;AAAA;AAAA,QAEA;AAAA,QAAK;AAAA,QAAK;AAAA,QAAM;AAAA,QAAM;AAAA,QAAM;AAAA,QAAM;AAAA,QAClC;AAAA,QAAK;AAAA,QAAK;AAAA,QAAK;AAAA,QAAK;AAAA,QAAK;AAAA,MAC3B,CAAC;AAAA,IACH;AAMA,IAAM,oBAAiD;AAAA,MACrD,YAAY,oBAAI,IAAI;AAAA,QAClB;AAAA,QAAM;AAAA,QAAQ;AAAA,QAAO;AAAA,QAAS;AAAA,QAAM;AAAA,QAAU;AAAA,QAAQ;AAAA,QACtD;AAAA,QAAU;AAAA,QAAS;AAAA,QAAO;AAAA,QAAS;AAAA,QACnC;AAAA,QAAO;AAAA,QAAU;AAAA,QAAU;AAAA,QAAc;AAAA,QAAM;AAAA,QAC/C;AAAA,QAAS;AAAA,QAAS;AAAA,QAAS;AAAA,QAC3B;AAAA,QAAS;AAAA,QAAO;AAAA,QAAO;AAAA,QAAY;AAAA,QAAS;AAAA,QAAW;AAAA,QACvD;AAAA,QAAU;AAAA,QAAU;AAAA,QAAQ;AAAA,MAC9B,CAAC;AAAA,MACD,QAAQ,oBAAI,IAAI;AAAA,QACd;AAAA,QAAM;AAAA,QAAQ;AAAA,QAAQ;AAAA,QAAO;AAAA,QAAS;AAAA,QAAS;AAAA,QAC/C;AAAA,QAAU;AAAA,QAAS;AAAA,QAAO;AAAA,QAAU;AAAA,QACpC;AAAA,QAAO;AAAA,QAAM;AAAA,QAAO;AAAA,QAAM;AAAA,QAC1B;AAAA,QAAS;AAAA,QAAS;AAAA,QAAS;AAAA,QAAY;AAAA,QACvC;AAAA,QAAO;AAAA,QAAS;AAAA,QAAU;AAAA,QAC1B;AAAA,QAAU;AAAA,QAAQ;AAAA,QAAM;AAAA,QACxB;AAAA,QAAU;AAAA,QAAY;AAAA,QAAO;AAAA,MAC/B,CAAC;AAAA,MACD,KAAK,oBAAI,IAAI;AAAA,QACX;AAAA,QAAM;AAAA,QAAU;AAAA,QAAQ;AAAA,QAAO;AAAA,QAAW;AAAA,QAAS;AAAA,QAAM;AAAA,QAAU;AAAA,QAAQ;AAAA,QAAW;AAAA,QACtF;AAAA,QAAU;AAAA,QAAS;AAAA,QAAO;AAAA,QAAS;AAAA,QACnC;AAAA,QAAO;AAAA,QAAS;AAAA,QAChB;AAAA,QAAS;AAAA,QAAS;AAAA,QAClB;AAAA,QAAY;AAAA,QAAS;AAAA,QAAW;AAAA,QAAc;AAAA,QAAS;AAAA,QACvD;AAAA,QAAO;AAAA,QAAa;AAAA,QACpB;AAAA,QAAQ;AAAA,QAAS;AAAA,QAAW;AAAA,QAAW;AAAA,QAAgB;AAAA,QACvD;AAAA,QAAU;AAAA,QAAU;AAAA,QAAS;AAAA,QAAU;AAAA,QAAW;AAAA,QAAa;AAAA,MACjE,CAAC;AAAA,IACH;AAMA,IAAM,sBAAsB,oBAAI,IAAI;AAAA;AAAA,MAElC;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA;AAAA,MAGA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA;AAAA,MAGA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF,CAAC;AAKD,IAAM,qBAAqB,oBAAI,IAAI;AAAA;AAAA,MAEjC;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA;AAAA,MAGA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA;AAAA,MAGA;AAAA,MACA;AAAA,MACA;AAAA,IACF,CAAC;AAAA;AAAA;;;AC1KD;AAAA;AAAA;AASA;AACA;AACA;AAAA;AAAA;;;ACKA,SAAS,oBACP,MACA,SACA,aACmB;AACjB,QAAM,WAAW,KAAK,kBAAkB,MAAM;AAC9C,MAAI,CAAC,SAAU,QAAO;AAEtB,SAAO;AAAA,IACL,MAAM,SAAS;AAAA,IACf,MAAM,cAAc,WAAW;AAAA,IAC/B,WAAW,KAAK,cAAc,MAAM;AAAA,IACpC,SAAS,KAAK,YAAY,MAAM;AAAA,IAChC;AAAA,IACA,WAAW,iBAAiB,MAAM,OAAO;AAAA,IACzC,YAAY,kBAAkB,MAAM,OAAO;AAAA,IAC3C,YAAY,kBAAkB,MAAM,OAAO;AAAA,IAC3C,YAAY,oBAAoB,IAAI;AAAA,EACtC;AACF;AAKF,SAAS,yBACP,MACA,SACA,aACmB;AAEjB,QAAM,SAAS,KAAK;AACpB,MAAI,OAAO;AAEX,MAAI,QAAQ,SAAS,uBAAuB;AAC1C,UAAM,WAAW,OAAO,kBAAkB,MAAM;AAChD,WAAO,UAAU,QAAQ;AAAA,EAC3B;AAEA,SAAO;AAAA,IACL;AAAA,IACA,MAAM,cAAc,WAAW;AAAA,IAC/B,WAAW,KAAK,cAAc,MAAM;AAAA,IACpC,SAAS,KAAK,YAAY,MAAM;AAAA,IAChC;AAAA,IACA,WAAW,iBAAiB,MAAM,OAAO;AAAA,IACzC,YAAY,kBAAkB,MAAM,OAAO;AAAA,IAC3C,YAAY,oBAAoB,IAAI;AAAA,EACtC;AACF;AAKF,SAAS,kBACP,MACA,SACA,aACmB;AACjB,QAAM,WAAW,KAAK,kBAAkB,MAAM;AAC9C,MAAI,CAAC,SAAU,QAAO;AAEtB,SAAO;AAAA,IACL,MAAM,SAAS;AAAA,IACf,MAAM;AAAA,IACN,WAAW,KAAK,cAAc,MAAM;AAAA,IACpC,SAAS,KAAK,YAAY,MAAM;AAAA,IAChC;AAAA,IACA,WAAW,iBAAiB,MAAM,OAAO;AAAA,IACzC,YAAY,kBAAkB,MAAM,OAAO;AAAA,IAC3C,YAAY,kBAAkB,MAAM,OAAO;AAAA,IAC3C,YAAY,oBAAoB,IAAI;AAAA,EACtC;AACF;AAKF,SAAS,iBACP,MACA,UACA,cACmB;AACjB,QAAM,WAAW,KAAK,kBAAkB,MAAM;AAC9C,MAAI,CAAC,SAAU,QAAO;AAEtB,SAAO;AAAA,IACL,MAAM,SAAS;AAAA,IACf,MAAM;AAAA,IACN,WAAW,KAAK,cAAc,MAAM;AAAA,IACpC,SAAS,KAAK,YAAY,MAAM;AAAA,IAChC,WAAW,SAAS,SAAS,IAAI;AAAA,EACnC;AACF;AAKF,SAAS,qBACP,MACA,UACA,cACmB;AACjB,QAAM,WAAW,KAAK,kBAAkB,MAAM;AAC9C,MAAI,CAAC,SAAU,QAAO;AAEtB,SAAO;AAAA,IACL,MAAM,SAAS;AAAA,IACf,MAAM;AAAA,IACN,WAAW,KAAK,cAAc,MAAM;AAAA,IACpC,SAAS,KAAK,YAAY,MAAM;AAAA,IAChC,WAAW,aAAa,SAAS,IAAI;AAAA,EACvC;AACF;AAKF,SAAS,0BACP,MACA,SACA,aACmB;AACjB,QAAM,WAAW,KAAK,kBAAkB,MAAM;AAC9C,MAAI,CAAC,SAAU,QAAO;AAEtB,SAAO;AAAA,IACL,MAAM,SAAS;AAAA,IACf,MAAM,cAAc,WAAW;AAAA,IAC/B,WAAW,KAAK,cAAc,MAAM;AAAA,IACpC,SAAS,KAAK,YAAY,MAAM;AAAA,IAChC;AAAA,IACA,WAAW,iBAAiB,MAAM,OAAO;AAAA,IACzC,YAAY,kBAAkB,MAAM,OAAO;AAAA,IAC3C,YAAY,oBAAoB,IAAI;AAAA,EACtC;AACF;AAKF,SAAS,uBACP,MACA,UACA,cACmB;AACjB,QAAM,WAAW,KAAK,kBAAkB,MAAM;AAC9C,MAAI,CAAC,SAAU,QAAO;AAEtB,SAAO;AAAA,IACL,MAAM,SAAS;AAAA,IACf,MAAM;AAAA,IACN,WAAW,KAAK,cAAc,MAAM;AAAA,IACpC,SAAS,KAAK,YAAY,MAAM;AAAA,IAChC,WAAW,SAAS,SAAS,IAAI;AAAA,EACnC;AACF;AA0CK,SAAS,kBACd,MACA,SACA,aACA,UACmB;AAGnB,MAAI,KAAK,SAAS,yBAAyB,aAAa,UAAU;AAChE,WAAO,0BAA0B,MAAM,SAAS,WAAW;AAAA,EAC7D;AAEA,QAAM,YAAY,iBAAiB,KAAK,IAAI;AAC5C,SAAO,YAAY,UAAU,MAAM,SAAS,WAAW,IAAI;AAC7D;AAKA,SAAS,iBAAiB,MAAyB,SAAyB;AAE1E,QAAM,YAAY,KAAK,cAAc;AACrC,QAAM,QAAQ,QAAQ,MAAM,IAAI;AAChC,MAAI,YAAY,MAAM,SAAS,KAAK;AAGpC,MAAI,cAAc;AAClB,SAAO,cAAc,KAAK,YAAY,OAAO,CAAC,UAAU,SAAS,GAAG,KAAK,CAAC,UAAU,SAAS,IAAI,GAAG;AAClG;AACA,iBAAa,OAAO,MAAM,WAAW,KAAK;AAAA,EAC5C;AAGA,cAAY,UAAU,MAAM,GAAG,EAAE,CAAC,EAAE,MAAM,IAAI,EAAE,CAAC,EAAE,KAAK;AAGxD,MAAI,UAAU,SAAS,KAAK;AAC1B,gBAAY,UAAU,UAAU,GAAG,GAAG,IAAI;AAAA,EAC5C;AAEA,SAAO;AACT;AAQA,SAAS,kBAAkB,MAAyB,UAA4B;AAC9E,QAAM,aAAuB,CAAC;AAG9B,QAAM,aAAa,KAAK,kBAAkB,YAAY;AACtD,MAAI,CAAC,WAAY,QAAO;AAGxB,WAAS,IAAI,GAAG,IAAI,WAAW,iBAAiB,KAAK;AACnD,UAAM,QAAQ,WAAW,WAAW,CAAC;AACrC,QAAI,OAAO;AACT,iBAAW,KAAK,MAAM,IAAI;AAAA,IAC5B;AAAA,EACF;AAEA,SAAO;AACT;AAQA,SAAS,kBAAkB,MAAyB,UAAsC;AACxF,QAAM,iBAAiB,KAAK,kBAAkB,aAAa;AAC3D,MAAI,CAAC,eAAgB,QAAO;AAE5B,SAAO,eAAe;AACxB;AAKO,SAAS,eAAe,UAAuC;AACpE,QAAM,UAAoB,CAAC;AAE3B,WAAS,SAAS,MAAyB;AAEzC,QAAI,KAAK,SAAS,oBAAoB;AAEpC,YAAM,aAAa,KAAK,kBAAkB,QAAQ;AAClD,UAAI,YAAY;AAEd,cAAM,aAAa,WAAW,KAAK,QAAQ,SAAS,EAAE;AACtD,gBAAQ,KAAK,UAAU;AAAA,MACzB,OAAO;AAEL,cAAM,aAAa,KAAK,KAAK,MAAM,IAAI,EAAE,CAAC;AAC1C,gBAAQ,KAAK,UAAU;AAAA,MACzB;AAAA,IACF,WAES,KAAK,SAAS,yBAAyB;AAE9C,YAAM,aAAa,KAAK,KAAK,MAAM,IAAI,EAAE,CAAC;AAC1C,cAAQ,KAAK,UAAU;AAAA,IACzB;AAGA,QAAI,SAAS,UAAU;AACrB,eAAS,IAAI,GAAG,IAAI,KAAK,iBAAiB,KAAK;AAC7C,cAAM,QAAQ,KAAK,WAAW,CAAC;AAC/B,YAAI,MAAO,UAAS,KAAK;AAAA,MAC3B;AAAA,IACF;AAAA,EACF;AAEA,WAAS,QAAQ;AACjB,SAAO;AACT;AA5UA,IAuLM;AAvLN;AAAA;AAAA;AAEA;AAqLA,IAAM,mBAAoD;AAAA;AAAA,MAExD,wBAAwB;AAAA,MACxB,YAAY;AAAA,MACZ,kBAAkB;AAAA,MAClB,uBAAuB;AAAA,MACvB,qBAAqB;AAAA,MACrB,qBAAqB;AAAA,MACrB,yBAAyB;AAAA;AAAA,MAGzB,uBAAuB;AAAA;AAAA,MACvB,sBAAsB;AAAA;AAAA;AAAA,MAGtB,6BAA6B;AAAA;AAAA,MAC7B,oBAAoB;AAAA;AAAA;AAAA;AAAA,IAGtB;AAAA;AAAA;;;AC1MA,IASa,qBA2FA;AApGb;AAAA;AAAA;AASO,IAAM,sBAAN,MAAuD;AAAA,MAC5D,kBAAkB;AAAA,QAChB;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA;AAAA,QACA;AAAA;AAAA,MACF;AAAA,MAEA,iBAAiB;AAAA,QACf;AAAA;AAAA,MACF;AAAA,MAEA,mBAAmB;AAAA,QACjB;AAAA;AAAA,QACA;AAAA;AAAA,MACF;AAAA,MAEA,gBAAgB;AAAA,QACd;AAAA,QACA;AAAA,QACA;AAAA,MACF;AAAA,MAEA,sBAAsB,MAAkC;AACtD,eAAO,KAAK,eAAe,SAAS,KAAK,IAAI;AAAA,MAC/C;AAAA,MAEA,0BAA0B,MAAkC;AAC1D,eAAO,KAAK,iBAAiB,SAAS,KAAK,IAAI;AAAA,MACjD;AAAA,MAEA,iBAAiB,MAAmD;AAClE,YAAI,KAAK,SAAS,qBAAqB;AACrC,iBAAO,KAAK,kBAAkB,MAAM;AAAA,QACtC;AACA,eAAO;AAAA,MACT;AAAA,MAEA,uBAAuB,MAAkC;AACvD,eAAO,KAAK,SAAS,aACd,KAAK,SAAS,sBACd,KAAK,SAAS;AAAA,MACvB;AAAA,MAEA,wBAAwB,MAA6C;AACnE,YAAI,UAAU,KAAK;AACnB,eAAO,SAAS;AACd,cAAI,QAAQ,SAAS,qBAAqB;AACxC,kBAAM,WAAW,QAAQ,kBAAkB,MAAM;AACjD,mBAAO,UAAU;AAAA,UACnB;AACA,oBAAU,QAAQ;AAAA,QACpB;AACA,eAAO;AAAA,MACT;AAAA;AAAA;AAAA;AAAA,MAKA,0BAA0B,MAAkD;AAC1E,cAAMC,UAAS,CAAC,GAAsB,UAA4C;AAChF,cAAI,QAAQ,EAAG,QAAO;AAEtB,cAAI,KAAK,cAAc,SAAS,EAAE,IAAI,GAAG;AACvC,mBAAO;AAAA,UACT;AAEA,mBAAS,IAAI,GAAG,IAAI,EAAE,YAAY,KAAK;AACrC,kBAAM,QAAQ,EAAE,MAAM,CAAC;AACvB,gBAAI,OAAO;AACT,oBAAM,SAASA,QAAO,OAAO,QAAQ,CAAC;AACtC,kBAAI,OAAQ,QAAO;AAAA,YACrB;AAAA,UACF;AAEA,iBAAO;AAAA,QACT;AAEA,cAAM,eAAeA,QAAO,MAAM,CAAC;AACnC,eAAO;AAAA,UACL,aAAa,iBAAiB;AAAA,UAC9B;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAKO,IAAM,sBAAN,cAAkC,oBAAoB;AAAA,IAAC;AAAA;AAAA;;;ACpG9D,IASa;AATb;AAAA;AAAA;AASO,IAAM,eAAN,MAAgD;AAAA,MACrD,kBAAkB;AAAA,QAChB;AAAA;AAAA,QACA;AAAA;AAAA,MACF;AAAA,MAEA,iBAAiB;AAAA,QACf;AAAA;AAAA,QACA;AAAA;AAAA,QACA;AAAA;AAAA,MACF;AAAA,MAEA,mBAAmB;AAAA;AAAA;AAAA,MAGnB;AAAA,MAEA,gBAAgB;AAAA,QACd;AAAA,QACA;AAAA,MACF;AAAA,MAEA,sBAAsB,MAAkC;AACtD,eAAO,KAAK,eAAe,SAAS,KAAK,IAAI;AAAA,MAC/C;AAAA,MAEA,0BAA0B,OAAmC;AAG3D,eAAO;AAAA,MACT;AAAA,MAEA,iBAAiB,MAAmD;AAClE,YAAI,KAAK,SAAS,uBACd,KAAK,SAAS,uBACd,KAAK,SAAS,yBAAyB;AAEzC,iBAAO,KAAK,kBAAkB,MAAM;AAAA,QACtC;AACA,eAAO;AAAA,MACT;AAAA,MAEA,uBAAuB,MAAkC;AACvD,eAAO,KAAK,SAAS;AAAA,QACd,KAAK,SAAS;AAAA,QACd,KAAK,SAAS;AAAA,MACvB;AAAA,MAEA,wBAAwB,MAA6C;AACnE,YAAI,UAAU,KAAK;AACnB,eAAO,SAAS;AACd,cAAI,QAAQ,SAAS,uBACjB,QAAQ,SAAS,qBAAqB;AACxC,kBAAM,WAAW,QAAQ,kBAAkB,MAAM;AACjD,mBAAO,UAAU;AAAA,UACnB;AACA,oBAAU,QAAQ;AAAA,QACpB;AACA,eAAO;AAAA,MACT;AAAA,MAEA,0BAA0B,OAAmD;AAE3E,eAAO;AAAA,UACL,aAAa;AAAA,UACb,cAAc;AAAA,QAChB;AAAA,MACF;AAAA,IACF;AAAA;AAAA;;;AC7EA,IAYa;AAZb;AAAA;AAAA;AAYO,IAAM,kBAAN,MAAmD;AAAA,MACxD,kBAAkB;AAAA,QAChB;AAAA,QACA;AAAA,MACF;AAAA,MAEA,iBAAiB;AAAA,QACf;AAAA;AAAA,MACF;AAAA,MAEA,mBAAmB;AAAA;AAAA;AAAA,MAGnB;AAAA,MAEA,gBAAgB;AAAA,QACd;AAAA,QACA;AAAA,MACF;AAAA,MAEA,sBAAsB,MAAkC;AACtD,eAAO,KAAK,eAAe,SAAS,KAAK,IAAI;AAAA,MAC/C;AAAA,MAEA,0BAA0B,OAAmC;AAG3D,eAAO;AAAA,MACT;AAAA,MAEA,iBAAiB,MAAmD;AAClE,YAAI,KAAK,SAAS,oBAAoB;AAEpC,iBAAO,KAAK,kBAAkB,MAAM;AAAA,QACtC;AACA,eAAO;AAAA,MACT;AAAA,MAEA,uBAAuB,MAAkC;AACvD,eAAO,KAAK,SAAS;AAAA,QACd,KAAK,SAAS;AAAA,MACvB;AAAA,MAEA,wBAAwB,MAA6C;AACnE,YAAI,UAAU,KAAK;AACnB,eAAO,SAAS;AACd,cAAI,QAAQ,SAAS,oBAAoB;AACvC,kBAAM,WAAW,QAAQ,kBAAkB,MAAM;AACjD,mBAAO,UAAU;AAAA,UACnB;AACA,oBAAU,QAAQ;AAAA,QACpB;AACA,eAAO;AAAA,MACT;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,0BAA0B,OAAmD;AAC3E,eAAO;AAAA,UACL,aAAa;AAAA,UACb,cAAc;AAAA,QAChB;AAAA,MACF;AAAA,IACF;AAAA;AAAA;;;AC9CO,SAAS,aAAa,UAAgD;AAC3E,QAAM,YAAY,kBAAkB,QAAQ;AAE5C,MAAI,CAAC,WAAW;AACd,UAAM,IAAI,MAAM,wCAAwC,QAAQ,EAAE;AAAA,EACpE;AAEA,SAAO;AACT;AAvCA,IAiBM;AAjBN;AAAA;AAAA;AAEA;AACA;AACA;AAaA,IAAM,oBAAkE;AAAA,MACtE,YAAY,IAAI,oBAAoB;AAAA,MACpC,YAAY,IAAI,oBAAoB;AAAA,MACpC,KAAK,IAAI,aAAa;AAAA,MACtB,QAAQ,IAAI,gBAAgB;AAAA,IAC9B;AAAA;AAAA;;;ACOO,SAAS,WACd,UACA,SACA,UAA2B,CAAC,GAChB;AACZ,QAAM,EAAE,eAAe,EAAE,IAAI;AAG7B,QAAM,WAAWC,gBAAe,QAAQ;AACxC,MAAI,CAAC,UAAU;AACb,UAAM,IAAI,MAAM,kCAAkC,QAAQ,EAAE;AAAA,EAC9D;AAGA,QAAM,cAAc,SAAS,SAAS,QAAQ;AAG9C,MAAI,CAAC,YAAY,MAAM;AACrB,UAAM,IAAI,MAAM,mBAAmB,QAAQ,KAAK,YAAY,KAAK,EAAE;AAAA,EACrE;AAEA,QAAM,SAAqB,CAAC;AAC5B,QAAM,QAAQ,QAAQ,MAAM,IAAI;AAChC,QAAM,WAAW,YAAY,KAAK;AAGlC,QAAM,YAAY,aAAa,QAAQ;AAGvC,QAAM,cAAc,eAAe,QAAQ;AAG3C,QAAM,gBAAgB,kBAAkB,UAAU,SAAS;AAE3D,aAAW,QAAQ,eAAe;AAEhC,QAAI,aAAa;AACjB,QAAI,UAAU,0BAA0B,IAAI,GAAG;AAC7C,YAAM,WAAW,UAAU,0BAA0B,IAAI;AACzD,UAAI,SAAS,cAAc;AACzB,qBAAa,SAAS;AAAA,MACxB;AAAA,IACF;AAGA,UAAM,kBAAkB,UAAU,wBAAwB,UAAU;AAEpE,UAAM,aAAa,kBAAkB,YAAY,SAAS,iBAAiB,QAAQ;AAGnF,UAAM,cAAc,eAAe,MAAM,KAAK;AAK9C,WAAO,KAAK,YAAY,UAAU,MAAM,aAAa,YAAY,aAAa,QAAQ,CAAC;AAAA,EACzF;AAGA,QAAM,gBAAgB,cAAc,IAAI,QAAM;AAAA,IAC5C,OAAO,EAAE,cAAc;AAAA,IACvB,KAAK,EAAE,YAAY;AAAA,EACrB,EAAE;AAEF,QAAM,kBAAkB;AAAA,IACtB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AAEA,SAAO,KAAK,GAAG,eAAe;AAG9B,SAAO,KAAK,CAAC,GAAG,MAAM,EAAE,SAAS,YAAY,EAAE,SAAS,SAAS;AAEjE,SAAO;AACT;AAGA,SAAS,sBACP,MACA,OACA,WACS;AACT,MAAI,UAAU,KAAK,CAAC,UAAU,0BAA0B,IAAI,EAAG,QAAO;AACtE,SAAO,UAAU,0BAA0B,IAAI,EAAE;AACnD;AAGA,SAAS,aACP,MACA,OACA,WACS;AACT,SAAO,SAAS,KAAK,UAAU,gBAAgB,SAAS,KAAK,IAAI;AACnE;AAaA,SAAS,kBACP,UACA,WACqB;AACrB,QAAM,QAA6B,CAAC;AAEpC,WAAS,SAAS,MAAyB,OAAqB;AAE9D,QAAI,sBAAsB,MAAM,OAAO,SAAS,KAAK,aAAa,MAAM,OAAO,SAAS,GAAG;AACzF,YAAM,KAAK,IAAI;AACf;AAAA,IACF;AAGA,QAAI,UAAU,sBAAsB,IAAI,GAAG;AACzC,YAAM,OAAO,UAAU,iBAAiB,IAAI;AAC5C,UAAI,KAAM,UAAS,MAAM,QAAQ,CAAC;AAClC;AAAA,IACF;AAGA,QAAI,CAAC,UAAU,uBAAuB,IAAI,EAAG;AAC7C,aAAS,IAAI,GAAG,IAAI,KAAK,iBAAiB,KAAK;AAC7C,YAAM,QAAQ,KAAK,WAAW,CAAC;AAC/B,UAAI,MAAO,UAAS,OAAO,KAAK;AAAA,IAClC;AAAA,EACF;AAEA,WAAS,UAAU,CAAC;AACpB,SAAO;AACT;AAKA,SAAS,eAAe,MAAyB,OAAyB;AACxE,QAAM,YAAY,KAAK,cAAc;AACrC,QAAM,UAAU,KAAK,YAAY;AAEjC,SAAO,MAAM,MAAM,WAAW,UAAU,CAAC,EAAE,KAAK,IAAI;AACtD;AAgBA,SAAS,mBAAmB,YAI1B;AACA,QAAM,UAAU,EAAE,WAAW,CAAC,GAAe,SAAS,CAAC,GAAe,YAAY,CAAC,EAAc;AAEjG,MAAI,YAAY,QAAQ,WAAW,MAAM;AACvC,UAAM,WAAW,qBAAqB,WAAW,IAAI;AACrD,QAAI,SAAU,SAAQ,QAAQ,EAAE,KAAK,WAAW,IAAI;AAAA,EACtD;AAEA,SAAO;AACT;AAKA,SAAS,aAAa,YAAkF;AACtG,MAAI,CAAC,WAAY,QAAO;AACxB,SAAO,WAAW,SAAS,UAAU,UAAU;AACjD;AAKA,SAAS,YACP,UACA,MACA,SACA,YACA,SACA,UACU;AACV,QAAM,UAAU,mBAAmB,UAAU;AAC7C,QAAM,uBAAuB,YAAY,QAAQ,wBAAwB,IAAI,WAAW,IAAI;AAG5F,QAAM,sBAAsB,uBACxB,6BAA6B,IAAI,IACjC;AAGJ,QAAM,WAAW,uBACb,kBAAkB,MAAM,QAAQ,IAChC;AAEJ,SAAO;AAAA,IACL;AAAA,IACA,UAAU;AAAA,MACR,MAAM;AAAA,MACN,WAAW,KAAK,cAAc,MAAM;AAAA,MACpC,SAAS,KAAK,YAAY,MAAM;AAAA,MAChC,MAAM,aAAa,UAAU;AAAA,MAC7B;AAAA,MACA;AAAA,MACA,YAAY,YAAY;AAAA,MACxB,YAAY,YAAY;AAAA,MACxB,aAAa,YAAY;AAAA,MACzB,YAAY,YAAY;AAAA,MACxB;AAAA,MACA,YAAY,YAAY;AAAA,MACxB,WAAW,YAAY;AAAA,MACvB;AAAA;AAAA,MAEA,gBAAgB,UAAU;AAAA,MAC1B,oBAAoB,UAAU;AAAA,MAC9B,gBAAgB,UAAU;AAAA,MAC1B,cAAc,UAAU;AAAA,IAC1B;AAAA,EACF;AACF;AAaA,SAAS,oBACP,eACA,YACa;AACb,QAAM,kBAA+B,CAAC;AACtC,MAAI,eAAe;AAGnB,QAAM,eAAe,CAAC,GAAG,aAAa,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK;AAExE,aAAW,SAAS,cAAc;AAChC,QAAI,eAAe,MAAM,OAAO;AAE9B,sBAAgB,KAAK;AAAA,QACnB,OAAO;AAAA,QACP,KAAK,MAAM,QAAQ;AAAA,MACrB,CAAC;AAAA,IACH;AACA,mBAAe,MAAM,MAAM;AAAA,EAC7B;AAGA,MAAI,eAAe,YAAY;AAC7B,oBAAgB,KAAK;AAAA,MACnB,OAAO;AAAA,MACP,KAAK,aAAa;AAAA,IACpB,CAAC;AAAA,EACH;AAEA,SAAO;AACT;AAKA,SAAS,qBACP,OACA,OACA,UACA,UACA,SACU;AACV,QAAM,iBAAiB,MAAM,MAAM,MAAM,OAAO,MAAM,MAAM,CAAC;AAC7D,QAAM,UAAU,eAAe,KAAK,IAAI,EAAE,KAAK;AAE/C,SAAO;AAAA,IACL;AAAA,IACA,UAAU;AAAA,MACR,MAAM;AAAA,MACN,WAAW,MAAM,QAAQ;AAAA,MACzB,SAAS,MAAM,MAAM;AAAA,MACrB,MAAM;AAAA,MACN;AAAA;AAAA,MAEA,SAAS,EAAE,WAAW,CAAC,GAAG,SAAS,CAAC,GAAG,YAAY,CAAC,EAAE;AAAA,MACtD;AAAA,IACF;AAAA,EACF;AACF;AAKA,SAAS,aAAa,OAAiB,cAA+B;AACpE,QAAM,YAAY,MAAM,SAAS,UAAU,MAAM,SAAS,YAAY;AACtE,SAAO,MAAM,QAAQ,SAAS,KAAK,aAAa;AAClD;AAMA,SAAS,qBACP,OACA,eACA,UACA,cACA,SACA,UACY;AACZ,QAAM,kBAAkB,oBAAoB,eAAe,MAAM,MAAM;AAEvE,SAAO,gBACJ,IAAI,WAAS,qBAAqB,OAAO,OAAO,UAAU,UAAU,OAAO,CAAC,EAC5E,OAAO,WAAS,aAAa,OAAO,YAAY,CAAC;AACtD;AAKO,SAAS,aAAa,UAA2B;AACtD,SAAO,eAAe,QAAQ;AAChC;AApXA,IAuLM,sBAQA;AA/LN;AAAA;AAAA;AAEA;AACA;AACA;AACA;AAkLA,IAAM,uBAA+E;AAAA,MACnF,UAAU;AAAA,MACV,QAAQ;AAAA,MACR,OAAO;AAAA,MACP,WAAW;AAAA,IACb;AAGA,IAAM,0BAA0B,oBAAI,IAAI,CAAC,YAAY,QAAQ,CAAC;AAAA;AAAA;;;AC/J9D,SAAS,kBAAkB,eAA2C;AACpE,MAAI;AAGF,QAAI,cAAc,cACf,QAAQ,2BAA2B,EAAE,EACrC,QAAQ,8BAA8B,EAAE,EACxC,KAAK;AAGR,UAAM,SAAS,KAAK,MAAM,WAAW;AAErC,WAAO,OAAO,OAAO,SAAS,WAAW,OAAO,OAAO;AAAA,EACzD,SAAS,OAAO;AAAA,EAGhB;AACA,SAAO;AACT;AASA,SAAS,eAAe,SAAyB;AAE/C,SAAO,QAAQ,QAAQ,8DAA8D,EAAE;AACzF;AAqBA,SAAS,kBAAkB,wBAA0C;AACnE,QAAM,eAAe,oBAAI,IAAY;AAIrC,QAAM,gBAAgB;AACtB,MAAI;AAEJ,UAAQ,QAAQ,cAAc,KAAK,sBAAsB,OAAO,MAAM;AACpE,iBAAa,IAAI,MAAM,CAAC,CAAC;AAAA,EAC3B;AAGA,QAAM,iBAAiB;AAEvB,UAAQ,QAAQ,eAAe,KAAK,sBAAsB,OAAO,MAAM;AACrE,iBAAa,IAAI,MAAM,CAAC,CAAC;AAAA,EAC3B;AAGA,QAAM,iBAAiB;AAEvB,UAAQ,QAAQ,eAAe,KAAK,sBAAsB,OAAO,MAAM;AACrE,iBAAa,IAAI,MAAM,CAAC,CAAC;AAAA,EAC3B;AAEA,SAAO,MAAM,KAAK,YAAY;AAChC;AAWA,SAAS,iBAAiB,SAAgC;AACxD,QAAM,QAAQ,QAAQ,MAAM,IAAI;AAChC,QAAM,SAAwB,CAAC;AAI/B,QAAM,gBAAgB;AAAA,IACpB,EAAE,MAAM,UAAmB,OAAO,0BAA0B,KAAK,4BAA4B;AAAA,IAC7F,EAAE,MAAM,SAAkB,OAAO,yBAAyB,KAAK,2BAA2B;AAAA,IAC1F,EAAE,MAAM,cAAuB,OAAO,8BAA8B,KAAK,gCAAgC;AAAA,EAC3G;AAEA,aAAW,WAAW,eAAe;AACnC,QAAI,cAAc;AAElB,WAAO,cAAc,MAAM,QAAQ;AAEjC,YAAM,WAAW,MAAM;AAAA,QAAU,CAAC,MAAM,QACtC,OAAO,eAAe,QAAQ,MAAM,KAAK,IAAI;AAAA,MAC/C;AAEA,UAAI,aAAa,GAAI;AAGrB,YAAM,SAAS,MAAM;AAAA,QAAU,CAAC,MAAM,QACpC,OAAO,YAAY,QAAQ,IAAI,KAAK,IAAI;AAAA,MAC1C;AAEA,UAAI,WAAW,IAAI;AAEjB;AAAA,MACF;AAGA,YAAM,eAAe,MAAM,MAAM,UAAU,SAAS,CAAC,EAAE,KAAK,IAAI;AAEhE,aAAO,KAAK;AAAA,QACV,MAAM,QAAQ;AAAA,QACd,WAAW;AAAA,QACX,SAAS;AAAA,QACT,SAAS;AAAA,MACX,CAAC;AAED,oBAAc,SAAS;AAAA,IACzB;AAAA,EACF;AAEA,SAAO,OAAO,KAAK,CAAC,GAAG,MAAM,EAAE,YAAY,EAAE,SAAS;AACxD;AAYO,SAAS,gBACd,UACA,SACA,YAAoB,IACpB,eAAuB,IACV;AACb,QAAM,QAAQ,QAAQ,MAAM,IAAI;AAChC,QAAM,SAAS,iBAAiB,OAAO;AACvC,QAAM,SAAsB,CAAC;AAG7B,QAAM,yBAAyB,eAAe,OAAO;AACrD,QAAM,uBAAuB,uBAAuB,MAAM,IAAI;AAG9D,QAAM,eAAe,oBAAI,IAAY;AAGrC,aAAW,SAAS,QAAQ;AAE1B,aAAS,IAAI,MAAM,WAAW,KAAK,MAAM,SAAS,KAAK;AACrD,mBAAa,IAAI,CAAC;AAAA,IACpB;AAGA,QAAI;AACJ,QAAI,MAAM,SAAS,UAAU;AAC3B,mBAAa,kBAAkB,MAAM,OAAO;AAAA,IAC9C;AAGA,UAAM,8BAA8B,qBACjC,MAAM,MAAM,WAAW,MAAM,UAAU,CAAC,EACxC,KAAK,IAAI;AACZ,UAAM,UAAU,kBAAkB,2BAA2B;AAE7D,UAAM,iBAAiB,MAAM,UAAU,MAAM,YAAY;AACzD,UAAM,eAAe,YAAY;AAGjC,QAAI,kBAAkB,cAAc;AAClC,aAAO,KAAK;AAAA,QACV,SAAS,MAAM;AAAA,QACf,UAAU;AAAA,UACR,MAAM;AAAA,UACN,WAAW,MAAM,YAAY;AAAA;AAAA,UAC7B,SAAS,MAAM,UAAU;AAAA,UACzB,UAAU;AAAA,UACV,MAAM;AAAA,UACN;AAAA,UACA,YAAY,MAAM;AAAA,UAClB,SAAS,QAAQ,SAAS,IAAI,UAAU;AAAA,QAC1C;AAAA,MACF,CAAC;AAAA,IACH,OAAO;AAEL,YAAM,aAAa,MAAM,QAAQ,MAAM,IAAI;AAE3C,eAAS,SAAS,GAAG,SAAS,WAAW,QAAQ,UAAU,YAAY,cAAc;AACnF,cAAM,YAAY,KAAK,IAAI,SAAS,WAAW,WAAW,MAAM;AAChE,cAAM,eAAe,WAAW,MAAM,QAAQ,SAAS,EAAE,KAAK,IAAI;AAElE,YAAI,aAAa,KAAK,EAAE,SAAS,GAAG;AAClC,iBAAO,KAAK;AAAA,YACV,SAAS;AAAA,YACT,UAAU;AAAA,cACR,MAAM;AAAA,cACN,WAAW,MAAM,YAAY,SAAS;AAAA;AAAA,cACtC,SAAS,MAAM,YAAY;AAAA;AAAA,cAC3B,UAAU;AAAA,cACV,MAAM;AAAA,cACN;AAAA;AAAA,cACA,YAAY,MAAM;AAAA,cAClB,SAAS,QAAQ,SAAS,IAAI,UAAU;AAAA,YAC1C;AAAA,UACF,CAAC;AAAA,QACH;AAEA,YAAI,aAAa,WAAW,OAAQ;AAAA,MACtC;AAAA,IACF;AAAA,EACF;AAGA,MAAI,eAAyB,CAAC;AAC9B,MAAI,iBAAiB;AAErB,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AAErC,QAAI,aAAa,IAAI,CAAC,GAAG;AAEvB,UAAI,aAAa,SAAS,GAAG;AAC3B,cAAM,eAAe,aAAa,KAAK,IAAI;AAG3C,YAAI,aAAa,KAAK,EAAE,SAAS,GAAG;AAElC,gBAAM,eAAe,qBAAqB,MAAM,gBAAgB,CAAC,EAAE,KAAK,IAAI;AAC5E,gBAAM,UAAU,kBAAkB,YAAY;AAE9C,iBAAO,KAAK;AAAA,YACV,SAAS;AAAA,YACT,UAAU;AAAA,cACR,MAAM;AAAA,cACN,WAAW,iBAAiB;AAAA,cAC5B,SAAS;AAAA,cACT,UAAU;AAAA,cACV,MAAM;AAAA,cACN,SAAS,QAAQ,SAAS,IAAI,UAAU;AAAA,YAC1C;AAAA,UACF,CAAC;AAAA,QACH;AACA,uBAAe,CAAC;AAAA,MAClB;AACA;AAAA,IACF;AAGA,QAAI,aAAa,WAAW,GAAG;AAC7B,uBAAiB;AAAA,IACnB;AAEA,iBAAa,KAAK,MAAM,CAAC,CAAC;AAG1B,QAAI,aAAa,UAAU,WAAW;AACpC,YAAM,eAAe,aAAa,KAAK,IAAI;AAG3C,UAAI,aAAa,KAAK,EAAE,SAAS,GAAG;AAElC,cAAM,eAAe,qBAAqB,MAAM,gBAAgB,IAAI,CAAC,EAAE,KAAK,IAAI;AAChF,cAAM,UAAU,kBAAkB,YAAY;AAE9C,eAAO,KAAK;AAAA,UACV,SAAS;AAAA,UACT,UAAU;AAAA,YACR,MAAM;AAAA,YACN,WAAW,iBAAiB;AAAA,YAC5B,SAAS,IAAI;AAAA,YACb,UAAU;AAAA,YACV,MAAM;AAAA,YACN,SAAS,QAAQ,SAAS,IAAI,UAAU;AAAA,UAC1C;AAAA,QACF,CAAC;AAAA,MACH;AAGA,qBAAe,aAAa,MAAM,CAAC,YAAY;AAC/C,uBAAiB,KAAK,IAAI,GAAG,IAAI,IAAI,YAAY;AAAA,IACnD;AAAA,EACF;AAGA,MAAI,aAAa,SAAS,GAAG;AAC3B,UAAM,eAAe,aAAa,KAAK,IAAI;AAG3C,QAAI,aAAa,KAAK,EAAE,WAAW,GAAG;AACpC,aAAO,OAAO,KAAK,CAAC,GAAG,MAAM,EAAE,SAAS,YAAY,EAAE,SAAS,SAAS;AAAA,IAC1E;AAGA,UAAM,eAAe,qBAAqB,MAAM,gBAAgB,MAAM,MAAM,EAAE,KAAK,IAAI;AACvF,UAAM,UAAU,kBAAkB,YAAY;AAE9C,WAAO,KAAK;AAAA,MACV,SAAS;AAAA,MACT,UAAU;AAAA,QACR,MAAM;AAAA,QACN,WAAW,iBAAiB;AAAA,QAC5B,SAAS,MAAM;AAAA,QACf,UAAU;AAAA,QACV,MAAM;AAAA,QACN,SAAS,QAAQ,SAAS,IAAI,UAAU;AAAA,MAC1C;AAAA,IACF,CAAC;AAAA,EACH;AAGA,SAAO,OAAO,KAAK,CAAC,GAAG,MAAM,EAAE,SAAS,YAAY,EAAE,SAAS,SAAS;AAC1E;AA1WA;AAAA;AAAA;AAAA;AAAA;;;ACuBA,SAAS,yBAAyB,aAA+B;AAC/D,MAAI;AACF,UAAM,WAAW,KAAK,MAAM,WAAW;AACvC,UAAM,eAAe,oBAAI,IAAY;AAGrC,QAAI,SAAS,YAAY,OAAO,SAAS,aAAa,UAAU;AAC9D,iBAAW,WAAW,OAAO,OAAO,SAAS,QAAQ,GAAG;AACtD,YACE,OAAO,YAAY,YACnB,YAAY,QACZ,UAAU,WACV,OAAO,QAAQ,SAAS,UACxB;AACA,uBAAa,IAAI,QAAQ,IAAI;AAAA,QAC/B;AAAA,MACF;AAAA,IACF;AAEA,WAAO,MAAM,KAAK,YAAY;AAAA,EAChC,SAAS,OAAO;AAEd,YAAQ,KAAK,yCAAyC,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK,CAAC,EAAE;AAC9G,WAAO,CAAC;AAAA,EACV;AACF;AAQA,SAAS,oBAAoB,UAAsC;AAEjE,QAAM,QAAQ,SAAS,MAAM,wBAAwB;AACrD,SAAO,QAAQ,MAAM,CAAC,IAAI;AAC5B;AAQO,SAAS,kBACd,UACA,SACa;AAEb,MAAI,QAAQ,KAAK,EAAE,WAAW,GAAG;AAC/B,WAAO,CAAC;AAAA,EACV;AAEA,QAAM,QAAQ,QAAQ,MAAM,IAAI;AAChC,QAAM,eAAe,oBAAoB,QAAQ;AACjD,QAAM,oBAAoB,yBAAyB,OAAO;AAE1D,SAAO,CAAC;AAAA,IACN;AAAA,IACA,UAAU;AAAA,MACR,MAAM;AAAA,MACN,WAAW;AAAA,MACX,SAAS,MAAM;AAAA,MACf,UAAU;AAAA,MACV,MAAM;AAAA,MACN,YAAY;AAAA,MACZ,YAAY;AAAA,MACZ,SAAS,kBAAkB,SAAS,IAAI,oBAAoB;AAAA,IAC9D;AAAA,EACF,CAAC;AACH;AA9FA;AAAA;AAAA;AAAA;AAAA;;;ACcO,SAAS,UACd,UACA,SACA,UAAwB,CAAC,GACZ;AACb,QAAM,EAAE,YAAY,IAAI,eAAe,IAAI,SAAS,MAAM,cAAc,aAAa,IAAI;AAGzF,MAAI,SAAS,SAAS,SAAS,GAAG;AAChC,WAAO,gBAAgB,UAAU,SAAS,WAAW,YAAY;AAAA,EACnE;AAMA,MAAI,SAAS,SAAS,OAAO,KAAK,sBAAsB,KAAK,QAAQ,GAAG;AACtE,WAAO,kBAAkB,UAAU,OAAO;AAAA,EAC5C;AAGA,MAAI,UAAU,aAAa,QAAQ,GAAG;AACpC,QAAI;AACF,aAAO,WAAW,UAAU,SAAS;AAAA,QACnC,cAAc,KAAK,MAAM,YAAY,EAAE;AAAA,MACzC,CAAC;AAAA,IACH,SAAS,OAAO;AAEd,UAAI,gBAAgB,SAAS;AAE3B,cAAM,IAAI,MAAM,2BAA2B,QAAQ,KAAK,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK,CAAC,EAAE;AAAA,MAClH;AAEA,cAAQ,KAAK,2BAA2B,QAAQ,iCAAiC,KAAK;AAAA,IACxF;AAAA,EACF;AAGA,SAAO,aAAa,UAAU,SAAS,WAAW,YAAY;AAChE;AAKA,SAAS,aACP,UACA,SACA,WACA,cACa;AACb,QAAM,QAAQ,QAAQ,MAAM,IAAI;AAChC,QAAM,SAAsB,CAAC;AAC7B,QAAM,WAAW,eAAe,QAAQ;AAGxC,MAAI,MAAM,WAAW,KAAM,MAAM,WAAW,KAAK,MAAM,CAAC,EAAE,KAAK,MAAM,IAAK;AACxE,WAAO;AAAA,EACT;AAGA,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK,YAAY,cAAc;AAC/D,UAAM,UAAU,KAAK,IAAI,IAAI,WAAW,MAAM,MAAM;AACpD,UAAM,aAAa,MAAM,MAAM,GAAG,OAAO;AACzC,UAAM,eAAe,WAAW,KAAK,IAAI;AAGzC,QAAI,aAAa,KAAK,EAAE,WAAW,GAAG;AACpC;AAAA,IACF;AAGA,UAAM,UAAU,eAAe,cAAc,QAAQ;AAErD,WAAO,KAAK;AAAA,MACV,SAAS;AAAA,MACT,UAAU;AAAA,QACR,MAAM;AAAA,QACN,WAAW,IAAI;AAAA,QACf;AAAA,QACA,MAAM;AAAA;AAAA,QACN;AAAA,QACA;AAAA,MACF;AAAA,IACF,CAAC;AAGD,QAAI,WAAW,MAAM,QAAQ;AAC3B;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AACT;AA1GA,IAAAC,gBAAA;AAAA;AAAA;AACA;AACA;AACA;AACA;AACA;AAAA;AAAA;;;ACLA,SAAS,UAAU,WAA2C;AAA9D,IASa;AATb;AAAA;AAAA;AAEA;AACA;AAGA,QAAI,oBAAoB;AACxB,QAAI,mBAAmB;AAEhB,IAAM,kBAAN,MAAkD;AAAA,MAC/C,YAA8C;AAAA,MACrC,YAAY;AAAA,MACrB,cAAoC;AAAA,MAE5C,MAAM,aAA4B;AAEhC,YAAI,KAAK,aAAa;AACpB,iBAAO,KAAK;AAAA,QACd;AAEA,YAAI,KAAK,WAAW;AAClB;AAAA,QACF;AAEA,aAAK,eAAe,YAAY;AAC9B,cAAI;AAEF,iBAAK,YAAY,MAAM,SAAS,sBAAsB,KAAK,SAAS;AAAA,UACtE,SAAS,OAAgB;AACvB,iBAAK,cAAc;AACnB,kBAAM,UAAU,OAAO,sCAAsC;AAAA,UAC/D;AAAA,QACF,GAAG;AAEH,eAAO,KAAK;AAAA,MACd;AAAA,MAEA,MAAM,MAAM,MAAqC;AAC/C,cAAM,KAAK,WAAW;AAEtB,YAAI,CAAC,KAAK,WAAW;AACnB,gBAAM,IAAI,eAAe,iCAAiC;AAAA,QAC5D;AAEA,YAAI;AACF,gBAAM,SAAS,MAAM,KAAK,UAAU,MAAM;AAAA,YACxC,SAAS;AAAA,YACT,WAAW;AAAA,UACb,CAAC;AAED,iBAAO,OAAO;AAAA,QAChB,SAAS,OAAgB;AACvB,gBAAM,UAAU,OAAO,gCAAgC,EAAE,YAAY,KAAK,OAAO,CAAC;AAAA,QACpF;AAAA,MACF;AAAA,MAEA,MAAM,WAAW,OAA0C;AACzD,cAAM,KAAK,WAAW;AAEtB,YAAI,CAAC,KAAK,WAAW;AACnB,gBAAM,IAAI,eAAe,iCAAiC;AAAA,QAC5D;AAEA,YAAI;AAGF,gBAAM,UAAU,MAAM,QAAQ;AAAA,YAC5B,MAAM,IAAI,UAAQ,KAAK,MAAM,IAAI,CAAC;AAAA,UACpC;AACA,iBAAO;AAAA,QACT,SAAS,OAAgB;AACvB,gBAAM,UAAU,OAAO,uCAAuC,EAAE,WAAW,MAAM,OAAO,CAAC;AAAA,QAC3F;AAAA,MACF;AAAA,IACF;AAAA;AAAA;;;AC1EA,IAQa;AARb;AAAA;AAAA;AAAA;AAQO,IAAM,sBAAsB;AAAA;AAAA;;;ACM5B,SAAS,mBAAmB,OAAkC;AACnE,MAAI,QAAQ,EAAK,QAAO;AACxB,MAAI,QAAQ,IAAK,QAAO;AACxB,MAAI,QAAQ,IAAK,QAAO;AACxB,SAAO;AACT;AAnBA;AAAA;AAAA;AAAA;AAAA;;;ACgGA,SAAS,iBAA+B;AACtC,MAAI,sBAAsB,MAAM;AAC9B,wBAAoB,CAAC,GAAG,YAAY,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,WAAW,EAAE,QAAQ;AAAA,EAC9E;AACA,SAAO;AACT;AAwBO,SAAS,oBAAoB,OAA4B;AAC9D,QAAM,QAAQ,MAAM,YAAY,EAAE,KAAK;AAGvC,QAAM,cAAc,eAAe;AAEnC,aAAW,QAAQ,aAAa;AAC9B,QAAI,KAAK,SAAS,KAAK,aAAW,QAAQ,KAAK,KAAK,CAAC,GAAG;AACtD,aAAO,KAAK;AAAA,IACd;AAAA,EACF;AAIA,SAAO;AACT;AA5IA,IA2CM,cAyCA,oBAMF;AA1FJ;AAAA;AAAA;AA2CA,IAAM,eAA6B;AAAA;AAAA,MAEjC;AAAA,QACE,QAAQ;AAAA,QACR,UAAU;AAAA,QACV,UAAU;AAAA,UACR;AAAA,UACA;AAAA,UACA;AAAA,QACF;AAAA,MACF;AAAA;AAAA,MAGA;AAAA,QACE,QAAQ;AAAA,QACR,UAAU;AAAA,QACV,UAAU;AAAA,UACR;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,QACF;AAAA,MACF;AAAA;AAAA,MAGA;AAAA,QACE,QAAQ;AAAA,QACR,UAAU;AAAA,QACV,UAAU;AAAA,UACR;AAAA,UACA;AAAA,UACA;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAMA,IAAM,qBAAqB,aAAa;AAMxC,IAAI,oBAAyC;AAAA;AAAA;;;AC1F7C,IAAAC,cAAA;AAAA;AAAA;AAAA;AAAA;;;ACCA,OAAOC,YAAU;AAOjB,SAAS,oBAAoB,UAA2B;AACtD,QAAM,QAAQ,SAAS,YAAY;AACnC,QAAM,WAAWA,OAAK,SAAS,QAAQ,EAAE,YAAY;AAErD,MAAI,SAAS,WAAW,QAAQ,EAAG,QAAO;AAC1C,MAAI,SAAS,WAAW,WAAW,EAAG,QAAO;AAC7C,MAAI,SAAS,SAAS,KAAK,KAAK,SAAS,SAAS,MAAM,KAAK,SAAS,SAAS,WAAW,GAAG;AAC3F,WAAO;AAAA,EACT;AACA,MACE,MAAM,SAAS,QAAQ,KACvB,MAAM,SAAS,iBAAiB,KAChC,MAAM,SAAS,QAAQ,KACvB,MAAM,SAAS,WAAW,GAC1B;AACA,WAAO;AAAA,EACT;AACA,MACE,MAAM,SAAS,cAAc,KAC7B,MAAM,SAAS,UAAU,KACzB,MAAM,SAAS,QAAQ,GACvB;AACA,WAAO;AAAA,EACT;AAEA,SAAO;AACT;AAEA,SAAS,WAAW,UAA2B;AAC7C,QAAM,QAAQ,SAAS,YAAY;AAEnC,MACE,MAAM,SAAS,QAAQ,KACvB,MAAM,SAAS,SAAS,KACxB,MAAM,SAAS,aAAa,GAC5B;AACA,WAAO;AAAA,EACT;AAEA,MACE,MAAM,SAAS,QAAQ,KACvB,MAAM,SAAS,QAAQ,KACvB,MAAM,SAAS,QAAQ,KACvB,MAAM,SAAS,QAAQ,GACvB;AACA,WAAO;AAAA,EACT;AAEA,SAAO;AACT;AAEA,SAAS,cAAc,UAA2B;AAChD,QAAM,QAAQ,SAAS,YAAY;AAEnC,MACE,MAAM,SAAS,SAAS,KACxB,MAAM,SAAS,aAAa,KAC5B,MAAM,SAAS,WAAW,KAC1B,MAAM,SAAS,OAAO,GACtB;AACA,WAAO;AAAA,EACT;AAEA,MACE,MAAM,SAAS,QAAQ,KACvB,MAAM,SAAS,UAAU,KACzB,MAAM,SAAS,QAAQ,KACvB,MAAM,SAAS,UAAU,GACzB;AACA,WAAO;AAAA,EACT;AAEA,SAAO;AACT;AAjFA,IA2Fa,sBAwBA,0BAgCA;AAnJb;AAAA;AAAA;AAEA;AAyFO,IAAM,uBAAN,MAAuD;AAAA,MAC5D,OAAO;AAAA,MAEP,MAAM,OAAe,UAAkB,WAA2B;AAChE,cAAM,cAAc,MAAM,YAAY,EAAE,MAAM,KAAK;AACnD,cAAM,eAAe,SAAS,YAAY,EAAE,MAAM,GAAG;AAErD,YAAI,cAAc;AAElB,mBAAW,SAAS,aAAa;AAC/B,cAAI,MAAM,UAAU,EAAG;AACvB,cAAI,aAAa,KAAK,SAAO,IAAI,SAAS,KAAK,CAAC,GAAG;AACjD,2BAAe;AAAA,UACjB;AAAA,QACF;AAEA,eAAO,YAAY;AAAA,MACrB;AAAA,IACF;AAMO,IAAM,2BAAN,MAA2D;AAAA,MAChE,OAAO;AAAA,MAEP,MAAM,OAAe,UAAkB,WAA2B;AAChE,cAAM,WAAWA,OAAK,SAAS,UAAUA,OAAK,QAAQ,QAAQ,CAAC,EAAE,YAAY;AAC7E,cAAM,cAAc,MAAM,YAAY,EAAE,MAAM,KAAK;AAEnD,YAAI,cAAc;AAElB,mBAAW,SAAS,aAAa;AAC/B,cAAI,MAAM,UAAU,EAAG;AAEvB,cAAI,aAAa,OAAO;AACtB,2BAAe;AAAA,UACjB,WAAW,SAAS,SAAS,KAAK,GAAG;AACnC,2BAAe;AAAA,UACjB;AAAA,QACF;AAEA,eAAO,YAAY;AAAA,MACrB;AAAA,IACF;AAWO,IAAM,2BAAN,MAA2D;AAAA,MAGhE,YAAoB,QAAqB;AAArB;AAAA,MAAsB;AAAA,MAF1C,OAAO;AAAA,MAIP,MAAM,OAAe,UAAkB,WAA2B;AAChE,gBAAQ,KAAK,QAAQ;AAAA,UACnB;AACE,mBAAO,KAAK,sBAAsB,OAAO,UAAU,SAAS;AAAA,UAE9D;AACE,mBAAO,KAAK,wBAAwB,OAAO,UAAU,SAAS;AAAA,UAEhE;AACE,mBAAO,KAAK,4BAA4B,OAAO,UAAU,SAAS;AAAA,UAEpE;AACE,mBAAO;AAAA,QACX;AAAA,MACF;AAAA,MAEQ,sBAAsB,QAAgB,UAAkB,OAAuB;AAMrF,YAAI,WAAW,QAAQ,GAAG;AACxB,mBAAS;AAAA,QACX;AAEA,eAAO;AAAA,MACT;AAAA,MAEQ,wBAAwB,QAAgB,UAAkB,OAAuB;AAMvF,YAAI,oBAAoB,QAAQ,GAAG;AACjC,mBAAS;AAET,gBAAM,QAAQ,SAAS,YAAY;AACnC,cACE,MAAM,SAAS,cAAc,KAC7B,MAAM,SAAS,UAAU,KACzB,MAAM,SAAS,MAAM,GACrB;AACA,qBAAS;AAAA,UACX;AAAA,QACF;AAGA,YAAI,cAAc,QAAQ,GAAG;AAC3B,mBAAS;AAAA,QACX;AAEA,eAAO;AAAA,MACT;AAAA,MAEQ,4BAA4B,QAAgB,UAAkB,OAAuB;AAM3F,YAAI,WAAW,QAAQ,GAAG;AACxB,mBAAS;AAAA,QACX;AAEA,eAAO;AAAA,MACT;AAAA,IACF;AAAA;AAAA;;;AC5NA,IAkBa;AAlBb;AAAA;AAAA;AAkBO,IAAM,mBAAN,MAAuB;AAAA,MACpB,aAAiC,CAAC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAS1C,YAAY,UAAkC;AAC5C,aAAK,WAAW,KAAK,QAAQ;AAC7B,eAAO;AAAA,MACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAUA,MAAM,OAAe,UAAkB,WAA2B;AAChE,YAAI,QAAQ;AAEZ,mBAAW,YAAY,KAAK,YAAY;AACtC,kBAAQ,SAAS,MAAM,OAAO,UAAU,KAAK;AAAA,QAC/C;AAEA,eAAO;AAAA,MACT;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,mBAA6B;AAC3B,eAAO,KAAK,WAAW,IAAI,OAAK,EAAE,IAAI;AAAA,MACxC;AAAA;AAAA;AAAA;AAAA,MAKA,mBAA2B;AACzB,eAAO,KAAK,WAAW;AAAA,MACzB;AAAA;AAAA;AAAA;AAAA,MAKA,QAAc;AACZ,aAAK,aAAa,CAAC;AAAA,MACrB;AAAA,IACF;AAAA;AAAA;;;ACxEA;AAAA;AAAA;AAmBA,IAAAC;AACA;AACA;AAAA;AAAA;;;AC+DA,SAAS,cAAc,GAAsB;AAC3C,SAAO;AAAA,IACL,EAAE,WACF,EAAE,QAAQ,KAAK,EAAE,SAAS,KAC1B,EAAE,QACF,EAAE,KAAK,SAAS;AAAA,EAClB;AACF;AAMA,SAAS,qBAAqB,KAAoC;AAChE,SAAO,QAAQ,OAAO,IAAI,SAAS,KAAK,IAAI,CAAC,MAAM,EAAE;AACvD;AAMA,SAAS,kBACP,GACA,YACU;AACV,MAAI,eAAe,WAAY,QAAO,EAAE,iBAAiB,CAAC;AAC1D,MAAI,eAAe,QAAS,QAAO,EAAE,cAAc,CAAC;AACpD,MAAI,eAAe,YAAa,QAAO,EAAE,kBAAkB,CAAC;AAC5D,SAAO;AAAA,IACL,GAAI,EAAE,iBAAiB,CAAC;AAAA,IACxB,GAAI,EAAE,cAAc,CAAC;AAAA,IACrB,GAAI,EAAE,kBAAkB,CAAC;AAAA,EAC3B;AACF;AAMA,SAAS,0BAA0B,GAAuC;AACxE,SAAO;AAAA,IACL,MAAM,EAAE;AAAA,IACR,WAAW,EAAE;AAAA,IACb,SAAS,EAAE;AAAA,IACX,MAAM,EAAE;AAAA,IACR,UAAU,EAAE;AAAA,IACZ,YAAY,EAAE,cAAc;AAAA,IAC5B,YAAY,EAAE;AAAA,IACd,aAAa,EAAE,eAAe;AAAA,IAC9B,YAAY,EAAE,cAAc;AAAA,IAC5B,qBAAqB,EAAE,uBAAuB;AAAA,IAC9C,YAAY,qBAAqB,EAAE,UAAU,IAAI,EAAE,aAAa;AAAA,IAChE,WAAW,EAAE,aAAa;AAAA,IAC1B,SAAS,qBAAqB,EAAE,OAAO,IAAI,EAAE,UAAU;AAAA;AAAA,IAEvD,gBAAgB,EAAE,kBAAkB,OAAO,EAAE,iBAAiB;AAAA,IAC9D,oBAAoB,EAAE,sBAAsB,OAAO,EAAE,qBAAqB;AAAA,IAC1E,gBAAgB,EAAE,kBAAkB,OAAO,EAAE,iBAAiB;AAAA,IAC9D,cAAc,EAAE,gBAAgB,OAAO,EAAE,eAAe;AAAA,EAC1D;AACF;AAUA,SAAS,uBACP,OACA,UACA,WACQ;AACR,MAAI,CAAC,OAAO;AACV,WAAO;AAAA,EACT;AAEA,QAAM,SAAS,oBAAoB,KAAK;AAGxC,SAAO,mBAAmB,MAAM,EAAE,MAAM,OAAO,UAAU,SAAS;AACpE;AAKA,SAAS,uBACP,GACA,OACc;AACd,QAAM,YAAY,EAAE,aAAa;AACjC,QAAM,eAAe,uBAAuB,OAAO,EAAE,MAAM,SAAS;AAEpE,SAAO;AAAA,IACL,SAAS,EAAE;AAAA,IACX,UAAU,0BAA0B,CAAC;AAAA,IACrC,OAAO;AAAA,IACP,WAAW,mBAAmB,YAAY;AAAA,EAC5C;AACF;AAKA,eAAsB,OACpB,OACA,aACA,QAAgB,GAChB,OACyB;AACzB,MAAI,CAAC,OAAO;AACV,UAAM,IAAI,cAAc,iCAAiC;AAAA,EAC3D;AAEA,MAAI;AACF,UAAM,UAAU,MAAM,MACnB,OAAO,MAAM,KAAK,WAAW,CAAC,EAC9B,MAAM,QAAQ,EAAE,EAChB,QAAQ;AAEX,UAAM,WAAY,QACf,OAAO,aAAa,EACpB,IAAI,CAAC,MAAgB,uBAAuB,GAAG,KAAK,CAAC,EACrD,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK,EAChC,MAAM,GAAG,KAAK;AAEjB,WAAO;AAAA,EACT,SAAS,OAAO;AACd,UAAM,WAAW,OAAO,KAAK;AAG7B,QAAI,SAAS,SAAS,YAAY,KAAK,SAAS,SAAS,QAAQ,GAAG;AAClE,YAAM,IAAI;AAAA,QACR;AAAA,QACA,EAAE,eAAe,MAAM;AAAA,MACzB;AAAA,IACF;AAEA,UAAM,UAAU,OAAO,kCAAkC;AAAA,EAC3D;AACF;AAKA,eAAsB,eACpB,OACA,SAKyB;AACzB,MAAI,CAAC,OAAO;AACV,UAAM,IAAI,cAAc,iCAAiC;AAAA,EAC3D;AAEA,QAAM,EAAE,UAAU,SAAS,QAAQ,IAAI,IAAI;AAE3C,MAAI;AACF,UAAM,aAAa,MAAM,mBAAmB,EAAE,KAAK,CAAC;AACpD,UAAM,QAAQ,MAAM,OAAO,UAAU,EAClC,MAAM,YAAY,EAClB,MAAM,KAAK,IAAI,QAAQ,GAAG,GAAG,CAAC;AAEjC,UAAM,UAAU,MAAM,MAAM,QAAQ;AAEpC,QAAI,WAAY,QAAkC,OAAO,aAAa;AAEtE,QAAI,UAAU;AACZ,iBAAW,SAAS;AAAA,QAAO,CAAC,MAC1B,EAAE,YAAY,EAAE,SAAS,YAAY,MAAM,SAAS,YAAY;AAAA,MAClE;AAAA,IACF;AAEA,QAAI,SAAS;AACX,YAAM,QAAQ,IAAI,OAAO,SAAS,GAAG;AACrC,iBAAW,SAAS;AAAA,QAAO,CAAC,MAC1B,MAAM,KAAK,EAAE,OAAO,KAAK,MAAM,KAAK,EAAE,IAAI;AAAA,MAC5C;AAAA,IACF;AAEA,WAAO,SAAS,MAAM,GAAG,KAAK,EAAE,IAAI,CAAC,OAAiB;AAAA,MACpD,SAAS,EAAE;AAAA,MACX,UAAU,0BAA0B,CAAC;AAAA,MACrC,OAAO;AAAA,MACP,WAAW,mBAAmB,CAAC;AAAA,IACjC,EAAE;AAAA,EACJ,SAAS,OAAO;AACd,UAAM,UAAU,OAAO,4BAA4B;AAAA,EACrD;AACF;AAYA,SAAS,kBACP,QACA,YACA,SACS;AAET,MAAI,OAAO,YAAY;AACrB,WAAO,oBAAoB,UAAU,GAAG,IAAI,OAAO,UAAU,KAAK;AAAA,EACpE;AAGA,SAAO,QAAQ,SAAS,KAAK,QAAQ,KAAK,CAAC,MAAc,EAAE,SAAS,KAAK,MAAM,EAAE;AACnF;AAYA,SAAS,oBACP,GACA,EAAE,UAAU,SAAS,WAAW,GACvB;AAET,MAAI,aAAa,CAAC,EAAE,YAAY,EAAE,SAAS,YAAY,MAAM,SAAS,YAAY,IAAI;AACpF,WAAO;AAAA,EACT;AAEA,QAAM,UAAU,kBAAkB,GAAG,UAAU;AAC/C,QAAM,gBAAgB,EAAE,cAAc;AAGtC,MAAI,QAAQ,WAAW,KAAK,CAAC,eAAe;AAC1C,WAAO;AAAA,EACT;AAGA,MAAI,SAAS;AACX,UAAM,QAAQ,IAAI,OAAO,SAAS,GAAG;AACrC,UAAM,cAAc,QAAQ,KAAK,CAAC,MAAc,MAAM,KAAK,CAAC,CAAC,KAAK,MAAM,KAAK,aAAa;AAC1F,QAAI,CAAC,YAAa,QAAO;AAAA,EAC3B;AAGA,MAAI,YAAY;AACd,WAAO,kBAAkB,GAAG,YAAY,OAAO;AAAA,EACjD;AAEA,SAAO;AACT;AAKA,SAASC,oBAAmB,GAAa;AACvC,SAAO;AAAA,IACL,WAAW,qBAAqB,EAAE,aAAa,IAAI,EAAE,gBAAgB,CAAC;AAAA,IACtE,SAAS,qBAAqB,EAAE,UAAU,IAAI,EAAE,aAAa,CAAC;AAAA,IAC9D,YAAY,qBAAqB,EAAE,cAAc,IAAI,EAAE,iBAAiB,CAAC;AAAA,EAC3E;AACF;AAKA,eAAsB,aACpB,OACA,SAMyB;AACzB,MAAI,CAAC,OAAO;AACV,UAAM,IAAI,cAAc,iCAAiC;AAAA,EAC3D;AAEA,QAAM,EAAE,UAAU,SAAS,YAAY,QAAQ,GAAG,IAAI;AACtD,QAAM,aAAiC,EAAE,UAAU,SAAS,WAAW;AAEvE,MAAI;AACF,UAAM,aAAa,MAAM,mBAAmB,EAAE,KAAK,CAAC;AACpD,UAAM,QAAQ,MAAM,OAAO,UAAU,EAClC,MAAM,YAAY,EAClB,MAAM,KAAK,IAAI,QAAQ,IAAI,GAAG,CAAC;AAElC,UAAM,UAAU,MAAM,MAAM,QAAQ;AAEpC,UAAM,WAAY,QACf,OAAO,CAAC,MAAM,cAAc,CAAC,KAAK,oBAAoB,GAAG,UAAU,CAAC;AAEvE,WAAO,SAAS,MAAM,GAAG,KAAK,EAAE,IAAI,CAAC,OAAiB;AAAA,MACpD,SAAS,EAAE;AAAA,MACX,UAAU;AAAA,QACR,GAAG,0BAA0B,CAAC;AAAA,QAC9B,SAASA,oBAAmB,CAAC;AAAA,MAC/B;AAAA,MACA,OAAO;AAAA,MACP,WAAW,mBAAmB,CAAC;AAAA,IACjC,EAAE;AAAA,EACJ,SAAS,OAAO;AACd,UAAM,UAAU,OAAO,yBAAyB;AAAA,EAClD;AACF;AAOA,eAAsB,QACpB,OACA,UAGI,CAAC,GACoB;AACzB,MAAI,CAAC,OAAO;AACV,UAAM,IAAI,cAAc,iCAAiC;AAAA,EAC3D;AAEA,MAAI;AAEF,UAAM,YAAY,MAAM,MAAM,UAAU;AAMxC,UAAM,iBAAiB;AACvB,UAAM,UAAU,MAAM,eAAe,OAAO;AAAA,MAC1C,GAAG;AAAA,MACH,OAAO,KAAK,IAAI,WAAW,cAAc;AAAA,IAC3C,CAAC;AAED,WAAO;AAAA,EACT,SAAS,OAAO;AACd,UAAM,UAAU,OAAO,2BAA2B;AAAA,EACpD;AACF;AAlbA,IAgBM,eACA,mBAMA,sBAWA,oBAyPA;AA3RN;AAAA;AAAA;AACA;AACA;AACA;AACA;AACA;AAWA,IAAM,gBAAgB,IAAI,qBAAqB;AAC/C,IAAM,oBAAoB,IAAI,yBAAyB;AAMvD,IAAM,uBAAuB;AAAA,MAC3B,0BAAqB,GAAG,IAAI,kDAA6C;AAAA,MACzE,8BAAuB,GAAG,IAAI,sDAA+C;AAAA,MAC7E,sCAA2B,GAAG,IAAI,8DAAmD;AAAA,IACvF;AAOA,IAAM,qBAAqB;AAAA,MACzB,0BAAqB,GAAG,IAAI,iBAAiB,EAC1C,YAAY,aAAa,EACzB,YAAY,iBAAiB,EAC7B,YAAY,8CAAyC,CAAC;AAAA,MACzD,8BAAuB,GAAG,IAAI,iBAAiB,EAC5C,YAAY,aAAa,EACzB,YAAY,iBAAiB,EAC7B,YAAY,kDAA2C,CAAC;AAAA,MAC3D,sCAA2B,GAAG,IAAI,iBAAiB,EAChD,YAAY,aAAa,EACzB,YAAY,iBAAiB,EAC7B,YAAY,0DAA+C,CAAC;AAAA,IACjE;AA4OA,IAAM,sBAAmD;AAAA,MACvD,UAAU,oBAAI,IAAI,CAAC,YAAY,QAAQ,CAAC;AAAA,MACxC,OAAO,oBAAI,IAAI,CAAC,OAAO,CAAC;AAAA,MACxB,WAAW,oBAAI,IAAI,CAAC,WAAW,CAAC;AAAA,IAClC;AAAA;AAAA;;;AC3OA,SAAS,uBACP,QACA,SACA,UACgB;AAChB,SAAO;AAAA,IACL,QAAQ,MAAM,KAAK,MAAM;AAAA,IACzB;AAAA,IACA,MAAM,SAAS;AAAA,IACf,WAAW,SAAS;AAAA,IACpB,SAAS,SAAS;AAAA,IAClB,MAAM,SAAS;AAAA,IACf,UAAU,SAAS;AAAA;AAAA,IAEnB,eAAe,iBAAiB,SAAS,SAAS,SAAS;AAAA,IAC3D,YAAY,iBAAiB,SAAS,SAAS,OAAO;AAAA,IACtD,gBAAgB,iBAAiB,SAAS,SAAS,UAAU;AAAA;AAAA,IAE7D,YAAY,SAAS,cAAc;AAAA,IACnC,YAAY,SAAS,cAAc;AAAA,IACnC,aAAa,SAAS,eAAe;AAAA,IACrC,YAAY,SAAS,cAAc;AAAA,IACnC,qBAAqB,SAAS,uBAAuB;AAAA,IACrD,YAAY,iBAAiB,SAAS,UAAU;AAAA,IAChD,WAAW,SAAS,aAAa;AAAA,IACjC,SAAS,iBAAiB,SAAS,OAAO;AAAA;AAAA,IAE1C,gBAAgB,SAAS,kBAAkB;AAAA,IAC3C,oBAAoB,SAAS,sBAAsB;AAAA,IACnD,gBAAgB,SAAS,kBAAkB;AAAA,IAC3C,cAAc,SAAS,gBAAgB;AAAA,EACzC;AACF;AAKA,SAAS,iBAAiB,KAAqC;AAC7D,SAAO,OAAO,IAAI,SAAS,IAAI,MAAM,CAAC,EAAE;AAC1C;AAKA,SAAS,iBAAiB,OAAyD;AACjF,QAAM,OAAO,KAAK,MAAM,MAAM,QAAQ,SAAS,CAAC;AAChD,SAAO;AAAA,IACL;AAAA,MACE,SAAS,MAAM,QAAQ,MAAM,GAAG,IAAI;AAAA,MACpC,WAAW,MAAM,UAAU,MAAM,GAAG,IAAI;AAAA,MACxC,UAAU,MAAM,SAAS,MAAM,GAAG,IAAI;AAAA,IACxC;AAAA,IACA;AAAA,MACE,SAAS,MAAM,QAAQ,MAAM,IAAI;AAAA,MACjC,WAAW,MAAM,UAAU,MAAM,IAAI;AAAA,MACrC,UAAU,MAAM,SAAS,MAAM,IAAI;AAAA,IACrC;AAAA,EACF;AACF;AAKA,SAAS,wBAAwB,OAAyC;AACxE,SAAO,MAAM,QAAQ;AAAA,IAAI,CAAC,QAAQ,MAChC,uBAAuB,QAAQ,MAAM,SAAS,CAAC,GAAG,MAAM,UAAU,CAAC,CAAC;AAAA,EACtE;AACF;AAUA,eAAsB,YACpB,IACA,OACA,WACA,SACA,WACA,UAC8B;AAC9B,MAAI,CAAC,IAAI;AACP,UAAM,IAAI,cAAc,iCAAiC;AAAA,EAC3D;AAEA,MAAI,QAAQ,WAAW,UAAU,UAAU,QAAQ,WAAW,SAAS,QAAQ;AAC7E,UAAM,IAAI,cAAc,qEAAqE;AAAA,MAC3F,eAAe,QAAQ;AAAA,MACvB,iBAAiB,UAAU;AAAA,MAC3B,gBAAgB,SAAS;AAAA,IAC3B,CAAC;AAAA,EACH;AAGA,MAAI,QAAQ,WAAW,GAAG;AACxB,WAAO;AAAA,EACT;AAGA,MAAI,QAAQ,SAAS,0BAA0B;AAC7C,QAAI,eAAe;AACnB,aAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK,0BAA0B;AACjE,YAAM,eAAe,QAAQ,MAAM,GAAG,KAAK,IAAI,IAAI,0BAA0B,QAAQ,MAAM,CAAC;AAC5F,YAAM,gBAAgB,UAAU,MAAM,GAAG,KAAK,IAAI,IAAI,0BAA0B,QAAQ,MAAM,CAAC;AAC/F,YAAM,gBAAgB,SAAS,MAAM,GAAG,KAAK,IAAI,IAAI,0BAA0B,QAAQ,MAAM,CAAC;AAE9F,qBAAe,MAAM,oBAAoB,IAAI,cAAc,WAAW,cAAc,eAAe,aAAa;AAAA,IAClH;AACA,QAAI,CAAC,cAAc;AACjB,YAAM,IAAI,cAAc,4CAA4C;AAAA,IACtE;AACA,WAAO;AAAA,EACT,OAAO;AACL,WAAO,oBAAoB,IAAI,OAAO,WAAW,SAAS,WAAW,QAAQ;AAAA,EAC/E;AACF;AAQA,eAAe,oBACb,IACA,OACA,WACA,SACA,WACA,UACuB;AACvB,QAAM,QAA0B,CAAC,EAAE,SAAS,WAAW,SAAS,CAAC;AACjE,QAAM,gBAAkC,CAAC;AACzC,MAAI,eAAe;AACnB,MAAI;AAEJ,SAAO,MAAM,SAAS,GAAG;AACvB,UAAM,QAAQ,MAAM,MAAM;AAC1B,UAAM,eAAe,MAAM,eAAe,IAAI,cAAc,WAAW,KAAK;AAE5E,QAAI,aAAa,SAAS;AACxB,qBAAe,aAAa;AAAA,IAC9B,OAAO;AACL,kBAAY,aAAa;AACzB,yBAAmB,OAAO,OAAO,aAAa;AAAA,IAChD;AAAA,EACF;AAEA,uBAAqB,eAAe,SAAS;AAE7C,MAAI,CAAC,cAAc;AACjB,UAAM,IAAI,cAAc,4CAA4C;AAAA,EACtE;AAEA,SAAO;AACT;AAeA,eAAe,eACb,IACA,cACA,WACA,OACuB;AACvB,MAAI;AACF,UAAM,UAAU,wBAAwB,KAAK;AAE7C,QAAI,CAAC,cAAc;AACjB,YAAM,WAAW,MAAM,GAAG,YAAY,WAAW,OAAO;AACxD,aAAO,EAAE,SAAS,MAAM,OAAO,SAAS;AAAA,IAC1C,OAAO;AACL,YAAM,aAAa,IAAI,OAAO;AAC9B,aAAO,EAAE,SAAS,MAAM,OAAO,aAAa;AAAA,IAC9C;AAAA,EACF,SAAS,OAAO;AAEd,WAAO,EAAE,SAAS,OAAO,OAAO,cAAc,MAAsB;AAAA,EACtE;AACF;AAKA,SAAS,mBACP,OACA,OACA,eACM;AACN,MAAI,MAAM,QAAQ,SAAS,0BAA0B;AAEnD,UAAM,CAAC,WAAW,UAAU,IAAI,iBAAiB,KAAK;AACtD,UAAM,KAAK,WAAW,UAAU;AAAA,EAClC,OAAO;AAEL,kBAAc,KAAK,KAAK;AAAA,EAC1B;AACF;AAMA,SAAS,qBAAqB,eAAiC,WAAyB;AACtF,MAAI,cAAc,WAAW,EAAG;AAEhC,QAAM,cAAc,cAAc,OAAO,CAAC,KAAK,UAAU,MAAM,MAAM,QAAQ,QAAQ,CAAC;AACtF,QAAM,IAAI;AAAA,IACR,oBAAoB,WAAW;AAAA,IAC/B;AAAA,MACE,eAAe,cAAc;AAAA,MAC7B,cAAc;AAAA,MACd,YAAY,cAAc,CAAC,EAAE,UAAU,CAAC,EAAE;AAAA,MAC1C,WAAW,WAAW;AAAA,IACxB;AAAA,EACF;AACF;AA3RA;AAAA;AAAA;AACA;AACA;AAAA;AAAA;;;ACFA,OAAOC,UAAQ;AACf,OAAOC,YAAU;AAgBjB,eAAsB,MACpB,IACA,OACA,WACA,QACe;AACf,MAAI,CAAC,IAAI;AACP,UAAM,IAAI,cAAc,iCAAiC;AAAA,EAC3D;AAEA,MAAI;AAEF,QAAI,OAAO;AACT,YAAM,GAAG,UAAU,SAAS;AAAA,IAC9B;AAIA,QAAI,QAAQ;AACV,YAAM,WAAWA,OAAK,KAAK,QAAQ,GAAG,SAAS,QAAQ;AACvD,UAAI;AACF,cAAMD,KAAG,GAAG,UAAU,EAAE,WAAW,MAAM,OAAO,KAAK,CAAC;AAAA,MACxD,QAAQ;AAAA,MAER;AAAA,IACF;AAAA,EACF,SAAS,OAAO;AACd,UAAM,UAAU,OAAO,iCAAiC;AAAA,EAC1D;AACF;AAKA,eAAsB,aACpB,OACA,UACe;AACf,MAAI,CAAC,OAAO;AACV,UAAM,IAAI,cAAc,iCAAiC;AAAA,EAC3D;AAEA,MAAI;AACF,UAAM,MAAM,OAAO,WAAW,QAAQ,GAAG;AAAA,EAC3C,SAAS,OAAO;AACd,UAAM,UAAU,OAAO,4CAA4C;AAAA,EACrE;AACF;AAKA,eAAsB,WACpB,IACA,OACA,WACA,QACA,UACA,SACA,WACA,UACuB;AACvB,MAAI,CAAC,OAAO;AACV,UAAM,IAAI,cAAc,iCAAiC;AAAA,EAC3D;AAEA,MAAI;AAEF,UAAM,aAAa,OAAO,QAAQ;AAGlC,QAAI,eAAe;AACnB,QAAI,QAAQ,SAAS,GAAG;AACtB,qBAAe,MAAM,YAAY,IAAI,OAAO,WAAW,SAAS,WAAW,QAAQ;AACnF,UAAI,CAAC,cAAc;AACjB,cAAM,IAAI,cAAc,wCAAwC;AAAA,MAClE;AAAA,IACF;AAGA,UAAM,iBAAiB,MAAM;AAE7B,WAAO;AAAA,EACT,SAAS,OAAO;AACd,UAAM,UAAU,OAAO,0CAA0C;AAAA,EACnE;AACF;AAvGA;AAAA;AAAA;AAGA;AACA,IAAAE;AACA;AAAA;AAAA;;;ACLA;AAAA;AAAA;AAAA;AAAA,YAAY,aAAa;AACzB,OAAOC,YAAU;AACjB,OAAOC,SAAQ;AACf,OAAOC,aAAY;AAHnB,IAgBa;AAhBb;AAAA;AAAA;AAMA;AACA,IAAAC;AACA;AACA;AACA;AACA;AAKO,IAAM,WAAN,MAAM,UAAsC;AAAA,MACzC,KAA+B;AAAA,MAC/B,QAA6B;AAAA,MACrB;AAAA,MACC,YAAY;AAAA,MACrB,mBAA2B;AAAA,MAC3B,iBAAyB;AAAA,MAEjC,YAAY,aAAqB;AAE/B,cAAM,cAAcH,OAAK,SAAS,WAAW;AAG7C,cAAM,WAAWE,QACd,WAAW,KAAK,EAChB,OAAO,WAAW,EAClB,OAAO,KAAK,EACZ,UAAU,GAAG,CAAC;AAEjB,aAAK,SAASF,OAAK;AAAA,UACjBC,IAAG,QAAQ;AAAA,UACX;AAAA,UACA;AAAA,UACA,GAAG,WAAW,IAAI,QAAQ;AAAA,QAC5B;AAAA,MACF;AAAA,MAEA,MAAM,aAA4B;AAChC,YAAI;AACF,eAAK,KAAK,MAAc,gBAAQ,KAAK,MAAM;AAE3C,cAAI;AACF,iBAAK,QAAQ,MAAM,KAAK,GAAG,UAAU,KAAK,SAAS;AAAA,UACrD,QAAQ;AAEN,iBAAK,QAAQ;AAAA,UACf;AAGA,cAAI;AACF,iBAAK,iBAAiB,MAAM,gBAAgB,KAAK,MAAM;AAAA,UACzD,QAAQ;AAEN,iBAAK,iBAAiB;AAAA,UACxB;AAAA,QACF,SAAS,OAAgB;AACvB,gBAAM,UAAU,OAAO,wCAAwC,EAAE,QAAQ,KAAK,OAAO,CAAC;AAAA,QACxF;AAAA,MACF;AAAA,MAEA,MAAM,YACJ,SACA,WACA,UACe;AACf,YAAI,CAAC,KAAK,IAAI;AACZ,gBAAM,IAAI,cAAc,iCAAiC;AAAA,QAC3D;AAGA,aAAK,QAAQ,MAAe;AAAA,UAC1B,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL;AAAA,UACA;AAAA,UACA;AAAA,QACF;AAAA,MACF;AAAA,MAEA,MAAM,OACJ,aACA,QAAgB,GAChB,OACyB;AACzB,YAAI,CAAC,KAAK,OAAO;AACf,gBAAM,IAAI,cAAc,iCAAiC;AAAA,QAC3D;AAEA,YAAI;AACF,iBAAO,MAAe,OAAO,KAAK,OAAO,aAAa,OAAO,KAAK;AAAA,QACpE,SAAS,OAAO;AACd,gBAAM,WAAW,OAAO,KAAK;AAG7B,cAAI,SAAS,SAAS,YAAY,KAAK,SAAS,SAAS,QAAQ,GAAG;AAElE,gBAAI;AACF,oBAAM,KAAK,WAAW;AACtB,kBAAI,CAAC,KAAK,OAAO;AACf,sBAAM,IAAI,cAAc,oDAAoD;AAAA,cAC9E;AACA,qBAAO,MAAe,OAAO,KAAK,OAAO,aAAa,OAAO,KAAK;AAAA,YACpE,SAAS,YAAqB;AAC5B,oBAAM,IAAI;AAAA,gBACR;AAAA,gBACA,EAAE,eAAe,WAAW;AAAA,cAC9B;AAAA,YACF;AAAA,UACF;AAEA,gBAAM;AAAA,QACR;AAAA,MACF;AAAA,MAEA,MAAM,eAAe,SAIO;AAC1B,YAAI,CAAC,KAAK,OAAO;AACf,gBAAM,IAAI,cAAc,iCAAiC;AAAA,QAC3D;AACA,eAAgB,eAAe,KAAK,OAAO,OAAO;AAAA,MACpD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,MAAM,QAAQ,UAGV,CAAC,GAA4B;AAC/B,YAAI,CAAC,KAAK,OAAO;AACf,gBAAM,IAAI,cAAc,iCAAiC;AAAA,QAC3D;AACA,eAAgB,QAAQ,KAAK,OAAO,OAAO;AAAA,MAC7C;AAAA,MAEA,MAAM,aAAa,SAKS;AAC1B,YAAI,CAAC,KAAK,OAAO;AACf,gBAAM,IAAI,cAAc,iCAAiC;AAAA,QAC3D;AACA,eAAgB,aAAa,KAAK,OAAO,OAAO;AAAA,MAClD;AAAA,MAEA,MAAM,QAAuB;AAC3B,YAAI,CAAC,KAAK,IAAI;AACZ,gBAAM,IAAI,cAAc,iCAAiC;AAAA,QAC3D;AACA,cAAqB,MAAM,KAAK,IAAI,KAAK,OAAO,KAAK,WAAW,KAAK,MAAM;AAC3E,aAAK,QAAQ;AAAA,MACf;AAAA,MAEA,MAAM,aAAa,UAAiC;AAClD,YAAI,CAAC,KAAK,OAAO;AACf,gBAAM,IAAI,cAAc,iCAAiC;AAAA,QAC3D;AACA,cAAqB,aAAa,KAAK,OAAO,QAAQ;AAAA,MACxD;AAAA,MAEA,MAAM,WACJ,UACA,SACA,WACA,UACe;AACf,YAAI,CAAC,KAAK,IAAI;AACZ,gBAAM,IAAI,cAAc,4CAA4C;AAAA,QACtE;AACA,YAAI,CAAC,KAAK,OAAO;AACf,gBAAM,IAAI,cAAc,uCAAuC;AAAA,QACjE;AACA,aAAK,QAAQ,MAAqB;AAAA,UAChC,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,QACF;AAAA,MACF;AAAA,MAEA,MAAM,eAAiC;AACrC,cAAM,MAAM,KAAK,IAAI;AAGrB,YAAI,MAAM,KAAK,mBAAmB,KAAM;AACtC,iBAAO;AAAA,QACT;AAEA,aAAK,mBAAmB;AAExB,YAAI;AACF,gBAAM,UAAU,MAAM,gBAAgB,KAAK,MAAM;AAEjD,cAAI,UAAU,KAAK,gBAAgB;AACjC,iBAAK,iBAAiB;AACtB,mBAAO;AAAA,UACT;AAEA,iBAAO;AAAA,QACT,SAAS,OAAO;AAEd,iBAAO;AAAA,QACT;AAAA,MACF;AAAA,MAEA,MAAM,YAA2B;AAC/B,YAAI;AAEF,eAAK,QAAQ;AACb,eAAK,KAAK;AAGV,gBAAM,KAAK,WAAW;AAAA,QACxB,SAAS,OAAO;AACd,gBAAM,UAAU,OAAO,wCAAwC;AAAA,QACjE;AAAA,MACF;AAAA,MAEA,oBAA4B;AAC1B,eAAO,KAAK;AAAA,MACd;AAAA,MAEA,iBAAyB;AACvB,YAAI,KAAK,mBAAmB,GAAG;AAC7B,iBAAO;AAAA,QACT;AACA,eAAO,IAAI,KAAK,KAAK,cAAc,EAAE,eAAe;AAAA,MACtD;AAAA,MAEA,MAAM,UAA4B;AAChC,YAAI,CAAC,KAAK,OAAO;AACf,iBAAO;AAAA,QACT;AAEA,YAAI;AACF,gBAAM,QAAQ,MAAM,KAAK,MAAM,UAAU;AAEzC,cAAI,UAAU,GAAG;AACf,mBAAO;AAAA,UACT;AAGA,gBAAM,SAAS,MAAM,KAAK,MACvB,OAAO,MAAM,mBAAmB,EAAE,KAAK,CAAC,CAAC,EACzC,MAAM,KAAK,IAAI,OAAO,CAAC,CAAC,EACxB,QAAQ;AAEX,gBAAM,cAAe,OAA4B;AAAA,YAAK,CAAC,MACrD,EAAE,WACF,EAAE,QAAQ,KAAK,EAAE,SAAS;AAAA,UAC5B;AAEA,iBAAO;AAAA,QACT,QAAQ;AAEN,iBAAO;AAAA,QACT;AAAA,MACF;AAAA,MAEA,aAAa,KAAK,aAAwC;AACxD,cAAM,KAAK,IAAI,UAAS,WAAW;AACnC,cAAM,GAAG,WAAW;AACpB,eAAO;AAAA,MACT;AAAA,IACF;AAAA;AAAA;;;AC3RA;AAAA;AAAA;AAAA;AAAA,OAAOG,UAAQ;AACf,OAAOC,YAAU;AADjB,IAMM,eA8BO;AApCb;AAAA;AAAA;AAEA;AAEA;AAEA,IAAM,gBAAgB;AA8Bf,IAAM,kBAAN,MAAsB;AAAA,MACnB;AAAA,MACA;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,aAAa,QAAQ,QAAQ;AAAA;AAAA;AAAA;AAAA;AAAA,MAMrC,YAAY,WAAmB;AAC7B,aAAK,YAAY;AACjB,aAAK,eAAeA,OAAK,KAAK,WAAW,aAAa;AAAA,MACxD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAWA,MAAM,OAAsC;AAC1C,YAAI;AACF,gBAAM,UAAU,MAAMD,KAAG,SAAS,KAAK,cAAc,OAAO;AAC5D,gBAAM,WAAW,KAAK,MAAM,OAAO;AAGnC,cAAI,SAAS,kBAAkB,sBAAsB;AACnD,oBAAQ;AAAA,cACN,wBAAwB,SAAS,aAAa,kCAAkC,oBAAoB;AAAA,YACtG;AACA,oBAAQ,MAAM,iDAAiD;AAG/D,kBAAM,KAAK,MAAM;AACjB,mBAAO;AAAA,UACT;AAEA,iBAAO;AAAA,QACT,SAAS,OAAO;AAEd,cAAK,MAAgC,SAAS,UAAU;AACtD,mBAAO;AAAA,UACT;AAGA,kBAAQ,MAAM,4CAA4C,KAAK,EAAE;AACjE,iBAAO;AAAA,QACT;AAAA,MACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,MAAM,KAAK,UAAwC;AACjD,YAAI;AAEF,gBAAMA,KAAG,MAAM,KAAK,WAAW,EAAE,WAAW,KAAK,CAAC;AAGlD,gBAAM,iBAAgC;AAAA,YACpC,GAAG;AAAA,YACH,eAAe;AAAA,YACf,aAAa,kBAAkB;AAAA,YAC/B,aAAa,KAAK,IAAI;AAAA,UACxB;AAEA,gBAAM,UAAU,KAAK,UAAU,gBAAgB,MAAM,CAAC;AACtD,gBAAMA,KAAG,UAAU,KAAK,cAAc,SAAS,OAAO;AAAA,QACxD,SAAS,OAAO;AAEd,kBAAQ,MAAM,4CAA4C,KAAK,EAAE;AAAA,QACnE;AAAA,MACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MASA,MAAM,WAAW,UAAkB,OAAiC;AAElE,aAAK,aAAa,KAAK,WAAW,KAAK,YAAY;AACjD,gBAAM,WAAW,MAAM,KAAK,KAAK,KAAK,KAAK,YAAY;AACvD,mBAAS,MAAM,QAAQ,IAAI;AAC3B,gBAAM,KAAK,KAAK,QAAQ;AAAA,QAC1B,CAAC,EAAE,MAAM,WAAS;AAChB,kBAAQ,MAAM,wCAAwC,QAAQ,KAAK,KAAK,EAAE;AAE1E,iBAAO;AAAA,QACT,CAAC;AAGD,cAAM,KAAK;AAAA,MACb;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAWA,MAAM,WAAW,UAAiC;AAEhD,aAAK,aAAa,KAAK,WAAW,KAAK,YAAY;AACjD,gBAAM,WAAW,MAAM,KAAK,KAAK;AACjC,cAAI,CAAC,UAAU;AAEb;AAAA,UACF;AAEA,iBAAO,SAAS,MAAM,QAAQ;AAC9B,gBAAM,KAAK,KAAK,QAAQ;AAAA,QAC1B,CAAC,EAAE,MAAM,WAAS;AAChB,kBAAQ,MAAM,8CAA8C,QAAQ,KAAK,KAAK,EAAE;AAEhF,iBAAO;AAAA,QACT,CAAC;AAGD,cAAM,KAAK;AAAA,MACb;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,MAAM,YAAY,SAAqC;AAErD,aAAK,aAAa,KAAK,WAAW,KAAK,YAAY;AACjD,gBAAM,WAAW,MAAM,KAAK,KAAK,KAAK,KAAK,YAAY;AAEvD,qBAAW,SAAS,SAAS;AAC3B,qBAAS,MAAM,MAAM,QAAQ,IAAI;AAAA,UACnC;AAEA,gBAAM,KAAK,KAAK,QAAQ;AAAA,QAC1B,CAAC,EAAE,MAAM,WAAS;AAChB,kBAAQ,MAAM,wCAAwC,QAAQ,MAAM,WAAW,KAAK,EAAE;AAEtF,iBAAO;AAAA,QACT,CAAC;AAGD,cAAM,KAAK;AAAA,MACb;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,MAAM,eAAe,UAAmC;AAEtD,aAAK,aAAa,KAAK,WAAW,KAAK,YAAY;AACjD,gBAAM,WAAW,MAAM,KAAK,KAAK,KAAK,KAAK,YAAY;AAEvD,mBAAS,WAAW;AACpB,gBAAM,KAAK,KAAK,QAAQ;AAAA,QAC1B,CAAC,EAAE,MAAM,WAAS;AAChB,kBAAQ,MAAM,kDAAkD,KAAK,EAAE;AAEvE,iBAAO;AAAA,QACT,CAAC;AAGD,cAAM,KAAK;AAAA,MACb;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOA,MAAM,kBAAqC;AACzC,cAAM,WAAW,MAAM,KAAK,KAAK;AACjC,YAAI,CAAC,SAAU,QAAO,CAAC;AAEvB,eAAO,OAAO,KAAK,SAAS,KAAK;AAAA,MACnC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,MAAM,gBAAgB,cAAsD;AAC1E,cAAM,WAAW,MAAM,KAAK,KAAK;AACjC,YAAI,CAAC,UAAU;AAEb,iBAAO,MAAM,KAAK,aAAa,KAAK,CAAC;AAAA,QACvC;AAEA,cAAM,eAAyB,CAAC;AAEhC,mBAAW,CAAC,UAAU,KAAK,KAAK,cAAc;AAC5C,gBAAM,QAAQ,SAAS,MAAM,QAAQ;AAErC,cAAI,CAAC,OAAO;AAEV,yBAAa,KAAK,QAAQ;AAAA,UAC5B,WAAW,MAAM,eAAe,OAAO;AAErC,yBAAa,KAAK,QAAQ;AAAA,UAC5B;AAAA,QACF;AAEA,eAAO;AAAA,MACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MASA,MAAM,gBAAgB,cAA8C;AAClE,cAAM,WAAW,MAAM,KAAK,KAAK;AACjC,YAAI,CAAC,SAAU,QAAO,CAAC;AAEvB,cAAM,eAAyB,CAAC;AAEhC,mBAAW,YAAY,OAAO,KAAK,SAAS,KAAK,GAAG;AAClD,cAAI,CAAC,aAAa,IAAI,QAAQ,GAAG;AAC/B,yBAAa,KAAK,QAAQ;AAAA,UAC5B;AAAA,QACF;AAEA,eAAO;AAAA,MACT;AAAA;AAAA;AAAA;AAAA,MAKA,MAAM,QAAuB;AAC3B,YAAI;AACF,gBAAMA,KAAG,OAAO,KAAK,YAAY;AAAA,QACnC,SAAS,OAAO;AAEd,cAAK,MAAgC,SAAS,UAAU;AACtD,oBAAQ,MAAM,6CAA6C,KAAK,EAAE;AAAA,UACpE;AAAA,QACF;AAAA,MACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOQ,cAA6B;AACnC,eAAO;AAAA,UACL,eAAe;AAAA,UACf,aAAa,kBAAkB;AAAA,UAC/B,aAAa,KAAK,IAAI;AAAA,UACtB,OAAO,CAAC;AAAA,QACV;AAAA,MACF;AAAA,IACF;AAAA;AAAA;;;AC1TA;AAAA;AAAA;AAAA;AAAA,OAAOE,UAAQ;AACf,OAAOC,YAAU;AADjB,IAoBa;AApBb;AAAA;AAAA;AAEA;AAkBO,IAAM,kBAAN,MAAsB;AAAA,MACnB;AAAA,MACA;AAAA,MACA,eAAgC;AAAA,MAExC,YAAY,SAAiB,WAAmB;AAC9C,aAAK,UAAU;AACf,aAAK,YAAYA,OAAK,KAAK,WAAW,iBAAiB;AAAA,MACzD;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,MAAc,YAAsC;AAClD,YAAI;AACF,gBAAM,UAAU,MAAMD,KAAG,SAAS,KAAK,WAAW,OAAO;AACzD,iBAAO,KAAK,MAAM,OAAO;AAAA,QAC3B,QAAQ;AAEN,iBAAO;AAAA,QACT;AAAA,MACF;AAAA;AAAA;AAAA;AAAA,MAKA,MAAc,UAAU,OAAgC;AACtD,YAAI;AACF,gBAAM,UAAU,KAAK,UAAU,OAAO,MAAM,CAAC;AAC7C,gBAAMA,KAAG,UAAU,KAAK,WAAW,SAAS,OAAO;AAAA,QACrD,SAAS,OAAO;AAEd,kBAAQ,MAAM,6CAA6C,KAAK,EAAE;AAAA,QACpE;AAAA,MACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,MAAc,qBAAwC;AACpD,cAAM,SAAS,MAAM,iBAAiB,KAAK,OAAO;AAClD,cAAM,SAAS,MAAM,iBAAiB,KAAK,OAAO;AAElD,eAAO;AAAA,UACL;AAAA,UACA;AAAA,UACA,WAAW,KAAK,IAAI;AAAA,QACtB;AAAA,MACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,MAAM,aAAuC;AAE3C,cAAM,SAAS,MAAM,UAAU,KAAK,OAAO;AAC3C,YAAI,CAAC,QAAQ;AACX,iBAAO;AAAA,QACT;AAEA,YAAI;AAEF,eAAK,eAAe,MAAM,KAAK,mBAAmB;AAGlD,gBAAM,gBAAgB,MAAM,KAAK,UAAU;AAE3C,cAAI,CAAC,eAAe;AAElB,kBAAM,KAAK,UAAU,KAAK,YAAY;AACtC,mBAAO;AAAA,UACT;AAGA,gBAAM,gBAAgB,cAAc,WAAW,KAAK,aAAa;AACjE,gBAAM,gBAAgB,cAAc,WAAW,KAAK,aAAa;AAEjE,cAAI,CAAC,iBAAiB,CAAC,eAAe;AAEpC,mBAAO;AAAA,UACT;AAGA,cAAI,eAAyB,CAAC;AAE9B,cAAI,eAAe;AAEjB,gBAAI;AACF,6BAAe,MAAM;AAAA,gBACnB,KAAK;AAAA,gBACL,cAAc;AAAA,gBACd,KAAK,aAAa;AAAA,cACpB;AAAA,YACF,SAAS,OAAO;AAEd,sBAAQ,MAAM,iDAAiD,KAAK,EAAE;AACtE,6BAAe,MAAM;AAAA,gBACnB,KAAK;AAAA,gBACL,cAAc;AAAA,gBACd,KAAK,aAAa;AAAA,cACpB;AAAA,YACF;AAAA,UACF,WAAW,eAAe;AAExB,2BAAe,MAAM;AAAA,cACnB,KAAK;AAAA,cACL,cAAc;AAAA,cACd,KAAK,aAAa;AAAA,YACpB;AAAA,UACF;AAGA,gBAAM,KAAK,UAAU,KAAK,YAAY;AAEtC,iBAAO;AAAA,QACT,SAAS,OAAO;AACd,kBAAQ,MAAM,4CAA4C,KAAK,EAAE;AACjE,iBAAO;AAAA,QACT;AAAA,MACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,MAAM,gBAA0C;AAE9C,cAAM,SAAS,MAAM,UAAU,KAAK,OAAO;AAC3C,YAAI,CAAC,QAAQ;AACX,iBAAO;AAAA,QACT;AAEA,YAAI;AAEF,gBAAM,WAAW,MAAM,KAAK,mBAAmB;AAG/C,cAAI,CAAC,KAAK,cAAc;AACtB,iBAAK,eAAe;AACpB,kBAAM,KAAK,UAAU,QAAQ;AAC7B,mBAAO;AAAA,UACT;AAGA,gBAAM,gBAAgB,KAAK,aAAa,WAAW,SAAS;AAC5D,gBAAM,gBAAgB,KAAK,aAAa,WAAW,SAAS;AAE5D,cAAI,CAAC,iBAAiB,CAAC,eAAe;AAEpC,mBAAO;AAAA,UACT;AAGA,cAAI,eAAyB,CAAC;AAE9B,cAAI,eAAe;AAEjB,gBAAI;AACF,6BAAe,MAAM;AAAA,gBACnB,KAAK;AAAA,gBACL,KAAK,aAAa;AAAA,gBAClB,SAAS;AAAA,cACX;AAAA,YACF,SAAS,OAAO;AAEd,sBAAQ,MAAM,iDAAiD,KAAK,EAAE;AACtE,6BAAe,MAAM;AAAA,gBACnB,KAAK;AAAA,gBACL,KAAK,aAAa;AAAA,gBAClB,SAAS;AAAA,cACX;AAAA,YACF;AAAA,UACF,WAAW,eAAe;AAExB,2BAAe,MAAM;AAAA,cACnB,KAAK;AAAA,cACL,KAAK,aAAa;AAAA,cAClB,SAAS;AAAA,YACX;AAAA,UACF;AAGA,eAAK,eAAe;AACpB,gBAAM,KAAK,UAAU,QAAQ;AAE7B,iBAAO;AAAA,QACT,SAAS,OAAO;AACd,kBAAQ,MAAM,wCAAwC,KAAK,EAAE;AAC7D,iBAAO;AAAA,QACT;AAAA,MACF;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,WAA4B;AAC1B,eAAO,KAAK;AAAA,MACd;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,MAAM,cAA6B;AACjC,YAAI;AACF,eAAK,eAAe,MAAM,KAAK,mBAAmB;AAClD,gBAAM,KAAK,UAAU,KAAK,YAAY;AAAA,QACxC,SAAS,OAAO;AACd,kBAAQ,MAAM,sCAAsC,KAAK,EAAE;AAAA,QAC7D;AAAA,MACF;AAAA,IACF;AAAA;AAAA;;;AC/MO,SAAS,GAAM,OAA4B;AAChD,SAAO,EAAE,IAAI,MAAM,MAAM;AAC3B;AAKO,SAAS,IAAO,OAA4B;AACjD,SAAO,EAAE,IAAI,OAAO,MAAM;AAC5B;AAKO,SAAS,KAAW,QAAwD;AACjF,SAAO,OAAO;AAChB;AAlDA;AAAA;AAAA;AAAA;AAAA;;;ACAA,OAAOE,UAAQ;AACf,OAAOC,YAAU;AAmBV,SAAS,wBAAwB,UAAkB,SAA0B;AAElF,QAAM,QAAQ,WAAW,QAAQ,IAAI,GAAG,QAAQ,OAAO,GAAG,EAAE,QAAQ,OAAO,EAAE;AAC7E,QAAM,aAAa,SAAS,QAAQ,OAAO,GAAG;AAG9C,MAAI,CAACA,OAAK,WAAW,QAAQ,GAAG;AAC9B,WAAO;AAAA,EACT;AAGA,MAAI,WAAW,WAAW,OAAO,GAAG,GAAG;AACrC,WAAO,WAAW,MAAM,KAAK,SAAS,CAAC;AAAA,EACzC;AACA,MAAI,WAAW,WAAW,IAAI,GAAG;AAC/B,WAAO,WAAW,MAAM,KAAK,MAAM;AAAA,EACrC;AAGA,SAAOA,OAAK,SAAS,MAAM,QAAQ,EAAE,QAAQ,OAAO,GAAG;AACzD;AAsCA,eAAe,mBACb,UACA,SACA,YACA,QACA,SACmC;AAEnC,QAAM,YAAY,eAAe,MAAM,IACnC,OAAO,KAAK,YACX,eAAe,MAAM,IAAI,OAAO,SAAS,YAAY;AAC1D,QAAM,eAAe,eAAe,MAAM,IACtC,OAAO,KAAK,eACX,eAAe,MAAM,IAAI,OAAO,SAAS,eAAe;AAC7D,QAAM,SAAS,eAAe,MAAM,IAChC,OAAO,SAAS,SAChB;AACJ,QAAM,cAAc,eAAe,MAAM,IACrC,OAAO,SAAS,cAChB;AAGJ,QAAM,SAAS,UAAU,UAAU,SAAS;AAAA,IAC1C;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF,CAAC;AAED,MAAI,OAAO,WAAW,GAAG;AAEvB,QAAI,SAAS;AACX,cAAQ,MAAM,sBAAsB,QAAQ,EAAE;AAAA,IAChD;AACA,WAAO;AAAA,EACT;AAIA,QAAM,QAAQ,OAAO,IAAI,OAAK,EAAE,OAAO;AACvC,QAAM,UAA0B,CAAC;AAEjC,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK,4BAA4B;AACjE,UAAM,aAAa,MAAM,MAAM,GAAG,KAAK,IAAI,IAAI,4BAA4B,MAAM,MAAM,CAAC;AACxF,UAAM,eAAe,MAAM,WAAW,WAAW,UAAU;AAC3D,YAAQ,KAAK,GAAG,YAAY;AAG5B,QAAI,MAAM,SAAS,4BAA4B;AAC7C,YAAM,IAAI,QAAQ,aAAW,aAAa,OAAO,CAAC;AAAA,IACpD;AAAA,EACF;AAEA,SAAO;AAAA,IACL,YAAY,OAAO;AAAA,IACnB;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;AAaA,eAAsB,gBACpB,UACA,UACA,YACA,QACA,UAAmC,CAAC,GACrB;AACf,QAAM,EAAE,QAAQ,IAAI;AAIpB,QAAM,iBAAiB,wBAAwB,QAAQ;AAEvD,MAAI;AAEF,QAAI;AACF,YAAMD,KAAG,OAAO,QAAQ;AAAA,IAC1B,QAAQ;AAEN,UAAI,SAAS;AACX,gBAAQ,MAAM,wBAAwB,cAAc,EAAE;AAAA,MACxD;AACA,YAAM,SAAS,aAAa,cAAc;AAE1C,YAAME,YAAW,IAAI,gBAAgB,SAAS,MAAM;AACpD,YAAMA,UAAS,WAAW,cAAc;AACxC;AAAA,IACF;AAGA,UAAM,UAAU,MAAMF,KAAG,SAAS,UAAU,OAAO;AAGnD,UAAM,SAAS,MAAM,mBAAmB,gBAAgB,SAAS,YAAY,QAAQ,WAAW,KAAK;AAGrG,UAAM,QAAQ,MAAMA,KAAG,KAAK,QAAQ;AACpC,UAAM,WAAW,IAAI,gBAAgB,SAAS,MAAM;AAEpD,QAAI,WAAW,MAAM;AAEnB,YAAM,SAAS,aAAa,cAAc;AAC1C,YAAM,SAAS,WAAW,gBAAgB;AAAA,QACxC,UAAU;AAAA,QACV,cAAc,MAAM;AAAA,QACpB,YAAY;AAAA,MACd,CAAC;AACD;AAAA,IACF;AAGA,UAAM,SAAS;AAAA,MACb;AAAA,MACA,OAAO;AAAA,MACP,OAAO,OAAO,IAAI,OAAK,EAAE,QAAQ;AAAA,MACjC,OAAO;AAAA,IACT;AAGA,UAAM,SAAS,WAAW,gBAAgB;AAAA,MACxC,UAAU;AAAA,MACV,cAAc,MAAM;AAAA,MACpB,YAAY,OAAO;AAAA,IACrB,CAAC;AAED,QAAI,SAAS;AACX,cAAQ,MAAM,yBAAoB,cAAc,KAAK,OAAO,UAAU,UAAU;AAAA,IAClF;AAAA,EACF,SAAS,OAAO;AAEd,YAAQ,MAAM,wCAA8B,cAAc,KAAK,KAAK,EAAE;AAAA,EACxE;AACF;AASA,eAAe,6BACb,UACA,gBACA,YACA,QACA,SAC4C;AAC5C,MAAI;AAEF,UAAM,QAAQ,MAAMA,KAAG,KAAK,QAAQ;AACpC,UAAM,UAAU,MAAMA,KAAG,SAAS,UAAU,OAAO;AAGnD,UAAM,SAAS,MAAM,mBAAmB,gBAAgB,SAAS,YAAY,QAAQ,OAAO;AAE5F,WAAO,GAAG;AAAA,MACR,UAAU;AAAA;AAAA,MACV;AAAA,MACA,OAAO,MAAM;AAAA,IACf,CAAC;AAAA,EACH,SAAS,OAAO;AACd,WAAO,IAAI,qBAAqB,cAAc,KAAK,KAAK,EAAE;AAAA,EAC5D;AACF;AAmBA,eAAsB,mBACpB,WACA,UACA,YACA,QACA,UAAmC,CAAC,GACnB;AACjB,QAAM,EAAE,QAAQ,IAAI;AACpB,MAAI,iBAAiB;AAGrB,QAAM,kBAAkF,CAAC;AAGzF,aAAW,YAAY,WAAW;AAGhC,UAAM,iBAAiB,wBAAwB,QAAQ;AAEvD,UAAM,SAAS,MAAM,6BAA6B,UAAU,gBAAgB,YAAY,QAAQ,WAAW,KAAK;AAEhH,QAAI,KAAK,MAAM,GAAG;AAChB,YAAM,EAAE,UAAU,YAAY,QAAQ,eAAe,MAAM,IAAI,OAAO;AAEtE,UAAI,kBAAkB,MAAM;AAE1B,YAAI;AACF,gBAAM,SAAS,aAAa,UAAU;AAAA,QACxC,SAAS,OAAO;AAAA,QAEhB;AAGA,cAAM,WAAW,IAAI,gBAAgB,SAAS,MAAM;AACpD,cAAM,SAAS,WAAW,YAAY;AAAA,UACpC,UAAU;AAAA,UACV,cAAc;AAAA,UACd,YAAY;AAAA,QACd,CAAC;AAED;AACA;AAAA,MACF;AAGA,UAAI;AACF,cAAM,SAAS,aAAa,UAAU;AAAA,MACxC,SAAS,OAAO;AAAA,MAEhB;AAGA,YAAM,SAAS;AAAA,QACb,cAAc;AAAA,QACd,cAAc,OAAO,IAAI,OAAK,EAAE,QAAQ;AAAA,QACxC,cAAc;AAAA,MAChB;AAGA,sBAAgB,KAAK;AAAA,QACnB,UAAU;AAAA,QACV,YAAY,cAAc;AAAA,QAC1B;AAAA,MACF,CAAC;AAED,UAAI,SAAS;AACX,gBAAQ,MAAM,yBAAoB,UAAU,KAAK,cAAc,UAAU,UAAU;AAAA,MACrF;AAEA;AAAA,IACF,OAAO;AAEL,UAAI,SAAS;AACX,gBAAQ,MAAM,UAAU,OAAO,KAAK,EAAE;AAAA,MACxC;AAEA,UAAI;AACF,cAAM,SAAS,aAAa,cAAc;AAC1C,cAAM,WAAW,IAAI,gBAAgB,SAAS,MAAM;AACpD,cAAM,SAAS,WAAW,cAAc;AAAA,MAC1C,SAAS,OAAO;AAEd,YAAI,SAAS;AACX,kBAAQ,MAAM,gBAAgB,cAAc,eAAe;AAAA,QAC7D;AAAA,MACF;AAGA;AAAA,IACF;AAAA,EACF;AAGA,MAAI,gBAAgB,SAAS,GAAG;AAC9B,UAAM,WAAW,IAAI,gBAAgB,SAAS,MAAM;AACpD,UAAM,SAAS;AAAA,MACb,gBAAgB,IAAI,YAAU;AAAA,QAC5B,UAAU,MAAM;AAAA,QAChB,cAAc,MAAM;AAAA;AAAA,QACpB,YAAY,MAAM;AAAA,MACpB,EAAE;AAAA,IACJ;AAAA,EACF;AAEA,SAAO;AACT;AA1XA;AAAA;AAAA;AAEA,IAAAG;AAGA;AACA;AACA;AAEA;AAAA;AAAA;;;ACTA,OAAOC,UAAQ;AACf,OAAOC,YAAU;AAsBjB,eAAe,mBACb,SACA,QACA,eACuF;AACvF,MAAI,CAAC,cAAe,QAAO,EAAE,SAAS,MAAM;AAE5C,QAAM,eAAe,MAAM,eAAe;AAC1C,QAAM,SAAS,MAAM,UAAU,OAAO;AACtC,MAAI,CAAC,gBAAgB,CAAC,OAAQ,QAAO,EAAE,SAAS,MAAM;AAEtD,QAAM,aAAa,IAAI,gBAAgB,SAAS,MAAM;AACtD,QAAM,WAAW,WAAW;AAC5B,QAAM,eAAe,WAAW,SAAS;AAEzC,MAAI,CAAC,aAAc,QAAO,EAAE,SAAS,MAAM;AAE3C,QAAM,UAAU,aAAa,WAAW,cAAc,UACtC,aAAa,WAAW,cAAc;AAEtD,SAAO,EAAE,SAAS,aAAa;AACjC;AAKA,SAAS,uBACP,mBACA,gBACA,yBACA,UAC4D;AAC5D,QAAM,kBAAkB,IAAI,IAAI,iBAAiB;AACjD,QAAM,QAAkB,CAAC;AACzB,QAAM,WAAqB,CAAC;AAC5B,QAAM,UAAoB,CAAC;AAG3B,aAAW,YAAY,mBAAmB;AACxC,QAAI,eAAe,IAAI,QAAQ,GAAG;AAChC,UAAI,wBAAwB,IAAI,QAAQ,GAAG;AACzC,iBAAS,KAAK,QAAQ;AAAA,MACxB,OAAO;AACL,cAAM,KAAK,QAAQ;AAAA,MACrB;AAAA,IACF;AAAA,EACF;AAGA,aAAW,YAAY,UAAU;AAC/B,QAAI,CAAC,wBAAwB,IAAI,QAAQ,KAAK,CAAC,gBAAgB,IAAI,QAAQ,GAAG;AAC5E,YAAM,KAAK,QAAQ;AAAA,IACrB;AAAA,EACF;AAGA,aAAW,kBAAkB,yBAAyB;AACpD,QAAI,CAAC,eAAe,IAAI,cAAc,GAAG;AACvC,cAAQ,KAAK,cAAc;AAAA,IAC7B;AAAA,EACF;AAEA,SAAO,EAAE,OAAO,UAAU,QAAQ;AACpC;AAKA,SAAS,uBACP,eACA,SACa;AACb,QAAM,aAAa,oBAAI,IAAY;AACnC,aAAW,YAAY,OAAO,KAAK,aAAa,GAAG;AACjD,eAAW,IAAI,wBAAwB,UAAU,OAAO,CAAC;AAAA,EAC3D;AACA,SAAO;AACT;AAKA,eAAe,sBACb,SACA,eACA,eACA,QACgC;AAChC,QAAM,uBAAuB,MAAM;AAAA,IACjC;AAAA,IACA,cAAc,SAAU;AAAA,IACxB;AAAA,EACF;AACA,QAAM,oBAAoB,qBAAqB,IAAI,QAAM,wBAAwB,IAAI,OAAO,CAAC;AAE7F,QAAM,WAAW,MAAM,YAAY,SAAS,MAAM;AAClD,QAAM,iBAAiB,IAAI,IAAI,QAAQ;AACvC,QAAM,0BAA0B,uBAAuB,cAAc,OAAO,OAAO;AAEnF,QAAM,EAAE,OAAO,UAAU,QAAQ,IAAI;AAAA,IACnC;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AAEA,SAAO,EAAE,OAAO,UAAU,SAAS,QAAQ,oBAAoB;AACjE;AAKA,eAAe,sBACb,SACA,eACA,QACgC;AAChC,QAAM,WAAW,MAAM,YAAY,SAAS,MAAM;AAClD,QAAM,iBAAiB,IAAI,IAAI,QAAQ;AAEvC,QAAM,UAAoB,CAAC;AAC3B,aAAW,YAAY,OAAO,KAAK,cAAc,KAAK,GAAG;AACvD,UAAM,iBAAiB,wBAAwB,UAAU,OAAO;AAChE,QAAI,CAAC,eAAe,IAAI,cAAc,GAAG;AACvC,cAAQ,KAAK,cAAc;AAAA,IAC7B;AAAA,EACF;AAEA,SAAO,EAAE,OAAO,UAAU,UAAU,CAAC,GAAG,SAAS,QAAQ,oBAAoB;AAC/E;AAMA,eAAsB,cACpB,SACA,UACA,QACgC;AAChC,QAAM,WAAW,IAAI,gBAAgB,SAAS,MAAM;AACpD,QAAM,gBAAgB,MAAM,SAAS,KAAK;AAG1C,MAAI,CAAC,eAAe;AAClB,UAAM,WAAW,MAAM,YAAY,SAAS,MAAM;AAClD,WAAO,EAAE,OAAO,UAAU,UAAU,CAAC,GAAG,SAAS,CAAC,GAAG,QAAQ,OAAO;AAAA,EACtE;AAGA,QAAM,WAAW,MAAM,mBAAmB,SAAS,SAAS,QAAQ,cAAc,QAAQ;AAE1F,MAAI,SAAS,WAAW,SAAS,cAAc;AAC7C,QAAI;AACF,aAAO,MAAM,sBAAsB,SAAS,eAAe,SAAS,aAAa,QAAQ,MAAM;AAAA,IACjG,SAAS,OAAO;AACd,cAAQ,KAAK,yDAAyD,KAAK,EAAE;AAC7E,aAAO,MAAM,sBAAsB,SAAS,eAAe,MAAM;AAAA,IACnE;AAAA,EACF;AAGA,SAAO,MAAM,oBAAoB,SAAS,eAAe,MAAM;AACjE;AAMA,eAAe,YACb,SACA,QACmB;AACnB,MAAI;AAEJ,MAAI,eAAe,MAAM,KAAK,OAAO,WAAW,SAAS,GAAG;AAC1D,YAAQ,MAAM,2BAA2B,SAAS,MAAM;AAAA,EAC1D,WAAW,eAAe,MAAM,GAAG;AACjC,YAAQ,MAAM,aAAa;AAAA,MACzB;AAAA,MACA,iBAAiB,OAAO,SAAS;AAAA,MACjC,iBAAiB,OAAO,SAAS;AAAA,IACnC,CAAC;AAAA,EACH,OAAO;AACL,YAAQ,MAAM,aAAa;AAAA,MACzB;AAAA,MACA,iBAAiB,CAAC;AAAA,MAClB,iBAAiB,CAAC;AAAA,IACpB,CAAC;AAAA,EACH;AAGA,SAAO,MAAM,IAAI,QAAM,wBAAwB,IAAI,OAAO,CAAC;AAC7D;AAKA,eAAe,oBACb,SACA,eACA,QACgC;AAChC,QAAM,QAAkB,CAAC;AACzB,QAAM,WAAqB,CAAC;AAC5B,QAAM,UAAoB,CAAC;AAG3B,QAAM,eAAe,MAAM,YAAY,SAAS,MAAM;AACtD,QAAM,iBAAiB,IAAI,IAAI,YAAY;AAI3C,QAAM,0BAA0B,oBAAI,IAAgD;AACpF,aAAW,CAAC,UAAU,KAAK,KAAK,OAAO,QAAQ,cAAc,KAAK,GAAG;AACnE,UAAM,iBAAiB,wBAAwB,UAAU,OAAO;AAChE,4BAAwB,IAAI,gBAAgB,KAAK;AAAA,EACnD;AAIA,QAAM,YAAY,oBAAI,IAAoB;AAE1C,aAAW,YAAY,cAAc;AACnC,QAAI;AAEF,YAAM,eAAeA,OAAK,WAAW,QAAQ,IAAI,WAAWA,OAAK,KAAK,SAAS,QAAQ;AACvF,YAAM,QAAQ,MAAMD,KAAG,KAAK,YAAY;AACxC,gBAAU,IAAI,UAAU,MAAM,OAAO;AAAA,IACvC,QAAQ;AAEN;AAAA,IACF;AAAA,EACF;AAGA,aAAW,CAAC,UAAU,KAAK,KAAK,WAAW;AACzC,UAAM,QAAQ,wBAAwB,IAAI,QAAQ;AAElD,QAAI,CAAC,OAAO;AAEV,YAAM,KAAK,QAAQ;AAAA,IACrB,WAAW,MAAM,eAAe,OAAO;AAErC,eAAS,KAAK,QAAQ;AAAA,IACxB;AAAA,EACF;AAGA,aAAW,kBAAkB,wBAAwB,KAAK,GAAG;AAC3D,QAAI,CAAC,eAAe,IAAI,cAAc,GAAG;AACvC,cAAQ,KAAK,cAAc;AAAA,IAC7B;AAAA,EACF;AAEA,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA,QAAQ;AAAA,EACV;AACF;AA5RA;AAAA;AAAA;AAGA;AACA;AACA;AACA;AACA;AACA;AAAA;AAAA;;;ACgEO,SAAS,qBAA6B;AAC3C,QAAM,UAAU,kBAAkB,uBAAuB,kBAAkB,MAAM;AACjF;AACA,SAAO;AACT;AAMO,SAAS,sBAA8B;AAC5C,QAAM,UAAU,mBAAmB,wBAAwB,mBAAmB,MAAM;AACpF;AACA,SAAO;AACT;AAMO,SAAS,yBAAiC;AAC/C,QAAM,UAAU,uBAAuB,oBAAoB,uBAAuB,MAAM;AACxF;AACA,SAAO;AACT;AAhGA,IAKM,mBA4BA,oBAkBA,wBAaF,sBACA,uBACA;AAlEJ;AAAA;AAAA;AAKA,IAAM,oBAAoB;AAAA,MACxB;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAEA,IAAM,qBAAqB;AAAA,MACzB;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAEA,IAAM,yBAAyB;AAAA,MAC7B;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAEA,IAAI,uBAAuB;AAC3B,IAAI,wBAAwB;AAC5B,IAAI,oBAAoB;AAAA;AAAA;;;AClExB,IAuBa;AAvBb;AAAA;AAAA;AACA;AAsBO,IAAM,0BAAN,MAAM,yBAAwB;AAAA,MAC3B,iBAAiB;AAAA,MACjB;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA;AAAA,MAGR,OAAwB,6BAA6B;AAAA;AAAA,MACrD,OAAwB,+BAA+B;AAAA;AAAA,MAEvD,YAAY,YAAoB,SAAc;AAC5C,aAAK,aAAa;AAClB,aAAK,UAAU;AACf,aAAK,eAAe,mBAAmB;AAAA,MACzC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,QAAc;AAEZ,YAAI,KAAK,gBAAgB;AACvB;AAAA,QACF;AAEA,cAAM,yBAAyB,KAAK;AAAA,UAClC,yBAAwB,+BACxB,yBAAwB;AAAA,QAC1B;AAEA,YAAI,cAAc;AAClB,aAAK,iBAAiB,YAAY,MAAM;AAEtC;AACA,cAAI,eAAe,wBAAwB;AACzC,iBAAK,eAAe,mBAAmB;AACvC,0BAAc;AAAA,UAChB;AAGA,eAAK,QAAQ,OAAO,GAAG,KAAK,cAAc,IAAI,KAAK,UAAU,YAAY,KAAK,YAAY;AAAA,QAC5F,GAAG,yBAAwB,0BAA0B;AAAA,MACvD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,iBAAuB;AACrB,aAAK;AAAA,MACP;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,WAAW,SAAuB;AAChC,aAAK,eAAe;AAAA,MACtB;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,OAAa;AACX,YAAI,KAAK,gBAAgB;AACvB,wBAAc,KAAK,cAAc;AACjC,eAAK,iBAAiB;AAAA,QACxB;AAAA,MACF;AAAA;AAAA;AAAA;AAAA,MAKA,oBAA4B;AAC1B,eAAO,KAAK;AAAA,MACd;AAAA;AAAA;AAAA;AAAA,MAKA,gBAAwB;AACtB,eAAO,KAAK;AAAA,MACd;AAAA;AAAA;AAAA;AAAA,MAKA,oBAA4B;AAC1B,eAAO,KAAK;AAAA,MACd;AAAA,IACF;AAAA;AAAA;;;ACxHA;AAAA;AAAA;AAAA;AAAA,OAAOE,UAAQ;AACf,OAAO,SAAuB;AAC9B,OAAOC,YAAW;AAClB,OAAO,YAAY;AAuCnB,SAAS,kBAAkB,QAAuD;AAChF,MAAI,eAAe,MAAM,GAAG;AAC1B,WAAO;AAAA,MACL,aAAa,OAAO,KAAK;AAAA,MACzB,oBAAoB,OAAO,KAAK;AAAA,MAChC,WAAW,OAAO,KAAK;AAAA,MACvB,cAAc,OAAO,KAAK;AAAA,MAC1B,QAAQ,OAAO,SAAS;AAAA,MACxB,aAAa,OAAO,SAAS;AAAA,IAC/B;AAAA,EACF;AAEA,SAAO;AAAA,IACL,aAAa;AAAA,IACb,oBAAoB;AAAA,IACpB,WAAW;AAAA,IACX,cAAc;AAAA,IACd,QAAQ;AAAA,IACR,aAAa;AAAA,EACf;AACF;AAGA,eAAe,iBACb,SACA,QACmB;AACnB,MAAI,eAAe,MAAM,KAAK,OAAO,WAAW,SAAS,GAAG;AAC1D,WAAO,2BAA2B,SAAS,MAAM;AAAA,EACnD;AACA,MAAI,eAAe,MAAM,GAAG;AAC1B,WAAO,aAAa;AAAA,MAClB;AAAA,MACA,iBAAiB,OAAO,SAAS;AAAA,MACjC,iBAAiB,OAAO,SAAS;AAAA,IACnC,CAAC;AAAA,EACH;AACA,SAAO,aAAa,EAAE,SAAS,iBAAiB,CAAC,GAAG,iBAAiB,CAAC,EAAE,CAAC;AAC3E;AAGA,eAAe,6BACb,OACA,YACyB;AACzB,QAAM,UAA0B,CAAC;AACjC,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK,4BAA4B;AACjE,UAAM,aAAa,MAAM,MAAM,GAAG,KAAK,IAAI,IAAI,4BAA4B,MAAM,MAAM,CAAC;AACxF,UAAM,eAAe,MAAM,WAAW,WAAW,UAAU;AAC3D,YAAQ,KAAK,GAAG,YAAY;AAC5B,UAAM,IAAI,QAAQ,aAAW,aAAa,OAAO,CAAC;AAAA,EACpD;AACA,SAAO;AACT;AAUA,eAAe,eACb,SACA,UACA,UACe;AACf,QAAM,EAAE,gBAAAC,iBAAgB,WAAAC,WAAU,IAAI,MAAM;AAC5C,QAAM,EAAE,iBAAAC,iBAAgB,IAAI,MAAM;AAElC,QAAM,eAAe,MAAMF,gBAAe;AAC1C,QAAM,SAAS,MAAMC,WAAU,OAAO;AAEtC,MAAI,CAAC,gBAAgB,CAAC,QAAQ;AAC5B;AAAA,EACF;AAEA,QAAM,aAAa,IAAIC,iBAAgB,SAAS,SAAS,MAAM;AAC/D,QAAM,WAAW,WAAW;AAC5B,QAAM,WAAW,WAAW,SAAS;AAErC,MAAI,UAAU;AACZ,UAAM,SAAS,eAAe,QAAQ;AAAA,EACxC;AACF;AAKA,eAAe,gBACb,cACA,UACA,UACA,SACe;AACf,MAAI,aAAa,WAAW,GAAG;AAC7B;AAAA,EACF;AAEA,UAAQ,MAAM,YAAY,aAAa,MAAM,mBAAmB;AAChE,MAAI,eAAe;AAEnB,aAAW,YAAY,cAAc;AACnC,QAAI;AACF,YAAM,SAAS,aAAa,QAAQ;AACpC,YAAM,SAAS,WAAW,QAAQ;AAClC;AAAA,IACF,SAAS,KAAK;AACZ,cAAQ;AAAA,QACN,0BAA0B,QAAQ,MAAM,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,CAAC;AAAA,MAC1F;AAAA,IACF;AAAA,EACF;AAEA,UAAQ,QAAQ,WAAW,YAAY,IAAI,aAAa,MAAM,gBAAgB;AAChF;AAKA,eAAe,cACb,YACA,eACA,UACA,YACA,QACA,SACA,SACe;AACf,QAAM,eAAe,CAAC,GAAG,YAAY,GAAG,aAAa;AAErD,MAAI,aAAa,WAAW,GAAG;AAC7B;AAAA,EACF;AAEA,UAAQ,MAAM,cAAc,aAAa,MAAM,mBAAmB;AAClE,QAAM,QAAQ,MAAM;AAAA,IAClB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,EAAE,SAAS,QAAQ,QAAQ;AAAA,EAC7B;AAEA,QAAM,iBAAiB,SAAS,MAAM;AACtC,UAAQ;AAAA,IACN,iCAAiC,KAAK,IAAI,aAAa,MAAM;AAAA,EAC/D;AACF;AAMA,eAAe,oBACb,SACA,UACA,QACA,SACA,SACkB;AAClB,UAAQ,OAAO;AACf,QAAM,WAAW,IAAI,gBAAgB,SAAS,MAAM;AACpD,QAAM,gBAAgB,MAAM,SAAS,KAAK;AAE1C,MAAI,CAAC,eAAe;AAClB,WAAO;AAAA,EACT;AAEA,QAAM,UAAU,MAAM,cAAc,SAAS,UAAU,MAAM;AAE7D,MAAI,QAAQ,WAAW,QAAQ;AAC7B,YAAQ,OAAO;AACf,WAAO;AAAA,EACT;AAEA,QAAM,eAAe,QAAQ,MAAM,SAAS,QAAQ,SAAS;AAC7D,QAAM,eAAe,QAAQ,QAAQ;AAErC,MAAI,iBAAiB,KAAK,iBAAiB,GAAG;AAC5C,YAAQ,QAAQ,4CAA4C;AAC5D,WAAO;AAAA,EACT;AAEA,UAAQ;AAAA,IACN,qBAAqB,YAAY,oBAAoB,YAAY,eAAe,QAAQ,MAAM;AAAA,EAChG;AAGA,UAAQ,MAAM,uBAAuB,CAAC;AACtC,QAAM,aAAa,IAAI,gBAAgB;AACvC,QAAM,WAAW,WAAW;AAC5B,UAAQ,QAAQ,wBAAwB;AAGxC,QAAM,gBAAgB,QAAQ,SAAS,UAAU,UAAU,OAAO;AAClE,QAAM,cAAc,QAAQ,OAAO,QAAQ,UAAU,UAAU,YAAY,QAAQ,SAAS,OAAO;AAGnG,QAAM,eAAe,SAAS,UAAU,QAAQ;AAEhD,UAAQ,IAAIH,OAAM,IAAI,kBAAkB,GAAGA,OAAM,KAAK,YAAY,GAAGA,OAAM,IAAI,yBAAyB,CAAC;AACzG,SAAO;AACT;AAKA,eAAe,iBACb,SACA,UACA,QACA,SACA,SACe;AAEf,UAAQ,OAAO;AACf,QAAM,SAAS,MAAM;AAGrB,UAAQ,OAAO;AACf,QAAM,QAAQ,MAAM,iBAAiB,SAAS,MAAM;AAEpD,MAAI,MAAM,WAAW,GAAG;AACtB,YAAQ,KAAK,yBAAyB;AACtC;AAAA,EACF;AAEA,UAAQ,OAAO,SAAS,MAAM,MAAM;AAGpC,UAAQ,OAAO,uBAAuB;AACtC,QAAM,aAAa,IAAI,gBAAgB;AACvC,QAAM,WAAW,WAAW;AAC5B,UAAQ,QAAQ,wBAAwB;AAGxC,QAAM,cAAc,kBAAkB,MAAM;AAC5C,QAAM,oBAAoB;AAE1B,UAAQ,MAAM,yBAAyB,YAAY,WAAW,kBAAkB;AAEhF,QAAM,YAAY,KAAK,IAAI;AAC3B,MAAI,kBAAkB;AAGtB,QAAM,mBAAuC,CAAC;AAC9C,QAAM,QAAQ,OAAO,YAAY,WAAW;AAG5C,QAAM,qBAAqF,CAAC;AAG5F,QAAM,kBAAkB,IAAI,wBAAwB,MAAM,QAAQ,OAAO;AACzE,kBAAgB,MAAM;AAEtB,MAAI;AAMF,QAAI,gBAAsC;AAC1C,QAAI,kBAAwC;AAI5C,UAAM,2BAA2B,YAA2B;AAI1D,UAAI,iBAAiB;AACnB,0BAAkB,gBAAgB,KAAK,MAAM,gBAAgB,CAAC;AAAA,MAChE,OAAO;AACL,0BAAkB,gBAAgB;AAAA,MACpC;AACA,aAAO;AAAA,IACT;AAGA,UAAM,kBAAkB,YAA2B;AACjD,UAAI,iBAAiB,WAAW,EAAG;AAEnC,YAAM,iBAAiB;AAEvB,UAAI;AACF,cAAM,YAAY,iBAAiB,OAAO,GAAG,iBAAiB,MAAM;AAGpE,iBAAS,IAAI,GAAG,IAAI,UAAU,QAAQ,KAAK,YAAY,oBAAoB;AACzE,gBAAM,QAAQ,UAAU,MAAM,GAAG,KAAK,IAAI,IAAI,YAAY,oBAAoB,UAAU,MAAM,CAAC;AAC/F,gBAAM,QAAQ,MAAM,IAAI,UAAQ,KAAK,OAAO;AAE5C,0BAAgB,WAAW,oBAAoB,CAAC;AAChD,gBAAM,mBAAmB,MAAM,6BAA6B,OAAO,UAAU;AAC7E,6BAAmB,MAAM;AAEzB,0BAAgB,WAAW,aAAa,MAAM,MAAM,8BAA8B;AAClF,gBAAM,SAAS,YAAY,kBAAkB,MAAM,IAAI,UAAQ,KAAK,MAAM,QAAQ,GAAG,KAAK;AAC1F,gBAAM,IAAI,QAAQ,aAAW,aAAa,OAAO,CAAC;AAAA,QACpD;AAEA,wBAAgB,WAAW,mBAAmB,CAAC;AAAA,MACjD,UAAE;AACA,YAAI,oBAAoB,eAAgB,mBAAkB;AAAA,MAC5D;AAAA,IACF;AAGF,UAAM,eAAe,MAAM;AAAA,MAAI,CAAC,SAC9B,MAAM,YAAY;AAChB,YAAI;AAEF,gBAAM,QAAQ,MAAMD,KAAG,KAAK,IAAI;AAChC,gBAAM,UAAU,MAAMA,KAAG,SAAS,MAAM,OAAO;AAE/C,gBAAM,SAAS,UAAU,MAAM,SAAS;AAAA,YACtC,WAAW,YAAY;AAAA,YACvB,cAAc,YAAY;AAAA,YAC1B,QAAQ,YAAY;AAAA,YACpB,aAAa,YAAY;AAAA,UAC3B,CAAC;AAED,cAAI,OAAO,WAAW,GAAG;AACvB,4BAAgB,eAAe;AAC/B;AAAA,UACF;AAIA;AAEE,gBAAI,eAAe;AACjB,oBAAM;AAAA,YACR;AAGA,gBAAI;AACJ,4BAAgB,IAAI,QAAc,aAAW;AAC3C,+BAAiB;AAAA,YACnB,CAAC;AAED,gBAAI;AAEF,yBAAW,SAAS,QAAQ;AAC1B,iCAAiB,KAAK;AAAA,kBACpB;AAAA,kBACA,SAAS,MAAM;AAAA,gBACjB,CAAC;AAAA,cACH;AAGA,iCAAmB,KAAK;AAAA,gBACtB,UAAU;AAAA,gBACV,YAAY,OAAO;AAAA,gBACnB,OAAO,MAAM;AAAA,cACf,CAAC;AAED,8BAAgB,eAAe;AAI/B,kBAAI,iBAAiB,UAAU,mBAAmB;AAChD,sBAAM,yBAAyB;AAAA,cACjC;AAAA,YACF,UAAE;AAEA,6BAAe;AACf,8BAAgB;AAAA,YAClB;AAAA,UACF;AAAA,QACF,SAAS,OAAO;AACd,cAAI,QAAQ,SAAS;AACnB,oBAAQ,MAAMC,OAAM,OAAO;AAAA,yBAAkB,IAAI,KAAK,KAAK,EAAE,CAAC;AAAA,UAChE;AACA,0BAAgB,eAAe;AAAA,QACjC;AAAA,MACF,CAAC;AAAA,IACH;AAGE,UAAM,QAAQ,IAAI,YAAY;AAG9B,oBAAgB,WAAW,4BAA4B;AACvD,UAAM,yBAAyB;AAAA,EACjC,UAAE;AAEA,oBAAgB,KAAK;AAAA,EACvB;AAGA,UAAQ,MAAM,0BAA0B;AACxC,QAAM,WAAW,IAAI,gBAAgB,SAAS,MAAM;AACpD,QAAM,SAAS;AAAA,IACb,mBAAmB,IAAI,YAAU;AAAA,MAC/B,UAAU,MAAM;AAAA;AAAA,MAEhB,cAAc,MAAM;AAAA,MACpB,YAAY,MAAM;AAAA,IACpB,EAAE;AAAA,EACJ;AAGA,QAAM,eAAe,SAAS,UAAU,QAAQ;AAEhD,UAAQ,QAAQ,gBAAgB;AAGhC,QAAM,iBAAiB,SAAS,MAAM;AAEtC,QAAM,cAAc,KAAK,IAAI,IAAI,aAAa,KAAM,QAAQ,CAAC;AAC7D,UAAQ;AAAA,IACN,WAAW,gBAAgB,kBAAkB,CAAC,WAAW,eAAe,eAAe,SAAS,WAAW,YAAY,WAAW;AAAA,EACpI;AAEA,UAAQ,IAAIA,OAAM,IAAI,kBAAkB,GAAGA,OAAM,KAAK,YAAY,GAAGA,OAAM,IAAI,yBAAyB,CAAC;AAC3G;AAYA,eAAsB,cAAc,UAA2B,CAAC,GAAkB;AAChF,QAAM,UAAU,QAAQ,WAAW,QAAQ,IAAI;AAC/C,QAAM,UAAU,IAAI,8BAA8B,EAAE,MAAM;AAE1D,MAAI;AAEF,YAAQ,OAAO;AACf,UAAM,SAAS,MAAM,cAAc,KAAK,OAAO;AAG/C,YAAQ,OAAO;AACf,UAAM,WAAW,IAAI,SAAS,OAAO;AACrC,UAAM,SAAS,WAAW;AAG1B,QAAI,CAAC,QAAQ,OAAO;AAClB,YAAM,YAAY,MAAM,oBAAoB,SAAS,UAAU,QAAQ,SAAS,OAAO;AACvF,UAAI,WAAW;AACb;AAAA,MACF;AAAA,IACF,OAAO;AACL,cAAQ,OAAO;AAAA,IACjB;AAGA,UAAM,iBAAiB,SAAS,UAAU,QAAQ,SAAS,OAAO;AAAA,EAEpE,SAAS,OAAO;AACd,YAAQ,KAAK,oBAAoB,KAAK,EAAE;AACxC,UAAM;AAAA,EACR;AACF;AAvfA;AAAA;AAAA;AAIA;AACA,IAAAI;AACA;AACA;AACA;AAEA,IAAAC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AAAA;AAAA;;;ACjBA,SAAS,eAAe;AACxB,SAAS,iBAAAC,sBAAqB;AAC9B,SAAS,iBAAAC,sBAAqB;AAC9B,SAAS,WAAAC,UAAS,QAAAC,aAAY;;;ACE9B;AALA,OAAOC,SAAQ;AACf,OAAOC,WAAU;AACjB,SAAS,iBAAAC,sBAAqB;AAC9B,OAAOC,YAAW;AAClB,OAAO,cAAc;;;ACJrB,OAAO,YAAY;AACnB,OAAO,WAAW;AAClB,SAAS,iBAAAC,sBAAqB;AAC9B,SAAS,iBAAAC,sBAAqB;AAC9B,SAAS,WAAAC,UAAS,QAAAC,aAAY;AAK9B,IAAMC,cAAaH,eAAc,YAAY,GAAG;AAChD,IAAMI,aAAYH,SAAQE,WAAU;AACpC,IAAME,WAAUN,eAAc,YAAY,GAAG;AAG7C,IAAIO;AACJ,IAAI;AACF,EAAAA,eAAcD,SAAQH,MAAKE,YAAW,iBAAiB,CAAC;AAC1D,QAAQ;AACN,EAAAE,eAAcD,SAAQH,MAAKE,YAAW,oBAAoB,CAAC;AAC7D;AAGA,IAAM,eAAeE,aAAY;AACjC,IAAM,UAAUA,aAAY;AAK5B,SAAS,UAAU,MAAc,QAAgB,UAAU,GAAW;AACpE,QAAM,QAAQ,KAAK,MAAM,IAAI,EAAE,OAAO,UAAQ,KAAK,KAAK,EAAE,SAAS,CAAC;AAGpE,QAAM,YAAY,KAAK,IAAI,GAAG,MAAM,IAAI,UAAQ,KAAK,MAAM,CAAC;AAE5D,QAAM,mBAAmB,SAAI,OAAO,YAAY,UAAU,CAAC;AAC3D,QAAM,MAAM,SAAI,gBAAgB;AAChC,QAAM,SAAS,SAAI,gBAAgB;AACnC,QAAM,YAAY,SAAI,gBAAgB;AAEtC,QAAM,cAAc,MAAM,IAAI,UAAQ;AACpC,UAAM,WAAW,IAAI,OAAO,YAAY,KAAK,SAAS,OAAO;AAC7D,UAAM,UAAU,IAAI,OAAO,OAAO;AAClC,WAAO,SAAI,OAAO,GAAG,IAAI,GAAG,QAAQ;AAAA,EACtC,CAAC;AAGD,QAAM,WAAW,YAAY,OAAO;AACpC,QAAM,UAAU,KAAK,MAAM,WAAW,CAAC;AACvC,QAAM,WAAW,WAAW;AAC5B,QAAM,iBAAiB,IAAI,OAAO,OAAO,IAAI,SAAS,IAAI,OAAO,QAAQ;AAEzE,QAAM,eAAe,SAAI,IAAI,OAAO,OAAO,CAAC,GAAG,cAAc,GAAG,IAAI,OAAO,OAAO,CAAC;AAEnF,SAAO,CAAC,KAAK,GAAG,aAAa,WAAW,cAAc,MAAM,EAAE,KAAK,IAAI;AACzE;AAKO,SAAS,aAAmB;AACjC,QAAM,SAAS,OAAO,SAAS,QAAQ;AAAA,IACrC,MAAM;AAAA,IACN,kBAAkB;AAAA,IAClB,gBAAgB;AAAA,EAClB,CAAC;AAED,QAAM,SAAS,GAAG,YAAY,OAAO,OAAO;AAC5C,QAAM,cAAc,UAAU,OAAO,KAAK,GAAG,MAAM;AACnD,UAAQ,MAAM,MAAM,KAAK,WAAW,CAAC;AACrC,UAAQ,MAAM;AAChB;AAKO,SAAS,oBAA0B;AACxC,QAAM,SAAS,OAAO,SAAS,QAAQ;AAAA,IACrC,MAAM;AAAA,IACN,kBAAkB;AAAA,IAClB,gBAAgB;AAAA,EAClB,CAAC;AAED,QAAM,SAAS,GAAG,YAAY,OAAO,OAAO;AAC5C,QAAM,cAAc,UAAU,OAAO,KAAK,GAAG,MAAM;AACnD,UAAQ,IAAI,MAAM,KAAK,WAAW,CAAC;AACnC,UAAQ,IAAI;AACd;;;ACnFA;AACA;AACA;AACA;AANA,OAAOC,SAAQ;AACf,OAAOC,WAAU;AACjB,OAAOC,YAAW;AAuBX,IAAM,mBAAN,MAAuB;AAAA,EAC5B,YAA6B,UAAkB,QAAQ,IAAI,GAAG;AAAjC;AAAA,EAAkC;AAAA;AAAA;AAAA;AAAA,EAKvD,gBAAwB;AAC9B,WAAOD,MAAK,KAAK,KAAK,SAAS,mBAAmB;AAAA,EACpD;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,iBAAmC;AACvC,QAAI;AACF,YAAM,aAAa,KAAK,cAAc;AACtC,YAAM,UAAU,MAAMD,IAAG,SAAS,YAAY,OAAO;AACrD,YAAM,SAAS,KAAK,MAAM,OAAO;AACjC,aAAO,eAAe,MAAM;AAAA,IAC9B,SAAS,OAAO;AAEd,aAAO;AAAA,IACT;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,cAAmC;AACvC,UAAM,SAAS,MAAM,kBAAkB,KAAK,OAAO;AAEnD,QAAI,OAAO,YAAY,OAAO,YAAY;AACxC,YAAM,iBAAiBC,MAAK,SAAS,OAAO,UAAU;AACtD,cAAQ,IAAI,8CAAyC,cAAc,EAAE;AACrE,cAAQ,IAAI,+DAAwD;AAAA,IACtE;AAEA,WAAO,OAAO;AAAA,EAChB;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,qBAAoC;AACxC,UAAM,aAAa,KAAK,cAAc;AAEtC,QAAI;AAEF,YAAM,kBAAkB,MAAMD,IAAG,SAAS,YAAY,OAAO;AAC7D,YAAM,iBAAiB,KAAK,MAAM,eAAe;AAGjD,YAAM,kBAAkB,eAAe,cAAc;AACrD,YAAM,YAAY,kBAAkB,CAAC,IAAI,gBAAgB,gBAAgB,aAAa;AACtF,YAAM,aAAa,mBAAmB,UAAU,SAAS;AAEzD,UAAI,CAAC,YAAY;AACf,gBAAQ,IAAIE,OAAM,MAAM,qCAAgC,CAAC;AACzD,gBAAQ,IAAIA,OAAM,IAAI,mBAAmB,CAAC;AAC1C;AAAA,MACF;AAGA,YAAM,aAAa,GAAG,UAAU;AAChC,YAAMF,IAAG,SAAS,YAAY,UAAU;AAGxC,UAAI;AACJ,UAAI,WAAW;AAEf,UAAI,iBAAiB;AACnB,gBAAQ,IAAIE,OAAM,KAAK,8CAAuC,sBAAsB,KAAK,CAAC;AAC1F,yBAAiB,cAAc,cAAc;AAC7C,mBAAW;AAAA,MACb,OAAO;AAEL,yBAAiB,gBAAgB,eAAe,cAAqC;AAErF,gBAAQ,IAAIA,OAAM,IAAI,sBAAsB,CAAC;AAC7C,kBAAU,QAAQ,WAAS,QAAQ,IAAIA,OAAM,IAAI,UAAK,GAAGA,OAAM,KAAK,KAAK,CAAC,CAAC;AAAA,MAC7E;AAGA,YAAMF,IAAG;AAAA,QACP;AAAA,QACA,KAAK,UAAU,gBAAgB,MAAM,CAAC,IAAI;AAAA,QAC1C;AAAA,MACF;AAGA,cAAQ,IAAIE,OAAM,MAAM,qCAAgC,CAAC;AACzD,cAAQ,IAAIA,OAAM,IAAI,kBAAkB,GAAG,UAAU;AAErD,UAAI,UAAU;AACZ,gBAAQ,IAAIA,OAAM,IAAI,iEAA0D,CAAC;AAAA,MACnF;AAAA,IACF,SAAS,OAAO;AACd,UAAK,MAAgC,SAAS,UAAU;AACtD,gBAAQ,IAAIA,OAAM,IAAI,6BAA6B,CAAC;AACpD,gBAAQ,IAAIA,OAAM,IAAI,KAAK,GAAGA,OAAM,KAAK,WAAW,GAAGA,OAAM,IAAI,yBAAyB,CAAC;AAC3F;AAAA,MACF;AACA,YAAM;AAAA,IACR;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,UAAoC;AACxC,WAAO,kBAAkB,KAAK,OAAO;AAAA,EACvC;AACF;;;AC5IA,OAAOC,SAAQ;AACf,OAAOC,WAAU;;;ACuDV,IAAM,0BAA4C;AAAA,EACvD,UAAU;AAAA,EACV,UAAU;AAAA,IACR;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;;;ACxEA,OAAOC,SAAQ;AACf,OAAOC,WAAU;;;ACIjB,eAAsB,qBACpB,UACA,eAC0B;AAC1B,SAAO;AAAA,IACL,SAAS;AAAA;AAAA;AAAA,MAGP;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAAA,IACA,SAAS;AAAA;AAAA,MAEP;AAAA,MACA;AAAA;AAAA,MAGA;AAAA,MACA;AAAA;AAAA,MAGA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA;AAAA,MAGA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA;AAAA,MAGA;AAAA,MACA;AAAA,MACA;AAAA;AAAA,MAGA;AAAA;AAAA,MAGA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA;AAAA,MAGA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAAA,EACF;AACF;;;AD3DO,IAAM,iBAAoC;AAAA,EAC/C,MAAM;AAAA,EACN,UAAU;AAAA;AAAA,EAEV,MAAM,OAAO,SAAiB,cAAgD;AAC5E,UAAM,WAAWC,MAAK,KAAK,SAAS,YAAY;AAChD,UAAM,SAA0B;AAAA,MAC9B,UAAU;AAAA,MACV,MAAM;AAAA,MACN,MAAM;AAAA,MACN,YAAY;AAAA,MACZ,UAAU,CAAC;AAAA,IACb;AAGA,UAAM,kBAAkBA,MAAK,KAAK,UAAU,cAAc;AAC1D,QAAIC,eAAmB;AAEvB,QAAI;AACF,YAAM,UAAU,MAAMC,IAAG,SAAS,iBAAiB,OAAO;AAC1D,MAAAD,eAAc,KAAK,MAAM,OAAO;AAChC,aAAO,SAAS,KAAK,oBAAoB;AAAA,IAC3C,QAAQ;AAEN,aAAO;AAAA,IACT;AAGA,WAAO,WAAW;AAClB,WAAO,aAAa;AAGpB,QAAIA,aAAY,iBAAiB,cAAcA,aAAY,cAAc,YAAY;AACnF,aAAO,SAAS,KAAK,qBAAqB;AAAA,IAC5C;AAGA,UAAM,iBAAiB;AAAA,MACrB,EAAE,MAAM,QAAQ,SAAS,OAAO;AAAA,MAChC,EAAE,MAAM,UAAU,SAAS,SAAS;AAAA,MACpC,EAAE,MAAM,SAAS,SAAS,QAAQ;AAAA,MAClC,EAAE,MAAM,OAAO,SAAS,MAAM;AAAA,MAC9B,EAAE,MAAM,oBAAoB,SAAS,aAAa;AAAA,IACpD;AAEA,eAAW,aAAa,gBAAgB;AACtC,UACEA,aAAY,kBAAkB,UAAU,IAAI,KAC5CA,aAAY,eAAe,UAAU,IAAI,GACzC;AACA,eAAO,SAAS,KAAK,GAAG,UAAU,OAAO,0BAA0B;AACnE;AAAA,MACF;AAAA,IACF;AAGA,UAAM,aAAa;AAAA,MACjB,EAAE,MAAM,QAAQ,SAAS,UAAU;AAAA,MACnC,EAAE,MAAM,SAAS,SAAS,QAAQ;AAAA,MAClC,EAAE,MAAM,OAAO,SAAS,MAAM;AAAA,MAC9B,EAAE,MAAM,WAAW,SAAS,UAAU;AAAA,MACtC,EAAE,MAAM,gBAAgB,SAAS,SAAS;AAAA,IAC5C;AAEA,eAAW,MAAM,YAAY;AAC3B,UAAIA,aAAY,eAAe,GAAG,IAAI,GAAG;AACvC,eAAO,SAAS,KAAK,GAAG,GAAG,OAAO,WAAW;AAC7C;AAAA,MACF;AAAA,IACF;AAGA,QAAIA,aAAY,SAAS,MAAM;AAC7B,aAAO,UAAUA,aAAY,QAAQ;AAAA,IACvC;AAEA,WAAO;AAAA,EACT;AAAA,EAEA,MAAM,eAAe,SAAiB,cAAsB;AAC1D,WAAO,qBAAqB,SAAS,YAAY;AAAA,EACnD;AACF;;;AE1FA,OAAOE,SAAQ;AACf,OAAOC,WAAU;;;ACIjB,eAAsB,kBACpB,UACA,eAC0B;AAC1B,SAAO;AAAA,IACL,SAAS;AAAA;AAAA,MAEP;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA;AAAA,MAGA;AAAA,MACA;AAAA;AAAA,MAGA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAAA,IACA,SAAS;AAAA;AAAA,MAEP;AAAA,MACA;AAAA;AAAA,MAGA;AAAA,MACA;AAAA;AAAA,MAGA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA;AAAA,MAGA;AAAA,MACA;AAAA,MACA;AAAA;AAAA,MAGA;AAAA,MACA;AAAA,MACA;AAAA;AAAA,MAGA;AAAA;AAAA,MAGA;AAAA,MACA;AAAA,IACF;AAAA,EACF;AACF;;;ADvDO,IAAM,cAAiC;AAAA,EAC5C,MAAM;AAAA,EACN,UAAU;AAAA;AAAA,EAEV,MAAM,OAAO,SAAiB,cAAgD;AAC5E,UAAM,WAAWC,MAAK,KAAK,SAAS,YAAY;AAChD,UAAM,SAA0B;AAAA,MAC9B,UAAU;AAAA,MACV,MAAM;AAAA,MACN,MAAM;AAAA,MACN,YAAY;AAAA,MACZ,UAAU,CAAC;AAAA,IACb;AAGA,UAAM,mBAAmBA,MAAK,KAAK,UAAU,eAAe;AAC5D,QAAI,eAAoB;AAExB,QAAI;AACF,YAAM,UAAU,MAAMC,IAAG,SAAS,kBAAkB,OAAO;AAC3D,qBAAe,KAAK,MAAM,OAAO;AACjC,aAAO,SAAS,KAAK,qBAAqB;AAAA,IAC5C,QAAQ;AAEN,aAAO;AAAA,IACT;AAGA,UAAM,aACJ,aAAa,UAAU,mBAAmB,KAC1C,aAAa,aAAa,IAAI,mBAAmB;AAEnD,QAAI,YAAY;AAGd,aAAO;AAAA,IACT;AAGA,WAAO,WAAW;AAClB,WAAO,aAAa;AAGpB,UAAM,UAAU,CAAC,OAAO,OAAO,OAAO,OAAO;AAC7C,QAAI,YAAY;AAEhB,eAAW,OAAO,SAAS;AACzB,UAAI;AACF,cAAM,UAAUD,MAAK,KAAK,UAAU,GAAG;AACvC,cAAM,QAAQ,MAAMC,IAAG,KAAK,OAAO;AACnC,YAAI,MAAM,YAAY,GAAG;AACvB;AAAA,QACF;AAAA,MACF,QAAQ;AAAA,MAER;AAAA,IACF;AAEA,QAAI,YAAY,GAAG;AACjB,aAAO,SAAS,KAAK,gCAAgC,SAAS,eAAe;AAAA,IAC/E;AAGA,QAAI,aAAa,SAAS,KAAK;AAC7B,aAAO,UAAU,aAAa,QAAQ;AACtC,aAAO,SAAS,KAAK,OAAO,aAAa,QAAQ,GAAG,EAAE;AAAA,IACxD;AAGA,UAAM,iBAAiB;AAAA,MACrB,EAAE,MAAM,mBAAmB,SAAS,UAAU;AAAA,MAC9C,EAAE,MAAM,gBAAgB,SAAS,OAAO;AAAA,MACxC,EAAE,MAAM,2BAA2B,SAAS,cAAc;AAAA,MAC1D,EAAE,MAAM,eAAe,SAAS,QAAQ;AAAA,IAC1C;AAEA,eAAW,aAAa,gBAAgB;AACtC,UACE,aAAa,UAAU,UAAU,IAAI,KACrC,aAAa,aAAa,IAAI,UAAU,IAAI,GAC5C;AACA,eAAO,SAAS,KAAK,GAAG,UAAU,OAAO,0BAA0B;AACnE;AAAA,MACF;AAAA,IACF;AAGA,UAAMC,SAAQ;AAAA,MACZ,EAAE,MAAM,4BAA4B,SAAS,UAAU;AAAA,MACvD,EAAE,MAAM,uBAAuB,SAAS,UAAU;AAAA,MAClD,EAAE,MAAM,mBAAmB,SAAS,uBAAuB;AAAA,MAC3D,EAAE,MAAM,gBAAgB,SAAS,eAAe;AAAA,MAChD,EAAE,MAAM,qBAAqB,SAAS,cAAc;AAAA,MACpD,EAAE,MAAM,mBAAmB,SAAS,UAAU;AAAA,IAChD;AAEA,eAAW,QAAQA,QAAO;AACxB,UAAI,aAAa,UAAU,KAAK,IAAI,GAAG;AACrC,eAAO,SAAS,KAAK,GAAG,KAAK,OAAO,WAAW;AAC/C;AAAA,MACF;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA,EAEA,MAAM,eAAe,SAAiB,cAAsB;AAC1D,WAAO,kBAAkB,SAAS,YAAY;AAAA,EAChD;AACF;;;AEtHA,OAAOC,SAAQ;AACf,OAAOC,WAAU;;;ACIjB,eAAsB,sBACpB,UACA,eAC0B;AAC1B,SAAO;AAAA,IACL,SAAS;AAAA;AAAA,MAEP;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA;AAAA,MAEA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA;AAAA,MAEA;AAAA;AAAA,MAEA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAAA,IACA,SAAS;AAAA;AAAA,MAEP;AAAA,MACA;AAAA;AAAA,MAGA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA;AAAA,MAGA;AAAA,MACA;AAAA,MACA;AAAA;AAAA,MACA;AAAA;AAAA;AAAA,MAGA;AAAA,MACA;AAAA,MACA;AAAA;AAAA,MAGA;AAAA,MACA;AAAA;AAAA,MAGA;AAAA,MACA;AAAA,MACA;AAAA;AAAA,MAGA;AAAA;AAAA,MAGA;AAAA,MACA;AAAA,MACA;AAAA;AAAA,MAGA;AAAA,MACA;AAAA,IACF;AAAA,EACF;AACF;;;ADvEO,IAAM,kBAAqC;AAAA,EAChD,MAAM;AAAA,EACN,UAAU;AAAA;AAAA,EAEV,MAAM,OAAO,SAAiB,cAAgD;AAC5E,UAAM,WAAWC,MAAK,KAAK,SAAS,YAAY;AAChD,UAAM,SAA0B;AAAA,MAC9B,UAAU;AAAA,MACV,MAAM;AAAA,MACN,MAAM;AAAA,MACN,YAAY;AAAA,MACZ,UAAU,CAAC;AAAA,IACb;AAGA,UAAM,mBAAmBA,MAAK,KAAK,UAAU,eAAe;AAC5D,QAAI,eAAoB;AAExB,QAAI;AACF,YAAM,UAAU,MAAMC,IAAG,SAAS,kBAAkB,OAAO;AAC3D,qBAAe,KAAK,MAAM,OAAO;AACjC,aAAO,SAAS,KAAK,qBAAqB;AAAA,IAC5C,QAAQ;AAEN,aAAO;AAAA,IACT;AAGA,UAAM,aACJ,aAAa,UAAU,mBAAmB,KAC1C,aAAa,aAAa,IAAI,mBAAmB;AAEnD,QAAI,CAAC,YAAY;AAEf,aAAO;AAAA,IACT;AAEA,WAAO,SAAS,KAAK,6CAA6C;AAGlE,UAAM,cAAcD,MAAK,KAAK,UAAU,SAAS;AACjD,QAAI;AACF,YAAMC,IAAG,OAAO,WAAW;AAC3B,aAAO,SAAS,KAAK,oBAAoB;AACzC,aAAO,aAAa;AAAA,IACtB,QAAQ;AACN,aAAO,aAAa;AAAA,IACtB;AAGA,UAAM,cAAc,CAAC,OAAO,UAAU,UAAU,UAAU;AAC1D,QAAI,YAAY;AAEhB,eAAW,OAAO,aAAa;AAC7B,UAAI;AACF,cAAM,UAAUD,MAAK,KAAK,UAAU,GAAG;AACvC,cAAM,QAAQ,MAAMC,IAAG,KAAK,OAAO;AACnC,YAAI,MAAM,YAAY,GAAG;AACvB;AAAA,QACF;AAAA,MACF,QAAQ;AAAA,MAER;AAAA,IACF;AAEA,QAAI,aAAa,GAAG;AAClB,aAAO,SAAS,KAAK,yCAAyC,SAAS,IAAI,YAAY,MAAM,QAAQ;AACrG,aAAO,aAAa;AAAA,IACtB;AAGA,UAAM,kBAAkB;AAAA,MACtBD,MAAK,KAAK,UAAU,SAAS,SAAS;AAAA,MACtCA,MAAK,KAAK,UAAU,SAAS,MAAM;AAAA,IACrC;AAEA,eAAW,WAAW,iBAAiB;AACrC,UAAI;AACF,cAAM,QAAQ,MAAMC,IAAG,KAAK,OAAO;AACnC,YAAI,MAAM,YAAY,GAAG;AACvB,gBAAM,UAAUD,MAAK,SAASA,MAAK,QAAQ,OAAO,CAAC,IAAI,MAAMA,MAAK,SAAS,OAAO;AAClF,iBAAO,SAAS,KAAK,SAAS,OAAO,iBAAiB;AAAA,QACxD;AAAA,MACF,QAAQ;AAAA,MAER;AAAA,IACF;AAGA,QAAI,aAAa,UAAU,mBAAmB,GAAG;AAC/C,aAAO,UAAU,aAAa,QAAQ,mBAAmB;AAAA,IAC3D;AAEA,WAAO,WAAW;AAClB,WAAO;AAAA,EACT;AAAA,EAEA,MAAM,eAAe,SAAiB,cAAsB;AAC1D,WAAO,sBAAsB,SAAS,YAAY;AAAA,EACpD;AACF;;;AE5GA,OAAOE,SAAQ;AACf,OAAOC,WAAU;;;ACIjB,eAAsB,sBACpB,UACA,eAC0B;AAC1B,SAAO;AAAA,IACL,SAAS;AAAA;AAAA,MAEP;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA;AAAA,MACA;AAAA;AAAA;AAAA,MAGA;AAAA;AAAA,MAGA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA;AAAA,MAGA;AAAA;AAAA,MAGA;AAAA;AAAA,MAGA;AAAA,MACA;AAAA;AAAA,MAGA;AAAA,MACA;AAAA,IACF;AAAA,IACA,SAAS;AAAA,MACP;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA;AAAA,MAGA;AAAA,MACA;AAAA;AAAA,MAGA;AAAA;AAAA,MAGA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAAA,EACF;AACF;;;ADtDO,IAAM,kBAAqC;AAAA,EAChD,MAAM;AAAA,EACN,UAAU;AAAA;AAAA,EAEV,MAAM,OAAO,SAAiB,cAAgD;AAC5E,UAAM,WAAWC,MAAK,KAAK,SAAS,YAAY;AAChD,UAAM,SAA0B;AAAA,MAC9B,UAAU;AAAA,MACV,MAAM;AAAA,MACN,MAAM;AAAA,MACN,YAAY;AAAA,MACZ,UAAU,CAAC;AAAA,IACb;AAGA,UAAM,qBAAqBA,MAAK,KAAK,UAAU,UAAU,sBAAsB;AAC/E,QAAI,oBAAoB;AAExB,QAAI;AACF,YAAMC,IAAG,OAAO,kBAAkB;AAClC,0BAAoB;AACpB,aAAO,SAAS,KAAK,mCAAmC;AAAA,IAC1D,QAAQ;AAAA,IAER;AAGA,UAAM,kBAAkBD,MAAK,KAAK,UAAU,UAAU,cAAc;AACpE,QAAI,iBAAiB;AAErB,QAAI;AACF,YAAMC,IAAG,OAAO,eAAe;AAC/B,uBAAiB;AACjB,aAAO,SAAS,KAAK,2BAA2B;AAAA,IAClD,QAAQ;AAAA,IAER;AAGA,UAAM,cAAc,CAAC,YAAY,YAAY,aAAa,SAAS;AACnE,QAAI,YAAY;AAEhB,eAAW,OAAO,aAAa;AAC7B,UAAI;AACF,cAAM,UAAUD,MAAK,KAAK,UAAU,GAAG;AACvC,cAAM,QAAQ,MAAMC,IAAG,KAAK,OAAO;AACnC,YAAI,MAAM,YAAY,GAAG;AACvB;AAAA,QACF;AAAA,MACF,QAAQ;AAAA,MAER;AAAA,IACF;AAEA,QAAI,aAAa,GAAG;AAClB,aAAO,SAAS,KAAK,yCAAyC,SAAS,IAAI,YAAY,MAAM,QAAQ;AAAA,IACvG;AAGA,QAAI;AACF,YAAM,WAAWD,MAAK,KAAK,UAAU,oBAAoB;AACzD,YAAMC,IAAG,OAAO,QAAQ;AACxB,aAAO,SAAS,KAAK,0BAA0B;AAAA,IACjD,QAAQ;AAAA,IAER;AAGA,QAAI;AACF,YAAM,aAAaD,MAAK,KAAK,UAAU,gBAAgB;AACvD,YAAMC,IAAG,OAAO,UAAU;AAC1B,aAAO,SAAS,KAAK,sBAAsB;AAAA,IAC7C,QAAQ;AAAA,IAER;AAIA,QAAI,qBAAqB,aAAa,GAAG;AACvC,aAAO,WAAW;AAClB,aAAO,aAAa;AACpB,aAAO;AAAA,IACT;AAGA,QAAI,qBAAsB,kBAAkB,aAAa,GAAI;AAC3D,aAAO,WAAW;AAClB,aAAO,aAAa;AACpB,aAAO;AAAA,IACT;AAGA,QAAI,aAAa,GAAG;AAClB,aAAO,WAAW;AAClB,aAAO,aAAa;AACpB,aAAO;AAAA,IACT;AAGA,WAAO;AAAA,EACT;AAAA,EAEA,MAAM,eAAe,SAAiB,cAAsB;AAC1D,WAAO,sBAAsB,SAAS,YAAY;AAAA,EACpD;AACF;;;AElGO,IAAM,qBAA0C;AAAA,EACrD;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAmBO,SAAS,qBAAqB,MAA6C;AAChF,SAAO,mBAAmB,KAAK,OAAK,EAAE,SAAS,IAAI;AACrD;;;AV9BA,eAAsB,oBACpB,SACA,UAAqC,CAAC,GACV;AAC5B,QAAM,OAAO,EAAE,GAAG,yBAAyB,GAAG,QAAQ;AACtD,QAAM,UAA6B,CAAC;AACpC,QAAM,UAAU,oBAAI,IAAY;AAGhC,QAAM,aAAa,SAAS,KAAK,SAAS,OAAO;AAGjD,QAAM,mBAAmB,SAAS,KAAK,SAAS,SAAS,GAAG,IAAI;AAEhE,SAAO;AACT;AAKA,eAAe,aACb,SACA,cACA,SACA,SACe;AAEf,QAAM,WAAWC,MAAK,KAAK,SAAS,YAAY;AAChD,MAAI,QAAQ,IAAI,QAAQ,GAAG;AACzB;AAAA,EACF;AACA,UAAQ,IAAI,QAAQ;AAGpB,QAAM,iBAAgE,CAAC;AAEvE,aAAW,YAAY,oBAAoB;AACzC,QAAI;AACF,YAAM,SAAS,MAAM,SAAS,OAAO,SAAS,YAAY;AAC1D,UAAI,OAAO,UAAU;AACnB,uBAAe,KAAK;AAAA,UAClB,GAAG;AAAA,UACH,UAAU,SAAS,YAAY;AAAA,QACjC,CAAC;AAAA,MACH;AAAA,IACF,SAAS,OAAO;AAEd,cAAQ,MAAM,2BAA2B,SAAS,IAAI,QAAQ,YAAY,KAAK,KAAK;AAAA,IACtF;AAAA,EACF;AAIA,MAAI,eAAe,SAAS,GAAG;AAE7B,UAAM,iBAAiB,eAAe,OAAO,OAAK,EAAE,eAAe,MAAM;AACzE,UAAM,mBAAmB,eAAe,OAAO,OAAK,EAAE,eAAe,QAAQ;AAC7E,UAAM,gBAAgB,eAAe,OAAO,OAAK,EAAE,eAAe,KAAK;AAEvE,QAAI,eAAe,SAAS,GAAG;AAG7B,YAAM,eAAe,eAAe,IAAI,CAAC,EAAE,UAAU,GAAG,OAAO,MAAM,MAAM;AAC3E,cAAQ,KAAK,GAAG,YAAY;AAC5B,YAAM,QAAQ,eAAe,IAAI,OAAK,EAAE,IAAI,EAAE,KAAK,KAAK;AACxD,cAAQ,IAAI,qCAAgC,KAAK,EAAE;AAGnD,UAAI,iBAAiB,SAAS,KAAK,cAAc,SAAS,GAAG;AAC3D,cAAM,eAAe,CAAC,GAAG,kBAAkB,GAAG,aAAa,EAAE,IAAI,OAAK,EAAE,IAAI,EAAE,KAAK,IAAI;AACvF,gBAAQ,IAAI,kDAA6C,YAAY,EAAE;AAAA,MACzE;AAAA,IACF,WAAW,eAAe,WAAW,GAAG;AAEtC,YAAM,EAAE,UAAU,GAAG,OAAO,IAAI,eAAe,CAAC;AAChD,cAAQ,KAAK,MAAM;AAGnB,UAAI,iBAAiB,SAAS,KAAK,cAAc,SAAS,GAAG;AAC3D,cAAM,eAAe,CAAC,GAAG,kBAAkB,GAAG,aAAa,EAAE,IAAI,OAAK,EAAE,IAAI,EAAE,KAAK,IAAI;AACvF,gBAAQ,IAAI,kDAA6C,YAAY,EAAE;AAAA,MACzE;AAAA,IACF,WAAW,iBAAiB,SAAS,GAAG;AAEtC,uBAAiB,KAAK,CAAC,GAAG,MAAM,EAAE,WAAW,EAAE,QAAQ;AACvD,YAAM,EAAE,UAAU,GAAG,OAAO,IAAI,iBAAiB,CAAC;AAClD,cAAQ,KAAK,MAAM;AAGnB,YAAM,UAAU,CAAC,GAAG,iBAAiB,MAAM,CAAC,GAAG,GAAG,aAAa;AAC/D,UAAI,QAAQ,SAAS,GAAG;AACtB,cAAM,eAAe,QAAQ,IAAI,OAAK,EAAE,IAAI,EAAE,KAAK,IAAI;AACvD,gBAAQ,IAAI,qBAAgB,YAAY,OAAO,YAAY,KAAK,OAAO,IAAI,oBAAoB;AAAA,MACjG;AAAA,IACF,WAAW,cAAc,SAAS,GAAG;AAEnC,oBAAc,KAAK,CAAC,GAAG,MAAM,EAAE,WAAW,EAAE,QAAQ;AACpD,YAAM,EAAE,UAAU,GAAG,OAAO,IAAI,cAAc,CAAC;AACjD,cAAQ,KAAK,MAAM;AAGjB,YAAM,UAAU,cAAc,MAAM,CAAC;AACvC,UAAI,QAAQ,SAAS,GAAG;AACtB,cAAM,eAAe,QAAQ,IAAI,OAAK,EAAE,IAAI,EAAE,KAAK,IAAI;AACvD,gBAAQ,IAAI,qBAAgB,YAAY,OAAO,YAAY,KAAK,OAAO,IAAI,oBAAoB;AAAA,MAC/F;AAAA,IACF;AAAA,EACF,WAAW,eAAe,WAAW,GAAG;AACtC,UAAM,EAAE,UAAU,GAAG,OAAO,IAAI,eAAe,CAAC;AAChD,YAAQ,KAAK,MAAM;AAAA,EACrB;AACF;AAKA,eAAe,mBACb,SACA,cACA,SACA,SACA,OACA,SACe;AAEf,MAAI,SAAS,QAAQ,UAAU;AAC7B;AAAA,EACF;AAEA,QAAM,WAAWA,MAAK,KAAK,SAAS,YAAY;AAEhD,MAAI;AACF,UAAM,UAAU,MAAMC,IAAG,QAAQ,UAAU,EAAE,eAAe,KAAK,CAAC;AAGlE,UAAM,OAAO,QAAQ,OAAO,OAAK,EAAE,YAAY,CAAC;AAEhD,eAAW,OAAO,MAAM;AAEtB,UAAI,QAAQ,SAAS,SAAS,IAAI,IAAI,GAAG;AACvC;AAAA,MACF;AAGA,UAAI,IAAI,KAAK,WAAW,GAAG,GAAG;AAC5B;AAAA,MACF;AAEA,YAAM,UAAU,iBAAiB,MAC7B,IAAI,OACJD,MAAK,KAAK,cAAc,IAAI,IAAI;AAGpC,YAAM,aAAa,SAAS,SAAS,SAAS,OAAO;AAGrD,YAAM,mBAAmB,SAAS,SAAS,SAAS,SAAS,QAAQ,GAAG,OAAO;AAAA,IACjF;AAAA,EACF,SAAS,OAAO;AAEd;AAAA,EACF;AACF;;;AHjKA,IAAME,cAAaC,eAAc,YAAY,GAAG;AAChD,IAAMC,aAAYC,MAAK,QAAQH,WAAU;AAQzC,eAAsB,YAAY,UAAuB,CAAC,GAAG;AAC3D,QAAM,UAAU,QAAQ,QAAQ,QAAQ,IAAI;AAC5C,QAAM,aAAaG,MAAK,KAAK,SAAS,mBAAmB;AAEzD,MAAI;AAEF,QAAI,eAAe;AACnB,QAAI;AACF,YAAMC,IAAG,OAAO,UAAU;AAC1B,qBAAe;AAAA,IACjB,QAAQ;AAAA,IAER;AAGA,QAAI,gBAAgB,QAAQ,SAAS;AACnC,YAAM,mBAAmB,IAAI,iBAAiB,OAAO;AACrD,YAAM,iBAAiB,mBAAmB;AAC1C;AAAA,IACF;AAGA,QAAI,gBAAgB,CAAC,QAAQ,SAAS;AACpC,cAAQ,IAAIC,OAAM,OAAO,gDAAsC,CAAC;AAChE,cAAQ,IAAIA,OAAM,IAAI,KAAK,GAAGA,OAAM,KAAK,qBAAqB,GAAGA,OAAM,IAAI,6BAA6B,CAAC;AACzG;AAAA,IACF;AAGA,QAAI,CAAC,cAAc;AACjB,YAAM,gBAAgB,SAAS,OAAO;AAAA,IACxC;AAAA,EACF,SAAS,OAAO;AACd,YAAQ,MAAMA,OAAM,IAAI,6BAA6B,GAAG,KAAK;AAC7D,YAAQ,KAAK,CAAC;AAAA,EAChB;AACF;AAEA,eAAe,gBAAgB,SAAiB,SAAsB;AAEpE,oBAAkB;AAClB,UAAQ,IAAIA,OAAM,KAAK,wBAAwB,CAAC;AAGhD,UAAQ,IAAIA,OAAM,IAAI,mCAA4B,GAAGA,OAAM,KAAK,OAAO,CAAC;AACxE,QAAM,aAAa,MAAM,oBAAoB,OAAO;AAEpD,MAAI,aAAkC,CAAC;AAEvC,MAAI,WAAW,WAAW,GAAG;AAC3B,YAAQ,IAAIA,OAAM,OAAO,wCAA8B,CAAC;AAExD,QAAI,CAAC,QAAQ,KAAK;AAChB,YAAM,EAAE,WAAW,IAAI,MAAM,SAAS,OAAO;AAAA,QAC3C;AAAA,UACE,MAAM;AAAA,UACN,MAAM;AAAA,UACN,SAAS;AAAA,UACT,SAAS;AAAA,QACX;AAAA,MACF,CAAC;AAED,UAAI,CAAC,YAAY;AACf,gBAAQ,IAAIA,OAAM,IAAI,UAAU,CAAC;AACjC;AAAA,MACF;AAAA,IACF;AAGA,eAAW,KAAK;AAAA,MACd,MAAM;AAAA,MACN,MAAM;AAAA,MACN,SAAS;AAAA,MACT,QAAQ;AAAA,QACN,SAAS,CAAC,iDAAiD;AAAA,QAC3D,SAAS;AAAA,UACP;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,QACF;AAAA,MACF;AAAA,IACF,CAAC;AAAA,EACH,OAAO;AAEL,YAAQ,IAAIA,OAAM,MAAM;AAAA,eAAa,WAAW,MAAM;AAAA,CAAkB,CAAC;AAEzE,eAAW,OAAO,YAAY;AAC5B,YAAM,cAAc,IAAI,SAAS,MAAM,SAAS,IAAI;AACpD,cAAQ,IAAIA,OAAM,KAAK,KAAK,IAAI,IAAI,EAAE,GAAGA,OAAM,IAAI,IAAI,IAAI,UAAU,cAAc,CAAC;AACpF,cAAQ,IAAIA,OAAM,IAAI,iBAAiB,WAAW,EAAE,CAAC;AAErD,UAAI,IAAI,SAAS,SAAS,GAAG;AAC3B,YAAI,SAAS,QAAQ,CAAC,MAAM;AAC1B,kBAAQ,IAAIA,OAAM,IAAI,cAAS,CAAC,EAAE,CAAC;AAAA,QACrC,CAAC;AAAA,MACH;AACA,cAAQ,IAAI;AAAA,IACd;AAGA,QAAI,CAAC,QAAQ,KAAK;AAChB,YAAM,EAAE,QAAQ,IAAI,MAAM,SAAS,OAAO;AAAA,QACxC;AAAA,UACE,MAAM;AAAA,UACN,MAAM;AAAA,UACN,SAAS;AAAA,UACT,SAAS;AAAA,QACX;AAAA,MACF,CAAC;AAED,UAAI,CAAC,SAAS;AACZ,gBAAQ,IAAIA,OAAM,IAAI,UAAU,CAAC;AACjC;AAAA,MACF;AAAA,IACF;AAGA,eAAW,OAAO,YAAY;AAC5B,YAAM,WAAW,qBAAqB,IAAI,IAAI;AAC9C,UAAI,CAAC,UAAU;AACb,gBAAQ,KAAKA,OAAM,OAAO,uCAA6B,IAAI,IAAI,YAAY,CAAC;AAC5E;AAAA,MACF;AAGA,YAAM,kBAAkB,MAAM,SAAS,eAAe,SAAS,IAAI,IAAI;AAGvE,UAAI,kBAAkB;AACtB,UAAI,CAAC,QAAQ,KAAK;AAChB,cAAM,EAAE,UAAU,IAAI,MAAM,SAAS,OAAO;AAAA,UAC1C;AAAA,YACE,MAAM;AAAA,YACN,MAAM;AAAA,YACN,SAAS,aAAa,IAAI,IAAI;AAAA,YAC9B,SAAS;AAAA,UACX;AAAA,QACF,CAAC;AACD,0BAAkB;AAAA,MACpB;AAEA,UAAI,cAAc;AAClB,UAAI,iBAAiB;AACnB,cAAM,aAAa,MAAM,uBAAuB,IAAI,MAAM,eAAe;AACzE,sBAAc,EAAE,GAAG,iBAAiB,GAAG,WAAW;AAAA,MACpD,OAAO;AACL,cAAM,cAAc,IAAI,SAAS,MAAM,SAAS,IAAI;AACpD,gBAAQ,IAAIA,OAAM,IAAI,+BAA0B,IAAI,IAAI,OAAO,WAAW,EAAE,CAAC;AAAA,MAC/E;AAEA,iBAAW,KAAK;AAAA,QACd,MAAM,IAAI;AAAA,QACV,MAAM,IAAI;AAAA,QACV,SAAS;AAAA,QACT,QAAQ;AAAA,MACV,CAAC;AAAA,IACH;AAAA,EACF;AAGA,MAAI,CAAC,QAAQ,KAAK;AAChB,UAAM,EAAE,mBAAmB,IAAI,MAAM,SAAS,OAAO;AAAA,MACnD;AAAA,QACE,MAAM;AAAA,QACN,MAAM;AAAA,QACN,SAAS;AAAA,QACT,SAAS;AAAA,MACX;AAAA,IACF,CAAC;AAED,QAAI,oBAAoB;AACtB,UAAI;AACF,cAAM,iBAAiBF,MAAK,KAAK,SAAS,SAAS;AACnD,cAAMC,IAAG,MAAM,gBAAgB,EAAE,WAAW,KAAK,CAAC;AAKlD,cAAM,eAAeD,MAAK,KAAKD,YAAW,6BAA6B;AAEvE,cAAM,YAAYC,MAAK,KAAK,gBAAgB,OAAO;AACnD,YAAI;AACJ,YAAI,cAAc;AAClB,YAAI,SAAS;AAEb,YAAI;AACF,gBAAM,QAAQ,MAAMC,IAAG,KAAK,SAAS;AACrC,wBAAc,MAAM,YAAY;AAChC,mBAAS,MAAM,OAAO;AAAA,QACxB,QAAQ;AAAA,QAER;AAEA,YAAI,aAAa;AAEf,uBAAaD,MAAK,KAAK,WAAW,UAAU;AAC5C,gBAAMC,IAAG,SAAS,cAAc,UAAU;AAC1C,kBAAQ,IAAIC,OAAM,MAAM,yDAAoD,CAAC;AAAA,QAC/E,WAAW,QAAQ;AAEjB,gBAAM,EAAE,aAAa,IAAI,MAAM,SAAS,OAAO;AAAA,YAC7C;AAAA,cACE,MAAM;AAAA,cACN,MAAM;AAAA,cACN,SAAS;AAAA,cACT,SAAS;AAAA,YACX;AAAA,UACF,CAAC;AAED,cAAI,cAAc;AAGhB,kBAAM,gBAAgB,MAAMD,IAAG,SAAS,WAAW,OAAO;AAE1D,kBAAMA,IAAG,OAAO,SAAS;AAEzB,kBAAMA,IAAG,MAAM,SAAS;AAExB,kBAAMA,IAAG,UAAUD,MAAK,KAAK,WAAW,aAAa,GAAG,aAAa;AAErE,kBAAMC,IAAG,SAAS,cAAcD,MAAK,KAAK,WAAW,UAAU,CAAC;AAChE,oBAAQ,IAAIE,OAAM,MAAM,6CAAwC,CAAC;AACjE,oBAAQ,IAAIA,OAAM,MAAM,mDAAmD,CAAC;AAC5E,oBAAQ,IAAIA,OAAM,MAAM,wCAAwC,CAAC;AAAA,UACnE,OAAO;AACL,oBAAQ,IAAIA,OAAM,IAAI,8DAA8D,CAAC;AAAA,UACvF;AAAA,QACF,OAAO;AAEL,gBAAMD,IAAG,MAAM,WAAW,EAAE,WAAW,KAAK,CAAC;AAC7C,uBAAaD,MAAK,KAAK,WAAW,UAAU;AAC5C,gBAAMC,IAAG,SAAS,cAAc,UAAU;AAC1C,kBAAQ,IAAIC,OAAM,MAAM,yDAAoD,CAAC;AAAA,QAC/E;AAAA,MACF,SAAS,OAAO;AACd,gBAAQ,IAAIA,OAAM,OAAO,8CAAoC,CAAC;AAC9D,gBAAQ,IAAIA,OAAM,IAAI,UAAU,iBAAiB,QAAQ,MAAM,UAAU,eAAe,EAAE,CAAC;AAC3F,gBAAQ,IAAIA,OAAM,IAAI,0EAA0E,CAAC;AAAA,MACnG;AAAA,IACF;AAAA,EACF;AAGA,QAAM,SAAqB;AAAA,IACzB,GAAG;AAAA,IACH;AAAA,EACF;AAGA,QAAM,aAAaF,MAAK,KAAK,SAAS,mBAAmB;AACzD,QAAMC,IAAG,UAAU,YAAY,KAAK,UAAU,QAAQ,MAAM,CAAC,IAAI,MAAM,OAAO;AAG9E,UAAQ,IAAIC,OAAM,MAAM,oCAA+B,CAAC;AACxD,UAAQ,IAAIA,OAAM,MAAM,qBAAgB,WAAW,MAAM,eAAe,CAAC;AACzE,UAAQ,IAAIA,OAAM,IAAI,eAAe,CAAC;AACtC,UAAQ,IAAIA,OAAM,IAAI,UAAU,GAAGA,OAAM,KAAK,YAAY,GAAGA,OAAM,IAAI,wBAAwB,CAAC;AAChG,UAAQ,IAAIA,OAAM,IAAI,UAAU,GAAGA,OAAM,KAAK,YAAY,GAAGA,OAAM,IAAI,yBAAyB,CAAC;AACjG,UAAQ,IAAIA,OAAM,IAAI,6DAA6D,CAAC;AACtF;AAEA,eAAe,uBAAuB,eAAuB,QAA4D;AACvH,UAAQ,IAAIA,OAAM,KAAK;AAAA,cAAiB,aAAa,YAAY,CAAC;AAElE,QAAM,UAAU,MAAM,SAAS,OAAO;AAAA,IACpC;AAAA,MACE,MAAM;AAAA,MACN,MAAM;AAAA,MACN,SAAS;AAAA,MACT,SAAS,OAAO,QAAQ,KAAK,IAAI;AAAA,MACjC,QAAQ,CAAC,UAAkB,MAAM,MAAM,GAAG,EAAE,IAAI,OAAK,EAAE,KAAK,CAAC;AAAA,IAC/D;AAAA,IACA;AAAA,MACE,MAAM;AAAA,MACN,MAAM;AAAA,MACN,SAAS;AAAA,MACT,SAAS,OAAO,QAAQ,KAAK,IAAI;AAAA,MACjC,QAAQ,CAAC,UAAkB,MAAM,MAAM,GAAG,EAAE,IAAI,OAAK,EAAE,KAAK,CAAC;AAAA,IAC/D;AAAA,EACF,CAAC;AAED,SAAO;AAAA,IACL,SAAS,QAAQ;AAAA,IACjB,SAAS,QAAQ;AAAA,EACnB;AACF;;;AclTA;AACA;AACAC;AAPA,OAAOC,YAAW;AAClB,OAAOC,UAAQ;AACf,OAAOC,YAAU;AACjB,OAAO,QAAQ;AACf,OAAO,YAAY;AAKnB;AAEA,eAAsB,gBAAgB;AACpC,QAAM,UAAU,QAAQ,IAAI;AAC5B,QAAM,cAAcC,OAAK,SAAS,OAAO;AAGzC,QAAM,WAAW,OACd,WAAW,KAAK,EAChB,OAAO,OAAO,EACd,OAAO,KAAK,EACZ,UAAU,GAAG,CAAC;AAEjB,QAAM,YAAYA,OAAK,KAAK,GAAG,QAAQ,GAAG,SAAS,WAAW,GAAG,WAAW,IAAI,QAAQ,EAAE;AAE1F,oBAAkB;AAClB,UAAQ,IAAIC,OAAM,KAAK,UAAU,CAAC;AAGlC,QAAM,YAAY,MAAM,cAAc,OAAO,OAAO;AACpD,UAAQ,IAAIA,OAAM,IAAI,gBAAgB,GAAG,YAAYA,OAAM,MAAM,cAAS,IAAIA,OAAM,IAAI,wBAAmB,CAAC;AAE5G,MAAI,CAAC,WAAW;AACd,YAAQ,IAAIA,OAAM,OAAO,OAAO,GAAGA,OAAM,KAAK,WAAW,GAAGA,OAAM,OAAO,eAAe,CAAC;AACzF;AAAA,EACF;AAGA,MAAI;AACF,UAAM,QAAQ,MAAMC,KAAG,KAAK,SAAS;AACrC,YAAQ,IAAID,OAAM,IAAI,iBAAiB,GAAG,SAAS;AACnD,YAAQ,IAAIA,OAAM,IAAI,eAAe,GAAGA,OAAM,MAAM,eAAU,CAAC;AAG/D,QAAI;AACF,YAAM,QAAQ,MAAMC,KAAG,QAAQ,WAAW,EAAE,WAAW,KAAK,CAAC;AAC7D,cAAQ,IAAID,OAAM,IAAI,cAAc,GAAG,MAAM,MAAM;AAAA,IACrD,SAAS,GAAG;AAAA,IAEZ;AAEA,YAAQ,IAAIA,OAAM,IAAI,gBAAgB,GAAG,MAAM,MAAM,eAAe,CAAC;AAGrE,QAAI;AACF,YAAM,UAAU,MAAM,gBAAgB,SAAS;AAC/C,UAAI,UAAU,GAAG;AACf,cAAM,cAAc,IAAI,KAAK,OAAO;AACpC,gBAAQ,IAAIA,OAAM,IAAI,eAAe,GAAG,YAAY,eAAe,CAAC;AAAA,MACtE;AAAA,IACF,QAAQ;AAAA,IAER;AAAA,EACF,SAAS,OAAO;AACd,YAAQ,IAAIA,OAAM,IAAI,eAAe,GAAGA,OAAM,OAAO,oBAAe,CAAC;AACrE,YAAQ,IAAIA,OAAM,OAAO,OAAO,GAAGA,OAAM,KAAK,YAAY,GAAGA,OAAM,OAAO,wBAAwB,CAAC;AAAA,EACrG;AAGA,MAAI;AACF,UAAM,SAAS,MAAM,cAAc,KAAK,OAAO;AAE/C,YAAQ,IAAIA,OAAM,KAAK,aAAa,CAAC;AAGrC,UAAM,SAAS,MAAM,UAAU,OAAO;AACtC,QAAI,OAAO,aAAa,WAAW,QAAQ;AACzC,cAAQ,IAAIA,OAAM,IAAI,gBAAgB,GAAGA,OAAM,MAAM,gBAAW,CAAC;AACjE,cAAQ,IAAIA,OAAM,IAAI,kBAAkB,GAAG,GAAG,OAAO,aAAa,iBAAiB,GAAI,GAAG;AAG1F,UAAI;AACF,cAAM,SAAS,MAAM,iBAAiB,OAAO;AAC7C,cAAM,SAAS,MAAM,iBAAiB,OAAO;AAC7C,gBAAQ,IAAIA,OAAM,IAAI,mBAAmB,GAAG,MAAM;AAClD,gBAAQ,IAAIA,OAAM,IAAI,mBAAmB,GAAG,OAAO,UAAU,GAAG,CAAC,CAAC;AAGlE,cAAM,eAAeD,OAAK,KAAK,WAAW,iBAAiB;AAC3D,YAAI;AACF,gBAAM,kBAAkB,MAAME,KAAG,SAAS,cAAc,OAAO;AAC/D,gBAAM,WAAW,KAAK,MAAM,eAAe;AAC3C,cAAI,SAAS,WAAW,UAAU,SAAS,WAAW,QAAQ;AAC5D,oBAAQ,IAAID,OAAM,OAAO,gEAAsD,CAAC;AAAA,UAClF;AAAA,QACF,QAAQ;AAAA,QAER;AAAA,MACF,QAAQ;AAAA,MAER;AAAA,IACF,WAAW,OAAO,aAAa,WAAW,CAAC,QAAQ;AACjD,cAAQ,IAAIA,OAAM,IAAI,gBAAgB,GAAGA,OAAM,OAAO,0BAA0B,CAAC;AAAA,IACnF,OAAO;AACL,cAAQ,IAAIA,OAAM,IAAI,gBAAgB,GAAGA,OAAM,KAAK,UAAU,CAAC;AAAA,IACjE;AAGA,QAAI,OAAO,aAAa,SAAS;AAC/B,cAAQ,IAAIA,OAAM,IAAI,gBAAgB,GAAGA,OAAM,MAAM,gBAAW,CAAC;AACjE,cAAQ,IAAIA,OAAM,IAAI,aAAa,GAAG,GAAG,OAAO,aAAa,UAAU,IAAI;AAAA,IAC7E,OAAO;AACL,cAAQ,IAAIA,OAAM,IAAI,gBAAgB,GAAGA,OAAM,KAAK,UAAU,CAAC;AAC/D,cAAQ,IAAIA,OAAM,IAAI,gBAAgB,GAAGA,OAAM,KAAK,oBAAoB,CAAC;AAAA,IAC3E;AAGA,YAAQ,IAAIA,OAAM,KAAK,sBAAsB,CAAC;AAC9C,QAAI,eAAe,MAAM,GAAG;AAC1B,cAAQ,IAAIA,OAAM,IAAI,cAAc,GAAG,OAAO,KAAK,WAAW;AAC9D,cAAQ,IAAIA,OAAM,IAAI,aAAa,GAAG,OAAO,KAAK,kBAAkB;AACpE,cAAQ,IAAIA,OAAM,IAAI,aAAa,GAAG,OAAO,KAAK,SAAS;AAC3D,cAAQ,IAAIA,OAAM,IAAI,gBAAgB,GAAG,OAAO,KAAK,YAAY;AAAA,IACnE;AAAA,EAEF,SAAS,OAAO;AACd,YAAQ,IAAIA,OAAM,OAAO,yCAAyC,CAAC;AAAA,EACrE;AACF;;;AC9HA;AADA,OAAOE,YAAW;AAIlB,eAAsB,aAAa,SAAkE;AACnG,oBAAkB;AAElB,MAAI;AAEF,QAAI,QAAQ,OAAO;AACjB,YAAM,EAAE,UAAAC,UAAS,IAAI,MAAM;AAC3B,YAAM,EAAE,iBAAAC,iBAAgB,IAAI,MAAM;AAElC,cAAQ,IAAIC,OAAM,OAAO,yCAAyC,CAAC;AACnE,YAAM,WAAW,IAAIF,UAAS,QAAQ,IAAI,CAAC;AAC3C,YAAM,SAAS,WAAW;AAC1B,YAAM,SAAS,MAAM;AAGrB,YAAM,WAAW,IAAIC,iBAAgB,SAAS,MAAM;AACpD,YAAM,SAAS,MAAM;AAErB,cAAQ,IAAIC,OAAM,MAAM,qCAAgC,CAAC;AAAA,IAC3D;AAEA,UAAM,cAAc;AAAA,MAClB,SAAS,QAAQ,IAAI;AAAA,MACrB,SAAS,QAAQ,WAAW;AAAA,MAC5B,OAAO,QAAQ,SAAS;AAAA,IAC1B,CAAC;AAED,QAAI,QAAQ,OAAO;AACjB,cAAQ,IAAIA,OAAM,OAAO,gDAAsC,CAAC;AAAA,IAElE;AAAA,EACF,SAAS,OAAO;AACd,YAAQ,MAAMA,OAAM,IAAI,wBAAwB,GAAG,KAAK;AACxD,YAAQ,KAAK,CAAC;AAAA,EAChB;AACF;;;ACvCA,OAAOC,YAAW;AAClB,OAAOC,UAAQ;AACf,OAAOC,YAAU;;;ACFjB,SAAS,cAAc;AACvB,SAAS,4BAA4B;AACrC;AAAA,EACE;AAAA,EACA;AAAA,OACK;AACP,SAAS,iBAAAC,sBAAqB;AAC9B,SAAS,iBAAAC,sBAAqB;AAC9B,SAAS,WAAAC,UAAS,QAAAC,aAAY;;;ACP9B,SAAS,uBAAuB;AA2BzB,SAAS,gBACd,WACA,MACA,aACA;AACA,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA,aAAa,gBAAgB,WAAW;AAAA,MACtC,QAAQ;AAAA,MACR,cAAc;AAAA,IAChB,CAAC;AAAA,EACH;AACF;;;ACzCA,SAAS,SAAS;AAQX,IAAM,uBAAuB,EAAE,OAAO;AAAA,EAC3C,OAAO,EAAE,OAAO,EACb,IAAI,GAAG,qCAAqC,EAC5C,IAAI,KAAK,qCAAqC,EAC9C;AAAA,IACC;AAAA,EASF;AAAA,EAEF,OAAO,EAAE,OAAO,EACb,IAAI,EACJ,IAAI,GAAG,0BAA0B,EACjC,IAAI,IAAI,wBAAwB,EAChC,QAAQ,CAAC,EACT;AAAA,IACC;AAAA,EAGF;AACJ,CAAC;;;AClCD,SAAS,KAAAC,UAAS;AAOX,IAAM,oBAAoBA,GAAE,OAAO;AAAA,EACxC,MAAMA,GAAE,OAAO,EACZ,IAAI,IAAI,6CAA6C,EACrD;AAAA,IACC;AAAA,EAGF;AAAA,EAEF,OAAOA,GAAE,OAAO,EACb,IAAI,EACJ,IAAI,GAAG,0BAA0B,EACjC,IAAI,IAAI,wBAAwB,EAChC,QAAQ,CAAC,EACT;AAAA,IACC;AAAA,EAEF;AACJ,CAAC;;;ACzBD,SAAS,KAAAC,UAAS;AAQX,IAAM,wBAAwBA,GAAE,OAAO;AAAA,EAC5C,WAAWA,GAAE,MAAM;AAAA,IACjBA,GAAE,OAAO,EAAE,IAAI,GAAG,0BAA0B;AAAA,IAC5CA,GAAE,MAAMA,GAAE,OAAO,EAAE,IAAI,GAAG,0BAA0B,CAAC,EAAE,IAAI,GAAG,0CAA0C,EAAE,IAAI,IAAI,8BAA8B;AAAA,EAClJ,CAAC,EAAE;AAAA,IACD;AAAA,EAIF;AAAA,EAEA,gBAAgBA,GAAE,QAAQ,EACvB,QAAQ,IAAI,EACZ;AAAA,IACC;AAAA,EAIF;AACJ,CAAC;;;AC3BD,SAAS,KAAAC,UAAS;AAOX,IAAM,sBAAsBA,GAAE,OAAO;AAAA,EAC1C,SAASA,GAAE,OAAO,EACf,SAAS,EACT;AAAA,IACC;AAAA,EAMF;AAAA,EAEF,UAAUA,GAAE,OAAO,EAChB,SAAS,EACT;AAAA,IACC;AAAA,EAGF;AACJ,CAAC;;;AC1BD,SAAS,KAAAC,UAAS;AAYX,IAAM,sBAAsBA,GAAE,OAAO;AAAA,EAC1C,UAAUA,GAAE,OAAO,EAChB,IAAI,GAAG,0BAA0B,EACjC;AAAA,IACC;AAAA,EAKF;AAAA,EAEF,OAAOA,GAAE,OAAO,EACb,IAAI,EACJ,IAAI,CAAC,EACL,IAAI,CAAC,EACL,QAAQ,CAAC,EACT;AAAA,IACC;AAAA,EAEF;AACJ,CAAC;;;AChCD,SAAS,KAAAC,UAAS;AAQX,IAAM,sBAAsBA,GAAE,OAAO;AAAA,EAC1C,OAAOA,GAAE,MAAMA,GAAE,OAAO,EAAE,IAAI,GAAG,0BAA0B,CAAC,EACzD,SAAS,EACT;AAAA,IACC;AAAA,EAEF;AAAA,EAEF,KAAKA,GAAE,OAAO,EACX,IAAI,EACJ,IAAI,GAAG,wBAAwB,EAC/B,IAAI,IAAI,sBAAsB,EAC9B,QAAQ,EAAE,EACV;AAAA,IACC;AAAA,EAEF;AAAA,EAEF,WAAWA,GAAE,OAAO,EACjB,IAAI,EACJ,IAAI,GAAG,8BAA8B,EACrC,SAAS,EACT;AAAA,IACC;AAAA,EAIF;AACJ,CAAC;;;ACpBM,IAAM,QAAQ;AAAA,EACnB;AAAA,IACE;AAAA,IACA;AAAA,IACA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASF;AAAA,EACA;AAAA,IACE;AAAA,IACA;AAAA,IACA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMF;AAAA,EACA;AAAA,IACE;AAAA,IACA;AAAA,IACA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAwCF;AAAA,EACA;AAAA,IACE;AAAA,IACA;AAAA,IACA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOF;AAAA,EACA;AAAA,IACE;AAAA,IACA;AAAA,IACA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUF;AAAA,EACA;AAAA,IACE;AAAA,IACA;AAAA,IACA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAqBF;AACF;;;ACrIA;AADA,SAAoB,gBAAgB;AAoC7B,SAAS,gBACd,QACA,SACA;AACA,SAAO,OAAO,SAAkB;AAC9B,QAAI;AAEF,YAAM,YAAY,OAAO,MAAM,IAAI;AAGnC,YAAM,SAAS,MAAM,QAAQ,SAAS;AAGtC,aAAO;AAAA,QACL,SAAS,CAAC;AAAA,UACR,MAAM;AAAA,UACN,MAAM,KAAK,UAAU,QAAQ,MAAM,CAAC;AAAA,QACtC,CAAC;AAAA,MACH;AAAA,IAEF,SAAS,OAAO;AAEd,UAAI,iBAAiB,UAAU;AAC7B,eAAO;AAAA,UACL,SAAS;AAAA,UACT,SAAS,CAAC;AAAA,YACR,MAAM;AAAA,YACN,MAAM,KAAK,UAAU;AAAA,cACnB,OAAO;AAAA,cACP;AAAA,cACA,SAAS,MAAM,OAAO,IAAI,QAAM;AAAA,gBAC9B,OAAO,EAAE,KAAK,KAAK,GAAG;AAAA,gBACtB,SAAS,EAAE;AAAA,cACb,EAAE;AAAA,YACJ,GAAG,MAAM,CAAC;AAAA,UACZ,CAAC;AAAA,QACH;AAAA,MACF;AAGA,UAAI,iBAAiB,WAAW;AAC9B,eAAO;AAAA,UACL,SAAS;AAAA,UACT,SAAS,CAAC;AAAA,YACR,MAAM;AAAA,YACN,MAAM,KAAK,UAAU,MAAM,OAAO,GAAG,MAAM,CAAC;AAAA,UAC9C,CAAC;AAAA,QACH;AAAA,MACF;AAGA,cAAQ,MAAM,qCAAqC,KAAK;AACxD,aAAO;AAAA,QACL,SAAS;AAAA,QACT,SAAS,CAAC;AAAA,UACR,MAAM;AAAA,UACN,MAAM,KAAK,UAAU;AAAA,YACnB,OAAO,iBAAiB,QAAQ,MAAM,UAAU;AAAA,YAChD;AAAA,UACF,GAAG,MAAM,CAAC;AAAA,QACZ,CAAC;AAAA,MACH;AAAA,IACF;AAAA,EACF;AACF;;;AC5FA,eAAsB,qBACpB,MACA,KACwB;AACxB,QAAM,EAAE,UAAU,YAAY,KAAK,mBAAmB,iBAAiB,IAAI;AAE3E,SAAO,MAAM;AAAA,IACX;AAAA,IACA,OAAO,kBAAkB;AACvB,UAAI,mBAAmB,cAAc,KAAK,GAAG;AAG7C,YAAM,kBAAkB;AAExB,YAAM,iBAAiB,MAAM,WAAW,MAAM,cAAc,KAAK;AACjE,YAAM,UAAU,MAAM,SAAS,OAAO,gBAAgB,cAAc,OAAO,cAAc,KAAK;AAE9F,UAAI,SAAS,QAAQ,MAAM,UAAU;AAErC,aAAO;AAAA,QACL,WAAW,iBAAiB;AAAA,QAC5B;AAAA,MACF;AAAA,IACF;AAAA,EACF,EAAE,IAAI;AACR;;;ACzBA,eAAsB,kBACpB,MACA,KACwB;AACxB,QAAM,EAAE,UAAU,YAAY,KAAK,mBAAmB,iBAAiB,IAAI;AAE3E,SAAO,MAAM;AAAA,IACX;AAAA,IACA,OAAO,kBAAkB;AACvB,UAAI,yBAAyB;AAG7B,YAAM,kBAAkB;AAExB,YAAM,gBAAgB,MAAM,WAAW,MAAM,cAAc,IAAI;AAE/D,YAAM,UAAU,MAAM,SAAS,OAAO,eAAe,cAAc,OAAO,cAAc,IAAI;AAE5F,UAAI,SAAS,QAAQ,MAAM,iBAAiB;AAE5C,aAAO;AAAA,QACL,WAAW,iBAAiB;AAAA,QAC5B;AAAA,MACF;AAAA,IACF;AAAA,EACF,EAAE,IAAI;AACR;;;ACfO,SAAS,cAAcC,QAAc,eAA+B;AACzE,MAAI,aAAaA,OAAK,QAAQ,SAAS,EAAE,EAAE,KAAK,EAAE,QAAQ,OAAO,GAAG;AAIpE,eAAa,WAAW,QAAQ,sBAAsB,EAAE;AAGxD,MAAI,WAAW,WAAW,gBAAgB,GAAG,GAAG;AAC9C,iBAAa,WAAW,UAAU,cAAc,SAAS,CAAC;AAAA,EAC5D;AAEA,SAAO;AACT;AAaO,SAAS,kBAAkB,KAAa,SAA0B;AACvE,QAAM,QAAQ,IAAI,QAAQ,OAAO;AACjC,MAAI,UAAU,GAAI,QAAO;AAGzB,QAAM,aAAa,QAAQ,IAAI,IAAI,QAAQ,CAAC,IAAI;AAChD,MAAI,eAAe,OAAO,UAAU,EAAG,QAAO;AAI9C,QAAM,WAAW,QAAQ,QAAQ;AACjC,MAAI,aAAa,IAAI,OAAQ,QAAO;AACpC,QAAM,YAAY,IAAI,QAAQ;AAC9B,SAAO,cAAc;AACvB;AAeO,SAAS,YAAY,kBAA0B,kBAAmC;AAEvF,MAAI,qBAAqB,iBAAkB,QAAO;AAGlD,MAAI,kBAAkB,kBAAkB,gBAAgB,GAAG;AACzD,WAAO;AAAA,EACT;AAGA,MAAI,kBAAkB,kBAAkB,gBAAgB,GAAG;AACzD,WAAO;AAAA,EACT;AAIA,QAAM,gBAAgB,iBAAiB,QAAQ,eAAe,EAAE;AAChE,MAAI,kBAAkB,eAAe,gBAAgB,KACjD,kBAAkB,kBAAkB,aAAa,GAAG;AACtD,WAAO;AAAA,EACT;AAEA,SAAO;AACT;AASO,SAAS,iBAAiB,UAAkB,eAA+B;AAChF,MAAI,YAAY,SAAS,QAAQ,OAAO,GAAG;AAC3C,MAAI,UAAU,WAAW,gBAAgB,GAAG,GAAG;AAC7C,gBAAY,UAAU,UAAU,cAAc,SAAS,CAAC;AAAA,EAC1D;AACA,SAAO;AACT;AAgBO,SAASC,YAAW,UAA2B;AACpD,SAAO,wBAAwB,KAAK,QAAQ,KACrC,uCAAuC,KAAK,QAAQ;AAC7D;;;AC1HA,IAAM,aAAa;AAMnB,eAAsB,sBACpB,MACA,KACwB;AACxB,QAAM,EAAE,UAAU,YAAY,KAAK,mBAAmB,iBAAiB,IAAI;AAE3E,SAAO,MAAM;AAAA,IACX;AAAA,IACA,OAAO,kBAAkB;AAEvB,YAAM,YAAY,MAAM,QAAQ,cAAc,SAAS,IACnD,cAAc,YACd,CAAC,cAAc,SAAS;AAE5B,YAAM,eAAe,CAAC,MAAM,QAAQ,cAAc,SAAS;AAE3D,UAAI,wBAAwB,UAAU,KAAK,IAAI,CAAC,EAAE;AAGlD,YAAM,kBAAkB;AAGxB,YAAM,gBAAgB,QAAQ,IAAI,EAAE,QAAQ,OAAO,GAAG;AAGtD,YAAM,iBAAiB,MAAM,QAAQ,IAAI,UAAU,IAAI,QAAM,WAAW,MAAM,EAAE,CAAC,CAAC;AAGlF,YAAM,kBAAkB,MAAM,QAAQ;AAAA,QACpC,eAAe;AAAA,UAAI,CAAC,WAAW,MAC7B,SAAS,OAAO,WAAW,IAAI,UAAU,CAAC,CAAC;AAAA,QAC7C;AAAA,MACF;AAIA,YAAM,gBAAgB,UAAU,IAAI,CAAC,UAAU,MAAM;AACnD,cAAM,aAAa,gBAAgB,CAAC;AACpC,cAAM,kBAAkB,iBAAiB,UAAU,aAAa;AAEhE,eAAO,WAAW,OAAO,OAAK;AAC5B,gBAAM,iBAAiB,iBAAiB,EAAE,SAAS,MAAM,aAAa;AACtE,iBAAO,mBAAmB;AAAA,QAC5B,CAAC;AAAA,MACH,CAAC;AAGD,UAAI,mBAA4B,CAAC;AACjC,UAAI,cAAc,gBAAgB;AAEhC,cAAM,kBAAkB,cACrB,IAAI,CAAC,QAAQ,OAAO,EAAE,QAAQ,UAAU,UAAU,CAAC,GAAG,OAAO,EAAE,EAAE,EACjE,OAAO,CAAC,EAAE,OAAO,MAAM,OAAO,SAAS,CAAC;AAE3C,YAAI,gBAAgB,SAAS,GAAG;AAE9B,gBAAM,oBAAoB,MAAM,QAAQ;AAAA,YACtC,gBAAgB,IAAI,CAAC,EAAE,OAAO,MAAM,WAAW,MAAM,OAAO,CAAC,EAAE,OAAO,CAAC;AAAA,UACzE;AAGA,gBAAM,kBAAkB,MAAM,QAAQ;AAAA,YACpC,kBAAkB;AAAA,cAAI,CAAC,WAAW,MAChC,SAAS,OAAO,WAAW,GAAG,gBAAgB,CAAC,EAAE,OAAO,CAAC,EAAE,OAAO;AAAA,YACpE;AAAA,UACF;AAGA,6BAAmB,MAAM,KAAK,EAAE,QAAQ,UAAU,OAAO,GAAG,MAAM,CAAC,CAAC;AACpE,0BAAgB,QAAQ,CAAC,EAAE,UAAU,MAAM,GAAG,MAAM;AAClD,kBAAM,UAAU,gBAAgB,CAAC;AACjC,kBAAM,kBAAkB,iBAAiB,UAAU,aAAa;AAEhE,6BAAiB,KAAK,IAAI,QAAQ,OAAO,OAAK;AAC5C,oBAAM,iBAAiB,iBAAiB,EAAE,SAAS,MAAM,aAAa;AACtE,qBAAO,mBAAmB;AAAA,YAC5B,CAAC;AAAA,UACH,CAAC;AAAA,QACH;AAAA,MACF;AAIA,YAAM,YAAY,MAAM,SAAS,eAAe,EAAE,OAAO,WAAW,CAAC;AAGrE,UAAI,UAAU,WAAW,YAAY;AACnC,YAAI,WAAW,UAAU,qFAAqF,SAAS;AAAA,MACzH;AAGA,YAAM,YAAY,oBAAI,IAAoB;AAC1C,YAAM,sBAAsB,CAACC,WAAyB;AACpD,YAAI,UAAU,IAAIA,MAAI,EAAG,QAAO,UAAU,IAAIA,MAAI;AAClD,cAAM,aAAa,cAAcA,QAAM,aAAa;AACpD,kBAAU,IAAIA,QAAM,UAAU;AAC9B,eAAO;AAAA,MACT;AAGA,YAAM,sBAAsB,UAAU,IAAI,CAAC,aAAa;AACtD,cAAM,mBAAmB,oBAAoB,QAAQ;AAKrD,cAAM,YAAY,oBAAI,IAAY;AAClC,mBAAW,SAAS,WAAW;AAC7B,gBAAMC,aAAY,iBAAiB,MAAM,SAAS,MAAM,aAAa;AAGrE,cAAI,CAACC,YAAWD,UAAS,EAAG;AAG5B,gBAAM,UAAU,MAAM,SAAS,WAAW,CAAC;AAC3C,qBAAW,OAAO,SAAS;AACzB,kBAAM,mBAAmB,oBAAoB,GAAG;AAChD,gBAAI,YAAY,kBAAkB,gBAAgB,GAAG;AACnD,wBAAU,IAAIA,UAAS;AACvB;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAEA,eAAO,MAAM,KAAK,SAAS;AAAA,MAC7B,CAAC;AAGD,YAAM,YAA2E,CAAC;AAClF,gBAAU,QAAQ,CAAC,UAAU,MAAM;AACjC,cAAM,aAAa,cAAc,CAAC;AAClC,cAAM,gBAAgB,iBAAiB,CAAC,KAAK,CAAC;AAI9C,cAAM,aAAa,oBAAI,IAAY;AACnC,cAAM,gBAAgB,CAAC,GAAG,YAAY,GAAG,aAAa,EAAE,OAAO,WAAS;AACtE,gBAAM,gBAAgB,iBAAiB,MAAM,SAAS,MAAM,aAAa;AACzE,gBAAM,UAAU,GAAG,aAAa,IAAI,MAAM,SAAS,SAAS,IAAI,MAAM,SAAS,OAAO;AACtF,cAAI,WAAW,IAAI,OAAO,EAAG,QAAO;AACpC,qBAAW,IAAI,OAAO;AACtB,iBAAO;AAAA,QACT,CAAC;AAED,kBAAU,QAAQ,IAAI;AAAA,UACpB,QAAQ;AAAA,UACR,kBAAkB,oBAAoB,CAAC;AAAA,QACzC;AAAA,MACF,CAAC;AAED,UAAI,SAAS,OAAO,OAAO,SAAS,EAAE,OAAO,CAAC,KAAK,MAAM,MAAM,EAAE,OAAO,QAAQ,CAAC,CAAC,eAAe;AAGjG,UAAI,cAAc;AAEhB,cAAM,WAAW,UAAU,CAAC;AAC5B,eAAO;AAAA,UACL,WAAW,iBAAiB;AAAA,UAC5B,MAAM;AAAA,UACN,QAAQ,UAAU,QAAQ,EAAE;AAAA,UAC5B,kBAAkB,UAAU,QAAQ,EAAE;AAAA,QACxC;AAAA,MACF,OAAO;AAEL,eAAO;AAAA,UACL,WAAW,iBAAiB;AAAA,UAC5B,OAAO;AAAA,QACT;AAAA,MACF;AAAA,IACF;AAAA,EACF,EAAE,IAAI;AACR;;;AClLA,eAAsB,oBACpB,MACA,KACwB;AACxB,QAAM,EAAE,UAAU,KAAK,mBAAmB,iBAAiB,IAAI;AAE/D,SAAO,MAAM;AAAA,IACX;AAAA,IACA,OAAO,kBAAkB;AACvB,UAAI,2CAA2C;AAG/C,YAAM,kBAAkB;AAExB,UAAI;AACJ,UAAI,aAAa;AAEjB,UAAI;AAEF,kBAAU,MAAM,SAAS,aAAa;AAAA,UACpC,UAAU,cAAc;AAAA,UACxB,SAAS,cAAc;AAAA,UACvB,OAAO;AAAA,QACT,CAAC;AAID,YAAI,QAAQ,WAAW,MAAM,cAAc,YAAY,cAAc,UAAU;AAC7E,cAAI,oDAAoD;AACxD,oBAAU,MAAM,SAAS,eAAe;AAAA,YACtC,UAAU,cAAc;AAAA,YACxB,SAAS,cAAc;AAAA,YACvB,OAAO;AAAA,UACT,CAAC;AACD,uBAAa;AAAA,QACf;AAAA,MACF,SAAS,OAAO;AAEd,YAAI,sDAAsD,KAAK,EAAE;AACjE,kBAAU,MAAM,SAAS,eAAe;AAAA,UACtC,UAAU,cAAc;AAAA,UACxB,SAAS,cAAc;AAAA,UACvB,OAAO;AAAA,QACT,CAAC;AACD,qBAAa;AAAA,MACf;AAEA,UAAI,SAAS,QAAQ,MAAM,kBAAkB,UAAU,SAAS;AAEhE,aAAO;AAAA,QACL,WAAW,iBAAiB;AAAA,QAC5B,QAAQ;AAAA,QACR;AAAA,QACA,MAAM,eAAe,YACjB,oFACA;AAAA,MACN;AAAA,IACF;AAAA,EACF,EAAE,IAAI;AACR;;;AC/BA,IAAM,6BAA6B;AAAA,EACjC,KAAK;AAAA;AAAA,EACL,QAAQ;AAAA;AAAA,EACR,MAAM;AAAA;AACR;AAMA,IAAM,wBAAwB;AAAA,EAC5B,2BAA2B;AAAA;AAAA,EAC3B,cAAc;AAAA;AAAA,EACd,cAAc;AAAA;AAAA,EACd,UAAU;AAAA;AAAA,EACV,UAAU;AAAA;AAAA,EACV,YAAY;AAAA;AAAA,EACZ,YAAY;AAAA;AACd;AAMA,IAAME,cAAa;AAGnB,IAAM,aAAa,EAAE,KAAK,GAAG,QAAQ,GAAG,MAAM,GAAG,UAAU,EAAE;AAM7D,SAAS,iBACP,WACA,qBAC6B;AAC7B,QAAM,cAAc,oBAAI,IAA4B;AAEpD,aAAW,SAAS,WAAW;AAC7B,UAAM,UAAU,MAAM,SAAS,WAAW,CAAC;AAC3C,eAAW,OAAO,SAAS;AACzB,YAAM,mBAAmB,oBAAoB,GAAG;AAChD,UAAI,CAAC,YAAY,IAAI,gBAAgB,GAAG;AACtC,oBAAY,IAAI,kBAAkB,CAAC,CAAC;AAAA,MACtC;AACA,kBAAY,IAAI,gBAAgB,EAAG,KAAK,KAAK;AAAA,IAC/C;AAAA,EACF;AAEA,SAAO;AACT;AAKA,SAAS,oBACP,aACA,kBACgB;AAChB,QAAM,kBAAkC,CAAC;AACzC,QAAM,eAAe,oBAAI,IAAY;AAErC,QAAM,WAAW,CAAC,UAAwB;AACxC,UAAM,UAAU,GAAG,MAAM,SAAS,IAAI,IAAI,MAAM,SAAS,SAAS,IAAI,MAAM,SAAS,OAAO;AAC5F,QAAI,CAAC,aAAa,IAAI,OAAO,GAAG;AAC9B,sBAAgB,KAAK,KAAK;AAC1B,mBAAa,IAAI,OAAO;AAAA,IAC1B;AAAA,EACF;AAGA,MAAI,YAAY,IAAI,gBAAgB,GAAG;AACrC,eAAW,SAAS,YAAY,IAAI,gBAAgB,GAAI;AACtD,eAAS,KAAK;AAAA,IAChB;AAAA,EACF;AAGA,aAAW,CAAC,kBAAkB,MAAM,KAAK,YAAY,QAAQ,GAAG;AAC9D,QAAI,qBAAqB,oBAAoB,YAAY,kBAAkB,gBAAgB,GAAG;AAC5F,iBAAW,SAAS,QAAQ;AAC1B,iBAAS,KAAK;AAAA,MAChB;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AACT;AAKA,SAAS,0BACP,cACkB;AAClB,QAAM,mBAAqC,CAAC;AAE5C,aAAW,CAAC,UAAU,MAAM,KAAK,aAAa,QAAQ,GAAG;AACvD,UAAM,eAAe,OAClB,IAAI,OAAK,EAAE,SAAS,UAAU,EAC9B,OAAO,CAAC,MAAmB,OAAO,MAAM,YAAY,IAAI,CAAC;AAE5D,QAAI,aAAa,SAAS,GAAG;AAC3B,YAAM,MAAM,aAAa,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC;AAClD,uBAAiB,KAAK;AAAA,QACpB;AAAA,QACA,eAAe,KAAK,MAAO,MAAM,aAAa,SAAU,EAAE,IAAI;AAAA,QAC9D,eAAe,KAAK,IAAI,GAAG,YAAY;AAAA,QACvC,iBAAiB;AAAA,QACjB,sBAAsB,aAAa;AAAA,MACrC,CAAC;AAAA,IACH;AAAA,EACF;AAEA,SAAO;AACT;AAKA,SAAS,kCACP,kBACmB;AACnB,MAAI,iBAAiB,WAAW,GAAG;AACjC,WAAO;AAAA,MACL,mBAAmB;AAAA,MACnB,eAAe;AAAA,MACf,yBAAyB;AAAA,MACzB,0BAA0B,CAAC;AAAA,MAC3B,qBAAqB;AAAA,IACvB;AAAA,EACF;AAEA,QAAM,UAAU,iBAAiB,IAAI,OAAK,EAAE,aAAa;AACzD,QAAM,WAAW,iBAAiB,IAAI,OAAK,EAAE,aAAa;AAC1D,QAAM,WAAW,QAAQ,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI,QAAQ;AAC9D,QAAM,YAAY,KAAK,IAAI,GAAG,QAAQ;AAEtC,QAAM,2BAA2B,iBAC9B,OAAO,OAAK,EAAE,gBAAgB,sBAAsB,yBAAyB,EAC7E,KAAK,CAAC,GAAG,MAAM,EAAE,gBAAgB,EAAE,aAAa,EAChD,MAAM,GAAG,CAAC,EACV,IAAI,QAAM,EAAE,UAAU,EAAE,UAAU,eAAe,EAAE,eAAe,eAAe,EAAE,cAAc,EAAE;AAEtG,QAAM,sBAAsB,6BAA6B,UAAU,SAAS;AAE5E,SAAO;AAAA,IACL,mBAAmB,KAAK,MAAM,WAAW,EAAE,IAAI;AAAA,IAC/C,eAAe;AAAA,IACf,yBAAyB,iBAAiB;AAAA,IAC1C;AAAA,IACA;AAAA,EACF;AACF;AAKA,SAAS,6BAA6B,eAAuB,eAAkC;AAC7F,MAAI,gBAAgB,sBAAsB,gBAAgB,gBAAgB,sBAAsB,cAAc;AAC5G,WAAO;AAAA,EACT;AACA,MAAI,gBAAgB,sBAAsB,YAAY,gBAAgB,sBAAsB,UAAU;AACpG,WAAO;AAAA,EACT;AACA,MAAI,gBAAgB,sBAAsB,cAAc,gBAAgB,sBAAsB,YAAY;AACxG,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAKA,SAAS,mBAAmB,gBAAwB,qBAA2C;AAC7F,MAAI,YACF,mBAAmB,IAAI,QACvB,kBAAkB,2BAA2B,MAAM,QACnD,kBAAkB,2BAA2B,SAAS,WACtD,kBAAkB,2BAA2B,OAAO,SAAS;AAG/D,MAAI,WAAW,mBAAmB,IAAI,WAAW,SAAS,GAAG;AAC3D,gBAAY;AAAA,EACd;AAEA,SAAO;AACT;AAMA,eAAsB,oBACpB,MACA,KACwB;AACxB,QAAM,EAAE,UAAU,KAAK,mBAAmB,iBAAiB,IAAI;AAE/D,SAAO,MAAM;AAAA,IACX;AAAA,IACA,OAAO,kBAAkB;AACvB,UAAI,0BAA0B,cAAc,QAAQ,EAAE;AACtD,YAAM,kBAAkB;AAExB,YAAM,YAAY,MAAM,SAAS,eAAe,EAAE,OAAOA,YAAW,CAAC;AACrE,YAAM,WAAW,UAAU,WAAWA;AACtC,UAAI,UAAU;AACZ,YAAI,WAAWA,WAAU,uDAAuD,SAAS;AAAA,MAC3F;AACA,UAAI,YAAY,UAAU,MAAM,wBAAwB;AAExD,YAAM,gBAAgB,QAAQ,IAAI,EAAE,QAAQ,OAAO,GAAG;AACtD,YAAM,YAAY,oBAAI,IAAoB;AAC1C,YAAM,sBAAsB,CAACC,WAAyB;AACpD,YAAI,CAAC,UAAU,IAAIA,MAAI,EAAG,WAAU,IAAIA,QAAM,cAAcA,QAAM,aAAa,CAAC;AAChF,eAAO,UAAU,IAAIA,MAAI;AAAA,MAC3B;AAGA,YAAM,cAAc,iBAAiB,WAAW,mBAAmB;AACnE,YAAM,mBAAmB,oBAAoB,cAAc,QAAQ;AACnE,YAAM,kBAAkB,oBAAoB,aAAa,gBAAgB;AAGzE,YAAM,eAAe,oBAAI,IAAoC;AAC7D,iBAAW,SAAS,iBAAiB;AACnC,cAAM,YAAY,iBAAiB,MAAM,SAAS,MAAM,aAAa;AACrE,cAAM,WAAW,aAAa,IAAI,SAAS,KAAK,CAAC;AACjD,iBAAS,KAAK,KAAK;AACnB,qBAAa,IAAI,WAAW,QAAQ;AAAA,MACtC;AAGA,YAAM,mBAAmB,0BAA0B,YAAY;AAC/D,YAAM,oBAAoB,kCAAkC,gBAAgB;AAE5E,YAAM,cAAc,MAAM,KAAK,aAAa,KAAK,CAAC,EAAE,IAAI,eAAa;AAAA,QACnE;AAAA,QACA,YAAYC,YAAW,QAAQ;AAAA,MACjC,EAAE;AAEF,YAAM,YAAY,mBAAmB,YAAY,QAAQ,kBAAkB,mBAAmB;AAC9F,UAAI,SAAS,YAAY,MAAM,2BAA2B,SAAS,GAAG,kBAAkB,0BAA0B,IAAI,yBAAyB,EAAE,GAAG;AAEpJ,aAAO;AAAA,QACL,WAAW,iBAAiB;AAAA,QAC5B,UAAU,cAAc;AAAA,QACxB,gBAAgB,YAAY;AAAA,QAC5B;AAAA,QACA,YAAY;AAAA,QACZ;AAAA,QACA,MAAM,WAAW,oBAAoBF,WAAU,wDAAwD;AAAA,MACzG;AAAA,IACF;AAAA,EACF,EAAE,IAAI;AACR;;;ACrSA,OAAO,aAAa;;;ACQb,IAAMG,cAAa,EAAE,KAAK,GAAG,QAAQ,GAAG,MAAM,GAAG,UAAU,EAAE;;;ACA7D,IAAMC,8BAA6B;AAAA,EACxC,KAAK;AAAA;AAAA,EACL,QAAQ;AAAA;AAAA,EACR,MAAM;AAAA;AACR;AAMO,IAAMC,yBAAwB;AAAA,EACnC,2BAA2B;AAAA;AAAA,EAC3B,cAAc;AAAA;AAAA,EACd,cAAc;AAAA;AAAA,EACd,UAAU;AAAA;AAAA,EACV,UAAU;AAAA;AAAA,EACV,YAAY;AAAA;AAAA,EACZ,YAAY;AAAA;AACd;AAoCA,SAAS,qBAAqB,eAAiD;AAC7E,QAAM,QAAQ,oBAAI,IAAoB;AACtC,SAAO,CAACC,WAAyB;AAC/B,UAAM,SAAS,MAAM,IAAIA,MAAI;AAC7B,QAAI,WAAW,OAAW,QAAO;AACjC,UAAM,aAAa,cAAcA,QAAM,aAAa;AACpD,UAAM,IAAIA,QAAM,UAAU;AAC1B,WAAO;AAAA,EACT;AACF;AAUA,SAASC,kBACP,QACA,qBAC6B;AAC7B,QAAM,cAAc,oBAAI,IAA4B;AAEpD,aAAW,SAAS,QAAQ;AAC1B,UAAM,UAAU,MAAM,SAAS,WAAW,CAAC;AAC3C,eAAW,OAAO,SAAS;AACzB,YAAM,mBAAmB,oBAAoB,GAAG;AAChD,UAAI,YAAY,YAAY,IAAI,gBAAgB;AAChD,UAAI,CAAC,WAAW;AACd,oBAAY,CAAC;AACb,oBAAY,IAAI,kBAAkB,SAAS;AAAA,MAC7C;AACA,gBAAU,KAAK,KAAK;AAAA,IACtB;AAAA,EACF;AAEA,SAAO;AACT;AASA,SAASC,qBACP,kBACA,aACgB;AAChB,QAAM,kBAAkC,CAAC;AACzC,QAAM,eAAe,oBAAI,IAAY;AAErC,QAAM,WAAW,CAAC,UAA8B;AAC9C,UAAM,UAAU,GAAG,MAAM,SAAS,IAAI,IAAI,MAAM,SAAS,SAAS,IAAI,MAAM,SAAS,OAAO;AAC5F,QAAI,CAAC,aAAa,IAAI,OAAO,GAAG;AAC9B,sBAAgB,KAAK,KAAK;AAC1B,mBAAa,IAAI,OAAO;AAAA,IAC1B;AAAA,EACF;AAGA,QAAM,gBAAgB,YAAY,IAAI,gBAAgB;AACtD,MAAI,eAAe;AACjB,eAAW,SAAS,eAAe;AACjC,eAAS,KAAK;AAAA,IAChB;AAAA,EACF;AAKA,aAAW,CAAC,kBAAkB,MAAM,KAAK,YAAY,QAAQ,GAAG;AAC9D,QAAI,qBAAqB,oBAAoB,YAAY,kBAAkB,gBAAgB,GAAG;AAC5F,iBAAW,SAAS,QAAQ;AAC1B,iBAAS,KAAK;AAAA,MAChB;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AACT;AASA,SAAS,kBACP,QACA,eAC6B;AAC7B,QAAM,eAAe,oBAAI,IAA4B;AAErD,aAAW,SAAS,QAAQ;AAC1B,UAAM,YAAY,iBAAiB,MAAM,SAAS,MAAM,aAAa;AACrE,QAAI,WAAW,aAAa,IAAI,SAAS;AACzC,QAAI,CAAC,UAAU;AACb,iBAAW,CAAC;AACZ,mBAAa,IAAI,WAAW,QAAQ;AAAA,IACtC;AACA,aAAS,KAAK,KAAK;AAAA,EACrB;AAEA,SAAO;AACT;AAQA,SAASC,2BACP,cACsB;AACtB,QAAM,mBAAyC,CAAC;AAEhD,aAAW,CAAC,UAAU,MAAM,KAAK,aAAa,QAAQ,GAAG;AACvD,UAAM,eAAe,OAClB,IAAI,OAAK,EAAE,SAAS,UAAU,EAC9B,OAAO,CAAC,MAAmB,OAAO,MAAM,YAAY,IAAI,CAAC;AAE5D,QAAI,aAAa,SAAS,GAAG;AAC3B,YAAM,MAAM,aAAa,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC;AAClD,YAAM,MAAM,MAAM,aAAa;AAC/B,YAAM,MAAM,KAAK,IAAI,GAAG,YAAY;AAEpC,uBAAiB,KAAK;AAAA,QACpB;AAAA,QACA,eAAe,KAAK,MAAM,MAAM,EAAE,IAAI;AAAA,QACtC,eAAe;AAAA,QACf,iBAAiB;AAAA,QACjB,sBAAsB,aAAa;AAAA,MACrC,CAAC;AAAA,IACH;AAAA,EACF;AAEA,SAAO;AACT;AAQA,SAASC,mCACP,kBAC2D;AAC3D,MAAI,iBAAiB,WAAW,GAAG;AACjC,WAAO;AAAA,EACT;AAEA,QAAM,UAAU,iBAAiB,IAAI,OAAK,EAAE,aAAa;AACzD,QAAM,WAAW,iBAAiB,IAAI,OAAK,EAAE,aAAa;AAC1D,QAAM,WAAW,QAAQ,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI,QAAQ;AAC9D,QAAM,YAAY,KAAK,IAAI,GAAG,QAAQ;AAGtC,QAAM,2BAA2B,iBAC9B,OAAO,OAAK,EAAE,gBAAgBL,uBAAsB,yBAAyB,EAC7E,KAAK,CAAC,GAAG,MAAM,EAAE,gBAAgB,EAAE,aAAa,EAChD,MAAM,GAAG,CAAC,EACV,IAAI,QAAM;AAAA,IACT,UAAU,EAAE;AAAA,IACZ,eAAe,EAAE;AAAA,IACjB,eAAe,EAAE;AAAA,EACnB,EAAE;AAGJ,QAAM,sBAAsBM,8BAA6B,UAAU,SAAS;AAE5E,SAAO;AAAA,IACL,mBAAmB,KAAK,MAAM,WAAW,EAAE,IAAI;AAAA,IAC/C,eAAe;AAAA,IACf,yBAAyB,iBAAiB;AAAA,IAC1C;AAAA,IACA;AAAA,EACF;AACF;AASA,SAASA,8BAA6B,eAAuB,eAAkC;AAC7F,MAAI,gBAAgBN,uBAAsB,gBAAgB,gBAAgBA,uBAAsB,cAAc;AAC5G,WAAO;AAAA,EACT;AACA,MAAI,gBAAgBA,uBAAsB,YAAY,gBAAgBA,uBAAsB,UAAU;AACpG,WAAO;AAAA,EACT;AACA,MAAI,gBAAgBA,uBAAsB,cAAc,gBAAgBA,uBAAsB,YAAY;AACxG,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAQA,SAAS,4BAA4B,OAA0B;AAC7D,MAAI,SAASD,4BAA2B,KAAK;AAC3C,WAAO;AAAA,EACT;AACA,MAAI,SAASA,4BAA2B,QAAQ;AAC9C,WAAO;AAAA,EACT;AACA,MAAI,SAASA,4BAA2B,MAAM;AAC5C,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAUO,SAAS,oBACd,gBACA,WACA,eAC0B;AAE1B,QAAM,sBAAsB,qBAAqB,aAAa;AAG9D,QAAM,cAAcG,kBAAiB,WAAW,mBAAmB;AAGnE,QAAM,mBAAmB,oBAAoB,cAAc;AAC3D,QAAM,kBAAkBC,qBAAoB,kBAAkB,WAAW;AAGzE,QAAM,eAAe,kBAAkB,iBAAiB,aAAa;AAGrE,QAAM,mBAAmBC,2BAA0B,YAAY;AAC/D,QAAM,oBAAoBC,mCAAkC,gBAAgB;AAG5E,QAAM,aAAa,MAAM,KAAK,aAAa,KAAK,CAAC,EAAE,IAAI,eAAa;AAAA,IAClE;AAAA,IACA,YAAYE,YAAW,QAAQ;AAAA,EACjC,EAAE;AAGF,MAAI,YAAY,4BAA4B,WAAW,MAAM;AAG7D,MAAI,mBAAmB,qBAAqB;AAC1C,QAAIC,YAAW,kBAAkB,mBAAmB,IAAIA,YAAW,SAAS,GAAG;AAC7E,kBAAY,kBAAkB;AAAA,IAChC;AAAA,EACF;AAEA,SAAO;AAAA,IACL;AAAA,IACA,gBAAgB,WAAW;AAAA,IAC3B;AAAA,IACA;AAAA,EACF;AACF;;;ACvUA,IAAM,WAAW,EAAE,SAAS,GAAK,OAAO,EAAI;AAKrC,IAAM,qBAAN,MAAyB;AAAA,EAC9B,YACU,UACA,QACR;AAFQ;AACA;AAAA,EACP;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOH,MAAM,QAAQ,OAA6C;AAIzD,UAAM,YAAY,MAAM,KAAK,SAAS,QAAQ;AAG9C,UAAM,SAAS,QACX,UAAU,OAAO,OAAK,KAAK,eAAe,EAAE,SAAS,MAAM,KAAK,CAAC,IACjE;AAGJ,UAAM,aAAa,KAAK,eAAe,MAAM;AAG7C,UAAM,SAAS,KAAK,YAAY,YAAY,MAAM;AAGlD,SAAK,uBAAuB,QAAQ,SAA2B;AAE/D,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA,EAMQ,kBAAkB,UAA0B;AAClD,UAAM,gBAAgB,QAAQ,IAAI;AAElC,UAAM,aAAa,SAAS,QAAQ,OAAO,GAAG;AAC9C,UAAM,iBAAiB,cAAc,QAAQ,OAAO,GAAG;AAGvD,QAAI,WAAW,WAAW,iBAAiB,GAAG,GAAG;AAC/C,aAAO,WAAW,MAAM,eAAe,SAAS,CAAC;AAAA,IACnD;AACA,QAAI,WAAW,WAAW,cAAc,GAAG;AACzC,aAAO,WAAW,MAAM,eAAe,MAAM;AAAA,IAC/C;AACA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA,EAMQ,eAAeC,YAAmB,aAAgC;AAGxE,UAAM,sBAAsBA,WAAU,QAAQ,OAAO,GAAG;AACxD,WAAO,YAAY,KAAK,YAAU;AAChC,YAAM,mBAAmB,OAAO,QAAQ,OAAO,GAAG;AAElD,aAAO,wBAAwB,oBACxB,oBAAoB,SAAS,MAAM,gBAAgB;AAAA,IAC5D,CAAC;AAAA,EACH;AAAA;AAAA;AAAA;AAAA,EAKQ,gBACN,UACA,YACA,eACA,YAC4B;AAC5B,UAAM,mBAAmB,gBAAgB,SAAS;AAClD,UAAM,iBAAiB,gBAAgB,SAAS;AAEhD,QAAI,aAAa,iBAAkB,QAAO;AAE1C,UAAM,oBAAoB,cAAc,iBAAiB,UAAU;AACnE,UAAM,qBAAqB,sBAAsB,UAAU,iBAAiB;AAG5E,UAAM,UAAU,eAAe,eAC3B,UAAU,UAAU,6CAA6C,KAAK,MAAM,kBAAkB,CAAC,MAC/F,eAAe,UAAU,sBAAsB,KAAK,MAAM,kBAAkB,CAAC;AAEjF,WAAO;AAAA,MACL,UAAU,SAAS;AAAA,MACnB,WAAW,SAAS;AAAA,MACpB,SAAS,SAAS;AAAA,MAClB,YAAY,SAAS,cAAc;AAAA,MACnC,YAAY,SAAS;AAAA,MACrB,UAAU,SAAS;AAAA,MACnB;AAAA,MACA,WAAW,KAAK,MAAM,kBAAkB;AAAA,MACxC,UAAU;AAAA,MACV;AAAA,MACA;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAMQ,wBACN,QACiB;AACjB,UAAM,OAAO,oBAAI,IAAY;AAC7B,UAAM,SAA0B,CAAC;AAEjC,eAAW,EAAE,SAAS,KAAK,QAAQ;AACjC,UAAI,SAAS,eAAe,cAAc,SAAS,eAAe,SAAU;AAE5E,YAAM,MAAM,GAAG,SAAS,IAAI,IAAI,SAAS,SAAS,IAAI,SAAS,OAAO;AACtE,UAAI,KAAK,IAAI,GAAG,EAAG;AAEnB,WAAK,IAAI,GAAG;AACZ,aAAO,KAAK,QAAQ;AAAA,IACtB;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOQ,gBAAgB,QAAwB;AAC9C,WAAO,SAAS;AAAA,EAClB;AAAA;AAAA;AAAA;AAAA,EAKQ,WAAW,SAAyB;AAC1C,QAAI,WAAW,IAAI;AACjB,YAAM,QAAQ,KAAK,MAAM,UAAU,EAAE;AACrC,YAAM,OAAO,KAAK,MAAM,UAAU,EAAE;AACpC,aAAO,OAAO,IAAI,GAAG,KAAK,KAAK,IAAI,MAAM,GAAG,KAAK;AAAA,IACnD;AACA,WAAO,GAAG,KAAK,MAAM,OAAO,CAAC;AAAA,EAC/B;AAAA;AAAA;AAAA;AAAA,EAKQ,wBACN,UACA,aACA,WACA,YAC4B;AAC5B,UAAM,mBAAmB,YAAY,SAAS;AAC9C,UAAM,iBAAiB,YAAY,SAAS;AAE5C,QAAI,cAAc,iBAAkB,QAAO;AAE3C,UAAM,oBAAoB,eAAe,iBAAiB,UAAU;AACpE,UAAM,qBAAqB,sBAAsB,UAAU,iBAAiB;AAG5E,QAAI;AACJ,QAAI,eAAe,mBAAmB;AACpC,YAAM,cAAc,KAAK,gBAAgB,WAAW;AACpD,YAAM,mBAAmB,KAAK,gBAAgB,kBAAkB;AAChE,gBAAU,uBAAuB,KAAK,WAAW,WAAW,CAAC,sBAAsB,KAAK,WAAW,gBAAgB,CAAC;AAAA,IACtH,OAAO;AACL,gBAAU,kBAAkB,YAAY,QAAQ,CAAC,CAAC,sBAAsB,mBAAmB,QAAQ,CAAC,CAAC;AAAA,IACvG;AAEA,UAAM,kBAAmC;AAAA,MACvC,QAAQ,SAAS,kBAAkB;AAAA,MACnC,YAAY,SAAS,sBAAsB;AAAA,MAC3C,QAAQ,SAAS,kBAAkB;AAAA,MACnC,MAAM,SAAS,gBAAgB;AAAA,IACjC;AAKA,QAAI;AACJ,QAAI;AACJ,QAAI,eAAe,mBAAmB;AAEpC,mBAAa,KAAK,MAAM,KAAK,gBAAgB,WAAW,CAAC;AACzD,yBAAmB,KAAK,MAAM,KAAK,gBAAgB,kBAAkB,CAAC;AAAA,IACxE,OAAO;AAEL,mBAAa;AACb,yBAAmB;AAAA,IACrB;AAEA,WAAO;AAAA,MACL,UAAU,SAAS;AAAA,MACnB,WAAW,SAAS;AAAA,MACpB,SAAS,SAAS;AAAA,MAClB,YAAY,SAAS,cAAc;AAAA,MACnC,YAAY,SAAS;AAAA,MACrB,UAAU,SAAS;AAAA,MACnB;AAAA,MACA,WAAW;AAAA,MACX,UAAU;AAAA,MACV;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKQ,qBACN,UACA,YACuB;AACvB,UAAM,aAAoC,CAAC;AAG3C,QAAI,SAAS,YAAY;AACvB,YAAM,IAAI,KAAK,gBAAgB,UAAU,SAAS,YAAY,WAAW,WAAW,YAAY;AAChG,UAAI,EAAG,YAAW,KAAK,CAAC;AAAA,IAC1B;AAGA,QAAI,SAAS,qBAAqB;AAChC,YAAM,IAAI,KAAK,gBAAgB,UAAU,SAAS,qBAAqB,WAAW,YAAY,WAAW;AACzG,UAAI,EAAG,YAAW,KAAK,CAAC;AAAA,IAC1B;AAGA,QAAI,WAAW,kBAAkB,SAAS,gBAAgB;AACxD,YAAM,IAAI,KAAK,wBAAwB,UAAU,SAAS,gBAAgB,WAAW,gBAAgB,iBAAiB;AACtH,UAAI,EAAG,YAAW,KAAK,CAAC;AAAA,IAC1B;AAGA,QAAI,WAAW,iBAAiB,SAAS,cAAc;AACrD,YAAM,IAAI,KAAK,wBAAwB,UAAU,SAAS,cAAc,WAAW,eAAe,eAAe;AACjH,UAAI,EAAG,YAAW,KAAK,CAAC;AAAA,IAC1B;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQQ,gBAAgB,SAAyB;AAC/C,WAAO,UAAU;AAAA,EACnB;AAAA;AAAA;AAAA;AAAA;AAAA,EAMQ,eAAe,QAAoF;AACzG,UAAM,mBAAmB,KAAK,OAAO,YAAY;AAGjD,UAAM,iBAAiB,kBAAkB,0BACrC,KAAK,gBAAgB,iBAAiB,uBAAuB,IAC7D,KAAK,gBAAgB,EAAE;AAE3B,UAAM,aAAa;AAAA,MACjB,WAAW,kBAAkB,aAAa;AAAA,MAC1C,YAAY,kBAAkB,cAAc;AAAA,MAC5C;AAAA;AAAA,MACA,eAAe,kBAAkB,iBAAiB;AAAA;AAAA,IACpD;AACA,UAAM,iBAAiB,KAAK,wBAAwB,MAAM;AAE1D,WAAO,eAAe;AAAA,MAAQ,cAC5B,KAAK,qBAAqB,UAAU,UAAU;AAAA,IAChD;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKQ,YACN,YACA,WACkB;AAElB,UAAM,oBAAoB,oBAAI,IAAmC;AACjE,eAAW,aAAa,YAAY;AAClC,YAAM,iBAAiB,KAAK,kBAAkB,UAAU,QAAQ;AAEhE,gBAAU,WAAW;AACrB,YAAM,WAAW,kBAAkB,IAAI,cAAc,KAAK,CAAC;AAC3D,eAAS,KAAK,SAAS;AACvB,wBAAkB,IAAI,gBAAgB,QAAQ;AAAA,IAChD;AAGA,UAAM,gBAAgB,IAAI,IAAI,UAAU,IAAI,OAAK,KAAK,kBAAkB,EAAE,SAAS,IAAI,CAAC,CAAC;AAGzF,UAAM,QAA4C,CAAC;AACnD,eAAW,YAAY,eAAe;AACpC,YAAM,iBAAiB,kBAAkB,IAAI,QAAQ,KAAK,CAAC;AAC3D,YAAM,QAAQ,IAAI;AAAA,QAChB,YAAY;AAAA,QACZ,YAAY,CAAC;AAAA;AAAA,QACb,kBAAkB,CAAC;AAAA;AAAA,QACnB,WAAW,KAAK,mBAAmB,cAAc;AAAA,MACnD;AAAA,IACF;AAGA,UAAM,aAAa,WAAW,OAAO,OAAK,EAAE,aAAa,OAAO,EAAE;AAClE,UAAM,eAAe,WAAW,OAAO,OAAK,EAAE,aAAa,SAAS,EAAE;AAGtE,UAAM,mBAAmB,UACtB,OAAO,OAAK,EAAE,SAAS,eAAe,UAAa,EAAE,SAAS,aAAa,CAAC,EAC5E,IAAI,OAAK,EAAE,SAAS,UAAW;AAElC,UAAM,gBAAgB,iBAAiB,SAAS,IAC5C,iBAAiB,OAAO,CAAC,KAAK,QAAQ,MAAM,KAAK,CAAC,IAAI,iBAAiB,SACvE;AAEJ,UAAM,gBAAgB,iBAAiB,SAAS,IAC5C,KAAK,IAAI,GAAG,gBAAgB,IAC5B;AAEJ,WAAO;AAAA,MACL,SAAS;AAAA,QACP,eAAe,cAAc;AAAA,QAC7B,iBAAiB,WAAW;AAAA,QAC5B,YAAY,EAAE,OAAO,YAAY,SAAS,aAAa;AAAA,QACvD,eAAe,KAAK,MAAM,gBAAgB,EAAE,IAAI;AAAA;AAAA,QAChD;AAAA,MACF;AAAA,MACA;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKQ,mBAAmB,YAA8C;AACvE,QAAI,WAAW,WAAW,EAAG,QAAO;AAEpC,UAAM,YAAY,WAAW,KAAK,OAAK,EAAE,aAAa,OAAO;AAC7D,UAAM,aAAa,WAAW,OAAO,OAAK,EAAE,aAAa,OAAO,EAAE;AAElE,QAAI,cAAc,EAAG,QAAO;AAC5B,QAAI,UAAW,QAAO;AACtB,QAAI,WAAW,UAAU,EAAG,QAAO;AACnC,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQQ,uBACN,QACA,WACM;AACN,UAAM,gBAAgB,QAAQ,IAAI;AAGlC,UAAM,sBAAsB,OAAO,QAAQ,OAAO,KAAK,EACpD,OAAO,CAAC,CAAC,GAAG,IAAI,MAAM,KAAK,WAAW,SAAS,CAAC,EAChD,IAAI,CAAC,CAAC,UAAU,CAAC,MAAM,QAAQ;AAElC,eAAW,YAAY,qBAAqB;AAC1C,YAAM,WAAW,OAAO,MAAM,QAAQ;AAGtC,YAAM,cAAc,oBAAoB,UAAU,WAAW,aAAa;AAG1E,eAAS,aAAa,YAAY,WAAW,IAAI,OAAK,EAAE,QAAQ;AAChE,eAAS,iBAAiB,YAAY;AAItC,UAAIC,YAAW,YAAY,SAAS,IAAIA,YAAW,SAAS,SAAS,GAAG;AACtE,iBAAS,YAAY,YAAY;AAAA,MACnC;AAGA,UAAI,YAAY,mBAAmB;AACjC,iBAAS,6BAA6B;AAAA,UACpC,mBAAmB,YAAY,kBAAkB;AAAA,UACjD,eAAe,YAAY,kBAAkB;AAAA,UAC7C,yBAAyB,YAAY,kBAAkB;AAAA,QACzD;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACF;;;AH9ZA,SAAS,mBAAmB,GAAwB,UAA8B;AAChF,SAAO;AAAA,IACL,UAAU,EAAE;AAAA,IACZ,YAAY,EAAE;AAAA,IACd,YAAY,EAAE;AAAA,IACd,WAAW,EAAE;AAAA,IACb,SAAS,EAAE;AAAA,IACX,YAAY,EAAE;AAAA,IACd,YAAY,EAAE;AAAA,IACd,WAAW,EAAE;AAAA,IACb,UAAU,EAAE;AAAA,IACZ,UAAU,EAAE;AAAA,IACZ,SAAS,EAAE;AAAA,IACX,gBAAgB,SAAS,kBAAkB;AAAA,IAC3C,WAAW,SAAS;AAAA,IACpB,GAAI,EAAE,mBAAmB,EAAE,iBAAiB,EAAE,gBAAgB;AAAA,EAChE;AACF;AAMA,eAAsB,oBACpB,MACA,KACwB;AACxB,QAAM,EAAE,UAAU,QAAQ,KAAK,mBAAmB,iBAAiB,IAAI;AAEvE,SAAO,MAAM;AAAA,IACX;AAAA,IACA,OAAO,kBAAkB;AACvB,UAAI,yBAAyB;AAC7B,YAAM,kBAAkB;AAExB,YAAM,WAAW,IAAI,mBAAmB,UAAU,MAAM;AACxD,YAAM,SAAS,MAAM,SAAS,QAAQ,cAAc,KAAK;AACzD,UAAI,YAAY,OAAO,QAAQ,aAAa,QAAQ;AAIpD,YAAM,gBAAwC,QAAQ,OAAO,QAAQ,OAAO,KAAK,CAAC,EAC/E;AAAA,QAAQ,CAAC,CAAsB,EAAE,QAAQ,MACxC,SAAS,WAAW,IAAI,OAAK,mBAAmB,GAAG,QAAQ,CAAC;AAAA,MAC9D,EACC,WAAW,YAAY,EACvB,IAAI;AAGP,YAAM,aAAa,cAAc,cAAc,SAC3C,cAAc,OAAO,OAAK,EAAE,cAAc,cAAc,SAAU,IAClE;AAEJ,YAAM,gBAAgB,WAAW,MAAM,GAAG,cAAc,GAAG;AAG3D,YAAM,aAAa,QAAQ,UAAU,EAAE,QAAQ,UAAU,EAAE,IAAI;AAE/D,aAAO;AAAA,QACL,WAAW,iBAAiB;AAAA,QAC5B,SAAS;AAAA,UACP,eAAe,OAAO,QAAQ;AAAA,UAC9B,eAAe,OAAO,QAAQ;AAAA,UAC9B,eAAe,OAAO,QAAQ;AAAA,UAC9B,gBAAgB,WAAW;AAAA,UAC3B,YAAY;AAAA,YACV,OAAO,WAAW,OAAO,KAAK;AAAA,YAC9B,SAAS,WAAW,SAAS,KAAK;AAAA,UACpC;AAAA,QACF;AAAA,QACA,YAAY;AAAA,MACd;AAAA,IACF;AAAA,EACF,EAAE,IAAI;AACR;;;AIvDO,IAAM,eAA4C;AAAA,EACvD,mBAAmB;AAAA,EACnB,gBAAgB;AAAA,EAChB,qBAAqB;AAAA,EACrB,kBAAkB;AAAA,EAClB,kBAAkB;AAAA,EAClB,kBAAkB;AACpB;;;ApBzBA;AACA;AACA;AACA;AACA;AACA;AACA;;;AqBfA;AAFA,OAAO,cAAc;AACrB,OAAOC,YAAU;AAcV,IAAM,cAAN,MAAkB;AAAA,EACf,UAAqC;AAAA,EACrC,iBAA8C,oBAAI,IAAI;AAAA,EACtD;AAAA,EACA;AAAA,EACA,kBAA4C;AAAA,EAEpD,YAAY,SAAiB,QAAuC;AAClE,SAAK,UAAU;AACf,SAAK,SAAS;AAAA,EAChB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,MAAM,MAAM,SAA2C;AACrD,QAAI,KAAK,SAAS;AAChB,YAAM,IAAI,MAAM,iCAAiC;AAAA,IACnD;AAEA,SAAK,kBAAkB;AAGvB,QAAI;AACJ,QAAI;AAEJ,QAAI,eAAe,KAAK,MAAM,GAAG;AAC/B,wBAAkB,KAAK,OAAO,SAAS;AACvC,wBAAkB,KAAK,OAAO,SAAS;AAAA,IACzC,WAAW,eAAe,KAAK,MAAM,GAAG;AAEtC,wBAAkB,KAAK,OAAO,WAAW,QAAQ,OAAK,EAAE,OAAO,OAAO;AACtE,wBAAkB,KAAK,OAAO,WAAW,QAAQ,OAAK,EAAE,OAAO,OAAO;AAAA,IACxE,OAAO;AACL,wBAAkB,CAAC,MAAM;AACzB,wBAAkB,CAAC;AAAA,IACrB;AAGA,SAAK,UAAU,SAAS,MAAM,iBAAiB;AAAA,MAC7C,KAAK,KAAK;AAAA,MACV,SAAS;AAAA,MACT,YAAY;AAAA,MACZ,eAAe;AAAA;AAAA;AAAA;AAAA,MAIf,QAAQ;AAAA,MAER,kBAAkB;AAAA,QAChB,oBAAoB;AAAA;AAAA,QACpB,cAAc;AAAA,MAChB;AAAA;AAAA,MAGA,YAAY;AAAA,MACZ,UAAU;AAAA,MACV,gBAAgB;AAAA,IAClB,CAAC;AAGD,SAAK,QACF,GAAG,OAAO,CAAC,aAAa,KAAK,aAAa,OAAO,QAAQ,CAAC,EAC1D,GAAG,UAAU,CAAC,aAAa,KAAK,aAAa,UAAU,QAAQ,CAAC,EAChE,GAAG,UAAU,CAAC,aAAa,KAAK,aAAa,UAAU,QAAQ,CAAC,EAChE,GAAG,SAAS,CAAC,UAAU;AACtB,cAAQ,MAAM,8BAA8B,KAAK,EAAE;AAAA,IACrD,CAAC;AAGH,UAAM,IAAI,QAAc,CAAC,YAAY;AACnC,WAAK,QAAS,GAAG,SAAS,MAAM;AAC9B,gBAAQ;AAAA,MACV,CAAC;AAAA,IACH,CAAC;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA,EAMQ,aAAa,MAAmC,UAAwB;AAE9E,UAAM,gBAAgB,KAAK,eAAe,IAAI,QAAQ;AACtD,QAAI,eAAe;AACjB,mBAAa,aAAa;AAAA,IAC5B;AAGA,UAAM,QAAQ,WAAW,MAAM;AAC7B,WAAK,eAAe,OAAO,QAAQ;AAGnC,UAAI,KAAK,iBAAiB;AAExB,cAAM,eAAeA,OAAK,WAAW,QAAQ,IACzC,WACAA,OAAK,KAAK,KAAK,SAAS,QAAQ;AAEpC,YAAI;AACF,gBAAM,SAAS,KAAK,gBAAgB;AAAA,YAClC;AAAA,YACA,UAAU;AAAA,UACZ,CAAC;AAGD,cAAI,kBAAkB,SAAS;AAC7B,mBAAO,MAAM,CAAC,UAAU;AACtB,sBAAQ,MAAM,sCAAsC,KAAK,EAAE;AAAA,YAC7D,CAAC;AAAA,UACH;AAAA,QACF,SAAS,OAAO;AACd,kBAAQ,MAAM,sCAAsC,KAAK,EAAE;AAAA,QAC7D;AAAA,MACF;AAAA,IACF,GAAG,KAAK,OAAO,aAAa,UAAU;AAEtC,SAAK,eAAe,IAAI,UAAU,KAAK;AAAA,EACzC;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,OAAsB;AAC1B,QAAI,CAAC,KAAK,SAAS;AACjB;AAAA,IACF;AAGA,eAAW,SAAS,KAAK,eAAe,OAAO,GAAG;AAChD,mBAAa,KAAK;AAAA,IACpB;AACA,SAAK,eAAe,MAAM;AAG1B,UAAM,KAAK,QAAQ,MAAM;AACzB,SAAK,UAAU;AACf,SAAK,kBAAkB;AAAA,EACzB;AAAA;AAAA;AAAA;AAAA,EAKA,kBAA4B;AAC1B,QAAI,CAAC,KAAK,SAAS;AACjB,aAAO,CAAC;AAAA,IACV;AAEA,UAAM,UAAU,KAAK,QAAQ,WAAW;AACxC,UAAM,QAAkB,CAAC;AAEzB,eAAW,CAAC,KAAK,SAAS,KAAK,OAAO,QAAQ,OAAO,GAAG;AACtD,iBAAW,YAAY,WAAW;AAChC,cAAM,KAAK,GAAG,GAAG,IAAI,QAAQ,EAAE;AAAA,MACjC;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,YAAqB;AACnB,WAAO,KAAK,YAAY;AAAA,EAC1B;AACF;;;ArBpKA;AACA;AAIA,IAAMC,cAAaC,eAAc,YAAY,GAAG;AAChD,IAAMC,aAAYC,SAAQH,WAAU;AACpC,IAAMI,WAAUC,eAAc,YAAY,GAAG;AAE7C,IAAIC;AACJ,IAAI;AACF,EAAAA,eAAcF,SAAQG,MAAKL,YAAW,iBAAiB,CAAC;AAC1D,QAAQ;AACN,EAAAI,eAAcF,SAAQG,MAAKL,YAAW,oBAAoB,CAAC;AAC7D;AAWA,eAAe,mBACb,SACA,KAC8D;AAC9D,QAAM,aAAa,IAAI,gBAAgB;AACvC,QAAM,WAAW,IAAI,SAAS,OAAO;AAErC,MAAI,4BAA4B;AAChC,QAAM,WAAW,WAAW;AAE5B,MAAI,4BAA4B;AAChC,QAAM,SAAS,WAAW;AAE1B,MAAI,gCAAgC;AACpC,SAAO,EAAE,YAAY,SAAS;AAChC;AAKA,eAAe,mBACb,UACA,QACA,SACA,KACe;AACf,QAAM,WAAW,MAAM,SAAS,QAAQ;AAExC,MAAI,CAAC,YAAY,OAAO,IAAI,qBAAqB;AAC/C,QAAI,wDAAiD;AACrD,QAAI,oEAA0D;AAE9D,QAAI;AACF,YAAM,EAAE,eAAAM,eAAc,IAAI,MAAM;AAChC,YAAMA,eAAc,EAAE,SAAS,SAAS,KAAK,CAAC;AAC9C,UAAI,mCAA8B;AAAA,IACpC,SAAS,OAAO;AACd,UAAI,0CAAgC,KAAK,IAAI,SAAS;AACtD,UAAI,oCAAoC,SAAS;AAAA,IACnD;AAAA,EACF,WAAW,CAAC,UAAU;AACpB,QAAI,sEAA4D,SAAS;AACzE,QAAI,4CAA4C,SAAS;AAAA,EAC3D;AACF;AAKA,eAAe,kBACb,QACA,SACA,UACA,YACA,SACA,KACyF;AACzF,MAAI,CAAC,OAAO,aAAa,SAAS;AAChC,QAAI,yCAAyC;AAC7C,WAAO,EAAE,YAAY,MAAM,iBAAiB,KAAK;AAAA,EACnD;AAEA,QAAM,eAAe,MAAM,eAAe;AAC1C,QAAM,SAAS,MAAM,UAAU,OAAO;AAEtC,MAAI,CAAC,cAAc;AACjB,QAAI,4CAA4C;AAChD,WAAO,EAAE,YAAY,MAAM,iBAAiB,KAAK;AAAA,EACnD;AACA,MAAI,CAAC,QAAQ;AACX,QAAI,+CAA+C;AACnD,WAAO,EAAE,YAAY,MAAM,iBAAiB,KAAK;AAAA,EACnD;AAEA,MAAI,gCAA2B;AAC/B,QAAM,aAAa,IAAI,gBAAgB,SAAS,SAAS,MAAM;AAG/D,MAAI;AACF,QAAI,6BAA6B;AACjC,UAAM,eAAe,MAAM,WAAW,WAAW;AAEjD,QAAI,gBAAgB,aAAa,SAAS,GAAG;AAC3C,UAAI,mCAA4B,aAAa,MAAM,gBAAgB;AACnE,YAAM,QAAQ,MAAM,mBAAmB,cAAc,UAAU,YAAY,QAAQ,EAAE,QAAQ,CAAC;AAC9F,UAAI,oBAAe,KAAK,QAAQ;AAAA,IAClC,OAAO;AACL,UAAI,2CAAsC;AAAA,IAC5C;AAAA,EACF,SAAS,OAAO;AACd,QAAI,yCAAyC,KAAK,IAAI,SAAS;AAAA,EACjE;AAGA,MAAI,gDAA2C,OAAO,aAAa,iBAAiB,GAAI,IAAI;AAE5F,QAAM,kBAAkB,YAAY,YAAY;AAC9C,QAAI;AACF,YAAM,eAAe,MAAM,WAAW,cAAc;AACpD,UAAI,gBAAgB,aAAa,SAAS,GAAG;AAC3C,YAAI,kCAA2B,aAAa,MAAM,gBAAgB;AAClE,2BAAmB,cAAc,UAAU,YAAY,QAAQ,EAAE,QAAQ,CAAC,EACvE,KAAK,WAAS,IAAI,uCAAkC,KAAK,QAAQ,CAAC,EAClE,MAAM,WAAS,IAAI,8BAA8B,KAAK,IAAI,SAAS,CAAC;AAAA,MACzE;AAAA,IACF,SAAS,OAAO;AACd,UAAI,+BAA+B,KAAK,IAAI,SAAS;AAAA,IACvD;AAAA,EACF,GAAG,OAAO,aAAa,cAAc;AAErC,SAAO,EAAE,YAAY,gBAAgB;AACvC;AAKA,eAAe,kBACb,OACA,QACA,SACA,UACA,YACA,SACA,KAC6B;AAC7B,QAAM,sBAAsB,UAAU,SAAY,QAAQ,OAAO,aAAa;AAC9E,MAAI,CAAC,oBAAqB,QAAO;AAEjC,MAAI,oCAA6B;AACjC,QAAM,cAAc,IAAI,YAAY,SAAS,MAAM;AAEnD,MAAI;AACF,UAAM,YAAY,MAAM,OAAO,UAAU;AACvC,YAAM,EAAE,MAAM,SAAS,IAAI;AAE3B,UAAI,SAAS,UAAU;AACrB,YAAI,kCAAsB,QAAQ,EAAE;AACpC,YAAI;AACF,gBAAM,SAAS,aAAa,QAAQ;AACpC,gBAAM,WAAW,IAAI,gBAAgB,SAAS,MAAM;AACpD,gBAAM,SAAS,WAAW,QAAQ;AAClC,cAAI,kBAAa,QAAQ,aAAa;AAAA,QACxC,SAAS,OAAO;AACd,cAAI,oBAAoB,QAAQ,KAAK,KAAK,IAAI,SAAS;AAAA,QACzD;AAAA,MACF,OAAO;AACL,cAAM,SAAS,SAAS,QAAQ,UAAU;AAC1C,YAAI,kBAAW,MAAM,KAAK,QAAQ,EAAE;AACpC,wBAAgB,UAAU,UAAU,YAAY,QAAQ,EAAE,QAAQ,CAAC,EAChE,MAAM,CAAC,UAAU,IAAI,qBAAqB,QAAQ,KAAK,KAAK,IAAI,SAAS,CAAC;AAAA,MAC/E;AAAA,IACF,CAAC;AAED,QAAI,0CAAqC,YAAY,gBAAgB,EAAE,MAAM,SAAS;AACtF,WAAO;AAAA,EACT,SAAS,OAAO;AACd,QAAI,iCAAiC,KAAK,IAAI,SAAS;AACvD,WAAO;AAAA,EACT;AACF;AAKA,SAAS,wBACP,QACA,aACA,KACM;AACN,SAAO,kBAAkB,uBAAuB,OAAO,YAAY;AACjE,UAAM,EAAE,MAAM,WAAW,KAAK,IAAI,QAAQ;AAC1C,QAAI,uBAAuB,IAAI,EAAE;AAEjC,UAAM,UAAU,aAAa,IAAI;AACjC,QAAI,CAAC,SAAS;AACZ,YAAM,QAAQ,IAAI;AAAA,QAChB,iBAAiB,IAAI;AAAA;AAAA,QAErB,EAAE,eAAe,MAAM,gBAAgB,MAAM,IAAI,OAAK,EAAE,IAAI,EAAE;AAAA,QAC9D;AAAA,QAAU;AAAA,QAAO;AAAA,MACnB;AACA,aAAO,EAAE,SAAS,MAAM,SAAS,CAAC,EAAE,MAAM,QAAiB,MAAM,KAAK,UAAU,MAAM,OAAO,GAAG,MAAM,CAAC,EAAE,CAAC,EAAE;AAAA,IAC9G;AAEA,QAAI;AACF,aAAO,MAAM,QAAQ,MAAM,WAAW;AAAA,IACxC,SAAS,OAAO;AACd,UAAI,iBAAiB,WAAW;AAC9B,eAAO,EAAE,SAAS,MAAM,SAAS,CAAC,EAAE,MAAM,QAAiB,MAAM,KAAK,UAAU,MAAM,OAAO,GAAG,MAAM,CAAC,EAAE,CAAC,EAAE;AAAA,MAC9G;AACA,cAAQ,MAAM,uCAAuC,IAAI,KAAK,KAAK;AACnE,aAAO;AAAA,QACL,SAAS;AAAA,QACT,SAAS,CAAC;AAAA,UACR,MAAM;AAAA,UACN,MAAM,KAAK,UAAU,EAAE,OAAO,iBAAiB,QAAQ,MAAM,UAAU,iBAAiB,6CAAoC,MAAM,KAAK,GAAG,MAAM,CAAC;AAAA,QACnJ,CAAC;AAAA,MACH;AAAA,IACF;AAAA,EACF,CAAC;AACH;AAEA,eAAsB,eAAe,SAA0C;AAC7E,QAAM,EAAE,SAAS,SAAS,MAAM,IAAI;AAGpC,QAAM,WAAkB,CAAC,SAAS,QAAQ,WAAW;AACnD,QAAI,WAAW,UAAU,aAAa,UAAU,SAAS;AACvD,cAAQ,MAAM,eAAe,KAAK,KAAK,OAAO,EAAE;AAAA,IAClD;AAAA,EACF;AAEA,WAAS,4BAA4B;AAGrC,QAAM,EAAE,YAAY,SAAS,IAAI,MAAM,mBAAmB,SAAS,QAAQ,EAAE,MAAM,WAAS;AAC1F,YAAQ,MAAM,yBAAyB,KAAK,EAAE;AAC9C,YAAQ,KAAK,CAAC;AAAA,EAChB,CAAC;AAGD,QAAM,SAAS,IAAI;AAAA,IACjB,EAAE,MAAM,QAAQ,SAASF,aAAY,QAAQ;AAAA,IAC7C,EAAE,cAAc,EAAE,OAAO,CAAC,GAAG,SAAS,CAAC,EAAE,EAAE;AAAA,EAC7C;AAKA,QAAM,MAAa,CAAC,SAAS,QAAkB,WAAW;AACxD,QAAI,WAAW,UAAU,aAAa,UAAU,SAAS;AACvD,aAAO,mBAAmB;AAAA,QACxB;AAAA,QACA,QAAQ;AAAA,QACR,MAAM;AAAA,MACR,CAAC,EAAE,MAAM,MAAM;AAEb,gBAAQ,MAAM,eAAe,KAAK,KAAK,OAAO,EAAE;AAAA,MAClD,CAAC;AAAA,IACH;AAAA,EACF;AAEA,SAAO,kBAAkB,wBAAwB,aAAa,EAAE,MAAM,EAAE;AAGxE,QAAM,oBAAoB,YAAY;AACpC,QAAI;AACF,UAAI,MAAM,SAAS,aAAa,GAAG;AACjC,YAAI,wCAAwC;AAC5C,cAAM,SAAS,UAAU;AAAA,MAC3B;AAAA,IACF,SAAS,OAAO;AACd,UAAI,yBAAyB,KAAK,IAAI,SAAS;AAAA,IACjD;AAAA,EACF;AAEA,QAAM,mBAAmB,OAAO;AAAA,IAC9B,cAAc,SAAS,kBAAkB;AAAA,IACzC,WAAW,SAAS,eAAe;AAAA,EACrC;AAEA,QAAM,uBAAuB,YAAY,mBAAmB,yBAAyB;AAGrF,QAAM,SAAS,MAAM,cAAc,KAAK,OAAO;AAC/C,QAAM,cAA2B,EAAE,UAAU,YAAY,QAAQ,SAAS,KAAK,mBAAmB,iBAAiB;AAGnH,0BAAwB,QAAQ,aAAa,GAAG;AAChD,QAAM,mBAAmB,UAAU,QAAQ,SAAS,GAAG;AACvD,QAAM,EAAE,gBAAgB,IAAI,MAAM,kBAAkB,QAAQ,SAAS,UAAU,YAAY,SAAS,GAAG;AACvG,QAAM,cAAc,MAAM,kBAAkB,OAAO,QAAQ,SAAS,UAAU,YAAY,SAAS,GAAG;AAGtG,QAAM,UAAU,YAAY;AAC1B,QAAI,6BAA6B;AACjC,kBAAc,oBAAoB;AAClC,QAAI,gBAAiB,eAAc,eAAe;AAClD,QAAI,YAAa,OAAM,YAAY,KAAK;AACxC,YAAQ,KAAK,CAAC;AAAA,EAChB;AAEA,UAAQ,GAAG,UAAU,OAAO;AAC5B,UAAQ,GAAG,WAAW,OAAO;AAG7B,QAAM,YAAY,IAAI,qBAAqB;AAC3C,YAAU,UAAU,MAAM;AAAE,QAAI,kBAAkB;AAAG,YAAQ,EAAE,MAAM,MAAM,QAAQ,KAAK,CAAC,CAAC;AAAA,EAAG;AAC7F,YAAU,UAAU,CAAC,UAAU,IAAI,oBAAoB,KAAK,EAAE;AAE9D,QAAM,OAAO,QAAQ,SAAS;AAC9B,MAAI,2CAA2C;AACjD;;;AD1UA,eAAsB,aAAa,SAA+E;AAChH,QAAM,UAAU,QAAQ,OAAOG,OAAK,QAAQ,QAAQ,IAAI,IAAI,QAAQ,IAAI;AAExE,MAAI;AAEF,QAAI,QAAQ,MAAM;AAChB,UAAI;AACF,cAAM,QAAQ,MAAMC,KAAG,KAAK,OAAO;AACnC,YAAI,CAAC,MAAM,YAAY,GAAG;AACxB,kBAAQ,MAAMC,OAAM,IAAI,0CAA0C,OAAO,EAAE,CAAC;AAC5E,kBAAQ,KAAK,CAAC;AAAA,QAChB;AAAA,MACF,SAAS,OAAO;AACd,YAAK,MAAgC,SAAS,UAAU;AACtD,kBAAQ,MAAMA,OAAM,IAAI,2CAA2C,OAAO,EAAE,CAAC;AAAA,QAC/E,WAAY,MAAgC,SAAS,UAAU;AAC7D,kBAAQ,MAAMA,OAAM,IAAI,8CAA8C,OAAO,EAAE,CAAC;AAAA,QAClF,OAAO;AACL,kBAAQ,MAAMA,OAAM,IAAI,6CAA6C,OAAO,EAAE,CAAC;AAC/E,kBAAQ,MAAMA,OAAM,IAAK,MAAgB,OAAO,CAAC;AAAA,QACnD;AACA,gBAAQ,KAAK,CAAC;AAAA,MAChB;AAAA,IACF;AAGA,eAAW;AACX,YAAQ,MAAMA,OAAM,KAAK,0BAA0B,CAAC;AAEpD,QAAI,QAAQ,MAAM;AAChB,cAAQ,MAAMA,OAAM,IAAI,iBAAiB,OAAO;AAAA,CAAI,CAAC;AAAA,IACvD;AAGA,QAAI,QAAQ,OAAO;AACjB,cAAQ,MAAMA,OAAM,OAAO,yEAA+D,CAAC;AAC3F,cAAQ,MAAMA,OAAM,IAAI,+CAA+C,CAAC;AAAA,IAC1E;AAIA,UAAM,QAAQ,QAAQ,UAAU,QAAQ,QAAQ,QAAQ,OAAO;AAE/D,UAAM,eAAe;AAAA,MACnB;AAAA,MACA,SAAS;AAAA,MACT;AAAA,IACF,CAAC;AAAA,EACH,SAAS,OAAO;AACd,YAAQ,MAAMA,OAAM,IAAI,6BAA6B,GAAG,KAAK;AAC7D,YAAQ,KAAK,CAAC;AAAA,EAChB;AACF;;;AuBvDA;AACA;AAJA,OAAOC,YAAW;AAClB,OAAOC,UAAQ;AACf,OAAOC,YAAU;;;ACFjB,OAAOC,YAAW;AAWlB,SAAS,eAAe,YAAuD;AAC7E,UAAQ,YAAY;AAAA,IAClB,KAAK;AAAa,aAAO;AAAA,IACzB,KAAK;AAAc,aAAO;AAAA,IAC1B,KAAK;AAAmB,aAAO;AAAA,IAC/B,KAAK;AAAiB,aAAO;AAAA,IAC7B;AAAS,aAAO;AAAA,EAClB;AACF;AAKA,SAAS,gBAAgB,QAAwB;AAC/C,SAAO,SAAS;AAClB;AAKA,SAAS,WAAW,SAAyB;AAC3C,MAAI,WAAW,IAAI;AACjB,UAAM,QAAQ,KAAK,MAAM,UAAU,EAAE;AACrC,UAAM,OAAO,KAAK,MAAM,UAAU,EAAE;AACpC,WAAO,OAAO,IAAI,GAAG,KAAK,KAAK,IAAI,MAAM,GAAG,KAAK;AAAA,EACnD;AACA,SAAO,GAAG,KAAK,MAAM,OAAO,CAAC;AAC/B;AAKA,SAAS,sBAAsB,WAAwC;AACrE,MAAI,CAAC,UAAU,gBAAiB,QAAO,CAAC;AAExC,QAAM,EAAE,QAAQ,YAAY,QAAQ,KAAK,IAAI,UAAU;AACvD,QAAM,UAAU,WAAW,gBAAgB,MAAM,CAAC;AAClD,SAAO;AAAA,IACLA,OAAM,IAAI,0BAAmB,KAAK,MAAM,MAAM,EAAE,eAAe,CAAC,iBAAiB,WAAW,QAAQ,CAAC,CAAC,EAAE;AAAA,IACxGA,OAAM,IAAI,4BAAkB,OAAO,gBAAgB,KAAK,QAAQ,CAAC,CAAC,EAAE;AAAA,EACtE;AACF;AAQA,IAAM,mBAAoD;AAAA,EACxD,iBAAiB,CAAC,KAAK,YAAY;AAAA;AAAA,IAEjC,YAAY,MAAM,WAAW,GAAG;AAAA,IAChC,WAAW,WAAW,MAAM;AAAA,EAC9B;AAAA,EACA,eAAe,CAAC,KAAK,YAAY;AAAA,IAC/B,YAAY,IAAI,QAAQ,CAAC;AAAA,IACzB,WAAW,OAAO,QAAQ,CAAC;AAAA,EAC7B;AAAA,EACA,YAAY,CAAC,KAAK,YAAY;AAAA,IAC5B,YAAY,GAAG,GAAG,YAAY,GAAG;AAAA,IACjC,WAAW,OAAO,SAAS;AAAA,EAC7B;AACF;AAEA,IAAM,mBAAoC,CAAC,KAAK,YAAY;AAAA,EAC1D,YAAY,IAAI,SAAS;AAAA,EACzB,WAAW,OAAO,SAAS;AAC7B;AAKA,SAAS,oBAAoB,WAA8B,QAAyB;AAClF,QAAM,UAAU,CAAC,YAAY,QAAQ,EAAE,SAAS,UAAU,UAAU,IAChE,GAAG,UAAU,UAAU,OACvB,UAAU;AACd,SAAO,SAASA,OAAM,KAAK,OAAO,IAAI;AACxC;AAKA,SAAS,qBAAqB,UAAwC;AACpE,QAAM,WAAW,SAAS,kBAAkB,SAAS,WAAW;AAChE,MAAI,aAAa,EAAG,QAAO,CAAC;AAE5B,QAAM,QAAQ,CAACA,OAAM,IAAI,8BAAuB,QAAQ,QAAQ,aAAa,IAAI,MAAM,EAAE,EAAE,CAAC;AAE5F,MAAI,SAAS,4BAA4B;AACvC,UAAM,EAAE,mBAAmB,cAAc,IAAI,SAAS;AACtD,UAAM,KAAKA,OAAM,IAAI,mCAAmC,iBAAiB,UAAU,aAAa,EAAE,CAAC;AAAA,EACrG;AAEA,SAAO;AACT;AAKA,SAAS,qBAAqB,YAAoB,WAA2B;AAC3E,MAAI,aAAa,EAAG,QAAO;AAC3B,SAAO,GAAG,KAAK,OAAQ,aAAa,aAAa,YAAa,GAAG,CAAC;AACpE;AAKA,SAAS,gBACP,WACA,UACA,SACA,QACU;AACV,QAAM,aAAa,oBAAoB,WAAW,MAAM;AACxD,QAAM,cAAc,eAAe,UAAU,UAAU;AACvD,QAAM,YAAY,iBAAiB,UAAU,UAAU,KAAK;AAC5D,QAAM,EAAE,YAAY,mBAAmB,WAAW,iBAAiB,IAAI,UAAU,UAAU,YAAY,UAAU,SAAS;AAE1H,SAAO;AAAA,IACL,QAAQ,KAAK,UAAU,IAAI,IAAI,UAAU,SAAS,EAAE,IAAIA,OAAM,IAAI,KAAK,IAAI;AAAA,IAC3EA,OAAM,IAAI,OAAO,WAAW,KAAK,iBAAiB,gBAAgB,gBAAgB,GAAG;AAAA,IACrFA,OAAM,IAAI,qBAAW,qBAAqB,UAAU,YAAY,UAAU,SAAS,CAAC,EAAE;AAAA,IACtF,GAAG,sBAAsB,SAAS;AAAA,IAClC,GAAG,qBAAqB,QAAQ;AAAA,IAChCA,OAAM,IAAI,2BAAiB,SAAS,UAAU,YAAY,CAAC,EAAE;AAAA,IAC7D;AAAA,EACF;AACF;AAKO,SAAS,iBAAiB,QAAkC;AACjE,QAAM,QAAkB,CAAC;AAGzB,QAAM,KAAKA,OAAM,KAAK,iCAA0B,CAAC;AAGjD,QAAM,KAAKA,OAAM,KAAK,UAAU,CAAC;AACjC,QAAM,KAAKA,OAAM,IAAI,oBAAoB,IAAI,OAAO,QAAQ,cAAc,SAAS,CAAC;AACpF,QAAM,YAAY,GAAG,OAAO,QAAQ,WAAW,KAAK,SAAS,OAAO,QAAQ,WAAW,UAAU,IAAI,MAAM,EAAE;AAC7G,QAAM,cAAc,GAAG,OAAO,QAAQ,WAAW,OAAO,WAAW,OAAO,QAAQ,WAAW,YAAY,IAAI,MAAM,EAAE;AACrH,QAAM,KAAKA,OAAM,IAAI,gBAAgB,IAAI,GAAG,OAAO,QAAQ,eAAe,KAAK,SAAS,KAAK,WAAW,GAAG;AAC3G,QAAM,KAAKA,OAAM,IAAI,wBAAwB,IAAI,OAAO,QAAQ,cAAc,SAAS,CAAC;AACxF,QAAM,KAAKA,OAAM,IAAI,oBAAoB,IAAI,OAAO,QAAQ,cAAc,SAAS,CAAC;AACpF,QAAM,KAAK,EAAE;AAGb,QAAM,sBAAsB,OAAO,QAAQ,OAAO,KAAK,EACpD,OAAO,CAAC,CAAC,GAAG,IAAI,MAAM,KAAK,WAAW,SAAS,CAAC,EAChD,KAAK,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,WAAW,SAAS,EAAE,CAAC,EAAE,WAAW,MAAM;AAEjE,MAAI,oBAAoB,WAAW,GAAG;AACpC,UAAM,KAAKA,OAAM,MAAM,6BAAwB,CAAC;AAChD,WAAO,MAAM,KAAK,IAAI;AAAA,EACxB;AAGA,QAAM,SAAS,oBAAoB;AAAA,IAAQ,CAAC,CAAC,MAAM,IAAI,MACrD,KAAK,WAAW,OAAO,OAAK,EAAE,aAAa,OAAO,EAAE,IAAI,QAAM,EAAE,MAAM,GAAG,EAAE,EAAE;AAAA,EAC/E;AAEA,MAAI,OAAO,SAAS,GAAG;AACrB,UAAM,KAAKA,OAAM,IAAI,KAAK,kBAAa,CAAC;AACxC,eAAW,SAAS,QAAQ;AAC1B,YAAM,KAAK,GAAG,gBAAgB,OAAO,OAAO,MAAM,MAAM,IAAI,GAAGA,OAAM,KAAK,IAAI,CAAC;AAAA,IACjF;AAAA,EACF;AAGA,QAAM,WAAW,oBAAoB;AAAA,IAAQ,CAAC,CAAC,MAAM,IAAI,MACvD,KAAK,WAAW,OAAO,OAAK,EAAE,aAAa,SAAS,EAAE,IAAI,QAAM,EAAE,MAAM,GAAG,EAAE,EAAE;AAAA,EACjF;AAEA,MAAI,SAAS,SAAS,GAAG;AACvB,UAAM,KAAKA,OAAM,OAAO,KAAK,2BAAiB,CAAC;AAC/C,eAAW,WAAW,UAAU;AAC9B,YAAM,KAAK,GAAG,gBAAgB,SAAS,OAAO,MAAM,QAAQ,IAAI,GAAGA,OAAM,QAAQ,KAAK,CAAC;AAAA,IACzF;AAAA,EACF;AAEA,SAAO,MAAM,KAAK,IAAI;AACxB;;;AC9LO,SAAS,iBAAiB,QAAkC;AACjE,SAAO,KAAK,UAAU,QAAQ,MAAM,CAAC;AACvC;;;ACwDA,SAAS,UAAU,YAA4B;AAC7C,UAAQ,YAAY;AAAA,IAClB,KAAK;AAAa,aAAO;AAAA,IACzB,KAAK;AAAc,aAAO;AAAA,IAC1B,KAAK;AAAmB,aAAO;AAAA,IAC/B,KAAK;AAAiB,aAAO;AAAA,IAC7B;AAAS,aAAO;AAAA,EAClB;AACF;AAKO,SAAS,kBAAkB,QAAkC;AAClE,QAAM,QAAqB;AAAA,IACzB;AAAA,MACE,IAAI;AAAA,MACJ,kBAAkB;AAAA,QAChB,MAAM;AAAA,MACR;AAAA,MACA,iBAAiB;AAAA,QACf,MAAM;AAAA,MACR;AAAA,MACA,MAAM;AAAA,QACJ,MAAM;AAAA,MACR;AAAA,IACF;AAAA,IACA;AAAA,MACE,IAAI;AAAA,MACJ,kBAAkB;AAAA,QAChB,MAAM;AAAA,MACR;AAAA,MACA,iBAAiB;AAAA,QACf,MAAM;AAAA,MACR;AAAA,MACA,MAAM;AAAA,QACJ,MAAM;AAAA,MACR;AAAA,IACF;AAAA,IACA;AAAA,MACE,IAAI;AAAA,MACJ,kBAAkB;AAAA,QAChB,MAAM;AAAA,MACR;AAAA,MACA,iBAAiB;AAAA,QACf,MAAM;AAAA,MACR;AAAA,MACA,MAAM;AAAA,QACJ,MAAM;AAAA,MACR;AAAA,IACF;AAAA,IACA;AAAA,MACE,IAAI;AAAA,MACJ,kBAAkB;AAAA,QAChB,MAAM;AAAA,MACR;AAAA,MACA,iBAAiB;AAAA,QACf,MAAM;AAAA,MACR;AAAA,MACA,MAAM;AAAA,QACJ,MAAM;AAAA,MACR;AAAA,IACF;AAAA,EACF;AAEA,QAAM,UAAyB,CAAC;AAGhC,aAAW,CAAC,UAAU,QAAQ,KAAK,OAAO,QAAQ,OAAO,KAAK,GAAG;AAC/D,eAAW,aAAa,SAAS,YAAY;AAC3C,YAAM,SAAS,UAAU,UAAU,UAAU;AAE7C,cAAQ,KAAK;AAAA,QACX;AAAA,QACA,OAAO,UAAU;AAAA,QACjB,SAAS;AAAA,UACP,MAAM,GAAG,UAAU,UAAU,KAAK,UAAU,OAAO;AAAA,QACrD;AAAA,QACA,WAAW;AAAA,UACT;AAAA,YACE,kBAAkB;AAAA,cAChB,kBAAkB;AAAA,gBAChB,KAAK;AAAA,cACP;AAAA,cACA,QAAQ;AAAA,gBACN,WAAW,UAAU;AAAA,gBACrB,SAAS,UAAU;AAAA,cACrB;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,MACF,CAAC;AAAA,IACH;AAAA,EACF;AAEA,QAAM,cAA2B;AAAA,IAC/B,SAAS;AAAA,IACT,SAAS;AAAA,IACT,MAAM;AAAA,MACJ;AAAA,QACE,MAAM;AAAA,UACJ,QAAQ;AAAA,YACN,MAAM;AAAA,YACN,SAAS;AAAA,YACT,gBAAgB;AAAA,YAChB;AAAA,UACF;AAAA,QACF;AAAA,QACA;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,SAAO,KAAK,UAAU,aAAa,MAAM,CAAC;AAC5C;;;ACvKO,SAAS,aACd,QACA,QACQ;AACR,UAAQ,QAAQ;AAAA,IACd,KAAK;AACH,aAAO,iBAAiB,MAAM;AAAA,IAChC,KAAK;AACH,aAAO,kBAAkB,MAAM;AAAA,IACjC,KAAK;AAAA,IACL;AACE,aAAO,iBAAiB,MAAM;AAAA,EAClC;AACF;;;AJCA,IAAM,gBAAgB,CAAC,SAAS,SAAS;AACzC,IAAM,gBAAgB,CAAC,QAAQ,QAAQ,OAAO;AAG9C,SAAS,eAAe,QAAkC;AACxD,MAAI,UAAU,CAAC,cAAc,SAAS,MAAM,GAAG;AAC7C,YAAQ,MAAMC,OAAM,IAAI,mCAAmC,MAAM,wCAAwC,CAAC;AAC1G,YAAQ,KAAK,CAAC;AAAA,EAChB;AACF;AAGA,SAAS,eAAe,QAAsB;AAC5C,MAAI,CAAC,cAAc,SAAS,MAAM,GAAG;AACnC,YAAQ,MAAMA,OAAM,IAAI,kCAAkC,MAAM,sCAAsC,CAAC;AACvG,YAAQ,KAAK,CAAC;AAAA,EAChB;AACF;AAGA,SAAS,mBAAmB,OAA6B,SAAuB;AAC9E,MAAI,CAAC,SAAS,MAAM,WAAW,EAAG;AAElC,QAAM,eAAe,MAAM,OAAO,UAAQ;AACxC,UAAM,WAAWC,OAAK,WAAW,IAAI,IAAI,OAAOA,OAAK,KAAK,SAAS,IAAI;AACvE,WAAO,CAACC,KAAG,WAAW,QAAQ;AAAA,EAChC,CAAC;AAED,MAAI,aAAa,SAAS,GAAG;AAC3B,YAAQ,MAAMF,OAAM,IAAI,cAAc,aAAa,SAAS,IAAI,MAAM,EAAE,aAAa,CAAC;AACtF,iBAAa,QAAQ,UAAQ,QAAQ,MAAMA,OAAM,IAAI,OAAO,IAAI,EAAE,CAAC,CAAC;AACpE,YAAQ,KAAK,CAAC;AAAA,EAChB;AACF;AAGA,SAAS,oBAAoB,OAA2B,UAAiC;AACvF,MAAI,CAAC,MAAO,QAAO;AAEnB,QAAM,SAAS,SAAS,OAAO,EAAE;AACjC,MAAI,MAAM,MAAM,GAAG;AACjB,YAAQ,MAAMA,OAAM,IAAI,kBAAkB,QAAQ,WAAW,KAAK,qBAAqB,CAAC;AACxF,YAAQ,KAAK,CAAC;AAAA,EAChB;AACA,MAAI,UAAU,GAAG;AACf,YAAQ,MAAMA,OAAM,IAAI,kBAAkB,QAAQ,WAAW,KAAK,8BAA8B,CAAC;AACjG,YAAQ,KAAK,CAAC;AAAA,EAChB;AACA,SAAO;AACT;AAGA,SAAS,wBAAwB,SAAgD;AAC/E,QAAM,gBAAgB,oBAAoB,QAAQ,WAAW,aAAa;AAC1E,QAAM,qBAAqB,oBAAoB,QAAQ,qBAAqB,wBAAwB;AACpG,QAAM,oBAAoB,oBAAoB,QAAQ,oBAAoB,uBAAuB;AAEjG,SAAO;AAAA;AAAA,IAEL,YAAY,sBAAsB;AAAA,IAClC,WAAW,qBAAqB;AAAA,EAClC;AACF;AAGA,SAAS,wBAAwB,QAAuC,WAAqC;AAC3G,MAAI,UAAU,eAAe,QAAQ,UAAU,cAAc,KAAM;AAGnE,QAAM,MAAM;AAGZ,MAAI,CAAC,IAAI,YAAY;AACnB,QAAI,aAAa;AAAA,MACf,SAAS;AAAA,MACT,YAAY,EAAE,WAAW,IAAI,YAAY,GAAG;AAAA,IAC9C;AAAA,EACF,WAAW,CAAC,IAAI,WAAW,YAAY;AACrC,QAAI,WAAW,aAAa,EAAE,WAAW,IAAI,YAAY,GAAG;AAAA,EAC9D;AAGA,MAAI,UAAU,eAAe,MAAM;AACjC,QAAI,WAAW,WAAW,YAAY,UAAU;AAAA,EAClD;AACA,MAAI,UAAU,cAAc,MAAM;AAChC,QAAI,WAAW,WAAW,aAAa,UAAU;AAAA,EACnD;AACF;AAGA,eAAe,kBAAkB,UAAmC;AAClE,MAAI;AACF,UAAM,SAAS,eAAe,EAAE,OAAO,EAAE,CAAC;AAAA,EAC5C,QAAQ;AACN,YAAQ,MAAMA,OAAM,IAAI,wBAAwB,CAAC;AACjD,YAAQ,IAAIA,OAAM,OAAO,OAAO,GAAGA,OAAM,KAAK,YAAY,GAAGA,OAAM,OAAO,8BAA8B,CAAC;AACzG,YAAQ,KAAK,CAAC;AAAA,EAChB;AACF;AAKA,eAAsB,kBAAkB,SAA4B;AAClE,QAAM,UAAU,QAAQ,IAAI;AAE5B,MAAI;AAEF,mBAAe,QAAQ,MAAM;AAC7B,mBAAe,QAAQ,MAAM;AAC7B,uBAAmB,QAAQ,OAAO,OAAO;AACzC,UAAM,qBAAqB,wBAAwB,OAAO;AAG1D,UAAM,SAAS,MAAM,cAAc,KAAK,OAAO;AAC/C,UAAM,WAAW,IAAI,SAAS,OAAO;AACrC,UAAM,SAAS,WAAW;AAC1B,UAAM,kBAAkB,QAAQ;AAGhC,4BAAwB,QAAQ,kBAAkB;AAGlD,UAAM,WAAW,IAAI,mBAAmB,UAAU,MAAM;AACxD,UAAM,SAAS,MAAM,SAAS,QAAQ,QAAQ,KAAK;AACnD,YAAQ,IAAI,aAAa,QAAQ,QAAQ,MAAM,CAAC;AAGhD,QAAI,QAAQ,QAAQ;AAClB,YAAM,gBAAgB,QAAQ,WAAW,UACrC,OAAO,QAAQ,WAAW,QAAQ,IAClC,OAAO,QAAQ,kBAAkB;AACrC,UAAI,cAAe,SAAQ,KAAK,CAAC;AAAA,IACnC;AAAA,EACF,SAAS,OAAO;AACd,YAAQ,MAAMA,OAAM,IAAI,6BAA6B,GAAG,KAAK;AAC7D,YAAQ,KAAK,CAAC;AAAA,EAChB;AACF;;;AxCxJA,IAAMG,cAAaC,eAAc,YAAY,GAAG;AAChD,IAAMC,aAAYC,SAAQH,WAAU;AACpC,IAAMI,WAAUC,eAAc,YAAY,GAAG;AAE7C,IAAIC;AACJ,IAAI;AACF,EAAAA,eAAcF,SAAQG,MAAKL,YAAW,iBAAiB,CAAC;AAC1D,QAAQ;AACN,EAAAI,eAAcF,SAAQG,MAAKL,YAAW,oBAAoB,CAAC;AAC7D;AAEO,IAAM,UAAU,IAAI,QAAQ;AAEnC,QACG,KAAK,MAAM,EACX,YAAY,sDAAsD,EAClE,QAAQI,aAAY,OAAO;AAE9B,QACG,QAAQ,MAAM,EACd,YAAY,0CAA0C,EACtD,OAAO,iBAAiB,0CAA0C,EAClE,OAAO,aAAa,2CAA2C,EAC/D,OAAO,qBAAqB,oDAAoD,EAChF,OAAO,WAAW;AAErB,QACG,QAAQ,OAAO,EACf,YAAY,wCAAwC,EACpD,OAAO,eAAe,uCAAuC,EAC7D,OAAO,eAAe,8CAA8C,EACpE,OAAO,iBAAiB,uCAAuC,EAC/D,OAAO,YAAY;AAEtB,QACG,QAAQ,OAAO,EACf,YAAY,6CAA6C,EACzD,OAAO,qBAAqB,gCAAgC,MAAM,EAClE,OAAO,cAAc,wCAAwC,EAC7D,OAAO,eAAe,sDAAsD,EAC5E,OAAO,qBAAqB,yDAAyD,EACrF,OAAO,YAAY;AAEtB,QACG,QAAQ,QAAQ,EAChB,YAAY,qCAAqC,EACjD,OAAO,aAAa;AAEvB,QACG,QAAQ,YAAY,EACpB,YAAY,yBAAyB,EACrC,OAAO,sBAAsB,2BAA2B,EACxD,OAAO,mBAAmB,oCAAoC,MAAM,EACpE,OAAO,mBAAmB,8DAA8D,EACxF,OAAO,8BAA8B,+CAA+C,EACpF,OAAO,6BAA6B,8CAA8C,EAClF,OAAO,wBAAwB,sCAAsC,EACrE,OAAO,iBAAiB;;;A6ClE3B,QAAQ,MAAM;","names":["require","fs","path","fs","path","fs","path","init_version","fs","path","e","detectLanguage","search","detectLanguage","init_chunker","init_types","path","init_types","buildLegacySymbols","fs","path","init_version","path","os","crypto","init_version","fs","path","fs","path","fs","path","manifest","init_chunker","fs","path","fs","chalk","isGitAvailable","isGitRepo","GitStateTracker","init_chunker","init_version","createRequire","fileURLToPath","dirname","join","fs","path","fileURLToPath","chalk","createRequire","fileURLToPath","dirname","join","__filename","__dirname","require","packageJson","fs","path","chalk","fs","path","fs","path","path","packageJson","fs","fs","path","path","fs","tools","fs","path","path","fs","fs","path","path","fs","path","fs","__filename","fileURLToPath","__dirname","path","fs","chalk","init_version","chalk","fs","path","path","chalk","fs","chalk","VectorDB","ManifestManager","chalk","chalk","fs","path","createRequire","fileURLToPath","dirname","join","z","z","z","z","z","path","isTestFile","path","chunkFile","isTestFile","SCAN_LIMIT","path","isTestFile","RISK_ORDER","DEPENDENT_COUNT_THRESHOLDS","COMPLEXITY_THRESHOLDS","path","buildImportIndex","findDependentChunks","calculateFileComplexities","calculateOverallComplexityMetrics","calculateComplexityRiskBoost","isTestFile","RISK_ORDER","chunkFile","RISK_ORDER","path","__filename","fileURLToPath","__dirname","dirname","require","createRequire","packageJson","join","indexCodebase","path","fs","chalk","chalk","fs","path","chalk","chalk","path","fs","__filename","fileURLToPath","__dirname","dirname","require","createRequire","packageJson","join"]}