kirograph 0.23.0 → 0.26.0
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +19 -5
- package/dist/bin/commands/configure-mcp.js +104 -0
- package/dist/bin/commands/configure-mcp.js.map +7 -0
- package/dist/bin/commands/memory.js +334 -2
- package/dist/bin/commands/memory.js.map +2 -2
- package/dist/bin/commands/wiki.js +307 -0
- package/dist/bin/commands/wiki.js.map +7 -0
- package/dist/bin/installer/common.js +9 -0
- package/dist/bin/installer/common.js.map +2 -2
- package/dist/bin/installer/config-prompt.js +96 -5
- package/dist/bin/installer/config-prompt.js.map +2 -2
- package/dist/bin/installer/hooks.js +40 -0
- package/dist/bin/installer/hooks.js.map +2 -2
- package/dist/bin/installer/index.js +22 -11
- package/dist/bin/installer/index.js.map +2 -2
- package/dist/bin/installer/instructions.js +27 -1
- package/dist/bin/installer/instructions.js.map +2 -2
- package/dist/bin/installer/mcp.js +37 -4
- package/dist/bin/installer/mcp.js.map +2 -2
- package/dist/bin/installer/prompts.js +3 -3
- package/dist/bin/installer/prompts.js.map +2 -2
- package/dist/bin/installer/steering.js +633 -291
- package/dist/bin/installer/steering.js.map +2 -2
- package/dist/bin/installer/targets/index.js.map +1 -1
- package/dist/bin/installer/targets/kiro.js +5 -4
- package/dist/bin/installer/targets/kiro.js.map +2 -2
- package/dist/bin/kirograph.js +3 -1
- package/dist/bin/kirograph.js.map +3 -3
- package/dist/config.js +52 -5
- package/dist/config.js.map +2 -2
- package/dist/db/database.js +11 -0
- package/dist/db/database.js.map +2 -2
- package/dist/db/memory-schema.sql +34 -1
- package/dist/db/wiki-schema.sql +40 -0
- package/dist/mcp/server.js +35 -11
- package/dist/mcp/server.js.map +2 -2
- package/dist/mcp/tool-names.js +112 -1
- package/dist/mcp/tool-names.js.map +2 -2
- package/dist/mcp/tools.js +458 -3
- package/dist/mcp/tools.js.map +2 -2
- package/dist/memory/database.js +131 -7
- package/dist/memory/database.js.map +2 -2
- package/dist/memory/index.js +130 -4
- package/dist/memory/index.js.map +3 -3
- package/dist/memory/types.js.map +1 -1
- package/dist/watchmen/synthesize.js +2 -0
- package/dist/watchmen/synthesize.js.map +2 -2
- package/dist/wiki/database.js +143 -0
- package/dist/wiki/database.js.map +7 -0
- package/dist/wiki/index.js +149 -0
- package/dist/wiki/index.js.map +7 -0
- package/dist/wiki/ingest.js +259 -0
- package/dist/wiki/ingest.js.map +7 -0
- package/dist/wiki/lint.js +93 -0
- package/dist/wiki/lint.js.map +7 -0
- package/dist/wiki/schema.js +148 -0
- package/dist/wiki/schema.js.map +7 -0
- package/dist/wiki/synthesize.js +104 -0
- package/dist/wiki/synthesize.js.map +7 -0
- package/dist/wiki/types.js +17 -0
- package/dist/wiki/types.js.map +7 -0
- package/package.json +5 -3
package/dist/db/database.js.map
CHANGED
|
@@ -1,7 +1,7 @@
|
|
|
1
1
|
{
|
|
2
2
|
"version": 3,
|
|
3
3
|
"sources": ["../../src/db/database.ts"],
|
|
4
|
-
"sourcesContent": ["/**\n * KiroGraph Database Layer\n * Wraps node-sqlite3-wasm for portability (no native bindings needed).\n */\n\nimport * as path from 'path';\nimport * as fs from 'fs';\nimport type { Node, Edge, FileRecord, NodeKind, Language, GraphStats, NodeContext, NodeMetrics, SearchOptions } from '../types';\nimport type { ArchPackage, ArchLayer, ArchPackageDep, ArchLayerDep, ArchCoupling } from '../architecture/types';\n\n// eslint-disable-next-line @typescript-eslint/no-require-imports\nconst { Database } = require('node-sqlite3-wasm');\n\nconst CURRENT_SCHEMA_VERSION = 1;\n\nexport class GraphDatabase {\n private db: any;\n private projectRoot: string;\n\n constructor(projectRoot: string) {\n this.projectRoot = projectRoot;\n const dbDir = path.join(projectRoot, '.kirograph');\n fs.mkdirSync(dbDir, { recursive: true });\n const dbPath = path.join(dbDir, 'kirograph.db');\n\n // \u2500\u2500 Pre-flight lock check \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\n // node-sqlite3-wasm calls process.abort() when the DB is locked, producing\n // a cryptic \"Aborted()\" with no context. Detect the lock file early and\n // throw a clean error instead so the global handler can surface it clearly.\n const lockPath = path.join(dbDir, 'kirograph.db.lock');\n if (fs.existsSync(lockPath)) {\n throw new Error(\n `Database is locked by another process (${lockPath} exists).\\n` +\n `Run: kirograph unlock\\n` +\n `Or delete the lock manually: ${lockPath}`\n );\n }\n\n this.db = new Database(dbPath);\n this.db.exec(`\n PRAGMA journal_mode=WAL;\n PRAGMA foreign_keys=ON;\n PRAGMA busy_timeout=120000;\n PRAGMA synchronous=NORMAL;\n PRAGMA cache_size=-64000;\n PRAGMA temp_store=MEMORY;\n PRAGMA mmap_size=268435456;\n `);\n this.applySchema();\n }\n\n private applySchema(): void {\n const schemaPath = path.join(__dirname, '../db/schema.sql');\n const sql = fs.readFileSync(schemaPath, 'utf8');\n this.db.exec(sql);\n this.runMigrations();\n }\n\n /**\n * Apply memory schema tables. Called when enableMemory is true.\n * Safe to call multiple times (CREATE IF NOT EXISTS).\n */\n applyMemorySchema(): void {\n const schemaPath = path.join(__dirname, '../db/memory-schema.sql');\n if (fs.existsSync(schemaPath)) {\n const sql = fs.readFileSync(schemaPath, 'utf8');\n this.db.exec(sql);\n }\n }\n\n /**\n * Apply docs schema tables. Called when enableDocs is true.\n * Safe to call multiple times (CREATE IF NOT EXISTS).\n */\n applyDocsSchema(): void {\n const schemaPath = path.join(__dirname, '../db/docs-schema.sql');\n if (fs.existsSync(schemaPath)) {\n const sql = fs.readFileSync(schemaPath, 'utf8');\n this.db.exec(sql);\n }\n }\n\n /**\n * Apply data schema tables. Called when enableData is true.\n * Safe to call multiple times (CREATE IF NOT EXISTS).\n */\n applyDataSchema(): void {\n const schemaPath = path.join(__dirname, '../db/data-schema.sql');\n if (fs.existsSync(schemaPath)) {\n const sql = fs.readFileSync(schemaPath, 'utf8');\n this.db.exec(sql);\n }\n // Migrate existing DBs: add columns introduced after initial release.\n const tryAlter = (stmt: string) => { try { this.db.run(stmt); } catch { /* already exists */ } };\n tryAlter('ALTER TABLE data_datasets ADD COLUMN metadata_json TEXT');\n }\n\n /**\n * Apply patterns schema tables. Called when enablePatterns is true.\n * Safe to call multiple times (CREATE IF NOT EXISTS).\n */\n applyPatternsSchema(): void {\n const schemaPath = path.join(__dirname, '../db/patterns-schema.sql');\n if (fs.existsSync(schemaPath)) {\n const sql = fs.readFileSync(schemaPath, 'utf8');\n this.db.exec(sql);\n }\n // Migrate existing DBs: add new columns introduced after initial release.\n const tryAlter = (stmt: string) => { try { this.db.run(stmt); } catch { /* already exists */ } };\n tryAlter('ALTER TABLE pattern_matches ADD COLUMN symbol_node_id TEXT');\n tryAlter('CREATE INDEX IF NOT EXISTS idx_pm_symbol ON pattern_matches(symbol_node_id)');\n }\n\n /**\n * Apply security schema tables. Called when enableSecurity is true.\n * Safe to call multiple times (CREATE IF NOT EXISTS).\n */\n applySecuritySchema(): void {\n const schemaPath = path.join(__dirname, '../db/security-schema.sql');\n if (fs.existsSync(schemaPath)) {\n const sql = fs.readFileSync(schemaPath, 'utf8');\n this.db.exec(sql);\n }\n // Migrate existing DBs: add new columns introduced after initial release.\n const tryAlter = (stmt: string) => { try { this.db.run(stmt); } catch { /* already exists */ } };\n tryAlter('ALTER TABLE sec_dependencies ADD COLUMN license TEXT');\n tryAlter('ALTER TABLE sec_dependencies ADD COLUMN latest_version TEXT');\n tryAlter('ALTER TABLE sec_dependencies ADD COLUMN latest_published INTEGER');\n tryAlter('ALTER TABLE sec_dependencies ADD COLUMN staleness_score REAL');\n tryAlter('ALTER TABLE sec_vulnerabilities ADD COLUMN epss_score REAL');\n tryAlter('ALTER TABLE sec_vulnerabilities ADD COLUMN epss_percentile REAL');\n tryAlter('ALTER TABLE sec_vulnerabilities ADD COLUMN epss_fetched_at INTEGER');\n tryAlter('CREATE INDEX IF NOT EXISTS idx_sec_deps_license ON sec_dependencies(license)');\n tryAlter('CREATE INDEX IF NOT EXISTS idx_sec_deps_staleness ON sec_dependencies(staleness_score)');\n tryAlter('CREATE INDEX IF NOT EXISTS idx_sec_vulns_epss ON sec_vulnerabilities(epss_score)');\n tryAlter('ALTER TABLE sec_vulnerabilities ADD COLUMN risk_score REAL');\n tryAlter('CREATE INDEX IF NOT EXISTS idx_sec_vulns_risk ON sec_vulnerabilities(risk_score)');\n tryAlter('ALTER TABLE sec_vulnerabilities ADD COLUMN first_detected_at INTEGER');\n tryAlter('ALTER TABLE sec_vulnerabilities ADD COLUMN fix_available_since INTEGER');\n tryAlter('ALTER TABLE sec_vulnerabilities ADD COLUMN suppressed_at INTEGER');\n tryAlter('ALTER TABLE sec_vulnerabilities ADD COLUMN remediated_at INTEGER');\n }\n\n /**\n * Get the raw database handle (for MemoryDatabase).\n */\n getRawDb(): any {\n return this.db;\n }\n\n private runMigrations(): void {\n // Record initial schema version if not present\n const versionRow = this.db.get('SELECT version FROM schema_versions ORDER BY version DESC LIMIT 1');\n const currentVersion = versionRow ? versionRow.version : 0;\n\n if (currentVersion < CURRENT_SCHEMA_VERSION) {\n // Migration 1: schema.sql now includes all columns \u2014 nothing extra needed.\n // The schema CREATE IF NOT EXISTS statements handle initial setup.\n this.db.run('INSERT OR IGNORE INTO schema_versions (version, applied_at) VALUES (?, ?)',\n [CURRENT_SCHEMA_VERSION, Date.now()]);\n }\n\n // Add attempted_strategies column to unresolved_refs if not present.\n // SQLite throws if the column already exists, so we catch that error.\n try {\n this.db.run('ALTER TABLE unresolved_refs ADD COLUMN attempted_strategies TEXT');\n } catch {\n // Column already exists \u2014 nothing to do.\n }\n\n // Add confidence columns to edges if not present.\n try {\n this.db.run(\"ALTER TABLE edges ADD COLUMN confidence TEXT NOT NULL DEFAULT 'extracted'\");\n } catch {\n // Column already exists \u2014 nothing to do.\n }\n try {\n this.db.run('ALTER TABLE edges ADD COLUMN confidence_score REAL NOT NULL DEFAULT 1.0');\n } catch {\n // Column already exists \u2014 nothing to do.\n }\n }\n\n // \u2500\u2500 Files \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\n\n upsertFile(record: FileRecord): void {\n this.db.run(\n `INSERT OR REPLACE INTO files (path, content_hash, language, file_size, symbol_count, indexed_at)\n VALUES (?, ?, ?, ?, ?, ?)`,\n [record.path, record.contentHash, record.language, record.fileSize, record.symbolCount, record.indexedAt]\n );\n }\n\n getFile(filePath: string): FileRecord | null {\n const row = this.db.get('SELECT * FROM files WHERE path = ?', [filePath]);\n return row ? this.rowToFile(row) : null;\n }\n\n getAllFiles(): FileRecord[] {\n return this.db.all('SELECT * FROM files').map(this.rowToFile);\n }\n\n deleteFile(filePath: string): void {\n // Cascade deletes nodes (and their edges via FK)\n this.db.run('DELETE FROM nodes WHERE file_path = ?', [filePath]);\n this.db.run('DELETE FROM files WHERE path = ?', [filePath]);\n }\n\n private rowToFile(row: any): FileRecord {\n return {\n path: row.path,\n contentHash: row.content_hash,\n language: row.language as Language,\n fileSize: row.file_size,\n symbolCount: row.symbol_count,\n indexedAt: row.indexed_at,\n };\n }\n\n // \u2500\u2500 Nodes \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\n\n upsertNode(node: Node): void {\n this.db.run(\n `INSERT OR REPLACE INTO nodes\n (id, kind, name, qualified_name, file_path, language,\n start_line, end_line, start_column, end_column,\n docstring, signature, visibility,\n is_exported, is_async, is_static, is_abstract,\n decorators, type_parameters, updated_at)\n VALUES (?,?,?,?,?,?,?,?,?,?,?,?,?,?,?,?,?,?,?,?)`,\n [\n node.id, node.kind, node.name, node.qualifiedName, node.filePath, node.language,\n node.startLine, node.endLine, node.startColumn, node.endColumn,\n node.docstring ?? null, node.signature ?? null, node.visibility ?? null,\n node.isExported ? 1 : 0, node.isAsync ? 1 : 0,\n node.isStatic ? 1 : 0, node.isAbstract ? 1 : 0,\n node.decorators ? JSON.stringify(node.decorators) : null,\n node.typeParameters ? JSON.stringify(node.typeParameters) : null,\n node.updatedAt,\n ]\n );\n // Keep FTS in sync\n this.db.run(\n `INSERT OR REPLACE INTO nodes_fts (id, name, qualified_name, docstring, signature)\n VALUES (?, ?, ?, ?, ?)`,\n [node.id, node.name, node.qualifiedName, node.docstring ?? '', node.signature ?? '']\n );\n }\n\n getNode(id: string): Node | null {\n const row = this.db.get('SELECT * FROM nodes WHERE id = ?', [id]);\n return row ? this.rowToNode(row) : null;\n }\n\n getNodesByFile(filePath: string): Node[] {\n return this.db.all('SELECT * FROM nodes WHERE file_path = ?', [filePath]).map(this.rowToNode);\n }\n\n getNodesByKind(kind: Node['kind']): Node[] {\n return this.db.all('SELECT * FROM nodes WHERE kind = ?', [kind]).map(this.rowToNode);\n }\n\n findNodesByExactName(name: string, kinds?: NodeKind[], limit = 20): Node[] {\n if (kinds && kinds.length > 0) {\n const placeholders = kinds.map(() => '?').join(',');\n return this.db.all(\n `SELECT * FROM nodes WHERE name = ? AND kind IN (${placeholders}) LIMIT ?`,\n [name, ...kinds, limit]\n ).map(this.rowToNode);\n }\n return this.db.all(\n 'SELECT * FROM nodes WHERE name = ? LIMIT ?',\n [name, limit]\n ).map(this.rowToNode);\n }\n\n searchNodes(query: string, opts: SearchOptions = {}): Node[] {\n const { kinds, languages, limit = 20 } = opts;\n // Sanitize for FTS5: strip special chars and append wildcard.\n // Both the MATCH value and LIMIT are inlined (not bound via ?) because\n // node-sqlite3-wasm passes bound parameters through to FTS5's own query\n // parser before SQLite substitutes them, causing \"syntax error near ?\".\n const safe = query\n .replace(/\\b(AND|OR|NOT)\\b/g, ' ') // FTS5 boolean operators\n .replace(/['\"*()?\\-+^~:{}\\\\\\.\\/,]/g, ' ') // FTS5 special chars (incl. / and ,)\n .replace(/\\s+/g, ' ')\n .trim();\n if (!safe) return [];\n\n const ftsQuery = safe + '*';\n const safeLimit = Math.max(1, Math.floor(Number(limit)));\n\n const conditions: string[] = [];\n const params: any[] = [];\n\n if (kinds && kinds.length > 0) {\n conditions.push(`kind IN (${kinds.map(() => '?').join(',')})`);\n params.push(...kinds);\n }\n if (languages && languages.length > 0) {\n conditions.push(`language IN (${languages.map(() => '?').join(',')})`);\n params.push(...languages);\n }\n\n const where = conditions.length > 0 ? `AND ${conditions.join(' AND ')}` : '';\n\n return this.db.all(\n `SELECT * FROM nodes\n WHERE id IN (SELECT rowid FROM nodes_fts WHERE nodes_fts MATCH '${ftsQuery}')\n ${where}\n LIMIT ${safeLimit}`,\n params\n ).map(this.rowToNode);\n }\n\n searchNodesByName(name: string, opts: SearchOptions = {}): Node[] {\n const { kinds, languages, limit = 20 } = opts;\n const pattern = `%${name}%`;\n const conditions: string[] = ['name LIKE ?'];\n const params: any[] = [pattern];\n\n if (kinds && kinds.length > 0) {\n conditions.push(`kind IN (${kinds.map(() => '?').join(',')})`);\n params.push(...kinds);\n }\n if (languages && languages.length > 0) {\n conditions.push(`language IN (${languages.map(() => '?').join(',')})`);\n params.push(...languages);\n }\n params.push(limit);\n\n return this.db.all(\n `SELECT * FROM nodes WHERE ${conditions.join(' AND ')} LIMIT ?`,\n params\n ).map(this.rowToNode);\n }\n\n deleteNodesByFile(filePath: string): void {\n const ids = this.db.all('SELECT id FROM nodes WHERE file_path = ?', [filePath]).map((r: any) => r.id);\n if (ids.length === 0) return;\n const placeholders = ids.map(() => '?').join(',');\n this.db.run(`DELETE FROM edges WHERE source IN (${placeholders}) OR target IN (${placeholders})`, [...ids, ...ids]);\n this.db.run(`DELETE FROM nodes_fts WHERE id IN (${placeholders})`, ids);\n this.db.run(`DELETE FROM nodes WHERE file_path = ?`, [filePath]);\n }\n\n private rowToNode(row: any): Node {\n return {\n id: row.id,\n kind: row.kind as NodeKind,\n name: row.name,\n qualifiedName: row.qualified_name,\n filePath: row.file_path,\n language: row.language as Language,\n startLine: row.start_line,\n endLine: row.end_line,\n startColumn: row.start_column,\n endColumn: row.end_column,\n docstring: row.docstring ?? undefined,\n signature: row.signature ?? undefined,\n visibility: row.visibility ?? undefined,\n isExported: row.is_exported === 1,\n isAsync: row.is_async === 1,\n isStatic: row.is_static === 1,\n isAbstract: row.is_abstract === 1,\n decorators: row.decorators ? JSON.parse(row.decorators) : undefined,\n typeParameters: row.type_parameters ? JSON.parse(row.type_parameters) : undefined,\n updatedAt: row.updated_at,\n };\n }\n\n // \u2500\u2500 Edges \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\n\n insertEdge(edge: Edge): void {\n this.db.run(\n `INSERT OR IGNORE INTO edges (source, target, kind, metadata, line, column, confidence, confidence_score)\n VALUES (?, ?, ?, ?, ?, ?, ?, ?)`,\n [edge.source, edge.target, edge.kind, edge.metadata ? JSON.stringify(edge.metadata) : null, edge.line ?? null, edge.column ?? null, edge.confidence ?? 'extracted', edge.confidenceScore ?? 1.0]\n );\n }\n\n getCallers(nodeId: string, limit = 30): Node[] {\n return this.db.all(\n `SELECT n.* FROM nodes n\n JOIN edges e ON e.source = n.id\n WHERE e.target = ? AND e.kind = 'calls'\n LIMIT ?`,\n [nodeId, limit]\n ).map(this.rowToNode);\n }\n\n getCallees(nodeId: string, limit = 30): Node[] {\n return this.db.all(\n `SELECT n.* FROM nodes n\n JOIN edges e ON e.target = n.id\n WHERE e.source = ? AND e.kind = 'calls'\n LIMIT ?`,\n [nodeId, limit]\n ).map(this.rowToNode);\n }\n\n getImpactRadius(nodeId: string, depth = 2): Node[] {\n // BFS over 'calls' and 'imports' edges (dependents)\n const visited = new Set<string>([nodeId]);\n let frontier = [nodeId];\n for (let d = 0; d < depth; d++) {\n if (frontier.length === 0) break;\n const placeholders = frontier.map(() => '?').join(',');\n const rows = this.db.all(\n `SELECT DISTINCT source FROM edges WHERE target IN (${placeholders}) AND kind IN ('calls','imports')`,\n frontier\n );\n frontier = [];\n for (const row of rows) {\n if (!visited.has(row.source)) {\n visited.add(row.source);\n frontier.push(row.source);\n }\n }\n }\n visited.delete(nodeId);\n if (visited.size === 0) return [];\n const ids = [...visited];\n const placeholders = ids.map(() => '?').join(',');\n return this.db.all(`SELECT * FROM nodes WHERE id IN (${placeholders})`, ids).map(this.rowToNode);\n }\n\n getEdgesForNodes(nodeIds: string[]): Edge[] {\n if (nodeIds.length === 0) return [];\n const placeholders = nodeIds.map(() => '?').join(',');\n return this.db.all(\n `SELECT * FROM edges WHERE source IN (${placeholders}) OR target IN (${placeholders})`,\n [...nodeIds, ...nodeIds]\n ).map((row: any) => ({\n source: row.source,\n target: row.target,\n kind: row.kind,\n metadata: row.metadata ? JSON.parse(row.metadata) : undefined,\n line: row.line ?? undefined,\n column: row.column ?? undefined,\n }));\n }\n\n /**\n * Find files that import (depend on) the given file path.\n * Used for affected-test traversal.\n */\n getDependentFiles(filePath: string): string[] {\n // Find nodes in the target file\n const targetNodes = this.db.all('SELECT id FROM nodes WHERE file_path = ?', [filePath]);\n if (targetNodes.length === 0) return [];\n const ids = targetNodes.map((r: any) => r.id);\n const placeholders = ids.map(() => '?').join(',');\n // Find source nodes that call/import these target nodes\n const rows = this.db.all(\n `SELECT DISTINCT n.file_path FROM nodes n\n JOIN edges e ON e.source = n.id\n WHERE e.target IN (${placeholders}) AND e.kind IN ('calls','imports')\n AND n.file_path != ?`,\n [...ids, filePath]\n );\n return rows.map((r: any) => r.file_path);\n }\n\n // \u2500\u2500 Unresolved References \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\n\n insertUnresolvedRef(sourceId: string, refName: string, refKind: string, filePath: string, line?: number, column?: number): void {\n this.db.run(\n `INSERT INTO unresolved_refs (source_id, ref_name, ref_kind, file_path, line, column)\n VALUES (?, ?, ?, ?, ?, ?)`,\n [sourceId, refName, refKind, filePath, line ?? null, column ?? null]\n );\n }\n\n deleteUnresolvedRefsByFile(filePath: string): void {\n this.db.run('DELETE FROM unresolved_refs WHERE file_path = ?', [filePath]);\n }\n\n /**\n * Resolve pending references:\n * - refKind='function': 3-strategy name matching \u2192 'calls' edge\n * - refKind='import': path-based resolution \u2192 'imports' edge\n *\n * Returns the number of edges successfully created.\n */\n resolveUnresolvedRefs(): number {\n const refs = this.db.all('SELECT * FROM unresolved_refs');\n let resolved = 0;\n\n for (const ref of refs) {\n const { id: refId, source_id: sourceId, ref_name: refName, ref_kind: refKind, file_path: filePath, line, column } = ref;\n\n if (refKind === 'function') {\n // Strategy 1: exact name match\n let target = this.db.get('SELECT id FROM nodes WHERE name = ? LIMIT 1', [refName]);\n let confidence: 'extracted' | 'inferred' | 'ambiguous' = 'inferred';\n let confidenceScore = 1.0;\n\n // Strategy 2: qualified name suffix\n if (!target) {\n target = this.db.get(\n `SELECT id FROM nodes WHERE qualified_name LIKE ? LIMIT 1`,\n [`%::${refName}`]\n );\n }\n\n // Strategy 3: case-insensitive\n if (!target) {\n target = this.db.get(\n 'SELECT id FROM nodes WHERE lower(name) = lower(?) LIMIT 1',\n [refName]\n );\n // Case-insensitive match is less certain\n if (target) confidenceScore = 0.8;\n }\n\n // Check if there are multiple candidates (ambiguous)\n if (target) {\n const candidateCount = this.db.get('SELECT COUNT(*) as cnt FROM nodes WHERE name = ?', [refName]);\n if (candidateCount && candidateCount.cnt > 1) {\n confidence = 'ambiguous';\n confidenceScore = 1.0 / candidateCount.cnt;\n }\n }\n\n if (target) {\n this.insertEdge({ source: sourceId, target: target.id, kind: 'calls', line: line ?? undefined, column: column ?? undefined, confidence, confidenceScore });\n this.db.run('DELETE FROM unresolved_refs WHERE id = ?', [refId]);\n resolved++;\n }\n } else if (refKind === 'import') {\n // Resolve import path to an indexed file\n const targetFileNode = this.resolveImportPath(refName, filePath);\n if (targetFileNode) {\n this.insertEdge({ source: sourceId, target: targetFileNode, kind: 'imports', line: line ?? undefined, column: column ?? undefined, confidence: 'inferred', confidenceScore: 1.0 });\n this.db.run('DELETE FROM unresolved_refs WHERE id = ?', [refId]);\n resolved++;\n }\n }\n }\n\n return resolved;\n }\n\n /** @deprecated Use resolveUnresolvedRefs() */\n resolveCallEdges(): number {\n return this.resolveUnresolvedRefs();\n }\n\n /**\n * Resolve a module import path to the ID of the first node in the target file.\n * Returns null if no indexed file matches.\n */\n private resolveImportPath(importPath: string, sourceFilePath: string): string | null {\n // Only resolve relative imports\n if (!importPath.startsWith('.')) return null;\n\n const sourceDir = sourceFilePath.replace(/[^/]+$/, '');\n // Normalize the relative path\n const segments = (sourceDir + importPath).split('/');\n const normalized: string[] = [];\n for (const seg of segments) {\n if (seg === '..') normalized.pop();\n else if (seg !== '.') normalized.push(seg);\n }\n const basePath = normalized.join('/');\n\n // Try exact match, then with common extensions\n const candidates = [\n basePath,\n basePath + '.ts',\n basePath + '.tsx',\n basePath + '.js',\n basePath + '.jsx',\n basePath + '/index.ts',\n basePath + '/index.tsx',\n basePath + '/index.js',\n ];\n\n for (const candidate of candidates) {\n const row = this.db.get('SELECT id FROM nodes WHERE file_path = ? LIMIT 1', [candidate]);\n if (row) return row.id;\n }\n\n return null;\n }\n\n // \u2500\u2500 Node Context & Metrics \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\n\n getNodeContext(nodeId: string): NodeContext | null {\n const node = this.getNode(nodeId);\n if (!node) return null;\n\n const ancestors = this.db.all(\n `SELECT n.* FROM nodes n\n JOIN edges e ON e.target = n.id\n WHERE e.source = ? AND e.kind = 'contains'`,\n [nodeId]\n ).map(this.rowToNode);\n\n const children = this.db.all(\n `SELECT n.* FROM nodes n\n JOIN edges e ON e.source = n.id\n WHERE e.target = n.id AND e.source = ? AND e.kind = 'contains'`,\n [nodeId]\n ).map(this.rowToNode);\n\n const callers = this.getCallers(nodeId, 20);\n const callees = this.getCallees(nodeId, 20);\n\n return { node, ancestors, children, callers, callees };\n }\n\n getNodeMetrics(nodeId: string): NodeMetrics {\n const incomingEdgeCount = (this.db.get('SELECT COUNT(*) as c FROM edges WHERE target = ?', [nodeId])?.c ?? 0);\n const outgoingEdgeCount = (this.db.get('SELECT COUNT(*) as c FROM edges WHERE source = ?', [nodeId])?.c ?? 0);\n const callCount = (this.db.get(`SELECT COUNT(*) as c FROM edges WHERE source = ? AND kind = 'calls'`, [nodeId])?.c ?? 0);\n const callerCount = (this.db.get(`SELECT COUNT(*) as c FROM edges WHERE target = ? AND kind = 'calls'`, [nodeId])?.c ?? 0);\n const childCount = (this.db.get(`SELECT COUNT(*) as c FROM edges WHERE source = ? AND kind = 'contains'`, [nodeId])?.c ?? 0);\n return { incomingEdgeCount, outgoingEdgeCount, callCount, callerCount, childCount };\n }\n\n // \u2500\u2500 Graph Analysis \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\n\n /**\n * Find symbols with no incoming edges (potential dead code).\n * Excludes exported symbols since they may be consumed externally.\n */\n findDeadCode(limit = 50): Node[] {\n return this.db.all(\n `SELECT * FROM nodes\n WHERE kind IN ('function','method','class')\n AND is_exported = 0\n AND id NOT IN (SELECT DISTINCT target FROM edges)\n LIMIT ?`,\n [limit]\n ).map(this.rowToNode);\n }\n\n /**\n * Find circular import dependencies using DFS over import edges.\n * Returns arrays of file paths forming cycles.\n */\n findCircularDependencies(): string[][] {\n // Build adjacency map: file \u2192 imported files\n const rows = this.db.all(\n `SELECT DISTINCT n1.file_path as src, n2.file_path as dst\n FROM edges e\n JOIN nodes n1 ON n1.id = e.source\n JOIN nodes n2 ON n2.id = e.target\n WHERE e.kind = 'imports' AND n1.file_path != n2.file_path`\n );\n\n const adj = new Map<string, Set<string>>();\n for (const row of rows) {\n if (!adj.has(row.src)) adj.set(row.src, new Set());\n adj.get(row.src)!.add(row.dst);\n }\n\n const cycles: string[][] = [];\n const visited = new Set<string>();\n const pathSet = new Set<string>();\n const pathArr: string[] = [];\n\n function dfs(node: string): void {\n if (pathSet.has(node)) {\n const cycleStart = pathArr.indexOf(node);\n cycles.push(pathArr.slice(cycleStart).concat(node));\n return;\n }\n if (visited.has(node)) return;\n visited.add(node);\n pathSet.add(node);\n pathArr.push(node);\n for (const neighbor of adj.get(node) ?? []) {\n dfs(neighbor);\n }\n pathArr.pop();\n pathSet.delete(node);\n }\n\n for (const node of adj.keys()) {\n if (!visited.has(node)) dfs(node);\n }\n\n return cycles;\n }\n\n /**\n * Find the shortest path between two nodes via directed BFS (outgoing edges only).\n */\n findPath(fromId: string, toId: string, maxDepth = 10): Node[] {\n if (fromId === toId) {\n const node = this.getNode(fromId);\n return node ? [node] : [];\n }\n\n const prev = new Map<string, string>();\n const queue: string[] = [fromId];\n const visited = new Set<string>([fromId]);\n let depth = 0;\n\n outer: while (queue.length > 0 && depth < maxDepth) {\n const levelSize = queue.length;\n depth++;\n for (let i = 0; i < levelSize; i++) {\n const current = queue.shift()!;\n // Directed: only follow outgoing edges\n const rows = this.db.all(\n `SELECT DISTINCT target as next FROM edges WHERE source = ?`,\n [current]\n );\n for (const row of rows) {\n if (!visited.has(row.next)) {\n visited.add(row.next);\n prev.set(row.next, current);\n if (row.next === toId) break outer;\n queue.push(row.next);\n }\n }\n }\n }\n\n if (!prev.has(toId)) return [];\n\n // Reconstruct path\n const pathIds: string[] = [];\n let cur: string | undefined = toId;\n while (cur !== undefined) {\n pathIds.unshift(cur);\n cur = prev.get(cur);\n }\n\n const result: Node[] = [];\n for (const id of pathIds) {\n const node = this.getNode(id);\n if (node) result.push(node);\n }\n return result;\n }\n\n /**\n * Traverse type hierarchy via 'extends' and 'implements' edges.\n * direction 'up' = base types, 'down' = derived types, 'both' = all.\n */\n getTypeHierarchy(nodeId: string, direction: 'up' | 'down' | 'both' = 'both'): Node[] {\n const visited = new Set<string>([nodeId]);\n const frontier = [nodeId];\n const result: Node[] = [];\n\n while (frontier.length > 0) {\n const current = frontier.shift()!;\n let rows: any[] = [];\n\n if (direction === 'up' || direction === 'both') {\n // current extends/implements something \u2192 go up\n const up = this.db.all(\n `SELECT target as id FROM edges WHERE source = ? AND kind IN ('extends','implements')`,\n [current]\n );\n rows = rows.concat(up);\n }\n if (direction === 'down' || direction === 'both') {\n // something extends/implements current \u2192 go down\n const down = this.db.all(\n `SELECT source as id FROM edges WHERE target = ? AND kind IN ('extends','implements')`,\n [current]\n );\n rows = rows.concat(down);\n }\n\n for (const row of rows) {\n if (!visited.has(row.id)) {\n visited.add(row.id);\n frontier.push(row.id);\n const node = this.getNode(row.id);\n if (node) result.push(node);\n }\n }\n }\n\n return result;\n }\n\n // \u2500\u2500 Stats \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\n\n getEmbeddingCount(): number {\n try {\n const row = this.db.get('SELECT COUNT(*) as c FROM vectors');\n return row ? row.c : 0;\n } catch {\n return 0;\n }\n }\n\n storeEmbedding(nodeId: string, embedding: Float32Array, model: string): void {\n const buf = Buffer.from(embedding.buffer);\n this.db.run(\n `INSERT OR REPLACE INTO vectors (node_id, embedding, model, created_at) VALUES (?, ?, ?, ?)`,\n [nodeId, buf, model, Date.now()]\n );\n }\n\n getEmbeddedNodeIds(): string[] {\n return this.db.all('SELECT node_id FROM vectors').map((r: any) => r.node_id);\n }\n\n getAllEmbeddings(): Array<{ nodeId: string; embedding: Float32Array }> {\n const rows = this.db.all('SELECT node_id, embedding FROM vectors');\n return rows.map((r: any) => ({\n nodeId: r.node_id as string,\n embedding: new Float32Array(\n (r.embedding as Buffer).buffer,\n (r.embedding as Buffer).byteOffset,\n (r.embedding as Buffer).byteLength / 4\n ),\n }));\n }\n\n getAllNodes(): import('../types').Node[] {\n return this.db.all('SELECT * FROM nodes').map(this.rowToNode);\n }\n\n /**\n * Returns embeddable nodes in pages for memory-efficient streaming.\n * `kinds` filters by node kind (e.g. ['function','method','class']).\n * Returns an empty array when offset >= total count.\n */\n getEmbeddableNodesPaged(kinds: string[], limit: number, offset: number): import('../types').Node[] {\n if (kinds.length === 0) return [];\n const placeholders = kinds.map(() => '?').join(',');\n return this.db.all(\n `SELECT * FROM nodes WHERE kind IN (${placeholders}) LIMIT ? OFFSET ?`,\n [...kinds, limit, offset]\n ).map(this.rowToNode);\n }\n\n /** Count of nodes whose kind is in the provided list. */\n countEmbeddableNodes(kinds: string[]): number {\n if (kinds.length === 0) return 0;\n const placeholders = kinds.map(() => '?').join(',');\n const row = this.db.get(`SELECT COUNT(*) as c FROM nodes WHERE kind IN (${placeholders})`, kinds);\n return row?.c ?? 0;\n }\n\n getAllEdges(): Edge[] {\n return this.db.all('SELECT source, target, kind FROM edges').map((row: any) => ({\n source: row.source,\n target: row.target,\n kind: row.kind,\n }));\n }\n\n /**\n * Find the top-N most-connected nodes by total edge degree (in + out).\n * Excludes 'contains' edges (structural nesting, not semantic connections).\n */\n findHotspots(limit = 20): Array<Node & { degree: number; inDegree: number; outDegree: number }> {\n const rows = this.db.all(\n `SELECT n.*,\n (SELECT COUNT(*) FROM edges WHERE target = n.id AND kind != 'contains') AS in_degree,\n (SELECT COUNT(*) FROM edges WHERE source = n.id AND kind != 'contains') AS out_degree,\n (SELECT COUNT(*) FROM edges WHERE (source = n.id OR target = n.id) AND kind != 'contains') AS degree\n FROM nodes n\n ORDER BY degree DESC\n LIMIT ?`,\n [limit]\n );\n return rows.map((row: any) => ({\n ...this.rowToNode(row),\n degree: row.degree as number,\n inDegree: row.in_degree as number,\n outDegree: row.out_degree as number,\n }));\n }\n\n /**\n * Find surprising cross-file connections: direct edges between nodes in\n * structurally distant files. Scored by path distance \u00D7 edge-kind weight.\n */\n findSurprisingConnections(limit = 20): Array<{ source: Node; target: Node; kind: string; score: number }> {\n const KIND_WEIGHT: Record<string, number> = {\n calls: 1.0, references: 0.8, type_of: 0.7, returns: 0.6,\n decorates: 0.6, extends: 0.5, implements: 0.5,\n };\n\n const rows: Array<{ source: string; target: string; kind: string; source_file: string; target_file: string }> =\n this.db.all(\n `SELECT e.source, e.target, e.kind,\n ns.file_path AS source_file, nt.file_path AS target_file\n FROM edges e\n JOIN nodes ns ON ns.id = e.source\n JOIN nodes nt ON nt.id = e.target\n WHERE ns.file_path != nt.file_path\n AND e.kind NOT IN ('contains', 'import', 'imports')\n LIMIT 5000`\n );\n\n // Score: path distance \u00D7 kind weight\n const scored = rows.map(row => {\n const srcDirs = row.source_file.split('/').slice(0, -1);\n const tgtDirs = row.target_file.split('/').slice(0, -1);\n let common = 0;\n for (let i = 0; i < Math.min(srcDirs.length, tgtDirs.length); i++) {\n if (srcDirs[i] === tgtDirs[i]) common++;\n else break;\n }\n const maxDirs = Math.max(srcDirs.length, tgtDirs.length, 1);\n const pathSimilarity = common / maxDirs;\n const kindWeight = KIND_WEIGHT[row.kind] ?? 0.4;\n return { ...row, score: (1 - pathSimilarity) * kindWeight };\n });\n\n // Sort desc, deduplicate by source+target+kind\n scored.sort((a, b) => b.score - a.score);\n const seen = new Set<string>();\n const top: typeof scored = [];\n for (const row of scored) {\n const key = `${row.source}|${row.target}|${row.kind}`;\n if (!seen.has(key)) {\n seen.add(key);\n top.push(row);\n if (top.length >= limit) break;\n }\n }\n\n const result: Array<{ source: Node; target: Node; kind: string; score: number }> = [];\n for (const row of top) {\n const src = this.getNode(row.source);\n const tgt = this.getNode(row.target);\n if (src && tgt) result.push({ source: src, target: tgt, kind: row.kind, score: row.score });\n }\n return result;\n }\n\n getStats(): GraphStats {\n const files = this.db.get('SELECT COUNT(*) as c FROM files').c;\n const nodes = this.db.get('SELECT COUNT(*) as c FROM nodes').c;\n const edges = this.db.get('SELECT COUNT(*) as c FROM edges').c;\n const kindRows = this.db.all('SELECT kind, COUNT(*) as c FROM nodes GROUP BY kind');\n const nodesByKind: Record<string, number> = {};\n for (const row of kindRows) nodesByKind[row.kind] = row.c;\n const langRows = this.db.all('SELECT language, COUNT(*) as c FROM files GROUP BY language');\n const filesByLanguage: Record<string, number> = {};\n for (const row of langRows) filesByLanguage[row.language] = row.c;\n const dbPath = path.join(this.projectRoot, '.kirograph', 'kirograph.db');\n let dbSizeBytes = 0;\n try { dbSizeBytes = fs.statSync(dbPath).size; } catch { /* ignore */ }\n const embeddingCount = this.getEmbeddingCount();\n return { files, nodes, edges, nodesByKind, filesByLanguage, dbSizeBytes, embeddingCount, embeddingsEnabled: false, embeddingModel: '', useVecIndex: false, semanticEngine: 'cosine' as const, vecIndexCount: 0, engineFallback: null, embeddableNodeCount: 0, frameworks: [], architectureEnabled: false };\n }\n\n // \u2500\u2500 Architecture \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\n\n clearArchitecture(): void {\n this.db.run('DELETE FROM arch_coupling');\n this.db.run('DELETE FROM arch_layer_deps');\n this.db.run('DELETE FROM arch_package_deps');\n this.db.run('DELETE FROM arch_file_layers');\n this.db.run('DELETE FROM arch_file_packages');\n this.db.run('DELETE FROM arch_layers');\n this.db.run('DELETE FROM arch_packages');\n }\n\n upsertArchPackage(pkg: ArchPackage): void {\n this.db.run(\n `INSERT OR REPLACE INTO arch_packages\n (id, name, path, source, language, manifest_path, version, external_deps, metadata, updated_at)\n VALUES (?,?,?,?,?,?,?,?,?,?)`,\n [\n pkg.id, pkg.name, pkg.path, pkg.source,\n pkg.language ?? null, pkg.manifestPath ?? null, pkg.version ?? null,\n pkg.externalDeps ? JSON.stringify(pkg.externalDeps) : null,\n pkg.metadata ? JSON.stringify(pkg.metadata) : null,\n pkg.updatedAt,\n ]\n );\n }\n\n upsertArchLayer(layer: ArchLayer): void {\n this.db.run(\n `INSERT OR REPLACE INTO arch_layers (id, name, source, patterns, metadata, updated_at)\n VALUES (?,?,?,?,?,?)`,\n [\n layer.id, layer.name, layer.source,\n JSON.stringify(layer.patterns),\n layer.metadata ? JSON.stringify(layer.metadata) : null,\n layer.updatedAt,\n ]\n );\n }\n\n upsertArchFilePackage(filePath: string, packageId: string): void {\n this.db.run(\n 'INSERT OR IGNORE INTO arch_file_packages (file_path, package_id) VALUES (?,?)',\n [filePath, packageId]\n );\n }\n\n upsertArchFileLayer(filePath: string, layerId: string, confidence: number, matchedPattern: string): void {\n this.db.run(\n `INSERT OR REPLACE INTO arch_file_layers (file_path, layer_id, confidence, matched_pattern)\n VALUES (?,?,?,?)`,\n [filePath, layerId, confidence, matchedPattern]\n );\n }\n\n upsertArchPackageDep(sourcePkg: string, targetPkg: string, depCount: number, files?: Array<{ from: string; to: string }>): void {\n this.db.run(\n `INSERT OR REPLACE INTO arch_package_deps (source_pkg, target_pkg, dep_count, files)\n VALUES (?,?,?,?)`,\n [sourcePkg, targetPkg, depCount, files ? JSON.stringify(files) : null]\n );\n }\n\n upsertArchLayerDep(sourceLayer: string, targetLayer: string, depCount: number): void {\n this.db.run(\n `INSERT OR REPLACE INTO arch_layer_deps (source_layer, target_layer, dep_count)\n VALUES (?,?,?)`,\n [sourceLayer, targetLayer, depCount]\n );\n }\n\n upsertArchCoupling(coupling: ArchCoupling): void {\n this.db.run(\n `INSERT OR REPLACE INTO arch_coupling (package_id, afferent, efferent, instability, updated_at)\n VALUES (?,?,?,?,?)`,\n [coupling.packageId, coupling.afferent, coupling.efferent, coupling.instability, coupling.updatedAt]\n );\n }\n\n getArchPackages(): ArchPackage[] {\n return this.db.all('SELECT * FROM arch_packages').map((r: any): ArchPackage => ({\n id: r.id,\n name: r.name,\n path: r.path,\n source: r.source,\n language: r.language ?? undefined,\n manifestPath: r.manifest_path ?? undefined,\n version: r.version ?? undefined,\n externalDeps: r.external_deps ? JSON.parse(r.external_deps) : undefined,\n metadata: r.metadata ? JSON.parse(r.metadata) : undefined,\n updatedAt: r.updated_at,\n }));\n }\n\n getArchLayers(): ArchLayer[] {\n return this.db.all('SELECT * FROM arch_layers').map((r: any): ArchLayer => ({\n id: r.id,\n name: r.name,\n source: r.source,\n patterns: JSON.parse(r.patterns),\n metadata: r.metadata ? JSON.parse(r.metadata) : undefined,\n updatedAt: r.updated_at,\n }));\n }\n\n getArchPackageDeps(): ArchPackageDep[] {\n return this.db.all('SELECT * FROM arch_package_deps').map((r: any): ArchPackageDep => ({\n sourcePkg: r.source_pkg,\n targetPkg: r.target_pkg,\n depCount: r.dep_count,\n files: r.files ? JSON.parse(r.files) : undefined,\n }));\n }\n\n getArchLayerDeps(): ArchLayerDep[] {\n return this.db.all('SELECT * FROM arch_layer_deps').map((r: any): ArchLayerDep => ({\n sourceLayer: r.source_layer,\n targetLayer: r.target_layer,\n depCount: r.dep_count,\n }));\n }\n\n getArchCoupling(): ArchCoupling[] {\n return this.db.all('SELECT * FROM arch_coupling').map((r: any): ArchCoupling => ({\n packageId: r.package_id,\n afferent: r.afferent,\n efferent: r.efferent,\n instability: r.instability,\n updatedAt: r.updated_at,\n }));\n }\n\n getArchStats(): { packages: number; layers: number; packageDeps: number } {\n return {\n packages: this.db.get('SELECT COUNT(*) as c FROM arch_packages')?.c ?? 0,\n layers: this.db.get('SELECT COUNT(*) as c FROM arch_layers')?.c ?? 0,\n packageDeps: this.db.get('SELECT COUNT(*) as c FROM arch_package_deps')?.c ?? 0,\n };\n }\n\n /**\n * Return file-to-file import relationships by joining edges + nodes.\n * Used by ArchitectureAnalyzer to roll up package-level dependencies.\n */\n getFileImportPairs(): Array<{ sourceFile: string; targetFile: string }> {\n return this.db.all(\n `SELECT DISTINCT n1.file_path as source_file, n2.file_path as target_file\n FROM edges e\n JOIN nodes n1 ON n1.id = e.source\n JOIN nodes n2 ON n2.id = e.target\n WHERE e.kind = 'imports' AND n1.file_path != n2.file_path`\n ).map((r: any) => ({ sourceFile: r.source_file, targetFile: r.target_file }));\n }\n\n getArchFilePackages(): Array<{ filePath: string; packageId: string }> {\n return this.db.all('SELECT file_path, package_id FROM arch_file_packages')\n .map((r: any) => ({ filePath: r.file_path, packageId: r.package_id }));\n }\n\n getArchFileLayers(): Array<{ filePath: string; layerId: string; confidence: number; matchedPattern: string }> {\n return this.db.all('SELECT file_path, layer_id, confidence, matched_pattern FROM arch_file_layers')\n .map((r: any) => ({\n filePath: r.file_path,\n layerId: r.layer_id,\n confidence: r.confidence,\n matchedPattern: r.matched_pattern,\n }));\n }\n\n getArchitectureResult(): {\n packages: ArchPackage[];\n layers: ArchLayer[];\n packageDeps: ArchPackageDep[];\n layerDeps: ArchLayerDep[];\n coupling: ArchCoupling[];\n } {\n return {\n packages: this.getArchPackages(),\n layers: this.getArchLayers(),\n packageDeps: this.getArchPackageDeps(),\n layerDeps: this.getArchLayerDeps(),\n coupling: this.getArchCoupling(),\n };\n }\n\n // \u2500\u2500 Transactions \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\n\n transaction<T>(fn: () => T): T {\n this.db.run('BEGIN');\n try {\n const result = fn();\n this.db.run('COMMIT');\n return result;\n } catch (err) {\n this.db.run('ROLLBACK');\n throw err;\n }\n }\n\n close(): void {\n this.db.close();\n }\n}\n"],
|
|
5
|
-
"mappings": ";;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAKA,WAAsB;AACtB,SAAoB;AAKpB,MAAM,EAAE,SAAS,IAAI,QAAQ,mBAAmB;AAEhD,MAAM,yBAAyB;AAExB,MAAM,cAAc;AAAA,EAIzB,YAAY,aAAqB;AAC/B,SAAK,cAAc;AACnB,UAAM,QAAQ,KAAK,KAAK,aAAa,YAAY;AACjD,OAAG,UAAU,OAAO,EAAE,WAAW,KAAK,CAAC;AACvC,UAAM,SAAS,KAAK,KAAK,OAAO,cAAc;AAM9C,UAAM,WAAW,KAAK,KAAK,OAAO,mBAAmB;AACrD,QAAI,GAAG,WAAW,QAAQ,GAAG;AAC3B,YAAM,IAAI;AAAA,QACR,0CAA0C,QAAQ;AAAA;AAAA,+BAElB,QAAQ;AAAA,MAC1C;AAAA,IACF;AAEA,SAAK,KAAK,IAAI,SAAS,MAAM;AAC7B,SAAK,GAAG,KAAK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,KAQZ;AACD,SAAK,YAAY;AAAA,EACnB;AAAA,EAEQ,cAAoB;AAC1B,UAAM,aAAa,KAAK,KAAK,WAAW,kBAAkB;AAC1D,UAAM,MAAM,GAAG,aAAa,YAAY,MAAM;AAC9C,SAAK,GAAG,KAAK,GAAG;AAChB,SAAK,cAAc;AAAA,EACrB;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,oBAA0B;AACxB,UAAM,aAAa,KAAK,KAAK,WAAW,yBAAyB;AACjE,QAAI,GAAG,WAAW,UAAU,GAAG;AAC7B,YAAM,MAAM,GAAG,aAAa,YAAY,MAAM;AAC9C,WAAK,GAAG,KAAK,GAAG;AAAA,IAClB;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,kBAAwB;AACtB,UAAM,aAAa,KAAK,KAAK,WAAW,uBAAuB;AAC/D,QAAI,GAAG,WAAW,UAAU,GAAG;AAC7B,YAAM,MAAM,GAAG,aAAa,YAAY,MAAM;AAC9C,WAAK,GAAG,KAAK,GAAG;AAAA,IAClB;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,kBAAwB;AACtB,UAAM,aAAa,KAAK,KAAK,WAAW,uBAAuB;AAC/D,QAAI,GAAG,WAAW,UAAU,GAAG;AAC7B,YAAM,MAAM,GAAG,aAAa,YAAY,MAAM;AAC9C,WAAK,GAAG,KAAK,GAAG;AAAA,IAClB;AAEA,UAAM,WAAW,CAAC,SAAiB;AAAE,UAAI;AAAE,aAAK,GAAG,IAAI,IAAI;AAAA,MAAG,QAAQ;AAAA,MAAuB;AAAA,IAAE;AAC/F,aAAS,yDAAyD;AAAA,EACpE;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,sBAA4B;AAC1B,UAAM,aAAa,KAAK,KAAK,WAAW,2BAA2B;AACnE,QAAI,GAAG,WAAW,UAAU,GAAG;AAC7B,YAAM,MAAM,GAAG,aAAa,YAAY,MAAM;AAC9C,WAAK,GAAG,KAAK,GAAG;AAAA,IAClB;AAEA,UAAM,WAAW,CAAC,SAAiB;AAAE,UAAI;AAAE,aAAK,GAAG,IAAI,IAAI;AAAA,MAAG,QAAQ;AAAA,MAAuB;AAAA,IAAE;AAC/F,aAAS,4DAA4D;AACrE,aAAS,6EAA6E;AAAA,EACxF;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,sBAA4B;AAC1B,UAAM,aAAa,KAAK,KAAK,WAAW,2BAA2B;AACnE,QAAI,GAAG,WAAW,UAAU,GAAG;AAC7B,YAAM,MAAM,GAAG,aAAa,YAAY,MAAM;AAC9C,WAAK,GAAG,KAAK,GAAG;AAAA,IAClB;AAEA,UAAM,WAAW,CAAC,SAAiB;AAAE,UAAI;AAAE,aAAK,GAAG,IAAI,IAAI;AAAA,MAAG,QAAQ;AAAA,MAAuB;AAAA,IAAE;AAC/F,aAAS,sDAAsD;AAC/D,aAAS,6DAA6D;AACtE,aAAS,kEAAkE;AAC3E,aAAS,8DAA8D;AACvE,aAAS,4DAA4D;AACrE,aAAS,iEAAiE;AAC1E,aAAS,oEAAoE;AAC7E,aAAS,8EAA8E;AACvF,aAAS,wFAAwF;AACjG,aAAS,kFAAkF;AAC3F,aAAS,4DAA4D;AACrE,aAAS,kFAAkF;AAC3F,aAAS,sEAAsE;AAC/E,aAAS,wEAAwE;AACjF,aAAS,kEAAkE;AAC3E,aAAS,kEAAkE;AAAA,EAC7E;AAAA;AAAA;AAAA;AAAA,EAKA,WAAgB;AACd,WAAO,KAAK;AAAA,EACd;AAAA,EAEQ,gBAAsB;AAE5B,UAAM,aAAa,KAAK,GAAG,IAAI,mEAAmE;AAClG,UAAM,iBAAiB,aAAa,WAAW,UAAU;AAEzD,QAAI,iBAAiB,wBAAwB;AAG3C,WAAK,GAAG;AAAA,QAAI;AAAA,QACV,CAAC,wBAAwB,KAAK,IAAI,CAAC;AAAA,MAAC;AAAA,IACxC;AAIA,QAAI;AACF,WAAK,GAAG,IAAI,kEAAkE;AAAA,IAChF,QAAQ;AAAA,IAER;AAGA,QAAI;AACF,WAAK,GAAG,IAAI,2EAA2E;AAAA,IACzF,QAAQ;AAAA,IAER;AACA,QAAI;AACF,WAAK,GAAG,IAAI,yEAAyE;AAAA,IACvF,QAAQ;AAAA,IAER;AAAA,EACF;AAAA;AAAA,EAIA,WAAW,QAA0B;AACnC,SAAK,GAAG;AAAA,MACN;AAAA;AAAA,MAEA,CAAC,OAAO,MAAM,OAAO,aAAa,OAAO,UAAU,OAAO,UAAU,OAAO,aAAa,OAAO,SAAS;AAAA,IAC1G;AAAA,EACF;AAAA,EAEA,QAAQ,UAAqC;AAC3C,UAAM,MAAM,KAAK,GAAG,IAAI,sCAAsC,CAAC,QAAQ,CAAC;AACxE,WAAO,MAAM,KAAK,UAAU,GAAG,IAAI;AAAA,EACrC;AAAA,EAEA,cAA4B;AAC1B,WAAO,KAAK,GAAG,IAAI,qBAAqB,EAAE,IAAI,KAAK,SAAS;AAAA,EAC9D;AAAA,EAEA,WAAW,UAAwB;AAEjC,SAAK,GAAG,IAAI,yCAAyC,CAAC,QAAQ,CAAC;AAC/D,SAAK,GAAG,IAAI,oCAAoC,CAAC,QAAQ,CAAC;AAAA,EAC5D;AAAA,EAEQ,UAAU,KAAsB;AACtC,WAAO;AAAA,MACL,MAAM,IAAI;AAAA,MACV,aAAa,IAAI;AAAA,MACjB,UAAU,IAAI;AAAA,MACd,UAAU,IAAI;AAAA,MACd,aAAa,IAAI;AAAA,MACjB,WAAW,IAAI;AAAA,IACjB;AAAA,EACF;AAAA;AAAA,EAIA,WAAW,MAAkB;AAC3B,SAAK,GAAG;AAAA,MACN;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOA;AAAA,QACE,KAAK;AAAA,QAAI,KAAK;AAAA,QAAM,KAAK;AAAA,QAAM,KAAK;AAAA,QAAe,KAAK;AAAA,QAAU,KAAK;AAAA,QACvE,KAAK;AAAA,QAAW,KAAK;AAAA,QAAS,KAAK;AAAA,QAAa,KAAK;AAAA,QACrD,KAAK,aAAa;AAAA,QAAM,KAAK,aAAa;AAAA,QAAM,KAAK,cAAc;AAAA,QACnE,KAAK,aAAa,IAAI;AAAA,QAAG,KAAK,UAAU,IAAI;AAAA,QAC5C,KAAK,WAAW,IAAI;AAAA,QAAG,KAAK,aAAa,IAAI;AAAA,QAC7C,KAAK,aAAa,KAAK,UAAU,KAAK,UAAU,IAAI;AAAA,QACpD,KAAK,iBAAiB,KAAK,UAAU,KAAK,cAAc,IAAI;AAAA,QAC5D,KAAK;AAAA,MACP;AAAA,IACF;AAEA,SAAK,GAAG;AAAA,MACN;AAAA;AAAA,MAEA,CAAC,KAAK,IAAI,KAAK,MAAM,KAAK,eAAe,KAAK,aAAa,IAAI,KAAK,aAAa,EAAE;AAAA,IACrF;AAAA,EACF;AAAA,EAEA,QAAQ,IAAyB;AAC/B,UAAM,MAAM,KAAK,GAAG,IAAI,oCAAoC,CAAC,EAAE,CAAC;AAChE,WAAO,MAAM,KAAK,UAAU,GAAG,IAAI;AAAA,EACrC;AAAA,EAEA,eAAe,UAA0B;AACvC,WAAO,KAAK,GAAG,IAAI,2CAA2C,CAAC,QAAQ,CAAC,EAAE,IAAI,KAAK,SAAS;AAAA,EAC9F;AAAA,EAEA,eAAe,MAA4B;AACzC,WAAO,KAAK,GAAG,IAAI,sCAAsC,CAAC,IAAI,CAAC,EAAE,IAAI,KAAK,SAAS;AAAA,EACrF;AAAA,EAEA,qBAAqB,MAAc,OAAoB,QAAQ,IAAY;AACzE,QAAI,SAAS,MAAM,SAAS,GAAG;AAC7B,YAAM,eAAe,MAAM,IAAI,MAAM,GAAG,EAAE,KAAK,GAAG;AAClD,aAAO,KAAK,GAAG;AAAA,QACb,mDAAmD,YAAY;AAAA,QAC/D,CAAC,MAAM,GAAG,OAAO,KAAK;AAAA,MACxB,EAAE,IAAI,KAAK,SAAS;AAAA,IACtB;AACA,WAAO,KAAK,GAAG;AAAA,MACb;AAAA,MACA,CAAC,MAAM,KAAK;AAAA,IACd,EAAE,IAAI,KAAK,SAAS;AAAA,EACtB;AAAA,EAEA,YAAY,OAAe,OAAsB,CAAC,GAAW;AAC3D,UAAM,EAAE,OAAO,WAAW,QAAQ,GAAG,IAAI;AAKzC,UAAM,OAAO,MACV,QAAQ,qBAAqB,GAAG,EAChC,QAAQ,4BAA4B,GAAG,EACvC,QAAQ,QAAQ,GAAG,EACnB,KAAK;AACR,QAAI,CAAC,KAAM,QAAO,CAAC;AAEnB,UAAM,WAAW,OAAO;AACxB,UAAM,YAAY,KAAK,IAAI,GAAG,KAAK,MAAM,OAAO,KAAK,CAAC,CAAC;AAEvD,UAAM,aAAuB,CAAC;AAC9B,UAAM,SAAgB,CAAC;AAEvB,QAAI,SAAS,MAAM,SAAS,GAAG;AAC7B,iBAAW,KAAK,YAAY,MAAM,IAAI,MAAM,GAAG,EAAE,KAAK,GAAG,CAAC,GAAG;AAC7D,aAAO,KAAK,GAAG,KAAK;AAAA,IACtB;AACA,QAAI,aAAa,UAAU,SAAS,GAAG;AACrC,iBAAW,KAAK,gBAAgB,UAAU,IAAI,MAAM,GAAG,EAAE,KAAK,GAAG,CAAC,GAAG;AACrE,aAAO,KAAK,GAAG,SAAS;AAAA,IAC1B;AAEA,UAAM,QAAQ,WAAW,SAAS,IAAI,OAAO,WAAW,KAAK,OAAO,CAAC,KAAK;AAE1E,WAAO,KAAK,GAAG;AAAA,MACb;AAAA,yEACmE,QAAQ;AAAA,SACxE,KAAK;AAAA,eACC,SAAS;AAAA,MAClB;AAAA,IACF,EAAE,IAAI,KAAK,SAAS;AAAA,EACtB;AAAA,EAEA,kBAAkB,MAAc,OAAsB,CAAC,GAAW;AAChE,UAAM,EAAE,OAAO,WAAW,QAAQ,GAAG,IAAI;AACzC,UAAM,UAAU,IAAI,IAAI;AACxB,UAAM,aAAuB,CAAC,aAAa;AAC3C,UAAM,SAAgB,CAAC,OAAO;AAE9B,QAAI,SAAS,MAAM,SAAS,GAAG;AAC7B,iBAAW,KAAK,YAAY,MAAM,IAAI,MAAM,GAAG,EAAE,KAAK,GAAG,CAAC,GAAG;AAC7D,aAAO,KAAK,GAAG,KAAK;AAAA,IACtB;AACA,QAAI,aAAa,UAAU,SAAS,GAAG;AACrC,iBAAW,KAAK,gBAAgB,UAAU,IAAI,MAAM,GAAG,EAAE,KAAK,GAAG,CAAC,GAAG;AACrE,aAAO,KAAK,GAAG,SAAS;AAAA,IAC1B;AACA,WAAO,KAAK,KAAK;AAEjB,WAAO,KAAK,GAAG;AAAA,MACb,6BAA6B,WAAW,KAAK,OAAO,CAAC;AAAA,MACrD;AAAA,IACF,EAAE,IAAI,KAAK,SAAS;AAAA,EACtB;AAAA,EAEA,kBAAkB,UAAwB;AACxC,UAAM,MAAM,KAAK,GAAG,IAAI,4CAA4C,CAAC,QAAQ,CAAC,EAAE,IAAI,CAAC,MAAW,EAAE,EAAE;AACpG,QAAI,IAAI,WAAW,EAAG;AACtB,UAAM,eAAe,IAAI,IAAI,MAAM,GAAG,EAAE,KAAK,GAAG;AAChD,SAAK,GAAG,IAAI,sCAAsC,YAAY,mBAAmB,YAAY,KAAK,CAAC,GAAG,KAAK,GAAG,GAAG,CAAC;AAClH,SAAK,GAAG,IAAI,sCAAsC,YAAY,KAAK,GAAG;AACtE,SAAK,GAAG,IAAI,yCAAyC,CAAC,QAAQ,CAAC;AAAA,EACjE;AAAA,EAEQ,UAAU,KAAgB;AAChC,WAAO;AAAA,MACL,IAAI,IAAI;AAAA,MACR,MAAM,IAAI;AAAA,MACV,MAAM,IAAI;AAAA,MACV,eAAe,IAAI;AAAA,MACnB,UAAU,IAAI;AAAA,MACd,UAAU,IAAI;AAAA,MACd,WAAW,IAAI;AAAA,MACf,SAAS,IAAI;AAAA,MACb,aAAa,IAAI;AAAA,MACjB,WAAW,IAAI;AAAA,MACf,WAAW,IAAI,aAAa;AAAA,MAC5B,WAAW,IAAI,aAAa;AAAA,MAC5B,YAAY,IAAI,cAAc;AAAA,MAC9B,YAAY,IAAI,gBAAgB;AAAA,MAChC,SAAS,IAAI,aAAa;AAAA,MAC1B,UAAU,IAAI,cAAc;AAAA,MAC5B,YAAY,IAAI,gBAAgB;AAAA,MAChC,YAAY,IAAI,aAAa,KAAK,MAAM,IAAI,UAAU,IAAI;AAAA,MAC1D,gBAAgB,IAAI,kBAAkB,KAAK,MAAM,IAAI,eAAe,IAAI;AAAA,MACxE,WAAW,IAAI;AAAA,IACjB;AAAA,EACF;AAAA;AAAA,EAIA,WAAW,MAAkB;AAC3B,SAAK,GAAG;AAAA,MACN;AAAA;AAAA,MAEA,CAAC,KAAK,QAAQ,KAAK,QAAQ,KAAK,MAAM,KAAK,WAAW,KAAK,UAAU,KAAK,QAAQ,IAAI,MAAM,KAAK,QAAQ,MAAM,KAAK,UAAU,MAAM,KAAK,cAAc,aAAa,KAAK,mBAAmB,CAAG;AAAA,IACjM;AAAA,EACF;AAAA,EAEA,WAAW,QAAgB,QAAQ,IAAY;AAC7C,WAAO,KAAK,GAAG;AAAA,MACb;AAAA;AAAA;AAAA;AAAA,MAIA,CAAC,QAAQ,KAAK;AAAA,IAChB,EAAE,IAAI,KAAK,SAAS;AAAA,EACtB;AAAA,EAEA,WAAW,QAAgB,QAAQ,IAAY;AAC7C,WAAO,KAAK,GAAG;AAAA,MACb;AAAA;AAAA;AAAA;AAAA,MAIA,CAAC,QAAQ,KAAK;AAAA,IAChB,EAAE,IAAI,KAAK,SAAS;AAAA,EACtB;AAAA,EAEA,gBAAgB,QAAgB,QAAQ,GAAW;AAEjD,UAAM,UAAU,oBAAI,IAAY,CAAC,MAAM,CAAC;AACxC,QAAI,WAAW,CAAC,MAAM;AACtB,aAAS,IAAI,GAAG,IAAI,OAAO,KAAK;AAC9B,UAAI,SAAS,WAAW,EAAG;AAC3B,YAAMA,gBAAe,SAAS,IAAI,MAAM,GAAG,EAAE,KAAK,GAAG;AACrD,YAAM,OAAO,KAAK,GAAG;AAAA,QACnB,sDAAsDA,aAAY;AAAA,QAClE;AAAA,MACF;AACA,iBAAW,CAAC;AACZ,iBAAW,OAAO,MAAM;AACtB,YAAI,CAAC,QAAQ,IAAI,IAAI,MAAM,GAAG;AAC5B,kBAAQ,IAAI,IAAI,MAAM;AACtB,mBAAS,KAAK,IAAI,MAAM;AAAA,QAC1B;AAAA,MACF;AAAA,IACF;AACA,YAAQ,OAAO,MAAM;AACrB,QAAI,QAAQ,SAAS,EAAG,QAAO,CAAC;AAChC,UAAM,MAAM,CAAC,GAAG,OAAO;AACvB,UAAM,eAAe,IAAI,IAAI,MAAM,GAAG,EAAE,KAAK,GAAG;AAChD,WAAO,KAAK,GAAG,IAAI,oCAAoC,YAAY,KAAK,GAAG,EAAE,IAAI,KAAK,SAAS;AAAA,EACjG;AAAA,EAEA,iBAAiB,SAA2B;AAC1C,QAAI,QAAQ,WAAW,EAAG,QAAO,CAAC;AAClC,UAAM,eAAe,QAAQ,IAAI,MAAM,GAAG,EAAE,KAAK,GAAG;AACpD,WAAO,KAAK,GAAG;AAAA,MACb,wCAAwC,YAAY,mBAAmB,YAAY;AAAA,MACnF,CAAC,GAAG,SAAS,GAAG,OAAO;AAAA,IACzB,EAAE,IAAI,CAAC,SAAc;AAAA,MACnB,QAAQ,IAAI;AAAA,MACZ,QAAQ,IAAI;AAAA,MACZ,MAAM,IAAI;AAAA,MACV,UAAU,IAAI,WAAW,KAAK,MAAM,IAAI,QAAQ,IAAI;AAAA,MACpD,MAAM,IAAI,QAAQ;AAAA,MAClB,QAAQ,IAAI,UAAU;AAAA,IACxB,EAAE;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,kBAAkB,UAA4B;AAE5C,UAAM,cAAc,KAAK,GAAG,IAAI,4CAA4C,CAAC,QAAQ,CAAC;AACtF,QAAI,YAAY,WAAW,EAAG,QAAO,CAAC;AACtC,UAAM,MAAM,YAAY,IAAI,CAAC,MAAW,EAAE,EAAE;AAC5C,UAAM,eAAe,IAAI,IAAI,MAAM,GAAG,EAAE,KAAK,GAAG;AAEhD,UAAM,OAAO,KAAK,GAAG;AAAA,MACnB;AAAA;AAAA,4BAEsB,YAAY;AAAA;AAAA,MAElC,CAAC,GAAG,KAAK,QAAQ;AAAA,IACnB;AACA,WAAO,KAAK,IAAI,CAAC,MAAW,EAAE,SAAS;AAAA,EACzC;AAAA;AAAA,EAIA,oBAAoB,UAAkB,SAAiB,SAAiB,UAAkB,MAAe,QAAuB;AAC9H,SAAK,GAAG;AAAA,MACN;AAAA;AAAA,MAEA,CAAC,UAAU,SAAS,SAAS,UAAU,QAAQ,MAAM,UAAU,IAAI;AAAA,IACrE;AAAA,EACF;AAAA,EAEA,2BAA2B,UAAwB;AACjD,SAAK,GAAG,IAAI,mDAAmD,CAAC,QAAQ,CAAC;AAAA,EAC3E;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,wBAAgC;AAC9B,UAAM,OAAO,KAAK,GAAG,IAAI,+BAA+B;AACxD,QAAI,WAAW;AAEf,eAAW,OAAO,MAAM;AACtB,YAAM,EAAE,IAAI,OAAO,WAAW,UAAU,UAAU,SAAS,UAAU,SAAS,WAAW,UAAU,MAAM,OAAO,IAAI;AAEpH,UAAI,YAAY,YAAY;AAE1B,YAAI,SAAS,KAAK,GAAG,IAAI,+CAA+C,CAAC,OAAO,CAAC;AACjF,YAAI,aAAqD;AACzD,YAAI,kBAAkB;AAGtB,YAAI,CAAC,QAAQ;AACX,mBAAS,KAAK,GAAG;AAAA,YACf;AAAA,YACA,CAAC,MAAM,OAAO,EAAE;AAAA,UAClB;AAAA,QACF;AAGA,YAAI,CAAC,QAAQ;AACX,mBAAS,KAAK,GAAG;AAAA,YACf;AAAA,YACA,CAAC,OAAO;AAAA,UACV;AAEA,cAAI,OAAQ,mBAAkB;AAAA,QAChC;AAGA,YAAI,QAAQ;AACV,gBAAM,iBAAiB,KAAK,GAAG,IAAI,oDAAoD,CAAC,OAAO,CAAC;AAChG,cAAI,kBAAkB,eAAe,MAAM,GAAG;AAC5C,yBAAa;AACb,8BAAkB,IAAM,eAAe;AAAA,UACzC;AAAA,QACF;AAEA,YAAI,QAAQ;AACV,eAAK,WAAW,EAAE,QAAQ,UAAU,QAAQ,OAAO,IAAI,MAAM,SAAS,MAAM,QAAQ,QAAW,QAAQ,UAAU,QAAW,YAAY,gBAAgB,CAAC;AACzJ,eAAK,GAAG,IAAI,4CAA4C,CAAC,KAAK,CAAC;AAC/D;AAAA,QACF;AAAA,MACF,WAAW,YAAY,UAAU;AAE/B,cAAM,iBAAiB,KAAK,kBAAkB,SAAS,QAAQ;AAC/D,YAAI,gBAAgB;AAClB,eAAK,WAAW,EAAE,QAAQ,UAAU,QAAQ,gBAAgB,MAAM,WAAW,MAAM,QAAQ,QAAW,QAAQ,UAAU,QAAW,YAAY,YAAY,iBAAiB,EAAI,CAAC;AACjL,eAAK,GAAG,IAAI,4CAA4C,CAAC,KAAK,CAAC;AAC/D;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA;AAAA,EAGA,mBAA2B;AACzB,WAAO,KAAK,sBAAsB;AAAA,EACpC;AAAA;AAAA;AAAA;AAAA;AAAA,EAMQ,kBAAkB,YAAoB,gBAAuC;AAEnF,QAAI,CAAC,WAAW,WAAW,GAAG,EAAG,QAAO;AAExC,UAAM,YAAY,eAAe,QAAQ,UAAU,EAAE;AAErD,UAAM,YAAY,YAAY,YAAY,MAAM,GAAG;AACnD,UAAM,aAAuB,CAAC;AAC9B,eAAW,OAAO,UAAU;AAC1B,UAAI,QAAQ,KAAM,YAAW,IAAI;AAAA,eACxB,QAAQ,IAAK,YAAW,KAAK,GAAG;AAAA,IAC3C;AACA,UAAM,WAAW,WAAW,KAAK,GAAG;AAGpC,UAAM,aAAa;AAAA,MACjB;AAAA,MACA,WAAW;AAAA,MACX,WAAW;AAAA,MACX,WAAW;AAAA,MACX,WAAW;AAAA,MACX,WAAW;AAAA,MACX,WAAW;AAAA,MACX,WAAW;AAAA,IACb;AAEA,eAAW,aAAa,YAAY;AAClC,YAAM,MAAM,KAAK,GAAG,IAAI,oDAAoD,CAAC,SAAS,CAAC;AACvF,UAAI,IAAK,QAAO,IAAI;AAAA,IACtB;AAEA,WAAO;AAAA,EACT;AAAA;AAAA,EAIA,eAAe,QAAoC;AACjD,UAAM,OAAO,KAAK,QAAQ,MAAM;AAChC,QAAI,CAAC,KAAM,QAAO;AAElB,UAAM,YAAY,KAAK,GAAG;AAAA,MACxB;AAAA;AAAA;AAAA,MAGA,CAAC,MAAM;AAAA,IACT,EAAE,IAAI,KAAK,SAAS;AAEpB,UAAM,WAAW,KAAK,GAAG;AAAA,MACvB;AAAA;AAAA;AAAA,MAGA,CAAC,MAAM;AAAA,IACT,EAAE,IAAI,KAAK,SAAS;AAEpB,UAAM,UAAU,KAAK,WAAW,QAAQ,EAAE;AAC1C,UAAM,UAAU,KAAK,WAAW,QAAQ,EAAE;AAE1C,WAAO,EAAE,MAAM,WAAW,UAAU,SAAS,QAAQ;AAAA,EACvD;AAAA,EAEA,eAAe,QAA6B;AAC1C,UAAM,oBAAqB,KAAK,GAAG,IAAI,oDAAoD,CAAC,MAAM,CAAC,GAAG,KAAK;AAC3G,UAAM,oBAAqB,KAAK,GAAG,IAAI,oDAAoD,CAAC,MAAM,CAAC,GAAG,KAAK;AAC3G,UAAM,YAAa,KAAK,GAAG,IAAI,uEAAuE,CAAC,MAAM,CAAC,GAAG,KAAK;AACtH,UAAM,cAAe,KAAK,GAAG,IAAI,uEAAuE,CAAC,MAAM,CAAC,GAAG,KAAK;AACxH,UAAM,aAAc,KAAK,GAAG,IAAI,0EAA0E,CAAC,MAAM,CAAC,GAAG,KAAK;AAC1H,WAAO,EAAE,mBAAmB,mBAAmB,WAAW,aAAa,WAAW;AAAA,EACpF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,aAAa,QAAQ,IAAY;AAC/B,WAAO,KAAK,GAAG;AAAA,MACb;AAAA;AAAA;AAAA;AAAA;AAAA,MAKA,CAAC,KAAK;AAAA,IACR,EAAE,IAAI,KAAK,SAAS;AAAA,EACtB;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,2BAAuC;AAErC,UAAM,OAAO,KAAK,GAAG;AAAA,MACnB;AAAA;AAAA;AAAA;AAAA;AAAA,IAKF;AAEA,UAAM,MAAM,oBAAI,IAAyB;AACzC,eAAW,OAAO,MAAM;AACtB,UAAI,CAAC,IAAI,IAAI,IAAI,GAAG,EAAG,KAAI,IAAI,IAAI,KAAK,oBAAI,IAAI,CAAC;AACjD,UAAI,IAAI,IAAI,GAAG,EAAG,IAAI,IAAI,GAAG;AAAA,IAC/B;AAEA,UAAM,SAAqB,CAAC;AAC5B,UAAM,UAAU,oBAAI,IAAY;AAChC,UAAM,UAAU,oBAAI,IAAY;AAChC,UAAM,UAAoB,CAAC;AAE3B,aAAS,IAAI,MAAoB;AAC/B,UAAI,QAAQ,IAAI,IAAI,GAAG;AACrB,cAAM,aAAa,QAAQ,QAAQ,IAAI;AACvC,eAAO,KAAK,QAAQ,MAAM,UAAU,EAAE,OAAO,IAAI,CAAC;AAClD;AAAA,MACF;AACA,UAAI,QAAQ,IAAI,IAAI,EAAG;AACvB,cAAQ,IAAI,IAAI;AAChB,cAAQ,IAAI,IAAI;AAChB,cAAQ,KAAK,IAAI;AACjB,iBAAW,YAAY,IAAI,IAAI,IAAI,KAAK,CAAC,GAAG;AAC1C,YAAI,QAAQ;AAAA,MACd;AACA,cAAQ,IAAI;AACZ,cAAQ,OAAO,IAAI;AAAA,IACrB;AAEA,eAAW,QAAQ,IAAI,KAAK,GAAG;AAC7B,UAAI,CAAC,QAAQ,IAAI,IAAI,EAAG,KAAI,IAAI;AAAA,IAClC;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,SAAS,QAAgB,MAAc,WAAW,IAAY;AAC5D,QAAI,WAAW,MAAM;AACnB,YAAM,OAAO,KAAK,QAAQ,MAAM;AAChC,aAAO,OAAO,CAAC,IAAI,IAAI,CAAC;AAAA,IAC1B;AAEA,UAAM,OAAO,oBAAI,IAAoB;AACrC,UAAM,QAAkB,CAAC,MAAM;AAC/B,UAAM,UAAU,oBAAI,IAAY,CAAC,MAAM,CAAC;AACxC,QAAI,QAAQ;AAEZ,UAAO,QAAO,MAAM,SAAS,KAAK,QAAQ,UAAU;AAClD,YAAM,YAAY,MAAM;AACxB;AACA,eAAS,IAAI,GAAG,IAAI,WAAW,KAAK;AAClC,cAAM,UAAU,MAAM,MAAM;AAE5B,cAAM,OAAO,KAAK,GAAG;AAAA,UACnB;AAAA,UACA,CAAC,OAAO;AAAA,QACV;AACA,mBAAW,OAAO,MAAM;AACtB,cAAI,CAAC,QAAQ,IAAI,IAAI,IAAI,GAAG;AAC1B,oBAAQ,IAAI,IAAI,IAAI;AACpB,iBAAK,IAAI,IAAI,MAAM,OAAO;AAC1B,gBAAI,IAAI,SAAS,KAAM,OAAM;AAC7B,kBAAM,KAAK,IAAI,IAAI;AAAA,UACrB;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAEA,QAAI,CAAC,KAAK,IAAI,IAAI,EAAG,QAAO,CAAC;AAG7B,UAAM,UAAoB,CAAC;AAC3B,QAAI,MAA0B;AAC9B,WAAO,QAAQ,QAAW;AACxB,cAAQ,QAAQ,GAAG;AACnB,YAAM,KAAK,IAAI,GAAG;AAAA,IACpB;AAEA,UAAM,SAAiB,CAAC;AACxB,eAAW,MAAM,SAAS;AACxB,YAAM,OAAO,KAAK,QAAQ,EAAE;AAC5B,UAAI,KAAM,QAAO,KAAK,IAAI;AAAA,IAC5B;AACA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,iBAAiB,QAAgB,YAAoC,QAAgB;AACnF,UAAM,UAAU,oBAAI,IAAY,CAAC,MAAM,CAAC;AACxC,UAAM,WAAW,CAAC,MAAM;AACxB,UAAM,SAAiB,CAAC;AAExB,WAAO,SAAS,SAAS,GAAG;AAC1B,YAAM,UAAU,SAAS,MAAM;AAC/B,UAAI,OAAc,CAAC;AAEnB,UAAI,cAAc,QAAQ,cAAc,QAAQ;AAE9C,cAAM,KAAK,KAAK,GAAG;AAAA,UACjB;AAAA,UACA,CAAC,OAAO;AAAA,QACV;AACA,eAAO,KAAK,OAAO,EAAE;AAAA,MACvB;AACA,UAAI,cAAc,UAAU,cAAc,QAAQ;AAEhD,cAAM,OAAO,KAAK,GAAG;AAAA,UACnB;AAAA,UACA,CAAC,OAAO;AAAA,QACV;AACA,eAAO,KAAK,OAAO,IAAI;AAAA,MACzB;AAEA,iBAAW,OAAO,MAAM;AACtB,YAAI,CAAC,QAAQ,IAAI,IAAI,EAAE,GAAG;AACxB,kBAAQ,IAAI,IAAI,EAAE;AAClB,mBAAS,KAAK,IAAI,EAAE;AACpB,gBAAM,OAAO,KAAK,QAAQ,IAAI,EAAE;AAChC,cAAI,KAAM,QAAO,KAAK,IAAI;AAAA,QAC5B;AAAA,MACF;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA;AAAA,EAIA,oBAA4B;AAC1B,QAAI;AACF,YAAM,MAAM,KAAK,GAAG,IAAI,mCAAmC;AAC3D,aAAO,MAAM,IAAI,IAAI;AAAA,IACvB,QAAQ;AACN,aAAO;AAAA,IACT;AAAA,EACF;AAAA,EAEA,eAAe,QAAgB,WAAyB,OAAqB;AAC3E,UAAM,MAAM,OAAO,KAAK,UAAU,MAAM;AACxC,SAAK,GAAG;AAAA,MACN;AAAA,MACA,CAAC,QAAQ,KAAK,OAAO,KAAK,IAAI,CAAC;AAAA,IACjC;AAAA,EACF;AAAA,EAEA,qBAA+B;AAC7B,WAAO,KAAK,GAAG,IAAI,6BAA6B,EAAE,IAAI,CAAC,MAAW,EAAE,OAAO;AAAA,EAC7E;AAAA,EAEA,mBAAuE;AACrE,UAAM,OAAO,KAAK,GAAG,IAAI,wCAAwC;AACjE,WAAO,KAAK,IAAI,CAAC,OAAY;AAAA,MAC3B,QAAQ,EAAE;AAAA,MACV,WAAW,IAAI;AAAA,QACZ,EAAE,UAAqB;AAAA,QACvB,EAAE,UAAqB;AAAA,QACvB,EAAE,UAAqB,aAAa;AAAA,MACvC;AAAA,IACF,EAAE;AAAA,EACJ;AAAA,EAEA,cAAyC;AACvC,WAAO,KAAK,GAAG,IAAI,qBAAqB,EAAE,IAAI,KAAK,SAAS;AAAA,EAC9D;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,wBAAwB,OAAiB,OAAe,QAA2C;AACjG,QAAI,MAAM,WAAW,EAAG,QAAO,CAAC;AAChC,UAAM,eAAe,MAAM,IAAI,MAAM,GAAG,EAAE,KAAK,GAAG;AAClD,WAAO,KAAK,GAAG;AAAA,MACb,sCAAsC,YAAY;AAAA,MAClD,CAAC,GAAG,OAAO,OAAO,MAAM;AAAA,IAC1B,EAAE,IAAI,KAAK,SAAS;AAAA,EACtB;AAAA;AAAA,EAGA,qBAAqB,OAAyB;AAC5C,QAAI,MAAM,WAAW,EAAG,QAAO;AAC/B,UAAM,eAAe,MAAM,IAAI,MAAM,GAAG,EAAE,KAAK,GAAG;AAClD,UAAM,MAAM,KAAK,GAAG,IAAI,kDAAkD,YAAY,KAAK,KAAK;AAChG,WAAO,KAAK,KAAK;AAAA,EACnB;AAAA,EAEA,cAAsB;AACpB,WAAO,KAAK,GAAG,IAAI,wCAAwC,EAAE,IAAI,CAAC,SAAc;AAAA,MAC9E,QAAQ,IAAI;AAAA,MACZ,QAAQ,IAAI;AAAA,MACZ,MAAM,IAAI;AAAA,IACZ,EAAE;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,aAAa,QAAQ,IAA2E;AAC9F,UAAM,OAAO,KAAK,GAAG;AAAA,MACnB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOA,CAAC,KAAK;AAAA,IACR;AACA,WAAO,KAAK,IAAI,CAAC,SAAc;AAAA,MAC7B,GAAG,KAAK,UAAU,GAAG;AAAA,MACrB,QAAQ,IAAI;AAAA,MACZ,UAAU,IAAI;AAAA,MACd,WAAW,IAAI;AAAA,IACjB,EAAE;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,0BAA0B,QAAQ,IAAwE;AACxG,UAAM,cAAsC;AAAA,MAC1C,OAAO;AAAA,MAAK,YAAY;AAAA,MAAK,SAAS;AAAA,MAAK,SAAS;AAAA,MACpD,WAAW;AAAA,MAAK,SAAS;AAAA,MAAK,YAAY;AAAA,IAC5C;AAEA,UAAM,OACJ,KAAK,GAAG;AAAA,MACN;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAQF;AAGF,UAAM,SAAS,KAAK,IAAI,SAAO;AAC7B,YAAM,UAAU,IAAI,YAAY,MAAM,GAAG,EAAE,MAAM,GAAG,EAAE;AACtD,YAAM,UAAU,IAAI,YAAY,MAAM,GAAG,EAAE,MAAM,GAAG,EAAE;AACtD,UAAI,SAAS;AACb,eAAS,IAAI,GAAG,IAAI,KAAK,IAAI,QAAQ,QAAQ,QAAQ,MAAM,GAAG,KAAK;AACjE,YAAI,QAAQ,CAAC,MAAM,QAAQ,CAAC,EAAG;AAAA,YAC1B;AAAA,MACP;AACA,YAAM,UAAU,KAAK,IAAI,QAAQ,QAAQ,QAAQ,QAAQ,CAAC;AAC1D,YAAM,iBAAiB,SAAS;AAChC,YAAM,aAAa,YAAY,IAAI,IAAI,KAAK;AAC5C,aAAO,EAAE,GAAG,KAAK,QAAQ,IAAI,kBAAkB,WAAW;AAAA,IAC5D,CAAC;AAGD,WAAO,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK;AACvC,UAAM,OAAO,oBAAI,IAAY;AAC7B,UAAM,MAAqB,CAAC;AAC5B,eAAW,OAAO,QAAQ;AACxB,YAAM,MAAM,GAAG,IAAI,MAAM,IAAI,IAAI,MAAM,IAAI,IAAI,IAAI;AACnD,UAAI,CAAC,KAAK,IAAI,GAAG,GAAG;AAClB,aAAK,IAAI,GAAG;AACZ,YAAI,KAAK,GAAG;AACZ,YAAI,IAAI,UAAU,MAAO;AAAA,MAC3B;AAAA,IACF;AAEA,UAAM,SAA6E,CAAC;AACpF,eAAW,OAAO,KAAK;AACrB,YAAM,MAAM,KAAK,QAAQ,IAAI,MAAM;AACnC,YAAM,MAAM,KAAK,QAAQ,IAAI,MAAM;AACnC,UAAI,OAAO,IAAK,QAAO,KAAK,EAAE,QAAQ,KAAK,QAAQ,KAAK,MAAM,IAAI,MAAM,OAAO,IAAI,MAAM,CAAC;AAAA,IAC5F;AACA,WAAO;AAAA,EACT;AAAA,EAEA,WAAuB;AACrB,UAAM,QAAQ,KAAK,GAAG,IAAI,iCAAiC,EAAE;AAC7D,UAAM,QAAQ,KAAK,GAAG,IAAI,iCAAiC,EAAE;AAC7D,UAAM,QAAQ,KAAK,GAAG,IAAI,iCAAiC,EAAE;AAC7D,UAAM,WAAW,KAAK,GAAG,IAAI,qDAAqD;AAClF,UAAM,cAAsC,CAAC;AAC7C,eAAW,OAAO,SAAU,aAAY,IAAI,IAAI,IAAI,IAAI;AACxD,UAAM,WAAW,KAAK,GAAG,IAAI,6DAA6D;AAC1F,UAAM,kBAA0C,CAAC;AACjD,eAAW,OAAO,SAAU,iBAAgB,IAAI,QAAQ,IAAI,IAAI;AAChE,UAAM,SAAS,KAAK,KAAK,KAAK,aAAa,cAAc,cAAc;AACvE,QAAI,cAAc;AAClB,QAAI;AAAE,oBAAc,GAAG,SAAS,MAAM,EAAE;AAAA,IAAM,QAAQ;AAAA,IAAe;AACrE,UAAM,iBAAiB,KAAK,kBAAkB;AAC9C,WAAO,EAAE,OAAO,OAAO,OAAO,aAAa,iBAAiB,aAAa,gBAAgB,mBAAmB,OAAO,gBAAgB,IAAI,aAAa,OAAO,gBAAgB,UAAmB,eAAe,GAAG,gBAAgB,MAAM,qBAAqB,GAAG,YAAY,CAAC,GAAG,qBAAqB,MAAM;AAAA,EAC3S;AAAA;AAAA,EAIA,oBAA0B;AACxB,SAAK,GAAG,IAAI,2BAA2B;AACvC,SAAK,GAAG,IAAI,6BAA6B;AACzC,SAAK,GAAG,IAAI,+BAA+B;AAC3C,SAAK,GAAG,IAAI,8BAA8B;AAC1C,SAAK,GAAG,IAAI,gCAAgC;AAC5C,SAAK,GAAG,IAAI,yBAAyB;AACrC,SAAK,GAAG,IAAI,2BAA2B;AAAA,EACzC;AAAA,EAEA,kBAAkB,KAAwB;AACxC,SAAK,GAAG;AAAA,MACN;AAAA;AAAA;AAAA,MAGA;AAAA,QACE,IAAI;AAAA,QAAI,IAAI;AAAA,QAAM,IAAI;AAAA,QAAM,IAAI;AAAA,QAChC,IAAI,YAAY;AAAA,QAAM,IAAI,gBAAgB;AAAA,QAAM,IAAI,WAAW;AAAA,QAC/D,IAAI,eAAe,KAAK,UAAU,IAAI,YAAY,IAAI;AAAA,QACtD,IAAI,WAAW,KAAK,UAAU,IAAI,QAAQ,IAAI;AAAA,QAC9C,IAAI;AAAA,MACN;AAAA,IACF;AAAA,EACF;AAAA,EAEA,gBAAgB,OAAwB;AACtC,SAAK,GAAG;AAAA,MACN;AAAA;AAAA,MAEA;AAAA,QACE,MAAM;AAAA,QAAI,MAAM;AAAA,QAAM,MAAM;AAAA,QAC5B,KAAK,UAAU,MAAM,QAAQ;AAAA,QAC7B,MAAM,WAAW,KAAK,UAAU,MAAM,QAAQ,IAAI;AAAA,QAClD,MAAM;AAAA,MACR;AAAA,IACF;AAAA,EACF;AAAA,EAEA,sBAAsB,UAAkB,WAAyB;AAC/D,SAAK,GAAG;AAAA,MACN;AAAA,MACA,CAAC,UAAU,SAAS;AAAA,IACtB;AAAA,EACF;AAAA,EAEA,oBAAoB,UAAkB,SAAiB,YAAoB,gBAA8B;AACvG,SAAK,GAAG;AAAA,MACN;AAAA;AAAA,MAEA,CAAC,UAAU,SAAS,YAAY,cAAc;AAAA,IAChD;AAAA,EACF;AAAA,EAEA,qBAAqB,WAAmB,WAAmB,UAAkB,OAAmD;AAC9H,SAAK,GAAG;AAAA,MACN;AAAA;AAAA,MAEA,CAAC,WAAW,WAAW,UAAU,QAAQ,KAAK,UAAU,KAAK,IAAI,IAAI;AAAA,IACvE;AAAA,EACF;AAAA,EAEA,mBAAmB,aAAqB,aAAqB,UAAwB;AACnF,SAAK,GAAG;AAAA,MACN;AAAA;AAAA,MAEA,CAAC,aAAa,aAAa,QAAQ;AAAA,IACrC;AAAA,EACF;AAAA,EAEA,mBAAmB,UAA8B;AAC/C,SAAK,GAAG;AAAA,MACN;AAAA;AAAA,MAEA,CAAC,SAAS,WAAW,SAAS,UAAU,SAAS,UAAU,SAAS,aAAa,SAAS,SAAS;AAAA,IACrG;AAAA,EACF;AAAA,EAEA,kBAAiC;AAC/B,WAAO,KAAK,GAAG,IAAI,6BAA6B,EAAE,IAAI,CAAC,OAAyB;AAAA,MAC9E,IAAI,EAAE;AAAA,MACN,MAAM,EAAE;AAAA,MACR,MAAM,EAAE;AAAA,MACR,QAAQ,EAAE;AAAA,MACV,UAAU,EAAE,YAAY;AAAA,MACxB,cAAc,EAAE,iBAAiB;AAAA,MACjC,SAAS,EAAE,WAAW;AAAA,MACtB,cAAc,EAAE,gBAAgB,KAAK,MAAM,EAAE,aAAa,IAAI;AAAA,MAC9D,UAAU,EAAE,WAAW,KAAK,MAAM,EAAE,QAAQ,IAAI;AAAA,MAChD,WAAW,EAAE;AAAA,IACf,EAAE;AAAA,EACJ;AAAA,EAEA,gBAA6B;AAC3B,WAAO,KAAK,GAAG,IAAI,2BAA2B,EAAE,IAAI,CAAC,OAAuB;AAAA,MAC1E,IAAI,EAAE;AAAA,MACN,MAAM,EAAE;AAAA,MACR,QAAQ,EAAE;AAAA,MACV,UAAU,KAAK,MAAM,EAAE,QAAQ;AAAA,MAC/B,UAAU,EAAE,WAAW,KAAK,MAAM,EAAE,QAAQ,IAAI;AAAA,MAChD,WAAW,EAAE;AAAA,IACf,EAAE;AAAA,EACJ;AAAA,EAEA,qBAAuC;AACrC,WAAO,KAAK,GAAG,IAAI,iCAAiC,EAAE,IAAI,CAAC,OAA4B;AAAA,MACrF,WAAW,EAAE;AAAA,MACb,WAAW,EAAE;AAAA,MACb,UAAU,EAAE;AAAA,MACZ,OAAO,EAAE,QAAQ,KAAK,MAAM,EAAE,KAAK,IAAI;AAAA,IACzC,EAAE;AAAA,EACJ;AAAA,EAEA,mBAAmC;AACjC,WAAO,KAAK,GAAG,IAAI,+BAA+B,EAAE,IAAI,CAAC,OAA0B;AAAA,MACjF,aAAa,EAAE;AAAA,MACf,aAAa,EAAE;AAAA,MACf,UAAU,EAAE;AAAA,IACd,EAAE;AAAA,EACJ;AAAA,EAEA,kBAAkC;AAChC,WAAO,KAAK,GAAG,IAAI,6BAA6B,EAAE,IAAI,CAAC,OAA0B;AAAA,MAC/E,WAAW,EAAE;AAAA,MACb,UAAU,EAAE;AAAA,MACZ,UAAU,EAAE;AAAA,MACZ,aAAa,EAAE;AAAA,MACf,WAAW,EAAE;AAAA,IACf,EAAE;AAAA,EACJ;AAAA,EAEA,eAA0E;AACxE,WAAO;AAAA,MACL,UAAU,KAAK,GAAG,IAAI,yCAAyC,GAAG,KAAK;AAAA,MACvE,QAAQ,KAAK,GAAG,IAAI,uCAAuC,GAAG,KAAK;AAAA,MACnE,aAAa,KAAK,GAAG,IAAI,6CAA6C,GAAG,KAAK;AAAA,IAChF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,qBAAwE;AACtE,WAAO,KAAK,GAAG;AAAA,MACb;AAAA;AAAA;AAAA;AAAA;AAAA,IAKF,EAAE,IAAI,CAAC,OAAY,EAAE,YAAY,EAAE,aAAa,YAAY,EAAE,YAAY,EAAE;AAAA,EAC9E;AAAA,EAEA,sBAAsE;AACpE,WAAO,KAAK,GAAG,IAAI,sDAAsD,EACtE,IAAI,CAAC,OAAY,EAAE,UAAU,EAAE,WAAW,WAAW,EAAE,WAAW,EAAE;AAAA,EACzE;AAAA,EAEA,oBAA8G;AAC5G,WAAO,KAAK,GAAG,IAAI,+EAA+E,EAC/F,IAAI,CAAC,OAAY;AAAA,MAChB,UAAU,EAAE;AAAA,MACZ,SAAS,EAAE;AAAA,MACX,YAAY,EAAE;AAAA,MACd,gBAAgB,EAAE;AAAA,IACpB,EAAE;AAAA,EACN;AAAA,EAEA,wBAME;AACA,WAAO;AAAA,MACL,UAAU,KAAK,gBAAgB;AAAA,MAC/B,QAAQ,KAAK,cAAc;AAAA,MAC3B,aAAa,KAAK,mBAAmB;AAAA,MACrC,WAAW,KAAK,iBAAiB;AAAA,MACjC,UAAU,KAAK,gBAAgB;AAAA,IACjC;AAAA,EACF;AAAA;AAAA,EAIA,YAAe,IAAgB;AAC7B,SAAK,GAAG,IAAI,OAAO;AACnB,QAAI;AACF,YAAM,SAAS,GAAG;AAClB,WAAK,GAAG,IAAI,QAAQ;AACpB,aAAO;AAAA,IACT,SAAS,KAAK;AACZ,WAAK,GAAG,IAAI,UAAU;AACtB,YAAM;AAAA,IACR;AAAA,EACF;AAAA,EAEA,QAAc;AACZ,SAAK,GAAG,MAAM;AAAA,EAChB;AACF;",
|
|
4
|
+
"sourcesContent": ["/**\n * KiroGraph Database Layer\n * Wraps node-sqlite3-wasm for portability (no native bindings needed).\n */\n\nimport * as path from 'path';\nimport * as fs from 'fs';\nimport type { Node, Edge, FileRecord, NodeKind, Language, GraphStats, NodeContext, NodeMetrics, SearchOptions } from '../types';\nimport type { ArchPackage, ArchLayer, ArchPackageDep, ArchLayerDep, ArchCoupling } from '../architecture/types';\n\n// eslint-disable-next-line @typescript-eslint/no-require-imports\nconst { Database } = require('node-sqlite3-wasm');\n\nconst CURRENT_SCHEMA_VERSION = 1;\n\nexport class GraphDatabase {\n private db: any;\n private projectRoot: string;\n\n constructor(projectRoot: string) {\n this.projectRoot = projectRoot;\n const dbDir = path.join(projectRoot, '.kirograph');\n fs.mkdirSync(dbDir, { recursive: true });\n const dbPath = path.join(dbDir, 'kirograph.db');\n\n // \u2500\u2500 Pre-flight lock check \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\n // node-sqlite3-wasm calls process.abort() when the DB is locked, producing\n // a cryptic \"Aborted()\" with no context. Detect the lock file early and\n // throw a clean error instead so the global handler can surface it clearly.\n const lockPath = path.join(dbDir, 'kirograph.db.lock');\n if (fs.existsSync(lockPath)) {\n throw new Error(\n `Database is locked by another process (${lockPath} exists).\\n` +\n `Run: kirograph unlock\\n` +\n `Or delete the lock manually: ${lockPath}`\n );\n }\n\n this.db = new Database(dbPath);\n this.db.exec(`\n PRAGMA journal_mode=WAL;\n PRAGMA foreign_keys=ON;\n PRAGMA busy_timeout=120000;\n PRAGMA synchronous=NORMAL;\n PRAGMA cache_size=-64000;\n PRAGMA temp_store=MEMORY;\n PRAGMA mmap_size=268435456;\n `);\n this.applySchema();\n }\n\n private applySchema(): void {\n const schemaPath = path.join(__dirname, '../db/schema.sql');\n const sql = fs.readFileSync(schemaPath, 'utf8');\n this.db.exec(sql);\n this.runMigrations();\n }\n\n /**\n * Apply memory schema tables. Called when enableMemory is true.\n * Safe to call multiple times (CREATE IF NOT EXISTS).\n */\n applyMemorySchema(): void {\n const schemaPath = path.join(__dirname, '../db/memory-schema.sql');\n if (fs.existsSync(schemaPath)) {\n const sql = fs.readFileSync(schemaPath, 'utf8');\n this.db.exec(sql);\n }\n }\n\n /**\n * Apply docs schema tables. Called when enableDocs is true.\n * Safe to call multiple times (CREATE IF NOT EXISTS).\n */\n applyDocsSchema(): void {\n const schemaPath = path.join(__dirname, '../db/docs-schema.sql');\n if (fs.existsSync(schemaPath)) {\n const sql = fs.readFileSync(schemaPath, 'utf8');\n this.db.exec(sql);\n }\n }\n\n /**\n * Apply data schema tables. Called when enableData is true.\n * Safe to call multiple times (CREATE IF NOT EXISTS).\n */\n applyDataSchema(): void {\n const schemaPath = path.join(__dirname, '../db/data-schema.sql');\n if (fs.existsSync(schemaPath)) {\n const sql = fs.readFileSync(schemaPath, 'utf8');\n this.db.exec(sql);\n }\n // Migrate existing DBs: add columns introduced after initial release.\n const tryAlter = (stmt: string) => { try { this.db.run(stmt); } catch { /* already exists */ } };\n tryAlter('ALTER TABLE data_datasets ADD COLUMN metadata_json TEXT');\n }\n\n /**\n * Apply patterns schema tables. Called when enablePatterns is true.\n * Safe to call multiple times (CREATE IF NOT EXISTS).\n */\n applyPatternsSchema(): void {\n const schemaPath = path.join(__dirname, '../db/patterns-schema.sql');\n if (fs.existsSync(schemaPath)) {\n const sql = fs.readFileSync(schemaPath, 'utf8');\n this.db.exec(sql);\n }\n // Migrate existing DBs: add new columns introduced after initial release.\n const tryAlter = (stmt: string) => { try { this.db.run(stmt); } catch { /* already exists */ } };\n tryAlter('ALTER TABLE pattern_matches ADD COLUMN symbol_node_id TEXT');\n tryAlter('CREATE INDEX IF NOT EXISTS idx_pm_symbol ON pattern_matches(symbol_node_id)');\n }\n\n /**\n * Apply security schema tables. Called when enableSecurity is true.\n * Safe to call multiple times (CREATE IF NOT EXISTS).\n */\n applySecuritySchema(): void {\n const schemaPath = path.join(__dirname, '../db/security-schema.sql');\n if (fs.existsSync(schemaPath)) {\n const sql = fs.readFileSync(schemaPath, 'utf8');\n this.db.exec(sql);\n }\n // Migrate existing DBs: add new columns introduced after initial release.\n const tryAlter = (stmt: string) => { try { this.db.run(stmt); } catch { /* already exists */ } };\n tryAlter('ALTER TABLE sec_dependencies ADD COLUMN license TEXT');\n tryAlter('ALTER TABLE sec_dependencies ADD COLUMN latest_version TEXT');\n tryAlter('ALTER TABLE sec_dependencies ADD COLUMN latest_published INTEGER');\n tryAlter('ALTER TABLE sec_dependencies ADD COLUMN staleness_score REAL');\n tryAlter('ALTER TABLE sec_vulnerabilities ADD COLUMN epss_score REAL');\n tryAlter('ALTER TABLE sec_vulnerabilities ADD COLUMN epss_percentile REAL');\n tryAlter('ALTER TABLE sec_vulnerabilities ADD COLUMN epss_fetched_at INTEGER');\n tryAlter('CREATE INDEX IF NOT EXISTS idx_sec_deps_license ON sec_dependencies(license)');\n tryAlter('CREATE INDEX IF NOT EXISTS idx_sec_deps_staleness ON sec_dependencies(staleness_score)');\n tryAlter('CREATE INDEX IF NOT EXISTS idx_sec_vulns_epss ON sec_vulnerabilities(epss_score)');\n tryAlter('ALTER TABLE sec_vulnerabilities ADD COLUMN risk_score REAL');\n tryAlter('CREATE INDEX IF NOT EXISTS idx_sec_vulns_risk ON sec_vulnerabilities(risk_score)');\n tryAlter('ALTER TABLE sec_vulnerabilities ADD COLUMN first_detected_at INTEGER');\n tryAlter('ALTER TABLE sec_vulnerabilities ADD COLUMN fix_available_since INTEGER');\n tryAlter('ALTER TABLE sec_vulnerabilities ADD COLUMN suppressed_at INTEGER');\n tryAlter('ALTER TABLE sec_vulnerabilities ADD COLUMN remediated_at INTEGER');\n }\n\n /**\n * Apply wiki schema tables. Called when enableWiki is true.\n * Safe to call multiple times (CREATE IF NOT EXISTS).\n */\n applyWikiSchema(): void {\n const schemaPath = path.join(__dirname, '../db/wiki-schema.sql');\n if (fs.existsSync(schemaPath)) {\n const sql = fs.readFileSync(schemaPath, 'utf8');\n this.db.exec(sql);\n }\n }\n\n /**\n * Get the raw database handle (for MemoryDatabase).\n */\n getRawDb(): any {\n return this.db;\n }\n\n private runMigrations(): void {\n // Record initial schema version if not present\n const versionRow = this.db.get('SELECT version FROM schema_versions ORDER BY version DESC LIMIT 1');\n const currentVersion = versionRow ? versionRow.version : 0;\n\n if (currentVersion < CURRENT_SCHEMA_VERSION) {\n // Migration 1: schema.sql now includes all columns \u2014 nothing extra needed.\n // The schema CREATE IF NOT EXISTS statements handle initial setup.\n this.db.run('INSERT OR IGNORE INTO schema_versions (version, applied_at) VALUES (?, ?)',\n [CURRENT_SCHEMA_VERSION, Date.now()]);\n }\n\n // Add attempted_strategies column to unresolved_refs if not present.\n // SQLite throws if the column already exists, so we catch that error.\n try {\n this.db.run('ALTER TABLE unresolved_refs ADD COLUMN attempted_strategies TEXT');\n } catch {\n // Column already exists \u2014 nothing to do.\n }\n\n // Add confidence columns to edges if not present.\n try {\n this.db.run(\"ALTER TABLE edges ADD COLUMN confidence TEXT NOT NULL DEFAULT 'extracted'\");\n } catch {\n // Column already exists \u2014 nothing to do.\n }\n try {\n this.db.run('ALTER TABLE edges ADD COLUMN confidence_score REAL NOT NULL DEFAULT 1.0');\n } catch {\n // Column already exists \u2014 nothing to do.\n }\n }\n\n // \u2500\u2500 Files \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\n\n upsertFile(record: FileRecord): void {\n this.db.run(\n `INSERT OR REPLACE INTO files (path, content_hash, language, file_size, symbol_count, indexed_at)\n VALUES (?, ?, ?, ?, ?, ?)`,\n [record.path, record.contentHash, record.language, record.fileSize, record.symbolCount, record.indexedAt]\n );\n }\n\n getFile(filePath: string): FileRecord | null {\n const row = this.db.get('SELECT * FROM files WHERE path = ?', [filePath]);\n return row ? this.rowToFile(row) : null;\n }\n\n getAllFiles(): FileRecord[] {\n return this.db.all('SELECT * FROM files').map(this.rowToFile);\n }\n\n deleteFile(filePath: string): void {\n // Cascade deletes nodes (and their edges via FK)\n this.db.run('DELETE FROM nodes WHERE file_path = ?', [filePath]);\n this.db.run('DELETE FROM files WHERE path = ?', [filePath]);\n }\n\n private rowToFile(row: any): FileRecord {\n return {\n path: row.path,\n contentHash: row.content_hash,\n language: row.language as Language,\n fileSize: row.file_size,\n symbolCount: row.symbol_count,\n indexedAt: row.indexed_at,\n };\n }\n\n // \u2500\u2500 Nodes \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\n\n upsertNode(node: Node): void {\n this.db.run(\n `INSERT OR REPLACE INTO nodes\n (id, kind, name, qualified_name, file_path, language,\n start_line, end_line, start_column, end_column,\n docstring, signature, visibility,\n is_exported, is_async, is_static, is_abstract,\n decorators, type_parameters, updated_at)\n VALUES (?,?,?,?,?,?,?,?,?,?,?,?,?,?,?,?,?,?,?,?)`,\n [\n node.id, node.kind, node.name, node.qualifiedName, node.filePath, node.language,\n node.startLine, node.endLine, node.startColumn, node.endColumn,\n node.docstring ?? null, node.signature ?? null, node.visibility ?? null,\n node.isExported ? 1 : 0, node.isAsync ? 1 : 0,\n node.isStatic ? 1 : 0, node.isAbstract ? 1 : 0,\n node.decorators ? JSON.stringify(node.decorators) : null,\n node.typeParameters ? JSON.stringify(node.typeParameters) : null,\n node.updatedAt,\n ]\n );\n // Keep FTS in sync\n this.db.run(\n `INSERT OR REPLACE INTO nodes_fts (id, name, qualified_name, docstring, signature)\n VALUES (?, ?, ?, ?, ?)`,\n [node.id, node.name, node.qualifiedName, node.docstring ?? '', node.signature ?? '']\n );\n }\n\n getNode(id: string): Node | null {\n const row = this.db.get('SELECT * FROM nodes WHERE id = ?', [id]);\n return row ? this.rowToNode(row) : null;\n }\n\n getNodesByFile(filePath: string): Node[] {\n return this.db.all('SELECT * FROM nodes WHERE file_path = ?', [filePath]).map(this.rowToNode);\n }\n\n getNodesByKind(kind: Node['kind']): Node[] {\n return this.db.all('SELECT * FROM nodes WHERE kind = ?', [kind]).map(this.rowToNode);\n }\n\n findNodesByExactName(name: string, kinds?: NodeKind[], limit = 20): Node[] {\n if (kinds && kinds.length > 0) {\n const placeholders = kinds.map(() => '?').join(',');\n return this.db.all(\n `SELECT * FROM nodes WHERE name = ? AND kind IN (${placeholders}) LIMIT ?`,\n [name, ...kinds, limit]\n ).map(this.rowToNode);\n }\n return this.db.all(\n 'SELECT * FROM nodes WHERE name = ? LIMIT ?',\n [name, limit]\n ).map(this.rowToNode);\n }\n\n searchNodes(query: string, opts: SearchOptions = {}): Node[] {\n const { kinds, languages, limit = 20 } = opts;\n // Sanitize for FTS5: strip special chars and append wildcard.\n // Both the MATCH value and LIMIT are inlined (not bound via ?) because\n // node-sqlite3-wasm passes bound parameters through to FTS5's own query\n // parser before SQLite substitutes them, causing \"syntax error near ?\".\n const safe = query\n .replace(/\\b(AND|OR|NOT)\\b/g, ' ') // FTS5 boolean operators\n .replace(/['\"*()?\\-+^~:{}\\\\\\.\\/,]/g, ' ') // FTS5 special chars (incl. / and ,)\n .replace(/\\s+/g, ' ')\n .trim();\n if (!safe) return [];\n\n const ftsQuery = safe + '*';\n const safeLimit = Math.max(1, Math.floor(Number(limit)));\n\n const conditions: string[] = [];\n const params: any[] = [];\n\n if (kinds && kinds.length > 0) {\n conditions.push(`kind IN (${kinds.map(() => '?').join(',')})`);\n params.push(...kinds);\n }\n if (languages && languages.length > 0) {\n conditions.push(`language IN (${languages.map(() => '?').join(',')})`);\n params.push(...languages);\n }\n\n const where = conditions.length > 0 ? `AND ${conditions.join(' AND ')}` : '';\n\n return this.db.all(\n `SELECT * FROM nodes\n WHERE id IN (SELECT rowid FROM nodes_fts WHERE nodes_fts MATCH '${ftsQuery}')\n ${where}\n LIMIT ${safeLimit}`,\n params\n ).map(this.rowToNode);\n }\n\n searchNodesByName(name: string, opts: SearchOptions = {}): Node[] {\n const { kinds, languages, limit = 20 } = opts;\n const pattern = `%${name}%`;\n const conditions: string[] = ['name LIKE ?'];\n const params: any[] = [pattern];\n\n if (kinds && kinds.length > 0) {\n conditions.push(`kind IN (${kinds.map(() => '?').join(',')})`);\n params.push(...kinds);\n }\n if (languages && languages.length > 0) {\n conditions.push(`language IN (${languages.map(() => '?').join(',')})`);\n params.push(...languages);\n }\n params.push(limit);\n\n return this.db.all(\n `SELECT * FROM nodes WHERE ${conditions.join(' AND ')} LIMIT ?`,\n params\n ).map(this.rowToNode);\n }\n\n deleteNodesByFile(filePath: string): void {\n const ids = this.db.all('SELECT id FROM nodes WHERE file_path = ?', [filePath]).map((r: any) => r.id);\n if (ids.length === 0) return;\n const placeholders = ids.map(() => '?').join(',');\n this.db.run(`DELETE FROM edges WHERE source IN (${placeholders}) OR target IN (${placeholders})`, [...ids, ...ids]);\n this.db.run(`DELETE FROM nodes_fts WHERE id IN (${placeholders})`, ids);\n this.db.run(`DELETE FROM nodes WHERE file_path = ?`, [filePath]);\n }\n\n private rowToNode(row: any): Node {\n return {\n id: row.id,\n kind: row.kind as NodeKind,\n name: row.name,\n qualifiedName: row.qualified_name,\n filePath: row.file_path,\n language: row.language as Language,\n startLine: row.start_line,\n endLine: row.end_line,\n startColumn: row.start_column,\n endColumn: row.end_column,\n docstring: row.docstring ?? undefined,\n signature: row.signature ?? undefined,\n visibility: row.visibility ?? undefined,\n isExported: row.is_exported === 1,\n isAsync: row.is_async === 1,\n isStatic: row.is_static === 1,\n isAbstract: row.is_abstract === 1,\n decorators: row.decorators ? JSON.parse(row.decorators) : undefined,\n typeParameters: row.type_parameters ? JSON.parse(row.type_parameters) : undefined,\n updatedAt: row.updated_at,\n };\n }\n\n // \u2500\u2500 Edges \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\n\n insertEdge(edge: Edge): void {\n this.db.run(\n `INSERT OR IGNORE INTO edges (source, target, kind, metadata, line, column, confidence, confidence_score)\n VALUES (?, ?, ?, ?, ?, ?, ?, ?)`,\n [edge.source, edge.target, edge.kind, edge.metadata ? JSON.stringify(edge.metadata) : null, edge.line ?? null, edge.column ?? null, edge.confidence ?? 'extracted', edge.confidenceScore ?? 1.0]\n );\n }\n\n getCallers(nodeId: string, limit = 30): Node[] {\n return this.db.all(\n `SELECT n.* FROM nodes n\n JOIN edges e ON e.source = n.id\n WHERE e.target = ? AND e.kind = 'calls'\n LIMIT ?`,\n [nodeId, limit]\n ).map(this.rowToNode);\n }\n\n getCallees(nodeId: string, limit = 30): Node[] {\n return this.db.all(\n `SELECT n.* FROM nodes n\n JOIN edges e ON e.target = n.id\n WHERE e.source = ? AND e.kind = 'calls'\n LIMIT ?`,\n [nodeId, limit]\n ).map(this.rowToNode);\n }\n\n getImpactRadius(nodeId: string, depth = 2): Node[] {\n // BFS over 'calls' and 'imports' edges (dependents)\n const visited = new Set<string>([nodeId]);\n let frontier = [nodeId];\n for (let d = 0; d < depth; d++) {\n if (frontier.length === 0) break;\n const placeholders = frontier.map(() => '?').join(',');\n const rows = this.db.all(\n `SELECT DISTINCT source FROM edges WHERE target IN (${placeholders}) AND kind IN ('calls','imports')`,\n frontier\n );\n frontier = [];\n for (const row of rows) {\n if (!visited.has(row.source)) {\n visited.add(row.source);\n frontier.push(row.source);\n }\n }\n }\n visited.delete(nodeId);\n if (visited.size === 0) return [];\n const ids = [...visited];\n const placeholders = ids.map(() => '?').join(',');\n return this.db.all(`SELECT * FROM nodes WHERE id IN (${placeholders})`, ids).map(this.rowToNode);\n }\n\n getEdgesForNodes(nodeIds: string[]): Edge[] {\n if (nodeIds.length === 0) return [];\n const placeholders = nodeIds.map(() => '?').join(',');\n return this.db.all(\n `SELECT * FROM edges WHERE source IN (${placeholders}) OR target IN (${placeholders})`,\n [...nodeIds, ...nodeIds]\n ).map((row: any) => ({\n source: row.source,\n target: row.target,\n kind: row.kind,\n metadata: row.metadata ? JSON.parse(row.metadata) : undefined,\n line: row.line ?? undefined,\n column: row.column ?? undefined,\n }));\n }\n\n /**\n * Find files that import (depend on) the given file path.\n * Used for affected-test traversal.\n */\n getDependentFiles(filePath: string): string[] {\n // Find nodes in the target file\n const targetNodes = this.db.all('SELECT id FROM nodes WHERE file_path = ?', [filePath]);\n if (targetNodes.length === 0) return [];\n const ids = targetNodes.map((r: any) => r.id);\n const placeholders = ids.map(() => '?').join(',');\n // Find source nodes that call/import these target nodes\n const rows = this.db.all(\n `SELECT DISTINCT n.file_path FROM nodes n\n JOIN edges e ON e.source = n.id\n WHERE e.target IN (${placeholders}) AND e.kind IN ('calls','imports')\n AND n.file_path != ?`,\n [...ids, filePath]\n );\n return rows.map((r: any) => r.file_path);\n }\n\n // \u2500\u2500 Unresolved References \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\n\n insertUnresolvedRef(sourceId: string, refName: string, refKind: string, filePath: string, line?: number, column?: number): void {\n this.db.run(\n `INSERT INTO unresolved_refs (source_id, ref_name, ref_kind, file_path, line, column)\n VALUES (?, ?, ?, ?, ?, ?)`,\n [sourceId, refName, refKind, filePath, line ?? null, column ?? null]\n );\n }\n\n deleteUnresolvedRefsByFile(filePath: string): void {\n this.db.run('DELETE FROM unresolved_refs WHERE file_path = ?', [filePath]);\n }\n\n /**\n * Resolve pending references:\n * - refKind='function': 3-strategy name matching \u2192 'calls' edge\n * - refKind='import': path-based resolution \u2192 'imports' edge\n *\n * Returns the number of edges successfully created.\n */\n resolveUnresolvedRefs(): number {\n const refs = this.db.all('SELECT * FROM unresolved_refs');\n let resolved = 0;\n\n for (const ref of refs) {\n const { id: refId, source_id: sourceId, ref_name: refName, ref_kind: refKind, file_path: filePath, line, column } = ref;\n\n if (refKind === 'function') {\n // Strategy 1: exact name match\n let target = this.db.get('SELECT id FROM nodes WHERE name = ? LIMIT 1', [refName]);\n let confidence: 'extracted' | 'inferred' | 'ambiguous' = 'inferred';\n let confidenceScore = 1.0;\n\n // Strategy 2: qualified name suffix\n if (!target) {\n target = this.db.get(\n `SELECT id FROM nodes WHERE qualified_name LIKE ? LIMIT 1`,\n [`%::${refName}`]\n );\n }\n\n // Strategy 3: case-insensitive\n if (!target) {\n target = this.db.get(\n 'SELECT id FROM nodes WHERE lower(name) = lower(?) LIMIT 1',\n [refName]\n );\n // Case-insensitive match is less certain\n if (target) confidenceScore = 0.8;\n }\n\n // Check if there are multiple candidates (ambiguous)\n if (target) {\n const candidateCount = this.db.get('SELECT COUNT(*) as cnt FROM nodes WHERE name = ?', [refName]);\n if (candidateCount && candidateCount.cnt > 1) {\n confidence = 'ambiguous';\n confidenceScore = 1.0 / candidateCount.cnt;\n }\n }\n\n if (target) {\n this.insertEdge({ source: sourceId, target: target.id, kind: 'calls', line: line ?? undefined, column: column ?? undefined, confidence, confidenceScore });\n this.db.run('DELETE FROM unresolved_refs WHERE id = ?', [refId]);\n resolved++;\n }\n } else if (refKind === 'import') {\n // Resolve import path to an indexed file\n const targetFileNode = this.resolveImportPath(refName, filePath);\n if (targetFileNode) {\n this.insertEdge({ source: sourceId, target: targetFileNode, kind: 'imports', line: line ?? undefined, column: column ?? undefined, confidence: 'inferred', confidenceScore: 1.0 });\n this.db.run('DELETE FROM unresolved_refs WHERE id = ?', [refId]);\n resolved++;\n }\n }\n }\n\n return resolved;\n }\n\n /** @deprecated Use resolveUnresolvedRefs() */\n resolveCallEdges(): number {\n return this.resolveUnresolvedRefs();\n }\n\n /**\n * Resolve a module import path to the ID of the first node in the target file.\n * Returns null if no indexed file matches.\n */\n private resolveImportPath(importPath: string, sourceFilePath: string): string | null {\n // Only resolve relative imports\n if (!importPath.startsWith('.')) return null;\n\n const sourceDir = sourceFilePath.replace(/[^/]+$/, '');\n // Normalize the relative path\n const segments = (sourceDir + importPath).split('/');\n const normalized: string[] = [];\n for (const seg of segments) {\n if (seg === '..') normalized.pop();\n else if (seg !== '.') normalized.push(seg);\n }\n const basePath = normalized.join('/');\n\n // Try exact match, then with common extensions\n const candidates = [\n basePath,\n basePath + '.ts',\n basePath + '.tsx',\n basePath + '.js',\n basePath + '.jsx',\n basePath + '/index.ts',\n basePath + '/index.tsx',\n basePath + '/index.js',\n ];\n\n for (const candidate of candidates) {\n const row = this.db.get('SELECT id FROM nodes WHERE file_path = ? LIMIT 1', [candidate]);\n if (row) return row.id;\n }\n\n return null;\n }\n\n // \u2500\u2500 Node Context & Metrics \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\n\n getNodeContext(nodeId: string): NodeContext | null {\n const node = this.getNode(nodeId);\n if (!node) return null;\n\n const ancestors = this.db.all(\n `SELECT n.* FROM nodes n\n JOIN edges e ON e.target = n.id\n WHERE e.source = ? AND e.kind = 'contains'`,\n [nodeId]\n ).map(this.rowToNode);\n\n const children = this.db.all(\n `SELECT n.* FROM nodes n\n JOIN edges e ON e.source = n.id\n WHERE e.target = n.id AND e.source = ? AND e.kind = 'contains'`,\n [nodeId]\n ).map(this.rowToNode);\n\n const callers = this.getCallers(nodeId, 20);\n const callees = this.getCallees(nodeId, 20);\n\n return { node, ancestors, children, callers, callees };\n }\n\n getNodeMetrics(nodeId: string): NodeMetrics {\n const incomingEdgeCount = (this.db.get('SELECT COUNT(*) as c FROM edges WHERE target = ?', [nodeId])?.c ?? 0);\n const outgoingEdgeCount = (this.db.get('SELECT COUNT(*) as c FROM edges WHERE source = ?', [nodeId])?.c ?? 0);\n const callCount = (this.db.get(`SELECT COUNT(*) as c FROM edges WHERE source = ? AND kind = 'calls'`, [nodeId])?.c ?? 0);\n const callerCount = (this.db.get(`SELECT COUNT(*) as c FROM edges WHERE target = ? AND kind = 'calls'`, [nodeId])?.c ?? 0);\n const childCount = (this.db.get(`SELECT COUNT(*) as c FROM edges WHERE source = ? AND kind = 'contains'`, [nodeId])?.c ?? 0);\n return { incomingEdgeCount, outgoingEdgeCount, callCount, callerCount, childCount };\n }\n\n // \u2500\u2500 Graph Analysis \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\n\n /**\n * Find symbols with no incoming edges (potential dead code).\n * Excludes exported symbols since they may be consumed externally.\n */\n findDeadCode(limit = 50): Node[] {\n return this.db.all(\n `SELECT * FROM nodes\n WHERE kind IN ('function','method','class')\n AND is_exported = 0\n AND id NOT IN (SELECT DISTINCT target FROM edges)\n LIMIT ?`,\n [limit]\n ).map(this.rowToNode);\n }\n\n /**\n * Find circular import dependencies using DFS over import edges.\n * Returns arrays of file paths forming cycles.\n */\n findCircularDependencies(): string[][] {\n // Build adjacency map: file \u2192 imported files\n const rows = this.db.all(\n `SELECT DISTINCT n1.file_path as src, n2.file_path as dst\n FROM edges e\n JOIN nodes n1 ON n1.id = e.source\n JOIN nodes n2 ON n2.id = e.target\n WHERE e.kind = 'imports' AND n1.file_path != n2.file_path`\n );\n\n const adj = new Map<string, Set<string>>();\n for (const row of rows) {\n if (!adj.has(row.src)) adj.set(row.src, new Set());\n adj.get(row.src)!.add(row.dst);\n }\n\n const cycles: string[][] = [];\n const visited = new Set<string>();\n const pathSet = new Set<string>();\n const pathArr: string[] = [];\n\n function dfs(node: string): void {\n if (pathSet.has(node)) {\n const cycleStart = pathArr.indexOf(node);\n cycles.push(pathArr.slice(cycleStart).concat(node));\n return;\n }\n if (visited.has(node)) return;\n visited.add(node);\n pathSet.add(node);\n pathArr.push(node);\n for (const neighbor of adj.get(node) ?? []) {\n dfs(neighbor);\n }\n pathArr.pop();\n pathSet.delete(node);\n }\n\n for (const node of adj.keys()) {\n if (!visited.has(node)) dfs(node);\n }\n\n return cycles;\n }\n\n /**\n * Find the shortest path between two nodes via directed BFS (outgoing edges only).\n */\n findPath(fromId: string, toId: string, maxDepth = 10): Node[] {\n if (fromId === toId) {\n const node = this.getNode(fromId);\n return node ? [node] : [];\n }\n\n const prev = new Map<string, string>();\n const queue: string[] = [fromId];\n const visited = new Set<string>([fromId]);\n let depth = 0;\n\n outer: while (queue.length > 0 && depth < maxDepth) {\n const levelSize = queue.length;\n depth++;\n for (let i = 0; i < levelSize; i++) {\n const current = queue.shift()!;\n // Directed: only follow outgoing edges\n const rows = this.db.all(\n `SELECT DISTINCT target as next FROM edges WHERE source = ?`,\n [current]\n );\n for (const row of rows) {\n if (!visited.has(row.next)) {\n visited.add(row.next);\n prev.set(row.next, current);\n if (row.next === toId) break outer;\n queue.push(row.next);\n }\n }\n }\n }\n\n if (!prev.has(toId)) return [];\n\n // Reconstruct path\n const pathIds: string[] = [];\n let cur: string | undefined = toId;\n while (cur !== undefined) {\n pathIds.unshift(cur);\n cur = prev.get(cur);\n }\n\n const result: Node[] = [];\n for (const id of pathIds) {\n const node = this.getNode(id);\n if (node) result.push(node);\n }\n return result;\n }\n\n /**\n * Traverse type hierarchy via 'extends' and 'implements' edges.\n * direction 'up' = base types, 'down' = derived types, 'both' = all.\n */\n getTypeHierarchy(nodeId: string, direction: 'up' | 'down' | 'both' = 'both'): Node[] {\n const visited = new Set<string>([nodeId]);\n const frontier = [nodeId];\n const result: Node[] = [];\n\n while (frontier.length > 0) {\n const current = frontier.shift()!;\n let rows: any[] = [];\n\n if (direction === 'up' || direction === 'both') {\n // current extends/implements something \u2192 go up\n const up = this.db.all(\n `SELECT target as id FROM edges WHERE source = ? AND kind IN ('extends','implements')`,\n [current]\n );\n rows = rows.concat(up);\n }\n if (direction === 'down' || direction === 'both') {\n // something extends/implements current \u2192 go down\n const down = this.db.all(\n `SELECT source as id FROM edges WHERE target = ? AND kind IN ('extends','implements')`,\n [current]\n );\n rows = rows.concat(down);\n }\n\n for (const row of rows) {\n if (!visited.has(row.id)) {\n visited.add(row.id);\n frontier.push(row.id);\n const node = this.getNode(row.id);\n if (node) result.push(node);\n }\n }\n }\n\n return result;\n }\n\n // \u2500\u2500 Stats \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\n\n getEmbeddingCount(): number {\n try {\n const row = this.db.get('SELECT COUNT(*) as c FROM vectors');\n return row ? row.c : 0;\n } catch {\n return 0;\n }\n }\n\n storeEmbedding(nodeId: string, embedding: Float32Array, model: string): void {\n const buf = Buffer.from(embedding.buffer);\n this.db.run(\n `INSERT OR REPLACE INTO vectors (node_id, embedding, model, created_at) VALUES (?, ?, ?, ?)`,\n [nodeId, buf, model, Date.now()]\n );\n }\n\n getEmbeddedNodeIds(): string[] {\n return this.db.all('SELECT node_id FROM vectors').map((r: any) => r.node_id);\n }\n\n getAllEmbeddings(): Array<{ nodeId: string; embedding: Float32Array }> {\n const rows = this.db.all('SELECT node_id, embedding FROM vectors');\n return rows.map((r: any) => ({\n nodeId: r.node_id as string,\n embedding: new Float32Array(\n (r.embedding as Buffer).buffer,\n (r.embedding as Buffer).byteOffset,\n (r.embedding as Buffer).byteLength / 4\n ),\n }));\n }\n\n getAllNodes(): import('../types').Node[] {\n return this.db.all('SELECT * FROM nodes').map(this.rowToNode);\n }\n\n /**\n * Returns embeddable nodes in pages for memory-efficient streaming.\n * `kinds` filters by node kind (e.g. ['function','method','class']).\n * Returns an empty array when offset >= total count.\n */\n getEmbeddableNodesPaged(kinds: string[], limit: number, offset: number): import('../types').Node[] {\n if (kinds.length === 0) return [];\n const placeholders = kinds.map(() => '?').join(',');\n return this.db.all(\n `SELECT * FROM nodes WHERE kind IN (${placeholders}) LIMIT ? OFFSET ?`,\n [...kinds, limit, offset]\n ).map(this.rowToNode);\n }\n\n /** Count of nodes whose kind is in the provided list. */\n countEmbeddableNodes(kinds: string[]): number {\n if (kinds.length === 0) return 0;\n const placeholders = kinds.map(() => '?').join(',');\n const row = this.db.get(`SELECT COUNT(*) as c FROM nodes WHERE kind IN (${placeholders})`, kinds);\n return row?.c ?? 0;\n }\n\n getAllEdges(): Edge[] {\n return this.db.all('SELECT source, target, kind FROM edges').map((row: any) => ({\n source: row.source,\n target: row.target,\n kind: row.kind,\n }));\n }\n\n /**\n * Find the top-N most-connected nodes by total edge degree (in + out).\n * Excludes 'contains' edges (structural nesting, not semantic connections).\n */\n findHotspots(limit = 20): Array<Node & { degree: number; inDegree: number; outDegree: number }> {\n const rows = this.db.all(\n `SELECT n.*,\n (SELECT COUNT(*) FROM edges WHERE target = n.id AND kind != 'contains') AS in_degree,\n (SELECT COUNT(*) FROM edges WHERE source = n.id AND kind != 'contains') AS out_degree,\n (SELECT COUNT(*) FROM edges WHERE (source = n.id OR target = n.id) AND kind != 'contains') AS degree\n FROM nodes n\n ORDER BY degree DESC\n LIMIT ?`,\n [limit]\n );\n return rows.map((row: any) => ({\n ...this.rowToNode(row),\n degree: row.degree as number,\n inDegree: row.in_degree as number,\n outDegree: row.out_degree as number,\n }));\n }\n\n /**\n * Find surprising cross-file connections: direct edges between nodes in\n * structurally distant files. Scored by path distance \u00D7 edge-kind weight.\n */\n findSurprisingConnections(limit = 20): Array<{ source: Node; target: Node; kind: string; score: number }> {\n const KIND_WEIGHT: Record<string, number> = {\n calls: 1.0, references: 0.8, type_of: 0.7, returns: 0.6,\n decorates: 0.6, extends: 0.5, implements: 0.5,\n };\n\n const rows: Array<{ source: string; target: string; kind: string; source_file: string; target_file: string }> =\n this.db.all(\n `SELECT e.source, e.target, e.kind,\n ns.file_path AS source_file, nt.file_path AS target_file\n FROM edges e\n JOIN nodes ns ON ns.id = e.source\n JOIN nodes nt ON nt.id = e.target\n WHERE ns.file_path != nt.file_path\n AND e.kind NOT IN ('contains', 'import', 'imports')\n LIMIT 5000`\n );\n\n // Score: path distance \u00D7 kind weight\n const scored = rows.map(row => {\n const srcDirs = row.source_file.split('/').slice(0, -1);\n const tgtDirs = row.target_file.split('/').slice(0, -1);\n let common = 0;\n for (let i = 0; i < Math.min(srcDirs.length, tgtDirs.length); i++) {\n if (srcDirs[i] === tgtDirs[i]) common++;\n else break;\n }\n const maxDirs = Math.max(srcDirs.length, tgtDirs.length, 1);\n const pathSimilarity = common / maxDirs;\n const kindWeight = KIND_WEIGHT[row.kind] ?? 0.4;\n return { ...row, score: (1 - pathSimilarity) * kindWeight };\n });\n\n // Sort desc, deduplicate by source+target+kind\n scored.sort((a, b) => b.score - a.score);\n const seen = new Set<string>();\n const top: typeof scored = [];\n for (const row of scored) {\n const key = `${row.source}|${row.target}|${row.kind}`;\n if (!seen.has(key)) {\n seen.add(key);\n top.push(row);\n if (top.length >= limit) break;\n }\n }\n\n const result: Array<{ source: Node; target: Node; kind: string; score: number }> = [];\n for (const row of top) {\n const src = this.getNode(row.source);\n const tgt = this.getNode(row.target);\n if (src && tgt) result.push({ source: src, target: tgt, kind: row.kind, score: row.score });\n }\n return result;\n }\n\n getStats(): GraphStats {\n const files = this.db.get('SELECT COUNT(*) as c FROM files').c;\n const nodes = this.db.get('SELECT COUNT(*) as c FROM nodes').c;\n const edges = this.db.get('SELECT COUNT(*) as c FROM edges').c;\n const kindRows = this.db.all('SELECT kind, COUNT(*) as c FROM nodes GROUP BY kind');\n const nodesByKind: Record<string, number> = {};\n for (const row of kindRows) nodesByKind[row.kind] = row.c;\n const langRows = this.db.all('SELECT language, COUNT(*) as c FROM files GROUP BY language');\n const filesByLanguage: Record<string, number> = {};\n for (const row of langRows) filesByLanguage[row.language] = row.c;\n const dbPath = path.join(this.projectRoot, '.kirograph', 'kirograph.db');\n let dbSizeBytes = 0;\n try { dbSizeBytes = fs.statSync(dbPath).size; } catch { /* ignore */ }\n const embeddingCount = this.getEmbeddingCount();\n return { files, nodes, edges, nodesByKind, filesByLanguage, dbSizeBytes, embeddingCount, embeddingsEnabled: false, embeddingModel: '', useVecIndex: false, semanticEngine: 'cosine' as const, vecIndexCount: 0, engineFallback: null, embeddableNodeCount: 0, frameworks: [], architectureEnabled: false };\n }\n\n // \u2500\u2500 Architecture \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\n\n clearArchitecture(): void {\n this.db.run('DELETE FROM arch_coupling');\n this.db.run('DELETE FROM arch_layer_deps');\n this.db.run('DELETE FROM arch_package_deps');\n this.db.run('DELETE FROM arch_file_layers');\n this.db.run('DELETE FROM arch_file_packages');\n this.db.run('DELETE FROM arch_layers');\n this.db.run('DELETE FROM arch_packages');\n }\n\n upsertArchPackage(pkg: ArchPackage): void {\n this.db.run(\n `INSERT OR REPLACE INTO arch_packages\n (id, name, path, source, language, manifest_path, version, external_deps, metadata, updated_at)\n VALUES (?,?,?,?,?,?,?,?,?,?)`,\n [\n pkg.id, pkg.name, pkg.path, pkg.source,\n pkg.language ?? null, pkg.manifestPath ?? null, pkg.version ?? null,\n pkg.externalDeps ? JSON.stringify(pkg.externalDeps) : null,\n pkg.metadata ? JSON.stringify(pkg.metadata) : null,\n pkg.updatedAt,\n ]\n );\n }\n\n upsertArchLayer(layer: ArchLayer): void {\n this.db.run(\n `INSERT OR REPLACE INTO arch_layers (id, name, source, patterns, metadata, updated_at)\n VALUES (?,?,?,?,?,?)`,\n [\n layer.id, layer.name, layer.source,\n JSON.stringify(layer.patterns),\n layer.metadata ? JSON.stringify(layer.metadata) : null,\n layer.updatedAt,\n ]\n );\n }\n\n upsertArchFilePackage(filePath: string, packageId: string): void {\n this.db.run(\n 'INSERT OR IGNORE INTO arch_file_packages (file_path, package_id) VALUES (?,?)',\n [filePath, packageId]\n );\n }\n\n upsertArchFileLayer(filePath: string, layerId: string, confidence: number, matchedPattern: string): void {\n this.db.run(\n `INSERT OR REPLACE INTO arch_file_layers (file_path, layer_id, confidence, matched_pattern)\n VALUES (?,?,?,?)`,\n [filePath, layerId, confidence, matchedPattern]\n );\n }\n\n upsertArchPackageDep(sourcePkg: string, targetPkg: string, depCount: number, files?: Array<{ from: string; to: string }>): void {\n this.db.run(\n `INSERT OR REPLACE INTO arch_package_deps (source_pkg, target_pkg, dep_count, files)\n VALUES (?,?,?,?)`,\n [sourcePkg, targetPkg, depCount, files ? JSON.stringify(files) : null]\n );\n }\n\n upsertArchLayerDep(sourceLayer: string, targetLayer: string, depCount: number): void {\n this.db.run(\n `INSERT OR REPLACE INTO arch_layer_deps (source_layer, target_layer, dep_count)\n VALUES (?,?,?)`,\n [sourceLayer, targetLayer, depCount]\n );\n }\n\n upsertArchCoupling(coupling: ArchCoupling): void {\n this.db.run(\n `INSERT OR REPLACE INTO arch_coupling (package_id, afferent, efferent, instability, updated_at)\n VALUES (?,?,?,?,?)`,\n [coupling.packageId, coupling.afferent, coupling.efferent, coupling.instability, coupling.updatedAt]\n );\n }\n\n getArchPackages(): ArchPackage[] {\n return this.db.all('SELECT * FROM arch_packages').map((r: any): ArchPackage => ({\n id: r.id,\n name: r.name,\n path: r.path,\n source: r.source,\n language: r.language ?? undefined,\n manifestPath: r.manifest_path ?? undefined,\n version: r.version ?? undefined,\n externalDeps: r.external_deps ? JSON.parse(r.external_deps) : undefined,\n metadata: r.metadata ? JSON.parse(r.metadata) : undefined,\n updatedAt: r.updated_at,\n }));\n }\n\n getArchLayers(): ArchLayer[] {\n return this.db.all('SELECT * FROM arch_layers').map((r: any): ArchLayer => ({\n id: r.id,\n name: r.name,\n source: r.source,\n patterns: JSON.parse(r.patterns),\n metadata: r.metadata ? JSON.parse(r.metadata) : undefined,\n updatedAt: r.updated_at,\n }));\n }\n\n getArchPackageDeps(): ArchPackageDep[] {\n return this.db.all('SELECT * FROM arch_package_deps').map((r: any): ArchPackageDep => ({\n sourcePkg: r.source_pkg,\n targetPkg: r.target_pkg,\n depCount: r.dep_count,\n files: r.files ? JSON.parse(r.files) : undefined,\n }));\n }\n\n getArchLayerDeps(): ArchLayerDep[] {\n return this.db.all('SELECT * FROM arch_layer_deps').map((r: any): ArchLayerDep => ({\n sourceLayer: r.source_layer,\n targetLayer: r.target_layer,\n depCount: r.dep_count,\n }));\n }\n\n getArchCoupling(): ArchCoupling[] {\n return this.db.all('SELECT * FROM arch_coupling').map((r: any): ArchCoupling => ({\n packageId: r.package_id,\n afferent: r.afferent,\n efferent: r.efferent,\n instability: r.instability,\n updatedAt: r.updated_at,\n }));\n }\n\n getArchStats(): { packages: number; layers: number; packageDeps: number } {\n return {\n packages: this.db.get('SELECT COUNT(*) as c FROM arch_packages')?.c ?? 0,\n layers: this.db.get('SELECT COUNT(*) as c FROM arch_layers')?.c ?? 0,\n packageDeps: this.db.get('SELECT COUNT(*) as c FROM arch_package_deps')?.c ?? 0,\n };\n }\n\n /**\n * Return file-to-file import relationships by joining edges + nodes.\n * Used by ArchitectureAnalyzer to roll up package-level dependencies.\n */\n getFileImportPairs(): Array<{ sourceFile: string; targetFile: string }> {\n return this.db.all(\n `SELECT DISTINCT n1.file_path as source_file, n2.file_path as target_file\n FROM edges e\n JOIN nodes n1 ON n1.id = e.source\n JOIN nodes n2 ON n2.id = e.target\n WHERE e.kind = 'imports' AND n1.file_path != n2.file_path`\n ).map((r: any) => ({ sourceFile: r.source_file, targetFile: r.target_file }));\n }\n\n getArchFilePackages(): Array<{ filePath: string; packageId: string }> {\n return this.db.all('SELECT file_path, package_id FROM arch_file_packages')\n .map((r: any) => ({ filePath: r.file_path, packageId: r.package_id }));\n }\n\n getArchFileLayers(): Array<{ filePath: string; layerId: string; confidence: number; matchedPattern: string }> {\n return this.db.all('SELECT file_path, layer_id, confidence, matched_pattern FROM arch_file_layers')\n .map((r: any) => ({\n filePath: r.file_path,\n layerId: r.layer_id,\n confidence: r.confidence,\n matchedPattern: r.matched_pattern,\n }));\n }\n\n getArchitectureResult(): {\n packages: ArchPackage[];\n layers: ArchLayer[];\n packageDeps: ArchPackageDep[];\n layerDeps: ArchLayerDep[];\n coupling: ArchCoupling[];\n } {\n return {\n packages: this.getArchPackages(),\n layers: this.getArchLayers(),\n packageDeps: this.getArchPackageDeps(),\n layerDeps: this.getArchLayerDeps(),\n coupling: this.getArchCoupling(),\n };\n }\n\n // \u2500\u2500 Transactions \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\n\n transaction<T>(fn: () => T): T {\n this.db.run('BEGIN');\n try {\n const result = fn();\n this.db.run('COMMIT');\n return result;\n } catch (err) {\n this.db.run('ROLLBACK');\n throw err;\n }\n }\n\n close(): void {\n this.db.close();\n }\n}\n"],
|
|
5
|
+
"mappings": ";;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAKA,WAAsB;AACtB,SAAoB;AAKpB,MAAM,EAAE,SAAS,IAAI,QAAQ,mBAAmB;AAEhD,MAAM,yBAAyB;AAExB,MAAM,cAAc;AAAA,EAIzB,YAAY,aAAqB;AAC/B,SAAK,cAAc;AACnB,UAAM,QAAQ,KAAK,KAAK,aAAa,YAAY;AACjD,OAAG,UAAU,OAAO,EAAE,WAAW,KAAK,CAAC;AACvC,UAAM,SAAS,KAAK,KAAK,OAAO,cAAc;AAM9C,UAAM,WAAW,KAAK,KAAK,OAAO,mBAAmB;AACrD,QAAI,GAAG,WAAW,QAAQ,GAAG;AAC3B,YAAM,IAAI;AAAA,QACR,0CAA0C,QAAQ;AAAA;AAAA,+BAElB,QAAQ;AAAA,MAC1C;AAAA,IACF;AAEA,SAAK,KAAK,IAAI,SAAS,MAAM;AAC7B,SAAK,GAAG,KAAK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,KAQZ;AACD,SAAK,YAAY;AAAA,EACnB;AAAA,EAEQ,cAAoB;AAC1B,UAAM,aAAa,KAAK,KAAK,WAAW,kBAAkB;AAC1D,UAAM,MAAM,GAAG,aAAa,YAAY,MAAM;AAC9C,SAAK,GAAG,KAAK,GAAG;AAChB,SAAK,cAAc;AAAA,EACrB;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,oBAA0B;AACxB,UAAM,aAAa,KAAK,KAAK,WAAW,yBAAyB;AACjE,QAAI,GAAG,WAAW,UAAU,GAAG;AAC7B,YAAM,MAAM,GAAG,aAAa,YAAY,MAAM;AAC9C,WAAK,GAAG,KAAK,GAAG;AAAA,IAClB;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,kBAAwB;AACtB,UAAM,aAAa,KAAK,KAAK,WAAW,uBAAuB;AAC/D,QAAI,GAAG,WAAW,UAAU,GAAG;AAC7B,YAAM,MAAM,GAAG,aAAa,YAAY,MAAM;AAC9C,WAAK,GAAG,KAAK,GAAG;AAAA,IAClB;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,kBAAwB;AACtB,UAAM,aAAa,KAAK,KAAK,WAAW,uBAAuB;AAC/D,QAAI,GAAG,WAAW,UAAU,GAAG;AAC7B,YAAM,MAAM,GAAG,aAAa,YAAY,MAAM;AAC9C,WAAK,GAAG,KAAK,GAAG;AAAA,IAClB;AAEA,UAAM,WAAW,CAAC,SAAiB;AAAE,UAAI;AAAE,aAAK,GAAG,IAAI,IAAI;AAAA,MAAG,QAAQ;AAAA,MAAuB;AAAA,IAAE;AAC/F,aAAS,yDAAyD;AAAA,EACpE;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,sBAA4B;AAC1B,UAAM,aAAa,KAAK,KAAK,WAAW,2BAA2B;AACnE,QAAI,GAAG,WAAW,UAAU,GAAG;AAC7B,YAAM,MAAM,GAAG,aAAa,YAAY,MAAM;AAC9C,WAAK,GAAG,KAAK,GAAG;AAAA,IAClB;AAEA,UAAM,WAAW,CAAC,SAAiB;AAAE,UAAI;AAAE,aAAK,GAAG,IAAI,IAAI;AAAA,MAAG,QAAQ;AAAA,MAAuB;AAAA,IAAE;AAC/F,aAAS,4DAA4D;AACrE,aAAS,6EAA6E;AAAA,EACxF;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,sBAA4B;AAC1B,UAAM,aAAa,KAAK,KAAK,WAAW,2BAA2B;AACnE,QAAI,GAAG,WAAW,UAAU,GAAG;AAC7B,YAAM,MAAM,GAAG,aAAa,YAAY,MAAM;AAC9C,WAAK,GAAG,KAAK,GAAG;AAAA,IAClB;AAEA,UAAM,WAAW,CAAC,SAAiB;AAAE,UAAI;AAAE,aAAK,GAAG,IAAI,IAAI;AAAA,MAAG,QAAQ;AAAA,MAAuB;AAAA,IAAE;AAC/F,aAAS,sDAAsD;AAC/D,aAAS,6DAA6D;AACtE,aAAS,kEAAkE;AAC3E,aAAS,8DAA8D;AACvE,aAAS,4DAA4D;AACrE,aAAS,iEAAiE;AAC1E,aAAS,oEAAoE;AAC7E,aAAS,8EAA8E;AACvF,aAAS,wFAAwF;AACjG,aAAS,kFAAkF;AAC3F,aAAS,4DAA4D;AACrE,aAAS,kFAAkF;AAC3F,aAAS,sEAAsE;AAC/E,aAAS,wEAAwE;AACjF,aAAS,kEAAkE;AAC3E,aAAS,kEAAkE;AAAA,EAC7E;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,kBAAwB;AACtB,UAAM,aAAa,KAAK,KAAK,WAAW,uBAAuB;AAC/D,QAAI,GAAG,WAAW,UAAU,GAAG;AAC7B,YAAM,MAAM,GAAG,aAAa,YAAY,MAAM;AAC9C,WAAK,GAAG,KAAK,GAAG;AAAA,IAClB;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,WAAgB;AACd,WAAO,KAAK;AAAA,EACd;AAAA,EAEQ,gBAAsB;AAE5B,UAAM,aAAa,KAAK,GAAG,IAAI,mEAAmE;AAClG,UAAM,iBAAiB,aAAa,WAAW,UAAU;AAEzD,QAAI,iBAAiB,wBAAwB;AAG3C,WAAK,GAAG;AAAA,QAAI;AAAA,QACV,CAAC,wBAAwB,KAAK,IAAI,CAAC;AAAA,MAAC;AAAA,IACxC;AAIA,QAAI;AACF,WAAK,GAAG,IAAI,kEAAkE;AAAA,IAChF,QAAQ;AAAA,IAER;AAGA,QAAI;AACF,WAAK,GAAG,IAAI,2EAA2E;AAAA,IACzF,QAAQ;AAAA,IAER;AACA,QAAI;AACF,WAAK,GAAG,IAAI,yEAAyE;AAAA,IACvF,QAAQ;AAAA,IAER;AAAA,EACF;AAAA;AAAA,EAIA,WAAW,QAA0B;AACnC,SAAK,GAAG;AAAA,MACN;AAAA;AAAA,MAEA,CAAC,OAAO,MAAM,OAAO,aAAa,OAAO,UAAU,OAAO,UAAU,OAAO,aAAa,OAAO,SAAS;AAAA,IAC1G;AAAA,EACF;AAAA,EAEA,QAAQ,UAAqC;AAC3C,UAAM,MAAM,KAAK,GAAG,IAAI,sCAAsC,CAAC,QAAQ,CAAC;AACxE,WAAO,MAAM,KAAK,UAAU,GAAG,IAAI;AAAA,EACrC;AAAA,EAEA,cAA4B;AAC1B,WAAO,KAAK,GAAG,IAAI,qBAAqB,EAAE,IAAI,KAAK,SAAS;AAAA,EAC9D;AAAA,EAEA,WAAW,UAAwB;AAEjC,SAAK,GAAG,IAAI,yCAAyC,CAAC,QAAQ,CAAC;AAC/D,SAAK,GAAG,IAAI,oCAAoC,CAAC,QAAQ,CAAC;AAAA,EAC5D;AAAA,EAEQ,UAAU,KAAsB;AACtC,WAAO;AAAA,MACL,MAAM,IAAI;AAAA,MACV,aAAa,IAAI;AAAA,MACjB,UAAU,IAAI;AAAA,MACd,UAAU,IAAI;AAAA,MACd,aAAa,IAAI;AAAA,MACjB,WAAW,IAAI;AAAA,IACjB;AAAA,EACF;AAAA;AAAA,EAIA,WAAW,MAAkB;AAC3B,SAAK,GAAG;AAAA,MACN;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOA;AAAA,QACE,KAAK;AAAA,QAAI,KAAK;AAAA,QAAM,KAAK;AAAA,QAAM,KAAK;AAAA,QAAe,KAAK;AAAA,QAAU,KAAK;AAAA,QACvE,KAAK;AAAA,QAAW,KAAK;AAAA,QAAS,KAAK;AAAA,QAAa,KAAK;AAAA,QACrD,KAAK,aAAa;AAAA,QAAM,KAAK,aAAa;AAAA,QAAM,KAAK,cAAc;AAAA,QACnE,KAAK,aAAa,IAAI;AAAA,QAAG,KAAK,UAAU,IAAI;AAAA,QAC5C,KAAK,WAAW,IAAI;AAAA,QAAG,KAAK,aAAa,IAAI;AAAA,QAC7C,KAAK,aAAa,KAAK,UAAU,KAAK,UAAU,IAAI;AAAA,QACpD,KAAK,iBAAiB,KAAK,UAAU,KAAK,cAAc,IAAI;AAAA,QAC5D,KAAK;AAAA,MACP;AAAA,IACF;AAEA,SAAK,GAAG;AAAA,MACN;AAAA;AAAA,MAEA,CAAC,KAAK,IAAI,KAAK,MAAM,KAAK,eAAe,KAAK,aAAa,IAAI,KAAK,aAAa,EAAE;AAAA,IACrF;AAAA,EACF;AAAA,EAEA,QAAQ,IAAyB;AAC/B,UAAM,MAAM,KAAK,GAAG,IAAI,oCAAoC,CAAC,EAAE,CAAC;AAChE,WAAO,MAAM,KAAK,UAAU,GAAG,IAAI;AAAA,EACrC;AAAA,EAEA,eAAe,UAA0B;AACvC,WAAO,KAAK,GAAG,IAAI,2CAA2C,CAAC,QAAQ,CAAC,EAAE,IAAI,KAAK,SAAS;AAAA,EAC9F;AAAA,EAEA,eAAe,MAA4B;AACzC,WAAO,KAAK,GAAG,IAAI,sCAAsC,CAAC,IAAI,CAAC,EAAE,IAAI,KAAK,SAAS;AAAA,EACrF;AAAA,EAEA,qBAAqB,MAAc,OAAoB,QAAQ,IAAY;AACzE,QAAI,SAAS,MAAM,SAAS,GAAG;AAC7B,YAAM,eAAe,MAAM,IAAI,MAAM,GAAG,EAAE,KAAK,GAAG;AAClD,aAAO,KAAK,GAAG;AAAA,QACb,mDAAmD,YAAY;AAAA,QAC/D,CAAC,MAAM,GAAG,OAAO,KAAK;AAAA,MACxB,EAAE,IAAI,KAAK,SAAS;AAAA,IACtB;AACA,WAAO,KAAK,GAAG;AAAA,MACb;AAAA,MACA,CAAC,MAAM,KAAK;AAAA,IACd,EAAE,IAAI,KAAK,SAAS;AAAA,EACtB;AAAA,EAEA,YAAY,OAAe,OAAsB,CAAC,GAAW;AAC3D,UAAM,EAAE,OAAO,WAAW,QAAQ,GAAG,IAAI;AAKzC,UAAM,OAAO,MACV,QAAQ,qBAAqB,GAAG,EAChC,QAAQ,4BAA4B,GAAG,EACvC,QAAQ,QAAQ,GAAG,EACnB,KAAK;AACR,QAAI,CAAC,KAAM,QAAO,CAAC;AAEnB,UAAM,WAAW,OAAO;AACxB,UAAM,YAAY,KAAK,IAAI,GAAG,KAAK,MAAM,OAAO,KAAK,CAAC,CAAC;AAEvD,UAAM,aAAuB,CAAC;AAC9B,UAAM,SAAgB,CAAC;AAEvB,QAAI,SAAS,MAAM,SAAS,GAAG;AAC7B,iBAAW,KAAK,YAAY,MAAM,IAAI,MAAM,GAAG,EAAE,KAAK,GAAG,CAAC,GAAG;AAC7D,aAAO,KAAK,GAAG,KAAK;AAAA,IACtB;AACA,QAAI,aAAa,UAAU,SAAS,GAAG;AACrC,iBAAW,KAAK,gBAAgB,UAAU,IAAI,MAAM,GAAG,EAAE,KAAK,GAAG,CAAC,GAAG;AACrE,aAAO,KAAK,GAAG,SAAS;AAAA,IAC1B;AAEA,UAAM,QAAQ,WAAW,SAAS,IAAI,OAAO,WAAW,KAAK,OAAO,CAAC,KAAK;AAE1E,WAAO,KAAK,GAAG;AAAA,MACb;AAAA,yEACmE,QAAQ;AAAA,SACxE,KAAK;AAAA,eACC,SAAS;AAAA,MAClB;AAAA,IACF,EAAE,IAAI,KAAK,SAAS;AAAA,EACtB;AAAA,EAEA,kBAAkB,MAAc,OAAsB,CAAC,GAAW;AAChE,UAAM,EAAE,OAAO,WAAW,QAAQ,GAAG,IAAI;AACzC,UAAM,UAAU,IAAI,IAAI;AACxB,UAAM,aAAuB,CAAC,aAAa;AAC3C,UAAM,SAAgB,CAAC,OAAO;AAE9B,QAAI,SAAS,MAAM,SAAS,GAAG;AAC7B,iBAAW,KAAK,YAAY,MAAM,IAAI,MAAM,GAAG,EAAE,KAAK,GAAG,CAAC,GAAG;AAC7D,aAAO,KAAK,GAAG,KAAK;AAAA,IACtB;AACA,QAAI,aAAa,UAAU,SAAS,GAAG;AACrC,iBAAW,KAAK,gBAAgB,UAAU,IAAI,MAAM,GAAG,EAAE,KAAK,GAAG,CAAC,GAAG;AACrE,aAAO,KAAK,GAAG,SAAS;AAAA,IAC1B;AACA,WAAO,KAAK,KAAK;AAEjB,WAAO,KAAK,GAAG;AAAA,MACb,6BAA6B,WAAW,KAAK,OAAO,CAAC;AAAA,MACrD;AAAA,IACF,EAAE,IAAI,KAAK,SAAS;AAAA,EACtB;AAAA,EAEA,kBAAkB,UAAwB;AACxC,UAAM,MAAM,KAAK,GAAG,IAAI,4CAA4C,CAAC,QAAQ,CAAC,EAAE,IAAI,CAAC,MAAW,EAAE,EAAE;AACpG,QAAI,IAAI,WAAW,EAAG;AACtB,UAAM,eAAe,IAAI,IAAI,MAAM,GAAG,EAAE,KAAK,GAAG;AAChD,SAAK,GAAG,IAAI,sCAAsC,YAAY,mBAAmB,YAAY,KAAK,CAAC,GAAG,KAAK,GAAG,GAAG,CAAC;AAClH,SAAK,GAAG,IAAI,sCAAsC,YAAY,KAAK,GAAG;AACtE,SAAK,GAAG,IAAI,yCAAyC,CAAC,QAAQ,CAAC;AAAA,EACjE;AAAA,EAEQ,UAAU,KAAgB;AAChC,WAAO;AAAA,MACL,IAAI,IAAI;AAAA,MACR,MAAM,IAAI;AAAA,MACV,MAAM,IAAI;AAAA,MACV,eAAe,IAAI;AAAA,MACnB,UAAU,IAAI;AAAA,MACd,UAAU,IAAI;AAAA,MACd,WAAW,IAAI;AAAA,MACf,SAAS,IAAI;AAAA,MACb,aAAa,IAAI;AAAA,MACjB,WAAW,IAAI;AAAA,MACf,WAAW,IAAI,aAAa;AAAA,MAC5B,WAAW,IAAI,aAAa;AAAA,MAC5B,YAAY,IAAI,cAAc;AAAA,MAC9B,YAAY,IAAI,gBAAgB;AAAA,MAChC,SAAS,IAAI,aAAa;AAAA,MAC1B,UAAU,IAAI,cAAc;AAAA,MAC5B,YAAY,IAAI,gBAAgB;AAAA,MAChC,YAAY,IAAI,aAAa,KAAK,MAAM,IAAI,UAAU,IAAI;AAAA,MAC1D,gBAAgB,IAAI,kBAAkB,KAAK,MAAM,IAAI,eAAe,IAAI;AAAA,MACxE,WAAW,IAAI;AAAA,IACjB;AAAA,EACF;AAAA;AAAA,EAIA,WAAW,MAAkB;AAC3B,SAAK,GAAG;AAAA,MACN;AAAA;AAAA,MAEA,CAAC,KAAK,QAAQ,KAAK,QAAQ,KAAK,MAAM,KAAK,WAAW,KAAK,UAAU,KAAK,QAAQ,IAAI,MAAM,KAAK,QAAQ,MAAM,KAAK,UAAU,MAAM,KAAK,cAAc,aAAa,KAAK,mBAAmB,CAAG;AAAA,IACjM;AAAA,EACF;AAAA,EAEA,WAAW,QAAgB,QAAQ,IAAY;AAC7C,WAAO,KAAK,GAAG;AAAA,MACb;AAAA;AAAA;AAAA;AAAA,MAIA,CAAC,QAAQ,KAAK;AAAA,IAChB,EAAE,IAAI,KAAK,SAAS;AAAA,EACtB;AAAA,EAEA,WAAW,QAAgB,QAAQ,IAAY;AAC7C,WAAO,KAAK,GAAG;AAAA,MACb;AAAA;AAAA;AAAA;AAAA,MAIA,CAAC,QAAQ,KAAK;AAAA,IAChB,EAAE,IAAI,KAAK,SAAS;AAAA,EACtB;AAAA,EAEA,gBAAgB,QAAgB,QAAQ,GAAW;AAEjD,UAAM,UAAU,oBAAI,IAAY,CAAC,MAAM,CAAC;AACxC,QAAI,WAAW,CAAC,MAAM;AACtB,aAAS,IAAI,GAAG,IAAI,OAAO,KAAK;AAC9B,UAAI,SAAS,WAAW,EAAG;AAC3B,YAAMA,gBAAe,SAAS,IAAI,MAAM,GAAG,EAAE,KAAK,GAAG;AACrD,YAAM,OAAO,KAAK,GAAG;AAAA,QACnB,sDAAsDA,aAAY;AAAA,QAClE;AAAA,MACF;AACA,iBAAW,CAAC;AACZ,iBAAW,OAAO,MAAM;AACtB,YAAI,CAAC,QAAQ,IAAI,IAAI,MAAM,GAAG;AAC5B,kBAAQ,IAAI,IAAI,MAAM;AACtB,mBAAS,KAAK,IAAI,MAAM;AAAA,QAC1B;AAAA,MACF;AAAA,IACF;AACA,YAAQ,OAAO,MAAM;AACrB,QAAI,QAAQ,SAAS,EAAG,QAAO,CAAC;AAChC,UAAM,MAAM,CAAC,GAAG,OAAO;AACvB,UAAM,eAAe,IAAI,IAAI,MAAM,GAAG,EAAE,KAAK,GAAG;AAChD,WAAO,KAAK,GAAG,IAAI,oCAAoC,YAAY,KAAK,GAAG,EAAE,IAAI,KAAK,SAAS;AAAA,EACjG;AAAA,EAEA,iBAAiB,SAA2B;AAC1C,QAAI,QAAQ,WAAW,EAAG,QAAO,CAAC;AAClC,UAAM,eAAe,QAAQ,IAAI,MAAM,GAAG,EAAE,KAAK,GAAG;AACpD,WAAO,KAAK,GAAG;AAAA,MACb,wCAAwC,YAAY,mBAAmB,YAAY;AAAA,MACnF,CAAC,GAAG,SAAS,GAAG,OAAO;AAAA,IACzB,EAAE,IAAI,CAAC,SAAc;AAAA,MACnB,QAAQ,IAAI;AAAA,MACZ,QAAQ,IAAI;AAAA,MACZ,MAAM,IAAI;AAAA,MACV,UAAU,IAAI,WAAW,KAAK,MAAM,IAAI,QAAQ,IAAI;AAAA,MACpD,MAAM,IAAI,QAAQ;AAAA,MAClB,QAAQ,IAAI,UAAU;AAAA,IACxB,EAAE;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,kBAAkB,UAA4B;AAE5C,UAAM,cAAc,KAAK,GAAG,IAAI,4CAA4C,CAAC,QAAQ,CAAC;AACtF,QAAI,YAAY,WAAW,EAAG,QAAO,CAAC;AACtC,UAAM,MAAM,YAAY,IAAI,CAAC,MAAW,EAAE,EAAE;AAC5C,UAAM,eAAe,IAAI,IAAI,MAAM,GAAG,EAAE,KAAK,GAAG;AAEhD,UAAM,OAAO,KAAK,GAAG;AAAA,MACnB;AAAA;AAAA,4BAEsB,YAAY;AAAA;AAAA,MAElC,CAAC,GAAG,KAAK,QAAQ;AAAA,IACnB;AACA,WAAO,KAAK,IAAI,CAAC,MAAW,EAAE,SAAS;AAAA,EACzC;AAAA;AAAA,EAIA,oBAAoB,UAAkB,SAAiB,SAAiB,UAAkB,MAAe,QAAuB;AAC9H,SAAK,GAAG;AAAA,MACN;AAAA;AAAA,MAEA,CAAC,UAAU,SAAS,SAAS,UAAU,QAAQ,MAAM,UAAU,IAAI;AAAA,IACrE;AAAA,EACF;AAAA,EAEA,2BAA2B,UAAwB;AACjD,SAAK,GAAG,IAAI,mDAAmD,CAAC,QAAQ,CAAC;AAAA,EAC3E;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,wBAAgC;AAC9B,UAAM,OAAO,KAAK,GAAG,IAAI,+BAA+B;AACxD,QAAI,WAAW;AAEf,eAAW,OAAO,MAAM;AACtB,YAAM,EAAE,IAAI,OAAO,WAAW,UAAU,UAAU,SAAS,UAAU,SAAS,WAAW,UAAU,MAAM,OAAO,IAAI;AAEpH,UAAI,YAAY,YAAY;AAE1B,YAAI,SAAS,KAAK,GAAG,IAAI,+CAA+C,CAAC,OAAO,CAAC;AACjF,YAAI,aAAqD;AACzD,YAAI,kBAAkB;AAGtB,YAAI,CAAC,QAAQ;AACX,mBAAS,KAAK,GAAG;AAAA,YACf;AAAA,YACA,CAAC,MAAM,OAAO,EAAE;AAAA,UAClB;AAAA,QACF;AAGA,YAAI,CAAC,QAAQ;AACX,mBAAS,KAAK,GAAG;AAAA,YACf;AAAA,YACA,CAAC,OAAO;AAAA,UACV;AAEA,cAAI,OAAQ,mBAAkB;AAAA,QAChC;AAGA,YAAI,QAAQ;AACV,gBAAM,iBAAiB,KAAK,GAAG,IAAI,oDAAoD,CAAC,OAAO,CAAC;AAChG,cAAI,kBAAkB,eAAe,MAAM,GAAG;AAC5C,yBAAa;AACb,8BAAkB,IAAM,eAAe;AAAA,UACzC;AAAA,QACF;AAEA,YAAI,QAAQ;AACV,eAAK,WAAW,EAAE,QAAQ,UAAU,QAAQ,OAAO,IAAI,MAAM,SAAS,MAAM,QAAQ,QAAW,QAAQ,UAAU,QAAW,YAAY,gBAAgB,CAAC;AACzJ,eAAK,GAAG,IAAI,4CAA4C,CAAC,KAAK,CAAC;AAC/D;AAAA,QACF;AAAA,MACF,WAAW,YAAY,UAAU;AAE/B,cAAM,iBAAiB,KAAK,kBAAkB,SAAS,QAAQ;AAC/D,YAAI,gBAAgB;AAClB,eAAK,WAAW,EAAE,QAAQ,UAAU,QAAQ,gBAAgB,MAAM,WAAW,MAAM,QAAQ,QAAW,QAAQ,UAAU,QAAW,YAAY,YAAY,iBAAiB,EAAI,CAAC;AACjL,eAAK,GAAG,IAAI,4CAA4C,CAAC,KAAK,CAAC;AAC/D;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA;AAAA,EAGA,mBAA2B;AACzB,WAAO,KAAK,sBAAsB;AAAA,EACpC;AAAA;AAAA;AAAA;AAAA;AAAA,EAMQ,kBAAkB,YAAoB,gBAAuC;AAEnF,QAAI,CAAC,WAAW,WAAW,GAAG,EAAG,QAAO;AAExC,UAAM,YAAY,eAAe,QAAQ,UAAU,EAAE;AAErD,UAAM,YAAY,YAAY,YAAY,MAAM,GAAG;AACnD,UAAM,aAAuB,CAAC;AAC9B,eAAW,OAAO,UAAU;AAC1B,UAAI,QAAQ,KAAM,YAAW,IAAI;AAAA,eACxB,QAAQ,IAAK,YAAW,KAAK,GAAG;AAAA,IAC3C;AACA,UAAM,WAAW,WAAW,KAAK,GAAG;AAGpC,UAAM,aAAa;AAAA,MACjB;AAAA,MACA,WAAW;AAAA,MACX,WAAW;AAAA,MACX,WAAW;AAAA,MACX,WAAW;AAAA,MACX,WAAW;AAAA,MACX,WAAW;AAAA,MACX,WAAW;AAAA,IACb;AAEA,eAAW,aAAa,YAAY;AAClC,YAAM,MAAM,KAAK,GAAG,IAAI,oDAAoD,CAAC,SAAS,CAAC;AACvF,UAAI,IAAK,QAAO,IAAI;AAAA,IACtB;AAEA,WAAO;AAAA,EACT;AAAA;AAAA,EAIA,eAAe,QAAoC;AACjD,UAAM,OAAO,KAAK,QAAQ,MAAM;AAChC,QAAI,CAAC,KAAM,QAAO;AAElB,UAAM,YAAY,KAAK,GAAG;AAAA,MACxB;AAAA;AAAA;AAAA,MAGA,CAAC,MAAM;AAAA,IACT,EAAE,IAAI,KAAK,SAAS;AAEpB,UAAM,WAAW,KAAK,GAAG;AAAA,MACvB;AAAA;AAAA;AAAA,MAGA,CAAC,MAAM;AAAA,IACT,EAAE,IAAI,KAAK,SAAS;AAEpB,UAAM,UAAU,KAAK,WAAW,QAAQ,EAAE;AAC1C,UAAM,UAAU,KAAK,WAAW,QAAQ,EAAE;AAE1C,WAAO,EAAE,MAAM,WAAW,UAAU,SAAS,QAAQ;AAAA,EACvD;AAAA,EAEA,eAAe,QAA6B;AAC1C,UAAM,oBAAqB,KAAK,GAAG,IAAI,oDAAoD,CAAC,MAAM,CAAC,GAAG,KAAK;AAC3G,UAAM,oBAAqB,KAAK,GAAG,IAAI,oDAAoD,CAAC,MAAM,CAAC,GAAG,KAAK;AAC3G,UAAM,YAAa,KAAK,GAAG,IAAI,uEAAuE,CAAC,MAAM,CAAC,GAAG,KAAK;AACtH,UAAM,cAAe,KAAK,GAAG,IAAI,uEAAuE,CAAC,MAAM,CAAC,GAAG,KAAK;AACxH,UAAM,aAAc,KAAK,GAAG,IAAI,0EAA0E,CAAC,MAAM,CAAC,GAAG,KAAK;AAC1H,WAAO,EAAE,mBAAmB,mBAAmB,WAAW,aAAa,WAAW;AAAA,EACpF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,aAAa,QAAQ,IAAY;AAC/B,WAAO,KAAK,GAAG;AAAA,MACb;AAAA;AAAA;AAAA;AAAA;AAAA,MAKA,CAAC,KAAK;AAAA,IACR,EAAE,IAAI,KAAK,SAAS;AAAA,EACtB;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,2BAAuC;AAErC,UAAM,OAAO,KAAK,GAAG;AAAA,MACnB;AAAA;AAAA;AAAA;AAAA;AAAA,IAKF;AAEA,UAAM,MAAM,oBAAI,IAAyB;AACzC,eAAW,OAAO,MAAM;AACtB,UAAI,CAAC,IAAI,IAAI,IAAI,GAAG,EAAG,KAAI,IAAI,IAAI,KAAK,oBAAI,IAAI,CAAC;AACjD,UAAI,IAAI,IAAI,GAAG,EAAG,IAAI,IAAI,GAAG;AAAA,IAC/B;AAEA,UAAM,SAAqB,CAAC;AAC5B,UAAM,UAAU,oBAAI,IAAY;AAChC,UAAM,UAAU,oBAAI,IAAY;AAChC,UAAM,UAAoB,CAAC;AAE3B,aAAS,IAAI,MAAoB;AAC/B,UAAI,QAAQ,IAAI,IAAI,GAAG;AACrB,cAAM,aAAa,QAAQ,QAAQ,IAAI;AACvC,eAAO,KAAK,QAAQ,MAAM,UAAU,EAAE,OAAO,IAAI,CAAC;AAClD;AAAA,MACF;AACA,UAAI,QAAQ,IAAI,IAAI,EAAG;AACvB,cAAQ,IAAI,IAAI;AAChB,cAAQ,IAAI,IAAI;AAChB,cAAQ,KAAK,IAAI;AACjB,iBAAW,YAAY,IAAI,IAAI,IAAI,KAAK,CAAC,GAAG;AAC1C,YAAI,QAAQ;AAAA,MACd;AACA,cAAQ,IAAI;AACZ,cAAQ,OAAO,IAAI;AAAA,IACrB;AAEA,eAAW,QAAQ,IAAI,KAAK,GAAG;AAC7B,UAAI,CAAC,QAAQ,IAAI,IAAI,EAAG,KAAI,IAAI;AAAA,IAClC;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,SAAS,QAAgB,MAAc,WAAW,IAAY;AAC5D,QAAI,WAAW,MAAM;AACnB,YAAM,OAAO,KAAK,QAAQ,MAAM;AAChC,aAAO,OAAO,CAAC,IAAI,IAAI,CAAC;AAAA,IAC1B;AAEA,UAAM,OAAO,oBAAI,IAAoB;AACrC,UAAM,QAAkB,CAAC,MAAM;AAC/B,UAAM,UAAU,oBAAI,IAAY,CAAC,MAAM,CAAC;AACxC,QAAI,QAAQ;AAEZ,UAAO,QAAO,MAAM,SAAS,KAAK,QAAQ,UAAU;AAClD,YAAM,YAAY,MAAM;AACxB;AACA,eAAS,IAAI,GAAG,IAAI,WAAW,KAAK;AAClC,cAAM,UAAU,MAAM,MAAM;AAE5B,cAAM,OAAO,KAAK,GAAG;AAAA,UACnB;AAAA,UACA,CAAC,OAAO;AAAA,QACV;AACA,mBAAW,OAAO,MAAM;AACtB,cAAI,CAAC,QAAQ,IAAI,IAAI,IAAI,GAAG;AAC1B,oBAAQ,IAAI,IAAI,IAAI;AACpB,iBAAK,IAAI,IAAI,MAAM,OAAO;AAC1B,gBAAI,IAAI,SAAS,KAAM,OAAM;AAC7B,kBAAM,KAAK,IAAI,IAAI;AAAA,UACrB;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAEA,QAAI,CAAC,KAAK,IAAI,IAAI,EAAG,QAAO,CAAC;AAG7B,UAAM,UAAoB,CAAC;AAC3B,QAAI,MAA0B;AAC9B,WAAO,QAAQ,QAAW;AACxB,cAAQ,QAAQ,GAAG;AACnB,YAAM,KAAK,IAAI,GAAG;AAAA,IACpB;AAEA,UAAM,SAAiB,CAAC;AACxB,eAAW,MAAM,SAAS;AACxB,YAAM,OAAO,KAAK,QAAQ,EAAE;AAC5B,UAAI,KAAM,QAAO,KAAK,IAAI;AAAA,IAC5B;AACA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,iBAAiB,QAAgB,YAAoC,QAAgB;AACnF,UAAM,UAAU,oBAAI,IAAY,CAAC,MAAM,CAAC;AACxC,UAAM,WAAW,CAAC,MAAM;AACxB,UAAM,SAAiB,CAAC;AAExB,WAAO,SAAS,SAAS,GAAG;AAC1B,YAAM,UAAU,SAAS,MAAM;AAC/B,UAAI,OAAc,CAAC;AAEnB,UAAI,cAAc,QAAQ,cAAc,QAAQ;AAE9C,cAAM,KAAK,KAAK,GAAG;AAAA,UACjB;AAAA,UACA,CAAC,OAAO;AAAA,QACV;AACA,eAAO,KAAK,OAAO,EAAE;AAAA,MACvB;AACA,UAAI,cAAc,UAAU,cAAc,QAAQ;AAEhD,cAAM,OAAO,KAAK,GAAG;AAAA,UACnB;AAAA,UACA,CAAC,OAAO;AAAA,QACV;AACA,eAAO,KAAK,OAAO,IAAI;AAAA,MACzB;AAEA,iBAAW,OAAO,MAAM;AACtB,YAAI,CAAC,QAAQ,IAAI,IAAI,EAAE,GAAG;AACxB,kBAAQ,IAAI,IAAI,EAAE;AAClB,mBAAS,KAAK,IAAI,EAAE;AACpB,gBAAM,OAAO,KAAK,QAAQ,IAAI,EAAE;AAChC,cAAI,KAAM,QAAO,KAAK,IAAI;AAAA,QAC5B;AAAA,MACF;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA;AAAA,EAIA,oBAA4B;AAC1B,QAAI;AACF,YAAM,MAAM,KAAK,GAAG,IAAI,mCAAmC;AAC3D,aAAO,MAAM,IAAI,IAAI;AAAA,IACvB,QAAQ;AACN,aAAO;AAAA,IACT;AAAA,EACF;AAAA,EAEA,eAAe,QAAgB,WAAyB,OAAqB;AAC3E,UAAM,MAAM,OAAO,KAAK,UAAU,MAAM;AACxC,SAAK,GAAG;AAAA,MACN;AAAA,MACA,CAAC,QAAQ,KAAK,OAAO,KAAK,IAAI,CAAC;AAAA,IACjC;AAAA,EACF;AAAA,EAEA,qBAA+B;AAC7B,WAAO,KAAK,GAAG,IAAI,6BAA6B,EAAE,IAAI,CAAC,MAAW,EAAE,OAAO;AAAA,EAC7E;AAAA,EAEA,mBAAuE;AACrE,UAAM,OAAO,KAAK,GAAG,IAAI,wCAAwC;AACjE,WAAO,KAAK,IAAI,CAAC,OAAY;AAAA,MAC3B,QAAQ,EAAE;AAAA,MACV,WAAW,IAAI;AAAA,QACZ,EAAE,UAAqB;AAAA,QACvB,EAAE,UAAqB;AAAA,QACvB,EAAE,UAAqB,aAAa;AAAA,MACvC;AAAA,IACF,EAAE;AAAA,EACJ;AAAA,EAEA,cAAyC;AACvC,WAAO,KAAK,GAAG,IAAI,qBAAqB,EAAE,IAAI,KAAK,SAAS;AAAA,EAC9D;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,wBAAwB,OAAiB,OAAe,QAA2C;AACjG,QAAI,MAAM,WAAW,EAAG,QAAO,CAAC;AAChC,UAAM,eAAe,MAAM,IAAI,MAAM,GAAG,EAAE,KAAK,GAAG;AAClD,WAAO,KAAK,GAAG;AAAA,MACb,sCAAsC,YAAY;AAAA,MAClD,CAAC,GAAG,OAAO,OAAO,MAAM;AAAA,IAC1B,EAAE,IAAI,KAAK,SAAS;AAAA,EACtB;AAAA;AAAA,EAGA,qBAAqB,OAAyB;AAC5C,QAAI,MAAM,WAAW,EAAG,QAAO;AAC/B,UAAM,eAAe,MAAM,IAAI,MAAM,GAAG,EAAE,KAAK,GAAG;AAClD,UAAM,MAAM,KAAK,GAAG,IAAI,kDAAkD,YAAY,KAAK,KAAK;AAChG,WAAO,KAAK,KAAK;AAAA,EACnB;AAAA,EAEA,cAAsB;AACpB,WAAO,KAAK,GAAG,IAAI,wCAAwC,EAAE,IAAI,CAAC,SAAc;AAAA,MAC9E,QAAQ,IAAI;AAAA,MACZ,QAAQ,IAAI;AAAA,MACZ,MAAM,IAAI;AAAA,IACZ,EAAE;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,aAAa,QAAQ,IAA2E;AAC9F,UAAM,OAAO,KAAK,GAAG;AAAA,MACnB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOA,CAAC,KAAK;AAAA,IACR;AACA,WAAO,KAAK,IAAI,CAAC,SAAc;AAAA,MAC7B,GAAG,KAAK,UAAU,GAAG;AAAA,MACrB,QAAQ,IAAI;AAAA,MACZ,UAAU,IAAI;AAAA,MACd,WAAW,IAAI;AAAA,IACjB,EAAE;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,0BAA0B,QAAQ,IAAwE;AACxG,UAAM,cAAsC;AAAA,MAC1C,OAAO;AAAA,MAAK,YAAY;AAAA,MAAK,SAAS;AAAA,MAAK,SAAS;AAAA,MACpD,WAAW;AAAA,MAAK,SAAS;AAAA,MAAK,YAAY;AAAA,IAC5C;AAEA,UAAM,OACJ,KAAK,GAAG;AAAA,MACN;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAQF;AAGF,UAAM,SAAS,KAAK,IAAI,SAAO;AAC7B,YAAM,UAAU,IAAI,YAAY,MAAM,GAAG,EAAE,MAAM,GAAG,EAAE;AACtD,YAAM,UAAU,IAAI,YAAY,MAAM,GAAG,EAAE,MAAM,GAAG,EAAE;AACtD,UAAI,SAAS;AACb,eAAS,IAAI,GAAG,IAAI,KAAK,IAAI,QAAQ,QAAQ,QAAQ,MAAM,GAAG,KAAK;AACjE,YAAI,QAAQ,CAAC,MAAM,QAAQ,CAAC,EAAG;AAAA,YAC1B;AAAA,MACP;AACA,YAAM,UAAU,KAAK,IAAI,QAAQ,QAAQ,QAAQ,QAAQ,CAAC;AAC1D,YAAM,iBAAiB,SAAS;AAChC,YAAM,aAAa,YAAY,IAAI,IAAI,KAAK;AAC5C,aAAO,EAAE,GAAG,KAAK,QAAQ,IAAI,kBAAkB,WAAW;AAAA,IAC5D,CAAC;AAGD,WAAO,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK;AACvC,UAAM,OAAO,oBAAI,IAAY;AAC7B,UAAM,MAAqB,CAAC;AAC5B,eAAW,OAAO,QAAQ;AACxB,YAAM,MAAM,GAAG,IAAI,MAAM,IAAI,IAAI,MAAM,IAAI,IAAI,IAAI;AACnD,UAAI,CAAC,KAAK,IAAI,GAAG,GAAG;AAClB,aAAK,IAAI,GAAG;AACZ,YAAI,KAAK,GAAG;AACZ,YAAI,IAAI,UAAU,MAAO;AAAA,MAC3B;AAAA,IACF;AAEA,UAAM,SAA6E,CAAC;AACpF,eAAW,OAAO,KAAK;AACrB,YAAM,MAAM,KAAK,QAAQ,IAAI,MAAM;AACnC,YAAM,MAAM,KAAK,QAAQ,IAAI,MAAM;AACnC,UAAI,OAAO,IAAK,QAAO,KAAK,EAAE,QAAQ,KAAK,QAAQ,KAAK,MAAM,IAAI,MAAM,OAAO,IAAI,MAAM,CAAC;AAAA,IAC5F;AACA,WAAO;AAAA,EACT;AAAA,EAEA,WAAuB;AACrB,UAAM,QAAQ,KAAK,GAAG,IAAI,iCAAiC,EAAE;AAC7D,UAAM,QAAQ,KAAK,GAAG,IAAI,iCAAiC,EAAE;AAC7D,UAAM,QAAQ,KAAK,GAAG,IAAI,iCAAiC,EAAE;AAC7D,UAAM,WAAW,KAAK,GAAG,IAAI,qDAAqD;AAClF,UAAM,cAAsC,CAAC;AAC7C,eAAW,OAAO,SAAU,aAAY,IAAI,IAAI,IAAI,IAAI;AACxD,UAAM,WAAW,KAAK,GAAG,IAAI,6DAA6D;AAC1F,UAAM,kBAA0C,CAAC;AACjD,eAAW,OAAO,SAAU,iBAAgB,IAAI,QAAQ,IAAI,IAAI;AAChE,UAAM,SAAS,KAAK,KAAK,KAAK,aAAa,cAAc,cAAc;AACvE,QAAI,cAAc;AAClB,QAAI;AAAE,oBAAc,GAAG,SAAS,MAAM,EAAE;AAAA,IAAM,QAAQ;AAAA,IAAe;AACrE,UAAM,iBAAiB,KAAK,kBAAkB;AAC9C,WAAO,EAAE,OAAO,OAAO,OAAO,aAAa,iBAAiB,aAAa,gBAAgB,mBAAmB,OAAO,gBAAgB,IAAI,aAAa,OAAO,gBAAgB,UAAmB,eAAe,GAAG,gBAAgB,MAAM,qBAAqB,GAAG,YAAY,CAAC,GAAG,qBAAqB,MAAM;AAAA,EAC3S;AAAA;AAAA,EAIA,oBAA0B;AACxB,SAAK,GAAG,IAAI,2BAA2B;AACvC,SAAK,GAAG,IAAI,6BAA6B;AACzC,SAAK,GAAG,IAAI,+BAA+B;AAC3C,SAAK,GAAG,IAAI,8BAA8B;AAC1C,SAAK,GAAG,IAAI,gCAAgC;AAC5C,SAAK,GAAG,IAAI,yBAAyB;AACrC,SAAK,GAAG,IAAI,2BAA2B;AAAA,EACzC;AAAA,EAEA,kBAAkB,KAAwB;AACxC,SAAK,GAAG;AAAA,MACN;AAAA;AAAA;AAAA,MAGA;AAAA,QACE,IAAI;AAAA,QAAI,IAAI;AAAA,QAAM,IAAI;AAAA,QAAM,IAAI;AAAA,QAChC,IAAI,YAAY;AAAA,QAAM,IAAI,gBAAgB;AAAA,QAAM,IAAI,WAAW;AAAA,QAC/D,IAAI,eAAe,KAAK,UAAU,IAAI,YAAY,IAAI;AAAA,QACtD,IAAI,WAAW,KAAK,UAAU,IAAI,QAAQ,IAAI;AAAA,QAC9C,IAAI;AAAA,MACN;AAAA,IACF;AAAA,EACF;AAAA,EAEA,gBAAgB,OAAwB;AACtC,SAAK,GAAG;AAAA,MACN;AAAA;AAAA,MAEA;AAAA,QACE,MAAM;AAAA,QAAI,MAAM;AAAA,QAAM,MAAM;AAAA,QAC5B,KAAK,UAAU,MAAM,QAAQ;AAAA,QAC7B,MAAM,WAAW,KAAK,UAAU,MAAM,QAAQ,IAAI;AAAA,QAClD,MAAM;AAAA,MACR;AAAA,IACF;AAAA,EACF;AAAA,EAEA,sBAAsB,UAAkB,WAAyB;AAC/D,SAAK,GAAG;AAAA,MACN;AAAA,MACA,CAAC,UAAU,SAAS;AAAA,IACtB;AAAA,EACF;AAAA,EAEA,oBAAoB,UAAkB,SAAiB,YAAoB,gBAA8B;AACvG,SAAK,GAAG;AAAA,MACN;AAAA;AAAA,MAEA,CAAC,UAAU,SAAS,YAAY,cAAc;AAAA,IAChD;AAAA,EACF;AAAA,EAEA,qBAAqB,WAAmB,WAAmB,UAAkB,OAAmD;AAC9H,SAAK,GAAG;AAAA,MACN;AAAA;AAAA,MAEA,CAAC,WAAW,WAAW,UAAU,QAAQ,KAAK,UAAU,KAAK,IAAI,IAAI;AAAA,IACvE;AAAA,EACF;AAAA,EAEA,mBAAmB,aAAqB,aAAqB,UAAwB;AACnF,SAAK,GAAG;AAAA,MACN;AAAA;AAAA,MAEA,CAAC,aAAa,aAAa,QAAQ;AAAA,IACrC;AAAA,EACF;AAAA,EAEA,mBAAmB,UAA8B;AAC/C,SAAK,GAAG;AAAA,MACN;AAAA;AAAA,MAEA,CAAC,SAAS,WAAW,SAAS,UAAU,SAAS,UAAU,SAAS,aAAa,SAAS,SAAS;AAAA,IACrG;AAAA,EACF;AAAA,EAEA,kBAAiC;AAC/B,WAAO,KAAK,GAAG,IAAI,6BAA6B,EAAE,IAAI,CAAC,OAAyB;AAAA,MAC9E,IAAI,EAAE;AAAA,MACN,MAAM,EAAE;AAAA,MACR,MAAM,EAAE;AAAA,MACR,QAAQ,EAAE;AAAA,MACV,UAAU,EAAE,YAAY;AAAA,MACxB,cAAc,EAAE,iBAAiB;AAAA,MACjC,SAAS,EAAE,WAAW;AAAA,MACtB,cAAc,EAAE,gBAAgB,KAAK,MAAM,EAAE,aAAa,IAAI;AAAA,MAC9D,UAAU,EAAE,WAAW,KAAK,MAAM,EAAE,QAAQ,IAAI;AAAA,MAChD,WAAW,EAAE;AAAA,IACf,EAAE;AAAA,EACJ;AAAA,EAEA,gBAA6B;AAC3B,WAAO,KAAK,GAAG,IAAI,2BAA2B,EAAE,IAAI,CAAC,OAAuB;AAAA,MAC1E,IAAI,EAAE;AAAA,MACN,MAAM,EAAE;AAAA,MACR,QAAQ,EAAE;AAAA,MACV,UAAU,KAAK,MAAM,EAAE,QAAQ;AAAA,MAC/B,UAAU,EAAE,WAAW,KAAK,MAAM,EAAE,QAAQ,IAAI;AAAA,MAChD,WAAW,EAAE;AAAA,IACf,EAAE;AAAA,EACJ;AAAA,EAEA,qBAAuC;AACrC,WAAO,KAAK,GAAG,IAAI,iCAAiC,EAAE,IAAI,CAAC,OAA4B;AAAA,MACrF,WAAW,EAAE;AAAA,MACb,WAAW,EAAE;AAAA,MACb,UAAU,EAAE;AAAA,MACZ,OAAO,EAAE,QAAQ,KAAK,MAAM,EAAE,KAAK,IAAI;AAAA,IACzC,EAAE;AAAA,EACJ;AAAA,EAEA,mBAAmC;AACjC,WAAO,KAAK,GAAG,IAAI,+BAA+B,EAAE,IAAI,CAAC,OAA0B;AAAA,MACjF,aAAa,EAAE;AAAA,MACf,aAAa,EAAE;AAAA,MACf,UAAU,EAAE;AAAA,IACd,EAAE;AAAA,EACJ;AAAA,EAEA,kBAAkC;AAChC,WAAO,KAAK,GAAG,IAAI,6BAA6B,EAAE,IAAI,CAAC,OAA0B;AAAA,MAC/E,WAAW,EAAE;AAAA,MACb,UAAU,EAAE;AAAA,MACZ,UAAU,EAAE;AAAA,MACZ,aAAa,EAAE;AAAA,MACf,WAAW,EAAE;AAAA,IACf,EAAE;AAAA,EACJ;AAAA,EAEA,eAA0E;AACxE,WAAO;AAAA,MACL,UAAU,KAAK,GAAG,IAAI,yCAAyC,GAAG,KAAK;AAAA,MACvE,QAAQ,KAAK,GAAG,IAAI,uCAAuC,GAAG,KAAK;AAAA,MACnE,aAAa,KAAK,GAAG,IAAI,6CAA6C,GAAG,KAAK;AAAA,IAChF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,qBAAwE;AACtE,WAAO,KAAK,GAAG;AAAA,MACb;AAAA;AAAA;AAAA;AAAA;AAAA,IAKF,EAAE,IAAI,CAAC,OAAY,EAAE,YAAY,EAAE,aAAa,YAAY,EAAE,YAAY,EAAE;AAAA,EAC9E;AAAA,EAEA,sBAAsE;AACpE,WAAO,KAAK,GAAG,IAAI,sDAAsD,EACtE,IAAI,CAAC,OAAY,EAAE,UAAU,EAAE,WAAW,WAAW,EAAE,WAAW,EAAE;AAAA,EACzE;AAAA,EAEA,oBAA8G;AAC5G,WAAO,KAAK,GAAG,IAAI,+EAA+E,EAC/F,IAAI,CAAC,OAAY;AAAA,MAChB,UAAU,EAAE;AAAA,MACZ,SAAS,EAAE;AAAA,MACX,YAAY,EAAE;AAAA,MACd,gBAAgB,EAAE;AAAA,IACpB,EAAE;AAAA,EACN;AAAA,EAEA,wBAME;AACA,WAAO;AAAA,MACL,UAAU,KAAK,gBAAgB;AAAA,MAC/B,QAAQ,KAAK,cAAc;AAAA,MAC3B,aAAa,KAAK,mBAAmB;AAAA,MACrC,WAAW,KAAK,iBAAiB;AAAA,MACjC,UAAU,KAAK,gBAAgB;AAAA,IACjC;AAAA,EACF;AAAA;AAAA,EAIA,YAAe,IAAgB;AAC7B,SAAK,GAAG,IAAI,OAAO;AACnB,QAAI;AACF,YAAM,SAAS,GAAG;AAClB,WAAK,GAAG,IAAI,QAAQ;AACpB,aAAO;AAAA,IACT,SAAS,KAAK;AACZ,WAAK,GAAG,IAAI,UAAU;AACtB,YAAM;AAAA,IACR;AAAA,EACF;AAAA,EAEA,QAAc;AACZ,SAAK,GAAG,MAAM;AAAA,EAChB;AACF;",
|
|
6
6
|
"names": ["placeholders"]
|
|
7
7
|
}
|
|
@@ -24,13 +24,17 @@ CREATE TABLE IF NOT EXISTS mem_observations (
|
|
|
24
24
|
valid_from INTEGER,
|
|
25
25
|
valid_until INTEGER,
|
|
26
26
|
superseded_by TEXT,
|
|
27
|
-
fact_type TEXT DEFAULT 'observation'
|
|
27
|
+
fact_type TEXT DEFAULT 'observation',
|
|
28
|
+
topic_key TEXT,
|
|
29
|
+
review_after INTEGER
|
|
28
30
|
);
|
|
29
31
|
|
|
30
32
|
CREATE UNIQUE INDEX IF NOT EXISTS idx_mem_obs_hash ON mem_observations(content_hash);
|
|
31
33
|
CREATE INDEX IF NOT EXISTS idx_mem_obs_session ON mem_observations(session_id);
|
|
32
34
|
CREATE INDEX IF NOT EXISTS idx_mem_obs_kind ON mem_observations(kind);
|
|
33
35
|
CREATE INDEX IF NOT EXISTS idx_mem_obs_created ON mem_observations(created_at);
|
|
36
|
+
CREATE INDEX IF NOT EXISTS idx_mem_obs_topic ON mem_observations(topic_key);
|
|
37
|
+
CREATE INDEX IF NOT EXISTS idx_mem_obs_review ON mem_observations(review_after);
|
|
34
38
|
|
|
35
39
|
CREATE VIRTUAL TABLE IF NOT EXISTS mem_fts USING fts5(
|
|
36
40
|
id UNINDEXED,
|
|
@@ -53,3 +57,32 @@ CREATE TABLE IF NOT EXISTS mem_vectors (
|
|
|
53
57
|
model TEXT NOT NULL,
|
|
54
58
|
created_at INTEGER NOT NULL
|
|
55
59
|
);
|
|
60
|
+
|
|
61
|
+
-- Relations between observations (conflict detection)
|
|
62
|
+
CREATE TABLE IF NOT EXISTS mem_relations (
|
|
63
|
+
id TEXT PRIMARY KEY,
|
|
64
|
+
observation_a TEXT NOT NULL REFERENCES mem_observations(id) ON DELETE CASCADE,
|
|
65
|
+
observation_b TEXT NOT NULL REFERENCES mem_observations(id) ON DELETE CASCADE,
|
|
66
|
+
relation TEXT NOT NULL,
|
|
67
|
+
confidence REAL NOT NULL DEFAULT 1.0,
|
|
68
|
+
reason TEXT,
|
|
69
|
+
evidence TEXT,
|
|
70
|
+
judgment_status TEXT NOT NULL DEFAULT 'pending',
|
|
71
|
+
judged_at INTEGER,
|
|
72
|
+
created_at INTEGER NOT NULL,
|
|
73
|
+
UNIQUE(observation_a, observation_b)
|
|
74
|
+
);
|
|
75
|
+
|
|
76
|
+
CREATE INDEX IF NOT EXISTS idx_mem_rel_a ON mem_relations(observation_a);
|
|
77
|
+
CREATE INDEX IF NOT EXISTS idx_mem_rel_b ON mem_relations(observation_b);
|
|
78
|
+
CREATE INDEX IF NOT EXISTS idx_mem_rel_status ON mem_relations(judgment_status);
|
|
79
|
+
|
|
80
|
+
-- Saved prompts linked to sessions
|
|
81
|
+
CREATE TABLE IF NOT EXISTS mem_prompts (
|
|
82
|
+
id TEXT PRIMARY KEY,
|
|
83
|
+
session_id TEXT REFERENCES mem_sessions(id) ON DELETE CASCADE,
|
|
84
|
+
content TEXT NOT NULL,
|
|
85
|
+
created_at INTEGER NOT NULL
|
|
86
|
+
);
|
|
87
|
+
|
|
88
|
+
CREATE INDEX IF NOT EXISTS idx_mem_prompts_session ON mem_prompts(session_id);
|
|
@@ -0,0 +1,40 @@
|
|
|
1
|
+
-- KiroGraph Wiki Schema (opt-in, enableWiki=true)
|
|
2
|
+
-- Isolated from core graph tables. Source of truth is .kirograph/wiki/*.md files.
|
|
3
|
+
-- This is a fast-search index; regeneratable via `kirograph wiki reindex`.
|
|
4
|
+
|
|
5
|
+
CREATE TABLE IF NOT EXISTS wiki_pages (
|
|
6
|
+
slug TEXT PRIMARY KEY, -- e.g. "AuthService", "arch/auth-model"
|
|
7
|
+
title TEXT NOT NULL,
|
|
8
|
+
content TEXT NOT NULL, -- full markdown content
|
|
9
|
+
file_path TEXT, -- relative path under .kirograph/wiki/ (null if not yet written)
|
|
10
|
+
updated_at INTEGER NOT NULL, -- epoch ms of last ingest
|
|
11
|
+
source_count INTEGER DEFAULT 0 -- number of sources that contributed to this page
|
|
12
|
+
);
|
|
13
|
+
|
|
14
|
+
-- Standalone FTS5 table (stores its own copy of indexed content)
|
|
15
|
+
CREATE VIRTUAL TABLE IF NOT EXISTS wiki_fts
|
|
16
|
+
USING fts5(slug, title, content, tokenize='porter ascii');
|
|
17
|
+
|
|
18
|
+
-- Keep FTS in sync (insert)
|
|
19
|
+
CREATE TRIGGER IF NOT EXISTS wiki_fts_insert AFTER INSERT ON wiki_pages BEGIN
|
|
20
|
+
INSERT INTO wiki_fts(rowid, slug, title, content) VALUES (new.rowid, new.slug, new.title, new.content);
|
|
21
|
+
END;
|
|
22
|
+
|
|
23
|
+
-- Keep FTS in sync (update: delete old FTS entry then insert new)
|
|
24
|
+
CREATE TRIGGER IF NOT EXISTS wiki_fts_update AFTER UPDATE ON wiki_pages BEGIN
|
|
25
|
+
DELETE FROM wiki_fts WHERE rowid = old.rowid;
|
|
26
|
+
INSERT INTO wiki_fts(rowid, slug, title, content) VALUES (new.rowid, new.slug, new.title, new.content);
|
|
27
|
+
END;
|
|
28
|
+
|
|
29
|
+
-- Keep FTS in sync (delete)
|
|
30
|
+
CREATE TRIGGER IF NOT EXISTS wiki_fts_delete AFTER DELETE ON wiki_pages BEGIN
|
|
31
|
+
DELETE FROM wiki_fts WHERE rowid = old.rowid;
|
|
32
|
+
END;
|
|
33
|
+
|
|
34
|
+
-- Pending sources for local-model synthesis (wikiSynthesisMode: 'local')
|
|
35
|
+
CREATE TABLE IF NOT EXISTS wiki_queue (
|
|
36
|
+
id INTEGER PRIMARY KEY AUTOINCREMENT,
|
|
37
|
+
source_name TEXT NOT NULL,
|
|
38
|
+
source_text TEXT NOT NULL,
|
|
39
|
+
queued_at INTEGER NOT NULL
|
|
40
|
+
);
|
package/dist/mcp/server.js
CHANGED
|
@@ -35,6 +35,7 @@ var path = __toESM(require("path"));
|
|
|
35
35
|
var import__ = __toESM(require("../index"));
|
|
36
36
|
var import_transport = require("./transport");
|
|
37
37
|
var import_tools = require("./tools");
|
|
38
|
+
var import_tool_names = require("./tool-names");
|
|
38
39
|
var import_runner = require("../patterns/runner");
|
|
39
40
|
const SERVER_INFO = { name: "kirograph", version: "0.1.0" };
|
|
40
41
|
const PROTOCOL_VERSION = "2024-11-05";
|
|
@@ -44,10 +45,14 @@ class MCPServer {
|
|
|
44
45
|
this.cg = null;
|
|
45
46
|
// eslint-disable-next-line @typescript-eslint/no-explicit-any
|
|
46
47
|
this.config = null;
|
|
48
|
+
this.enabledTools = [];
|
|
49
|
+
this.enabledToolNames = /* @__PURE__ */ new Set();
|
|
47
50
|
this.projectPath = projectPath ? path.resolve(projectPath) : null;
|
|
48
51
|
this.toolHandler = new import_tools.ToolHandler(null);
|
|
52
|
+
this.setEnabledTools();
|
|
49
53
|
}
|
|
50
54
|
async start() {
|
|
55
|
+
if (this.projectPath) await this.tryInit(this.projectPath);
|
|
51
56
|
this.transport.start(this.handleMessage.bind(this));
|
|
52
57
|
process.on("SIGINT", () => this.stop());
|
|
53
58
|
process.on("SIGTERM", () => this.stop());
|
|
@@ -73,17 +78,18 @@ class MCPServer {
|
|
|
73
78
|
this.config = await loadConfig(root);
|
|
74
79
|
} catch {
|
|
75
80
|
}
|
|
81
|
+
this.setEnabledTools();
|
|
76
82
|
}
|
|
77
83
|
async handleMessage(msg) {
|
|
78
84
|
const req = msg;
|
|
79
85
|
switch (req.method) {
|
|
80
86
|
case "initialize": {
|
|
81
|
-
|
|
82
|
-
|
|
83
|
-
|
|
84
|
-
|
|
85
|
-
|
|
86
|
-
|
|
87
|
+
if (!this.config) {
|
|
88
|
+
const rootUri = req.params?.rootUri ?? req.params?.workspaceFolders?.[0]?.uri;
|
|
89
|
+
if (rootUri) {
|
|
90
|
+
const p = rootUri.startsWith("file://") ? decodeURIComponent(rootUri.replace(/^file:\/\/\/?/, "")) : rootUri;
|
|
91
|
+
await this.tryInit(p);
|
|
92
|
+
}
|
|
87
93
|
}
|
|
88
94
|
return {
|
|
89
95
|
protocolVersion: PROTOCOL_VERSION,
|
|
@@ -92,14 +98,16 @@ class MCPServer {
|
|
|
92
98
|
};
|
|
93
99
|
}
|
|
94
100
|
case "tools/list": {
|
|
95
|
-
|
|
96
|
-
if (this.config?.enablePatterns && new import_runner.PatternRunner().isAvailable()) {
|
|
97
|
-
dynamicTools.push(import_tools.LIVE_SEARCH_TOOL_DEFINITION);
|
|
98
|
-
}
|
|
99
|
-
return { tools: dynamicTools };
|
|
101
|
+
return { tools: this.enabledTools };
|
|
100
102
|
}
|
|
101
103
|
case "tools/call": {
|
|
102
104
|
const { name, arguments: args = {} } = req.params ?? {};
|
|
105
|
+
if (!this.enabledToolNames.has(name)) {
|
|
106
|
+
return {
|
|
107
|
+
content: [{ type: "text", text: `Tool "${name}" is not available. The feature it belongs to is not enabled in .kirograph/config.json.` }],
|
|
108
|
+
isError: true
|
|
109
|
+
};
|
|
110
|
+
}
|
|
103
111
|
try {
|
|
104
112
|
return await this.toolHandler.handle(name, args);
|
|
105
113
|
} catch (err) {
|
|
@@ -117,6 +125,22 @@ class MCPServer {
|
|
|
117
125
|
return void 0;
|
|
118
126
|
}
|
|
119
127
|
}
|
|
128
|
+
setEnabledTools() {
|
|
129
|
+
const hidden = /* @__PURE__ */ new Set();
|
|
130
|
+
if (this.config) {
|
|
131
|
+
for (const [flag, names] of Object.entries(import_tool_names.FEATURE_TOOL_SETS)) {
|
|
132
|
+
if (this.config[flag] === false) {
|
|
133
|
+
for (const n of names) hidden.add(n);
|
|
134
|
+
}
|
|
135
|
+
}
|
|
136
|
+
}
|
|
137
|
+
const list = import_tools.tools.filter((t) => !hidden.has(t.name));
|
|
138
|
+
if (this.config?.enablePatterns && new import_runner.PatternRunner().isAvailable()) {
|
|
139
|
+
list.push(import_tools.LIVE_SEARCH_TOOL_DEFINITION);
|
|
140
|
+
}
|
|
141
|
+
this.enabledTools = list;
|
|
142
|
+
this.enabledToolNames = new Set(list.map((t) => t.name));
|
|
143
|
+
}
|
|
120
144
|
stop() {
|
|
121
145
|
this.cg?.close();
|
|
122
146
|
this.toolHandler.closeAll();
|
package/dist/mcp/server.js.map
CHANGED
|
@@ -1,7 +1,7 @@
|
|
|
1
1
|
{
|
|
2
2
|
"version": 3,
|
|
3
3
|
"sources": ["../../src/mcp/server.ts"],
|
|
4
|
-
"sourcesContent": ["/**\n * KiroGraph MCP Server\n * Implements the Model Context Protocol over stdio.\n */\n\nimport * as path from 'path';\nimport KiroGraph, { findNearestKiroGraphRoot } from '../index';\nimport { StdioTransport, ErrorCodes } from './transport';\nimport { tools, ToolHandler, LIVE_SEARCH_TOOL_DEFINITION } from './tools';\nimport { PatternRunner } from '../patterns/runner';\nimport type { JsonRpcMessage } from './transport';\n\nconst SERVER_INFO = { name: 'kirograph', version: '0.1.0' };\nconst PROTOCOL_VERSION = '2024-11-05';\n\nexport class MCPServer {\n private transport = new StdioTransport();\n private cg: KiroGraph | null = null;\n private toolHandler: ToolHandler;\n private projectPath: string | null;\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n private config: any | null = null;\n\n constructor(projectPath?: string) {\n // Normalize to absolute path immediately to prevent any path traversal\n this.projectPath = projectPath ? path.resolve(projectPath) : null;\n this.toolHandler = new ToolHandler(null);\n }\n\n async start(): Promise<void> {\n this.transport.start(this.handleMessage.bind(this));\n process.on('SIGINT', () => this.stop());\n process.on('SIGTERM', () => this.stop());\n process.stdin.on('end', () => this.stop());\n process.stdin.on('close', () => this.stop());\n }\n\n private async tryInit(projectPath: string): Promise<void> {\n const root = findNearestKiroGraphRoot(projectPath);\n if (!root) { this.projectPath = projectPath; return; }\n this.projectPath = root;\n try {\n this.cg = await KiroGraph.open(root);\n this.toolHandler.setDefaultKiroGraph(this.cg);\n } catch (err) {\n process.stderr.write(`[KiroGraph MCP] Failed to open ${root}: ${err}\\n`);\n }\n try {\n const { loadConfig } = await Promise.resolve().then(() => require('../config.js'));\n this.config = await loadConfig(root);\n } catch {\n // config is optional \u2014 proceed without it\n }\n }\n\n private async handleMessage(msg: JsonRpcMessage): Promise<unknown> {\n const req = msg as any;\n\n switch (req.method) {\n case 'initialize': {\n const rootUri = req.params?.rootUri ?? req.params?.workspaceFolders?.[0]?.uri;\n
|
|
5
|
-
"mappings": ";;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAKA,WAAsB;AACtB,eAAoD;AACpD,uBAA2C;AAC3C,mBAAgE;AAChE,oBAA8B;AAG9B,MAAM,cAAc,EAAE,MAAM,aAAa,SAAS,QAAQ;AAC1D,MAAM,mBAAmB;AAElB,MAAM,UAAU;AAAA,
|
|
4
|
+
"sourcesContent": ["/**\n * KiroGraph MCP Server\n * Implements the Model Context Protocol over stdio.\n */\n\nimport * as path from 'path';\nimport KiroGraph, { findNearestKiroGraphRoot } from '../index';\nimport { StdioTransport, ErrorCodes } from './transport';\nimport { tools, ToolHandler, LIVE_SEARCH_TOOL_DEFINITION } from './tools';\nimport { FEATURE_TOOL_SETS } from './tool-names';\nimport { PatternRunner } from '../patterns/runner';\nimport type { JsonRpcMessage } from './transport';\n\nconst SERVER_INFO = { name: 'kirograph', version: '0.1.0' };\nconst PROTOCOL_VERSION = '2024-11-05';\n\nexport class MCPServer {\n private transport = new StdioTransport();\n private cg: KiroGraph | null = null;\n private toolHandler: ToolHandler;\n private projectPath: string | null;\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n private config: any | null = null;\n private enabledTools: typeof tools = [];\n private enabledToolNames = new Set<string>();\n\n constructor(projectPath?: string) {\n // Normalize to absolute path immediately to prevent any path traversal\n this.projectPath = projectPath ? path.resolve(projectPath) : null;\n this.toolHandler = new ToolHandler(null);\n this.setEnabledTools(); // default: all tools until config loads\n }\n\n async start(): Promise<void> {\n // Load config before the transport starts so tools/list is never served stale.\n if (this.projectPath) await this.tryInit(this.projectPath);\n this.transport.start(this.handleMessage.bind(this));\n process.on('SIGINT', () => this.stop());\n process.on('SIGTERM', () => this.stop());\n process.stdin.on('end', () => this.stop());\n process.stdin.on('close', () => this.stop());\n }\n\n private async tryInit(projectPath: string): Promise<void> {\n const root = findNearestKiroGraphRoot(projectPath);\n if (!root) { this.projectPath = projectPath; return; }\n this.projectPath = root;\n try {\n this.cg = await KiroGraph.open(root);\n this.toolHandler.setDefaultKiroGraph(this.cg);\n } catch (err) {\n process.stderr.write(`[KiroGraph MCP] Failed to open ${root}: ${err}\\n`);\n }\n try {\n const { loadConfig } = await Promise.resolve().then(() => require('../config.js'));\n this.config = await loadConfig(root);\n } catch {\n // config is optional \u2014 proceed without it\n }\n this.setEnabledTools();\n }\n\n private async handleMessage(msg: JsonRpcMessage): Promise<unknown> {\n const req = msg as any;\n\n switch (req.method) {\n case 'initialize': {\n // If start() already loaded config from --path, skip re-init.\n // If no config yet (no --path), try the rootUri sent by the IDE.\n if (!this.config) {\n const rootUri = req.params?.rootUri ?? req.params?.workspaceFolders?.[0]?.uri;\n if (rootUri) {\n const p = rootUri.startsWith('file://') ? decodeURIComponent(rootUri.replace(/^file:\\/\\/\\/?/, '')) : rootUri;\n await this.tryInit(p);\n }\n }\n return {\n protocolVersion: PROTOCOL_VERSION,\n capabilities: { tools: {} },\n serverInfo: SERVER_INFO,\n };\n }\n\n case 'tools/list': {\n return { tools: this.enabledTools };\n }\n\n case 'tools/call': {\n const { name, arguments: args = {} } = req.params ?? {};\n if (!this.enabledToolNames.has(name)) {\n return {\n content: [{ type: 'text', text: `Tool \"${name}\" is not available. The feature it belongs to is not enabled in .kirograph/config.json.` }],\n isError: true,\n };\n }\n try {\n return await this.toolHandler.handle(name, args);\n } catch (err) {\n return {\n content: [{ type: 'text', text: `Error: ${err instanceof Error ? err.message : String(err)}` }],\n isError: true,\n };\n }\n }\n\n case 'notifications/initialized':\n case 'ping':\n return {};\n\n default:\n this.transport.sendError(req.id, ErrorCodes.MethodNotFound, `Unknown method: ${req.method}`);\n return undefined;\n }\n }\n\n private setEnabledTools(): void {\n // Only exclude a tool when its feature flag is explicitly false.\n // undefined = not in config (old install) = keep the tool.\n const hidden = new Set<string>();\n if (this.config) {\n for (const [flag, names] of Object.entries(FEATURE_TOOL_SETS)) {\n if (this.config[flag] === false) {\n for (const n of names) hidden.add(n);\n }\n }\n }\n const list = tools.filter(t => !hidden.has(t.name));\n if (this.config?.enablePatterns && new PatternRunner().isAvailable()) {\n list.push(LIVE_SEARCH_TOOL_DEFINITION);\n }\n this.enabledTools = list;\n this.enabledToolNames = new Set(list.map(t => t.name));\n }\n\n private stop(): void {\n this.cg?.close();\n this.toolHandler.closeAll();\n process.exit(0);\n }\n}\n"],
|
|
5
|
+
"mappings": ";;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAKA,WAAsB;AACtB,eAAoD;AACpD,uBAA2C;AAC3C,mBAAgE;AAChE,wBAAkC;AAClC,oBAA8B;AAG9B,MAAM,cAAc,EAAE,MAAM,aAAa,SAAS,QAAQ;AAC1D,MAAM,mBAAmB;AAElB,MAAM,UAAU;AAAA,EAUrB,YAAY,aAAsB;AATlC,SAAQ,YAAY,IAAI,gCAAe;AACvC,SAAQ,KAAuB;AAI/B;AAAA,SAAQ,SAAqB;AAC7B,SAAQ,eAA6B,CAAC;AACtC,SAAQ,mBAAmB,oBAAI,IAAY;AAIzC,SAAK,cAAc,cAAc,KAAK,QAAQ,WAAW,IAAI;AAC7D,SAAK,cAAc,IAAI,yBAAY,IAAI;AACvC,SAAK,gBAAgB;AAAA,EACvB;AAAA,EAEA,MAAM,QAAuB;AAE3B,QAAI,KAAK,YAAa,OAAM,KAAK,QAAQ,KAAK,WAAW;AACzD,SAAK,UAAU,MAAM,KAAK,cAAc,KAAK,IAAI,CAAC;AAClD,YAAQ,GAAG,UAAU,MAAM,KAAK,KAAK,CAAC;AACtC,YAAQ,GAAG,WAAW,MAAM,KAAK,KAAK,CAAC;AACvC,YAAQ,MAAM,GAAG,OAAO,MAAM,KAAK,KAAK,CAAC;AACzC,YAAQ,MAAM,GAAG,SAAS,MAAM,KAAK,KAAK,CAAC;AAAA,EAC7C;AAAA,EAEA,MAAc,QAAQ,aAAoC;AACxD,UAAM,WAAO,mCAAyB,WAAW;AACjD,QAAI,CAAC,MAAM;AAAE,WAAK,cAAc;AAAa;AAAA,IAAQ;AACrD,SAAK,cAAc;AACnB,QAAI;AACF,WAAK,KAAK,MAAM,SAAAA,QAAU,KAAK,IAAI;AACnC,WAAK,YAAY,oBAAoB,KAAK,EAAE;AAAA,IAC9C,SAAS,KAAK;AACZ,cAAQ,OAAO,MAAM,kCAAkC,IAAI,KAAK,GAAG;AAAA,CAAI;AAAA,IACzE;AACA,QAAI;AACF,YAAM,EAAE,WAAW,IAAI,MAAM,QAAQ,QAAQ,EAAE,KAAK,MAAM,QAAQ,cAAc,CAAC;AACjF,WAAK,SAAS,MAAM,WAAW,IAAI;AAAA,IACrC,QAAQ;AAAA,IAER;AACA,SAAK,gBAAgB;AAAA,EACvB;AAAA,EAEA,MAAc,cAAc,KAAuC;AACjE,UAAM,MAAM;AAEZ,YAAQ,IAAI,QAAQ;AAAA,MAClB,KAAK,cAAc;AAGjB,YAAI,CAAC,KAAK,QAAQ;AAChB,gBAAM,UAAU,IAAI,QAAQ,WAAW,IAAI,QAAQ,mBAAmB,CAAC,GAAG;AAC1E,cAAI,SAAS;AACX,kBAAM,IAAI,QAAQ,WAAW,SAAS,IAAI,mBAAmB,QAAQ,QAAQ,iBAAiB,EAAE,CAAC,IAAI;AACrG,kBAAM,KAAK,QAAQ,CAAC;AAAA,UACtB;AAAA,QACF;AACA,eAAO;AAAA,UACL,iBAAiB;AAAA,UACjB,cAAc,EAAE,OAAO,CAAC,EAAE;AAAA,UAC1B,YAAY;AAAA,QACd;AAAA,MACF;AAAA,MAEA,KAAK,cAAc;AACjB,eAAO,EAAE,OAAO,KAAK,aAAa;AAAA,MACpC;AAAA,MAEA,KAAK,cAAc;AACjB,cAAM,EAAE,MAAM,WAAW,OAAO,CAAC,EAAE,IAAI,IAAI,UAAU,CAAC;AACtD,YAAI,CAAC,KAAK,iBAAiB,IAAI,IAAI,GAAG;AACpC,iBAAO;AAAA,YACL,SAAS,CAAC,EAAE,MAAM,QAAQ,MAAM,SAAS,IAAI,0FAA0F,CAAC;AAAA,YACxI,SAAS;AAAA,UACX;AAAA,QACF;AACA,YAAI;AACF,iBAAO,MAAM,KAAK,YAAY,OAAO,MAAM,IAAI;AAAA,QACjD,SAAS,KAAK;AACZ,iBAAO;AAAA,YACL,SAAS,CAAC,EAAE,MAAM,QAAQ,MAAM,UAAU,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,CAAC,GAAG,CAAC;AAAA,YAC9F,SAAS;AAAA,UACX;AAAA,QACF;AAAA,MACF;AAAA,MAEA,KAAK;AAAA,MACL,KAAK;AACH,eAAO,CAAC;AAAA,MAEV;AACE,aAAK,UAAU,UAAU,IAAI,IAAI,4BAAW,gBAAgB,mBAAmB,IAAI,MAAM,EAAE;AAC3F,eAAO;AAAA,IACX;AAAA,EACF;AAAA,EAEQ,kBAAwB;AAG9B,UAAM,SAAS,oBAAI,IAAY;AAC/B,QAAI,KAAK,QAAQ;AACf,iBAAW,CAAC,MAAM,KAAK,KAAK,OAAO,QAAQ,mCAAiB,GAAG;AAC7D,YAAI,KAAK,OAAO,IAAI,MAAM,OAAO;AAC/B,qBAAW,KAAK,MAAO,QAAO,IAAI,CAAC;AAAA,QACrC;AAAA,MACF;AAAA,IACF;AACA,UAAM,OAAO,mBAAM,OAAO,OAAK,CAAC,OAAO,IAAI,EAAE,IAAI,CAAC;AAClD,QAAI,KAAK,QAAQ,kBAAkB,IAAI,4BAAc,EAAE,YAAY,GAAG;AACpE,WAAK,KAAK,wCAA2B;AAAA,IACvC;AACA,SAAK,eAAe;AACpB,SAAK,mBAAmB,IAAI,IAAI,KAAK,IAAI,OAAK,EAAE,IAAI,CAAC;AAAA,EACvD;AAAA,EAEQ,OAAa;AACnB,SAAK,IAAI,MAAM;AACf,SAAK,YAAY,SAAS;AAC1B,YAAQ,KAAK,CAAC;AAAA,EAChB;AACF;",
|
|
6
6
|
"names": ["KiroGraph"]
|
|
7
7
|
}
|